./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/forester-heap/sll-buckets-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/forester-heap/sll-buckets-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c6b726a83620fff2a21a6dbfdec50e244c1786dd86dd76b1719515a59b3627ac --- 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-6b4ec56 [2022-11-20 11:32:10,107 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 11:32:10,110 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 11:32:10,145 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 11:32:10,149 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 11:32:10,154 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 11:32:10,156 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 11:32:10,160 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 11:32:10,163 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 11:32:10,169 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 11:32:10,172 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 11:32:10,175 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 11:32:10,175 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 11:32:10,178 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 11:32:10,183 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 11:32:10,185 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 11:32:10,187 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 11:32:10,188 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 11:32:10,190 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 11:32:10,195 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 11:32:10,198 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 11:32:10,200 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 11:32:10,203 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 11:32:10,204 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 11:32:10,214 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 11:32:10,218 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 11:32:10,218 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 11:32:10,221 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 11:32:10,222 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 11:32:10,223 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 11:32:10,224 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 11:32:10,225 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 11:32:10,227 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 11:32:10,229 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 11:32:10,230 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 11:32:10,231 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 11:32:10,231 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 11:32:10,232 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 11:32:10,232 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 11:32:10,233 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 11:32:10,234 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 11:32:10,234 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-20 11:32:10,280 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 11:32:10,281 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 11:32:10,281 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 11:32:10,282 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 11:32:10,283 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 11:32:10,283 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 11:32:10,284 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 11:32:10,284 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 11:32:10,284 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 11:32:10,284 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 11:32:10,285 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 11:32:10,286 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 11:32:10,286 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 11:32:10,286 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 11:32:10,286 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 11:32:10,286 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 11:32:10,287 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 11:32:10,287 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 11:32:10,287 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 11:32:10,287 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 11:32:10,287 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 11:32:10,288 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 11:32:10,288 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 11:32:10,288 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 11:32:10,288 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 11:32:10,289 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 11:32:10,289 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 11:32:10,289 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 11:32:10,290 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 11:32:10,290 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 11:32:10,290 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 11:32:10,290 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 11:32:10,291 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 11:32:10,291 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_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/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_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN 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 ! call(reach_error())) ) 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 -> c6b726a83620fff2a21a6dbfdec50e244c1786dd86dd76b1719515a59b3627ac [2022-11-20 11:32:10,686 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 11:32:10,711 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 11:32:10,714 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 11:32:10,715 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 11:32:10,716 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 11:32:10,717 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/forester-heap/sll-buckets-1.i [2022-11-20 11:32:13,998 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 11:32:14,348 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 11:32:14,349 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/sv-benchmarks/c/forester-heap/sll-buckets-1.i [2022-11-20 11:32:14,378 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/data/da3b93055/990f4cbae7114f95864b224fcb1b5ccb/FLAG81e976896 [2022-11-20 11:32:14,398 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/data/da3b93055/990f4cbae7114f95864b224fcb1b5ccb [2022-11-20 11:32:14,407 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 11:32:14,410 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 11:32:14,414 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 11:32:14,414 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 11:32:14,423 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 11:32:14,424 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:32:14" (1/1) ... [2022-11-20 11:32:14,426 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66d2e4ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:32:14, skipping insertion in model container [2022-11-20 11:32:14,426 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:32:14" (1/1) ... [2022-11-20 11:32:14,435 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 11:32:14,501 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 11:32:14,811 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/sv-benchmarks/c/forester-heap/sll-buckets-1.i[22663,22676] [2022-11-20 11:32:14,824 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/sv-benchmarks/c/forester-heap/sll-buckets-1.i[22734,22747] [2022-11-20 11:32:14,826 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/sv-benchmarks/c/forester-heap/sll-buckets-1.i[22862,22875] [2022-11-20 11:32:14,830 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/sv-benchmarks/c/forester-heap/sll-buckets-1.i[23275,23288] [2022-11-20 11:32:14,832 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/sv-benchmarks/c/forester-heap/sll-buckets-1.i[23364,23377] [2022-11-20 11:32:14,846 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 11:32:14,859 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 11:32:14,931 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/sv-benchmarks/c/forester-heap/sll-buckets-1.i[22663,22676] [2022-11-20 11:32:14,938 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/sv-benchmarks/c/forester-heap/sll-buckets-1.i[22734,22747] [2022-11-20 11:32:14,941 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/sv-benchmarks/c/forester-heap/sll-buckets-1.i[22862,22875] [2022-11-20 11:32:14,955 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/sv-benchmarks/c/forester-heap/sll-buckets-1.i[23275,23288] [2022-11-20 11:32:14,956 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/sv-benchmarks/c/forester-heap/sll-buckets-1.i[23364,23377] [2022-11-20 11:32:14,960 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 11:32:14,999 INFO L208 MainTranslator]: Completed translation [2022-11-20 11:32:15,000 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:32:14 WrapperNode [2022-11-20 11:32:15,000 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 11:32:15,002 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 11:32:15,002 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 11:32:15,003 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 11:32:15,012 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:32:14" (1/1) ... [2022-11-20 11:32:15,029 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:32:14" (1/1) ... [2022-11-20 11:32:15,052 INFO L138 Inliner]: procedures = 119, calls = 42, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 155 [2022-11-20 11:32:15,053 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 11:32:15,054 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 11:32:15,054 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 11:32:15,054 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 11:32:15,065 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:32:14" (1/1) ... [2022-11-20 11:32:15,065 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:32:14" (1/1) ... [2022-11-20 11:32:15,072 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:32:14" (1/1) ... [2022-11-20 11:32:15,072 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:32:14" (1/1) ... [2022-11-20 11:32:15,090 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:32:14" (1/1) ... [2022-11-20 11:32:15,112 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:32:14" (1/1) ... [2022-11-20 11:32:15,114 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:32:14" (1/1) ... [2022-11-20 11:32:15,115 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:32:14" (1/1) ... [2022-11-20 11:32:15,119 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 11:32:15,120 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 11:32:15,120 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 11:32:15,120 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 11:32:15,121 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:32:14" (1/1) ... [2022-11-20 11:32:15,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 11:32:15,152 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:32:15,165 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 11:32:15,167 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 11:32:15,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 11:32:15,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 11:32:15,204 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-20 11:32:15,204 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 11:32:15,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-20 11:32:15,205 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-20 11:32:15,205 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 11:32:15,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 11:32:15,205 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 11:32:15,205 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 11:32:15,432 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 11:32:15,435 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 11:32:16,122 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 11:32:16,131 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 11:32:16,131 INFO L300 CfgBuilder]: Removed 15 assume(true) statements. [2022-11-20 11:32:16,134 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:32:16 BoogieIcfgContainer [2022-11-20 11:32:16,134 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 11:32:16,138 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 11:32:16,138 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 11:32:16,142 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 11:32:16,142 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 11:32:14" (1/3) ... [2022-11-20 11:32:16,143 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e9be7e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:32:16, skipping insertion in model container [2022-11-20 11:32:16,143 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:32:14" (2/3) ... [2022-11-20 11:32:16,144 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e9be7e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:32:16, skipping insertion in model container [2022-11-20 11:32:16,144 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:32:16" (3/3) ... [2022-11-20 11:32:16,146 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-buckets-1.i [2022-11-20 11:32:16,169 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 11:32:16,169 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2022-11-20 11:32:16,222 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 11:32:16,229 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=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@2b26cc69, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 11:32:16,230 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-11-20 11:32:16,234 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 38 states have (on average 1.868421052631579) internal successors, (71), 43 states have internal predecessors, (71), 0 states have call successors, (0), 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-20 11:32:16,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-20 11:32:16,241 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:32:16,241 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:32:16,242 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-11-20 11:32:16,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:32:16,248 INFO L85 PathProgramCache]: Analyzing trace with hash 179510098, now seen corresponding path program 1 times [2022-11-20 11:32:16,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:32:16,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138996456] [2022-11-20 11:32:16,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:32:16,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:32:16,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:32:16,742 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-20 11:32:16,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:32:16,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138996456] [2022-11-20 11:32:16,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138996456] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:32:16,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:32:16,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 11:32:16,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962876750] [2022-11-20 11:32:16,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:32:16,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:32:16,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:32:16,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:32:16,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:32:16,794 INFO L87 Difference]: Start difference. First operand has 44 states, 38 states have (on average 1.868421052631579) internal successors, (71), 43 states have internal predecessors, (71), 0 states have call successors, (0), 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 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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-20 11:32:16,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:32:16,929 INFO L93 Difference]: Finished difference Result 112 states and 188 transitions. [2022-11-20 11:32:16,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 11:32:16,932 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-11-20 11:32:16,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:32:16,942 INFO L225 Difference]: With dead ends: 112 [2022-11-20 11:32:16,943 INFO L226 Difference]: Without dead ends: 66 [2022-11-20 11:32:16,946 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-20 11:32:16,951 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 94 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:32:16,952 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 84 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:32:16,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-11-20 11:32:16,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 41. [2022-11-20 11:32:16,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 40 states have internal predecessors, (49), 0 states have call successors, (0), 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-20 11:32:16,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2022-11-20 11:32:17,001 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 8 [2022-11-20 11:32:17,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:32:17,002 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2022-11-20 11:32:17,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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-20 11:32:17,002 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2022-11-20 11:32:17,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-20 11:32:17,003 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:32:17,004 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:32:17,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 11:32:17,005 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-11-20 11:32:17,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:32:17,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1306111283, now seen corresponding path program 1 times [2022-11-20 11:32:17,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:32:17,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404337758] [2022-11-20 11:32:17,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:32:17,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:32:17,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:32:17,189 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-20 11:32:17,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:32:17,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404337758] [2022-11-20 11:32:17,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404337758] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:32:17,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:32:17,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:32:17,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359372399] [2022-11-20 11:32:17,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:32:17,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:32:17,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:32:17,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:32:17,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:32:17,194 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 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-20 11:32:17,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:32:17,260 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2022-11-20 11:32:17,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:32:17,261 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 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-20 11:32:17,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:32:17,262 INFO L225 Difference]: With dead ends: 45 [2022-11-20 11:32:17,262 INFO L226 Difference]: Without dead ends: 43 [2022-11-20 11:32:17,263 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-20 11:32:17,264 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 7 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:32:17,265 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 68 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:32:17,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-11-20 11:32:17,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2022-11-20 11:32:17,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 38 states have internal predecessors, (47), 0 states have call successors, (0), 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-20 11:32:17,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2022-11-20 11:32:17,273 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 9 [2022-11-20 11:32:17,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:32:17,273 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2022-11-20 11:32:17,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 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-20 11:32:17,274 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2022-11-20 11:32:17,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-20 11:32:17,274 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:32:17,275 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:32:17,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 11:32:17,275 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-11-20 11:32:17,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:32:17,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1834780084, now seen corresponding path program 1 times [2022-11-20 11:32:17,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:32:17,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847830612] [2022-11-20 11:32:17,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:32:17,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:32:17,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:32:18,336 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-20 11:32:18,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:32:18,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847830612] [2022-11-20 11:32:18,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847830612] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:32:18,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:32:18,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 11:32:18,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003256765] [2022-11-20 11:32:18,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:32:18,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 11:32:18,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:32:18,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 11:32:18,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:32:18,349 INFO L87 Difference]: Start difference. First operand 39 states and 47 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 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-20 11:32:18,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:32:18,605 INFO L93 Difference]: Finished difference Result 61 states and 74 transitions. [2022-11-20 11:32:18,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 11:32:18,608 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2022-11-20 11:32:18,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:32:18,614 INFO L225 Difference]: With dead ends: 61 [2022-11-20 11:32:18,615 INFO L226 Difference]: Without dead ends: 50 [2022-11-20 11:32:18,615 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-20 11:32:18,619 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 32 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:32:18,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 94 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:32:18,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-11-20 11:32:18,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 44. [2022-11-20 11:32:18,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 43 states have internal predecessors, (53), 0 states have call successors, (0), 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-20 11:32:18,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2022-11-20 11:32:18,655 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 10 [2022-11-20 11:32:18,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:32:18,655 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2022-11-20 11:32:18,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 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-20 11:32:18,656 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2022-11-20 11:32:18,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-20 11:32:18,657 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:32:18,657 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:32:18,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 11:32:18,658 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-11-20 11:32:18,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:32:18,667 INFO L85 PathProgramCache]: Analyzing trace with hash 710639734, now seen corresponding path program 1 times [2022-11-20 11:32:18,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:32:18,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250423797] [2022-11-20 11:32:18,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:32:18,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:32:18,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:32:18,755 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-20 11:32:18,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:32:18,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250423797] [2022-11-20 11:32:18,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250423797] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:32:18,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:32:18,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:32:18,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162793385] [2022-11-20 11:32:18,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:32:18,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:32:18,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:32:18,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:32:18,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:32:18,766 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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-20 11:32:18,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:32:18,851 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2022-11-20 11:32:18,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:32:18,852 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2022-11-20 11:32:18,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:32:18,853 INFO L225 Difference]: With dead ends: 45 [2022-11-20 11:32:18,854 INFO L226 Difference]: Without dead ends: 43 [2022-11-20 11:32:18,856 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-20 11:32:18,859 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 22 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:32:18,862 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 51 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:32:18,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-11-20 11:32:18,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2022-11-20 11:32:18,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 40 states have (on average 1.275) internal successors, (51), 41 states have internal predecessors, (51), 0 states have call successors, (0), 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-20 11:32:18,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2022-11-20 11:32:18,872 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 51 transitions. Word has length 10 [2022-11-20 11:32:18,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:32:18,873 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 51 transitions. [2022-11-20 11:32:18,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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-20 11:32:18,874 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2022-11-20 11:32:18,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-20 11:32:18,874 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:32:18,875 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:32:18,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 11:32:18,875 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-11-20 11:32:18,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:32:18,876 INFO L85 PathProgramCache]: Analyzing trace with hash 625501225, now seen corresponding path program 1 times [2022-11-20 11:32:18,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:32:18,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215675690] [2022-11-20 11:32:18,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:32:18,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:32:18,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:32:20,292 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-20 11:32:20,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:32:20,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215675690] [2022-11-20 11:32:20,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215675690] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:32:20,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1473130085] [2022-11-20 11:32:20,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:32:20,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:32:20,300 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:32:20,306 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:32:20,314 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 11:32:20,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:32:20,488 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 63 conjunts are in the unsatisfiable core [2022-11-20 11:32:20,498 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:32:20,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:32:20,606 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 32 [2022-11-20 11:32:20,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:32:20,622 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 36 [2022-11-20 11:32:20,689 INFO L321 Elim1Store]: treesize reduction 50, result has 25.4 percent of original size [2022-11-20 11:32:20,690 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 2 case distinctions, treesize of input 75 treesize of output 74 [2022-11-20 11:32:20,699 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 15 treesize of output 23 [2022-11-20 11:32:20,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:32:20,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:32:20,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:32:20,717 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-20 11:32:20,729 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 15 treesize of output 23 [2022-11-20 11:32:20,748 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-20 11:32:20,748 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 35 treesize of output 27 [2022-11-20 11:32:20,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:32:20,931 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 48 [2022-11-20 11:32:20,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:32:20,941 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:32:20,953 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-20 11:32:20,954 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 64 treesize of output 51 [2022-11-20 11:32:21,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:32:21,202 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:32:21,205 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:32:21,206 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 44 [2022-11-20 11:32:21,229 INFO L321 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2022-11-20 11:32:21,230 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 21 [2022-11-20 11:32:21,258 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-20 11:32:21,259 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:32:21,629 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-20 11:32:21,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1473130085] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:32:21,629 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:32:21,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2022-11-20 11:32:21,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79559870] [2022-11-20 11:32:21,630 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:32:21,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-20 11:32:21,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:32:21,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-20 11:32:21,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2022-11-20 11:32:21,636 INFO L87 Difference]: Start difference. First operand 42 states and 51 transitions. Second operand has 16 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 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-20 11:32:22,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:32:22,433 INFO L93 Difference]: Finished difference Result 74 states and 88 transitions. [2022-11-20 11:32:22,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-20 11:32:22,434 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 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 15 [2022-11-20 11:32:22,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:32:22,435 INFO L225 Difference]: With dead ends: 74 [2022-11-20 11:32:22,435 INFO L226 Difference]: Without dead ends: 63 [2022-11-20 11:32:22,436 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=117, Invalid=345, Unknown=0, NotChecked=0, Total=462 [2022-11-20 11:32:22,437 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 43 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 28 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 11:32:22,437 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 277 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 202 Invalid, 0 Unknown, 28 Unchecked, 0.5s Time] [2022-11-20 11:32:22,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-11-20 11:32:22,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 47. [2022-11-20 11:32:22,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 45 states have (on average 1.2444444444444445) internal successors, (56), 46 states have internal predecessors, (56), 0 states have call successors, (0), 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-20 11:32:22,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 56 transitions. [2022-11-20 11:32:22,450 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 56 transitions. Word has length 15 [2022-11-20 11:32:22,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:32:22,450 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 56 transitions. [2022-11-20 11:32:22,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 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-20 11:32:22,451 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2022-11-20 11:32:22,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-20 11:32:22,452 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:32:22,452 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:32:22,462 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-20 11:32:22,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:32:22,659 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-11-20 11:32:22,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:32:22,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1157082046, now seen corresponding path program 1 times [2022-11-20 11:32:22,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:32:22,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307555491] [2022-11-20 11:32:22,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:32:22,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:32:22,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:32:23,369 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-20 11:32:23,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:32:23,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307555491] [2022-11-20 11:32:23,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307555491] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:32:23,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [296856369] [2022-11-20 11:32:23,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:32:23,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:32:23,371 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:32:23,373 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:32:23,407 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 11:32:23,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:32:23,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 42 conjunts are in the unsatisfiable core [2022-11-20 11:32:23,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:32:23,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:32:23,581 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 26 [2022-11-20 11:32:23,619 INFO L321 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2022-11-20 11:32:23,620 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 2 case distinctions, treesize of input 74 treesize of output 71 [2022-11-20 11:32:23,663 INFO L321 Elim1Store]: treesize reduction 76, result has 16.5 percent of original size [2022-11-20 11:32:23,664 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 46 [2022-11-20 11:32:23,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:32:23,747 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 41 treesize of output 37 [2022-11-20 11:32:23,775 INFO L321 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-11-20 11:32:23,776 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2022-11-20 11:32:23,839 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 40 treesize of output 36 [2022-11-20 11:32:23,975 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:32:23,976 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 15 [2022-11-20 11:32:23,985 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-20 11:32:23,985 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:32:24,130 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-20 11:32:24,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [296856369] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:32:24,131 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:32:24,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 13 [2022-11-20 11:32:24,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439207163] [2022-11-20 11:32:24,131 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:32:24,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-20 11:32:24,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:32:24,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-20 11:32:24,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=116, Unknown=3, NotChecked=0, Total=156 [2022-11-20 11:32:24,133 INFO L87 Difference]: Start difference. First operand 47 states and 56 transitions. Second operand has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 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-20 11:32:24,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:32:24,805 INFO L93 Difference]: Finished difference Result 116 states and 142 transitions. [2022-11-20 11:32:24,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 11:32:24,806 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 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 16 [2022-11-20 11:32:24,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:32:24,807 INFO L225 Difference]: With dead ends: 116 [2022-11-20 11:32:24,807 INFO L226 Difference]: Without dead ends: 114 [2022-11-20 11:32:24,807 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=116, Invalid=261, Unknown=3, NotChecked=0, Total=380 [2022-11-20 11:32:24,808 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 162 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 72 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 11:32:24,808 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 351 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 198 Invalid, 0 Unknown, 72 Unchecked, 0.4s Time] [2022-11-20 11:32:24,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-11-20 11:32:24,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 56. [2022-11-20 11:32:24,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 55 states have internal predecessors, (68), 0 states have call successors, (0), 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-20 11:32:24,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 68 transitions. [2022-11-20 11:32:24,837 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 68 transitions. Word has length 16 [2022-11-20 11:32:24,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:32:24,837 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 68 transitions. [2022-11-20 11:32:24,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 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-20 11:32:24,838 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 68 transitions. [2022-11-20 11:32:24,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-20 11:32:24,840 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:32:24,840 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:32:24,854 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-20 11:32:25,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:32:25,048 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-11-20 11:32:25,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:32:25,049 INFO L85 PathProgramCache]: Analyzing trace with hash 442135079, now seen corresponding path program 2 times [2022-11-20 11:32:25,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:32:25,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860655849] [2022-11-20 11:32:25,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:32:25,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:32:25,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:32:25,948 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:32:25,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:32:25,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860655849] [2022-11-20 11:32:25,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860655849] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:32:25,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [710146963] [2022-11-20 11:32:25,949 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 11:32:25,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:32:25,949 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:32:25,951 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:32:25,978 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-20 11:32:26,487 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 11:32:26,487 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:32:26,490 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-20 11:32:26,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:32:26,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:32:26,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:32:26,518 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 35 [2022-11-20 11:32:26,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:32:26,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:32:26,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:32:26,529 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-11-20 11:32:26,561 INFO L321 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-11-20 11:32:26,561 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 34 [2022-11-20 11:32:26,666 INFO L321 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-11-20 11:32:26,666 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2022-11-20 11:32:26,674 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 16 treesize of output 18 [2022-11-20 11:32:26,711 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 23 treesize of output 22 [2022-11-20 11:32:26,817 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 13 [2022-11-20 11:32:26,841 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-20 11:32:26,841 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:32:26,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [710146963] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:32:26,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 11:32:26,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2022-11-20 11:32:26,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239648360] [2022-11-20 11:32:26,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:32:26,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 11:32:26,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:32:26,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 11:32:26,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-11-20 11:32:26,844 INFO L87 Difference]: Start difference. First operand 56 states and 68 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 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-20 11:32:27,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:32:27,251 INFO L93 Difference]: Finished difference Result 123 states and 151 transitions. [2022-11-20 11:32:27,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 11:32:27,252 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 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 18 [2022-11-20 11:32:27,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:32:27,252 INFO L225 Difference]: With dead ends: 123 [2022-11-20 11:32:27,252 INFO L226 Difference]: Without dead ends: 88 [2022-11-20 11:32:27,253 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2022-11-20 11:32:27,254 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 66 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 27 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 11:32:27,254 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 132 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 83 Invalid, 0 Unknown, 27 Unchecked, 0.3s Time] [2022-11-20 11:32:27,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-11-20 11:32:27,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 63. [2022-11-20 11:32:27,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 61 states have (on average 1.2295081967213115) internal successors, (75), 62 states have internal predecessors, (75), 0 states have call successors, (0), 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-20 11:32:27,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 75 transitions. [2022-11-20 11:32:27,282 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 75 transitions. Word has length 18 [2022-11-20 11:32:27,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:32:27,283 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 75 transitions. [2022-11-20 11:32:27,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 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-20 11:32:27,283 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2022-11-20 11:32:27,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-20 11:32:27,284 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:32:27,284 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:32:27,294 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-20 11:32:27,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-20 11:32:27,491 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-11-20 11:32:27,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:32:27,492 INFO L85 PathProgramCache]: Analyzing trace with hash -482453053, now seen corresponding path program 1 times [2022-11-20 11:32:27,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:32:27,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412486018] [2022-11-20 11:32:27,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:32:27,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:32:27,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:32:28,282 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:32:28,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:32:28,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412486018] [2022-11-20 11:32:28,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412486018] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:32:28,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [80836470] [2022-11-20 11:32:28,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:32:28,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:32:28,284 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:32:28,287 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:32:28,321 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-20 11:32:28,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:32:28,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 71 conjunts are in the unsatisfiable core [2022-11-20 11:32:28,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:32:28,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:32:28,540 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 32 [2022-11-20 11:32:28,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:32:28,551 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 32 [2022-11-20 11:32:28,587 INFO L321 Elim1Store]: treesize reduction 50, result has 25.4 percent of original size [2022-11-20 11:32:28,588 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 82 treesize of output 81 [2022-11-20 11:32:28,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:32:28,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:32:28,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:32:28,602 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-20 11:32:28,605 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 15 treesize of output 23 [2022-11-20 11:32:28,650 INFO L321 Elim1Store]: treesize reduction 76, result has 16.5 percent of original size [2022-11-20 11:32:28,650 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 46 [2022-11-20 11:32:28,677 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 23 [2022-11-20 11:32:28,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:32:28,840 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-20 11:32:28,841 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 102 treesize of output 78 [2022-11-20 11:32:28,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:32:28,875 INFO L321 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2022-11-20 11:32:28,876 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 37 [2022-11-20 11:32:28,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:32:28,897 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2022-11-20 11:32:29,026 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-20 11:32:29,027 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 100 treesize of output 76 [2022-11-20 11:32:29,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:32:29,037 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2022-11-20 11:32:29,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:32:29,311 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 13 [2022-11-20 11:32:29,389 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 11:32:29,389 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 26 [2022-11-20 11:32:29,398 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:32:29,398 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:32:29,479 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1043 (Array Int Int)) (v_ArrVal_1042 (Array Int Int))) (not (= (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1043))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1042) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|)) 0))) is different from false [2022-11-20 11:32:29,589 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:32:29,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [80836470] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:32:29,589 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:32:29,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2022-11-20 11:32:29,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097512343] [2022-11-20 11:32:29,590 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:32:29,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-20 11:32:29,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:32:29,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-20 11:32:29,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=222, Unknown=1, NotChecked=30, Total=306 [2022-11-20 11:32:29,592 INFO L87 Difference]: Start difference. First operand 63 states and 75 transitions. Second operand has 18 states, 18 states have (on average 2.611111111111111) internal successors, (47), 18 states have internal predecessors, (47), 0 states have call successors, (0), 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-20 11:32:35,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:32:35,002 INFO L93 Difference]: Finished difference Result 129 states and 158 transitions. [2022-11-20 11:32:35,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-20 11:32:35,002 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.611111111111111) internal successors, (47), 18 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-20 11:32:35,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:32:35,004 INFO L225 Difference]: With dead ends: 129 [2022-11-20 11:32:35,004 INFO L226 Difference]: Without dead ends: 127 [2022-11-20 11:32:35,005 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=184, Invalid=631, Unknown=1, NotChecked=54, Total=870 [2022-11-20 11:32:35,006 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 191 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 129 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-20 11:32:35,006 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 304 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 343 Invalid, 0 Unknown, 129 Unchecked, 0.7s Time] [2022-11-20 11:32:35,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-11-20 11:32:35,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 82. [2022-11-20 11:32:35,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 80 states have (on average 1.2625) internal successors, (101), 81 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-20 11:32:35,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 101 transitions. [2022-11-20 11:32:35,043 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 101 transitions. Word has length 19 [2022-11-20 11:32:35,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:32:35,044 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 101 transitions. [2022-11-20 11:32:35,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.611111111111111) internal successors, (47), 18 states have internal predecessors, (47), 0 states have call successors, (0), 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-20 11:32:35,044 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 101 transitions. [2022-11-20 11:32:35,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-20 11:32:35,045 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:32:35,045 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:32:35,070 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-11-20 11:32:35,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:32:35,246 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-11-20 11:32:35,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:32:35,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1136543444, now seen corresponding path program 2 times [2022-11-20 11:32:35,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:32:35,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412864762] [2022-11-20 11:32:35,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:32:35,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:32:35,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:32:37,266 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:32:37,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:32:37,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412864762] [2022-11-20 11:32:37,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412864762] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:32:37,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [153545802] [2022-11-20 11:32:37,267 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 11:32:37,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:32:37,268 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:32:37,269 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:32:37,303 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-20 11:32:37,894 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 11:32:37,894 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:32:37,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 76 conjunts are in the unsatisfiable core [2022-11-20 11:32:37,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:32:37,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:32:37,957 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 38 [2022-11-20 11:32:37,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:32:37,968 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 42 [2022-11-20 11:32:38,012 INFO L321 Elim1Store]: treesize reduction 62, result has 21.5 percent of original size [2022-11-20 11:32:38,013 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 2 case distinctions, treesize of input 78 treesize of output 79 [2022-11-20 11:32:38,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:32:38,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:32:38,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:32:38,029 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 44 [2022-11-20 11:32:38,041 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 15 treesize of output 23 [2022-11-20 11:32:38,050 INFO L321 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-11-20 11:32:38,050 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 59 treesize of output 43 [2022-11-20 11:32:38,065 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 19 treesize of output 31 [2022-11-20 11:32:38,076 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 19 treesize of output 31 [2022-11-20 11:32:38,090 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 15 treesize of output 23 [2022-11-20 11:32:38,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:32:38,354 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:32:38,371 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-20 11:32:38,372 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 94 treesize of output 69 [2022-11-20 11:32:38,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:32:38,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:32:38,389 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 69 [2022-11-20 11:32:38,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:32:38,685 INFO L321 Elim1Store]: treesize reduction 56, result has 16.4 percent of original size [2022-11-20 11:32:38,686 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 58 [2022-11-20 11:32:38,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:32:38,697 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:32:38,710 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-20 11:32:38,711 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 90 treesize of output 65 [2022-11-20 11:32:39,034 INFO L321 Elim1Store]: treesize reduction 33, result has 19.5 percent of original size [2022-11-20 11:32:39,034 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 7 new quantified variables, introduced 6 case distinctions, treesize of input 120 treesize of output 64 [2022-11-20 11:32:39,051 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-20 11:32:39,052 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 21 [2022-11-20 11:32:39,061 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:32:39,061 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:32:41,404 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base|))) (let ((.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base|)) (.cse4 (select .cse7 |c_ULTIMATE.start_main_~bcki~0#1.offset|))) (let ((.cse3 (+ .cse4 4)) (.cse1 (select .cse5 |c_ULTIMATE.start_main_~bcki~0#1.offset|)) (.cse6 (+ |c_ULTIMATE.start_main_~bcki~0#1.offset| 4))) (and (forall ((v_ArrVal_1253 Int) (v_ArrVal_1248 Int) (v_ArrVal_1247 Int)) (= (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base| (store .cse5 .cse6 v_ArrVal_1247)))) (let ((.cse2 (select .cse0 .cse1))) (select (store .cse0 .cse1 (store .cse2 .cse3 v_ArrVal_1253)) (select .cse2 .cse4)))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base| (store .cse7 .cse6 v_ArrVal_1248)) .cse1) .cse4) 4)) 0)) (forall ((v_ArrVal_1254 Int) (v_ArrVal_1248 Int) (v_ArrVal_1247 Int)) (= (let ((.cse8 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base| (store .cse7 .cse6 v_ArrVal_1248)))) (let ((.cse9 (select .cse8 .cse1))) (select (select (store .cse8 .cse1 (store .cse9 .cse3 v_ArrVal_1254)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base| (store .cse5 .cse6 v_ArrVal_1247)) .cse1) .cse4)) (+ (select .cse9 .cse4) 4)))) 0)))))) is different from false [2022-11-20 11:32:43,670 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-20 11:32:43,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [153545802] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:32:43,671 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:32:43,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 21 [2022-11-20 11:32:43,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192127200] [2022-11-20 11:32:43,672 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:32:43,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-20 11:32:43,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:32:43,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-20 11:32:43,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=317, Unknown=1, NotChecked=36, Total=420 [2022-11-20 11:32:43,674 INFO L87 Difference]: Start difference. First operand 82 states and 101 transitions. Second operand has 21 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 21 states have internal predecessors, (49), 0 states have call successors, (0), 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-20 11:32:44,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:32:44,912 INFO L93 Difference]: Finished difference Result 109 states and 133 transitions. [2022-11-20 11:32:44,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-20 11:32:44,913 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 21 states have internal predecessors, (49), 0 states have call successors, (0), 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 20 [2022-11-20 11:32:44,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:32:44,914 INFO L225 Difference]: With dead ends: 109 [2022-11-20 11:32:44,914 INFO L226 Difference]: Without dead ends: 98 [2022-11-20 11:32:44,915 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=107, Invalid=496, Unknown=1, NotChecked=46, Total=650 [2022-11-20 11:32:44,916 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 37 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 145 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 11:32:44,916 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 278 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 140 Invalid, 0 Unknown, 145 Unchecked, 0.4s Time] [2022-11-20 11:32:44,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-11-20 11:32:44,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 87. [2022-11-20 11:32:44,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 85 states have (on average 1.2470588235294118) internal successors, (106), 86 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-20 11:32:44,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 106 transitions. [2022-11-20 11:32:44,961 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 106 transitions. Word has length 20 [2022-11-20 11:32:44,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:32:44,962 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 106 transitions. [2022-11-20 11:32:44,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 21 states have internal predecessors, (49), 0 states have call successors, (0), 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-20 11:32:44,962 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 106 transitions. [2022-11-20 11:32:44,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-20 11:32:44,970 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:32:44,971 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:32:44,978 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-20 11:32:45,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:32:45,178 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-11-20 11:32:45,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:32:45,179 INFO L85 PathProgramCache]: Analyzing trace with hash 220535656, now seen corresponding path program 2 times [2022-11-20 11:32:45,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:32:45,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249395988] [2022-11-20 11:32:45,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:32:45,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:32:45,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:32:46,319 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-20 11:32:46,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:32:46,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249395988] [2022-11-20 11:32:46,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249395988] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:32:46,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [660980143] [2022-11-20 11:32:46,320 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 11:32:46,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:32:46,320 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:32:46,323 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:32:46,339 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-20 11:32:46,848 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 11:32:46,848 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:32:46,852 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 74 conjunts are in the unsatisfiable core [2022-11-20 11:32:46,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:32:46,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:32:46,895 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 32 [2022-11-20 11:32:46,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:32:46,909 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 26 [2022-11-20 11:32:46,953 INFO L321 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2022-11-20 11:32:46,953 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 2 case distinctions, treesize of input 104 treesize of output 99 [2022-11-20 11:32:46,965 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 40 [2022-11-20 11:32:46,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:32:46,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:32:46,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:32:46,980 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-20 11:32:46,988 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 15 treesize of output 23 [2022-11-20 11:32:47,044 INFO L321 Elim1Store]: treesize reduction 76, result has 16.5 percent of original size [2022-11-20 11:32:47,044 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 46 [2022-11-20 11:32:47,057 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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-20 11:32:47,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:32:47,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:32:47,165 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2022-11-20 11:32:47,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:32:47,180 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 57 treesize of output 51 [2022-11-20 11:32:47,211 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-20 11:32:47,211 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 1 case distinctions, treesize of input 18 treesize of output 28 [2022-11-20 11:32:47,254 INFO L321 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-11-20 11:32:47,254 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2022-11-20 11:32:47,361 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 56 treesize of output 50 [2022-11-20 11:32:47,368 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-11-20 11:32:47,381 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2022-11-20 11:32:47,758 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 33 [2022-11-20 11:32:47,863 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:32:47,864 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 13 [2022-11-20 11:32:47,930 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-20 11:32:47,931 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:32:48,155 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:32:48,156 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 35 [2022-11-20 11:32:48,294 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-20 11:32:48,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [660980143] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:32:48,296 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:32:48,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2022-11-20 11:32:48,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965408687] [2022-11-20 11:32:48,299 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:32:48,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-20 11:32:48,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:32:48,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-20 11:32:48,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=254, Unknown=2, NotChecked=0, Total=306 [2022-11-20 11:32:48,302 INFO L87 Difference]: Start difference. First operand 87 states and 106 transitions. Second operand has 18 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 18 states have internal predecessors, (46), 0 states have call successors, (0), 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-20 11:32:49,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:32:49,512 INFO L93 Difference]: Finished difference Result 156 states and 192 transitions. [2022-11-20 11:32:49,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 11:32:49,513 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 18 states have internal predecessors, (46), 0 states have call successors, (0), 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 21 [2022-11-20 11:32:49,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:32:49,514 INFO L225 Difference]: With dead ends: 156 [2022-11-20 11:32:49,514 INFO L226 Difference]: Without dead ends: 121 [2022-11-20 11:32:49,515 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=132, Invalid=466, Unknown=2, NotChecked=0, Total=600 [2022-11-20 11:32:49,516 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 102 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 55 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-20 11:32:49,516 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 251 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 301 Invalid, 0 Unknown, 55 Unchecked, 0.7s Time] [2022-11-20 11:32:49,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-11-20 11:32:49,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 96. [2022-11-20 11:32:49,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 94 states have (on average 1.2340425531914894) internal successors, (116), 95 states have internal predecessors, (116), 0 states have call successors, (0), 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-20 11:32:49,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 116 transitions. [2022-11-20 11:32:49,543 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 116 transitions. Word has length 21 [2022-11-20 11:32:49,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:32:49,544 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 116 transitions. [2022-11-20 11:32:49,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 18 states have internal predecessors, (46), 0 states have call successors, (0), 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-20 11:32:49,544 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 116 transitions. [2022-11-20 11:32:49,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-20 11:32:49,545 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:32:49,545 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:32:49,556 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-20 11:32:49,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:32:49,752 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-11-20 11:32:49,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:32:49,752 INFO L85 PathProgramCache]: Analyzing trace with hash -800532698, now seen corresponding path program 1 times [2022-11-20 11:32:49,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:32:49,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042259977] [2022-11-20 11:32:49,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:32:49,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:32:49,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:32:50,955 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:32:50,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:32:50,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042259977] [2022-11-20 11:32:50,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042259977] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:32:50,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [707377962] [2022-11-20 11:32:50,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:32:50,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:32:50,956 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:32:50,959 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:32:50,987 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-20 11:32:51,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:32:51,181 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 88 conjunts are in the unsatisfiable core [2022-11-20 11:32:51,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:32:51,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:32:51,214 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 32 [2022-11-20 11:32:51,255 INFO L321 Elim1Store]: treesize reduction 50, result has 25.4 percent of original size [2022-11-20 11:32:51,255 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 2 case distinctions, treesize of input 95 treesize of output 94 [2022-11-20 11:32:51,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:32:51,265 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 36 [2022-11-20 11:32:51,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:32:51,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:32:51,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:32:51,277 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 38 [2022-11-20 11:32:51,320 INFO L321 Elim1Store]: treesize reduction 76, result has 16.5 percent of original size [2022-11-20 11:32:51,320 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 46 [2022-11-20 11:32:51,330 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 23 [2022-11-20 11:32:51,341 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 46 [2022-11-20 11:32:51,368 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 15 treesize of output 23 [2022-11-20 11:32:51,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:32:51,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:32:51,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:32:51,487 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 42 [2022-11-20 11:32:51,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:32:51,515 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-20 11:32:51,515 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 94 treesize of output 76 [2022-11-20 11:32:51,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:32:51,552 INFO L321 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2022-11-20 11:32:51,553 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 37 [2022-11-20 11:32:51,572 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-20 11:32:51,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:32:51,681 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 42 [2022-11-20 11:32:51,700 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-20 11:32:51,700 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 92 treesize of output 74 [2022-11-20 11:32:51,713 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2022-11-20 11:32:52,289 INFO L321 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-11-20 11:32:52,290 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 116 treesize of output 62 [2022-11-20 11:32:52,309 INFO L321 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2022-11-20 11:32:52,310 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 22 [2022-11-20 11:32:52,354 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 13 [2022-11-20 11:32:52,399 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:32:52,400 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:32:52,568 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1655 (Array Int Int)) (v_ArrVal_1654 (Array Int Int)) (|ULTIMATE.start_main_~item~0#1.offset| Int)) (= (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1655)) (.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1654))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~item~0#1.base|) (+ 4 |ULTIMATE.start_main_~item~0#1.offset|) 2)) (select (select .cse0 .cse1) .cse2)) (+ 8 (select (select .cse3 .cse1) .cse2))))) 2)) is different from false [2022-11-20 11:32:52,588 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:32:52,588 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 63 [2022-11-20 11:32:52,722 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:32:52,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [707377962] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:32:52,723 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:32:52,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 23 [2022-11-20 11:32:52,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88536677] [2022-11-20 11:32:52,723 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:32:52,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-20 11:32:52,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:32:52,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-20 11:32:52,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=402, Unknown=1, NotChecked=40, Total=506 [2022-11-20 11:32:52,725 INFO L87 Difference]: Start difference. First operand 96 states and 116 transitions. Second operand has 23 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 23 states have internal predecessors, (53), 0 states have call successors, (0), 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-20 11:32:54,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:32:54,360 INFO L93 Difference]: Finished difference Result 168 states and 207 transitions. [2022-11-20 11:32:54,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 11:32:54,361 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 23 states have internal predecessors, (53), 0 states have call successors, (0), 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 21 [2022-11-20 11:32:54,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:32:54,361 INFO L225 Difference]: With dead ends: 168 [2022-11-20 11:32:54,362 INFO L226 Difference]: Without dead ends: 133 [2022-11-20 11:32:54,362 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=163, Invalid=710, Unknown=1, NotChecked=56, Total=930 [2022-11-20 11:32:54,363 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 182 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 234 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-20 11:32:54,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 393 Invalid, 791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 536 Invalid, 0 Unknown, 234 Unchecked, 1.0s Time] [2022-11-20 11:32:54,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-11-20 11:32:54,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 96. [2022-11-20 11:32:54,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 94 states have (on average 1.2340425531914894) internal successors, (116), 95 states have internal predecessors, (116), 0 states have call successors, (0), 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-20 11:32:54,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 116 transitions. [2022-11-20 11:32:54,390 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 116 transitions. Word has length 21 [2022-11-20 11:32:54,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:32:54,390 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 116 transitions. [2022-11-20 11:32:54,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 23 states have internal predecessors, (53), 0 states have call successors, (0), 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-20 11:32:54,390 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 116 transitions. [2022-11-20 11:32:54,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-20 11:32:54,391 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:32:54,391 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] [2022-11-20 11:32:54,403 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-20 11:32:54,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:32:54,598 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-11-20 11:32:54,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:32:54,598 INFO L85 PathProgramCache]: Analyzing trace with hash -962615628, now seen corresponding path program 1 times [2022-11-20 11:32:54,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:32:54,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411327955] [2022-11-20 11:32:54,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:32:54,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:32:54,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:32:55,739 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-20 11:32:55,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:32:55,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411327955] [2022-11-20 11:32:55,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411327955] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:32:55,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2077330003] [2022-11-20 11:32:55,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:32:55,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:32:55,740 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:32:55,741 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:32:55,762 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-20 11:32:55,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:32:55,979 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 62 conjunts are in the unsatisfiable core [2022-11-20 11:32:55,985 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:32:56,017 INFO L321 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2022-11-20 11:32:56,018 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 23 [2022-11-20 11:32:56,107 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-20 11:32:56,108 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 11:32:56,147 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 13 treesize of output 9 [2022-11-20 11:32:56,431 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 13 treesize of output 9 [2022-11-20 11:32:56,438 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 29 [2022-11-20 11:32:56,445 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 13 treesize of output 9 [2022-11-20 11:32:56,573 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-20 11:32:56,581 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2022-11-20 11:32:56,585 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2022-11-20 11:32:56,677 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2022-11-20 11:32:56,681 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-20 11:32:56,681 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:32:56,845 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 166 treesize of output 160 [2022-11-20 11:32:56,851 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 286 treesize of output 274 [2022-11-20 11:33:14,027 WARN L233 SmtUtils]: Spent 16.33s on a formula simplification. DAG size of input: 61 DAG size of output: 29 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 11:33:14,377 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 109 treesize of output 91 [2022-11-20 11:33:14,476 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-20 11:33:14,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2077330003] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:33:14,477 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:33:14,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 13] total 29 [2022-11-20 11:33:14,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848944782] [2022-11-20 11:33:14,477 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:33:14,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-20 11:33:14,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:33:14,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-20 11:33:14,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=703, Unknown=0, NotChecked=0, Total=812 [2022-11-20 11:33:14,479 INFO L87 Difference]: Start difference. First operand 96 states and 116 transitions. Second operand has 29 states, 29 states have (on average 2.2413793103448274) internal successors, (65), 29 states have internal predecessors, (65), 0 states have call successors, (0), 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-20 11:33:15,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:33:15,510 INFO L93 Difference]: Finished difference Result 129 states and 156 transitions. [2022-11-20 11:33:15,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-20 11:33:15,511 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.2413793103448274) internal successors, (65), 29 states have internal predecessors, (65), 0 states have call successors, (0), 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 24 [2022-11-20 11:33:15,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:33:15,512 INFO L225 Difference]: With dead ends: 129 [2022-11-20 11:33:15,512 INFO L226 Difference]: Without dead ends: 127 [2022-11-20 11:33:15,512 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 32 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 18.1s TimeCoverageRelationStatistics Valid=226, Invalid=1180, Unknown=0, NotChecked=0, Total=1406 [2022-11-20 11:33:15,513 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 158 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 223 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-20 11:33:15,513 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 357 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 325 Invalid, 0 Unknown, 223 Unchecked, 0.6s Time] [2022-11-20 11:33:15,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-11-20 11:33:15,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 101. [2022-11-20 11:33:15,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 99 states have (on average 1.2323232323232323) internal successors, (122), 100 states have internal predecessors, (122), 0 states have call successors, (0), 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-20 11:33:15,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 122 transitions. [2022-11-20 11:33:15,542 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 122 transitions. Word has length 24 [2022-11-20 11:33:15,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:33:15,542 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 122 transitions. [2022-11-20 11:33:15,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.2413793103448274) internal successors, (65), 29 states have internal predecessors, (65), 0 states have call successors, (0), 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-20 11:33:15,543 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 122 transitions. [2022-11-20 11:33:15,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-20 11:33:15,543 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:33:15,543 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:33:15,549 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-20 11:33:15,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-20 11:33:15,748 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-11-20 11:33:15,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:33:15,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1317906679, now seen corresponding path program 3 times [2022-11-20 11:33:15,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:33:15,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451144526] [2022-11-20 11:33:15,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:33:15,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:33:15,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:33:16,864 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:33:16,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:33:16,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451144526] [2022-11-20 11:33:16,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451144526] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:33:16,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [335351675] [2022-11-20 11:33:16,865 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 11:33:16,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:33:16,865 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:33:16,866 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:33:16,890 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-20 11:33:18,208 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-20 11:33:18,208 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:33:18,211 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 79 conjunts are in the unsatisfiable core [2022-11-20 11:33:18,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:33:18,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:33:18,243 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 38 [2022-11-20 11:33:18,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:33:18,253 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 42 [2022-11-20 11:33:18,288 INFO L321 Elim1Store]: treesize reduction 62, result has 21.5 percent of original size [2022-11-20 11:33:18,289 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 2 case distinctions, treesize of input 78 treesize of output 79 [2022-11-20 11:33:18,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:33:18,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:33:18,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:33:18,301 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 44 [2022-11-20 11:33:18,314 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 15 treesize of output 23 [2022-11-20 11:33:18,318 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 19 treesize of output 31 [2022-11-20 11:33:18,332 INFO L321 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-11-20 11:33:18,332 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 59 treesize of output 43 [2022-11-20 11:33:18,345 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 19 treesize of output 31 [2022-11-20 11:33:18,355 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 15 treesize of output 23 [2022-11-20 11:33:18,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:33:18,521 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-20 11:33:18,521 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 62 [2022-11-20 11:33:18,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:33:18,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:33:18,532 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 58 [2022-11-20 11:33:18,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:33:18,730 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-20 11:33:18,731 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 90 treesize of output 65 [2022-11-20 11:33:18,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:33:18,749 INFO L321 Elim1Store]: treesize reduction 25, result has 30.6 percent of original size [2022-11-20 11:33:18,749 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 65 [2022-11-20 11:33:18,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:33:19,031 INFO L321 Elim1Store]: treesize reduction 200, result has 18.0 percent of original size [2022-11-20 11:33:19,032 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 84 treesize of output 82 [2022-11-20 11:33:19,073 INFO L321 Elim1Store]: treesize reduction 108, result has 16.9 percent of original size [2022-11-20 11:33:19,073 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 105 treesize of output 72 [2022-11-20 11:33:19,274 INFO L321 Elim1Store]: treesize reduction 85, result has 11.5 percent of original size [2022-11-20 11:33:19,275 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 9 new quantified variables, introduced 10 case distinctions, treesize of input 132 treesize of output 74 [2022-11-20 11:33:19,294 INFO L321 Elim1Store]: treesize reduction 10, result has 41.2 percent of original size [2022-11-20 11:33:19,294 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 28 [2022-11-20 11:33:19,302 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:33:19,302 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:33:19,955 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:33:19,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [335351675] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:33:19,956 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:33:19,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 10] total 20 [2022-11-20 11:33:19,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033057389] [2022-11-20 11:33:19,956 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:33:19,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-20 11:33:19,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:33:19,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-20 11:33:19,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2022-11-20 11:33:19,958 INFO L87 Difference]: Start difference. First operand 101 states and 122 transitions. Second operand has 20 states, 20 states have (on average 2.9) internal successors, (58), 20 states have internal predecessors, (58), 0 states have call successors, (0), 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-20 11:33:20,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:33:20,412 INFO L93 Difference]: Finished difference Result 116 states and 138 transitions. [2022-11-20 11:33:20,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 11:33:20,413 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.9) internal successors, (58), 20 states have internal predecessors, (58), 0 states have call successors, (0), 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-20 11:33:20,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:33:20,413 INFO L225 Difference]: With dead ends: 116 [2022-11-20 11:33:20,414 INFO L226 Difference]: Without dead ends: 88 [2022-11-20 11:33:20,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=98, Invalid=408, Unknown=0, NotChecked=0, Total=506 [2022-11-20 11:33:20,415 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 21 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 79 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:33:20,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 256 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 113 Invalid, 0 Unknown, 79 Unchecked, 0.2s Time] [2022-11-20 11:33:20,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-11-20 11:33:20,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2022-11-20 11:33:20,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 86 states have (on average 1.255813953488372) internal successors, (108), 87 states have internal predecessors, (108), 0 states have call successors, (0), 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-20 11:33:20,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 108 transitions. [2022-11-20 11:33:20,437 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 108 transitions. Word has length 25 [2022-11-20 11:33:20,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:33:20,437 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 108 transitions. [2022-11-20 11:33:20,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.9) internal successors, (58), 20 states have internal predecessors, (58), 0 states have call successors, (0), 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-20 11:33:20,437 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 108 transitions. [2022-11-20 11:33:20,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-20 11:33:20,438 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:33:20,438 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-20 11:33:20,446 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-20 11:33:20,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-20 11:33:20,646 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-11-20 11:33:20,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:33:20,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1702665013, now seen corresponding path program 1 times [2022-11-20 11:33:20,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:33:20,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253792664] [2022-11-20 11:33:20,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:33:20,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:33:20,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:33:21,531 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:33:21,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:33:21,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253792664] [2022-11-20 11:33:21,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253792664] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:33:21,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1264933682] [2022-11-20 11:33:21,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:33:21,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:33:21,532 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:33:21,533 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:33:21,578 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-20 11:33:21,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:33:21,809 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 82 conjunts are in the unsatisfiable core [2022-11-20 11:33:21,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:33:21,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:33:21,838 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 26 [2022-11-20 11:33:21,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:33:21,846 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 36 [2022-11-20 11:33:21,878 INFO L321 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2022-11-20 11:33:21,878 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 2 case distinctions, treesize of input 69 treesize of output 68 [2022-11-20 11:33:21,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:33:21,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:33:21,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:33:21,892 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 38 [2022-11-20 11:33:21,896 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 15 treesize of output 23 [2022-11-20 11:33:21,912 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-20 11:33:21,912 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 35 treesize of output 27 [2022-11-20 11:33:22,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:33:22,015 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-20 11:33:22,016 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 49 [2022-11-20 11:33:22,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:33:22,045 INFO L321 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-11-20 11:33:22,045 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 50 [2022-11-20 11:33:22,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:33:22,212 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:33:22,228 INFO L321 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2022-11-20 11:33:22,228 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 82 treesize of output 83 [2022-11-20 11:33:22,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:33:22,239 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:33:22,318 INFO L321 Elim1Store]: treesize reduction 106, result has 41.8 percent of original size [2022-11-20 11:33:22,319 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 2 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 22 case distinctions, treesize of input 89 treesize of output 154 [2022-11-20 11:33:23,979 INFO L321 Elim1Store]: treesize reduction 40, result has 36.5 percent of original size [2022-11-20 11:33:23,979 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 95 treesize of output 97 [2022-11-20 11:33:24,022 INFO L321 Elim1Store]: treesize reduction 22, result has 54.2 percent of original size [2022-11-20 11:33:24,023 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 79 [2022-11-20 11:33:24,211 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-20 11:33:24,215 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:33:24,215 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 15 [2022-11-20 11:33:24,222 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:33:24,222 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:33:25,120 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_main_~item~0#1.base_47| Int)) (or (forall ((v_ArrVal_2303 (Array Int Int)) (v_ArrVal_2299 Int)) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_47| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_47|) 0 0) 4 v_ArrVal_2299)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) v_ArrVal_2303)) |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_2298 Int)) (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_47| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_47|) 0 0) 4 v_ArrVal_2298)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0)))) (forall ((v_ArrVal_2303 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_47| Int) (v_ArrVal_2299 Int)) (let ((.cse3 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_47| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_47|) 0 0) 4 v_ArrVal_2299)))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (or (= .cse2 0) (= (select (select (store .cse3 .cse2 v_ArrVal_2303) |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse1) 0))))) (forall ((v_ArrVal_2298 Int) (v_ArrVal_2302 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_47| Int) (v_ArrVal_2299 Int)) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_47| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_47|) 0 0) 4 v_ArrVal_2298)))) (or (= (select (select (store .cse4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_47| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_47|) 0 0) 4 v_ArrVal_2299)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) v_ArrVal_2302) |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse1) 0) (= (select (select .cse4 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0)))) (forall ((v_ArrVal_2298 Int) (v_ArrVal_2302 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_47| Int) (v_ArrVal_2299 Int)) (let ((.cse5 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_47| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_47|) 0 0) 4 v_ArrVal_2299)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (or (= (select (select (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_47| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_47|) 0 0) 4 v_ArrVal_2298)) .cse5 v_ArrVal_2302) |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse1) 0) (= .cse5 0)))))) is different from false [2022-11-20 11:33:25,200 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-20 11:33:25,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1264933682] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:33:25,201 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:33:25,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 23 [2022-11-20 11:33:25,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515003985] [2022-11-20 11:33:25,202 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:33:25,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-20 11:33:25,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:33:25,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-20 11:33:25,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=363, Unknown=23, NotChecked=40, Total=506 [2022-11-20 11:33:25,203 INFO L87 Difference]: Start difference. First operand 88 states and 108 transitions. Second operand has 23 states, 23 states have (on average 2.9130434782608696) internal successors, (67), 23 states have internal predecessors, (67), 0 states have call successors, (0), 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-20 11:33:26,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:33:26,954 INFO L93 Difference]: Finished difference Result 135 states and 165 transitions. [2022-11-20 11:33:26,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-20 11:33:26,955 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.9130434782608696) internal successors, (67), 23 states have internal predecessors, (67), 0 states have call successors, (0), 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 27 [2022-11-20 11:33:26,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:33:26,956 INFO L225 Difference]: With dead ends: 135 [2022-11-20 11:33:26,956 INFO L226 Difference]: Without dead ends: 124 [2022-11-20 11:33:26,956 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=230, Invalid=925, Unknown=39, NotChecked=66, Total=1260 [2022-11-20 11:33:26,957 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 132 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 236 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 11:33:26,958 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 357 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 232 Invalid, 0 Unknown, 236 Unchecked, 0.4s Time] [2022-11-20 11:33:26,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-11-20 11:33:26,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 99. [2022-11-20 11:33:26,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 97 states have (on average 1.2474226804123711) internal successors, (121), 98 states have internal predecessors, (121), 0 states have call successors, (0), 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-20 11:33:26,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 121 transitions. [2022-11-20 11:33:26,986 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 121 transitions. Word has length 27 [2022-11-20 11:33:26,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:33:26,986 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 121 transitions. [2022-11-20 11:33:26,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.9130434782608696) internal successors, (67), 23 states have internal predecessors, (67), 0 states have call successors, (0), 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-20 11:33:26,987 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 121 transitions. [2022-11-20 11:33:26,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-20 11:33:26,987 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:33:26,988 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] [2022-11-20 11:33:26,994 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-20 11:33:27,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-20 11:33:27,194 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-11-20 11:33:27,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:33:27,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1308386699, now seen corresponding path program 1 times [2022-11-20 11:33:27,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:33:27,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991579407] [2022-11-20 11:33:27,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:33:27,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:33:27,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:33:27,994 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:33:27,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:33:27,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991579407] [2022-11-20 11:33:27,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991579407] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:33:27,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:33:27,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 11:33:27,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308233627] [2022-11-20 11:33:27,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:33:27,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 11:33:27,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:33:27,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 11:33:27,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:33:27,996 INFO L87 Difference]: Start difference. First operand 99 states and 121 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 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-20 11:33:28,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:33:28,345 INFO L93 Difference]: Finished difference Result 141 states and 173 transitions. [2022-11-20 11:33:28,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 11:33:28,346 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2022-11-20 11:33:28,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:33:28,346 INFO L225 Difference]: With dead ends: 141 [2022-11-20 11:33:28,346 INFO L226 Difference]: Without dead ends: 106 [2022-11-20 11:33:28,347 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-20 11:33:28,347 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 46 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:33:28,348 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 99 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 11:33:28,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-11-20 11:33:28,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 99. [2022-11-20 11:33:28,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 97 states have (on average 1.2371134020618557) internal successors, (120), 98 states have internal predecessors, (120), 0 states have call successors, (0), 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-20 11:33:28,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 120 transitions. [2022-11-20 11:33:28,369 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 120 transitions. Word has length 27 [2022-11-20 11:33:28,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:33:28,370 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 120 transitions. [2022-11-20 11:33:28,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 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-20 11:33:28,370 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 120 transitions. [2022-11-20 11:33:28,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-20 11:33:28,371 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:33:28,371 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:33:28,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-20 11:33:28,371 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-11-20 11:33:28,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:33:28,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1764820376, now seen corresponding path program 1 times [2022-11-20 11:33:28,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:33:28,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798129850] [2022-11-20 11:33:28,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:33:28,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:33:28,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:33:29,596 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:33:29,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:33:29,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798129850] [2022-11-20 11:33:29,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798129850] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:33:29,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [653765059] [2022-11-20 11:33:29,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:33:29,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:33:29,597 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:33:29,598 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:33:29,600 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-20 11:33:29,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:33:29,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 110 conjunts are in the unsatisfiable core [2022-11-20 11:33:29,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:33:29,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:33:29,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:33:29,902 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 35 [2022-11-20 11:33:29,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:33:29,916 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 32 [2022-11-20 11:33:29,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:33:29,927 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 36 [2022-11-20 11:33:29,962 INFO L321 Elim1Store]: treesize reduction 50, result has 25.4 percent of original size [2022-11-20 11:33:29,963 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 2 case distinctions, treesize of input 104 treesize of output 99 [2022-11-20 11:33:29,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:33:29,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:33:29,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:33:29,980 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 38 [2022-11-20 11:33:29,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:33:29,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:33:29,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:33:29,992 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 27 [2022-11-20 11:33:30,032 INFO L321 Elim1Store]: treesize reduction 76, result has 16.5 percent of original size [2022-11-20 11:33:30,033 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 46 [2022-11-20 11:33:30,049 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 23 [2022-11-20 11:33:30,064 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 15 treesize of output 23 [2022-11-20 11:33:30,234 INFO L321 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2022-11-20 11:33:30,235 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 77 [2022-11-20 11:33:30,267 INFO L321 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2022-11-20 11:33:30,267 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 50 [2022-11-20 11:33:30,298 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2022-11-20 11:33:30,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:33:30,345 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 55 [2022-11-20 11:33:30,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:33:30,385 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2022-11-20 11:33:30,409 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 11:33:30,409 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-20 11:33:30,418 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 16 treesize of output 18 [2022-11-20 11:33:30,614 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-20 11:33:30,614 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 95 treesize of output 83 [2022-11-20 11:33:30,636 INFO L321 Elim1Store]: treesize reduction 31, result has 35.4 percent of original size [2022-11-20 11:33:30,636 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 59 [2022-11-20 11:33:30,692 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 23 treesize of output 22 [2022-11-20 11:33:31,333 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:33:31,334 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 39 [2022-11-20 11:33:31,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:33:31,742 INFO L321 Elim1Store]: treesize reduction 44, result has 38.0 percent of original size [2022-11-20 11:33:31,743 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 43 [2022-11-20 11:33:31,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:33:31,776 INFO L321 Elim1Store]: treesize reduction 54, result has 23.9 percent of original size [2022-11-20 11:33:31,776 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 32 [2022-11-20 11:33:31,912 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-20 11:33:31,917 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-20 11:33:31,920 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 11:33:31,920 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:33:34,124 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4))) (.cse0 (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4))) (and (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int) (|ULTIMATE.start_main_~bcki~0#1.base| Int)) (or (forall ((v_ArrVal_2633 Int)) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~bcki~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~bcki~0#1.base|) (+ 4 |ULTIMATE.start_main_~bcki~0#1.offset|) v_ArrVal_2633)) |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse0) 0)) (not (= (select (select |c_#memory_int| |ULTIMATE.start_main_~bcki~0#1.base|) (+ 8 |ULTIMATE.start_main_~bcki~0#1.offset|)) .cse1)))) (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int) (|ULTIMATE.start_main_~bcki~0#1.base| Int)) (or (not (= (select (select |c_#memory_int| |ULTIMATE.start_main_~bcki~0#1.base|) (+ 8 |ULTIMATE.start_main_~bcki~0#1.offset|)) .cse1)) (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~bcki~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~bcki~0#1.base|) (+ 4 |ULTIMATE.start_main_~bcki~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.offset|)) |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse0) 0))))) is different from false [2022-11-20 11:33:34,306 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4) 2))) (.cse2 (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4))) (and (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int) (|ULTIMATE.start_main_~bcki~0#1.base| Int) (v_ArrVal_2629 (Array Int Int))) (or (not (= 2 (select (select .cse0 |ULTIMATE.start_main_~bcki~0#1.base|) (+ 8 |ULTIMATE.start_main_~bcki~0#1.offset|)))) (forall ((v_ArrVal_2633 Int)) (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_2629))) (store .cse1 |ULTIMATE.start_main_~bcki~0#1.base| (store (select .cse1 |ULTIMATE.start_main_~bcki~0#1.base|) (+ 4 |ULTIMATE.start_main_~bcki~0#1.offset|) v_ArrVal_2633))) |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse2) 0)))) (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int) (v_ArrVal_2631 (Array Int Int)) (|ULTIMATE.start_main_~bcki~0#1.base| Int)) (or (not (= 2 (select (select .cse0 |ULTIMATE.start_main_~bcki~0#1.base|) (+ 8 |ULTIMATE.start_main_~bcki~0#1.offset|)))) (= (select (select (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_2631))) (store .cse3 |ULTIMATE.start_main_~bcki~0#1.base| (store (select .cse3 |ULTIMATE.start_main_~bcki~0#1.base|) (+ 4 |ULTIMATE.start_main_~bcki~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.offset|))) |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse2) 0))))) is different from false [2022-11-20 11:33:34,343 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:33:34,343 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 86 [2022-11-20 11:33:34,683 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 2 not checked. [2022-11-20 11:33:34,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [653765059] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:33:34,683 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:33:34,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 23 [2022-11-20 11:33:34,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882244449] [2022-11-20 11:33:34,685 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:33:34,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-20 11:33:34,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:33:34,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-20 11:33:34,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=348, Unknown=2, NotChecked=78, Total=506 [2022-11-20 11:33:34,687 INFO L87 Difference]: Start difference. First operand 99 states and 120 transitions. Second operand has 23 states, 23 states have (on average 3.0) internal successors, (69), 23 states have internal predecessors, (69), 0 states have call successors, (0), 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-20 11:33:41,958 WARN L233 SmtUtils]: Spent 6.41s on a formula simplification. DAG size of input: 78 DAG size of output: 66 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 11:33:59,266 WARN L233 SmtUtils]: Spent 8.74s on a formula simplification. DAG size of input: 89 DAG size of output: 73 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 11:34:13,898 WARN L233 SmtUtils]: Spent 14.58s on a formula simplification. DAG size of input: 103 DAG size of output: 75 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 11:34:20,533 WARN L233 SmtUtils]: Spent 6.43s on a formula simplification. DAG size of input: 80 DAG size of output: 68 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 11:34:43,317 WARN L233 SmtUtils]: Spent 22.70s on a formula simplification. DAG size of input: 99 DAG size of output: 79 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 11:34:43,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:34:43,987 INFO L93 Difference]: Finished difference Result 189 states and 233 transitions. [2022-11-20 11:34:43,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-20 11:34:43,987 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.0) internal successors, (69), 23 states have internal predecessors, (69), 0 states have call successors, (0), 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 29 [2022-11-20 11:34:43,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:34:43,988 INFO L225 Difference]: With dead ends: 189 [2022-11-20 11:34:43,988 INFO L226 Difference]: Without dead ends: 132 [2022-11-20 11:34:43,989 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 71.6s TimeCoverageRelationStatistics Valid=304, Invalid=1105, Unknown=5, NotChecked=146, Total=1560 [2022-11-20 11:34:43,990 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 185 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 242 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-20 11:34:43,990 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 275 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 246 Invalid, 0 Unknown, 242 Unchecked, 0.6s Time] [2022-11-20 11:34:43,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-11-20 11:34:44,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 97. [2022-11-20 11:34:44,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 95 states have (on average 1.231578947368421) internal successors, (117), 96 states have internal predecessors, (117), 0 states have call successors, (0), 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-20 11:34:44,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 117 transitions. [2022-11-20 11:34:44,018 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 117 transitions. Word has length 29 [2022-11-20 11:34:44,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:34:44,018 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 117 transitions. [2022-11-20 11:34:44,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.0) internal successors, (69), 23 states have internal predecessors, (69), 0 states have call successors, (0), 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-20 11:34:44,019 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 117 transitions. [2022-11-20 11:34:44,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-20 11:34:44,019 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:34:44,020 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-20 11:34:44,025 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-20 11:34:44,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-20 11:34:44,221 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-11-20 11:34:44,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:34:44,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1842471721, now seen corresponding path program 1 times [2022-11-20 11:34:44,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:34:44,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213571559] [2022-11-20 11:34:44,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:34:44,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:34:44,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:34:45,536 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:34:45,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:34:45,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213571559] [2022-11-20 11:34:45,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213571559] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:34:45,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [599028551] [2022-11-20 11:34:45,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:34:45,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:34:45,537 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:34:45,538 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:34:45,541 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-20 11:34:45,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:34:45,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-20 11:34:45,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:34:45,947 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 13 treesize of output 9 [2022-11-20 11:34:46,013 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-20 11:34:46,032 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:34:46,032 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:34:46,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [599028551] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:34:46,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 11:34:46,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 18 [2022-11-20 11:34:46,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654366650] [2022-11-20 11:34:46,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:34:46,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 11:34:46,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:34:46,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 11:34:46,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2022-11-20 11:34:46,034 INFO L87 Difference]: Start difference. First operand 97 states and 117 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 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-20 11:34:46,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:34:46,406 INFO L93 Difference]: Finished difference Result 131 states and 162 transitions. [2022-11-20 11:34:46,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 11:34:46,406 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2022-11-20 11:34:46,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:34:46,407 INFO L225 Difference]: With dead ends: 131 [2022-11-20 11:34:46,407 INFO L226 Difference]: Without dead ends: 120 [2022-11-20 11:34:46,407 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2022-11-20 11:34:46,408 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 128 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 11:34:46,408 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 107 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 11:34:46,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-11-20 11:34:46,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 108. [2022-11-20 11:34:46,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 106 states have (on average 1.2264150943396226) internal successors, (130), 107 states have internal predecessors, (130), 0 states have call successors, (0), 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-20 11:34:46,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 130 transitions. [2022-11-20 11:34:46,439 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 130 transitions. Word has length 29 [2022-11-20 11:34:46,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:34:46,439 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 130 transitions. [2022-11-20 11:34:46,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 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-20 11:34:46,439 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 130 transitions. [2022-11-20 11:34:46,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-20 11:34:46,440 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:34:46,440 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-20 11:34:46,446 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-20 11:34:46,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:34:46,642 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-11-20 11:34:46,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:34:46,643 INFO L85 PathProgramCache]: Analyzing trace with hash -461850395, now seen corresponding path program 1 times [2022-11-20 11:34:46,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:34:46,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072590163] [2022-11-20 11:34:46,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:34:46,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:34:46,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:34:47,730 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:34:47,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:34:47,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072590163] [2022-11-20 11:34:47,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072590163] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:34:47,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [757534310] [2022-11-20 11:34:47,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:34:47,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:34:47,731 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:34:47,732 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:34:47,757 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-20 11:34:48,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:34:48,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-20 11:34:48,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:34:48,054 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-20 11:34:48,064 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-20 11:34:48,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:34:48,104 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 21 treesize of output 20 [2022-11-20 11:34:48,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:34:48,112 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 21 treesize of output 20 [2022-11-20 11:34:48,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:34:48,314 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 21 treesize of output 20 [2022-11-20 11:34:48,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:34:48,321 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 27 treesize of output 26 [2022-11-20 11:34:48,421 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:34:48,421 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 31 [2022-11-20 11:34:48,428 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:34:48,429 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2022-11-20 11:34:48,460 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-20 11:34:48,465 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-20 11:34:48,481 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:34:48,481 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:34:49,137 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:34:49,164 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:34:49,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [757534310] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:34:49,165 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:34:49,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 22 [2022-11-20 11:34:49,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889450617] [2022-11-20 11:34:49,165 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:34:49,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-20 11:34:49,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:34:49,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-20 11:34:49,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=384, Unknown=0, NotChecked=0, Total=462 [2022-11-20 11:34:49,167 INFO L87 Difference]: Start difference. First operand 108 states and 130 transitions. Second operand has 22 states, 22 states have (on average 3.1363636363636362) internal successors, (69), 22 states have internal predecessors, (69), 0 states have call successors, (0), 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-20 11:34:50,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:34:50,915 INFO L93 Difference]: Finished difference Result 146 states and 178 transitions. [2022-11-20 11:34:50,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-20 11:34:50,915 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.1363636363636362) internal successors, (69), 22 states have internal predecessors, (69), 0 states have call successors, (0), 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 29 [2022-11-20 11:34:50,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:34:50,916 INFO L225 Difference]: With dead ends: 146 [2022-11-20 11:34:50,917 INFO L226 Difference]: Without dead ends: 135 [2022-11-20 11:34:50,917 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 47 SyntacticMatches, 4 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=351, Invalid=1209, Unknown=0, NotChecked=0, Total=1560 [2022-11-20 11:34:50,918 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 448 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 448 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 130 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-20 11:34:50,918 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [448 Valid, 210 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 265 Invalid, 0 Unknown, 130 Unchecked, 0.6s Time] [2022-11-20 11:34:50,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-11-20 11:34:50,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 120. [2022-11-20 11:34:50,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 118 states have (on average 1.2372881355932204) internal successors, (146), 119 states have internal predecessors, (146), 0 states have call successors, (0), 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-20 11:34:50,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 146 transitions. [2022-11-20 11:34:50,946 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 146 transitions. Word has length 29 [2022-11-20 11:34:50,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:34:50,947 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 146 transitions. [2022-11-20 11:34:50,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.1363636363636362) internal successors, (69), 22 states have internal predecessors, (69), 0 states have call successors, (0), 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-20 11:34:50,947 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 146 transitions. [2022-11-20 11:34:50,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-20 11:34:50,948 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:34:50,948 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-20 11:34:50,954 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-11-20 11:34:51,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-20 11:34:51,149 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-11-20 11:34:51,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:34:51,149 INFO L85 PathProgramCache]: Analyzing trace with hash -993211820, now seen corresponding path program 1 times [2022-11-20 11:34:51,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:34:51,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711467257] [2022-11-20 11:34:51,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:34:51,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:34:51,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:34:51,855 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:34:51,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:34:51,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711467257] [2022-11-20 11:34:51,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711467257] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:34:51,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [12229543] [2022-11-20 11:34:51,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:34:51,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:34:51,856 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:34:51,857 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:34:51,861 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-20 11:34:52,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:34:52,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 117 conjunts are in the unsatisfiable core [2022-11-20 11:34:52,159 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:34:52,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:34:52,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:34:52,190 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 35 [2022-11-20 11:34:52,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:34:52,202 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 26 [2022-11-20 11:34:52,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:34:52,227 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 36 [2022-11-20 11:34:52,258 INFO L321 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2022-11-20 11:34:52,258 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 2 case distinctions, treesize of input 98 treesize of output 93 [2022-11-20 11:34:52,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:34:52,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:34:52,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:34:52,271 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 38 [2022-11-20 11:34:52,274 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 15 treesize of output 23 [2022-11-20 11:34:52,316 INFO L321 Elim1Store]: treesize reduction 76, result has 16.5 percent of original size [2022-11-20 11:34:52,317 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 46 [2022-11-20 11:34:52,328 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 27 [2022-11-20 11:34:52,420 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 11:34:52,420 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 16 treesize of output 22 [2022-11-20 11:34:52,428 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 11:34:52,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:34:52,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:34:52,448 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-20 11:34:52,448 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 58 [2022-11-20 11:34:52,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:34:52,469 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-20 11:34:52,469 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 54 [2022-11-20 11:34:52,481 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 11:34:52,481 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-20 11:34:52,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:34:52,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:34:52,713 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:34:52,714 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:34:52,797 INFO L321 Elim1Store]: treesize reduction 118, result has 35.2 percent of original size [2022-11-20 11:34:52,797 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 2 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 22 case distinctions, treesize of input 99 treesize of output 152 [2022-11-20 11:34:52,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:34:52,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:34:52,819 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:34:52,833 INFO L321 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2022-11-20 11:34:52,834 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 111 treesize of output 100 [2022-11-20 11:34:53,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:34:53,011 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 27 treesize of output 26 [2022-11-20 11:34:53,853 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:34:53,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:34:53,858 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:34:53,858 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 17 [2022-11-20 11:34:55,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:34:55,137 INFO L321 Elim1Store]: treesize reduction 74, result has 32.7 percent of original size [2022-11-20 11:34:55,137 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 134 treesize of output 126 [2022-11-20 11:34:55,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:34:55,233 INFO L321 Elim1Store]: treesize reduction 244, result has 14.4 percent of original size [2022-11-20 11:34:55,234 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 6 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 14 case distinctions, treesize of input 76 treesize of output 74 [2022-11-20 11:34:55,997 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:34:55,998 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 145 treesize of output 117 [2022-11-20 11:34:56,234 INFO L321 Elim1Store]: treesize reduction 96, result has 62.1 percent of original size [2022-11-20 11:34:56,235 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 10 new quantified variables, introduced 27 case distinctions, treesize of input 124 treesize of output 230 [2022-11-20 11:34:57,788 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:34:57,788 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:35:00,037 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:35:00,037 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2022-11-20 11:35:02,516 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:35:02,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [12229543] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:35:02,517 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:35:02,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 15, 15] total 33 [2022-11-20 11:35:02,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131064357] [2022-11-20 11:35:02,517 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:35:02,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-20 11:35:02,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:35:02,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-20 11:35:02,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=942, Unknown=0, NotChecked=0, Total=1056 [2022-11-20 11:35:02,519 INFO L87 Difference]: Start difference. First operand 120 states and 146 transitions. Second operand has 33 states, 33 states have (on average 2.4545454545454546) internal successors, (81), 33 states have internal predecessors, (81), 0 states have call successors, (0), 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-20 11:35:11,997 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse25 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base|)) (.cse56 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base|))) (let ((.cse59 (select .cse56 |c_ULTIMATE.start_main_~bcki~0#1.offset|)) (.cse22 (select .cse25 |c_ULTIMATE.start_main_~bcki~0#1.offset|)) (.cse15 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bucket~0#1.base|)) (.cse23 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|))) (let ((.cse26 (+ |c_ULTIMATE.start_main_~bcki~0#1.offset| 4)) (.cse20 (select .cse23 |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (.cse34 (select .cse15 |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (.cse36 (select |c_#memory_int| |c_ULTIMATE.start_main_~item~0#1.base|)) (.cse37 (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4)) (.cse4 (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) (.cse21 (select |c_#memory_$Pointer$.offset| .cse22)) (.cse0 (= .cse59 0))) (let ((.cse11 (and .cse0 (= .cse22 0))) (.cse12 (let ((.cse58 (select .cse21 (+ .cse59 4)))) (and (forall ((|ULTIMATE.start_main_~itr~0#1.base| Int)) (let ((.cse57 (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~itr~0#1.base|))) (or (not (= (select .cse57 .cse58) 0)) (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~itr~0#1.base| (store .cse57 .cse58 |c_ULTIMATE.start_main_~item~0#1.offset|)) |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse4) 0)))) (forall ((|ULTIMATE.start_main_~itr~0#1.base| Int)) (or (forall ((v_ArrVal_3274 Int)) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~itr~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~itr~0#1.base|) .cse58 v_ArrVal_3274)) |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse4) 0)) (not (= (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~itr~0#1.base|) .cse58) 0))))))) (.cse14 (select .cse36 .cse37)) (.cse13 (= .cse34 0)) (.cse33 (select |c_#memory_$Pointer$.offset| .cse20)) (.cse6 (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 8)) (.cse24 (select .cse56 .cse26))) (and .cse0 (forall ((v_arrayElimArr_27 (Array Int Int))) (or (not (= (select v_arrayElimArr_27 4) 1)) (forall ((|v_ULTIMATE.start_main_~item~0#1.base_61| Int)) (or (forall ((v_ArrVal_3267 Int)) (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_61| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_61|) 0 0) 4 v_ArrVal_3267)))) (let ((.cse5 (select (select .cse1 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (or (forall ((|ULTIMATE.start_main_~itr~0#1.base| Int) (v_ArrVal_3268 Int)) (let ((.cse2 (select .cse1 |ULTIMATE.start_main_~itr~0#1.base|)) (.cse3 (select (select .cse1 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_61| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_61|) 0 0) 4 v_ArrVal_3268)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (+ .cse5 4)))) (or (= (select (select (store .cse1 |ULTIMATE.start_main_~itr~0#1.base| (store .cse2 .cse3 0)) |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse4) 0) (not (= (select .cse2 .cse3) 0))))) (= .cse5 0))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_61|) 0)) (= (select (select (store |c_#memory_int| |v_ULTIMATE.start_main_~item~0#1.base_61| v_arrayElimArr_27) |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse6) 1))))) (forall ((v_arrayElimArr_27 (Array Int Int))) (or (not (= (select v_arrayElimArr_27 4) 1)) (forall ((|v_ULTIMATE.start_main_~item~0#1.base_61| Int)) (or (forall ((v_ArrVal_3267 Int)) (let ((.cse7 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_61| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_61|) 0 0) 4 v_ArrVal_3267)))) (let ((.cse10 (select (select .cse7 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (or (forall ((|ULTIMATE.start_main_~itr~0#1.base| Int) (v_ArrVal_3268 Int)) (let ((.cse9 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_61| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_61|) 0 0) 4 v_ArrVal_3268)))) (let ((.cse8 (select (select .cse7 (select (select .cse9 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (+ .cse10 4)))) (or (not (= (select (select .cse7 |ULTIMATE.start_main_~itr~0#1.base|) .cse8) 0)) (forall ((v_ArrVal_3274 Int)) (= (select (select (store .cse9 |ULTIMATE.start_main_~itr~0#1.base| (store (select .cse9 |ULTIMATE.start_main_~itr~0#1.base|) .cse8 v_ArrVal_3274)) |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse4) 0)))))) (= .cse10 0))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_61|) 0)) (= (select (select (store |c_#memory_int| |v_ULTIMATE.start_main_~item~0#1.base_61| v_arrayElimArr_27) |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse6) 1))))) (not (= |c_ULTIMATE.start_main_~bucket~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|)) (or .cse11 (= |c_ULTIMATE.start_main_#t~mem11#1| |c_ULTIMATE.start_main_#t~mem10#1|) .cse12) .cse13 (= (select |c_#valid| |c_ULTIMATE.start_main_~bucket~0#1.base|) 1) (or .cse11 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~bcki~0#1.base|) (+ |c_ULTIMATE.start_main_~bcki~0#1.offset| 8)) .cse14) .cse12) (= |c_ULTIMATE.start_main_~bcki~0#1.offset| 0) (= (select .cse15 .cse4) 0) (forall ((v_arrayElimArr_27 (Array Int Int))) (or (not (= (select v_arrayElimArr_27 4) 1)) (forall ((|v_ULTIMATE.start_main_~item~0#1.base_61| Int)) (or (forall ((v_ArrVal_3268 Int)) (let ((.cse19 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_61| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_61|) 0 0) 4 v_ArrVal_3268)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (or (forall ((|ULTIMATE.start_main_~itr~0#1.base| Int) (v_ArrVal_3267 Int)) (let ((.cse16 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_61| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_61|) 0 0) 4 v_ArrVal_3267)))) (let ((.cse17 (select .cse16 |ULTIMATE.start_main_~itr~0#1.base|)) (.cse18 (select (select .cse16 .cse19) (+ (select (select .cse16 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 4)))) (or (= (select (select (store .cse16 |ULTIMATE.start_main_~itr~0#1.base| (store .cse17 .cse18 0)) |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse4) 0) (not (= (select .cse17 .cse18) 0)))))) (= .cse19 0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_61|) 0)) (= (select (select (store |c_#memory_int| |v_ULTIMATE.start_main_~item~0#1.base_61| v_arrayElimArr_27) |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse6) 1))))) (= (select (select |c_#memory_$Pointer$.base| .cse20) 4) 0) (= (select .cse21 4) 0) (= |c_ULTIMATE.start_main_~bucket~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| .cse22) 4) 0) (= (select .cse23 .cse4) 0) (forall ((|ULTIMATE.start_main_~itr~0#1.base| Int)) (or (forall ((v_ArrVal_3274 Int)) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~itr~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~itr~0#1.base|) .cse24 v_ArrVal_3274)) |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse4) 0)) (not (= (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~itr~0#1.base|) .cse24) 0)))) (= (select .cse25 .cse26) 0) (forall ((v_arrayElimArr_27 (Array Int Int))) (or (not (= (select v_arrayElimArr_27 4) 1)) (forall ((|v_ULTIMATE.start_main_~item~0#1.base_61| Int)) (or (forall ((v_ArrVal_3268 Int)) (let ((.cse29 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_61| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_61|) 0 0) 4 v_ArrVal_3268)))) (let ((.cse30 (select (select .cse29 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (or (forall ((|ULTIMATE.start_main_~itr~0#1.base| Int) (v_ArrVal_3267 Int)) (let ((.cse27 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_61| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_61|) 0 0) 4 v_ArrVal_3267)))) (let ((.cse28 (select (select .cse27 .cse30) (+ (select (select .cse27 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 4)))) (or (not (= (select (select .cse27 |ULTIMATE.start_main_~itr~0#1.base|) .cse28) 0)) (forall ((v_ArrVal_3274 Int)) (= (select (select (store .cse29 |ULTIMATE.start_main_~itr~0#1.base| (store (select .cse29 |ULTIMATE.start_main_~itr~0#1.base|) .cse28 v_ArrVal_3274)) |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse4) 0)))))) (= .cse30 0))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_61|) 0)) (= (select (select (store |c_#memory_int| |v_ULTIMATE.start_main_~item~0#1.base_61| v_arrayElimArr_27) |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse6) 1))))) (= (select |c_#valid| .cse20) 1) (or (let ((.cse32 (select .cse33 (+ .cse34 4)))) (and (forall ((|ULTIMATE.start_main_~itr~0#1.base| Int)) (let ((.cse31 (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~itr~0#1.base|))) (or (not (= (select .cse31 .cse32) 0)) (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~itr~0#1.base| (store .cse31 .cse32 |c_ULTIMATE.start_main_~item~0#1.offset|)) |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse4) 0)))) (forall ((|ULTIMATE.start_main_~itr~0#1.base| Int)) (or (not (= (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~itr~0#1.base|) .cse32) 0)) (forall ((v_ArrVal_3274 Int)) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~itr~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~itr~0#1.base|) .cse32 v_ArrVal_3274)) |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse4) 0)))))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse6) .cse14) (and .cse13 (= .cse20 0))) (not (= .cse20 |c_ULTIMATE.start_main_~item~0#1.base|)) (forall ((|ULTIMATE.start_main_~itr~0#1.base| Int)) (let ((.cse35 (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~itr~0#1.base|))) (or (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~itr~0#1.base| (store .cse35 .cse24 |c_ULTIMATE.start_main_~item~0#1.offset|)) |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse4) 0) (not (= (select .cse35 .cse24) 0))))) (= (select .cse33 4) 0) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~item~0#1.base| (store .cse36 .cse37 1)) |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse6) 1) (let ((.cse43 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|)) (.cse42 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (and (forall ((v_ArrVal_3268 Int)) (let ((.cse41 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store .cse43 .cse37 v_ArrVal_3268)))) (let ((.cse38 (select (select .cse41 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (or (= .cse38 0) (forall ((|ULTIMATE.start_main_~itr~0#1.base| Int) (v_ArrVal_3267 Int)) (let ((.cse39 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| (store .cse42 .cse37 v_ArrVal_3267)))) (let ((.cse40 (select (select .cse39 .cse38) (+ (select (select .cse39 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 4)))) (or (not (= (select (select .cse39 |ULTIMATE.start_main_~itr~0#1.base|) .cse40) 0)) (forall ((v_ArrVal_3274 Int)) (= (select (select (store .cse41 |ULTIMATE.start_main_~itr~0#1.base| (store (select .cse41 |ULTIMATE.start_main_~itr~0#1.base|) .cse40 v_ArrVal_3274)) |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse4) 0)))))))))) (forall ((v_ArrVal_3267 Int)) (let ((.cse44 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| (store .cse42 .cse37 v_ArrVal_3267)))) (let ((.cse47 (select (select .cse44 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (or (forall ((|ULTIMATE.start_main_~itr~0#1.base| Int) (v_ArrVal_3268 Int)) (let ((.cse46 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store .cse43 .cse37 v_ArrVal_3268)))) (let ((.cse45 (select (select .cse44 (select (select .cse46 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (+ .cse47 4)))) (or (not (= (select (select .cse44 |ULTIMATE.start_main_~itr~0#1.base|) .cse45) 0)) (forall ((v_ArrVal_3274 Int)) (= (select (select (store .cse46 |ULTIMATE.start_main_~itr~0#1.base| (store (select .cse46 |ULTIMATE.start_main_~itr~0#1.base|) .cse45 v_ArrVal_3274)) |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse4) 0)))))) (= .cse47 0))))) (forall ((v_ArrVal_3268 Int)) (let ((.cse48 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store .cse43 .cse37 v_ArrVal_3268)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (or (= .cse48 0) (forall ((|ULTIMATE.start_main_~itr~0#1.base| Int) (v_ArrVal_3267 Int)) (let ((.cse49 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| (store .cse42 .cse37 v_ArrVal_3267)))) (let ((.cse50 (select .cse49 |ULTIMATE.start_main_~itr~0#1.base|)) (.cse51 (select (select .cse49 .cse48) (+ (select (select .cse49 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 4)))) (or (= (select (select (store .cse49 |ULTIMATE.start_main_~itr~0#1.base| (store .cse50 .cse51 |c_ULTIMATE.start_main_~item~0#1.offset|)) |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse4) 0) (not (= (select .cse50 .cse51) 0))))))))) (forall ((v_ArrVal_3267 Int)) (let ((.cse52 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| (store .cse42 .cse37 v_ArrVal_3267)))) (let ((.cse55 (select (select .cse52 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (or (forall ((|ULTIMATE.start_main_~itr~0#1.base| Int) (v_ArrVal_3268 Int)) (let ((.cse53 (select .cse52 |ULTIMATE.start_main_~itr~0#1.base|)) (.cse54 (select (select .cse52 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store .cse43 .cse37 v_ArrVal_3268)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (+ .cse55 4)))) (or (= (select (select (store .cse52 |ULTIMATE.start_main_~itr~0#1.base| (store .cse53 .cse54 |c_ULTIMATE.start_main_~item~0#1.offset|)) |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse4) 0) (not (= (select .cse53 .cse54) 0))))) (= .cse55 0)))))))) (= .cse24 0)))))) is different from true [2022-11-20 11:35:13,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:35:13,796 INFO L93 Difference]: Finished difference Result 191 states and 233 transitions. [2022-11-20 11:35:13,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-20 11:35:13,797 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.4545454545454546) internal successors, (81), 33 states have internal predecessors, (81), 0 states have call successors, (0), 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 30 [2022-11-20 11:35:13,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:35:13,798 INFO L225 Difference]: With dead ends: 191 [2022-11-20 11:35:13,798 INFO L226 Difference]: Without dead ends: 135 [2022-11-20 11:35:13,799 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 37 SyntacticMatches, 9 SemanticMatches, 49 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 467 ImplicationChecksByTransitivity, 16.1s TimeCoverageRelationStatistics Valid=343, Invalid=2110, Unknown=1, NotChecked=96, Total=2550 [2022-11-20 11:35:13,799 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 116 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 337 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 11:35:13,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 441 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 164 Invalid, 0 Unknown, 337 Unchecked, 0.3s Time] [2022-11-20 11:35:13,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-11-20 11:35:13,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 126. [2022-11-20 11:35:13,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 124 states have (on average 1.2258064516129032) internal successors, (152), 125 states have internal predecessors, (152), 0 states have call successors, (0), 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-20 11:35:13,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 152 transitions. [2022-11-20 11:35:13,862 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 152 transitions. Word has length 30 [2022-11-20 11:35:13,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:35:13,867 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 152 transitions. [2022-11-20 11:35:13,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.4545454545454546) internal successors, (81), 33 states have internal predecessors, (81), 0 states have call successors, (0), 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-20 11:35:13,867 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 152 transitions. [2022-11-20 11:35:13,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-20 11:35:13,868 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:35:13,868 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:35:13,874 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-11-20 11:35:14,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:35:14,075 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-11-20 11:35:14,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:35:14,075 INFO L85 PathProgramCache]: Analyzing trace with hash -2085702334, now seen corresponding path program 1 times [2022-11-20 11:35:14,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:35:14,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055189350] [2022-11-20 11:35:14,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:35:14,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:35:14,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:35:14,693 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:35:14,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:35:14,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055189350] [2022-11-20 11:35:14,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055189350] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:35:14,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694801058] [2022-11-20 11:35:14,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:35:14,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:35:14,694 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:35:14,695 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:35:14,705 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-20 11:35:14,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:35:14,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-20 11:35:15,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:35:15,017 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 13 treesize of output 9 [2022-11-20 11:35:15,246 INFO L321 Elim1Store]: treesize reduction 33, result has 34.0 percent of original size [2022-11-20 11:35:15,246 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 42 [2022-11-20 11:35:15,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:35:15,284 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 21 treesize of output 20 [2022-11-20 11:35:15,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:35:15,317 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 23 treesize of output 22 [2022-11-20 11:35:15,428 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:35:15,428 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 13 [2022-11-20 11:35:15,451 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:35:15,451 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:35:16,012 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 177 treesize of output 165 [2022-11-20 11:35:16,096 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:35:16,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [694801058] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:35:16,096 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:35:16,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 30 [2022-11-20 11:35:16,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218625496] [2022-11-20 11:35:16,097 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:35:16,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-20 11:35:16,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:35:16,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-20 11:35:16,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=755, Unknown=0, NotChecked=0, Total=870 [2022-11-20 11:35:16,099 INFO L87 Difference]: Start difference. First operand 126 states and 152 transitions. Second operand has 30 states, 30 states have (on average 2.7666666666666666) internal successors, (83), 30 states have internal predecessors, (83), 0 states have call successors, (0), 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-20 11:35:18,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:35:18,274 INFO L93 Difference]: Finished difference Result 358 states and 436 transitions. [2022-11-20 11:35:18,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-11-20 11:35:18,274 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.7666666666666666) internal successors, (83), 30 states have internal predecessors, (83), 0 states have call successors, (0), 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 30 [2022-11-20 11:35:18,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:35:18,275 INFO L225 Difference]: With dead ends: 358 [2022-11-20 11:35:18,276 INFO L226 Difference]: Without dead ends: 310 [2022-11-20 11:35:18,277 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 746 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=658, Invalid=2764, Unknown=0, NotChecked=0, Total=3422 [2022-11-20 11:35:18,277 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 519 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 519 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 370 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-20 11:35:18,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [519 Valid, 729 Invalid, 942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 514 Invalid, 0 Unknown, 370 Unchecked, 0.8s Time] [2022-11-20 11:35:18,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2022-11-20 11:35:18,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 189. [2022-11-20 11:35:18,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 187 states have (on average 1.2406417112299466) internal successors, (232), 188 states have internal predecessors, (232), 0 states have call successors, (0), 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-20 11:35:18,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 232 transitions. [2022-11-20 11:35:18,343 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 232 transitions. Word has length 30 [2022-11-20 11:35:18,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:35:18,343 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 232 transitions. [2022-11-20 11:35:18,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.7666666666666666) internal successors, (83), 30 states have internal predecessors, (83), 0 states have call successors, (0), 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-20 11:35:18,344 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 232 transitions. [2022-11-20 11:35:18,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-20 11:35:18,344 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:35:18,345 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-20 11:35:18,356 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-20 11:35:18,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:35:18,551 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-11-20 11:35:18,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:35:18,552 INFO L85 PathProgramCache]: Analyzing trace with hash -217147576, now seen corresponding path program 1 times [2022-11-20 11:35:18,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:35:18,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781807686] [2022-11-20 11:35:18,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:35:18,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:35:18,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:35:20,596 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:35:20,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:35:20,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781807686] [2022-11-20 11:35:20,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781807686] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:35:20,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1594897225] [2022-11-20 11:35:20,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:35:20,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:35:20,597 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:35:20,597 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:35:20,599 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-20 11:35:20,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:35:20,916 INFO L263 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 144 conjunts are in the unsatisfiable core [2022-11-20 11:35:20,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:35:20,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:35:20,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:35:20,959 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 35 [2022-11-20 11:35:20,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:35:20,971 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 26 [2022-11-20 11:35:20,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:35:20,981 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 36 [2022-11-20 11:35:21,012 INFO L321 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2022-11-20 11:35:21,013 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 98 treesize of output 93 [2022-11-20 11:35:21,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:35:21,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:35:21,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:35:21,027 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 38 [2022-11-20 11:35:21,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:35:21,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:35:21,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:35:21,037 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 27 [2022-11-20 11:35:21,068 INFO L321 Elim1Store]: treesize reduction 76, result has 16.5 percent of original size [2022-11-20 11:35:21,068 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 46 [2022-11-20 11:35:21,092 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 15 treesize of output 23 [2022-11-20 11:35:21,256 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 11:35:21,256 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 1 case distinctions, treesize of input 16 treesize of output 22 [2022-11-20 11:35:21,265 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 7 treesize of output 3 [2022-11-20 11:35:21,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:35:21,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:35:21,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:35:21,277 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 58 [2022-11-20 11:35:21,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:35:21,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:35:21,286 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 50 [2022-11-20 11:35:21,316 INFO L321 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-11-20 11:35:21,316 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2022-11-20 11:35:21,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:35:21,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:35:21,484 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 61 [2022-11-20 11:35:21,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:35:21,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:35:21,505 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 70 [2022-11-20 11:35:21,533 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-20 11:35:22,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:35:22,977 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:35:22,993 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-20 11:35:22,994 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 143 treesize of output 115 [2022-11-20 11:35:23,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:35:23,013 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:35:23,017 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-20 11:35:23,017 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 74 [2022-11-20 11:35:23,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:35:23,027 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:35:23,073 INFO L321 Elim1Store]: treesize reduction 197, result has 15.1 percent of original size [2022-11-20 11:35:23,074 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 198 treesize of output 168 [2022-11-20 11:35:23,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:35:23,464 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:35:23,479 INFO L321 Elim1Store]: treesize reduction 39, result has 25.0 percent of original size [2022-11-20 11:35:23,479 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 185 treesize of output 114 [2022-11-20 11:35:23,507 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-11-20 11:35:23,507 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 73 [2022-11-20 11:35:23,512 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 7 treesize of output 3 [2022-11-20 11:35:23,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:35:23,527 INFO L321 Elim1Store]: treesize reduction 44, result has 2.2 percent of original size [2022-11-20 11:35:23,527 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 5 case distinctions, treesize of input 192 treesize of output 168 [2022-11-20 11:35:23,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:35:23,894 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 54 [2022-11-20 11:35:23,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:35:23,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:35:23,906 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:35:23,913 INFO L321 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2022-11-20 11:35:23,913 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 187 treesize of output 88 [2022-11-20 11:35:23,930 INFO L321 Elim1Store]: treesize reduction 26, result has 10.3 percent of original size [2022-11-20 11:35:23,930 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 49 [2022-11-20 11:35:24,061 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 13 [2022-11-20 11:35:24,103 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:35:24,103 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:35:28,823 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:35:28,823 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 2887 treesize of output 2848 [2022-11-20 11:35:31,796 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:35:31,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1594897225] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:35:31,796 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:35:31,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 17] total 45 [2022-11-20 11:35:31,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285297220] [2022-11-20 11:35:31,798 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:35:31,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-11-20 11:35:31,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:35:31,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-11-20 11:35:31,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=1768, Unknown=2, NotChecked=0, Total=1980 [2022-11-20 11:35:31,800 INFO L87 Difference]: Start difference. First operand 189 states and 232 transitions. Second operand has 45 states, 45 states have (on average 2.022222222222222) internal successors, (91), 45 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-20 11:35:36,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:35:36,029 INFO L93 Difference]: Finished difference Result 318 states and 391 transitions. [2022-11-20 11:35:36,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-20 11:35:36,030 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 2.022222222222222) internal successors, (91), 45 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 32 [2022-11-20 11:35:36,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:35:36,031 INFO L225 Difference]: With dead ends: 318 [2022-11-20 11:35:36,031 INFO L226 Difference]: Without dead ends: 230 [2022-11-20 11:35:36,032 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 964 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=405, Invalid=2899, Unknown=2, NotChecked=0, Total=3306 [2022-11-20 11:35:36,033 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 169 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 1380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 754 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:35:36,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 606 Invalid, 1380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 602 Invalid, 0 Unknown, 754 Unchecked, 1.2s Time] [2022-11-20 11:35:36,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2022-11-20 11:35:36,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 194. [2022-11-20 11:35:36,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 192 states have (on average 1.2291666666666667) internal successors, (236), 193 states have internal predecessors, (236), 0 states have call successors, (0), 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-20 11:35:36,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 236 transitions. [2022-11-20 11:35:36,084 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 236 transitions. Word has length 32 [2022-11-20 11:35:36,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:35:36,084 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 236 transitions. [2022-11-20 11:35:36,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 2.022222222222222) internal successors, (91), 45 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-20 11:35:36,084 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 236 transitions. [2022-11-20 11:35:36,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-20 11:35:36,085 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:35:36,085 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:35:36,095 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-20 11:35:36,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:35:36,286 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-11-20 11:35:36,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:35:36,287 INFO L85 PathProgramCache]: Analyzing trace with hash -453697263, now seen corresponding path program 1 times [2022-11-20 11:35:36,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:35:36,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482161125] [2022-11-20 11:35:36,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:35:36,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:35:36,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:35:37,286 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:35:37,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:35:37,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482161125] [2022-11-20 11:35:37,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482161125] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:35:37,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [682744982] [2022-11-20 11:35:37,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:35:37,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:35:37,287 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:35:37,288 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:35:37,290 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-20 11:35:37,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:35:37,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 90 conjunts are in the unsatisfiable core [2022-11-20 11:35:37,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:35:37,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:35:37,653 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 38 [2022-11-20 11:35:37,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:35:37,663 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 42 [2022-11-20 11:35:37,698 INFO L321 Elim1Store]: treesize reduction 62, result has 21.5 percent of original size [2022-11-20 11:35:37,699 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 2 case distinctions, treesize of input 103 treesize of output 100 [2022-11-20 11:35:37,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:35:37,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:35:37,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:35:37,714 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 44 [2022-11-20 11:35:37,728 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 15 treesize of output 23 [2022-11-20 11:35:37,734 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 19 treesize of output 31 [2022-11-20 11:35:37,741 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 31 [2022-11-20 11:35:37,777 INFO L321 Elim1Store]: treesize reduction 124, result has 10.8 percent of original size [2022-11-20 11:35:37,777 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 83 treesize of output 70 [2022-11-20 11:35:37,799 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 15 treesize of output 23 [2022-11-20 11:35:37,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:35:37,949 INFO L321 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-11-20 11:35:37,950 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 118 treesize of output 98 [2022-11-20 11:35:37,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:35:37,979 INFO L321 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2022-11-20 11:35:37,979 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 37 [2022-11-20 11:35:37,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:35:37,996 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 60 [2022-11-20 11:35:38,180 INFO L321 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-11-20 11:35:38,180 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 116 treesize of output 96 [2022-11-20 11:35:38,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:35:38,198 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 60 [2022-11-20 11:35:38,878 INFO L321 Elim1Store]: treesize reduction 81, result has 12.0 percent of original size [2022-11-20 11:35:38,878 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 14 case distinctions, treesize of input 154 treesize of output 88 [2022-11-20 11:35:38,899 INFO L321 Elim1Store]: treesize reduction 18, result has 28.0 percent of original size [2022-11-20 11:35:38,899 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 4 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 33 [2022-11-20 11:35:38,930 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:35:38,931 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:35:39,155 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3970 (Array Int Int)) (v_ArrVal_3969 (Array Int Int))) (= (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_3970)) (.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_3969))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (select (select .cse0 (select (select .cse0 .cse1) .cse2)) (+ (select (select .cse3 .cse1) .cse2) 4)))) 0)) (forall ((v_ArrVal_3970 (Array Int Int)) (v_ArrVal_3969 (Array Int Int))) (= (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_3970)) (.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_3969))) (let ((.cse6 (select (select .cse5 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (.cse7 (select (select .cse4 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (select (select .cse4 (select (select .cse5 .cse6) .cse7)) (+ (select (select .cse4 .cse6) .cse7) 4)))) 0))) is different from false [2022-11-20 11:35:39,310 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:35:39,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [682744982] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:35:39,310 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:35:39,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2022-11-20 11:35:39,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101577432] [2022-11-20 11:35:39,311 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:35:39,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-20 11:35:39,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:35:39,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-20 11:35:39,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=360, Unknown=1, NotChecked=38, Total=462 [2022-11-20 11:35:39,312 INFO L87 Difference]: Start difference. First operand 194 states and 236 transitions. Second operand has 22 states, 22 states have (on average 3.227272727272727) internal successors, (71), 22 states have internal predecessors, (71), 0 states have call successors, (0), 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-20 11:35:41,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:35:41,714 INFO L93 Difference]: Finished difference Result 319 states and 391 transitions. [2022-11-20 11:35:41,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 11:35:41,717 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.227272727272727) internal successors, (71), 22 states have internal predecessors, (71), 0 states have call successors, (0), 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 32 [2022-11-20 11:35:41,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:35:41,717 INFO L225 Difference]: With dead ends: 319 [2022-11-20 11:35:41,717 INFO L226 Difference]: Without dead ends: 263 [2022-11-20 11:35:41,718 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=202, Invalid=731, Unknown=1, NotChecked=58, Total=992 [2022-11-20 11:35:41,718 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 277 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 129 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-20 11:35:41,719 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 357 Invalid, 667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 489 Invalid, 0 Unknown, 129 Unchecked, 1.0s Time] [2022-11-20 11:35:41,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2022-11-20 11:35:41,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 215. [2022-11-20 11:35:41,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 213 states have (on average 1.2300469483568075) internal successors, (262), 214 states have internal predecessors, (262), 0 states have call successors, (0), 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-20 11:35:41,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 262 transitions. [2022-11-20 11:35:41,790 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 262 transitions. Word has length 32 [2022-11-20 11:35:41,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:35:41,790 INFO L495 AbstractCegarLoop]: Abstraction has 215 states and 262 transitions. [2022-11-20 11:35:41,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.227272727272727) internal successors, (71), 22 states have internal predecessors, (71), 0 states have call successors, (0), 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-20 11:35:41,791 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 262 transitions. [2022-11-20 11:35:41,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-20 11:35:41,791 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:35:41,791 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:35:41,796 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-20 11:35:41,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-20 11:35:41,992 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-11-20 11:35:41,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:35:41,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1509391101, now seen corresponding path program 1 times [2022-11-20 11:35:41,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:35:41,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661548245] [2022-11-20 11:35:41,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:35:41,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:35:42,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:35:42,825 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:35:42,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:35:42,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661548245] [2022-11-20 11:35:42,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661548245] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:35:42,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305345438] [2022-11-20 11:35:42,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:35:42,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:35:42,826 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:35:42,827 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:35:42,831 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-20 11:35:43,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:35:43,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 90 conjunts are in the unsatisfiable core [2022-11-20 11:35:43,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:35:43,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:35:43,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:35:43,266 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 35 [2022-11-20 11:35:43,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:35:43,282 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 32 [2022-11-20 11:35:43,310 INFO L321 Elim1Store]: treesize reduction 50, result has 25.4 percent of original size [2022-11-20 11:35:43,310 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 2 case distinctions, treesize of input 68 treesize of output 67 [2022-11-20 11:35:43,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:35:43,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:35:43,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:35:43,318 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 27 [2022-11-20 11:35:43,331 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-20 11:35:43,332 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 27 [2022-11-20 11:35:43,344 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 23 [2022-11-20 11:35:43,429 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 11:35:43,429 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 16 treesize of output 22 [2022-11-20 11:35:43,437 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 7 treesize of output 3 [2022-11-20 11:35:43,469 INFO L321 Elim1Store]: treesize reduction 28, result has 49.1 percent of original size [2022-11-20 11:35:43,470 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 59 treesize of output 59 [2022-11-20 11:35:43,527 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-20 11:35:43,735 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 11:35:43,735 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 20 treesize of output 26 [2022-11-20 11:35:43,801 INFO L321 Elim1Store]: treesize reduction 80, result has 32.8 percent of original size [2022-11-20 11:35:43,802 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 8 new quantified variables, introduced 22 case distinctions, treesize of input 122 treesize of output 131 [2022-11-20 11:35:43,815 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-20 11:35:44,807 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:35:44,807 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 159 treesize of output 171 [2022-11-20 11:35:45,578 INFO L321 Elim1Store]: treesize reduction 36, result has 42.9 percent of original size [2022-11-20 11:35:45,578 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 97 treesize of output 89 [2022-11-20 11:35:45,584 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 20 treesize of output 22 [2022-11-20 11:35:45,690 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 11:35:45,691 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 23 treesize of output 27 [2022-11-20 11:35:45,701 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 9 [2022-11-20 11:35:45,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:35:45,707 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 21 treesize of output 20 [2022-11-20 11:35:45,786 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 11:35:45,786 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 28 treesize of output 32 [2022-11-20 11:35:45,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:35:45,808 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 23 treesize of output 22 [2022-11-20 11:35:46,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:35:46,028 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:35:46,029 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 13 [2022-11-20 11:35:46,069 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:35:46,070 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:35:46,347 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~item~0#1.base_75| Int) (v_ArrVal_4209 Int) (v_ArrVal_4211 (Array Int Int))) (or (not (= 0 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_75| v_ArrVal_4211) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (= (select (select (store |c_#memory_int| |v_ULTIMATE.start_main_~item~0#1.base_75| (store (store (select |c_#memory_int| |v_ULTIMATE.start_main_~item~0#1.base_75|) 0 v_ArrVal_4209) 4 0)) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 8)) 0))) is different from false [2022-11-20 11:35:46,365 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~item~0#1.base_75| Int) (v_ArrVal_4209 Int) (v_ArrVal_4211 (Array Int Int)) (v_ArrVal_4206 (Array Int Int)) (v_ArrVal_4207 (Array Int Int))) (or (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_4206))) (store .cse0 |v_ULTIMATE.start_main_~item~0#1.base_75| (store (store (select .cse0 |v_ULTIMATE.start_main_~item~0#1.base_75|) 0 v_ArrVal_4209) 4 0))) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 8)) 0) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_4207) |v_ULTIMATE.start_main_~item~0#1.base_75| v_ArrVal_4211) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0)))) is different from false [2022-11-20 11:35:46,833 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 8)) (.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|)) (.cse5 (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_main_~item~0#1.base_75| Int) (v_ArrVal_4209 Int) (v_ArrVal_4211 (Array Int Int)) (v_ArrVal_4204 Int) (v_ArrVal_4205 (Array Int Int)) (v_ArrVal_4206 (Array Int Int)) (v_ArrVal_4207 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store .cse4 .cse5 v_ArrVal_4204)))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (or (= (select (select (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_4205) .cse1 v_ArrVal_4206))) (store .cse0 |v_ULTIMATE.start_main_~item~0#1.base_75| (store (store (select .cse0 |v_ULTIMATE.start_main_~item~0#1.base_75|) 0 v_ArrVal_4209) 4 0))) |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse2) 0) (= .cse1 0) (not (= (select (select (store (store .cse3 .cse1 v_ArrVal_4207) |v_ULTIMATE.start_main_~item~0#1.base_75| v_ArrVal_4211) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0)))))) (or (forall ((|v_ULTIMATE.start_main_~item~0#1.base_75| Int) (v_ArrVal_4209 Int) (v_ArrVal_4211 (Array Int Int)) (v_ArrVal_4204 Int) (v_ArrVal_4205 (Array Int Int)) (v_ArrVal_4206 (Array Int Int)) (v_ArrVal_4207 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store .cse4 .cse5 v_ArrVal_4204)))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (or (= (select (select (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_4205) .cse7 v_ArrVal_4206))) (store .cse6 |v_ULTIMATE.start_main_~item~0#1.base_75| (store (store (select .cse6 |v_ULTIMATE.start_main_~item~0#1.base_75|) 0 v_ArrVal_4209) 4 0))) |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse2) 0) (not (= (select (select (store (store .cse8 .cse7 v_ArrVal_4207) |v_ULTIMATE.start_main_~item~0#1.base_75| v_ArrVal_4211) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0)))))) (forall ((v_ArrVal_4203 Int)) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) .cse5 v_ArrVal_4203)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0))))) is different from false [2022-11-20 11:35:46,891 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 65 treesize of output 61 [2022-11-20 11:35:46,951 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 8))) (and (forall ((|v_ULTIMATE.start_main_~item~0#1.base_75| Int) (|v_ULTIMATE.start_main_~item~0#1.base_76| Int) (v_ArrVal_4209 Int) (v_ArrVal_4211 (Array Int Int)) (v_ArrVal_4204 Int) (v_ArrVal_4205 (Array Int Int)) (v_ArrVal_4206 (Array Int Int)) (v_ArrVal_4207 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_76| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_76|) 0 0) 4 v_ArrVal_4204)))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (or (= .cse0 0) (= (select (select (let ((.cse1 (store (store |c_#memory_int| |v_ULTIMATE.start_main_~item~0#1.base_76| v_ArrVal_4205) .cse0 v_ArrVal_4206))) (store .cse1 |v_ULTIMATE.start_main_~item~0#1.base_75| (store (store (select .cse1 |v_ULTIMATE.start_main_~item~0#1.base_75|) 0 v_ArrVal_4209) 4 0))) |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse2) 0) (not (= (select (select (store (store .cse3 .cse0 v_ArrVal_4207) |v_ULTIMATE.start_main_~item~0#1.base_75| v_ArrVal_4211) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0)))))) (forall ((|v_ULTIMATE.start_main_~item~0#1.base_75| Int) (|v_ULTIMATE.start_main_~item~0#1.base_76| Int) (v_ArrVal_4209 Int) (v_ArrVal_4211 (Array Int Int)) (v_ArrVal_4204 Int) (v_ArrVal_4205 (Array Int Int)) (v_ArrVal_4206 (Array Int Int)) (v_ArrVal_4207 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_76| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_76|) 0 0) 4 v_ArrVal_4204)))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (or (= (select (select (let ((.cse4 (store (store |c_#memory_int| |v_ULTIMATE.start_main_~item~0#1.base_76| v_ArrVal_4205) .cse5 v_ArrVal_4206))) (store .cse4 |v_ULTIMATE.start_main_~item~0#1.base_75| (store (store (select .cse4 |v_ULTIMATE.start_main_~item~0#1.base_75|) 0 v_ArrVal_4209) 4 0))) |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse2) 0) (not (= (select (select (store (store .cse6 .cse5 v_ArrVal_4207) |v_ULTIMATE.start_main_~item~0#1.base_75| v_ArrVal_4211) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0)) (= |c_ULTIMATE.start_main_~bucket~0#1.base| |v_ULTIMATE.start_main_~item~0#1.base_76|))))) (or (forall ((|v_ULTIMATE.start_main_~item~0#1.base_75| Int) (|v_ULTIMATE.start_main_~item~0#1.base_76| Int) (v_ArrVal_4209 Int) (v_ArrVal_4211 (Array Int Int)) (v_ArrVal_4204 Int) (v_ArrVal_4205 (Array Int Int)) (v_ArrVal_4206 (Array Int Int)) (v_ArrVal_4207 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_76| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_76|) 0 0) 4 v_ArrVal_4204)))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (or (= (select (select (let ((.cse7 (store (store |c_#memory_int| |v_ULTIMATE.start_main_~item~0#1.base_76| v_ArrVal_4205) .cse8 v_ArrVal_4206))) (store .cse7 |v_ULTIMATE.start_main_~item~0#1.base_75| (store (store (select .cse7 |v_ULTIMATE.start_main_~item~0#1.base_75|) 0 v_ArrVal_4209) 4 0))) |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse2) 0) (not (= (select (select (store (store .cse9 .cse8 v_ArrVal_4207) |v_ULTIMATE.start_main_~item~0#1.base_75| v_ArrVal_4211) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0)))))) (= |c_ULTIMATE.start_main_~bucket~0#1.offset| 0)))) is different from false [2022-11-20 11:35:47,026 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-20 11:35:47,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1305345438] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:35:47,026 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:35:47,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 14] total 35 [2022-11-20 11:35:47,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10500900] [2022-11-20 11:35:47,027 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:35:47,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-20 11:35:47,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:35:47,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-20 11:35:47,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=837, Unknown=5, NotChecked=244, Total=1190 [2022-11-20 11:35:47,029 INFO L87 Difference]: Start difference. First operand 215 states and 262 transitions. Second operand has 35 states, 35 states have (on average 2.7142857142857144) internal successors, (95), 35 states have internal predecessors, (95), 0 states have call successors, (0), 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-20 11:35:54,849 WARN L233 SmtUtils]: Spent 6.33s on a formula simplification. DAG size of input: 115 DAG size of output: 65 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 11:35:57,545 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base|) |c_ULTIMATE.start_main_~bcki~0#1.offset|))) (let ((.cse1 (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base|) |c_ULTIMATE.start_main_~bcki~0#1.offset|) 0)) (.cse0 (= .cse2 0))) (and (= |c_ULTIMATE.start_main_#t~mem11#1| 0) (= |c_ULTIMATE.start_main_~bcki~0#1.offset| 0) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~bucket~0#1.base|) 0)) (not (= |c_ULTIMATE.start_main_~item~0#1.base| 0)) (= 0 |c_ULTIMATE.start_main_#t~mem10#1|) (= |c_ULTIMATE.start_main_~bcki~0#1.base| |c_ULTIMATE.start_main_~bucket~0#1.base|) (not (= |c_ULTIMATE.start_main_~bcki~0#1.base| 0)) (or (not .cse0) (not .cse1)) (or (forall ((|v_ULTIMATE.start_main_~item~0#1.base_75| Int) (v_ArrVal_4209 Int) (v_ArrVal_4211 (Array Int Int)) (v_ArrVal_4206 (Array Int Int)) (v_ArrVal_4207 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_4207) |v_ULTIMATE.start_main_~item~0#1.base_75| v_ArrVal_4211) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0)) (= (select (select (let ((.cse3 (store |c_#memory_int| .cse2 v_ArrVal_4206))) (store .cse3 |v_ULTIMATE.start_main_~item~0#1.base_75| (store (store (select .cse3 |v_ULTIMATE.start_main_~item~0#1.base_75|) 0 v_ArrVal_4209) 4 0))) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 8)) 0))) (and .cse1 .cse0)) (= |c_ULTIMATE.start_main_~bcki~0#1.offset| |c_ULTIMATE.start_main_~bucket~0#1.offset|)))) is different from false [2022-11-20 11:36:01,747 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base|) |c_ULTIMATE.start_main_~bcki~0#1.offset|))) (let ((.cse1 (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base|) |c_ULTIMATE.start_main_~bcki~0#1.offset|) 0)) (.cse0 (= .cse2 0))) (and (or (not .cse0) (not .cse1)) (or (forall ((|v_ULTIMATE.start_main_~item~0#1.base_75| Int) (v_ArrVal_4209 Int) (v_ArrVal_4211 (Array Int Int)) (v_ArrVal_4206 (Array Int Int)) (v_ArrVal_4207 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_4207) |v_ULTIMATE.start_main_~item~0#1.base_75| v_ArrVal_4211) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0)) (= (select (select (let ((.cse3 (store |c_#memory_int| .cse2 v_ArrVal_4206))) (store .cse3 |v_ULTIMATE.start_main_~item~0#1.base_75| (store (store (select .cse3 |v_ULTIMATE.start_main_~item~0#1.base_75|) 0 v_ArrVal_4209) 4 0))) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 8)) 0))) (and .cse1 .cse0))))) is different from false [2022-11-20 11:36:02,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:36:02,010 INFO L93 Difference]: Finished difference Result 323 states and 399 transitions. [2022-11-20 11:36:02,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-20 11:36:02,010 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.7142857142857144) internal successors, (95), 35 states have internal predecessors, (95), 0 states have call successors, (0), 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-20 11:36:02,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:36:02,012 INFO L225 Difference]: With dead ends: 323 [2022-11-20 11:36:02,012 INFO L226 Difference]: Without dead ends: 267 [2022-11-20 11:36:02,013 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 47 SyntacticMatches, 5 SemanticMatches, 56 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 543 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=371, Invalid=2284, Unknown=21, NotChecked=630, Total=3306 [2022-11-20 11:36:02,013 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 144 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 1003 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 506 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-20 11:36:02,013 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 623 Invalid, 1003 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 472 Invalid, 0 Unknown, 506 Unchecked, 0.8s Time] [2022-11-20 11:36:02,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2022-11-20 11:36:02,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 236. [2022-11-20 11:36:02,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 234 states have (on average 1.2222222222222223) internal successors, (286), 235 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-20 11:36:02,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 286 transitions. [2022-11-20 11:36:02,080 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 286 transitions. Word has length 33 [2022-11-20 11:36:02,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:36:02,080 INFO L495 AbstractCegarLoop]: Abstraction has 236 states and 286 transitions. [2022-11-20 11:36:02,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.7142857142857144) internal successors, (95), 35 states have internal predecessors, (95), 0 states have call successors, (0), 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-20 11:36:02,081 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 286 transitions. [2022-11-20 11:36:02,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-20 11:36:02,081 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:36:02,082 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:36:02,091 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-20 11:36:02,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:36:02,288 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-11-20 11:36:02,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:36:02,288 INFO L85 PathProgramCache]: Analyzing trace with hash -2136216575, now seen corresponding path program 1 times [2022-11-20 11:36:02,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:36:02,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757357357] [2022-11-20 11:36:02,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:36:02,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:36:02,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:36:03,391 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:36:03,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:36:03,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757357357] [2022-11-20 11:36:03,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757357357] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:36:03,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [32875803] [2022-11-20 11:36:03,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:36:03,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:36:03,391 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:36:03,393 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:36:03,426 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-20 11:36:03,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:36:03,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 64 conjunts are in the unsatisfiable core [2022-11-20 11:36:03,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:36:03,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:36:03,840 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 32 [2022-11-20 11:36:03,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:36:03,848 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 30 [2022-11-20 11:36:03,878 INFO L321 Elim1Store]: treesize reduction 50, result has 25.4 percent of original size [2022-11-20 11:36:03,878 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 76 treesize of output 75 [2022-11-20 11:36:03,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:36:03,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:36:03,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:36:03,890 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2022-11-20 11:36:03,923 INFO L321 Elim1Store]: treesize reduction 76, result has 16.5 percent of original size [2022-11-20 11:36:03,923 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 46 [2022-11-20 11:36:03,932 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 23 [2022-11-20 11:36:04,015 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 11:36:04,016 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 14 treesize of output 20 [2022-11-20 11:36:04,021 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-20 11:36:04,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:36:04,040 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-20 11:36:04,041 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 48 [2022-11-20 11:36:04,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:36:04,076 INFO L321 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2022-11-20 11:36:04,076 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 41 [2022-11-20 11:36:04,155 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-20 11:36:04,155 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 54 [2022-11-20 11:36:04,163 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-20 11:36:04,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:36:04,487 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-20 11:36:04,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:36:04,497 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-20 11:36:04,497 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 44 [2022-11-20 11:36:04,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:36:04,555 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-20 11:36:04,556 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 48 [2022-11-20 11:36:04,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:36:04,579 INFO L321 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-11-20 11:36:04,580 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2022-11-20 11:36:04,599 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-20 11:36:04,688 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-20 11:36:04,688 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 47 [2022-11-20 11:36:04,697 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-20 11:36:04,854 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-20 11:36:04,920 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 11:36:04,920 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 23 [2022-11-20 11:36:04,926 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-20 11:36:04,927 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:36:05,010 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4447 (Array Int Int)) (v_ArrVal_4448 (Array Int Int))) (not (= (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_4447))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_4448) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|)) 0))) is different from false [2022-11-20 11:36:05,266 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~bcki~0#1.offset_110| Int) (|v_ULTIMATE.start_main_~item~0#1.base_78| Int) (v_ArrVal_4444 Int) (v_ArrVal_4447 (Array Int Int)) (v_ArrVal_4448 (Array Int Int)) (v_ArrVal_4443 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_78|) 0)) (not (= (let ((.cse1 (+ 4 |v_ULTIMATE.start_main_~bcki~0#1.offset_110|))) (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse1 v_ArrVal_4443)) |v_ULTIMATE.start_main_~item~0#1.base_78| v_ArrVal_4447))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bucket~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse1 v_ArrVal_4444)) |v_ULTIMATE.start_main_~item~0#1.base_78| v_ArrVal_4448) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) 0)) (not (<= |c_ULTIMATE.start_main_~bucket~0#1.offset| |v_ULTIMATE.start_main_~bcki~0#1.offset_110|)))) is different from false [2022-11-20 11:36:05,291 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~bcki~0#1.offset_110| Int) (v_ArrVal_4440 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_78| Int) (v_ArrVal_4444 Int) (v_ArrVal_4447 (Array Int Int)) (v_ArrVal_4448 (Array Int Int)) (v_ArrVal_4443 Int) (v_ArrVal_4439 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_78|) 0)) (not (<= |c_ULTIMATE.start_main_~bucket~0#1.offset| |v_ULTIMATE.start_main_~bcki~0#1.offset_110|)) (not (= (let ((.cse2 (+ 4 |v_ULTIMATE.start_main_~bcki~0#1.offset_110|))) (select (let ((.cse0 (store (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_4440))) (store .cse1 |c_ULTIMATE.start_main_~bucket~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse2 v_ArrVal_4443))) |v_ULTIMATE.start_main_~item~0#1.base_78| v_ArrVal_4447))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (select (select (store (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_4439))) (store .cse3 |c_ULTIMATE.start_main_~bucket~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse2 v_ArrVal_4444))) |v_ULTIMATE.start_main_~item~0#1.base_78| v_ArrVal_4448) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) 0)))) is different from false [2022-11-20 11:36:05,321 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~bcki~0#1.offset_110| Int) (v_ArrVal_4440 (Array Int Int)) (v_ArrVal_4437 Int) (|v_ULTIMATE.start_main_~item~0#1.base_78| Int) (|v_ULTIMATE.start_main_~item~0#1.base_79| Int) (v_ArrVal_4444 Int) (v_ArrVal_4447 (Array Int Int)) (v_ArrVal_4448 (Array Int Int)) (v_ArrVal_4443 Int) (v_ArrVal_4439 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_79|) 0)) (not (<= |c_ULTIMATE.start_main_~bucket~0#1.offset| |v_ULTIMATE.start_main_~bcki~0#1.offset_110|)) (not (= (let ((.cse2 (+ 4 |v_ULTIMATE.start_main_~bcki~0#1.offset_110|))) (select (let ((.cse0 (store (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_79| v_ArrVal_4440))) (store .cse1 |c_ULTIMATE.start_main_~bucket~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse2 v_ArrVal_4443))) |v_ULTIMATE.start_main_~item~0#1.base_78| v_ArrVal_4447))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (select (select (store (let ((.cse3 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_79| v_ArrVal_4439))) (store .cse3 |c_ULTIMATE.start_main_~bucket~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse2 v_ArrVal_4444))) |v_ULTIMATE.start_main_~item~0#1.base_78| v_ArrVal_4448) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) 0)) (not (= 0 (select (store |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_79| v_ArrVal_4437) |v_ULTIMATE.start_main_~item~0#1.base_78|))))) is different from false [2022-11-20 11:36:05,381 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-11-20 11:36:05,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [32875803] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:36:05,381 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:36:05,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 12] total 28 [2022-11-20 11:36:05,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123409760] [2022-11-20 11:36:05,382 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:36:05,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-20 11:36:05,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:36:05,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-20 11:36:05,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=446, Unknown=6, NotChecked=188, Total=756 [2022-11-20 11:36:05,383 INFO L87 Difference]: Start difference. First operand 236 states and 286 transitions. Second operand has 28 states, 28 states have (on average 3.142857142857143) internal successors, (88), 28 states have internal predecessors, (88), 0 states have call successors, (0), 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-20 11:36:06,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:36:06,882 INFO L93 Difference]: Finished difference Result 355 states and 434 transitions. [2022-11-20 11:36:06,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-20 11:36:06,883 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.142857142857143) internal successors, (88), 28 states have internal predecessors, (88), 0 states have call successors, (0), 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-20 11:36:06,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:36:06,885 INFO L225 Difference]: With dead ends: 355 [2022-11-20 11:36:06,885 INFO L226 Difference]: Without dead ends: 353 [2022-11-20 11:36:06,885 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 52 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=244, Invalid=887, Unknown=7, NotChecked=268, Total=1406 [2022-11-20 11:36:06,886 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 289 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 1124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 618 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-20 11:36:06,886 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 545 Invalid, 1124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 446 Invalid, 0 Unknown, 618 Unchecked, 0.8s Time] [2022-11-20 11:36:06,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2022-11-20 11:36:06,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 257. [2022-11-20 11:36:06,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 255 states have (on average 1.2352941176470589) internal successors, (315), 256 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:36:06,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 315 transitions. [2022-11-20 11:36:06,992 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 315 transitions. Word has length 33 [2022-11-20 11:36:06,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:36:06,992 INFO L495 AbstractCegarLoop]: Abstraction has 257 states and 315 transitions. [2022-11-20 11:36:06,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.142857142857143) internal successors, (88), 28 states have internal predecessors, (88), 0 states have call successors, (0), 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-20 11:36:06,992 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 315 transitions. [2022-11-20 11:36:06,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-20 11:36:06,993 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:36:06,993 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:36:07,003 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-11-20 11:36:07,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:36:07,203 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-11-20 11:36:07,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:36:07,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1623153213, now seen corresponding path program 1 times [2022-11-20 11:36:07,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:36:07,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842102207] [2022-11-20 11:36:07,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:36:07,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:36:07,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:36:07,773 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:36:07,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:36:07,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842102207] [2022-11-20 11:36:07,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842102207] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:36:07,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1567223266] [2022-11-20 11:36:07,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:36:07,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:36:07,774 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:36:07,774 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:36:07,777 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-20 11:36:08,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:36:08,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 90 conjunts are in the unsatisfiable core [2022-11-20 11:36:08,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:36:08,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:36:08,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:36:08,180 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 35 [2022-11-20 11:36:08,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:36:08,189 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 32 [2022-11-20 11:36:08,218 INFO L321 Elim1Store]: treesize reduction 50, result has 25.4 percent of original size [2022-11-20 11:36:08,219 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 2 case distinctions, treesize of input 84 treesize of output 81 [2022-11-20 11:36:08,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:36:08,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:36:08,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:36:08,230 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 27 [2022-11-20 11:36:08,262 INFO L321 Elim1Store]: treesize reduction 76, result has 16.5 percent of original size [2022-11-20 11:36:08,262 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 46 [2022-11-20 11:36:08,270 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 23 [2022-11-20 11:36:08,370 INFO L321 Elim1Store]: treesize reduction 28, result has 49.1 percent of original size [2022-11-20 11:36:08,370 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 59 treesize of output 59 [2022-11-20 11:36:08,429 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 11:36:08,429 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 16 treesize of output 22 [2022-11-20 11:36:08,439 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 7 treesize of output 3 [2022-11-20 11:36:08,456 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 11:36:08,456 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-20 11:36:08,467 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-20 11:36:08,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:36:08,646 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:36:08,688 INFO L321 Elim1Store]: treesize reduction 72, result has 30.1 percent of original size [2022-11-20 11:36:08,688 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 17 case distinctions, treesize of input 114 treesize of output 119 [2022-11-20 11:36:08,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:36:08,917 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 27 treesize of output 26 [2022-11-20 11:36:08,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:36:08,933 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 21 treesize of output 20 [2022-11-20 11:36:09,741 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:36:09,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:36:09,752 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:36:09,752 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 17 [2022-11-20 11:36:10,009 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:36:10,009 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 158 treesize of output 170 [2022-11-20 11:36:11,054 INFO L321 Elim1Store]: treesize reduction 36, result has 42.9 percent of original size [2022-11-20 11:36:11,054 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 89 treesize of output 85 [2022-11-20 11:36:11,150 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 11:36:11,150 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 23 treesize of output 27 [2022-11-20 11:36:11,160 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 9 [2022-11-20 11:36:11,169 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 11:36:11,169 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-20 11:36:11,223 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-11-20 11:36:11,337 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 24 treesize of output 12 [2022-11-20 11:36:11,343 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:36:11,343 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:36:11,364 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4691 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_4691) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0))) is different from false [2022-11-20 11:36:12,167 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 183 treesize of output 179 [2022-11-20 11:36:12,183 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:36:12,183 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2022-11-20 11:36:12,364 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 8))) (and (forall ((v_arrayElimArr_40 (Array Int Int))) (or (forall ((v_prenex_27 Int) (v_prenex_26 Int) (v_ArrVal_4679 Int) (v_prenex_25 (Array Int Int)) (v_prenex_24 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_82| Int)) (or (not (= (select (store |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_82| v_ArrVal_4679) v_prenex_27) 0)) (not (= (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_82| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_82|) 0 0) 4 v_prenex_26)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) v_prenex_25)) v_prenex_27 v_prenex_24) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0)) (= |c_ULTIMATE.start_main_~bucket~0#1.base| |v_ULTIMATE.start_main_~item~0#1.base_82|) (= (select (select (store |c_#memory_int| |v_ULTIMATE.start_main_~item~0#1.base_82| v_arrayElimArr_40) |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse1) 1))) (not (= (select v_arrayElimArr_40 4) 1)))) (or (= |c_ULTIMATE.start_main_~bucket~0#1.offset| 0) (forall ((v_prenex_27 Int) (v_prenex_26 Int) (v_ArrVal_4679 Int) (v_prenex_25 (Array Int Int)) (v_prenex_24 (Array Int Int)) (v_arrayElimArr_40 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_82| Int)) (or (not (= (select (store |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_82| v_ArrVal_4679) v_prenex_27) 0)) (not (= (select v_arrayElimArr_40 4) 1)) (not (= (select (select (store (let ((.cse2 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_82| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_82|) 0 0) 4 v_prenex_26)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) v_prenex_25)) v_prenex_27 v_prenex_24) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0)) (= (select (select (store |c_#memory_int| |v_ULTIMATE.start_main_~item~0#1.base_82| v_arrayElimArr_40) |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse1) 1)))) (forall ((v_arrayElimArr_40 (Array Int Int))) (or (not (= (select v_arrayElimArr_40 4) 1)) (forall ((|v_ULTIMATE.start_main_~item~0#1.base_82| Int)) (or (forall ((v_ArrVal_4691 (Array Int Int)) (v_ArrVal_4679 Int) (v_ArrVal_4689 (Array Int Int)) (v_ArrVal_4685 Int) (|v_ULTIMATE.start_main_~item~0#1.base_81| Int)) (let ((.cse3 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_82| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_82|) 0 0) 4 v_ArrVal_4685)))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (or (not (= (select (select (store (store .cse3 .cse4 v_ArrVal_4689) |v_ULTIMATE.start_main_~item~0#1.base_81| v_ArrVal_4691) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0)) (= .cse4 0) (not (= (select (store |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_82| v_ArrVal_4679) |v_ULTIMATE.start_main_~item~0#1.base_81|) 0)))))) (= (select (select (store |c_#memory_int| |v_ULTIMATE.start_main_~item~0#1.base_82| v_arrayElimArr_40) |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse1) 1))))))) is different from false [2022-11-20 11:36:12,508 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-11-20 11:36:12,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1567223266] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:36:12,508 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:36:12,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 14] total 32 [2022-11-20 11:36:12,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269950110] [2022-11-20 11:36:12,509 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:36:12,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-20 11:36:12,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:36:12,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-20 11:36:12,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=752, Unknown=4, NotChecked=114, Total=992 [2022-11-20 11:36:12,511 INFO L87 Difference]: Start difference. First operand 257 states and 315 transitions. Second operand has 32 states, 32 states have (on average 2.65625) internal successors, (85), 32 states have internal predecessors, (85), 0 states have call successors, (0), 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-20 11:36:14,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:36:14,732 INFO L93 Difference]: Finished difference Result 353 states and 434 transitions. [2022-11-20 11:36:14,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-20 11:36:14,733 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.65625) internal successors, (85), 32 states have internal predecessors, (85), 0 states have call successors, (0), 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 34 [2022-11-20 11:36:14,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:36:14,734 INFO L225 Difference]: With dead ends: 353 [2022-11-20 11:36:14,734 INFO L226 Difference]: Without dead ends: 351 [2022-11-20 11:36:14,735 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 57 SyntacticMatches, 8 SemanticMatches, 43 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 452 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=365, Invalid=1445, Unknown=4, NotChecked=166, Total=1980 [2022-11-20 11:36:14,735 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 499 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 1292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 798 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-20 11:36:14,736 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [499 Valid, 618 Invalid, 1292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 403 Invalid, 0 Unknown, 798 Unchecked, 0.7s Time] [2022-11-20 11:36:14,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2022-11-20 11:36:14,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 271. [2022-11-20 11:36:14,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 269 states have (on average 1.245353159851301) internal successors, (335), 270 states have internal predecessors, (335), 0 states have call successors, (0), 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-20 11:36:14,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 335 transitions. [2022-11-20 11:36:14,811 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 335 transitions. Word has length 34 [2022-11-20 11:36:14,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:36:14,811 INFO L495 AbstractCegarLoop]: Abstraction has 271 states and 335 transitions. [2022-11-20 11:36:14,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.65625) internal successors, (85), 32 states have internal predecessors, (85), 0 states have call successors, (0), 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-20 11:36:14,811 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 335 transitions. [2022-11-20 11:36:14,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-20 11:36:14,812 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:36:14,812 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2022-11-20 11:36:14,819 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-11-20 11:36:15,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-11-20 11:36:15,019 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-11-20 11:36:15,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:36:15,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1434701115, now seen corresponding path program 1 times [2022-11-20 11:36:15,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:36:15,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169191872] [2022-11-20 11:36:15,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:36:15,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:36:15,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:36:16,215 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:36:16,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:36:16,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169191872] [2022-11-20 11:36:16,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169191872] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:36:16,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1356537633] [2022-11-20 11:36:16,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:36:16,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:36:16,216 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:36:16,217 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:36:16,223 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-11-20 11:36:16,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:36:16,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 91 conjunts are in the unsatisfiable core [2022-11-20 11:36:16,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:36:16,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:36:16,633 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 32 [2022-11-20 11:36:16,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:36:16,642 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 32 [2022-11-20 11:36:16,670 INFO L321 Elim1Store]: treesize reduction 50, result has 25.4 percent of original size [2022-11-20 11:36:16,670 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 2 case distinctions, treesize of input 90 treesize of output 87 [2022-11-20 11:36:16,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:36:16,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:36:16,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:36:16,679 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-20 11:36:16,712 INFO L321 Elim1Store]: treesize reduction 76, result has 16.5 percent of original size [2022-11-20 11:36:16,713 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 46 [2022-11-20 11:36:16,727 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 23 [2022-11-20 11:36:16,741 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 23 [2022-11-20 11:36:16,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:36:16,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:36:16,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:36:16,868 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2022-11-20 11:36:16,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:36:16,884 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-20 11:36:16,884 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 98 treesize of output 78 [2022-11-20 11:36:16,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:36:16,915 INFO L321 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2022-11-20 11:36:16,915 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 37 [2022-11-20 11:36:17,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:36:17,032 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2022-11-20 11:36:17,047 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-20 11:36:17,047 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 96 treesize of output 76 [2022-11-20 11:36:17,760 INFO L321 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-11-20 11:36:17,761 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 146 treesize of output 105 [2022-11-20 11:36:17,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:36:17,809 INFO L321 Elim1Store]: treesize reduction 104, result has 22.4 percent of original size [2022-11-20 11:36:17,809 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 59 [2022-11-20 11:36:17,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:36:17,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:36:17,953 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 48 [2022-11-20 11:36:17,957 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:36:17,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:36:17,968 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-20 11:36:17,969 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 83 treesize of output 63 [2022-11-20 11:36:18,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:36:18,143 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:36:18,153 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-20 11:36:18,154 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 6 case distinctions, treesize of input 104 treesize of output 56 [2022-11-20 11:36:18,167 INFO L321 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2022-11-20 11:36:18,167 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 21 [2022-11-20 11:36:18,204 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:36:18,204 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:36:19,368 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4))) (and (forall ((v_ArrVal_4920 (Array Int Int)) (v_ArrVal_4921 (Array Int Int)) (v_subst_2 Int)) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_4921)) (.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_4920))) (let ((.cse4 (select (select .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (select (select .cse5 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (.cse6 (+ 4 v_subst_2))) (or (forall ((v_ArrVal_4924 Int) (v_ArrVal_4923 (Array Int Int)) (v_ArrVal_4928 Int)) (= (let ((.cse0 (store .cse5 .cse4 (store (select .cse5 .cse4) .cse6 v_ArrVal_4924)))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~bucket~0#1.base|))) (select (select (store .cse0 |c_ULTIMATE.start_main_~bucket~0#1.base| (store .cse1 .cse2 v_ArrVal_4928)) (select (select (store .cse3 .cse4 v_ArrVal_4923) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (+ 4 (select .cse1 |c_ULTIMATE.start_main_~bucket~0#1.offset|))))) 0)) (not (= (select (select .cse3 .cse4) .cse6) 0)))))) (forall ((v_ArrVal_4920 (Array Int Int)) (v_ArrVal_4921 (Array Int Int)) (v_subst_1 Int)) (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_4921)) (.cse11 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_4920))) (let ((.cse10 (select (select .cse9 (select (select .cse9 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (select (select .cse11 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (.cse12 (+ 4 v_subst_1))) (or (forall ((v_ArrVal_4925 Int) (v_ArrVal_4924 Int) (v_ArrVal_4923 (Array Int Int))) (= (select (let ((.cse7 (store .cse9 .cse10 v_ArrVal_4923))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~bucket~0#1.base|))) (select (store .cse7 |c_ULTIMATE.start_main_~bucket~0#1.base| (store .cse8 .cse2 v_ArrVal_4925)) (select .cse8 |c_ULTIMATE.start_main_~bucket~0#1.offset|)))) (+ (select (select (store .cse11 .cse10 (store (select .cse11 .cse10) .cse12 v_ArrVal_4924)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 4)) 0)) (not (= (select (select .cse9 .cse10) .cse12) 0)))))))) is different from false [2022-11-20 11:36:19,767 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:36:19,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1356537633] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:36:19,768 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:36:19,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 14] total 34 [2022-11-20 11:36:19,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519987382] [2022-11-20 11:36:19,768 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:36:19,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-20 11:36:19,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:36:19,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-20 11:36:19,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=909, Unknown=1, NotChecked=62, Total=1122 [2022-11-20 11:36:19,770 INFO L87 Difference]: Start difference. First operand 271 states and 335 transitions. Second operand has 34 states, 34 states have (on average 2.735294117647059) internal successors, (93), 34 states have internal predecessors, (93), 0 states have call successors, (0), 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-20 11:36:25,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:36:25,938 INFO L93 Difference]: Finished difference Result 292 states and 358 transitions. [2022-11-20 11:36:25,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-20 11:36:25,939 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.735294117647059) internal successors, (93), 34 states have internal predecessors, (93), 0 states have call successors, (0), 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 34 [2022-11-20 11:36:25,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:36:25,940 INFO L225 Difference]: With dead ends: 292 [2022-11-20 11:36:25,941 INFO L226 Difference]: Without dead ends: 281 [2022-11-20 11:36:25,942 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 576 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=329, Invalid=1744, Unknown=1, NotChecked=88, Total=2162 [2022-11-20 11:36:25,942 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 128 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 312 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-20 11:36:25,942 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 508 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 360 Invalid, 0 Unknown, 312 Unchecked, 0.7s Time] [2022-11-20 11:36:25,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2022-11-20 11:36:26,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 276. [2022-11-20 11:36:26,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 274 states have (on average 1.2408759124087592) internal successors, (340), 275 states have internal predecessors, (340), 0 states have call successors, (0), 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-20 11:36:26,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 340 transitions. [2022-11-20 11:36:26,074 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 340 transitions. Word has length 34 [2022-11-20 11:36:26,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:36:26,075 INFO L495 AbstractCegarLoop]: Abstraction has 276 states and 340 transitions. [2022-11-20 11:36:26,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.735294117647059) internal successors, (93), 34 states have internal predecessors, (93), 0 states have call successors, (0), 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-20 11:36:26,075 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 340 transitions. [2022-11-20 11:36:26,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-20 11:36:26,076 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:36:26,076 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-20 11:36:26,082 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-11-20 11:36:26,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:36:26,279 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-11-20 11:36:26,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:36:26,279 INFO L85 PathProgramCache]: Analyzing trace with hash 443647896, now seen corresponding path program 1 times [2022-11-20 11:36:26,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:36:26,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393458882] [2022-11-20 11:36:26,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:36:26,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:36:26,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:36:27,092 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 11:36:27,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:36:27,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393458882] [2022-11-20 11:36:27,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393458882] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:36:27,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2084650163] [2022-11-20 11:36:27,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:36:27,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:36:27,093 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:36:27,094 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:36:27,096 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-11-20 11:36:27,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:36:27,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 108 conjunts are in the unsatisfiable core [2022-11-20 11:36:27,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:36:27,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:36:27,529 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 32 [2022-11-20 11:36:27,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:36:27,538 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 32 [2022-11-20 11:36:27,565 INFO L321 Elim1Store]: treesize reduction 50, result has 25.4 percent of original size [2022-11-20 11:36:27,566 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 2 case distinctions, treesize of input 91 treesize of output 88 [2022-11-20 11:36:27,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:36:27,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:36:27,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:36:27,577 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-11-20 11:36:27,580 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 15 treesize of output 23 [2022-11-20 11:36:27,620 INFO L321 Elim1Store]: treesize reduction 76, result has 16.5 percent of original size [2022-11-20 11:36:27,620 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 46 [2022-11-20 11:36:27,630 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 23 [2022-11-20 11:36:27,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:36:27,755 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-20 11:36:27,755 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 99 treesize of output 79 [2022-11-20 11:36:27,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:36:27,782 INFO L321 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2022-11-20 11:36:27,782 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 37 [2022-11-20 11:36:27,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:36:27,806 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2022-11-20 11:36:27,890 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-20 11:36:27,890 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 97 treesize of output 77 [2022-11-20 11:36:27,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:36:27,902 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2022-11-20 11:36:28,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:36:28,490 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:36:28,512 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-11-20 11:36:28,513 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 104 treesize of output 70 [2022-11-20 11:36:28,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:36:28,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:36:28,541 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 48 [2022-11-20 11:36:28,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:36:28,784 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:36:28,796 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-11-20 11:36:28,796 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 126 treesize of output 74 [2022-11-20 11:36:28,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:36:28,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:36:28,806 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 54 [2022-11-20 11:36:29,421 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:36:29,433 INFO L321 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-11-20 11:36:29,434 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 131 treesize of output 67 [2022-11-20 11:36:29,450 INFO L321 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2022-11-20 11:36:29,450 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 24 [2022-11-20 11:36:29,479 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:36:29,479 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:36:32,094 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:36:32,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2084650163] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:36:32,095 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:36:32,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 13] total 31 [2022-11-20 11:36:32,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664930543] [2022-11-20 11:36:32,096 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:36:32,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-20 11:36:32,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:36:32,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-20 11:36:32,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=768, Unknown=11, NotChecked=0, Total=930 [2022-11-20 11:36:32,098 INFO L87 Difference]: Start difference. First operand 276 states and 340 transitions. Second operand has 31 states, 31 states have (on average 3.0) internal successors, (93), 31 states have internal predecessors, (93), 0 states have call successors, (0), 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-20 11:36:35,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:36:35,439 INFO L93 Difference]: Finished difference Result 396 states and 483 transitions. [2022-11-20 11:36:35,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-20 11:36:35,439 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 3.0) internal successors, (93), 31 states have internal predecessors, (93), 0 states have call successors, (0), 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 34 [2022-11-20 11:36:35,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:36:35,441 INFO L225 Difference]: With dead ends: 396 [2022-11-20 11:36:35,441 INFO L226 Difference]: Without dead ends: 385 [2022-11-20 11:36:35,442 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 56 SyntacticMatches, 4 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 617 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=495, Invalid=2041, Unknown=14, NotChecked=0, Total=2550 [2022-11-20 11:36:35,442 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 506 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 506 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 372 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-20 11:36:35,443 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [506 Valid, 563 Invalid, 899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 438 Invalid, 0 Unknown, 372 Unchecked, 0.9s Time] [2022-11-20 11:36:35,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2022-11-20 11:36:35,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 283. [2022-11-20 11:36:35,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 281 states have (on average 1.2384341637010676) internal successors, (348), 282 states have internal predecessors, (348), 0 states have call successors, (0), 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-20 11:36:35,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 348 transitions. [2022-11-20 11:36:35,566 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 348 transitions. Word has length 34 [2022-11-20 11:36:35,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:36:35,567 INFO L495 AbstractCegarLoop]: Abstraction has 283 states and 348 transitions. [2022-11-20 11:36:35,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.0) internal successors, (93), 31 states have internal predecessors, (93), 0 states have call successors, (0), 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-20 11:36:35,567 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 348 transitions. [2022-11-20 11:36:35,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-20 11:36:35,568 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:36:35,568 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:36:35,582 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-11-20 11:36:35,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-11-20 11:36:35,786 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-11-20 11:36:35,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:36:35,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1198181862, now seen corresponding path program 2 times [2022-11-20 11:36:35,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:36:35,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180174880] [2022-11-20 11:36:35,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:36:35,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:36:35,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:36:36,785 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:36:36,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:36:36,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180174880] [2022-11-20 11:36:36,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180174880] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:36:36,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2128457660] [2022-11-20 11:36:36,786 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 11:36:36,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:36:36,786 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:36:36,787 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:36:36,819 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-11-20 11:36:37,478 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 11:36:37,479 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:36:37,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 97 conjunts are in the unsatisfiable core [2022-11-20 11:36:37,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:36:37,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:36:37,518 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 38 [2022-11-20 11:36:37,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:36:37,529 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 38 [2022-11-20 11:36:37,568 INFO L321 Elim1Store]: treesize reduction 62, result has 21.5 percent of original size [2022-11-20 11:36:37,568 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 2 case distinctions, treesize of input 122 treesize of output 117 [2022-11-20 11:36:37,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:36:37,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:36:37,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:36:37,580 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 37 [2022-11-20 11:36:37,582 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 15 treesize of output 23 [2022-11-20 11:36:37,593 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 40 [2022-11-20 11:36:37,645 INFO L321 Elim1Store]: treesize reduction 76, result has 16.5 percent of original size [2022-11-20 11:36:37,646 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 46 [2022-11-20 11:36:37,661 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 23 [2022-11-20 11:36:37,669 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-20 11:36:37,678 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 19 treesize of output 31 [2022-11-20 11:36:37,688 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 19 treesize of output 31 [2022-11-20 11:36:37,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:36:37,857 INFO L321 Elim1Store]: treesize reduction 56, result has 21.1 percent of original size [2022-11-20 11:36:37,858 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 125 treesize of output 87 [2022-11-20 11:36:37,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:36:37,891 INFO L321 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2022-11-20 11:36:37,891 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 37 [2022-11-20 11:36:37,908 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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-20 11:36:37,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:36:37,917 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 50 [2022-11-20 11:36:38,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:36:38,073 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:36:38,090 INFO L321 Elim1Store]: treesize reduction 57, result has 10.9 percent of original size [2022-11-20 11:36:38,090 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 132 treesize of output 97 [2022-11-20 11:36:38,106 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-11-20 11:36:38,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:36:38,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:36:38,123 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 62 [2022-11-20 11:36:38,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:36:38,651 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 16 [2022-11-20 11:36:38,669 INFO L321 Elim1Store]: treesize reduction 37, result has 9.8 percent of original size [2022-11-20 11:36:38,670 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 100 treesize of output 46 [2022-11-20 11:36:38,715 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:36:38,716 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-11-20 11:36:38,749 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-20 11:36:38,749 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:36:39,152 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:36:39,152 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 131 treesize of output 132 [2022-11-20 11:36:39,436 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-20 11:36:39,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2128457660] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:36:39,437 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:36:39,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 9] total 26 [2022-11-20 11:36:39,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553462001] [2022-11-20 11:36:39,437 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:36:39,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-20 11:36:39,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:36:39,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-20 11:36:39,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=571, Unknown=0, NotChecked=0, Total=650 [2022-11-20 11:36:39,439 INFO L87 Difference]: Start difference. First operand 283 states and 348 transitions. Second operand has 26 states, 26 states have (on average 3.076923076923077) internal successors, (80), 26 states have internal predecessors, (80), 0 states have call successors, (0), 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-20 11:36:46,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:36:46,198 INFO L93 Difference]: Finished difference Result 645 states and 802 transitions. [2022-11-20 11:36:46,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-20 11:36:46,199 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.076923076923077) internal successors, (80), 26 states have internal predecessors, (80), 0 states have call successors, (0), 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 35 [2022-11-20 11:36:46,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:36:46,200 INFO L225 Difference]: With dead ends: 645 [2022-11-20 11:36:46,201 INFO L226 Difference]: Without dead ends: 508 [2022-11-20 11:36:46,202 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 751 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=685, Invalid=2737, Unknown=0, NotChecked=0, Total=3422 [2022-11-20 11:36:46,202 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 807 mSDsluCounter, 717 mSDsCounter, 0 mSdLazyCounter, 1118 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 807 SdHoareTripleChecker+Valid, 769 SdHoareTripleChecker+Invalid, 1456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 1118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 208 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-20 11:36:46,203 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [807 Valid, 769 Invalid, 1456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 1118 Invalid, 0 Unknown, 208 Unchecked, 1.8s Time] [2022-11-20 11:36:46,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2022-11-20 11:36:46,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 277. [2022-11-20 11:36:46,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 275 states have (on average 1.210909090909091) internal successors, (333), 276 states have internal predecessors, (333), 0 states have call successors, (0), 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-20 11:36:46,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 333 transitions. [2022-11-20 11:36:46,304 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 333 transitions. Word has length 35 [2022-11-20 11:36:46,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:36:46,304 INFO L495 AbstractCegarLoop]: Abstraction has 277 states and 333 transitions. [2022-11-20 11:36:46,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.076923076923077) internal successors, (80), 26 states have internal predecessors, (80), 0 states have call successors, (0), 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-20 11:36:46,305 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 333 transitions. [2022-11-20 11:36:46,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-20 11:36:46,306 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:36:46,306 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:36:46,318 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-11-20 11:36:46,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-11-20 11:36:46,514 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-11-20 11:36:46,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:36:46,514 INFO L85 PathProgramCache]: Analyzing trace with hash -598845146, now seen corresponding path program 3 times [2022-11-20 11:36:46,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:36:46,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870079114] [2022-11-20 11:36:46,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:36:46,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:36:46,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:36:47,314 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-20 11:36:47,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:36:47,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870079114] [2022-11-20 11:36:47,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870079114] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:36:47,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1379370372] [2022-11-20 11:36:47,315 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 11:36:47,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:36:47,315 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:36:47,316 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:36:47,338 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-11-20 11:36:48,040 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-20 11:36:48,040 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:36:48,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 59 conjunts are in the unsatisfiable core [2022-11-20 11:36:48,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:36:48,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:36:48,060 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 26 [2022-11-20 11:36:48,089 INFO L321 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2022-11-20 11:36:48,089 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 2 case distinctions, treesize of input 74 treesize of output 71 [2022-11-20 11:36:48,124 INFO L321 Elim1Store]: treesize reduction 76, result has 16.5 percent of original size [2022-11-20 11:36:48,124 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 46 [2022-11-20 11:36:48,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:36:48,212 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 43 [2022-11-20 11:36:48,258 INFO L321 Elim1Store]: treesize reduction 66, result has 35.3 percent of original size [2022-11-20 11:36:48,259 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 53 [2022-11-20 11:36:48,386 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 49 [2022-11-20 11:36:49,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:36:49,210 INFO L321 Elim1Store]: treesize reduction 61, result has 37.1 percent of original size [2022-11-20 11:36:49,210 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 73 treesize of output 72 [2022-11-20 11:36:49,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:36:49,349 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 42 [2022-11-20 11:36:49,378 INFO L321 Elim1Store]: treesize reduction 16, result has 56.8 percent of original size [2022-11-20 11:36:49,378 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 30 treesize of output 36 [2022-11-20 11:36:49,419 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 31 treesize of output 29 [2022-11-20 11:36:49,497 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 24 treesize of output 12 [2022-11-20 11:36:49,502 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-20 11:36:49,503 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:36:52,241 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-20 11:36:52,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1379370372] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:36:52,242 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:36:52,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 25 [2022-11-20 11:36:52,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992109302] [2022-11-20 11:36:52,242 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:36:52,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-20 11:36:52,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:36:52,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-20 11:36:52,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=457, Unknown=14, NotChecked=0, Total=600 [2022-11-20 11:36:52,243 INFO L87 Difference]: Start difference. First operand 277 states and 333 transitions. Second operand has 25 states, 25 states have (on average 3.24) internal successors, (81), 25 states have internal predecessors, (81), 0 states have call successors, (0), 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-20 11:36:58,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:36:58,533 INFO L93 Difference]: Finished difference Result 460 states and 564 transitions. [2022-11-20 11:36:58,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-20 11:36:58,533 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.24) internal successors, (81), 25 states have internal predecessors, (81), 0 states have call successors, (0), 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 35 [2022-11-20 11:36:58,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:36:58,535 INFO L225 Difference]: With dead ends: 460 [2022-11-20 11:36:58,535 INFO L226 Difference]: Without dead ends: 458 [2022-11-20 11:36:58,536 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 66 SyntacticMatches, 6 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 850 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=499, Invalid=1925, Unknown=26, NotChecked=0, Total=2450 [2022-11-20 11:36:58,536 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 337 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 480 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-20 11:36:58,537 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 599 Invalid, 867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 353 Invalid, 0 Unknown, 480 Unchecked, 0.8s Time] [2022-11-20 11:36:58,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2022-11-20 11:36:58,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 336. [2022-11-20 11:36:58,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 334 states have (on average 1.2365269461077844) internal successors, (413), 335 states have internal predecessors, (413), 0 states have call successors, (0), 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-20 11:36:58,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 413 transitions. [2022-11-20 11:36:58,648 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 413 transitions. Word has length 35 [2022-11-20 11:36:58,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:36:58,648 INFO L495 AbstractCegarLoop]: Abstraction has 336 states and 413 transitions. [2022-11-20 11:36:58,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.24) internal successors, (81), 25 states have internal predecessors, (81), 0 states have call successors, (0), 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-20 11:36:58,648 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 413 transitions. [2022-11-20 11:36:58,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-20 11:36:58,649 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:36:58,649 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:36:58,657 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-11-20 11:36:58,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-11-20 11:36:58,858 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-11-20 11:36:58,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:36:58,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1112758888, now seen corresponding path program 2 times [2022-11-20 11:36:58,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:36:58,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335692856] [2022-11-20 11:36:58,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:36:58,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:36:58,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:36:59,929 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 13 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-20 11:36:59,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:36:59,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335692856] [2022-11-20 11:36:59,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335692856] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:36:59,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1256680829] [2022-11-20 11:36:59,930 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 11:36:59,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:36:59,930 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:36:59,931 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:36:59,935 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-11-20 11:37:00,584 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 11:37:00,584 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:37:00,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 95 conjunts are in the unsatisfiable core [2022-11-20 11:37:00,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:37:00,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:37:00,617 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 26 [2022-11-20 11:37:00,667 INFO L321 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2022-11-20 11:37:00,667 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 2 case distinctions, treesize of input 120 treesize of output 113 [2022-11-20 11:37:00,678 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 40 [2022-11-20 11:37:00,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:37:00,688 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 30 [2022-11-20 11:37:00,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:37:00,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:37:00,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:37:00,702 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-20 11:37:00,781 INFO L321 Elim1Store]: treesize reduction 76, result has 16.5 percent of original size [2022-11-20 11:37:00,781 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 46 [2022-11-20 11:37:00,788 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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-20 11:37:00,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:37:00,978 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2022-11-20 11:37:01,076 INFO L321 Elim1Store]: treesize reduction 66, result has 35.3 percent of original size [2022-11-20 11:37:01,076 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 53 [2022-11-20 11:37:01,115 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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-20 11:37:01,129 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-11-20 11:37:01,253 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 52 [2022-11-20 11:37:01,276 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-11-20 11:37:01,293 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 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-20 11:37:02,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:37:02,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:37:02,441 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-20 11:37:02,441 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 36 [2022-11-20 11:37:02,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:37:02,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:37:02,488 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-20 11:37:02,488 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 57 [2022-11-20 11:37:02,504 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-20 11:37:02,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:37:02,725 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 45 [2022-11-20 11:37:02,759 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-20 11:37:02,759 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 1 case distinctions, treesize of input 18 treesize of output 28 [2022-11-20 11:37:02,835 INFO L321 Elim1Store]: treesize reduction 16, result has 56.8 percent of original size [2022-11-20 11:37:02,835 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 30 treesize of output 36 [2022-11-20 11:37:02,851 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-20 11:37:02,957 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-20 11:37:02,966 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 34 treesize of output 32 [2022-11-20 11:37:02,978 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-11-20 11:37:03,319 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2022-11-20 11:37:03,329 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 11:37:03,407 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 13 [2022-11-20 11:37:03,465 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 13 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-20 11:37:03,465 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:37:03,603 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5893 (Array Int Int)) (v_ArrVal_5894 (Array Int Int)) (|ULTIMATE.start_main_~item~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~item~0#1.base|) (+ 4 |ULTIMATE.start_main_~item~0#1.offset|) 1)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_5893) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (+ 8 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_5894) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) 1)) is different from false [2022-11-20 11:37:03,621 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:37:03,621 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 35 [2022-11-20 11:37:04,068 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~item~0#1.base_104| Int) (v_ArrVal_5893 (Array Int Int)) (v_ArrVal_5889 Int) (v_ArrVal_5894 (Array Int Int)) (v_ArrVal_5888 (Array Int Int)) (v_ArrVal_5885 Int) (|v_ULTIMATE.start_main_~bcki~0#1.offset_149| Int) (|ULTIMATE.start_main_~item~0#1.offset| Int) (v_arrayElimArr_53 (Array Int Int))) (or (not (= (select v_arrayElimArr_53 (+ 4 |ULTIMATE.start_main_~item~0#1.offset|)) 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_104|) 0)) (= (let ((.cse0 (+ 4 |v_ULTIMATE.start_main_~bcki~0#1.offset_149|))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~bucket~0#1.base| v_ArrVal_5888) |v_ULTIMATE.start_main_~item~0#1.base_104| v_arrayElimArr_53) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse0 v_ArrVal_5889)) |v_ULTIMATE.start_main_~item~0#1.base_104| v_ArrVal_5893) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bucket~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse0 v_ArrVal_5885)) |v_ULTIMATE.start_main_~item~0#1.base_104| v_ArrVal_5894) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 8))) 1) (not (<= |c_ULTIMATE.start_main_~bucket~0#1.offset| |v_ULTIMATE.start_main_~bcki~0#1.offset_149|)))) is different from false [2022-11-20 11:37:04,113 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5889 Int) (v_ArrVal_5885 Int) (|v_ULTIMATE.start_main_~bcki~0#1.offset_149| Int) (v_arrayElimArr_53 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_104| Int) (v_ArrVal_5893 (Array Int Int)) (v_ArrVal_5882 (Array Int Int)) (v_ArrVal_5884 (Array Int Int)) (v_ArrVal_5883 (Array Int Int)) (v_ArrVal_5894 (Array Int Int)) (v_ArrVal_5888 (Array Int Int)) (|ULTIMATE.start_main_~item~0#1.offset| Int)) (or (not (= (select v_arrayElimArr_53 (+ 4 |ULTIMATE.start_main_~item~0#1.offset|)) 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_104|) 0)) (not (<= |c_ULTIMATE.start_main_~bucket~0#1.offset| |v_ULTIMATE.start_main_~bcki~0#1.offset_149|)) (= (let ((.cse1 (+ 4 |v_ULTIMATE.start_main_~bcki~0#1.offset_149|))) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_5884) |c_ULTIMATE.start_main_~bucket~0#1.base| v_ArrVal_5888) |v_ULTIMATE.start_main_~item~0#1.base_104| v_arrayElimArr_53) (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_5883))) (store .cse0 |c_ULTIMATE.start_main_~bucket~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse1 v_ArrVal_5889))) |v_ULTIMATE.start_main_~item~0#1.base_104| v_ArrVal_5893) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (+ (select (select (store (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_5882))) (store .cse2 |c_ULTIMATE.start_main_~bucket~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse1 v_ArrVal_5885))) |v_ULTIMATE.start_main_~item~0#1.base_104| v_ArrVal_5894) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 8))) 1))) is different from false [2022-11-20 11:37:04,160 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5889 Int) (v_ArrVal_5885 Int) (|v_ULTIMATE.start_main_~bcki~0#1.offset_149| Int) (v_arrayElimArr_53 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_105| Int) (|v_ULTIMATE.start_main_~item~0#1.base_104| Int) (v_ArrVal_5893 (Array Int Int)) (v_ArrVal_5882 (Array Int Int)) (v_ArrVal_5884 (Array Int Int)) (v_ArrVal_5883 (Array Int Int)) (v_ArrVal_5894 (Array Int Int)) (v_ArrVal_5888 (Array Int Int)) (|ULTIMATE.start_main_~item~0#1.offset| Int)) (or (not (= (select (store |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_105| 1) |v_ULTIMATE.start_main_~item~0#1.base_104|) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_105|) 0)) (not (= (select v_arrayElimArr_53 (+ 4 |ULTIMATE.start_main_~item~0#1.offset|)) 1)) (not (<= |c_ULTIMATE.start_main_~bucket~0#1.offset| |v_ULTIMATE.start_main_~bcki~0#1.offset_149|)) (= (let ((.cse1 (+ 4 |v_ULTIMATE.start_main_~bcki~0#1.offset_149|))) (select (select (store (store (store |c_#memory_int| |v_ULTIMATE.start_main_~item~0#1.base_105| v_ArrVal_5884) |c_ULTIMATE.start_main_~bucket~0#1.base| v_ArrVal_5888) |v_ULTIMATE.start_main_~item~0#1.base_104| v_arrayElimArr_53) (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_105| v_ArrVal_5883))) (store .cse0 |c_ULTIMATE.start_main_~bucket~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse1 v_ArrVal_5889))) |v_ULTIMATE.start_main_~item~0#1.base_104| v_ArrVal_5893) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (+ (select (select (store (let ((.cse2 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_105| v_ArrVal_5882))) (store .cse2 |c_ULTIMATE.start_main_~bucket~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse1 v_ArrVal_5885))) |v_ULTIMATE.start_main_~item~0#1.base_104| v_ArrVal_5894) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 8))) 1))) is different from false [2022-11-20 11:37:04,255 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 4 not checked. [2022-11-20 11:37:04,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1256680829] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:37:04,255 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:37:04,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 30 [2022-11-20 11:37:04,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140139602] [2022-11-20 11:37:04,256 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:37:04,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-20 11:37:04,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:37:04,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-20 11:37:04,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=552, Unknown=5, NotChecked=204, Total=870 [2022-11-20 11:37:04,257 INFO L87 Difference]: Start difference. First operand 336 states and 413 transitions. Second operand has 30 states, 30 states have (on average 2.933333333333333) internal successors, (88), 30 states have internal predecessors, (88), 0 states have call successors, (0), 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-20 11:37:06,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:37:06,618 INFO L93 Difference]: Finished difference Result 457 states and 564 transitions. [2022-11-20 11:37:06,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-20 11:37:06,618 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.933333333333333) internal successors, (88), 30 states have internal predecessors, (88), 0 states have call successors, (0), 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 35 [2022-11-20 11:37:06,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:37:06,620 INFO L225 Difference]: With dead ends: 457 [2022-11-20 11:37:06,620 INFO L226 Difference]: Without dead ends: 400 [2022-11-20 11:37:06,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 54 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=206, Invalid=1065, Unknown=5, NotChecked=284, Total=1560 [2022-11-20 11:37:06,622 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 168 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 482 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:37:06,622 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 437 Invalid, 844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 349 Invalid, 0 Unknown, 482 Unchecked, 1.1s Time] [2022-11-20 11:37:06,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2022-11-20 11:37:06,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 353. [2022-11-20 11:37:06,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 351 states have (on average 1.2364672364672364) internal successors, (434), 352 states have internal predecessors, (434), 0 states have call successors, (0), 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-20 11:37:06,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 434 transitions. [2022-11-20 11:37:06,772 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 434 transitions. Word has length 35 [2022-11-20 11:37:06,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:37:06,772 INFO L495 AbstractCegarLoop]: Abstraction has 353 states and 434 transitions. [2022-11-20 11:37:06,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.933333333333333) internal successors, (88), 30 states have internal predecessors, (88), 0 states have call successors, (0), 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-20 11:37:06,772 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 434 transitions. [2022-11-20 11:37:06,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-20 11:37:06,773 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:37:06,773 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:37:06,786 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2022-11-20 11:37:06,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:37:06,986 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-11-20 11:37:06,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:37:06,987 INFO L85 PathProgramCache]: Analyzing trace with hash 91690534, now seen corresponding path program 4 times [2022-11-20 11:37:06,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:37:06,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313711408] [2022-11-20 11:37:06,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:37:06,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:37:07,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:37:08,960 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:37:08,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:37:08,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313711408] [2022-11-20 11:37:08,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313711408] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:37:08,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1397156646] [2022-11-20 11:37:08,961 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 11:37:08,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:37:08,961 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:37:08,966 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:37:08,990 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-11-20 11:37:09,440 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 11:37:09,440 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:37:09,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 142 conjunts are in the unsatisfiable core [2022-11-20 11:37:09,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:37:09,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:37:09,475 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 38 [2022-11-20 11:37:09,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:37:09,488 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 32 [2022-11-20 11:37:09,548 INFO L321 Elim1Store]: treesize reduction 50, result has 25.4 percent of original size [2022-11-20 11:37:09,548 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 2 case distinctions, treesize of input 88 treesize of output 87 [2022-11-20 11:37:09,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:37:09,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:37:09,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:37:09,564 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 37 [2022-11-20 11:37:09,640 INFO L321 Elim1Store]: treesize reduction 76, result has 16.5 percent of original size [2022-11-20 11:37:09,640 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 46 [2022-11-20 11:37:09,648 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-20 11:37:09,667 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 23 [2022-11-20 11:37:09,682 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 19 treesize of output 31 [2022-11-20 11:37:09,729 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 15 treesize of output 23 [2022-11-20 11:37:09,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:37:09,955 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-20 11:37:09,955 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 125 treesize of output 81 [2022-11-20 11:37:09,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:37:10,036 INFO L321 Elim1Store]: treesize reduction 84, result has 28.8 percent of original size [2022-11-20 11:37:10,036 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 64 [2022-11-20 11:37:10,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:37:10,166 INFO L321 Elim1Store]: treesize reduction 90, result has 36.6 percent of original size [2022-11-20 11:37:10,167 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 69 [2022-11-20 11:37:10,205 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-20 11:37:10,402 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-11-20 11:37:10,402 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 152 treesize of output 99 [2022-11-20 11:37:10,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:37:10,433 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 74 [2022-11-20 11:37:10,450 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-20 11:37:11,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:37:11,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:37:11,893 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 76 [2022-11-20 11:37:11,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:37:11,911 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:37:11,932 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-11-20 11:37:11,932 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 154 treesize of output 101 [2022-11-20 11:37:11,950 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-20 11:37:12,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:37:12,172 INFO L321 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2022-11-20 11:37:12,172 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 152 treesize of output 99 [2022-11-20 11:37:12,223 INFO L321 Elim1Store]: treesize reduction 27, result has 48.1 percent of original size [2022-11-20 11:37:12,223 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 36 [2022-11-20 11:37:12,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:37:12,289 INFO L321 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2022-11-20 11:37:12,289 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 37 [2022-11-20 11:37:12,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:37:12,336 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-20 11:37:12,337 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 74 [2022-11-20 11:37:12,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:37:12,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:37:12,692 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 76 [2022-11-20 11:37:12,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:37:12,713 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:37:12,734 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-11-20 11:37:12,734 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 132 treesize of output 91 [2022-11-20 11:37:12,782 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2022-11-20 11:37:14,024 INFO L321 Elim1Store]: treesize reduction 28, result has 22.2 percent of original size [2022-11-20 11:37:14,024 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 173 treesize of output 95 [2022-11-20 11:37:14,058 INFO L321 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2022-11-20 11:37:14,059 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 41 [2022-11-20 11:37:14,351 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 11 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:37:14,351 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:37:15,420 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:37:15,420 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 165 treesize of output 162 [2022-11-20 11:37:24,138 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:37:24,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1397156646] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:37:24,138 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:37:24,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 17] total 40 [2022-11-20 11:37:24,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908961915] [2022-11-20 11:37:24,138 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:37:24,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-20 11:37:24,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:37:24,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-20 11:37:24,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=1363, Unknown=13, NotChecked=0, Total=1560 [2022-11-20 11:37:24,140 INFO L87 Difference]: Start difference. First operand 353 states and 434 transitions. Second operand has 40 states, 40 states have (on average 2.45) internal successors, (98), 40 states have internal predecessors, (98), 0 states have call successors, (0), 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-20 11:37:29,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:37:29,815 INFO L93 Difference]: Finished difference Result 438 states and 541 transitions. [2022-11-20 11:37:29,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-20 11:37:29,816 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.45) internal successors, (98), 40 states have internal predecessors, (98), 0 states have call successors, (0), 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 35 [2022-11-20 11:37:29,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:37:29,818 INFO L225 Difference]: With dead ends: 438 [2022-11-20 11:37:29,818 INFO L226 Difference]: Without dead ends: 387 [2022-11-20 11:37:29,819 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 692 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=555, Invalid=2512, Unknown=13, NotChecked=0, Total=3080 [2022-11-20 11:37:29,820 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 294 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 237 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-20 11:37:29,820 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 427 Invalid, 839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 550 Invalid, 0 Unknown, 237 Unchecked, 1.6s Time] [2022-11-20 11:37:29,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2022-11-20 11:37:30,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 350. [2022-11-20 11:37:30,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 348 states have (on average 1.2298850574712643) internal successors, (428), 349 states have internal predecessors, (428), 0 states have call successors, (0), 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-20 11:37:30,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 428 transitions. [2022-11-20 11:37:30,014 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 428 transitions. Word has length 35 [2022-11-20 11:37:30,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:37:30,014 INFO L495 AbstractCegarLoop]: Abstraction has 350 states and 428 transitions. [2022-11-20 11:37:30,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.45) internal successors, (98), 40 states have internal predecessors, (98), 0 states have call successors, (0), 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-20 11:37:30,015 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 428 transitions. [2022-11-20 11:37:30,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-20 11:37:30,015 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:37:30,016 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:37:30,023 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-11-20 11:37:30,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:37:30,223 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-11-20 11:37:30,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:37:30,224 INFO L85 PathProgramCache]: Analyzing trace with hash -214693254, now seen corresponding path program 1 times [2022-11-20 11:37:30,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:37:30,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121207967] [2022-11-20 11:37:30,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:37:30,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:37:30,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:37:31,149 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:37:31,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:37:31,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121207967] [2022-11-20 11:37:31,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121207967] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:37:31,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1614051542] [2022-11-20 11:37:31,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:37:31,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:37:31,150 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:37:31,151 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:37:31,153 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-11-20 11:37:31,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:37:31,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 104 conjunts are in the unsatisfiable core [2022-11-20 11:37:31,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:37:31,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:37:31,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:37:31,657 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 35 [2022-11-20 11:37:31,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:37:31,669 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 32 [2022-11-20 11:37:31,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:37:31,680 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 30 [2022-11-20 11:37:31,729 INFO L321 Elim1Store]: treesize reduction 50, result has 25.4 percent of original size [2022-11-20 11:37:31,730 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 2 case distinctions, treesize of input 97 treesize of output 92 [2022-11-20 11:37:31,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:37:31,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:37:31,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:37:31,746 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-20 11:37:31,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:37:31,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:37:31,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:37:31,760 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 27 [2022-11-20 11:37:31,833 INFO L321 Elim1Store]: treesize reduction 76, result has 16.5 percent of original size [2022-11-20 11:37:31,834 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 46 [2022-11-20 11:37:31,855 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 23 [2022-11-20 11:37:32,089 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 11:37:32,090 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 16 treesize of output 22 [2022-11-20 11:37:32,103 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 7 treesize of output 3 [2022-11-20 11:37:32,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:37:32,131 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-20 11:37:32,131 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 76 treesize of output 60 [2022-11-20 11:37:32,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:37:32,251 INFO L321 Elim1Store]: treesize reduction 90, result has 36.6 percent of original size [2022-11-20 11:37:32,251 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 69 [2022-11-20 11:37:32,291 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-11-20 11:37:32,511 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-20 11:37:32,512 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 96 treesize of output 72 [2022-11-20 11:37:32,522 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-11-20 11:37:32,539 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 11:37:33,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:37:33,112 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 10 [2022-11-20 11:37:33,738 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-20 11:37:33,738 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 98 treesize of output 73 [2022-11-20 11:37:33,756 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2022-11-20 11:37:33,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:37:33,924 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 21 treesize of output 20 [2022-11-20 11:37:33,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:37:33,954 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-20 11:37:33,955 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 76 treesize of output 60 [2022-11-20 11:37:33,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:37:34,003 INFO L321 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2022-11-20 11:37:34,003 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 37 [2022-11-20 11:37:34,186 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 23 treesize of output 22 [2022-11-20 11:37:34,221 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-20 11:37:34,221 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 58 [2022-11-20 11:37:34,713 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 13 [2022-11-20 11:37:34,828 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 11:37:34,828 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 26 [2022-11-20 11:37:34,841 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:37:34,841 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:37:35,317 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6410 (Array Int Int)) (v_ArrVal_6408 Int) (v_ArrVal_6405 (Array Int Int)) (v_ArrVal_6406 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_111| Int)) (or (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_6406) |v_ULTIMATE.start_main_~item~0#1.base_111| v_ArrVal_6410) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0)) (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_6405))) (store .cse0 |v_ULTIMATE.start_main_~item~0#1.base_111| (store (store (select .cse0 |v_ULTIMATE.start_main_~item~0#1.base_111|) 0 v_ArrVal_6408) 4 1))) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 8)) 1) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_111|) 0)))) is different from false [2022-11-20 11:37:35,432 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6410 (Array Int Int)) (v_ArrVal_6408 Int) (v_ArrVal_6405 (Array Int Int)) (v_ArrVal_6406 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_111| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base|) |c_ULTIMATE.start_main_~bcki~0#1.offset|))) (or (not (= (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_6406) |v_ULTIMATE.start_main_~item~0#1.base_111| v_ArrVal_6410) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_111|) 0)) (= (select (select (let ((.cse1 (store |c_#memory_int| .cse0 v_ArrVal_6405))) (store .cse1 |v_ULTIMATE.start_main_~item~0#1.base_111| (store (store (select .cse1 |v_ULTIMATE.start_main_~item~0#1.base_111|) 0 v_ArrVal_6408) 4 1))) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 8)) 1)))) is different from false [2022-11-20 11:37:35,478 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6410 (Array Int Int)) (v_ArrVal_6408 Int) (v_ArrVal_6405 (Array Int Int)) (v_ArrVal_6406 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_111| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base|) |c_ULTIMATE.start_main_~bcki~0#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base|) |c_ULTIMATE.start_main_~bcki~0#1.offset|)))) (or (not (= (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_6406) |v_ULTIMATE.start_main_~item~0#1.base_111| v_ArrVal_6410) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_111|) 0)) (= (select (select (let ((.cse1 (store |c_#memory_int| .cse0 v_ArrVal_6405))) (store .cse1 |v_ULTIMATE.start_main_~item~0#1.base_111| (store (store (select .cse1 |v_ULTIMATE.start_main_~item~0#1.base_111|) 0 v_ArrVal_6408) 4 1))) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 8)) 1)))) is different from false [2022-11-20 11:37:35,749 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6410 (Array Int Int)) (v_ArrVal_6408 Int) (v_ArrVal_6403 (Array Int Int)) (v_ArrVal_6402 (Array Int Int)) (v_ArrVal_6405 (Array Int Int)) (v_ArrVal_6404 (Array Int Int)) (v_ArrVal_6406 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_111| Int)) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_6403))) (let ((.cse1 (select (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_6402) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|)))) (or (= (select (select (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_6404) .cse1 v_ArrVal_6405))) (store .cse0 |v_ULTIMATE.start_main_~item~0#1.base_111| (store (store (select .cse0 |v_ULTIMATE.start_main_~item~0#1.base_111|) 0 v_ArrVal_6408) 4 1))) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 8)) 1) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_111|) 0)) (not (= (select (select (store (store .cse2 .cse1 v_ArrVal_6406) |v_ULTIMATE.start_main_~item~0#1.base_111| v_ArrVal_6410) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0)))))) is different from false [2022-11-20 11:37:35,809 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6410 (Array Int Int)) (v_ArrVal_6408 Int) (v_ArrVal_6403 (Array Int Int)) (v_ArrVal_6402 (Array Int Int)) (v_ArrVal_6405 (Array Int Int)) (v_ArrVal_6404 (Array Int Int)) (v_ArrVal_6401 Int) (v_ArrVal_6406 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_112| Int) (|v_ULTIMATE.start_main_~item~0#1.base_111| Int)) (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_112| v_ArrVal_6403))) (let ((.cse1 (select (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_112| v_ArrVal_6402) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|)))) (or (not (= (select (select (store (store .cse0 .cse1 v_ArrVal_6406) |v_ULTIMATE.start_main_~item~0#1.base_111| v_ArrVal_6410) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0)) (not (= (select (store |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_112| v_ArrVal_6401) |v_ULTIMATE.start_main_~item~0#1.base_111|) 0)) (= (select (select (let ((.cse2 (store (store |c_#memory_int| |v_ULTIMATE.start_main_~item~0#1.base_112| v_ArrVal_6404) .cse1 v_ArrVal_6405))) (store .cse2 |v_ULTIMATE.start_main_~item~0#1.base_111| (store (store (select .cse2 |v_ULTIMATE.start_main_~item~0#1.base_111|) 0 v_ArrVal_6408) 4 1))) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 8)) 1) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_112|) 0)))))) is different from false [2022-11-20 11:37:35,901 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 27 not checked. [2022-11-20 11:37:35,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1614051542] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:37:35,901 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:37:35,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 14] total 34 [2022-11-20 11:37:35,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94501636] [2022-11-20 11:37:35,901 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:37:35,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-20 11:37:35,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:37:35,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-20 11:37:35,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=653, Unknown=7, NotChecked=290, Total=1122 [2022-11-20 11:37:35,903 INFO L87 Difference]: Start difference. First operand 350 states and 428 transitions. Second operand has 34 states, 34 states have (on average 2.8823529411764706) internal successors, (98), 34 states have internal predecessors, (98), 0 states have call successors, (0), 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-20 11:37:42,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:37:42,265 INFO L93 Difference]: Finished difference Result 860 states and 1086 transitions. [2022-11-20 11:37:42,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-20 11:37:42,266 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.8823529411764706) internal successors, (98), 34 states have internal predecessors, (98), 0 states have call successors, (0), 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-20 11:37:42,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:37:42,268 INFO L225 Difference]: With dead ends: 860 [2022-11-20 11:37:42,268 INFO L226 Difference]: Without dead ends: 739 [2022-11-20 11:37:42,269 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 51 SyntacticMatches, 13 SemanticMatches, 54 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 765 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=669, Invalid=1894, Unknown=7, NotChecked=510, Total=3080 [2022-11-20 11:37:42,270 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 751 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 751 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 2033 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1075 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-20 11:37:42,270 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [751 Valid, 573 Invalid, 2033 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 770 Invalid, 0 Unknown, 1075 Unchecked, 1.9s Time] [2022-11-20 11:37:42,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2022-11-20 11:37:42,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 475. [2022-11-20 11:37:42,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 473 states have (on average 1.2600422832980973) internal successors, (596), 474 states have internal predecessors, (596), 0 states have call successors, (0), 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-20 11:37:42,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 596 transitions. [2022-11-20 11:37:42,445 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 596 transitions. Word has length 36 [2022-11-20 11:37:42,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:37:42,446 INFO L495 AbstractCegarLoop]: Abstraction has 475 states and 596 transitions. [2022-11-20 11:37:42,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.8823529411764706) internal successors, (98), 34 states have internal predecessors, (98), 0 states have call successors, (0), 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-20 11:37:42,446 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 596 transitions. [2022-11-20 11:37:42,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-20 11:37:42,447 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:37:42,447 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 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] [2022-11-20 11:37:42,459 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-11-20 11:37:42,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-11-20 11:37:42,654 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-11-20 11:37:42,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:37:42,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1573269269, now seen corresponding path program 2 times [2022-11-20 11:37:42,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:37:42,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720924277] [2022-11-20 11:37:42,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:37:42,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:37:42,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:37:44,061 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:37:44,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:37:44,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720924277] [2022-11-20 11:37:44,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720924277] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:37:44,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [909840957] [2022-11-20 11:37:44,061 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 11:37:44,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:37:44,062 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:37:44,079 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:37:44,102 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-11-20 11:37:44,849 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 11:37:44,849 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:37:44,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 66 conjunts are in the unsatisfiable core [2022-11-20 11:37:44,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:37:44,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:37:44,867 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 26 [2022-11-20 11:37:44,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:37:44,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:37:44,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:37:44,879 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2022-11-20 11:37:44,889 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-20 11:37:44,889 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 23 treesize of output 19 [2022-11-20 11:37:44,963 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-20 11:37:44,964 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 1 case distinctions, treesize of input 19 treesize of output 18 [2022-11-20 11:37:45,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:37:45,056 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-20 11:37:45,056 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2022-11-20 11:37:45,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:37:45,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:37:45,529 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:37:45,540 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:37:45,540 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 19 [2022-11-20 11:37:45,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:37:45,819 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 34 [2022-11-20 11:37:45,849 INFO L321 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2022-11-20 11:37:45,850 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 69 [2022-11-20 11:37:46,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:37:46,117 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-20 11:37:46,117 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 75 [2022-11-20 11:37:46,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:37:46,129 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:37:46,145 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-20 11:37:46,146 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 46 [2022-11-20 11:37:46,307 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-20 11:37:46,307 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 55 [2022-11-20 11:37:46,412 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:37:46,413 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 15 [2022-11-20 11:37:46,460 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:37:46,460 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:37:47,199 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:37:47,199 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 538 treesize of output 456 [2022-11-20 11:37:59,142 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 16 treesize of output 12 [2022-11-20 11:37:59,204 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2022-11-20 11:37:59,234 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 23 treesize of output 17 [2022-11-20 11:37:59,371 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2022-11-20 11:37:59,389 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2022-11-20 11:37:59,634 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2022-11-20 11:37:59,685 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2022-11-20 11:37:59,705 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2022-11-20 11:38:00,278 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-11-20 11:38:00,322 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-20 11:38:00,389 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-20 11:38:00,398 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2022-11-20 11:38:01,673 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2022-11-20 11:38:02,036 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2022-11-20 11:38:02,212 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2022-11-20 11:38:02,559 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-11-20 11:38:02,609 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-11-20 11:38:02,728 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 17 treesize of output 13 [2022-11-20 11:38:02,985 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2022-11-20 11:38:03,166 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2022-11-20 11:38:03,578 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2022-11-20 11:38:03,778 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2022-11-20 11:38:03,934 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-20 11:38:04,045 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 17 treesize of output 13 [2022-11-20 11:38:04,385 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-11-20 11:38:04,503 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 14 treesize of output 10 [2022-11-20 11:38:04,599 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2022-11-20 11:38:04,720 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 17 treesize of output 13 [2022-11-20 11:38:05,587 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2022-11-20 11:38:05,716 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 16 treesize of output 12 [2022-11-20 11:38:15,464 WARN L233 SmtUtils]: Spent 8.22s on a formula simplification. DAG size of input: 408 DAG size of output: 60 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 11:38:16,042 INFO L321 Elim1Store]: treesize reduction 4, result has 98.4 percent of original size [2022-11-20 11:38:16,042 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 179 treesize of output 336 [2022-11-20 11:42:59,974 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:42:59,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [909840957] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:42:59,974 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:42:59,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 15] total 34 [2022-11-20 11:42:59,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429834964] [2022-11-20 11:42:59,975 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:42:59,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-20 11:42:59,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:42:59,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-20 11:42:59,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=961, Unknown=1, NotChecked=0, Total=1122 [2022-11-20 11:42:59,976 INFO L87 Difference]: Start difference. First operand 475 states and 596 transitions. Second operand has 34 states, 34 states have (on average 2.7058823529411766) internal successors, (92), 34 states have internal predecessors, (92), 0 states have call successors, (0), 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-20 11:43:04,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:43:04,154 INFO L93 Difference]: Finished difference Result 721 states and 914 transitions. [2022-11-20 11:43:04,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-20 11:43:04,155 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.7058823529411766) internal successors, (92), 34 states have internal predecessors, (92), 0 states have call successors, (0), 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 37 [2022-11-20 11:43:04,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:43:04,158 INFO L225 Difference]: With dead ends: 721 [2022-11-20 11:43:04,158 INFO L226 Difference]: Without dead ends: 710 [2022-11-20 11:43:04,159 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 59 SyntacticMatches, 4 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 614 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=436, Invalid=1915, Unknown=1, NotChecked=0, Total=2352 [2022-11-20 11:43:04,159 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 501 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 995 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 376 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-20 11:43:04,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [501 Valid, 448 Invalid, 995 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 463 Invalid, 0 Unknown, 376 Unchecked, 1.6s Time] [2022-11-20 11:43:04,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2022-11-20 11:43:04,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 618. [2022-11-20 11:43:04,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 618 states, 616 states have (on average 1.2727272727272727) internal successors, (784), 617 states have internal predecessors, (784), 0 states have call successors, (0), 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-20 11:43:04,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 784 transitions. [2022-11-20 11:43:04,430 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 784 transitions. Word has length 37 [2022-11-20 11:43:04,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:43:04,430 INFO L495 AbstractCegarLoop]: Abstraction has 618 states and 784 transitions. [2022-11-20 11:43:04,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.7058823529411766) internal successors, (92), 34 states have internal predecessors, (92), 0 states have call successors, (0), 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-20 11:43:04,431 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 784 transitions. [2022-11-20 11:43:04,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-20 11:43:04,432 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:43:04,432 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] [2022-11-20 11:43:04,443 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-11-20 11:43:04,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:43:04,633 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-11-20 11:43:04,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:43:04,633 INFO L85 PathProgramCache]: Analyzing trace with hash -731052847, now seen corresponding path program 1 times [2022-11-20 11:43:04,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:43:04,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773450832] [2022-11-20 11:43:04,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:43:04,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:43:04,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:43:06,833 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:43:06,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:43:06,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773450832] [2022-11-20 11:43:06,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773450832] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:43:06,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1797491643] [2022-11-20 11:43:06,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:43:06,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:43:06,834 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:43:06,835 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:43:06,837 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e84d74f-b7b5-429d-b304-65ec262d66cc/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-11-20 11:43:07,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:43:07,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 112 conjunts are in the unsatisfiable core [2022-11-20 11:43:07,351 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:43:07,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:43:07,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:43:07,372 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 35 [2022-11-20 11:43:07,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:43:07,383 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 32 [2022-11-20 11:43:07,433 INFO L321 Elim1Store]: treesize reduction 50, result has 25.4 percent of original size [2022-11-20 11:43:07,433 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 2 case distinctions, treesize of input 76 treesize of output 75 [2022-11-20 11:43:07,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:43:07,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:43:07,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:43:07,447 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 27 [2022-11-20 11:43:07,520 INFO L321 Elim1Store]: treesize reduction 76, result has 16.5 percent of original size [2022-11-20 11:43:07,520 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 46 [2022-11-20 11:43:07,539 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 23 [2022-11-20 11:43:07,714 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 11:43:07,714 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 16 treesize of output 22 [2022-11-20 11:43:07,725 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 7 treesize of output 3 [2022-11-20 11:43:07,742 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-20 11:43:07,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:43:07,777 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-20 11:43:07,778 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 60 treesize of output 48 [2022-11-20 11:43:07,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:43:07,825 INFO L321 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-11-20 11:43:07,825 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2022-11-20 11:43:08,016 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 23 treesize of output 22 [2022-11-20 11:43:08,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:43:08,040 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-20 11:43:08,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:43:08,054 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:43:08,076 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-11-20 11:43:08,076 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 68 treesize of output 59 [2022-11-20 11:43:08,672 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:43:08,672 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 13 [2022-11-20 11:43:09,458 INFO L321 Elim1Store]: treesize reduction 130, result has 26.6 percent of original size [2022-11-20 11:43:09,459 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 122 treesize of output 111 [2022-11-20 11:43:09,513 INFO L321 Elim1Store]: treesize reduction 72, result has 17.2 percent of original size [2022-11-20 11:43:09,514 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 147 treesize of output 127 [2022-11-20 11:43:10,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:43:10,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:43:10,088 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-20 11:43:10,089 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 131 treesize of output 122 [2022-11-20 11:43:10,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:43:10,098 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:43:10,155 INFO L321 Elim1Store]: treesize reduction 140, result has 13.0 percent of original size [2022-11-20 11:43:10,155 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 159 treesize of output 116 [2022-11-20 11:43:11,234 INFO L321 Elim1Store]: treesize reduction 232, result has 36.1 percent of original size [2022-11-20 11:43:11,234 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 27 case distinctions, treesize of input 299 treesize of output 392 [2022-11-20 11:43:11,644 INFO L321 Elim1Store]: treesize reduction 180, result has 36.4 percent of original size [2022-11-20 11:43:11,644 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 11 new quantified variables, introduced 27 case distinctions, treesize of input 411 treesize of output 404 [2022-11-20 11:43:14,344 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 19 treesize of output 7 [2022-11-20 11:43:14,419 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 19 treesize of output 7 [2022-11-20 11:43:18,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:43:18,823 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 34 [2022-11-20 11:43:19,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:43:19,081 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 34 [2022-11-20 11:43:20,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:43:20,466 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 39 [2022-11-20 11:43:20,912 INFO L321 Elim1Store]: treesize reduction 10, result has 84.1 percent of original size [2022-11-20 11:43:20,912 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 228 treesize of output 214 [2022-11-20 11:43:23,258 INFO L321 Elim1Store]: treesize reduction 10, result has 84.1 percent of original size [2022-11-20 11:43:23,259 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 366 treesize of output 344 [2022-11-20 11:43:32,156 INFO L321 Elim1Store]: treesize reduction 10, result has 84.1 percent of original size [2022-11-20 11:43:32,157 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 351 treesize of output 335 [2022-11-20 11:43:34,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:43:34,479 INFO L321 Elim1Store]: treesize reduction 8, result has 70.4 percent of original size [2022-11-20 11:43:34,479 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 61 [2022-11-20 11:43:35,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:43:35,537 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 44 [2022-11-20 11:43:36,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:43:36,762 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 47 [2022-11-20 11:43:37,596 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:43:37,597 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 222 treesize of output 231 [2022-11-20 11:43:39,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:43:39,897 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 25 [2022-11-20 11:43:40,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:43:40,107 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2022-11-20 11:43:40,172 INFO L321 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2022-11-20 11:43:40,172 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 106 treesize of output 69 [2022-11-20 11:43:40,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:43:40,250 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 42 [2022-11-20 11:43:40,635 INFO L321 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2022-11-20 11:43:40,635 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 122 treesize of output 73 [2022-11-20 11:43:52,846 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 23 treesize of output 7 [2022-11-20 11:43:52,927 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 23 treesize of output 7 [2022-11-20 11:43:52,974 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 23 treesize of output 7 [2022-11-20 11:43:53,054 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 23 treesize of output 7 [2022-11-20 11:43:53,139 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 23 treesize of output 7 [2022-11-20 11:43:53,236 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 23 treesize of output 7 [2022-11-20 11:43:53,293 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 23 treesize of output 7 [2022-11-20 11:43:53,354 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 23 treesize of output 7 [2022-11-20 11:43:53,905 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 23 treesize of output 7 [2022-11-20 11:43:53,952 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 23 treesize of output 7 [2022-11-20 11:43:54,048 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 23 treesize of output 7 [2022-11-20 11:43:54,297 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 23 treesize of output 7 [2022-11-20 11:43:54,389 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 23 treesize of output 7 [2022-11-20 11:43:54,420 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 23 treesize of output 7 [2022-11-20 11:43:54,447 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-11-20 11:43:54,479 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 23 treesize of output 7 [2022-11-20 11:43:54,534 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 23 treesize of output 7 [2022-11-20 11:43:54,579 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 23 treesize of output 7 [2022-11-20 11:43:54,620 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 23 treesize of output 7 [2022-11-20 11:43:54,665 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 23 treesize of output 7 [2022-11-20 11:43:54,733 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 23 treesize of output 7 [2022-11-20 11:43:54,780 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 23 treesize of output 7 [2022-11-20 11:43:57,929 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 23 treesize of output 7 [2022-11-20 11:43:57,970 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 23 treesize of output 7 [2022-11-20 11:43:58,031 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 23 treesize of output 7 [2022-11-20 11:43:58,115 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 23 treesize of output 7 [2022-11-20 11:44:09,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:44:09,448 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:44:09,448 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 55 [2022-11-20 11:44:13,656 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|))) (let ((.cse0 (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0)) (.cse36 (= 0 (select .cse2 0)))) (let ((.cse199 (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4)) (.cse21 (= |c_ULTIMATE.start_main_~item~0#1.base| 0)) (.cse1060 (and .cse0 .cse36 (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int) (v_prenex_61 Int)) (let ((.cse1132 (select |c_#memory_$Pointer$.offset| v_prenex_61))) (let ((.cse1130 (select .cse1132 0))) (let ((.cse1129 (select .cse1132 (+ .cse1130 4))) (.cse1128 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0)) (.cse1131 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (and (not (= .cse1128 |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= .cse1128 v_prenex_61)) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse1128)) (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse1129) (not (= .cse1130 0)) (= .cse1129 0) (not (= .cse1128 .cse1131)) (= (select |c_#memory_$Pointer$.offset| .cse1131) .cse1132)))))))) (.cse1094 (exists ((v_prenex_214 Int) (v_prenex_61 Int)) (let ((.cse1124 (select |c_#memory_$Pointer$.offset| v_prenex_61))) (let ((.cse1122 (select (select |c_#memory_$Pointer$.base| v_prenex_214) 0)) (.cse1127 (select .cse1124 0))) (let ((.cse1123 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0)) (.cse1125 (select .cse1124 (+ .cse1127 4))) (.cse1126 (select |c_#memory_$Pointer$.base| .cse1122))) (and (not (= .cse1122 .cse1123)) (not (= .cse1123 |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select |c_#memory_$Pointer$.offset| .cse1122) .cse1124) (not (= .cse1123 v_prenex_61)) (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse1125) (= (select .cse1126 0) 0) (not (= .cse1127 0)) (not (= .cse1123 v_prenex_214)) (= .cse1125 0) (= .cse1126 .cse2))))))) (.cse33 (= |c_ULTIMATE.start_main_~item~0#1.offset| 0))) (let ((.cse118 (or (and .cse0 .cse36 (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int) (v_prenex_61 Int)) (let ((.cse1118 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0)) (.cse1119 (select (select |c_#memory_$Pointer$.offset| v_prenex_61) 0))) (let ((.cse1117 (select (select |c_#memory_$Pointer$.offset| .cse1118) (+ .cse1119 4))) (.cse1116 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0))) (and (not (= .cse1116 |c_ULTIMATE.start_main_~item~0#1.base|)) (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse1117) (not (= .cse1116 v_prenex_61)) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse1116)) (not (= .cse1118 |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= .cse1119 0)) (= .cse1117 0) (not (= .cse1118 v_prenex_61)) (not (= .cse1116 .cse1118))))))) (and .cse0 .cse36 (exists ((v_prenex_61 Int) (v_prenex_206 Int)) (let ((.cse1121 (select (select |c_#memory_$Pointer$.base| v_prenex_206) 0)) (.cse1120 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0))) (and (not (= .cse1120 |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= .cse1121 v_prenex_61)) (not (= .cse1120 v_prenex_61)) (not (= .cse1121 |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= (select (select |c_#memory_$Pointer$.offset| v_prenex_61) 0) 0)) (not (= .cse1121 .cse1120)) (not (= .cse1120 v_prenex_206))))) .cse33))) (.cse32 (exists ((v_prenex_61 Int) (v_prenex_206 Int)) (let ((.cse1114 (select |c_#memory_$Pointer$.offset| v_prenex_61)) (.cse1115 (select (select |c_#memory_$Pointer$.base| v_prenex_206) 0)) (.cse1113 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0))) (and (not (= .cse1113 v_prenex_61)) (not (= (select .cse1114 0) 0)) (not (= .cse1113 0)) (= (select |c_#memory_$Pointer$.offset| .cse1115) .cse1114) (not (= .cse1115 .cse1113)) (not (= .cse1113 v_prenex_206)))))) (.cse54 (and .cse0 .cse1094)) (.cse215 (or .cse1060 (and .cse0 .cse36 .cse33 (exists ((v_prenex_61 Int) (v_prenex_206 Int)) (let ((.cse1111 (select |c_#memory_$Pointer$.offset| v_prenex_61)) (.cse1112 (select (select |c_#memory_$Pointer$.base| v_prenex_206) 0)) (.cse1110 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0))) (and (not (= .cse1110 |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= .cse1110 v_prenex_61)) (not (= (select .cse1111 0) 0)) (= (select |c_#memory_$Pointer$.offset| .cse1112) .cse1111) (not (= .cse1112 .cse1110)) (not (= .cse1110 v_prenex_206)))))))) (.cse167 (exists ((v_prenex_206 Int) (v_prenex_61 Int)) (let ((.cse1107 (select (select |c_#memory_$Pointer$.base| v_prenex_206) 0)) (.cse1108 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0)) (.cse1109 (select (select |c_#memory_$Pointer$.offset| v_prenex_61) 0))) (and (not (= .cse1107 0)) (not (= .cse1107 v_prenex_61)) (not (= .cse1108 v_prenex_61)) (not (= .cse1109 0)) (not (= .cse1108 0)) (not (= .cse1107 .cse1108)) (not (= .cse1108 v_prenex_206)) (not (= (+ .cse1109 4) 0)))))) (.cse299 (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int) (v_prenex_61 Int)) (let ((.cse1106 (select |c_#memory_$Pointer$.offset| v_prenex_61))) (let ((.cse1104 (select .cse1106 0))) (let ((.cse1103 (select .cse1106 (+ .cse1104 4))) (.cse1102 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0)) (.cse1105 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (and (not (= .cse1102 v_prenex_61)) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse1102)) (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse1103) (not (= .cse1104 0)) (not (= .cse1102 0)) (= .cse1103 0) (not (= .cse1102 .cse1105)) (= (select |c_#memory_$Pointer$.offset| .cse1105) .cse1106))))))) (.cse411 (exists ((v_prenex_214 Int)) (let ((.cse1095 (select (select |c_#memory_$Pointer$.base| v_prenex_214) 0))) (let ((.cse1101 (select |c_#memory_$Pointer$.base| .cse1095))) (and (exists ((v_prenex_61 Int)) (let ((.cse1097 (select |c_#memory_$Pointer$.offset| v_prenex_61))) (let ((.cse1100 (select .cse1097 0))) (let ((.cse1096 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0)) (.cse1098 (select .cse1097 (+ .cse1100 4)))) (and (not (= .cse1095 .cse1096)) (not (= .cse1096 |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select |c_#memory_$Pointer$.offset| .cse1095) .cse1097) (not (= .cse1096 v_prenex_61)) (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse1098) (exists ((v_prenex_213 Int)) (let ((.cse1099 (select (select |c_#memory_$Pointer$.offset| v_prenex_213) 0))) (and (not (= (+ .cse1099 4) 0)) (not (= .cse1099 .cse1100))))) (not (= .cse1100 0)) (not (= .cse1096 v_prenex_214)) (= .cse1098 0)))))) (= (select .cse1101 0) 0) (= .cse1101 .cse2)))))) (.cse412 (and .cse1094 .cse21)) (.cse224 (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int) (v_prenex_61 Int)) (let ((.cse1092 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0)) (.cse1091 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0)) (.cse1093 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (and (not (= .cse1091 |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= .cse1091 v_prenex_61)) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse1091)) (not (= (select (select |c_#memory_$Pointer$.offset| v_prenex_61) 0) .cse1092)) (= .cse1092 0) (= .cse1091 .cse1093) (not (= .cse1093 0)))))) (.cse38 (exists ((v_arrayElimCell_917 Int) (v_prenex_573 Int)) (let ((.cse1090 (select (select |c_#memory_$Pointer$.base| v_prenex_573) 0))) (and (not (= .cse1090 |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= v_arrayElimCell_917 .cse1090)) (not (= v_arrayElimCell_917 v_prenex_573)) (not (= v_prenex_573 .cse1090)) (= (select (select |c_#memory_$Pointer$.base| v_arrayElimCell_917) .cse199) .cse1090) (not (= .cse1090 0)) (= (select (select |c_#memory_$Pointer$.offset| v_prenex_573) 0) 0))))) (.cse510 (exists ((v_prenex_61 Int) (v_prenex_206 Int)) (let ((.cse1089 (select |c_#memory_$Pointer$.offset| v_prenex_61))) (let ((.cse1088 (select (select |c_#memory_$Pointer$.base| v_prenex_206) 0)) (.cse1086 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0)) (.cse1087 (select .cse1089 0))) (and (not (= .cse1086 v_prenex_61)) (not (= .cse1087 0)) (not (= .cse1086 0)) (= (select |c_#memory_$Pointer$.offset| .cse1088) .cse1089) (not (= .cse1088 .cse1086)) (not (= .cse1086 v_prenex_206)) (not (= (+ .cse1087 4) 0))))))) (.cse443 (exists ((v_prenex_202 Int) (v_prenex_61 Int)) (let ((.cse1082 (select (select |c_#memory_$Pointer$.base| v_prenex_202) 0)) (.cse1085 (select (select |c_#memory_$Pointer$.offset| v_prenex_61) 0))) (let ((.cse1083 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0)) (.cse1084 (select (select |c_#memory_$Pointer$.offset| .cse1082) (+ .cse1085 4)))) (and (= .cse1082 .cse1083) (not (= .cse1083 v_prenex_202)) (not (= .cse1083 v_prenex_61)) (= .cse1084 0) (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse1084) (not (= .cse1085 0)) (not (= .cse1082 |c_ULTIMATE.start_main_~item~0#1.base|))))))) (.cse396 (exists ((v_prenex_573 Int)) (not (= (+ (select (select |c_#memory_$Pointer$.offset| v_prenex_573) 0) 4) 0)))) (.cse359 (exists ((v_prenex_202 Int) (v_prenex_61 Int)) (let ((.cse1081 (select |c_#memory_$Pointer$.offset| v_prenex_61))) (let ((.cse1080 (select .cse1081 0))) (let ((.cse1078 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0)) (.cse1077 (select (select |c_#memory_$Pointer$.base| v_prenex_202) 0)) (.cse1079 (select .cse1081 (+ .cse1080 4)))) (and (= .cse1077 .cse1078) (not (= .cse1078 v_prenex_202)) (not (= .cse1078 v_prenex_61)) (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse1079) (not (= .cse1080 0)) (not (= .cse1077 |c_ULTIMATE.start_main_~item~0#1.base|)) (= .cse1079 0))))))) (.cse357 (or (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int)) (not (= (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0) 0))) .cse21)) (.cse358 (exists ((v_prenex_202 Int) (v_prenex_61 Int)) (let ((.cse1076 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0)) (.cse1075 (select (select |c_#memory_$Pointer$.base| v_prenex_202) 0))) (and (= .cse1075 .cse1076) (not (= .cse1076 v_prenex_202)) (not (= .cse1076 v_prenex_61)) (not (= (select (select |c_#memory_$Pointer$.offset| v_prenex_61) 0) 0)) (not (= .cse1075 |c_ULTIMATE.start_main_~item~0#1.base|)))))) (.cse37 (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int)) (not (= (+ (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0) 4) 0)))) (.cse487 (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int) (v_prenex_61 Int)) (let ((.cse1073 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0)) (.cse1071 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0)) (.cse1074 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0)) (.cse1072 (select (select |c_#memory_$Pointer$.offset| v_prenex_61) 0))) (and (not (= .cse1071 |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= .cse1071 v_prenex_61)) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse1071)) (not (= .cse1072 .cse1073)) (= .cse1073 0) (= .cse1071 .cse1074) (not (= .cse1074 0)) (not (= (+ .cse1072 4) 0)))))) (.cse522 (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int) (v_prenex_61 Int)) (let ((.cse1068 (select (select |c_#memory_$Pointer$.offset| v_prenex_61) 0))) (let ((.cse1069 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0)) (.cse1070 (+ .cse1068 4))) (let ((.cse1066 (select (select |c_#memory_$Pointer$.offset| .cse1069) .cse1070)) (.cse1067 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0))) (and (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse1066) (not (= .cse1067 v_prenex_61)) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse1067)) (not (= .cse1068 0)) (not (= .cse1067 0)) (= .cse1066 0) (not (= .cse1069 0)) (not (= .cse1069 v_prenex_61)) (not (= .cse1070 0)) (not (= .cse1067 .cse1069)))))))) (.cse313 (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int) (v_prenex_61 Int)) (let ((.cse1065 (select |c_#memory_$Pointer$.offset| v_prenex_61)) (.cse1064 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (let ((.cse1062 (select |c_#memory_$Pointer$.base| .cse1064)) (.cse1063 (select .cse1065 0)) (.cse1061 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0))) (and (not (= .cse1061 |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= .cse1061 v_prenex_61)) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse1061)) (= .cse2 .cse1062) (= (select .cse1062 0) 0) (not (= .cse1063 0)) (not (= (+ .cse1063 4) 0)) (not (= .cse1061 .cse1064)) (= (select |c_#memory_$Pointer$.offset| .cse1064) .cse1065)))))) (.cse745 (or (and .cse0 (exists ((v_prenex_61 Int) (v_prenex_206 Int)) (let ((.cse1059 (select |c_#memory_$Pointer$.offset| v_prenex_61))) (let ((.cse1058 (select (select |c_#memory_$Pointer$.base| v_prenex_206) 0)) (.cse1056 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0)) (.cse1057 (select .cse1059 0))) (and (not (= .cse1056 |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= .cse1056 v_prenex_61)) (not (= .cse1057 0)) (= (select |c_#memory_$Pointer$.offset| .cse1058) .cse1059) (not (= .cse1058 .cse1056)) (not (= .cse1056 v_prenex_206)) (not (= (+ .cse1057 4) 0)))))) .cse36 .cse33) .cse1060)) (.cse57 (exists ((v_prenex_205 Int)) (let ((.cse1055 (select (select |c_#memory_$Pointer$.offset| v_prenex_205) 0))) (and (not (= (+ .cse1055 4) 0)) (not (= .cse1055 0)))))) (.cse529 (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int) (v_prenex_61 Int)) (let ((.cse1054 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0)) (.cse1053 (select (select |c_#memory_$Pointer$.offset| v_prenex_61) 0))) (let ((.cse1051 (select (select |c_#memory_$Pointer$.offset| .cse1054) (+ .cse1053 4))) (.cse1052 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0))) (and (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse1051) (not (= .cse1052 v_prenex_61)) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse1052)) (not (= .cse1053 0)) (not (= .cse1052 0)) (= .cse1051 0) (not (= .cse1054 0)) (not (= .cse1054 v_prenex_61)) (not (= .cse1052 .cse1054))))))) (.cse30 (exists ((v_prenex_205 Int)) (not (= (+ (select (select |c_#memory_$Pointer$.offset| v_prenex_205) 0) 4) 0)))) (.cse56 (exists ((v_prenex_213 Int)) (not (= (select (select |c_#memory_$Pointer$.offset| v_prenex_213) 0) 0)))) (.cse55 (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int) (v_prenex_61 Int)) (let ((.cse1050 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (let ((.cse1048 (select |c_#memory_$Pointer$.base| .cse1050)) (.cse1047 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0)) (.cse1049 (select |c_#memory_$Pointer$.offset| v_prenex_61))) (and (not (= .cse1047 |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= .cse1047 v_prenex_61)) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse1047)) (= .cse2 .cse1048) (= (select .cse1048 0) 0) (not (= (select .cse1049 0) 0)) (not (= .cse1047 .cse1050)) (= (select |c_#memory_$Pointer$.offset| .cse1050) .cse1049)))))) (.cse117 (exists ((v_prenex_205 Int)) (not (= (select (select |c_#memory_$Pointer$.offset| v_prenex_205) 0) 0)))) (.cse58 (or (and .cse0 .cse36 .cse33 (exists ((v_prenex_61 Int) (v_prenex_206 Int)) (let ((.cse1040 (select (select |c_#memory_$Pointer$.base| v_prenex_206) 0)) (.cse1039 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0)) (.cse1041 (select (select |c_#memory_$Pointer$.offset| v_prenex_61) 0))) (and (not (= .cse1039 |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= .cse1040 v_prenex_61)) (not (= .cse1039 v_prenex_61)) (not (= .cse1040 |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= .cse1041 0)) (not (= .cse1040 .cse1039)) (not (= .cse1039 v_prenex_206)) (not (= (+ .cse1041 4) 0)))))) (and .cse0 .cse36 (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int) (v_prenex_61 Int)) (let ((.cse1045 (select (select |c_#memory_$Pointer$.offset| v_prenex_61) 0))) (let ((.cse1044 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0)) (.cse1046 (+ .cse1045 4))) (let ((.cse1043 (select (select |c_#memory_$Pointer$.offset| .cse1044) .cse1046)) (.cse1042 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0))) (and (not (= .cse1042 |c_ULTIMATE.start_main_~item~0#1.base|)) (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse1043) (not (= .cse1042 v_prenex_61)) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse1042)) (not (= .cse1044 |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= .cse1045 0)) (= .cse1043 0) (not (= .cse1044 v_prenex_61)) (not (= .cse1046 0)) (not (= .cse1042 .cse1044)))))))))) (.cse397 (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int) (v_DerPreprocessor_3 Int)) (let ((.cse1037 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0)) (.cse1038 (select |c_#memory_$Pointer$.base| v_DerPreprocessor_3))) (let ((.cse1036 (select .cse1038 0)) (.cse1035 (select .cse1038 (+ .cse1037 4))) (.cse1034 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (and (not (= .cse1034 .cse1035)) (= (select (select |c_#memory_$Pointer$.base| .cse1036) .cse199) v_DerPreprocessor_3) (not (= .cse1034 .cse1036)) (= 0 (select (select |c_#memory_$Pointer$.base| .cse1035) 0)) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse1036)) (= .cse1037 0) (= (select (select |c_#memory_$Pointer$.offset| .cse1035) 0) 0) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse1034)) (= .cse1035 |c_ULTIMATE.start_main_~item~0#1.base|) (not (= .cse1034 0))))))) (.cse31 (= (select (select |c_#memory_$Pointer$.base| 0) 0) 0)) (.cse758 (exists ((v_prenex_206 Int) (v_prenex_61 Int)) (let ((.cse1032 (select (select |c_#memory_$Pointer$.base| v_prenex_206) 0)) (.cse1033 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0))) (and (not (= .cse1032 0)) (not (= .cse1032 v_prenex_61)) (not (= .cse1033 v_prenex_61)) (not (= (select (select |c_#memory_$Pointer$.offset| v_prenex_61) 0) 0)) (not (= .cse1033 0)) (not (= .cse1032 .cse1033)) (not (= .cse1033 v_prenex_206)))))) (.cse34 (= (select (select |c_#memory_$Pointer$.offset| 0) 0) 0))) (or (and .cse0 (or (exists ((v_prenex_214 Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| v_prenex_214) 0))) (let ((.cse1 (select |c_#memory_$Pointer$.base| .cse4))) (and (= (select .cse1 0) 0) (= .cse1 .cse2) (exists ((v_prenex_61 Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$.offset| v_prenex_61) 0))) (let ((.cse8 (+ .cse7 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$.offset| .cse4) .cse8)) (.cse5 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0))) (and (= .cse3 0) (not (= .cse4 .cse5)) (not (= .cse5 |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= .cse5 v_prenex_61)) (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse3) (not (= .cse4 v_prenex_61)) (exists ((v_prenex_213 Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$.offset| v_prenex_213) 0))) (and (not (= (+ .cse6 4) 0)) (not (= .cse6 .cse7))))) (not (= .cse7 0)) (not (= .cse5 v_prenex_214)) (not (= .cse8 0))))))))))) (exists ((v_prenex_214 Int)) (let ((.cse11 (select (select |c_#memory_$Pointer$.base| v_prenex_214) 0))) (let ((.cse9 (select |c_#memory_$Pointer$.base| .cse11))) (and (= (select .cse9 0) 0) (= .cse9 .cse2) (exists ((v_prenex_61 Int)) (let ((.cse13 (select (select |c_#memory_$Pointer$.offset| v_prenex_61) 0))) (let ((.cse14 (+ .cse13 4))) (let ((.cse10 (select (select |c_#memory_$Pointer$.offset| .cse11) .cse14)) (.cse12 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0))) (and (= .cse10 0) (not (= v_prenex_61 0)) (not (= .cse11 .cse12)) (not (= .cse12 |c_ULTIMATE.start_main_~item~0#1.base|)) (exists ((v_prenex_213 Int)) (not (= (select (select |c_#memory_$Pointer$.offset| v_prenex_213) 0) .cse13))) (not (= .cse12 v_prenex_61)) (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse10) (not (= .cse13 0)) (not (= .cse12 0)) (not (= .cse12 v_prenex_214)) (not (= .cse14 0))))))))))) (and (exists ((v_prenex_214 Int) (v_prenex_61 Int)) (let ((.cse19 (select (select |c_#memory_$Pointer$.offset| v_prenex_61) 0))) (let ((.cse16 (select (select |c_#memory_$Pointer$.base| v_prenex_214) 0)) (.cse20 (+ .cse19 4))) (let ((.cse15 (select (select |c_#memory_$Pointer$.offset| .cse16) .cse20)) (.cse17 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0)) (.cse18 (select |c_#memory_$Pointer$.base| .cse16))) (and (= .cse15 0) (not (= .cse16 .cse17)) (not (= .cse17 |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= .cse17 v_prenex_61)) (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse15) (= (select .cse18 0) 0) (not (= .cse19 0)) (not (= .cse17 v_prenex_214)) (= .cse18 .cse2) (not (= .cse20 0))))))) .cse21))) (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int)) (let ((.cse29 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0)) (.cse25 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (and (exists ((v_prenex_61 Int)) (let ((.cse27 (select |c_#memory_$Pointer$.base| v_prenex_61)) (.cse26 (select |c_#memory_$Pointer$.offset| v_prenex_61)) (.cse28 (+ .cse29 4))) (let ((.cse24 (select .cse26 .cse28)) (.cse22 (select .cse27 .cse28)) (.cse23 (select .cse27 0))) (and (= (select (select |c_#memory_$Pointer$.base| .cse22) 0) 0) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse23)) (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse24) (not (= .cse25 (select (select |c_#memory_$Pointer$.base| .cse23) (+ (select .cse26 0) 4)))) (not (= .cse25 .cse22)) (= .cse24 0) (= (select (select |c_#memory_$Pointer$.offset| .cse22) 0) 0) (= .cse22 |c_ULTIMATE.start_main_~item~0#1.base|) (not (= .cse23 .cse25)))))) (= .cse29 0) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse25)) (not (= .cse25 0))))) (and .cse30 .cse31 .cse32 .cse33 .cse34 .cse21) (and .cse0 (exists ((v_arrayElimCell_917 Int) (v_arrayElimCell_919 Int) (v_prenex_573 Int)) (let ((.cse35 (select (select |c_#memory_$Pointer$.base| v_prenex_573) 0))) (and (not (= .cse35 |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= v_arrayElimCell_917 .cse35)) (not (= v_arrayElimCell_917 v_prenex_573)) (not (= v_prenex_573 .cse35)) (= (select (select |c_#memory_$Pointer$.base| v_arrayElimCell_917) (+ v_arrayElimCell_919 4)) .cse35) (not (= .cse35 0)) (= (select (select |c_#memory_$Pointer$.offset| v_prenex_573) 0) 0)))) .cse36 .cse33 .cse37) (and .cse0 .cse36 .cse33 .cse38 .cse37) (and (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int) (v_prenex_61 Int)) (let ((.cse43 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0))) (let ((.cse42 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0)) (.cse44 (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| .cse43) (+ (select (select |c_#memory_$Pointer$.offset| v_prenex_61) 0) 4))))) (let ((.cse39 (select .cse44 0)) (.cse40 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0)) (.cse41 (select .cse44 (+ .cse42 4)))) (and (not (= .cse39 .cse40)) (= .cse41 |c_ULTIMATE.start_main_~item~0#1.base|) (= 0 (select (select |c_#memory_$Pointer$.offset| .cse41) 0)) (= .cse42 0) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse39)) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse40)) (not (= .cse40 .cse41)) (not (= .cse40 0)) (not (= .cse40 v_prenex_61)) (not (= .cse43 .cse40)) (= (select (select |c_#memory_$Pointer$.base| .cse41) 0) 0)))))) .cse33) (exists ((v_prenex_61 Int)) (let ((.cse50 (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0))) (.cse52 (select |c_#memory_$Pointer$.offset| v_prenex_61))) (let ((.cse53 (select |c_#memory_$Pointer$.base| (select .cse50 (+ (select .cse52 0) 4))))) (and (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int)) (let ((.cse49 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (let ((.cse51 (+ .cse49 4))) (let ((.cse47 (select .cse52 .cse51)) (.cse45 (select .cse53 0)) (.cse48 (select .cse53 .cse51)) (.cse46 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (and (not (= .cse45 .cse46)) (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse47) (= 0 (select (select |c_#memory_$Pointer$.offset| .cse48) 0)) (= .cse49 0) (= (select .cse50 .cse51) |c_ULTIMATE.start_main_~item~0#1.base|) (= .cse47 0) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse45)) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse46)) (not (= .cse46 .cse48)) (not (= .cse46 0)) (not (= .cse46 v_prenex_61)) (= (select (select |c_#memory_$Pointer$.base| .cse48) 0) 0) (= (select |c_#memory_$Pointer$.offset| .cse46) .cse52)))))) (= .cse53 .cse50))))) (and (or .cse54 (and .cse0 .cse33 .cse55)) .cse56) (and .cse57 .cse58) (and .cse0 (or (and (exists ((v_prenex_214 Int) (v_prenex_61 Int)) (let ((.cse60 (select (select |c_#memory_$Pointer$.base| v_prenex_214) 0)) (.cse63 (select (select |c_#memory_$Pointer$.offset| v_prenex_61) 0))) (let ((.cse59 (select (select |c_#memory_$Pointer$.offset| .cse60) (+ .cse63 4))) (.cse61 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0)) (.cse62 (select |c_#memory_$Pointer$.base| .cse60))) (and (= .cse59 0) (not (= .cse60 .cse61)) (not (= .cse61 |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= .cse61 v_prenex_61)) (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse59) (= (select .cse62 0) 0) (not (= .cse63 0)) (not (= .cse61 v_prenex_214)) (= .cse62 .cse2))))) .cse21) (exists ((v_prenex_214 Int)) (let ((.cse66 (select (select |c_#memory_$Pointer$.base| v_prenex_214) 0))) (let ((.cse64 (select |c_#memory_$Pointer$.base| .cse66))) (and (= (select .cse64 0) 0) (= .cse64 .cse2) (exists ((v_prenex_61 Int)) (let ((.cse69 (select (select |c_#memory_$Pointer$.offset| v_prenex_61) 0))) (let ((.cse65 (select (select |c_#memory_$Pointer$.offset| .cse66) (+ .cse69 4))) (.cse67 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0))) (and (= .cse65 0) (not (= .cse66 .cse67)) (not (= .cse67 |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= .cse67 v_prenex_61)) (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse65) (not (= .cse66 v_prenex_61)) (exists ((v_prenex_213 Int)) (let ((.cse68 (select (select |c_#memory_$Pointer$.offset| v_prenex_213) 0))) (and (not (= (+ .cse68 4) 0)) (not (= .cse68 .cse69))))) (not (= .cse69 0)) (not (= .cse67 v_prenex_214)))))))))))) (and (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int) (v_prenex_61 Int)) (let ((.cse74 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0)) (.cse75 (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0)))) (let ((.cse71 (select .cse75 0)) (.cse70 (select .cse75 (+ .cse74 4))) (.cse72 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0)) (.cse73 (select .cse75 (+ (select (select |c_#memory_$Pointer$.offset| v_prenex_61) 0) 4)))) (and (= (select (select |c_#memory_$Pointer$.offset| .cse70) 0) 0) (not (= .cse71 .cse72)) (= (select (select |c_#memory_$Pointer$.base| .cse70) 0) 0) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse71)) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse73)) (= .cse74 0) (= .cse70 |c_ULTIMATE.start_main_~item~0#1.base|) (not (= .cse70 .cse73)) (not (= .cse72 0)) (not (= .cse72 v_prenex_61)) (= .cse72 .cse73))))) .cse33) (exists ((v_prenex_61 Int)) (let ((.cse77 (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0)))) (let ((.cse76 (select |c_#memory_$Pointer$.base| (select .cse77 (+ (select (select |c_#memory_$Pointer$.offset| v_prenex_61) 0) 4))))) (and (= .cse76 .cse77) (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int)) (let ((.cse81 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (let ((.cse79 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0)) (.cse82 (+ .cse81 4))) (let ((.cse78 (select .cse76 0)) (.cse83 (select (select |c_#memory_$Pointer$.offset| .cse79) .cse82)) (.cse80 (select .cse76 .cse82))) (and (not (= .cse78 .cse79)) (= 0 (select (select |c_#memory_$Pointer$.offset| .cse80) 0)) (= .cse81 0) (= (select .cse77 .cse82) |c_ULTIMATE.start_main_~item~0#1.base|) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse78)) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse79)) (= .cse83 0) (not (= .cse79 .cse80)) (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse83) (not (= .cse79 0)) (not (= .cse79 v_prenex_61)) (= (select (select |c_#memory_$Pointer$.base| .cse80) 0) 0)))))))))) (and .cse0 .cse36 (exists ((v_prenex_205 Int) (|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int) (v_prenex_61 Int)) (let ((.cse88 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0)) (.cse87 (select (select |c_#memory_$Pointer$.offset| v_prenex_61) 0))) (let ((.cse84 (select (select |c_#memory_$Pointer$.offset| v_prenex_205) 0)) (.cse86 (select (select |c_#memory_$Pointer$.offset| .cse88) (+ .cse87 4))) (.cse85 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0))) (and (not (= (+ .cse84 4) 0)) (not (= .cse85 |c_ULTIMATE.start_main_~item~0#1.base|)) (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse86) (not (= .cse85 v_prenex_61)) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse85)) (not (= .cse87 .cse84)) (not (= .cse88 |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= .cse84 0)) (not (= .cse87 0)) (= .cse86 0) (not (= .cse88 v_prenex_61)) (not (= .cse85 .cse88))))))) (and .cse33 (or (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int)) (let ((.cse89 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (let ((.cse92 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0)) (.cse93 (select |c_#memory_$Pointer$.base| .cse89))) (let ((.cse90 (select .cse93 0)) (.cse91 (select .cse93 (+ .cse92 4)))) (and (not (= .cse89 .cse90)) (= (select (select |c_#memory_$Pointer$.base| .cse91) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse91) 0) 0) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse90)) (not (= .cse89 .cse91)) (= .cse92 0) (exists ((v_arrayElimCell_929 Int)) (= (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| .cse90) (+ v_arrayElimCell_929 4))) .cse93)) (= .cse91 |c_ULTIMATE.start_main_~item~0#1.base|) (not (= .cse89 0))))))) (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int)) (let ((.cse94 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (let ((.cse98 (select |c_#memory_$Pointer$.base| .cse94)) (.cse97 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (let ((.cse96 (select .cse98 (+ .cse97 4))) (.cse95 (select .cse98 0))) (and (not (= .cse94 .cse95)) (= (select (select |c_#memory_$Pointer$.base| .cse96) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse96) 0) 0) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse95)) (not (= .cse94 .cse96)) (= .cse97 0) (= .cse96 |c_ULTIMATE.start_main_~item~0#1.base|) (not (= .cse94 0)) (exists ((v_arrayElimCell_929 Int)) (= .cse94 (select (select |c_#memory_$Pointer$.base| .cse95) (+ v_arrayElimCell_929 4))))))))))) (exists ((v_prenex_61 Int)) (let ((.cse105 (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0))) (.cse107 (select |c_#memory_$Pointer$.offset| v_prenex_61))) (let ((.cse99 (select .cse105 (+ (select .cse107 0) 4)))) (and (not (= v_prenex_61 .cse99)) (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int)) (let ((.cse104 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (let ((.cse106 (+ .cse104 4))) (let ((.cse101 (select .cse105 0)) (.cse103 (select .cse107 .cse106)) (.cse100 (select .cse105 .cse106)) (.cse102 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (and (= (select (select |c_#memory_$Pointer$.offset| .cse100) 0) 0) (not (= .cse101 .cse102)) (= (select (select |c_#memory_$Pointer$.base| .cse100) 0) 0) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse101)) (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse103) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse99)) (= .cse104 0) (= .cse100 |c_ULTIMATE.start_main_~item~0#1.base|) (= .cse103 0) (not (= .cse100 .cse99)) (not (= .cse102 0)) (= .cse102 .cse99)))))))))) (and .cse0 .cse36 .cse33 (exists ((v_prenex_205 Int) (v_prenex_61 Int) (v_prenex_206 Int)) (let ((.cse111 (select |c_#memory_$Pointer$.offset| v_prenex_61))) (let ((.cse110 (select (select |c_#memory_$Pointer$.base| v_prenex_206) 0)) (.cse108 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0)) (.cse109 (select .cse111 0))) (and (not (= v_prenex_61 0)) (not (= .cse108 |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= .cse108 v_prenex_61)) (not (= .cse109 (select (select |c_#memory_$Pointer$.offset| v_prenex_205) 0))) (not (= .cse109 0)) (not (= .cse108 0)) (= (select |c_#memory_$Pointer$.offset| .cse110) .cse111) (not (= .cse110 .cse108)) (not (= .cse108 v_prenex_206)) (not (= (+ .cse109 4) 0))))))) (and .cse0 .cse36 (exists ((v_prenex_205 Int) (v_prenex_61 Int) (v_prenex_206 Int)) (let ((.cse116 (select |c_#memory_$Pointer$.offset| v_prenex_61))) (let ((.cse114 (select (select |c_#memory_$Pointer$.offset| v_prenex_205) 0)) (.cse113 (select .cse116 0)) (.cse115 (select (select |c_#memory_$Pointer$.base| v_prenex_206) 0)) (.cse112 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0))) (and (not (= .cse112 |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= .cse112 v_prenex_61)) (not (= .cse113 .cse114)) (not (= .cse114 0)) (not (= .cse113 0)) (= (select |c_#memory_$Pointer$.offset| .cse115) .cse116) (not (= .cse115 .cse112)) (not (= .cse112 v_prenex_206)))))) .cse33) (and .cse117 .cse118) (exists ((v_prenex_61 Int)) (let ((.cse124 (select (select |c_#memory_$Pointer$.offset| v_prenex_61) 0))) (let ((.cse119 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0)) (.cse123 (+ .cse124 4))) (and (not (= .cse119 v_prenex_61)) (exists ((v_DerPreprocessor_1 Int)) (let ((.cse122 (select |c_#memory_$Pointer$.base| v_DerPreprocessor_1))) (let ((.cse121 (select .cse122 0)) (.cse120 (select .cse122 .cse123))) (and (= (select (select |c_#memory_$Pointer$.offset| .cse120) 0) 0) (= .cse121 0) (= .cse120 |c_ULTIMATE.start_main_~item~0#1.base|) (not (= .cse119 .cse120)) (not (= .cse119 .cse121)) (= (select .cse122 4) 0) (not (= v_prenex_61 .cse121)) (= .cse120 v_DerPreprocessor_1))))) (not (= .cse124 0)) (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int)) (let ((.cse126 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (let ((.cse125 (select (select |c_#memory_$Pointer$.offset| .cse126) .cse123))) (and (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse125) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse119)) (= .cse119 .cse126) (= .cse125 0))))))))) (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int) (v_prenex_61 Int)) (let ((.cse134 (select |c_#memory_$Pointer$.offset| v_prenex_61))) (let ((.cse130 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0)) (.cse132 (select .cse134 0))) (let ((.cse135 (+ .cse132 4)) (.cse127 (select |c_#memory_$Pointer$.base| .cse130))) (let ((.cse128 (select .cse127 0)) (.cse131 (select .cse127 .cse135)) (.cse129 (select .cse134 .cse135)) (.cse133 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (and (= (select .cse127 4) 0) (not (= .cse128 v_prenex_61)) (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse129) (not (= .cse128 .cse130)) (= (select (select |c_#memory_$Pointer$.base| .cse131) 0) 0) (= .cse131 |c_ULTIMATE.start_main_~item~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| .cse131) 0) 0) (not (= .cse132 0)) (= .cse129 0) (= .cse130 .cse133) (= (select |c_#memory_$Pointer$.offset| .cse133) .cse134))))))) (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int) (v_prenex_61 Int)) (let ((.cse136 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0)) (.cse140 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (let ((.cse142 (+ .cse140 4)) (.cse143 (select |c_#memory_$Pointer$.base| .cse136))) (let ((.cse137 (select .cse143 0)) (.cse138 (select .cse143 .cse142)) (.cse141 (select (select |c_#memory_$Pointer$.offset| .cse136) .cse142)) (.cse139 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0))) (and (not (= .cse136 .cse137)) (= (select (select |c_#memory_$Pointer$.base| .cse138) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse138) 0) 0) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse137)) (not (= .cse136 .cse138)) (not (= .cse136 (select (select |c_#memory_$Pointer$.base| .cse139) (+ (select (select |c_#memory_$Pointer$.offset| v_prenex_61) 0) 4)))) (= .cse140 0) (= .cse138 |c_ULTIMATE.start_main_~item~0#1.base|) (= .cse141 0) (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse141) (not (= .cse136 0)) (not (= .cse136 v_prenex_61)) (not (= .cse139 .cse136))))))) (exists ((v_prenex_61 Int)) (let ((.cse151 (select |c_#memory_$Pointer$.offset| v_prenex_61))) (let ((.cse150 (select .cse151 0)) (.cse145 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0))) (let ((.cse144 (select |c_#memory_$Pointer$.base| .cse145)) (.cse152 (+ .cse150 4))) (let ((.cse149 (select .cse144 .cse152))) (let ((.cse146 (select .cse144 0)) (.cse148 (select |c_#memory_$Pointer$.base| .cse149)) (.cse147 (select .cse151 .cse152))) (and (= (select .cse144 4) 0) (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int)) (= .cse145 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (not (= .cse146 v_prenex_61)) (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse147) (= .cse148 .cse144) (not (= .cse145 .cse149)) (not (= .cse146 .cse145)) (= (select .cse148 0) 0) (= .cse149 |c_ULTIMATE.start_main_~item~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| .cse149) 0) 0) (not (= .cse150 0)) (= .cse147 0)))))))) (exists ((v_prenex_61 Int)) (let ((.cse160 (select |c_#memory_$Pointer$.offset| v_prenex_61))) (let ((.cse161 (select .cse160 0))) (let ((.cse157 (+ .cse161 4))) (let ((.cse153 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0)) (.cse158 (select .cse160 .cse157))) (and (not (= .cse153 v_prenex_61)) (exists ((v_DerPreprocessor_1 Int)) (let ((.cse156 (select |c_#memory_$Pointer$.base| v_DerPreprocessor_1))) (let ((.cse155 (select .cse156 0)) (.cse154 (select .cse156 .cse157))) (and (= (select (select |c_#memory_$Pointer$.offset| .cse154) 0) 0) (= .cse155 0) (= .cse154 |c_ULTIMATE.start_main_~item~0#1.base|) (not (= .cse153 .cse154)) (not (= .cse153 .cse155)) (= (select .cse156 4) 0) (not (= v_prenex_61 .cse155)) (= .cse154 v_DerPreprocessor_1))))) (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse158) (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int)) (let ((.cse159 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (and (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse153)) (= .cse153 .cse159) (= (select |c_#memory_$Pointer$.offset| .cse159) .cse160)))) (not (= .cse161 0)) (= .cse158 0))))))) (and .cse33 (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int) (v_prenex_61 Int)) (let ((.cse166 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0)) (.cse165 (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0)))) (let ((.cse163 (select .cse165 0)) (.cse162 (select .cse165 (+ .cse166 4))) (.cse164 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (and (= (select (select |c_#memory_$Pointer$.offset| .cse162) 0) 0) (not (= .cse163 .cse164)) (= (select (select |c_#memory_$Pointer$.base| .cse162) 0) 0) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse163)) (not (= .cse164 (select .cse165 (+ (select (select |c_#memory_$Pointer$.offset| v_prenex_61) 0) 4)))) (= .cse166 0) (= .cse162 |c_ULTIMATE.start_main_~item~0#1.base|) (not (= .cse162 .cse164)) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse164)) (not (= .cse164 0)) (not (= .cse164 v_prenex_61))))))) (and .cse167 .cse31 .cse33 .cse34 .cse21) (and .cse0 .cse36 (or (exists ((v_prenex_202 Int)) (let ((.cse168 (select (select |c_#memory_$Pointer$.base| v_prenex_202) 0))) (and (not (= .cse168 |c_ULTIMATE.start_main_~item~0#1.base|)) (exists ((v_prenex_61 Int)) (let ((.cse172 (select |c_#memory_$Pointer$.offset| v_prenex_61))) (let ((.cse171 (select .cse172 0))) (let ((.cse169 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0)) (.cse170 (select .cse172 (+ .cse171 4)))) (and (not (= v_prenex_61 0)) (= .cse168 .cse169) (not (= .cse169 v_prenex_202)) (not (= .cse169 v_prenex_61)) (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse170) (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int)) (not (= .cse171 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0)))) (not (= .cse171 0)) (not (= .cse169 0)) (= .cse170 0))))))))) (exists ((v_prenex_202 Int)) (let ((.cse173 (select (select |c_#memory_$Pointer$.base| v_prenex_202) 0))) (and (exists ((v_prenex_61 Int)) (let ((.cse178 (select |c_#memory_$Pointer$.offset| v_prenex_61))) (let ((.cse176 (select .cse178 0))) (let ((.cse174 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0)) (.cse175 (select .cse178 (+ .cse176 4)))) (and (= .cse173 .cse174) (not (= .cse174 v_prenex_202)) (not (= .cse174 v_prenex_61)) (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse175) (not (= .cse176 0)) (= .cse175 0) (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int)) (let ((.cse177 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (and (not (= .cse176 .cse177)) (not (= .cse177 0)))))))))) (not (= .cse173 |c_ULTIMATE.start_main_~item~0#1.base|))))) (and (exists ((v_prenex_202 Int) (|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int) (v_prenex_61 Int)) (let ((.cse183 (select |c_#memory_$Pointer$.offset| v_prenex_61))) (let ((.cse182 (select .cse183 0))) (let ((.cse180 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0)) (.cse179 (select (select |c_#memory_$Pointer$.base| v_prenex_202) 0)) (.cse181 (select .cse183 (+ .cse182 4)))) (and (= .cse179 .cse180) (not (= .cse180 v_prenex_202)) (not (= .cse180 v_prenex_61)) (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse181) (not (= .cse182 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (not (= .cse182 0)) (not (= .cse179 |c_ULTIMATE.start_main_~item~0#1.base|)) (= .cse181 0)))))) .cse21))) (and .cse0 (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int) (v_prenex_61 Int)) (let ((.cse185 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0)) (.cse184 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (and (not (= .cse184 |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= .cse184 (select (select |c_#memory_$Pointer$.base| .cse185) (+ (select (select |c_#memory_$Pointer$.offset| v_prenex_61) 0) 4)))) (= (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0) 0) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse184)) (not (= .cse184 0)) (not (= .cse184 v_prenex_61)) (not (= .cse185 .cse184))))) .cse36 .cse33) (and .cse0 (exists ((v_prenex_205 Int) (v_prenex_61 Int) (v_prenex_206 Int)) (let ((.cse186 (select (select |c_#memory_$Pointer$.offset| v_prenex_205) 0)) (.cse189 (select (select |c_#memory_$Pointer$.offset| v_prenex_61) 0)) (.cse188 (select (select |c_#memory_$Pointer$.base| v_prenex_206) 0)) (.cse187 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0))) (and (not (= (+ .cse186 4) 0)) (not (= .cse187 |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= .cse188 v_prenex_61)) (not (= .cse187 v_prenex_61)) (not (= .cse189 .cse186)) (not (= .cse188 |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= .cse189 0)) (not (= .cse188 .cse187)) (not (= .cse187 v_prenex_206))))) .cse36 .cse33) (and .cse0 .cse36 .cse33 (exists ((v_prenex_205 Int) (v_prenex_61 Int) (v_prenex_206 Int)) (let ((.cse193 (select (select |c_#memory_$Pointer$.offset| v_prenex_205) 0)) (.cse192 (select (select |c_#memory_$Pointer$.offset| v_prenex_61) 0)) (.cse191 (select (select |c_#memory_$Pointer$.base| v_prenex_206) 0)) (.cse190 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0))) (and (not (= .cse190 |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= .cse191 v_prenex_61)) (not (= .cse190 v_prenex_61)) (not (= .cse192 .cse193)) (not (= .cse191 |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= .cse193 0)) (not (= .cse192 0)) (not (= .cse191 .cse190)) (not (= .cse190 v_prenex_206)))))) (and (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int) (v_prenex_573 Int) (v_DerPreprocessor_3 Int)) (let ((.cse195 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0)) (.cse200 (select |c_#memory_$Pointer$.base| v_DerPreprocessor_3))) (let ((.cse198 (select .cse200 0)) (.cse197 (select .cse200 (+ .cse195 4))) (.cse196 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0)) (.cse194 (select (select |c_#memory_$Pointer$.offset| v_prenex_573) 0))) (and (not (= .cse194 .cse195)) (not (= .cse196 .cse197)) (= (select (select |c_#memory_$Pointer$.base| .cse198) .cse199) v_DerPreprocessor_3) (not (= .cse196 .cse198)) (= 0 (select (select |c_#memory_$Pointer$.base| .cse197) 0)) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse198)) (= .cse195 0) (= (select (select |c_#memory_$Pointer$.offset| .cse197) 0) 0) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse196)) (= .cse197 |c_ULTIMATE.start_main_~item~0#1.base|) (not (= .cse196 0)) (not (= (+ .cse194 4) 0)))))) .cse33) (and .cse0 (exists ((v_prenex_205 Int) (v_prenex_61 Int) (v_prenex_206 Int)) (let ((.cse202 (select (select |c_#memory_$Pointer$.base| v_prenex_206) 0)) (.cse201 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0)) (.cse203 (select (select |c_#memory_$Pointer$.offset| v_prenex_61) 0))) (and (not (= v_prenex_61 0)) (not (= .cse201 |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= .cse202 v_prenex_61)) (not (= .cse201 v_prenex_61)) (not (= .cse203 (select (select |c_#memory_$Pointer$.offset| v_prenex_205) 0))) (not (= .cse202 |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= .cse203 0)) (not (= .cse201 0)) (not (= .cse202 .cse201)) (not (= .cse201 v_prenex_206)) (not (= (+ .cse203 4) 0))))) .cse36 .cse33) (and .cse0 .cse36 (exists ((v_prenex_205 Int) (|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int) (v_prenex_61 Int)) (let ((.cse209 (select |c_#memory_$Pointer$.offset| v_prenex_61))) (let ((.cse206 (select .cse209 0))) (let ((.cse207 (select (select |c_#memory_$Pointer$.offset| v_prenex_205) 0)) (.cse205 (select .cse209 (+ .cse206 4))) (.cse204 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0)) (.cse208 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (and (not (= .cse204 |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= .cse204 v_prenex_61)) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse204)) (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse205) (not (= .cse206 .cse207)) (not (= .cse207 0)) (not (= .cse206 0)) (= .cse205 0) (not (= .cse204 .cse208)) (= (select |c_#memory_$Pointer$.offset| .cse208) .cse209))))))) (and .cse57 .cse118) (and .cse0 (exists ((v_prenex_205 Int) (|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int) (v_prenex_61 Int)) (let ((.cse214 (select |c_#memory_$Pointer$.offset| v_prenex_61))) (let ((.cse212 (select .cse214 0))) (let ((.cse211 (select .cse214 (+ .cse212 4))) (.cse210 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0)) (.cse213 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (and (not (= v_prenex_61 0)) (not (= .cse210 |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= .cse210 v_prenex_61)) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse210)) (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse211) (not (= .cse212 (select (select |c_#memory_$Pointer$.offset| v_prenex_205) 0))) (not (= .cse212 0)) (not (= .cse210 0)) (= .cse211 0) (not (= .cse210 .cse213)) (= (select |c_#memory_$Pointer$.offset| .cse213) .cse214)))))) .cse36) (and .cse57 .cse215) (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int) (v_prenex_61 Int)) (let ((.cse221 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0)) (.cse222 (select (select |c_#memory_$Pointer$.offset| v_prenex_61) 0))) (let ((.cse219 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0)) (.cse223 (+ .cse222 4)) (.cse216 (select |c_#memory_$Pointer$.base| .cse221))) (let ((.cse218 (select .cse216 0)) (.cse220 (select .cse216 .cse223)) (.cse217 (select (select |c_#memory_$Pointer$.offset| .cse219) .cse223))) (and (= (select .cse216 4) 0) (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse217) (not (= .cse218 v_prenex_61)) (not (= .cse219 .cse220)) (not (= .cse218 .cse221)) (= (select (select |c_#memory_$Pointer$.base| .cse220) 0) 0) (= .cse220 |c_ULTIMATE.start_main_~item~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| .cse220) 0) 0) (not (= .cse222 0)) (= .cse221 .cse219) (= .cse217 0)))))) (and .cse0 .cse36 .cse224 .cse33) (and .cse0 .cse36 (or (exists ((v_prenex_61 Int)) (let ((.cse225 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0))) (and (not (= .cse225 |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= .cse225 v_prenex_61)) (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int)) (let ((.cse227 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0)) (.cse226 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (let ((.cse228 (select (select |c_#memory_$Pointer$.offset| .cse227) (+ .cse226 4)))) (and (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse225)) (not (= (select (select |c_#memory_$Pointer$.offset| v_prenex_61) 0) .cse226)) (= .cse226 0) (= .cse225 .cse227) (= .cse228 0) (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse228) (not (= .cse227 0))))))))) (exists ((v_prenex_61 Int)) (let ((.cse229 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0))) (and (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int)) (let ((.cse231 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0)) (.cse230 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (let ((.cse232 (select (select |c_#memory_$Pointer$.offset| .cse231) (+ .cse230 4)))) (and (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse229)) (= .cse230 0) (= .cse229 .cse231) (= .cse232 0) (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse232) (not (= .cse231 0)))))) (not (= .cse229 |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= .cse229 v_prenex_61)) (not (= (+ (select (select |c_#memory_$Pointer$.offset| v_prenex_61) 0) 4) 0))))) (exists ((v_prenex_61 Int)) (let ((.cse233 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0))) (and (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int)) (let ((.cse235 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0)) (.cse234 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (let ((.cse236 (select (select |c_#memory_$Pointer$.offset| .cse235) (+ .cse234 4)))) (and (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse233)) (= .cse234 0) (= .cse233 .cse235) (= .cse236 0) (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse236) (not (= .cse235 0)))))) (not (= .cse233 |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= .cse233 v_prenex_61))))) (exists ((v_prenex_61 Int)) (let ((.cse237 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0)) (.cse238 (select (select |c_#memory_$Pointer$.offset| v_prenex_61) 0))) (and (not (= .cse237 |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= .cse237 v_prenex_61)) (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int)) (let ((.cse240 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0)) (.cse239 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (let ((.cse241 (select (select |c_#memory_$Pointer$.offset| .cse240) (+ .cse239 4)))) (and (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse237)) (not (= .cse238 .cse239)) (= .cse239 0) (= .cse237 .cse240) (= .cse241 0) (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse241) (not (= .cse240 0)))))) (not (= (+ .cse238 4) 0))))))) (exists ((v_prenex_61 Int)) (let ((.cse247 (select (select |c_#memory_$Pointer$.offset| v_prenex_61) 0)) (.cse245 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0))) (let ((.cse242 (select |c_#memory_$Pointer$.base| .cse245)) (.cse250 (+ .cse247 4))) (let ((.cse246 (select .cse242 .cse250))) (let ((.cse243 (select .cse242 0)) (.cse244 (select |c_#memory_$Pointer$.base| .cse246))) (and (= (select .cse242 4) 0) (not (= .cse243 v_prenex_61)) (= .cse244 .cse242) (not (= .cse245 .cse246)) (not (= .cse243 .cse245)) (= (select .cse244 0) 0) (= .cse246 |c_ULTIMATE.start_main_~item~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| .cse246) 0) 0) (not (= .cse247 0)) (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int)) (let ((.cse249 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (let ((.cse248 (select (select |c_#memory_$Pointer$.offset| .cse249) .cse250))) (and (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse248) (= .cse245 .cse249) (= .cse248 0))))))))))) (exists ((v_prenex_61 Int)) (let ((.cse254 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0))) (and (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int) (v_DerPreprocessor_2 Int)) (let ((.cse256 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (let ((.cse258 (select |c_#memory_$Pointer$.offset| v_prenex_61)) (.cse259 (+ .cse256 4)) (.cse257 (select |c_#memory_$Pointer$.base| v_DerPreprocessor_2))) (let ((.cse253 (select .cse257 0)) (.cse255 (select .cse258 .cse259)) (.cse251 (select .cse257 .cse259)) (.cse252 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (and (= (select (select |c_#memory_$Pointer$.base| .cse251) 0) 0) (not (= .cse252 .cse253)) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse254)) (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse255) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse253)) (not (= .cse254 .cse251)) (= .cse256 0) (= (select (select |c_#memory_$Pointer$.offset| .cse251) 0) 0) (= .cse255 0) (= .cse254 .cse252) (= .cse251 |c_ULTIMATE.start_main_~item~0#1.base|) (= (select .cse257 (+ (select .cse258 0) 4)) v_DerPreprocessor_2) (not (= .cse252 0)) (= (select |c_#memory_$Pointer$.offset| .cse252) .cse258)))))) (not (= .cse254 v_prenex_61))))) (exists ((v_prenex_61 Int)) (let ((.cse268 (select |c_#memory_$Pointer$.offset| v_prenex_61))) (let ((.cse262 (select .cse268 0))) (let ((.cse267 (+ .cse262 4))) (let ((.cse261 (select .cse268 .cse267)) (.cse260 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0))) (and (not (= .cse260 v_prenex_61)) (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse261) (not (= .cse262 0)) (= .cse261 0) (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int)) (let ((.cse266 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (let ((.cse265 (select |c_#memory_$Pointer$.base| .cse266))) (let ((.cse264 (select .cse265 0)) (.cse263 (select .cse265 .cse267))) (and (not (= .cse260 .cse263)) (not (= v_prenex_61 .cse264)) (not (= .cse260 .cse264)) (= .cse264 0) (= (select .cse265 4) 0) (= .cse260 .cse266) (= .cse265 (select |c_#memory_$Pointer$.base| .cse263)) (= .cse263 |c_ULTIMATE.start_main_~item~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| .cse263) 0) 0)))))))))))) (and .cse0 (exists ((v_arrayElimCell_931 Int) (v_prenex_61 Int)) (let ((.cse269 (select |c_#memory_$Pointer$.offset| v_arrayElimCell_931))) (let ((.cse270 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0)) (.cse271 (select .cse269 0))) (and (= .cse269 (select |c_#memory_$Pointer$.offset| v_prenex_61)) (not (= .cse270 |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= .cse270 v_prenex_61)) (not (= (+ 4 .cse271) 0)) (not (= v_prenex_61 v_arrayElimCell_931)) (not (= .cse270 v_arrayElimCell_931)) (not (= 0 .cse271)))))) .cse36 .cse33) (and .cse0 (exists ((v_prenex_205 Int) (v_prenex_61 Int) (v_prenex_206 Int)) (let ((.cse272 (select (select |c_#memory_$Pointer$.offset| v_prenex_205) 0)) (.cse274 (select (select |c_#memory_$Pointer$.base| v_prenex_206) 0)) (.cse273 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0)) (.cse275 (select (select |c_#memory_$Pointer$.offset| v_prenex_61) 0))) (and (not (= (+ .cse272 4) 0)) (not (= .cse273 |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= .cse274 v_prenex_61)) (not (= .cse273 v_prenex_61)) (not (= .cse275 .cse272)) (not (= .cse274 |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= .cse275 0)) (not (= .cse274 .cse273)) (not (= .cse273 v_prenex_206)) (not (= (+ .cse275 4) 0))))) .cse36 .cse33) (and .cse0 .cse36 (exists ((v_arrayElimCell_926 Int) (v_prenex_61 Int)) (let ((.cse276 (select |c_#memory_$Pointer$.offset| v_arrayElimCell_926))) (let ((.cse277 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0)) (.cse278 (select .cse276 0))) (and (= .cse276 (select |c_#memory_$Pointer$.offset| v_prenex_61)) (not (= .cse277 |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= .cse277 v_prenex_61)) (not (= .cse278 0)) (not (= v_prenex_61 v_arrayElimCell_926)) (not (= .cse277 v_arrayElimCell_926)) (not (= (+ .cse278 4) 0)))))) .cse33) (and .cse0 .cse36 (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int) (v_prenex_61 Int)) (let ((.cse282 (select |c_#memory_$Pointer$.offset| v_prenex_61)) (.cse283 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (let ((.cse279 (select .cse282 (+ .cse283 4))) (.cse281 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0)) (.cse280 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (and (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse279) (not (= .cse280 |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= .cse280 (select (select |c_#memory_$Pointer$.base| .cse281) (+ (select .cse282 0) 4)))) (= .cse283 0) (= .cse279 0) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse280)) (not (= .cse280 0)) (not (= .cse280 v_prenex_61)) (not (= .cse281 .cse280)) (= (select |c_#memory_$Pointer$.offset| .cse280) .cse282)))))) (and .cse0 .cse36 (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int) (v_prenex_61 Int)) (let ((.cse284 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0)) (.cse286 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (let ((.cse287 (select (select |c_#memory_$Pointer$.offset| .cse284) (+ .cse286 4))) (.cse285 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0))) (and (not (= .cse284 |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= .cse284 (select (select |c_#memory_$Pointer$.base| .cse285) (+ (select (select |c_#memory_$Pointer$.offset| v_prenex_61) 0) 4)))) (= .cse286 0) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse284)) (= .cse287 0) (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse287) (not (= .cse284 0)) (not (= .cse284 v_prenex_61)) (not (= .cse285 .cse284))))))) (and .cse31 .cse32 .cse33 .cse34 .cse21) (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int)) (let ((.cse288 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0)) (.cse292 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (and (= .cse288 0) (exists ((v_prenex_61 Int)) (let ((.cse294 (select |c_#memory_$Pointer$.base| v_prenex_61)) (.cse293 (select |c_#memory_$Pointer$.offset| v_prenex_61)) (.cse295 (+ .cse288 4))) (let ((.cse291 (select .cse293 .cse295)) (.cse289 (select .cse294 .cse295)) (.cse290 (select .cse294 0))) (and (= (select (select |c_#memory_$Pointer$.base| .cse289) 0) 0) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse290)) (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse291) (not (= .cse292 .cse289)) (= .cse291 0) (= (select (select |c_#memory_$Pointer$.offset| .cse289) 0) 0) (= (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| .cse290) (+ (select .cse293 0) 4))) .cse294) (= .cse289 |c_ULTIMATE.start_main_~item~0#1.base|) (not (= .cse290 .cse292)))))) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse292)) (not (= .cse292 0))))) (and .cse31 .cse33 (exists ((v_prenex_205 Int) (v_prenex_206 Int) (v_prenex_61 Int)) (let ((.cse298 (select (select |c_#memory_$Pointer$.offset| v_prenex_61) 0)) (.cse296 (select (select |c_#memory_$Pointer$.base| v_prenex_206) 0)) (.cse297 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0))) (and (not (= .cse296 0)) (not (= .cse296 v_prenex_61)) (not (= .cse297 v_prenex_61)) (not (= .cse298 (select (select |c_#memory_$Pointer$.offset| v_prenex_205) 0))) (not (= .cse298 0)) (not (= .cse297 0)) (not (= .cse296 .cse297)) (not (= .cse297 v_prenex_206))))) .cse34 .cse21) (and .cse299 .cse30 .cse31 .cse34 .cse21) (and (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int) (v_prenex_61 Int)) (let ((.cse305 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0)) (.cse306 (select |c_#memory_$Pointer$.offset| v_prenex_61))) (let ((.cse303 (select .cse306 0)) (.cse304 (select |c_#memory_$Pointer$.base| .cse305))) (let ((.cse302 (select .cse304 0)) (.cse301 (select .cse304 (+ .cse303 4))) (.cse300 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0))) (and (not (= .cse300 .cse301)) (not (= .cse300 v_prenex_61)) (not (= v_prenex_61 .cse302)) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse300)) (not (= .cse300 .cse302)) (= .cse302 0) (not (= .cse303 0)) (= (select .cse304 4) 0) (= .cse304 (select |c_#memory_$Pointer$.base| .cse301)) (= .cse301 |c_ULTIMATE.start_main_~item~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| .cse301) 0) 0) (not (= .cse300 .cse305)) (= (select |c_#memory_$Pointer$.offset| .cse305) .cse306)))))) .cse33) (and .cse33 (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int) (v_prenex_61 Int)) (let ((.cse312 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (let ((.cse310 (select (select |c_#memory_$Pointer$.offset| v_prenex_61) 0)) (.cse311 (select |c_#memory_$Pointer$.base| .cse312))) (let ((.cse309 (select .cse311 0)) (.cse307 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0)) (.cse308 (select .cse311 (+ .cse310 4)))) (and (not (= .cse307 .cse308)) (not (= v_prenex_61 .cse309)) (not (= .cse307 .cse309)) (= .cse309 0) (not (= .cse310 0)) (= (select .cse311 4) 0) (= .cse307 .cse312) (= .cse311 (select |c_#memory_$Pointer$.base| .cse308)) (= .cse308 |c_ULTIMATE.start_main_~item~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| .cse308) 0) 0))))))) (and (or .cse54 (and .cse0 .cse313 .cse33)) .cse56) (and (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int) (v_prenex_61 Int)) (let ((.cse319 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0)) (.cse320 (select |c_#memory_$Pointer$.offset| v_prenex_61))) (let ((.cse317 (select .cse320 0)) (.cse318 (select |c_#memory_$Pointer$.base| .cse319))) (let ((.cse316 (select .cse318 0)) (.cse315 (select .cse318 (+ .cse317 4))) (.cse314 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0))) (and (not (= .cse314 .cse315)) (not (= .cse314 v_prenex_61)) (not (= v_prenex_61 .cse316)) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse314)) (not (= .cse314 .cse316)) (= (select (select |c_#memory_$Pointer$.base| .cse315) 0) 0) (not (= .cse317 0)) (= (select .cse318 4) 0) (= .cse315 |c_ULTIMATE.start_main_~item~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| .cse315) 0) 0) (not (= .cse314 .cse319)) (= (select |c_#memory_$Pointer$.offset| .cse319) .cse320)))))) .cse33) (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int) (v_prenex_61 Int)) (let ((.cse327 (select |c_#memory_$Pointer$.offset| v_prenex_61))) (let ((.cse324 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0)) (.cse326 (select .cse327 0))) (let ((.cse328 (+ .cse326 4)) (.cse321 (select |c_#memory_$Pointer$.base| .cse324))) (let ((.cse322 (select .cse321 0)) (.cse325 (select .cse321 .cse328)) (.cse323 (select .cse327 .cse328))) (and (= (select .cse321 4) 0) (not (= .cse322 v_prenex_61)) (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse323) (not (= .cse324 .cse325)) (not (= .cse322 .cse324)) (= (select (select |c_#memory_$Pointer$.base| .cse325) 0) 0) (= .cse325 |c_ULTIMATE.start_main_~item~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| .cse325) 0) 0) (not (= .cse326 0)) (= .cse323 0) (= (select |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0)) .cse327))))))) (and .cse117 .cse215) (and .cse0 .cse36 (exists ((v_prenex_205 Int) (|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int) (v_prenex_61 Int)) (let ((.cse331 (select (select |c_#memory_$Pointer$.offset| v_prenex_61) 0))) (let ((.cse332 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0)) (.cse333 (+ .cse331 4))) (let ((.cse330 (select (select |c_#memory_$Pointer$.offset| .cse332) .cse333)) (.cse329 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0))) (and (not (= v_prenex_61 0)) (not (= .cse329 |c_ULTIMATE.start_main_~item~0#1.base|)) (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse330) (not (= .cse329 v_prenex_61)) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse329)) (not (= .cse331 (select (select |c_#memory_$Pointer$.offset| v_prenex_205) 0))) (not (= .cse332 |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= .cse331 0)) (not (= .cse329 0)) (= .cse330 0) (not (= .cse332 v_prenex_61)) (not (= .cse333 0)) (not (= .cse329 .cse332)))))))) (exists ((v_prenex_61 Int)) (let ((.cse334 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0))) (and (not (= .cse334 v_prenex_61)) (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int) (v_DerPreprocessor_2 Int)) (let ((.cse339 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (let ((.cse341 (select |c_#memory_$Pointer$.offset| v_prenex_61)) (.cse342 (+ .cse339 4)) (.cse340 (select |c_#memory_$Pointer$.base| v_DerPreprocessor_2))) (let ((.cse337 (select .cse340 0)) (.cse338 (select .cse341 .cse342)) (.cse335 (select .cse340 .cse342)) (.cse336 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (and (= (select (select |c_#memory_$Pointer$.base| .cse335) 0) 0) (not (= .cse336 .cse337)) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse334)) (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse338) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse337)) (not (= .cse334 .cse335)) (= .cse339 0) (= (select (select |c_#memory_$Pointer$.offset| .cse335) 0) 0) (= .cse338 0) (= .cse334 .cse336) (= .cse335 |c_ULTIMATE.start_main_~item~0#1.base|) (= (select .cse340 (+ (select .cse341 0) 4)) v_DerPreprocessor_2) (not (= .cse336 0)))))))))) (and .cse33 (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int) (v_prenex_61 Int)) (let ((.cse350 (select |c_#memory_$Pointer$.offset| v_prenex_61)) (.cse344 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0))) (let ((.cse343 (select |c_#memory_$Pointer$.base| .cse344)) (.cse348 (select .cse350 0))) (let ((.cse346 (select .cse343 (+ .cse348 4)))) (let ((.cse345 (select .cse343 0)) (.cse347 (select |c_#memory_$Pointer$.base| .cse346)) (.cse349 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (and (= (select .cse343 4) 0) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse344)) (not (= .cse345 v_prenex_61)) (not (= .cse344 .cse346)) (not (= .cse345 .cse344)) (= (select .cse347 0) 0) (= .cse346 |c_ULTIMATE.start_main_~item~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| .cse346) 0) 0) (not (= .cse348 0)) (= .cse347 (select |c_#memory_$Pointer$.base| .cse349)) (not (= .cse344 .cse349)) (= (select |c_#memory_$Pointer$.offset| .cse349) .cse350)))))))) (and .cse167 .cse30 .cse31 .cse33 .cse34 .cse21) (and .cse299 .cse31 .cse34 .cse21) (and .cse0 (exists ((v_prenex_61 Int)) (let ((.cse351 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0))) (and (not (= .cse351 |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= .cse351 v_prenex_61)) (not (= (select (select |c_#memory_$Pointer$.offset| v_prenex_61) 0) 0))))) .cse36 .cse33) (and .cse33 (exists ((v_arrayElimCell_919 Int) (|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int) (v_prenex_573 Int) (v_DerPreprocessor_3 Int)) (let ((.cse352 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0)) (.cse356 (select |c_#memory_$Pointer$.base| v_DerPreprocessor_3))) (let ((.cse355 (select .cse356 0)) (.cse354 (select .cse356 (+ .cse352 4))) (.cse353 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (and (not (= (select (select |c_#memory_$Pointer$.offset| v_prenex_573) 0) .cse352)) (not (= .cse353 .cse354)) (not (= .cse353 .cse355)) (= 0 (select (select |c_#memory_$Pointer$.base| .cse354) 0)) (= v_DerPreprocessor_3 (select (select |c_#memory_$Pointer$.base| .cse355) (+ v_arrayElimCell_919 4))) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse355)) (= .cse352 0) (= (select (select |c_#memory_$Pointer$.offset| .cse354) 0) 0) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse353)) (= .cse354 |c_ULTIMATE.start_main_~item~0#1.base|) (not (= .cse353 0))))))) (and .cse0 .cse36 .cse33 .cse357 .cse358) (and .cse0 .cse359 .cse36 .cse37) (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int) (v_prenex_61 Int)) (let ((.cse366 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (let ((.cse365 (select |c_#memory_$Pointer$.offset| v_prenex_61)) (.cse367 (+ .cse366 4)) (.cse364 (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0)))) (let ((.cse361 (select .cse364 0)) (.cse360 (select .cse364 .cse367)) (.cse363 (select .cse365 .cse367)) (.cse362 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (and (= (select (select |c_#memory_$Pointer$.offset| .cse360) 0) 0) (not (= .cse361 .cse362)) (= (select (select |c_#memory_$Pointer$.base| .cse360) 0) 0) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse361)) (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse363) (not (= .cse362 (select .cse364 (+ (select .cse365 0) 4)))) (= .cse366 0) (= .cse360 |c_ULTIMATE.start_main_~item~0#1.base|) (= .cse363 0) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse362)) (not (= .cse362 0)) (not (= .cse362 v_prenex_61)) (= (select |c_#memory_$Pointer$.offset| .cse362) .cse365)))))) (and .cse0 .cse36 (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int) (v_prenex_61 Int)) (let ((.cse370 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0)) (.cse369 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (let ((.cse368 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0)) (.cse371 (select (select |c_#memory_$Pointer$.offset| .cse370) (+ .cse369 4)))) (and (not (= .cse368 |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= .cse368 v_prenex_61)) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse368)) (not (= (select (select |c_#memory_$Pointer$.offset| v_prenex_61) 0) .cse369)) (= .cse369 0) (= .cse368 .cse370) (= .cse371 0) (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse371) (not (= .cse370 0))))))) (and .cse33 (exists ((v_arrayElimCell_919 Int) (|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int) (v_prenex_573 Int) (v_DerPreprocessor_3 Int)) (let ((.cse373 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0)) (.cse377 (select |c_#memory_$Pointer$.base| v_DerPreprocessor_3))) (let ((.cse376 (select .cse377 0)) (.cse375 (select .cse377 (+ .cse373 4))) (.cse374 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0)) (.cse372 (select (select |c_#memory_$Pointer$.offset| v_prenex_573) 0))) (and (not (= .cse372 .cse373)) (not (= .cse374 .cse375)) (not (= .cse374 .cse376)) (= 0 (select (select |c_#memory_$Pointer$.base| .cse375) 0)) (= v_DerPreprocessor_3 (select (select |c_#memory_$Pointer$.base| .cse376) (+ v_arrayElimCell_919 4))) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse376)) (= .cse373 0) (= (select (select |c_#memory_$Pointer$.offset| .cse375) 0) 0) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse374)) (= .cse375 |c_ULTIMATE.start_main_~item~0#1.base|) (not (= .cse374 0)) (not (= (+ .cse372 4) 0))))))) (and (or (and .cse0 .cse33 (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int) (v_prenex_61 Int)) (let ((.cse381 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (let ((.cse379 (select |c_#memory_$Pointer$.base| .cse381)) (.cse380 (select (select |c_#memory_$Pointer$.offset| v_prenex_61) 0)) (.cse378 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0))) (and (not (= .cse378 |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= .cse378 v_prenex_61)) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse378)) (= .cse2 .cse379) (= (select .cse379 0) 0) (not (= .cse380 0)) (not (= .cse381 v_prenex_61)) (not (= (+ .cse380 4) 0)) (not (= .cse378 .cse381))))))) (and .cse0 (exists ((v_prenex_214 Int) (v_prenex_61 Int)) (let ((.cse386 (select (select |c_#memory_$Pointer$.offset| v_prenex_61) 0))) (let ((.cse383 (select (select |c_#memory_$Pointer$.base| v_prenex_214) 0)) (.cse387 (+ .cse386 4))) (let ((.cse382 (select (select |c_#memory_$Pointer$.offset| .cse383) .cse387)) (.cse384 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0)) (.cse385 (select |c_#memory_$Pointer$.base| .cse383))) (and (= .cse382 0) (not (= .cse383 .cse384)) (not (= .cse384 |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= .cse384 v_prenex_61)) (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse382) (not (= .cse383 v_prenex_61)) (= (select .cse385 0) 0) (not (= .cse386 0)) (not (= .cse384 v_prenex_214)) (= .cse385 .cse2) (not (= .cse387 0))))))))) .cse56) (and (exists ((v_prenex_205 Int) (|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int) (v_prenex_61 Int)) (let ((.cse391 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0)) (.cse390 (select (select |c_#memory_$Pointer$.offset| v_prenex_61) 0))) (let ((.cse388 (select (select |c_#memory_$Pointer$.offset| .cse391) (+ .cse390 4))) (.cse389 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0))) (and (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse388) (not (= .cse389 v_prenex_61)) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse389)) (not (= .cse390 (select (select |c_#memory_$Pointer$.offset| v_prenex_205) 0))) (not (= .cse390 0)) (not (= .cse389 0)) (= .cse388 0) (not (= .cse391 0)) (not (= .cse391 v_prenex_61)) (not (= .cse389 .cse391)))))) .cse31 .cse34 .cse21) (and (exists ((v_prenex_205 Int) (v_prenex_61 Int) (v_prenex_206 Int)) (let ((.cse395 (select |c_#memory_$Pointer$.offset| v_prenex_61))) (let ((.cse393 (select .cse395 0)) (.cse394 (select (select |c_#memory_$Pointer$.base| v_prenex_206) 0)) (.cse392 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0))) (and (not (= .cse392 v_prenex_61)) (not (= .cse393 (select (select |c_#memory_$Pointer$.offset| v_prenex_205) 0))) (not (= .cse393 0)) (not (= .cse392 0)) (= (select |c_#memory_$Pointer$.offset| .cse394) .cse395) (not (= .cse394 .cse392)) (not (= .cse392 v_prenex_206)))))) .cse31 .cse33 .cse34 .cse21) (and .cse396 .cse33 .cse397) (and .cse31 (exists ((v_prenex_205 Int) (|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int) (v_prenex_61 Int)) (let ((.cse402 (select |c_#memory_$Pointer$.offset| v_prenex_61))) (let ((.cse400 (select .cse402 0))) (let ((.cse399 (select .cse402 (+ .cse400 4))) (.cse398 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0)) (.cse401 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (and (not (= .cse398 v_prenex_61)) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse398)) (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse399) (not (= .cse400 (select (select |c_#memory_$Pointer$.offset| v_prenex_205) 0))) (not (= .cse400 0)) (not (= .cse398 0)) (= .cse399 0) (not (= .cse398 .cse401)) (= (select |c_#memory_$Pointer$.offset| .cse401) .cse402)))))) .cse34 .cse21) (and .cse0 (exists ((v_arrayElimCell_917 Int) (v_prenex_573 Int) (|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int)) (let ((.cse404 (select (select |c_#memory_$Pointer$.base| v_prenex_573) 0)) (.cse403 (select (select |c_#memory_$Pointer$.offset| v_prenex_573) 0))) (and (not (= .cse403 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (not (= .cse404 |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= v_arrayElimCell_917 .cse404)) (not (= v_arrayElimCell_917 v_prenex_573)) (not (= v_prenex_573 .cse404)) (= (select (select |c_#memory_$Pointer$.base| v_arrayElimCell_917) .cse199) .cse404) (not (= .cse404 0)) (= .cse403 0)))) .cse36 .cse33) (and .cse0 (or (exists ((v_prenex_214 Int)) (let ((.cse405 (select (select |c_#memory_$Pointer$.base| v_prenex_214) 0))) (let ((.cse410 (select |c_#memory_$Pointer$.base| .cse405))) (and (exists ((v_prenex_61 Int)) (let ((.cse408 (select |c_#memory_$Pointer$.offset| v_prenex_61))) (let ((.cse407 (select .cse408 0))) (let ((.cse406 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0)) (.cse409 (select .cse408 (+ .cse407 4)))) (and (not (= v_prenex_61 0)) (not (= .cse405 .cse406)) (not (= .cse406 |c_ULTIMATE.start_main_~item~0#1.base|)) (exists ((v_prenex_213 Int)) (not (= (select (select |c_#memory_$Pointer$.offset| v_prenex_213) 0) .cse407))) (= (select |c_#memory_$Pointer$.offset| .cse405) .cse408) (not (= .cse406 v_prenex_61)) (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse409) (not (= .cse407 0)) (not (= .cse406 0)) (not (= .cse406 v_prenex_214)) (= .cse409 0)))))) (= (select .cse410 0) 0) (= .cse410 .cse2))))) .cse411 .cse412)) (and .cse0 (or (and (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int) (v_prenex_61 Int)) (let ((.cse416 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (let ((.cse414 (select |c_#memory_$Pointer$.base| .cse416)) (.cse415 (select (select |c_#memory_$Pointer$.offset| v_prenex_61) 0)) (.cse413 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0))) (and (not (= .cse413 |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= .cse413 v_prenex_61)) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse413)) (= .cse2 .cse414) (= (select .cse414 0) 0) (not (= .cse415 0)) (not (= (+ .cse415 4) 0)) (not (= .cse413 .cse416)))))) .cse21) (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int)) (let ((.cse419 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (let ((.cse420 (select |c_#memory_$Pointer$.base| .cse419))) (and (exists ((v_prenex_61 Int)) (let ((.cse418 (select (select |c_#memory_$Pointer$.offset| v_prenex_61) 0)) (.cse417 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0))) (and (not (= v_prenex_61 0)) (not (= .cse417 |c_ULTIMATE.start_main_~item~0#1.base|)) (exists ((v_prenex_213 Int)) (not (= (select (select |c_#memory_$Pointer$.offset| v_prenex_213) 0) .cse418))) (not (= .cse417 v_prenex_61)) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse417)) (not (= .cse418 0)) (not (= .cse417 0)) (not (= (+ .cse418 4) 0)) (not (= .cse417 .cse419))))) (= .cse2 .cse420) (= (select .cse420 0) 0))))) (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int)) (let ((.cse425 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (let ((.cse421 (select |c_#memory_$Pointer$.base| .cse425))) (and (= .cse2 .cse421) (= (select .cse421 0) 0) (exists ((v_prenex_61 Int)) (let ((.cse424 (select (select |c_#memory_$Pointer$.offset| v_prenex_61) 0)) (.cse422 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0))) (and (not (= .cse422 |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= .cse422 v_prenex_61)) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse422)) (exists ((v_prenex_213 Int)) (let ((.cse423 (select (select |c_#memory_$Pointer$.offset| v_prenex_213) 0))) (and (not (= (+ .cse423 4) 0)) (not (= .cse423 .cse424))))) (not (= .cse424 0)) (not (= .cse425 v_prenex_61)) (not (= (+ .cse424 4) 0)) (not (= .cse422 .cse425)))))))))) .cse33) (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int) (v_prenex_61 Int)) (let ((.cse432 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (let ((.cse431 (select |c_#memory_$Pointer$.offset| v_prenex_61)) (.cse433 (+ .cse432 4)) (.cse430 (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0)))) (let ((.cse427 (select .cse430 0)) (.cse429 (select .cse431 .cse433)) (.cse426 (select .cse430 .cse433)) (.cse428 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (and (= (select (select |c_#memory_$Pointer$.offset| .cse426) 0) 0) (not (= .cse427 .cse428)) (= (select (select |c_#memory_$Pointer$.base| .cse426) 0) 0) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse427)) (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse429) (not (= .cse428 (select .cse430 (+ (select .cse431 0) 4)))) (= .cse432 0) (= .cse426 |c_ULTIMATE.start_main_~item~0#1.base|) (= .cse429 0) (not (= .cse426 .cse428)) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse428)) (not (= .cse428 0)) (not (= .cse428 v_prenex_61))))))) (and .cse0 (or .cse411 .cse412)) (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int) (v_prenex_61 Int)) (let ((.cse440 (select (select |c_#memory_$Pointer$.offset| v_prenex_61) 0)) (.cse437 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0))) (let ((.cse434 (select |c_#memory_$Pointer$.base| .cse437)) (.cse442 (+ .cse440 4))) (let ((.cse441 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0)) (.cse438 (select .cse434 .cse442))) (let ((.cse436 (select .cse434 0)) (.cse439 (select |c_#memory_$Pointer$.base| .cse438)) (.cse435 (select (select |c_#memory_$Pointer$.offset| .cse441) .cse442))) (and (= (select .cse434 4) 0) (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse435) (not (= .cse436 v_prenex_61)) (not (= .cse437 .cse438)) (not (= .cse436 .cse437)) (= (select .cse439 0) 0) (= .cse438 |c_ULTIMATE.start_main_~item~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| .cse438) 0) 0) (not (= .cse440 0)) (= .cse439 (select |c_#memory_$Pointer$.base| .cse441)) (= .cse435 0) (not (= .cse441 v_prenex_61)))))))) (and .cse0 .cse443 .cse36 .cse37) (exists ((v_prenex_61 Int)) (let ((.cse444 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0))) (and (not (= .cse444 v_prenex_61)) (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int)) (let ((.cse445 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0)) (.cse449 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (let ((.cse451 (select |c_#memory_$Pointer$.offset| v_prenex_61)) (.cse452 (+ .cse449 4)) (.cse450 (select |c_#memory_$Pointer$.base| .cse445))) (let ((.cse446 (select .cse450 0)) (.cse448 (select .cse451 .cse452)) (.cse447 (select .cse450 .cse452))) (and (not (= .cse445 .cse446)) (not (= .cse444 .cse447)) (= (select (select |c_#memory_$Pointer$.base| .cse447) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse447) 0) 0) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse446)) (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse448) (= .cse449 0) (= .cse448 0) (= .cse444 .cse445) (= .cse450 (select |c_#memory_$Pointer$.base| (select .cse450 (+ (select .cse451 0) 4)))) (= .cse447 |c_ULTIMATE.start_main_~item~0#1.base|) (not (= .cse445 0)) (= (select |c_#memory_$Pointer$.offset| .cse445) .cse451))))))))) (and .cse0 .cse36 .cse33 (exists ((v_prenex_205 Int) (v_prenex_61 Int) (v_prenex_206 Int)) (let ((.cse457 (select |c_#memory_$Pointer$.offset| v_prenex_61))) (let ((.cse453 (select (select |c_#memory_$Pointer$.offset| v_prenex_205) 0)) (.cse455 (select .cse457 0)) (.cse456 (select (select |c_#memory_$Pointer$.base| v_prenex_206) 0)) (.cse454 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0))) (and (not (= (+ .cse453 4) 0)) (not (= .cse454 |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= .cse454 v_prenex_61)) (not (= .cse455 .cse453)) (not (= .cse453 0)) (not (= .cse455 0)) (= (select |c_#memory_$Pointer$.offset| .cse456) .cse457) (not (= .cse456 .cse454)) (not (= .cse454 v_prenex_206))))))) (and (or (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int)) (let ((.cse462 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0)) (.cse460 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (and (exists ((v_prenex_61 Int)) (let ((.cse461 (select |c_#memory_$Pointer$.base| v_prenex_61))) (let ((.cse458 (select .cse461 (+ .cse462 4))) (.cse459 (select .cse461 0))) (and (= (select (select |c_#memory_$Pointer$.base| .cse458) 0) 0) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse459)) (not (= .cse460 .cse458)) (= (select (select |c_#memory_$Pointer$.offset| .cse458) 0) 0) (= (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| .cse459) (+ (select (select |c_#memory_$Pointer$.offset| v_prenex_61) 0) 4))) .cse461) (= .cse458 |c_ULTIMATE.start_main_~item~0#1.base|) (not (= .cse460 v_prenex_61)) (not (= .cse459 .cse460)))))) (= .cse462 0) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse460)) (not (= .cse460 0))))) (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int)) (let ((.cse467 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0)) (.cse465 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (and (exists ((v_prenex_61 Int)) (let ((.cse466 (select |c_#memory_$Pointer$.base| v_prenex_61))) (let ((.cse463 (select .cse466 (+ .cse467 4))) (.cse464 (select .cse466 0))) (and (= (select (select |c_#memory_$Pointer$.base| .cse463) 0) 0) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse464)) (not (= .cse465 .cse463)) (= (select (select |c_#memory_$Pointer$.offset| .cse463) 0) 0) (= .cse463 |c_ULTIMATE.start_main_~item~0#1.base|) (not (= .cse465 v_prenex_61)) (not (= .cse464 .cse465)) (= .cse465 (select (select |c_#memory_$Pointer$.base| .cse464) (+ (select (select |c_#memory_$Pointer$.offset| v_prenex_61) 0) 4))))))) (= .cse467 0) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse465)) (not (= .cse465 0)))))) .cse33) (exists ((v_prenex_61 Int)) (let ((.cse468 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0))) (and (not (= .cse468 v_prenex_61)) (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int)) (let ((.cse469 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0)) (.cse473 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (let ((.cse475 (select |c_#memory_$Pointer$.offset| v_prenex_61)) (.cse476 (+ .cse473 4)) (.cse474 (select |c_#memory_$Pointer$.base| .cse469))) (let ((.cse470 (select .cse474 0)) (.cse472 (select .cse475 .cse476)) (.cse471 (select .cse474 .cse476))) (and (not (= .cse469 .cse470)) (not (= .cse468 .cse471)) (= (select (select |c_#memory_$Pointer$.base| .cse471) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse471) 0) 0) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse470)) (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse472) (= .cse473 0) (= .cse472 0) (= .cse468 .cse469) (= .cse474 (select |c_#memory_$Pointer$.base| (select .cse474 (+ (select .cse475 0) 4)))) (= .cse471 |c_ULTIMATE.start_main_~item~0#1.base|) (not (= .cse469 0)))))))))) (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int) (v_prenex_61 Int)) (let ((.cse485 (select |c_#memory_$Pointer$.offset| v_prenex_61))) (let ((.cse483 (select .cse485 0)) (.cse478 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0))) (let ((.cse477 (select |c_#memory_$Pointer$.base| .cse478)) (.cse486 (+ .cse483 4))) (let ((.cse481 (select .cse477 .cse486))) (let ((.cse479 (select .cse477 0)) (.cse482 (select |c_#memory_$Pointer$.base| .cse481)) (.cse480 (select .cse485 .cse486)) (.cse484 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (and (= (select .cse477 4) 0) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse478)) (not (= .cse479 v_prenex_61)) (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse480) (not (= .cse478 .cse481)) (not (= .cse479 .cse478)) (= (select .cse482 0) 0) (= .cse481 |c_ULTIMATE.start_main_~item~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| .cse481) 0) 0) (not (= .cse483 0)) (= .cse482 (select |c_#memory_$Pointer$.base| .cse484)) (= .cse480 0) (= (select |c_#memory_$Pointer$.offset| .cse484) .cse485)))))))) (and .cse0 .cse36 (or (and .cse487 .cse33) (and .cse33 (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int) (v_prenex_61 Int)) (let ((.cse488 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0)) (.cse489 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (and (not (= .cse488 |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= .cse488 v_prenex_61)) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse488)) (= (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0) 0) (= .cse488 .cse489) (not (= .cse489 0)))))) (and .cse224 .cse33) (and .cse33 (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int) (v_prenex_61 Int)) (let ((.cse490 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0)) (.cse491 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (and (not (= .cse490 |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= .cse490 v_prenex_61)) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse490)) (= (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0) 0) (= .cse490 .cse491) (not (= .cse491 0)) (not (= (+ (select (select |c_#memory_$Pointer$.offset| v_prenex_61) 0) 4) 0)))))))) (and .cse33 (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int) (v_prenex_61 Int)) (let ((.cse497 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (let ((.cse495 (select (select |c_#memory_$Pointer$.offset| v_prenex_61) 0)) (.cse496 (select |c_#memory_$Pointer$.base| .cse497))) (let ((.cse494 (select .cse496 0)) (.cse493 (select .cse496 (+ .cse495 4))) (.cse492 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0))) (and (not (= .cse492 .cse493)) (not (= .cse492 v_prenex_61)) (not (= v_prenex_61 .cse494)) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse492)) (not (= .cse492 .cse494)) (= .cse494 0) (not (= .cse495 0)) (= (select .cse496 4) 0) (= .cse496 (select |c_#memory_$Pointer$.base| .cse493)) (= .cse493 |c_ULTIMATE.start_main_~item~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| .cse493) 0) 0) (not (= .cse492 .cse497)))))))) (and .cse0 .cse36 (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int) (v_prenex_61 Int)) (let ((.cse501 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0)) (.cse500 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (let ((.cse498 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0)) (.cse502 (select (select |c_#memory_$Pointer$.offset| .cse501) (+ .cse500 4))) (.cse499 (select (select |c_#memory_$Pointer$.offset| v_prenex_61) 0))) (and (not (= .cse498 |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= .cse498 v_prenex_61)) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse498)) (not (= .cse499 .cse500)) (= .cse500 0) (= .cse498 .cse501) (= .cse502 0) (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse502) (not (= .cse501 0)) (not (= (+ .cse499 4) 0))))))) (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int) (v_prenex_61 Int)) (let ((.cse507 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (let ((.cse505 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0)) (.cse509 (+ .cse507 4)) (.cse506 (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0)))) (let ((.cse504 (select .cse506 0)) (.cse503 (select .cse506 .cse509)) (.cse508 (select (select |c_#memory_$Pointer$.offset| .cse505) .cse509))) (and (= (select (select |c_#memory_$Pointer$.offset| .cse503) 0) 0) (not (= .cse504 .cse505)) (= (select (select |c_#memory_$Pointer$.base| .cse503) 0) 0) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse504)) (not (= .cse505 (select .cse506 (+ (select (select |c_#memory_$Pointer$.offset| v_prenex_61) 0) 4)))) (= .cse507 0) (= .cse503 |c_ULTIMATE.start_main_~item~0#1.base|) (not (= .cse503 .cse505)) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse505)) (= .cse508 0) (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse508) (not (= .cse505 0)) (not (= .cse505 v_prenex_61))))))) (and .cse510 .cse31 .cse33 .cse34 .cse21) (and .cse0 .cse36 (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int) (v_prenex_61 Int)) (let ((.cse513 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0)) (.cse516 (select |c_#memory_$Pointer$.offset| v_prenex_61)) (.cse514 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (let ((.cse511 (select .cse516 (+ .cse514 4))) (.cse515 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0)) (.cse512 (select (select |c_#memory_$Pointer$.base| .cse513) (+ (select .cse516 0) 4)))) (and (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse511) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse512)) (not (= .cse513 .cse512)) (= .cse514 0) (= .cse511 0) (not (= v_prenex_61 .cse512)) (not (= .cse515 0)) (not (= .cse512 |c_ULTIMATE.start_main_~item~0#1.base|)) (= .cse515 .cse512)))))) (and .cse0 .cse36 .cse33 (exists ((v_prenex_205 Int) (v_prenex_61 Int) (v_prenex_206 Int)) (let ((.cse521 (select |c_#memory_$Pointer$.offset| v_prenex_61))) (let ((.cse517 (select (select |c_#memory_$Pointer$.offset| v_prenex_205) 0)) (.cse519 (select .cse521 0)) (.cse520 (select (select |c_#memory_$Pointer$.base| v_prenex_206) 0)) (.cse518 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0))) (and (not (= (+ .cse517 4) 0)) (not (= .cse518 |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= .cse518 v_prenex_61)) (not (= .cse519 .cse517)) (not (= .cse519 0)) (= (select |c_#memory_$Pointer$.offset| .cse520) .cse521) (not (= .cse520 .cse518)) (not (= .cse518 v_prenex_206))))))) (and .cse522 .cse31 .cse34 .cse21) (and .cse0 .cse36 (exists ((v_prenex_205 Int) (|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int) (v_prenex_61 Int)) (let ((.cse526 (select (select |c_#memory_$Pointer$.offset| v_prenex_61) 0))) (let ((.cse527 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0)) (.cse528 (+ .cse526 4))) (let ((.cse523 (select (select |c_#memory_$Pointer$.offset| v_prenex_205) 0)) (.cse525 (select (select |c_#memory_$Pointer$.offset| .cse527) .cse528)) (.cse524 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0))) (and (not (= (+ .cse523 4) 0)) (not (= .cse524 |c_ULTIMATE.start_main_~item~0#1.base|)) (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse525) (not (= .cse524 v_prenex_61)) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse524)) (not (= .cse526 .cse523)) (not (= .cse527 |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= .cse526 0)) (= .cse525 0) (not (= .cse527 v_prenex_61)) (not (= .cse528 0)) (not (= .cse524 .cse527)))))))) (and .cse529 .cse31 .cse34 .cse21) (exists ((v_prenex_61 Int)) (let ((.cse537 (select |c_#memory_$Pointer$.offset| v_prenex_61))) (let ((.cse538 (select .cse537 0)) (.cse534 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0))) (let ((.cse530 (select |c_#memory_$Pointer$.base| .cse534)) (.cse539 (+ .cse538 4))) (let ((.cse535 (select .cse530 .cse539))) (let ((.cse531 (select .cse530 0)) (.cse533 (select |c_#memory_$Pointer$.base| .cse535)) (.cse532 (select .cse537 .cse539))) (and (= (select .cse530 4) 0) (not (= .cse531 v_prenex_61)) (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse532) (= .cse533 .cse530) (not (= .cse534 .cse535)) (not (= .cse531 .cse534)) (= (select .cse533 0) 0) (= .cse535 |c_ULTIMATE.start_main_~item~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| .cse535) 0) 0) (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int)) (let ((.cse536 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (and (= .cse534 .cse536) (= (select |c_#memory_$Pointer$.offset| .cse536) .cse537)))) (not (= .cse538 0)) (= .cse532 0)))))))) (and (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int) (v_prenex_61 Int)) (let ((.cse540 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (let ((.cse544 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0)) (.cse545 (select |c_#memory_$Pointer$.base| .cse540))) (let ((.cse541 (select .cse545 0)) (.cse542 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0)) (.cse543 (select .cse545 (+ .cse544 4)))) (and (not (= .cse540 .cse541)) (not (= .cse542 .cse543)) (= (select (select |c_#memory_$Pointer$.base| .cse543) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse543) 0) 0) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse541)) (= .cse544 0) (not (= .cse540 (select .cse545 (+ (select (select |c_#memory_$Pointer$.offset| v_prenex_61) 0) 4)))) (= .cse542 .cse540) (= .cse543 |c_ULTIMATE.start_main_~item~0#1.base|) (not (= .cse540 0))))))) .cse33) (and (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int) (v_prenex_573 Int) (v_DerPreprocessor_3 Int)) (let ((.cse546 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0)) (.cse550 (select |c_#memory_$Pointer$.base| v_DerPreprocessor_3))) (let ((.cse549 (select .cse550 0)) (.cse548 (select .cse550 (+ .cse546 4))) (.cse547 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (and (not (= (select (select |c_#memory_$Pointer$.offset| v_prenex_573) 0) .cse546)) (not (= .cse547 .cse548)) (= (select (select |c_#memory_$Pointer$.base| .cse549) .cse199) v_DerPreprocessor_3) (not (= .cse547 .cse549)) (= 0 (select (select |c_#memory_$Pointer$.base| .cse548) 0)) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse549)) (= .cse546 0) (= (select (select |c_#memory_$Pointer$.offset| .cse548) 0) 0) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse547)) (= .cse548 |c_ULTIMATE.start_main_~item~0#1.base|) (not (= .cse547 0)))))) .cse33) (and .cse0 (exists ((v_arrayElimCell_917 Int) (v_arrayElimCell_919 Int) (v_prenex_573 Int) (|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int)) (let ((.cse552 (select (select |c_#memory_$Pointer$.base| v_prenex_573) 0)) (.cse551 (select (select |c_#memory_$Pointer$.offset| v_prenex_573) 0))) (and (not (= .cse551 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (not (= .cse552 |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= v_arrayElimCell_917 .cse552)) (not (= v_arrayElimCell_917 v_prenex_573)) (not (= v_prenex_573 .cse552)) (= (select (select |c_#memory_$Pointer$.base| v_arrayElimCell_917) (+ v_arrayElimCell_919 4)) .cse552) (not (= .cse552 0)) (= .cse551 0)))) .cse36 .cse33) (and .cse0 .cse36 .cse33 (exists ((v_arrayElimCell_917 Int) (v_prenex_573 Int) (|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int)) (let ((.cse555 (select (select |c_#memory_$Pointer$.base| v_prenex_573) 0)) (.cse553 (select (select |c_#memory_$Pointer$.offset| v_prenex_573) 0)) (.cse554 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (and (not (= .cse553 .cse554)) (not (= .cse555 |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= v_arrayElimCell_917 .cse555)) (not (= v_arrayElimCell_917 v_prenex_573)) (not (= v_prenex_573 .cse555)) (= (select (select |c_#memory_$Pointer$.base| v_arrayElimCell_917) .cse199) .cse555) (not (= .cse555 0)) (= .cse553 0) (not (= (+ .cse554 4) 0)))))) (and (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int) (v_prenex_61 Int)) (let ((.cse558 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0)) (.cse562 (select |c_#memory_$Pointer$.offset| v_prenex_61))) (let ((.cse560 (select .cse562 0)) (.cse556 (select |c_#memory_$Pointer$.base| .cse558))) (let ((.cse557 (select .cse556 0)) (.cse559 (select .cse556 (+ .cse560 4))) (.cse561 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (and (= (select .cse556 4) 0) (not (= .cse557 v_prenex_61)) (not (= .cse558 .cse559)) (not (= .cse557 .cse558)) (= (select (select |c_#memory_$Pointer$.base| .cse559) 0) 0) (= .cse559 |c_ULTIMATE.start_main_~item~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| .cse559) 0) 0) (not (= .cse560 0)) (not (= .cse558 .cse561)) (= (select |c_#memory_$Pointer$.offset| .cse561) .cse562)))))) .cse33) (and .cse0 (or (exists ((v_prenex_202 Int)) (let ((.cse563 (select (select |c_#memory_$Pointer$.base| v_prenex_202) 0))) (and (exists ((v_prenex_61 Int)) (let ((.cse564 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0)) (.cse565 (select (select |c_#memory_$Pointer$.offset| v_prenex_61) 0))) (and (not (= v_prenex_61 0)) (= .cse563 .cse564) (not (= .cse564 v_prenex_202)) (not (= .cse564 v_prenex_61)) (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int)) (not (= .cse565 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0)))) (not (= .cse565 0)) (not (= .cse564 0)) (not (= (+ .cse565 4) 0))))) (not (= .cse563 |c_ULTIMATE.start_main_~item~0#1.base|))))) (exists ((v_prenex_202 Int)) (let ((.cse566 (select (select |c_#memory_$Pointer$.base| v_prenex_202) 0))) (and (exists ((v_prenex_61 Int)) (let ((.cse567 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0)) (.cse568 (select (select |c_#memory_$Pointer$.offset| v_prenex_61) 0))) (and (= .cse566 .cse567) (not (= .cse567 v_prenex_202)) (not (= .cse567 v_prenex_61)) (not (= .cse568 0)) (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int)) (let ((.cse569 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (and (not (= .cse568 .cse569)) (not (= .cse569 0)))))))) (not (= .cse566 |c_ULTIMATE.start_main_~item~0#1.base|))))) (exists ((v_prenex_202 Int)) (let ((.cse570 (select (select |c_#memory_$Pointer$.base| v_prenex_202) 0))) (and (exists ((v_prenex_61 Int)) (let ((.cse571 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0)) (.cse572 (select (select |c_#memory_$Pointer$.offset| v_prenex_61) 0))) (and (= .cse570 .cse571) (not (= .cse571 v_prenex_202)) (not (= .cse571 v_prenex_61)) (not (= .cse572 0)) (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int)) (let ((.cse573 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (and (not (= .cse572 .cse573)) (not (= .cse573 0))))) (not (= (+ .cse572 4) 0))))) (not (= .cse570 |c_ULTIMATE.start_main_~item~0#1.base|))))) (and (exists ((v_prenex_202 Int) (|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int) (v_prenex_61 Int)) (let ((.cse575 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0)) (.cse576 (select (select |c_#memory_$Pointer$.offset| v_prenex_61) 0)) (.cse574 (select (select |c_#memory_$Pointer$.base| v_prenex_202) 0))) (and (= .cse574 .cse575) (not (= .cse575 v_prenex_202)) (not (= .cse575 v_prenex_61)) (not (= .cse576 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (not (= .cse576 0)) (not (= .cse574 |c_ULTIMATE.start_main_~item~0#1.base|))))) .cse21)) .cse36 .cse33) (and (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int) (v_DerPreprocessor_1 Int) (v_prenex_61 Int)) (let ((.cse581 (select (select |c_#memory_$Pointer$.offset| v_prenex_61) 0)) (.cse580 (select |c_#memory_$Pointer$.base| v_DerPreprocessor_1))) (let ((.cse578 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0)) (.cse579 (select .cse580 0)) (.cse577 (select .cse580 (+ .cse581 4)))) (and (= (select (select |c_#memory_$Pointer$.offset| .cse577) 0) 0) (not (= .cse578 v_prenex_61)) (= .cse579 0) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse578)) (= .cse577 |c_ULTIMATE.start_main_~item~0#1.base|) (not (= .cse578 .cse577)) (not (= .cse578 .cse579)) (= (select .cse580 4) 0) (not (= .cse581 0)) (= .cse578 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0)) (not (= v_prenex_61 .cse579)) (= .cse577 v_DerPreprocessor_1))))) .cse33) (and .cse0 .cse36 .cse33 .cse38) (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int) (v_prenex_61 Int)) (let ((.cse588 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0)) (.cse585 (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0))) (.cse590 (select |c_#memory_$Pointer$.offset| v_prenex_61))) (let ((.cse584 (select |c_#memory_$Pointer$.base| (select .cse585 (+ (select .cse590 0) 4)))) (.cse589 (+ .cse588 4))) (let ((.cse586 (select .cse590 .cse589)) (.cse582 (select .cse584 0)) (.cse587 (select .cse584 .cse589)) (.cse583 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (and (not (= .cse582 .cse583)) (= .cse584 .cse585) (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse586) (= 0 (select (select |c_#memory_$Pointer$.offset| .cse587) 0)) (= .cse588 0) (= (select .cse585 .cse589) |c_ULTIMATE.start_main_~item~0#1.base|) (= .cse586 0) (= .cse584 (select |c_#memory_$Pointer$.base| .cse583)) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse582)) (not (= .cse583 .cse587)) (not (= .cse583 0)) (not (= .cse583 v_prenex_61)) (= (select (select |c_#memory_$Pointer$.base| .cse587) 0) 0) (= (select |c_#memory_$Pointer$.offset| .cse583) .cse590)))))) (and .cse0 .cse36 (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int) (v_prenex_61 Int)) (let ((.cse596 (select |c_#memory_$Pointer$.offset| v_prenex_61)) (.cse594 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (let ((.cse592 (select .cse596 (+ .cse594 4))) (.cse591 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0)) (.cse595 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0)) (.cse593 (select .cse596 0))) (and (not (= .cse591 |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= .cse591 v_prenex_61)) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse591)) (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse592) (not (= .cse593 .cse594)) (= .cse594 0) (= .cse592 0) (= .cse591 .cse595) (not (= .cse595 0)) (not (= (+ .cse593 4) 0))))))) (and .cse0 .cse36 .cse33 (exists ((v_arrayElimCell_924 Int) (|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int) (v_arrayElimCell_898 Int)) (let ((.cse597 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (and (not (= .cse597 v_arrayElimCell_898)) (not (= (select (select |c_#memory_$Pointer$.base| v_arrayElimCell_898) (+ v_arrayElimCell_924 4)) .cse597)) (not (= .cse597 |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| v_arrayElimCell_898)) (= (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0) 0) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse597)) (not (= .cse597 0)))))) (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int) (v_prenex_61 Int)) (let ((.cse605 (select |c_#memory_$Pointer$.offset| v_prenex_61))) (let ((.cse603 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0)) (.cse604 (select .cse605 0))) (let ((.cse606 (+ .cse604 4)) (.cse598 (select |c_#memory_$Pointer$.base| .cse603))) (let ((.cse599 (select .cse598 0)) (.cse602 (select .cse598 .cse606)) (.cse600 (select .cse605 .cse606)) (.cse601 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (and (= (select .cse598 4) 0) (not (= .cse599 v_prenex_61)) (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse600) (not (= .cse601 .cse602)) (not (= .cse599 .cse603)) (= (select (select |c_#memory_$Pointer$.base| .cse602) 0) 0) (= .cse602 |c_ULTIMATE.start_main_~item~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| .cse602) 0) 0) (not (= .cse604 0)) (= .cse600 0) (= .cse603 .cse601))))))) (and .cse0 (exists ((v_prenex_205 Int) (|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int) (v_prenex_61 Int)) (let ((.cse609 (select (select |c_#memory_$Pointer$.offset| v_prenex_61) 0))) (let ((.cse611 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0)) (.cse612 (+ .cse609 4))) (let ((.cse610 (select (select |c_#memory_$Pointer$.offset| v_prenex_205) 0)) (.cse608 (select (select |c_#memory_$Pointer$.offset| .cse611) .cse612)) (.cse607 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0))) (and (not (= .cse607 |c_ULTIMATE.start_main_~item~0#1.base|)) (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse608) (not (= .cse607 v_prenex_61)) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse607)) (not (= .cse609 .cse610)) (not (= .cse611 |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= .cse610 0)) (not (= .cse609 0)) (= .cse608 0) (not (= .cse611 v_prenex_61)) (not (= .cse612 0)) (not (= .cse607 .cse611))))))) .cse36) (and .cse0 .cse36 (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int) (v_prenex_61 Int)) (let ((.cse618 (select |c_#memory_$Pointer$.offset| v_prenex_61)) (.cse616 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (let ((.cse614 (select .cse618 (+ .cse616 4))) (.cse613 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0)) (.cse615 (select .cse618 0)) (.cse617 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (and (not (= .cse613 v_prenex_61)) (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse614) (not (= .cse615 .cse616)) (= .cse616 0) (= .cse614 0) (= .cse613 .cse617) (not (= .cse617 0)) (not (= (+ .cse615 4) 0)) (= (select |c_#memory_$Pointer$.offset| .cse617) .cse618)))))) (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int) (v_prenex_61 Int)) (let ((.cse625 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0)) (.cse622 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (let ((.cse620 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0)) (.cse626 (+ .cse622 4)) (.cse623 (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| .cse625) (+ (select (select |c_#memory_$Pointer$.offset| v_prenex_61) 0) 4))))) (let ((.cse619 (select .cse623 0)) (.cse624 (select (select |c_#memory_$Pointer$.offset| .cse620) .cse626)) (.cse621 (select .cse623 .cse626))) (and (not (= .cse619 .cse620)) (= .cse621 |c_ULTIMATE.start_main_~item~0#1.base|) (= 0 (select (select |c_#memory_$Pointer$.offset| .cse621) 0)) (= .cse622 0) (= .cse623 (select |c_#memory_$Pointer$.base| .cse620)) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse619)) (= .cse624 0) (not (= .cse620 .cse621)) (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse624) (not (= .cse620 0)) (not (= .cse620 v_prenex_61)) (not (= .cse625 .cse620)) (= (select (select |c_#memory_$Pointer$.base| .cse621) 0) 0)))))) (and .cse0 (or (and (exists ((v_prenex_202 Int) (|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int) (v_prenex_61 Int)) (let ((.cse627 (select (select |c_#memory_$Pointer$.base| v_prenex_202) 0)) (.cse630 (select (select |c_#memory_$Pointer$.offset| v_prenex_61) 0))) (let ((.cse628 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0)) (.cse629 (select (select |c_#memory_$Pointer$.offset| .cse627) (+ .cse630 4)))) (and (= .cse627 .cse628) (not (= .cse628 v_prenex_202)) (not (= .cse628 v_prenex_61)) (= .cse629 0) (not (= .cse630 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse629) (not (= .cse630 0)) (not (= .cse627 |c_ULTIMATE.start_main_~item~0#1.base|)))))) .cse21) (exists ((v_prenex_202 Int)) (let ((.cse631 (select (select |c_#memory_$Pointer$.base| v_prenex_202) 0))) (and (exists ((v_prenex_61 Int)) (let ((.cse634 (select (select |c_#memory_$Pointer$.offset| v_prenex_61) 0))) (let ((.cse636 (+ .cse634 4))) (let ((.cse632 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0)) (.cse633 (select (select |c_#memory_$Pointer$.offset| .cse631) .cse636))) (and (= .cse631 .cse632) (not (= .cse632 v_prenex_202)) (not (= .cse632 v_prenex_61)) (= .cse633 0) (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse633) (not (= .cse634 0)) (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int)) (let ((.cse635 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (and (not (= .cse634 .cse635)) (not (= .cse635 0))))) (not (= .cse636 0))))))) (not (= .cse631 |c_ULTIMATE.start_main_~item~0#1.base|))))) (exists ((v_prenex_202 Int)) (let ((.cse637 (select (select |c_#memory_$Pointer$.base| v_prenex_202) 0))) (and (exists ((v_prenex_61 Int)) (let ((.cse640 (select (select |c_#memory_$Pointer$.offset| v_prenex_61) 0))) (let ((.cse641 (+ .cse640 4))) (let ((.cse639 (select (select |c_#memory_$Pointer$.offset| .cse637) .cse641)) (.cse638 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0))) (and (not (= v_prenex_61 0)) (= .cse637 .cse638) (not (= .cse638 v_prenex_202)) (not (= .cse638 v_prenex_61)) (= .cse639 0) (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int)) (not (= .cse640 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0)))) (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse639) (not (= .cse640 0)) (not (= .cse638 0)) (not (= .cse641 0))))))) (not (= .cse637 |c_ULTIMATE.start_main_~item~0#1.base|))))) (exists ((v_prenex_202 Int)) (let ((.cse642 (select (select |c_#memory_$Pointer$.base| v_prenex_202) 0))) (and (exists ((v_prenex_61 Int)) (let ((.cse645 (select (select |c_#memory_$Pointer$.offset| v_prenex_61) 0))) (let ((.cse643 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0)) (.cse644 (select (select |c_#memory_$Pointer$.offset| .cse642) (+ .cse645 4)))) (and (= .cse642 .cse643) (not (= .cse643 v_prenex_202)) (not (= .cse643 v_prenex_61)) (= .cse644 0) (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse644) (not (= .cse645 0)) (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int)) (let ((.cse646 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (and (not (= .cse645 .cse646)) (not (= .cse646 0))))))))) (not (= .cse642 |c_ULTIMATE.start_main_~item~0#1.base|)))))) .cse36) (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int) (v_prenex_61 Int)) (let ((.cse647 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0)) (.cse653 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (let ((.cse652 (select |c_#memory_$Pointer$.offset| v_prenex_61)) (.cse655 (+ .cse653 4)) (.cse654 (select |c_#memory_$Pointer$.base| .cse647))) (let ((.cse648 (select .cse654 0)) (.cse650 (select .cse652 .cse655)) (.cse649 (select .cse654 .cse655)) (.cse651 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0))) (and (not (= .cse647 .cse648)) (= (select (select |c_#memory_$Pointer$.base| .cse649) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse649) 0) 0) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse648)) (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse650) (not (= .cse647 .cse649)) (not (= .cse647 (select (select |c_#memory_$Pointer$.base| .cse651) (+ (select .cse652 0) 4)))) (= .cse653 0) (= .cse650 0) (= .cse649 |c_ULTIMATE.start_main_~item~0#1.base|) (not (= .cse647 0)) (not (= .cse647 v_prenex_61)) (not (= .cse651 .cse647)) (= (select |c_#memory_$Pointer$.offset| .cse647) .cse652)))))) (and .cse0 (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int) (v_prenex_61 Int)) (let ((.cse657 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0))) (let ((.cse658 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0)) (.cse656 (select (select |c_#memory_$Pointer$.base| .cse657) (+ (select (select |c_#memory_$Pointer$.offset| v_prenex_61) 0) 4)))) (and (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse656)) (not (= .cse657 .cse656)) (= (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0) 0) (not (= .cse658 0)) (not (= .cse658 v_prenex_61)) (not (= .cse656 |c_ULTIMATE.start_main_~item~0#1.base|)) (= .cse658 .cse656))))) .cse36 .cse33) (and .cse510 .cse30 .cse31 .cse33 .cse34 .cse21) (and .cse0 (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int) (v_prenex_61 Int)) (let ((.cse660 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0)) (.cse661 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (let ((.cse659 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0)) (.cse662 (select (select |c_#memory_$Pointer$.offset| .cse660) (+ .cse661 4)))) (and (not (= .cse659 v_prenex_61)) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse659)) (not (= .cse660 |c_ULTIMATE.start_main_~item~0#1.base|)) (= .cse661 0) (= .cse659 .cse660) (= .cse662 0) (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse662) (not (= .cse660 0)))))) .cse36) (exists ((v_prenex_61 Int)) (let ((.cse663 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0))) (and (not (= .cse663 v_prenex_61)) (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int) (v_DerPreprocessor_2 Int)) (let ((.cse667 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (let ((.cse665 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0)) (.cse670 (+ .cse667 4)) (.cse669 (select |c_#memory_$Pointer$.base| v_DerPreprocessor_2))) (let ((.cse666 (select .cse669 0)) (.cse664 (select .cse669 .cse670)) (.cse668 (select (select |c_#memory_$Pointer$.offset| .cse665) .cse670))) (and (= (select (select |c_#memory_$Pointer$.base| .cse664) 0) 0) (not (= .cse665 .cse666)) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse663)) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse666)) (not (= .cse663 .cse664)) (= .cse667 0) (= (select (select |c_#memory_$Pointer$.offset| .cse664) 0) 0) (= .cse663 .cse665) (= .cse668 0) (= .cse664 |c_ULTIMATE.start_main_~item~0#1.base|) (= (select .cse669 (+ (select (select |c_#memory_$Pointer$.offset| v_prenex_61) 0) 4)) v_DerPreprocessor_2) (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse668) (not (= .cse665 0)))))))))) (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int) (v_prenex_61 Int)) (let ((.cse674 (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0))) (.cse676 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (let ((.cse672 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0)) (.cse677 (+ .cse676 4)) (.cse673 (select |c_#memory_$Pointer$.base| (select .cse674 (+ (select (select |c_#memory_$Pointer$.offset| v_prenex_61) 0) 4))))) (let ((.cse671 (select .cse673 0)) (.cse678 (select (select |c_#memory_$Pointer$.offset| .cse672) .cse677)) (.cse675 (select .cse673 .cse677))) (and (not (= .cse671 .cse672)) (= .cse673 .cse674) (= 0 (select (select |c_#memory_$Pointer$.offset| .cse675) 0)) (= .cse676 0) (= (select .cse674 .cse677) |c_ULTIMATE.start_main_~item~0#1.base|) (= .cse673 (select |c_#memory_$Pointer$.base| .cse672)) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse671)) (= .cse678 0) (not (= .cse672 .cse675)) (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse678) (not (= .cse672 0)) (not (= .cse672 v_prenex_61)) (= (select (select |c_#memory_$Pointer$.base| .cse675) 0) 0)))))) (and .cse0 .cse443 .cse36 .cse357) (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int)) (let ((.cse679 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0)) (.cse683 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (and (= .cse679 0) (exists ((v_prenex_61 Int)) (let ((.cse685 (select |c_#memory_$Pointer$.base| v_prenex_61)) (.cse684 (select |c_#memory_$Pointer$.offset| v_prenex_61)) (.cse686 (+ .cse679 4))) (let ((.cse682 (select .cse684 .cse686)) (.cse680 (select .cse685 .cse686)) (.cse681 (select .cse685 0))) (and (= (select (select |c_#memory_$Pointer$.base| .cse680) 0) 0) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse681)) (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse682) (not (= .cse683 .cse680)) (= .cse682 0) (= (select (select |c_#memory_$Pointer$.offset| .cse680) 0) 0) (= .cse680 |c_ULTIMATE.start_main_~item~0#1.base|) (not (= .cse681 .cse683)) (= .cse683 (select (select |c_#memory_$Pointer$.base| .cse681) (+ (select .cse684 0) 4))))))) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse683)) (not (= .cse683 0))))) (and .cse0 (exists ((v_prenex_205 Int) (v_prenex_61 Int) (v_prenex_206 Int)) (let ((.cse687 (select (select |c_#memory_$Pointer$.offset| v_prenex_205) 0)) (.cse689 (select (select |c_#memory_$Pointer$.base| v_prenex_206) 0)) (.cse688 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0)) (.cse690 (select (select |c_#memory_$Pointer$.offset| v_prenex_61) 0))) (and (not (= (+ .cse687 4) 0)) (not (= .cse688 |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= .cse689 v_prenex_61)) (not (= .cse688 v_prenex_61)) (not (= .cse690 .cse687)) (not (= .cse689 |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= .cse687 0)) (not (= .cse690 0)) (not (= .cse689 .cse688)) (not (= .cse688 v_prenex_206)) (not (= (+ .cse690 4) 0))))) .cse36 .cse33) (and (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int) (v_prenex_61 Int)) (let ((.cse693 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0))) (let ((.cse691 (select |c_#memory_$Pointer$.base| .cse693)) (.cse696 (select (select |c_#memory_$Pointer$.offset| v_prenex_61) 0))) (let ((.cse694 (select .cse691 (+ .cse696 4)))) (let ((.cse692 (select .cse691 0)) (.cse695 (select |c_#memory_$Pointer$.base| .cse694)) (.cse697 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (and (= (select .cse691 4) 0) (not (= .cse692 v_prenex_61)) (not (= .cse693 .cse694)) (not (= .cse692 .cse693)) (= (select .cse695 0) 0) (= .cse694 |c_ULTIMATE.start_main_~item~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| .cse694) 0) 0) (not (= .cse696 0)) (= .cse695 (select |c_#memory_$Pointer$.base| .cse697)) (not (= .cse697 v_prenex_61)) (not (= .cse693 .cse697)))))))) .cse33) (exists ((v_prenex_61 Int)) (let ((.cse698 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0))) (and (not (= .cse698 v_prenex_61)) (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int)) (let ((.cse699 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0)) (.cse703 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (let ((.cse705 (select |c_#memory_$Pointer$.offset| v_prenex_61)) (.cse706 (+ .cse703 4)) (.cse704 (select |c_#memory_$Pointer$.base| .cse699))) (let ((.cse700 (select .cse704 0)) (.cse702 (select .cse705 .cse706)) (.cse701 (select .cse704 .cse706))) (and (not (= .cse699 .cse700)) (not (= .cse698 .cse701)) (= (select (select |c_#memory_$Pointer$.base| .cse701) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse701) 0) 0) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse700)) (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse702) (= .cse703 0) (not (= .cse699 (select .cse704 (+ (select .cse705 0) 4)))) (= .cse702 0) (= .cse698 .cse699) (= .cse701 |c_ULTIMATE.start_main_~item~0#1.base|) (not (= .cse699 0)))))))))) (exists ((v_prenex_61 Int)) (let ((.cse707 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0))) (and (not (= .cse707 v_prenex_61)) (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int)) (let ((.cse708 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0)) (.cse711 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (let ((.cse714 (+ .cse711 4)) (.cse712 (select |c_#memory_$Pointer$.base| .cse708))) (let ((.cse709 (select .cse712 0)) (.cse710 (select .cse712 .cse714)) (.cse713 (select (select |c_#memory_$Pointer$.offset| .cse708) .cse714))) (and (not (= .cse708 .cse709)) (not (= .cse707 .cse710)) (= (select (select |c_#memory_$Pointer$.base| .cse710) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse710) 0) 0) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse709)) (= .cse711 0) (not (= .cse708 (select .cse712 (+ (select (select |c_#memory_$Pointer$.offset| v_prenex_61) 0) 4)))) (= .cse707 .cse708) (= .cse710 |c_ULTIMATE.start_main_~item~0#1.base|) (= .cse713 0) (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse713) (not (= .cse708 0)))))))))) (exists ((v_prenex_61 Int)) (let ((.cse720 (select |c_#memory_$Pointer$.offset| v_prenex_61))) (let ((.cse723 (select .cse720 0))) (let ((.cse721 (+ .cse723 4))) (let ((.cse715 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0)) (.cse722 (select .cse720 .cse721))) (and (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int)) (let ((.cse719 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (let ((.cse718 (select |c_#memory_$Pointer$.base| .cse719))) (let ((.cse717 (select .cse718 0)) (.cse716 (select .cse718 .cse721))) (and (not (= .cse715 .cse716)) (not (= v_prenex_61 .cse717)) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse715)) (not (= .cse715 .cse717)) (= (select (select |c_#memory_$Pointer$.base| .cse716) 0) 0) (= (select .cse718 4) 0) (= .cse716 |c_ULTIMATE.start_main_~item~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| .cse716) 0) 0) (= (select |c_#memory_$Pointer$.offset| .cse719) .cse720)))))) (not (= .cse715 v_prenex_61)) (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse722) (not (= .cse723 0)) (= .cse722 0))))))) (and .cse0 .cse36 (exists ((v_prenex_205 Int) (v_prenex_61 Int) (v_prenex_206 Int)) (let ((.cse728 (select |c_#memory_$Pointer$.offset| v_prenex_61))) (let ((.cse724 (select (select |c_#memory_$Pointer$.offset| v_prenex_205) 0)) (.cse727 (select (select |c_#memory_$Pointer$.base| v_prenex_206) 0)) (.cse725 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0)) (.cse726 (select .cse728 0))) (and (not (= (+ .cse724 4) 0)) (not (= .cse725 |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= .cse725 v_prenex_61)) (not (= .cse726 .cse724)) (not (= .cse724 0)) (not (= .cse726 0)) (= (select |c_#memory_$Pointer$.offset| .cse727) .cse728) (not (= .cse727 .cse725)) (not (= .cse725 v_prenex_206)) (not (= (+ .cse726 4) 0)))))) .cse33) (and .cse0 .cse36 (exists ((v_prenex_205 Int) (|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int) (v_prenex_61 Int)) (let ((.cse734 (select |c_#memory_$Pointer$.offset| v_prenex_61))) (let ((.cse732 (select .cse734 0))) (let ((.cse729 (select (select |c_#memory_$Pointer$.offset| v_prenex_205) 0)) (.cse731 (select .cse734 (+ .cse732 4))) (.cse730 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0)) (.cse733 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (and (not (= (+ .cse729 4) 0)) (not (= .cse730 |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= .cse730 v_prenex_61)) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse730)) (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse731) (not (= .cse732 .cse729)) (not (= .cse729 0)) (not (= .cse732 0)) (= .cse731 0) (not (= .cse730 .cse733)) (= (select |c_#memory_$Pointer$.offset| .cse733) .cse734))))))) (and (exists ((v_arrayElimCell_919 Int) (|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int) (v_DerPreprocessor_3 Int)) (let ((.cse738 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0)) (.cse739 (select |c_#memory_$Pointer$.base| v_DerPreprocessor_3))) (let ((.cse737 (select .cse739 0)) (.cse736 (select .cse739 (+ .cse738 4))) (.cse735 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (and (not (= .cse735 .cse736)) (not (= .cse735 .cse737)) (= 0 (select (select |c_#memory_$Pointer$.base| .cse736) 0)) (= v_DerPreprocessor_3 (select (select |c_#memory_$Pointer$.base| .cse737) (+ v_arrayElimCell_919 4))) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse737)) (= .cse738 0) (= (select (select |c_#memory_$Pointer$.offset| .cse736) 0) 0) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse735)) (= .cse736 |c_ULTIMATE.start_main_~item~0#1.base|) (not (= .cse735 0)))))) .cse396 .cse33) (and .cse0 .cse359 .cse36 .cse357) (and .cse0 .cse36 (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int) (v_prenex_61 Int)) (let ((.cse743 (select |c_#memory_$Pointer$.offset| v_prenex_61)) (.cse744 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (let ((.cse740 (select .cse743 (+ .cse744 4))) (.cse742 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0)) (.cse741 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (and (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse740) (not (= .cse741 |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= .cse741 (select (select |c_#memory_$Pointer$.base| .cse742) (+ (select .cse743 0) 4)))) (= .cse744 0) (= .cse740 0) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse741)) (not (= .cse741 0)) (not (= .cse741 v_prenex_61)) (not (= .cse742 .cse741))))))) (and .cse745 .cse117) (and .cse0 .cse36 (exists ((v_prenex_205 Int) (v_prenex_61 Int) (v_prenex_206 Int)) (let ((.cse746 (select (select |c_#memory_$Pointer$.offset| v_prenex_205) 0)) (.cse749 (select (select |c_#memory_$Pointer$.offset| v_prenex_61) 0)) (.cse748 (select (select |c_#memory_$Pointer$.base| v_prenex_206) 0)) (.cse747 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0))) (and (not (= (+ .cse746 4) 0)) (not (= .cse747 |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= .cse748 v_prenex_61)) (not (= .cse747 v_prenex_61)) (not (= .cse749 .cse746)) (not (= .cse748 |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= .cse746 0)) (not (= .cse749 0)) (not (= .cse748 .cse747)) (not (= .cse747 v_prenex_206))))) .cse33) (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int) (v_prenex_61 Int)) (let ((.cse755 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0)) (.cse753 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (let ((.cse751 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0)) (.cse757 (+ .cse753 4)) (.cse756 (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| .cse755) (+ (select (select |c_#memory_$Pointer$.offset| v_prenex_61) 0) 4))))) (let ((.cse750 (select .cse756 0)) (.cse754 (select (select |c_#memory_$Pointer$.offset| .cse751) .cse757)) (.cse752 (select .cse756 .cse757))) (and (not (= .cse750 .cse751)) (= .cse752 |c_ULTIMATE.start_main_~item~0#1.base|) (= 0 (select (select |c_#memory_$Pointer$.offset| .cse752) 0)) (= .cse753 0) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse750)) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse751)) (= .cse754 0) (not (= .cse751 .cse752)) (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse754) (not (= .cse751 0)) (not (= .cse751 v_prenex_61)) (not (= .cse755 .cse751)) (= (select (select |c_#memory_$Pointer$.base| .cse752) 0) 0)))))) (and .cse30 .cse31 .cse33 .cse758 .cse34 .cse21) (and .cse33 (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int) (v_prenex_61 Int)) (let ((.cse762 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (let ((.cse763 (select (select |c_#memory_$Pointer$.offset| v_prenex_61) 0)) (.cse764 (select |c_#memory_$Pointer$.base| .cse762))) (let ((.cse759 (select .cse764 0)) (.cse760 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0)) (.cse761 (select .cse764 (+ .cse763 4)))) (and (not (= v_prenex_61 .cse759)) (not (= .cse760 .cse759)) (= (select (select |c_#memory_$Pointer$.base| .cse761) 0) 0) (not (= .cse762 .cse761)) (not (= .cse763 0)) (= (select .cse764 4) 0) (= .cse760 .cse762) (= .cse761 |c_ULTIMATE.start_main_~item~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| .cse761) 0) 0))))))) (exists ((v_prenex_61 Int)) (let ((.cse773 (select |c_#memory_$Pointer$.offset| v_prenex_61))) (let ((.cse767 (select .cse773 0))) (let ((.cse772 (+ .cse767 4))) (let ((.cse766 (select .cse773 .cse772)) (.cse765 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0))) (and (not (= .cse765 v_prenex_61)) (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse766) (not (= .cse767 0)) (= .cse766 0) (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int)) (let ((.cse771 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (let ((.cse770 (select |c_#memory_$Pointer$.base| .cse771))) (let ((.cse769 (select .cse770 0)) (.cse768 (select .cse770 .cse772))) (and (not (= .cse765 .cse768)) (not (= v_prenex_61 .cse769)) (not (= .cse765 .cse769)) (= (select (select |c_#memory_$Pointer$.base| .cse768) 0) 0) (= (select .cse770 4) 0) (= .cse765 .cse771) (= .cse768 |c_ULTIMATE.start_main_~item~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| .cse768) 0) 0)))))))))))) (and .cse33 (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int) (v_prenex_61 Int)) (let ((.cse777 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0))) (let ((.cse774 (select |c_#memory_$Pointer$.base| .cse777)) (.cse779 (select (select |c_#memory_$Pointer$.offset| v_prenex_61) 0))) (let ((.cse778 (select .cse774 (+ .cse779 4)))) (let ((.cse775 (select .cse774 0)) (.cse776 (select |c_#memory_$Pointer$.base| .cse778))) (and (= (select .cse774 4) 0) (not (= .cse775 v_prenex_61)) (= .cse776 .cse774) (not (= .cse777 .cse778)) (not (= .cse775 .cse777)) (= (select .cse776 0) 0) (= .cse778 |c_ULTIMATE.start_main_~item~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| .cse778) 0) 0) (not (= .cse779 0)) (= .cse777 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))))))))) (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int) (v_prenex_61 Int)) (let ((.cse785 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0)) (.cse786 (select (select |c_#memory_$Pointer$.offset| v_prenex_61) 0))) (let ((.cse783 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0)) (.cse787 (+ .cse786 4)) (.cse780 (select |c_#memory_$Pointer$.base| .cse785))) (let ((.cse782 (select .cse780 0)) (.cse784 (select .cse780 .cse787)) (.cse781 (select (select |c_#memory_$Pointer$.offset| .cse783) .cse787))) (and (= (select .cse780 4) 0) (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse781) (not (= .cse782 v_prenex_61)) (not (= .cse783 .cse784)) (not (= .cse785 .cse784)) (not (= .cse782 .cse785)) (= (select (select |c_#memory_$Pointer$.base| .cse784) 0) 0) (= .cse784 |c_ULTIMATE.start_main_~item~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| .cse784) 0) 0) (not (= .cse786 0)) (= .cse781 0) (not (= .cse783 v_prenex_61))))))) (and (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int) (v_prenex_61 Int)) (let ((.cse791 (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0))) (.cse793 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (let ((.cse794 (+ .cse793 4)) (.cse790 (select |c_#memory_$Pointer$.base| (select .cse791 (+ (select (select |c_#memory_$Pointer$.offset| v_prenex_61) 0) 4))))) (let ((.cse788 (select .cse790 0)) (.cse789 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0)) (.cse792 (select .cse790 .cse794))) (and (not (= .cse788 .cse789)) (= .cse790 .cse791) (= 0 (select (select |c_#memory_$Pointer$.offset| .cse792) 0)) (= .cse793 0) (= (select .cse791 .cse794) |c_ULTIMATE.start_main_~item~0#1.base|) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse788)) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse789)) (not (= .cse789 .cse792)) (not (= .cse789 0)) (not (= .cse789 v_prenex_61)) (= (select (select |c_#memory_$Pointer$.base| .cse792) 0) 0)))))) .cse33) (and .cse0 .cse36 (exists ((v_prenex_205 Int) (|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int) (v_prenex_61 Int)) (let ((.cse799 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0)) (.cse798 (select (select |c_#memory_$Pointer$.offset| v_prenex_61) 0))) (let ((.cse795 (select (select |c_#memory_$Pointer$.offset| v_prenex_205) 0)) (.cse797 (select (select |c_#memory_$Pointer$.offset| .cse799) (+ .cse798 4))) (.cse796 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0))) (and (not (= (+ .cse795 4) 0)) (not (= .cse796 |c_ULTIMATE.start_main_~item~0#1.base|)) (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse797) (not (= .cse796 v_prenex_61)) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse796)) (not (= .cse798 .cse795)) (not (= .cse799 |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= .cse798 0)) (= .cse797 0) (not (= .cse799 v_prenex_61)) (not (= .cse796 .cse799))))))) (and (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int) (v_prenex_61 Int)) (let ((.cse804 (select |c_#memory_$Pointer$.base| v_prenex_61)) (.cse803 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (let ((.cse800 (select .cse804 (+ .cse803 4))) (.cse801 (select .cse804 0)) (.cse802 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (and (= (select (select |c_#memory_$Pointer$.base| .cse800) 0) 0) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse801)) (not (= .cse802 (select (select |c_#memory_$Pointer$.base| .cse801) (+ (select (select |c_#memory_$Pointer$.offset| v_prenex_61) 0) 4)))) (not (= .cse802 .cse800)) (= .cse803 0) (= (select (select |c_#memory_$Pointer$.offset| .cse800) 0) 0) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse802)) (= .cse800 |c_ULTIMATE.start_main_~item~0#1.base|) (not (= .cse802 0)) (not (= .cse802 v_prenex_61)) (not (= .cse801 .cse802)))))) .cse33) (and .cse0 .cse36 .cse33 .cse358 .cse37) (and .cse33 (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int) (v_prenex_61 Int)) (let ((.cse805 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (let ((.cse809 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0)) (.cse810 (select |c_#memory_$Pointer$.base| .cse805))) (let ((.cse806 (select .cse810 0)) (.cse807 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0)) (.cse808 (select .cse810 (+ .cse809 4)))) (and (not (= .cse805 .cse806)) (not (= .cse807 .cse808)) (= (select (select |c_#memory_$Pointer$.base| .cse808) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse808) 0) 0) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse806)) (= .cse809 0) (= .cse807 .cse805) (= .cse810 (select |c_#memory_$Pointer$.base| (select .cse810 (+ (select (select |c_#memory_$Pointer$.offset| v_prenex_61) 0) 4)))) (= .cse808 |c_ULTIMATE.start_main_~item~0#1.base|) (not (= .cse805 0)))))))) (and .cse0 .cse36 (exists ((v_prenex_205 Int) (|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int) (v_prenex_61 Int)) (let ((.cse814 (select (select |c_#memory_$Pointer$.offset| v_prenex_61) 0))) (let ((.cse815 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0)) (.cse816 (+ .cse814 4))) (let ((.cse811 (select (select |c_#memory_$Pointer$.offset| v_prenex_205) 0)) (.cse813 (select (select |c_#memory_$Pointer$.offset| .cse815) .cse816)) (.cse812 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0))) (and (not (= (+ .cse811 4) 0)) (not (= .cse812 |c_ULTIMATE.start_main_~item~0#1.base|)) (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse813) (not (= .cse812 v_prenex_61)) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse812)) (not (= .cse814 .cse811)) (not (= .cse815 |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= .cse811 0)) (not (= .cse814 0)) (= .cse813 0) (not (= .cse815 v_prenex_61)) (not (= .cse816 0)) (not (= .cse812 .cse815)))))))) (exists ((v_prenex_61 Int)) (let ((.cse822 (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0))) (.cse825 (select |c_#memory_$Pointer$.offset| v_prenex_61))) (let ((.cse824 (select |c_#memory_$Pointer$.base| (select .cse822 (+ (select .cse825 0) 4))))) (and (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int)) (let ((.cse821 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (let ((.cse823 (+ .cse821 4))) (let ((.cse819 (select .cse825 .cse823)) (.cse817 (select .cse824 0)) (.cse818 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0)) (.cse820 (select .cse824 .cse823))) (and (not (= .cse817 .cse818)) (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse819) (= 0 (select (select |c_#memory_$Pointer$.offset| .cse820) 0)) (= .cse821 0) (= (select .cse822 .cse823) |c_ULTIMATE.start_main_~item~0#1.base|) (= .cse819 0) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse817)) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse818)) (not (= .cse818 .cse820)) (not (= .cse818 0)) (not (= .cse818 v_prenex_61)) (= (select (select |c_#memory_$Pointer$.base| .cse820) 0) 0)))))) (= .cse824 .cse822))))) (and .cse0 .cse487 .cse36 .cse33) (and .cse0 .cse36 (or (exists ((v_prenex_61 Int)) (let ((.cse826 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0))) (and (not (= .cse826 |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= .cse826 v_prenex_61)) (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int)) (let ((.cse828 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (let ((.cse827 (select (select |c_#memory_$Pointer$.offset| v_prenex_61) (+ .cse828 4))) (.cse829 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (and (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse826)) (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse827) (= .cse828 0) (= .cse827 0) (= .cse826 .cse829) (not (= .cse829 0))))))))) (exists ((v_prenex_61 Int)) (let ((.cse830 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0)) (.cse834 (select |c_#memory_$Pointer$.offset| v_prenex_61))) (and (not (= .cse830 |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= .cse830 v_prenex_61)) (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int)) (let ((.cse832 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (let ((.cse831 (select .cse834 (+ .cse832 4))) (.cse833 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (and (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse830)) (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse831) (= .cse832 0) (= .cse831 0) (= .cse830 .cse833) (not (= .cse833 0)))))) (not (= (+ (select .cse834 0) 4) 0))))) (exists ((v_prenex_61 Int)) (let ((.cse840 (select |c_#memory_$Pointer$.offset| v_prenex_61))) (let ((.cse835 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0)) (.cse837 (select .cse840 0))) (and (not (= .cse835 |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= .cse835 v_prenex_61)) (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int)) (let ((.cse838 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (let ((.cse836 (select .cse840 (+ .cse838 4))) (.cse839 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (and (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse835)) (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse836) (not (= .cse837 .cse838)) (= .cse838 0) (= .cse836 0) (= .cse835 .cse839) (not (= .cse839 0)))))) (not (= (+ .cse837 4) 0)))))) (exists ((v_prenex_61 Int)) (let ((.cse841 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0))) (and (not (= .cse841 |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= .cse841 v_prenex_61)) (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int)) (let ((.cse843 (select |c_#memory_$Pointer$.offset| v_prenex_61)) (.cse844 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (let ((.cse842 (select .cse843 (+ .cse844 4))) (.cse845 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (and (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse841)) (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse842) (not (= (select .cse843 0) .cse844)) (= .cse844 0) (= .cse842 0) (= .cse841 .cse845) (not (= .cse845 0))))))))))) (and .cse522 .cse30 .cse31 .cse34 .cse21) (and .cse0 .cse36 (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int) (v_prenex_61 Int)) (let ((.cse849 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (let ((.cse847 (select (select |c_#memory_$Pointer$.offset| v_prenex_61) (+ .cse849 4))) (.cse846 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0)) (.cse848 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (and (not (= .cse846 v_prenex_61)) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse846)) (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse847) (not (= .cse848 |c_ULTIMATE.start_main_~item~0#1.base|)) (= .cse849 0) (= .cse847 0) (= .cse846 .cse848) (not (= .cse848 0))))))) (and .cse0 (or (and .cse313 .cse21) (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int)) (let ((.cse854 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (let ((.cse850 (select |c_#memory_$Pointer$.base| .cse854))) (and (= .cse2 .cse850) (= (select .cse850 0) 0) (exists ((v_prenex_61 Int)) (let ((.cse855 (select |c_#memory_$Pointer$.offset| v_prenex_61))) (let ((.cse853 (select .cse855 0)) (.cse851 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0))) (and (not (= .cse851 |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= .cse851 v_prenex_61)) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse851)) (exists ((v_prenex_213 Int)) (let ((.cse852 (select (select |c_#memory_$Pointer$.offset| v_prenex_213) 0))) (and (not (= (+ .cse852 4) 0)) (not (= .cse852 .cse853))))) (not (= .cse853 0)) (not (= (+ .cse853 4) 0)) (not (= .cse851 .cse854)) (= (select |c_#memory_$Pointer$.offset| .cse854) .cse855))))))))) (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int)) (let ((.cse859 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (let ((.cse856 (select |c_#memory_$Pointer$.base| .cse859))) (and (= .cse2 .cse856) (= (select .cse856 0) 0) (exists ((v_prenex_61 Int)) (let ((.cse860 (select |c_#memory_$Pointer$.offset| v_prenex_61))) (let ((.cse858 (select .cse860 0)) (.cse857 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0))) (and (not (= v_prenex_61 0)) (not (= .cse857 |c_ULTIMATE.start_main_~item~0#1.base|)) (exists ((v_prenex_213 Int)) (not (= (select (select |c_#memory_$Pointer$.offset| v_prenex_213) 0) .cse858))) (not (= .cse857 v_prenex_61)) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse857)) (not (= .cse858 0)) (not (= .cse857 0)) (not (= (+ .cse858 4) 0)) (not (= .cse857 .cse859)) (= (select |c_#memory_$Pointer$.offset| .cse859) .cse860)))))))))) .cse33) (exists ((v_prenex_61 Int)) (let ((.cse861 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0))) (and (not (= .cse861 v_prenex_61)) (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int)) (let ((.cse862 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0)) (.cse865 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (let ((.cse868 (+ .cse865 4)) (.cse866 (select |c_#memory_$Pointer$.base| .cse862))) (let ((.cse863 (select .cse866 0)) (.cse864 (select .cse866 .cse868)) (.cse867 (select (select |c_#memory_$Pointer$.offset| .cse862) .cse868))) (and (not (= .cse862 .cse863)) (not (= .cse861 .cse864)) (= (select (select |c_#memory_$Pointer$.base| .cse864) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse864) 0) 0) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse863)) (= .cse865 0) (= .cse861 .cse862) (= .cse866 (select |c_#memory_$Pointer$.base| (select .cse866 (+ (select (select |c_#memory_$Pointer$.offset| v_prenex_61) 0) 4)))) (= .cse864 |c_ULTIMATE.start_main_~item~0#1.base|) (= .cse867 0) (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse867) (not (= .cse862 0)))))))))) (and .cse745 .cse57) (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int) (v_prenex_61 Int)) (let ((.cse873 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0)) (.cse874 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0)) (.cse875 (select |c_#memory_$Pointer$.offset| v_prenex_61))) (let ((.cse876 (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| .cse874) (+ (select .cse875 0) 4)))) (.cse877 (+ .cse873 4))) (let ((.cse871 (select .cse875 .cse877)) (.cse869 (select .cse876 0)) (.cse872 (select .cse876 .cse877)) (.cse870 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (and (not (= .cse869 .cse870)) (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse871) (= .cse872 |c_ULTIMATE.start_main_~item~0#1.base|) (= 0 (select (select |c_#memory_$Pointer$.offset| .cse872) 0)) (= .cse873 0) (= .cse871 0) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse869)) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse870)) (not (= .cse870 .cse872)) (not (= .cse870 0)) (not (= .cse870 v_prenex_61)) (not (= .cse874 .cse870)) (= (select (select |c_#memory_$Pointer$.base| .cse872) 0) 0) (= (select |c_#memory_$Pointer$.offset| .cse870) .cse875)))))) (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int) (v_prenex_61 Int)) (let ((.cse882 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0)) (.cse884 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0)) (.cse885 (select |c_#memory_$Pointer$.offset| v_prenex_61))) (let ((.cse883 (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| .cse884) (+ (select .cse885 0) 4)))) (.cse886 (+ .cse882 4))) (let ((.cse880 (select .cse885 .cse886)) (.cse878 (select .cse883 0)) (.cse881 (select .cse883 .cse886)) (.cse879 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (and (not (= .cse878 .cse879)) (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse880) (= .cse881 |c_ULTIMATE.start_main_~item~0#1.base|) (= 0 (select (select |c_#memory_$Pointer$.offset| .cse881) 0)) (= .cse882 0) (= .cse880 0) (= .cse883 (select |c_#memory_$Pointer$.base| .cse879)) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse878)) (not (= .cse879 .cse881)) (not (= .cse879 0)) (not (= .cse879 v_prenex_61)) (not (= .cse884 .cse879)) (= (select (select |c_#memory_$Pointer$.base| .cse881) 0) 0) (= (select |c_#memory_$Pointer$.offset| .cse879) .cse885)))))) (and .cse33 (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int) (v_prenex_61 Int)) (let ((.cse891 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0))) (let ((.cse892 (select (select |c_#memory_$Pointer$.offset| v_prenex_61) 0)) (.cse887 (select |c_#memory_$Pointer$.base| .cse891))) (let ((.cse888 (select .cse887 0)) (.cse890 (select .cse887 (+ .cse892 4))) (.cse889 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (and (= (select .cse887 4) 0) (not (= .cse888 v_prenex_61)) (not (= .cse889 .cse890)) (not (= .cse891 .cse890)) (not (= .cse888 .cse891)) (= (select (select |c_#memory_$Pointer$.base| .cse890) 0) 0) (= .cse890 |c_ULTIMATE.start_main_~item~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| .cse890) 0) 0) (not (= .cse892 0)) (not (= .cse889 v_prenex_61)) (not (= .cse891 .cse889)))))))) (exists ((v_prenex_61 Int)) (let ((.cse893 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0)) (.cse900 (select (select |c_#memory_$Pointer$.offset| v_prenex_61) 0))) (and (not (= .cse893 v_prenex_61)) (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int)) (let ((.cse899 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (let ((.cse898 (+ .cse900 4)) (.cse897 (select |c_#memory_$Pointer$.base| .cse899))) (let ((.cse896 (select .cse897 0)) (.cse895 (select (select |c_#memory_$Pointer$.offset| .cse899) .cse898)) (.cse894 (select .cse897 .cse898))) (and (not (= .cse893 .cse894)) (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse895) (not (= v_prenex_61 .cse896)) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse893)) (not (= .cse893 .cse896)) (= .cse896 0) (= (select .cse897 4) 0) (= .cse895 0) (= .cse897 (select |c_#memory_$Pointer$.base| .cse894)) (= .cse894 |c_ULTIMATE.start_main_~item~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| .cse894) 0) 0)))))) (not (= .cse900 0))))) (and .cse0 (or (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int)) (let ((.cse905 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (let ((.cse901 (select |c_#memory_$Pointer$.base| .cse905))) (and (= .cse2 .cse901) (= (select .cse901 0) 0) (exists ((v_prenex_61 Int)) (let ((.cse904 (select (select |c_#memory_$Pointer$.offset| v_prenex_61) 0)) (.cse902 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0))) (and (not (= .cse902 |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= .cse902 v_prenex_61)) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse902)) (exists ((v_prenex_213 Int)) (let ((.cse903 (select (select |c_#memory_$Pointer$.offset| v_prenex_213) 0))) (and (not (= (+ .cse903 4) 0)) (not (= .cse903 .cse904))))) (not (= .cse904 0)) (not (= .cse905 v_prenex_61)) (not (= .cse902 .cse905))))))))) (and (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int) (v_prenex_61 Int)) (let ((.cse908 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (let ((.cse907 (select |c_#memory_$Pointer$.base| .cse908)) (.cse906 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0))) (and (not (= .cse906 |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= .cse906 v_prenex_61)) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse906)) (= .cse2 .cse907) (= (select .cse907 0) 0) (not (= (select (select |c_#memory_$Pointer$.offset| v_prenex_61) 0) 0)) (not (= .cse906 .cse908)))))) .cse21)) .cse33) (and .cse0 (exists ((v_prenex_205 Int) (v_prenex_61 Int) (v_prenex_206 Int)) (let ((.cse912 (select (select |c_#memory_$Pointer$.offset| v_prenex_205) 0)) (.cse910 (select (select |c_#memory_$Pointer$.base| v_prenex_206) 0)) (.cse909 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0)) (.cse911 (select (select |c_#memory_$Pointer$.offset| v_prenex_61) 0))) (and (not (= .cse909 |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= .cse910 v_prenex_61)) (not (= .cse909 v_prenex_61)) (not (= .cse911 .cse912)) (not (= .cse910 |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= .cse912 0)) (not (= .cse911 0)) (not (= .cse910 .cse909)) (not (= .cse909 v_prenex_206)) (not (= (+ .cse911 4) 0))))) .cse36 .cse33) (exists ((v_prenex_61 Int)) (let ((.cse920 (select |c_#memory_$Pointer$.offset| v_prenex_61))) (let ((.cse915 (select .cse920 0))) (let ((.cse921 (+ .cse915 4))) (let ((.cse914 (select .cse920 .cse921)) (.cse913 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0))) (and (not (= .cse913 v_prenex_61)) (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse914) (not (= .cse915 0)) (= .cse914 0) (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int)) (let ((.cse919 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (let ((.cse918 (select |c_#memory_$Pointer$.base| .cse919))) (let ((.cse917 (select .cse918 0)) (.cse916 (select .cse918 .cse921))) (and (not (= .cse913 .cse916)) (not (= v_prenex_61 .cse917)) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse913)) (not (= .cse913 .cse917)) (= .cse917 0) (= (select .cse918 4) 0) (= .cse918 (select |c_#memory_$Pointer$.base| .cse916)) (= .cse916 |c_ULTIMATE.start_main_~item~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| .cse916) 0) 0) (= (select |c_#memory_$Pointer$.offset| .cse919) .cse920)))))))))))) (exists ((v_prenex_61 Int)) (let ((.cse929 (select |c_#memory_$Pointer$.offset| v_prenex_61))) (let ((.cse928 (select .cse929 0))) (let ((.cse926 (+ .cse928 4))) (let ((.cse927 (select .cse929 .cse926)) (.cse922 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0))) (and (not (= .cse922 v_prenex_61)) (exists ((v_DerPreprocessor_1 Int)) (let ((.cse925 (select |c_#memory_$Pointer$.base| v_DerPreprocessor_1))) (let ((.cse924 (select .cse925 0)) (.cse923 (select .cse925 .cse926))) (and (= (select (select |c_#memory_$Pointer$.offset| .cse923) 0) 0) (= .cse924 0) (= .cse923 |c_ULTIMATE.start_main_~item~0#1.base|) (not (= .cse922 .cse923)) (not (= .cse922 .cse924)) (= (select .cse925 4) 0) (not (= v_prenex_61 .cse924)) (= .cse923 v_DerPreprocessor_1))))) (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse927) (not (= .cse928 0)) (= .cse927 0) (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int)) (and (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse922)) (= .cse922 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0)))))))))) (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int) (v_prenex_61 Int)) (let ((.cse930 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0)) (.cse934 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (let ((.cse935 (+ .cse934 4)) (.cse936 (select |c_#memory_$Pointer$.base| .cse930))) (let ((.cse931 (select .cse936 0)) (.cse932 (select .cse936 .cse935)) (.cse933 (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0))) (.cse937 (select (select |c_#memory_$Pointer$.offset| .cse930) .cse935))) (and (not (= .cse930 .cse931)) (= (select (select |c_#memory_$Pointer$.base| .cse932) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse932) 0) 0) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse931)) (not (= .cse930 .cse932)) (not (= .cse930 (select .cse933 (+ (select (select |c_#memory_$Pointer$.offset| v_prenex_61) 0) 4)))) (= .cse934 0) (= (select .cse933 .cse935) |c_ULTIMATE.start_main_~item~0#1.base|) (= .cse933 .cse936) (= .cse937 0) (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse937) (not (= .cse930 0)) (not (= .cse930 v_prenex_61))))))) (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int) (v_prenex_61 Int)) (let ((.cse944 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0)) (.cse938 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (let ((.cse943 (select |c_#memory_$Pointer$.offset| v_prenex_61)) (.cse946 (select |c_#memory_$Pointer$.base| .cse938)) (.cse945 (+ .cse944 4))) (let ((.cse940 (select .cse946 .cse945)) (.cse939 (select .cse946 0)) (.cse941 (select .cse943 .cse945)) (.cse942 (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0)))) (and (not (= .cse938 .cse939)) (= (select (select |c_#memory_$Pointer$.base| .cse940) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse940) 0) 0) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse939)) (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse941) (not (= .cse938 (select .cse942 (+ (select .cse943 0) 4)))) (= .cse944 0) (= (select .cse942 .cse945) |c_ULTIMATE.start_main_~item~0#1.base|) (= .cse941 0) (= .cse942 .cse946) (not (= .cse938 0)) (not (= .cse938 v_prenex_61)) (= (select |c_#memory_$Pointer$.offset| .cse938) .cse943)))))) (and .cse0 .cse36 (exists ((v_prenex_205 Int) (|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int) (v_prenex_61 Int)) (let ((.cse952 (select |c_#memory_$Pointer$.offset| v_prenex_61))) (let ((.cse950 (select .cse952 0))) (let ((.cse947 (select (select |c_#memory_$Pointer$.offset| v_prenex_205) 0)) (.cse949 (select .cse952 (+ .cse950 4))) (.cse948 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0)) (.cse951 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (and (not (= (+ .cse947 4) 0)) (not (= .cse948 |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= .cse948 v_prenex_61)) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse948)) (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse949) (not (= .cse950 .cse947)) (not (= .cse950 0)) (= .cse949 0) (not (= .cse948 .cse951)) (= (select |c_#memory_$Pointer$.offset| .cse951) .cse952))))))) (and .cse33 (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int) (v_arrayElimCell_922 Int)) (let ((.cse953 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (let ((.cse957 (select |c_#memory_$Pointer$.base| .cse953)) (.cse956 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (let ((.cse955 (select .cse957 (+ .cse956 4))) (.cse954 (select .cse957 0))) (and (not (= .cse953 .cse954)) (= (select (select |c_#memory_$Pointer$.base| .cse955) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse955) 0) 0) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse954)) (not (= .cse953 .cse955)) (= .cse956 0) (= .cse955 |c_ULTIMATE.start_main_~item~0#1.base|) (not (= (select (select |c_#memory_$Pointer$.base| .cse954) (+ v_arrayElimCell_922 4)) .cse953)) (not (= .cse953 0)))))))) (and .cse529 .cse30 .cse31 .cse34 .cse21) (and .cse56 (or (and .cse0 (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int) (v_prenex_61 Int)) (let ((.cse960 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (let ((.cse959 (select |c_#memory_$Pointer$.base| .cse960)) (.cse958 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0))) (and (not (= .cse958 |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= .cse958 v_prenex_61)) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse958)) (= .cse2 .cse959) (= (select .cse959 0) 0) (not (= (select (select |c_#memory_$Pointer$.offset| v_prenex_61) 0) 0)) (not (= .cse960 v_prenex_61)) (not (= .cse958 .cse960)))))) .cse33) (and .cse0 (exists ((v_prenex_214 Int) (v_prenex_61 Int)) (let ((.cse962 (select (select |c_#memory_$Pointer$.base| v_prenex_214) 0)) (.cse965 (select (select |c_#memory_$Pointer$.offset| v_prenex_61) 0))) (let ((.cse961 (select (select |c_#memory_$Pointer$.offset| .cse962) (+ .cse965 4))) (.cse963 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0)) (.cse964 (select |c_#memory_$Pointer$.base| .cse962))) (and (= .cse961 0) (not (= .cse962 .cse963)) (not (= .cse963 |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= .cse963 v_prenex_61)) (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse961) (not (= .cse962 v_prenex_61)) (= (select .cse964 0) 0) (not (= .cse965 0)) (not (= .cse963 v_prenex_214)) (= .cse964 .cse2)))))))) (and (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int) (v_prenex_61 Int)) (let ((.cse969 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (let ((.cse970 (select (select |c_#memory_$Pointer$.offset| v_prenex_61) 0)) (.cse971 (select |c_#memory_$Pointer$.base| .cse969))) (let ((.cse968 (select .cse971 0)) (.cse967 (select .cse971 (+ .cse970 4))) (.cse966 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0))) (and (not (= .cse966 .cse967)) (not (= .cse966 v_prenex_61)) (not (= v_prenex_61 .cse968)) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse966)) (not (= .cse966 .cse968)) (= (select (select |c_#memory_$Pointer$.base| .cse967) 0) 0) (not (= .cse969 .cse967)) (not (= .cse970 0)) (= (select .cse971 4) 0) (= .cse967 |c_ULTIMATE.start_main_~item~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| .cse967) 0) 0) (not (= .cse966 .cse969))))))) .cse33) (and .cse0 .cse36 (exists ((v_prenex_205 Int) (|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int) (v_prenex_61 Int)) (let ((.cse976 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0)) (.cse974 (select (select |c_#memory_$Pointer$.offset| v_prenex_61) 0))) (let ((.cse975 (select (select |c_#memory_$Pointer$.offset| v_prenex_205) 0)) (.cse973 (select (select |c_#memory_$Pointer$.offset| .cse976) (+ .cse974 4))) (.cse972 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0))) (and (not (= .cse972 |c_ULTIMATE.start_main_~item~0#1.base|)) (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse973) (not (= .cse972 v_prenex_61)) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse972)) (not (= .cse974 .cse975)) (not (= .cse976 |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= .cse975 0)) (not (= .cse974 0)) (= .cse973 0) (not (= .cse976 v_prenex_61)) (not (= .cse972 .cse976))))))) (and .cse0 (exists ((v_arrayElimCell_917 Int) (v_arrayElimCell_919 Int) (v_prenex_573 Int) (|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int)) (let ((.cse979 (select (select |c_#memory_$Pointer$.base| v_prenex_573) 0)) (.cse977 (select (select |c_#memory_$Pointer$.offset| v_prenex_573) 0)) (.cse978 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (and (not (= .cse977 .cse978)) (not (= .cse979 |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= v_arrayElimCell_917 .cse979)) (not (= v_arrayElimCell_917 v_prenex_573)) (not (= v_prenex_573 .cse979)) (= (select (select |c_#memory_$Pointer$.base| v_arrayElimCell_917) (+ v_arrayElimCell_919 4)) .cse979) (not (= .cse979 0)) (= .cse977 0) (not (= (+ .cse978 4) 0))))) .cse36 .cse33) (and .cse0 (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int) (v_prenex_61 Int)) (let ((.cse982 (select |c_#memory_$Pointer$.offset| v_prenex_61)) (.cse983 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (let ((.cse981 (select .cse982 (+ .cse983 4))) (.cse980 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0)) (.cse984 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (and (not (= .cse980 |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= .cse980 v_prenex_61)) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse980)) (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse981) (not (= (select .cse982 0) .cse983)) (= .cse983 0) (= .cse981 0) (= .cse980 .cse984) (not (= .cse984 0)))))) .cse36) (and .cse0 (exists ((v_prenex_205 Int) (v_prenex_61 Int) (v_prenex_206 Int)) (let ((.cse989 (select |c_#memory_$Pointer$.offset| v_prenex_61))) (let ((.cse985 (select (select |c_#memory_$Pointer$.offset| v_prenex_205) 0)) (.cse988 (select (select |c_#memory_$Pointer$.base| v_prenex_206) 0)) (.cse986 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0)) (.cse987 (select .cse989 0))) (and (not (= (+ .cse985 4) 0)) (not (= .cse986 |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= .cse986 v_prenex_61)) (not (= .cse987 .cse985)) (not (= .cse987 0)) (= (select |c_#memory_$Pointer$.offset| .cse988) .cse989) (not (= .cse988 .cse986)) (not (= .cse986 v_prenex_206)) (not (= (+ .cse987 4) 0)))))) .cse36 .cse33) (and .cse0 (exists ((v_prenex_205 Int) (v_prenex_61 Int) (v_prenex_206 Int)) (let ((.cse994 (select |c_#memory_$Pointer$.offset| v_prenex_61))) (let ((.cse992 (select (select |c_#memory_$Pointer$.offset| v_prenex_205) 0)) (.cse993 (select (select |c_#memory_$Pointer$.base| v_prenex_206) 0)) (.cse990 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0)) (.cse991 (select .cse994 0))) (and (not (= .cse990 |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= .cse990 v_prenex_61)) (not (= .cse991 .cse992)) (not (= .cse992 0)) (not (= .cse991 0)) (= (select |c_#memory_$Pointer$.offset| .cse993) .cse994) (not (= .cse993 .cse990)) (not (= .cse990 v_prenex_206)) (not (= (+ .cse991 4) 0)))))) .cse36 .cse33) (and (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int) (v_DerPreprocessor_2 Int) (v_prenex_61 Int)) (let ((.cse999 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0)) (.cse1000 (select |c_#memory_$Pointer$.base| v_DerPreprocessor_2))) (let ((.cse997 (select .cse1000 0)) (.cse998 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0)) (.cse995 (select .cse1000 (+ .cse999 4))) (.cse996 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (and (= (select (select |c_#memory_$Pointer$.base| .cse995) 0) 0) (not (= .cse996 .cse997)) (not (= .cse998 v_prenex_61)) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse998)) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse997)) (not (= .cse998 .cse995)) (= .cse999 0) (= (select (select |c_#memory_$Pointer$.offset| .cse995) 0) 0) (= .cse998 .cse996) (= .cse995 |c_ULTIMATE.start_main_~item~0#1.base|) (= (select .cse1000 (+ (select (select |c_#memory_$Pointer$.offset| v_prenex_61) 0) 4)) v_DerPreprocessor_2) (not (= .cse996 0)))))) .cse33) (exists ((v_prenex_61 Int)) (let ((.cse1001 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0)) (.cse1008 (select (select |c_#memory_$Pointer$.offset| v_prenex_61) 0))) (and (not (= .cse1001 v_prenex_61)) (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int)) (let ((.cse1005 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (let ((.cse1007 (+ .cse1008 4)) (.cse1006 (select |c_#memory_$Pointer$.base| .cse1005))) (let ((.cse1004 (select .cse1006 0)) (.cse1003 (select (select |c_#memory_$Pointer$.offset| .cse1005) .cse1007)) (.cse1002 (select .cse1006 .cse1007))) (and (not (= .cse1001 .cse1002)) (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse1003) (not (= v_prenex_61 .cse1004)) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse1001)) (not (= .cse1001 .cse1004)) (= (select (select |c_#memory_$Pointer$.base| .cse1002) 0) 0) (not (= .cse1005 .cse1002)) (= (select .cse1006 4) 0) (= .cse1003 0) (= .cse1002 |c_ULTIMATE.start_main_~item~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| .cse1002) 0) 0)))))) (not (= .cse1008 0))))) (and .cse0 (or (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int)) (let ((.cse1012 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (let ((.cse1014 (select |c_#memory_$Pointer$.base| .cse1012))) (and (exists ((v_prenex_61 Int)) (let ((.cse1013 (select |c_#memory_$Pointer$.offset| v_prenex_61))) (let ((.cse1011 (select .cse1013 0)) (.cse1009 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0))) (and (not (= .cse1009 |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= .cse1009 v_prenex_61)) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse1009)) (exists ((v_prenex_213 Int)) (let ((.cse1010 (select (select |c_#memory_$Pointer$.offset| v_prenex_213) 0))) (and (not (= (+ .cse1010 4) 0)) (not (= .cse1010 .cse1011))))) (not (= .cse1011 0)) (not (= .cse1009 .cse1012)) (= (select |c_#memory_$Pointer$.offset| .cse1012) .cse1013))))) (= .cse2 .cse1014) (= (select .cse1014 0) 0))))) (and .cse55 .cse21)) .cse33) (and .cse117 .cse58) (and .cse33 .cse397) (and (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int) (v_prenex_61 Int)) (let ((.cse1019 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0))) (let ((.cse1020 (select (select |c_#memory_$Pointer$.offset| v_prenex_61) 0)) (.cse1015 (select |c_#memory_$Pointer$.base| .cse1019))) (let ((.cse1016 (select .cse1015 0)) (.cse1018 (select .cse1015 (+ .cse1020 4))) (.cse1017 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (and (= (select .cse1015 4) 0) (not (= .cse1016 v_prenex_61)) (not (= .cse1017 .cse1018)) (not (= .cse1016 .cse1019)) (= (select (select |c_#memory_$Pointer$.base| .cse1018) 0) 0) (= .cse1018 |c_ULTIMATE.start_main_~item~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| .cse1018) 0) 0) (not (= .cse1020 0)) (= .cse1019 .cse1017)))))) .cse33) (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int) (v_prenex_61 Int)) (let ((.cse1025 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0)) (.cse1026 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0)) (.cse1029 (select |c_#memory_$Pointer$.offset| v_prenex_61))) (let ((.cse1027 (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| .cse1026) (+ (select .cse1029 0) 4)))) (.cse1028 (+ .cse1025 4))) (let ((.cse1023 (select .cse1029 .cse1028)) (.cse1021 (select .cse1027 0)) (.cse1022 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0)) (.cse1024 (select .cse1027 .cse1028))) (and (not (= .cse1021 .cse1022)) (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse1023) (= .cse1024 |c_ULTIMATE.start_main_~item~0#1.base|) (= 0 (select (select |c_#memory_$Pointer$.offset| .cse1024) 0)) (= .cse1025 0) (= .cse1023 0) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse1021)) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse1022)) (not (= .cse1022 .cse1024)) (not (= .cse1022 0)) (not (= .cse1022 v_prenex_61)) (not (= .cse1026 .cse1022)) (= (select (select |c_#memory_$Pointer$.base| .cse1024) 0) 0)))))) (and .cse31 .cse33 .cse758 .cse34 .cse21) (and .cse0 .cse36 .cse33 (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_186| Int) (v_prenex_61 Int)) (let ((.cse1030 (select (select |c_#memory_$Pointer$.base| v_prenex_61) 0)) (.cse1031 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0))) (and (not (= .cse1030 v_prenex_61)) (not (= |v_ULTIMATE.start_main_~bcki~0#1.base_186| .cse1030)) (not (= .cse1031 |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~bcki~0#1.base_186|) 0) 0) (= .cse1030 .cse1031) (not (= .cse1031 0))))))))))) is different from true