./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/array-fpi/mods.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8393723b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7ef82b3-d12c-4868-b30c-b806c85a42c1/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7ef82b3-d12c-4868-b30c-b806c85a42c1/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7ef82b3-d12c-4868-b30c-b806c85a42c1/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7ef82b3-d12c-4868-b30c-b806c85a42c1/bin/uautomizer-TMbwUNV5ro/config/AutomizerReach.xml -i ../../sv-benchmarks/c/array-fpi/mods.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7ef82b3-d12c-4868-b30c-b806c85a42c1/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7ef82b3-d12c-4868-b30c-b806c85a42c1/bin/uautomizer-TMbwUNV5ro --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 f15d84a1f588b4a2fae1a1f53311fed1d9572550b31409f886696465cdc8f8ba --- 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-8393723 [2022-11-18 19:41:07,178 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 19:41:07,180 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 19:41:07,200 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 19:41:07,200 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 19:41:07,201 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 19:41:07,203 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 19:41:07,205 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 19:41:07,207 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 19:41:07,208 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 19:41:07,209 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 19:41:07,210 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 19:41:07,210 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 19:41:07,212 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 19:41:07,213 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 19:41:07,214 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 19:41:07,215 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 19:41:07,216 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 19:41:07,218 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 19:41:07,220 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 19:41:07,221 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 19:41:07,229 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 19:41:07,230 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 19:41:07,233 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 19:41:07,237 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 19:41:07,244 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 19:41:07,245 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 19:41:07,246 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 19:41:07,246 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 19:41:07,247 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 19:41:07,247 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 19:41:07,248 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 19:41:07,250 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 19:41:07,251 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 19:41:07,254 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 19:41:07,255 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 19:41:07,256 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 19:41:07,257 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 19:41:07,257 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 19:41:07,258 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 19:41:07,259 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 19:41:07,259 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7ef82b3-d12c-4868-b30c-b806c85a42c1/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-18 19:41:07,296 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 19:41:07,296 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 19:41:07,297 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 19:41:07,297 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 19:41:07,298 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 19:41:07,298 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 19:41:07,298 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 19:41:07,299 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 19:41:07,299 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 19:41:07,299 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 19:41:07,300 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 19:41:07,300 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 19:41:07,301 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 19:41:07,301 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 19:41:07,301 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 19:41:07,301 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 19:41:07,301 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 19:41:07,302 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 19:41:07,302 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 19:41:07,302 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 19:41:07,302 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 19:41:07,303 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 19:41:07,303 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 19:41:07,303 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 19:41:07,303 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 19:41:07,303 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 19:41:07,304 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 19:41:07,304 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 19:41:07,304 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 19:41:07,304 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 19:41:07,304 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 19:41:07,305 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 19:41:07,305 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 19:41:07,305 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_d7ef82b3-d12c-4868-b30c-b806c85a42c1/bin/uautomizer-TMbwUNV5ro/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_d7ef82b3-d12c-4868-b30c-b806c85a42c1/bin/uautomizer-TMbwUNV5ro 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 -> f15d84a1f588b4a2fae1a1f53311fed1d9572550b31409f886696465cdc8f8ba [2022-11-18 19:41:07,623 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 19:41:07,643 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 19:41:07,645 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 19:41:07,646 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 19:41:07,647 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 19:41:07,648 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7ef82b3-d12c-4868-b30c-b806c85a42c1/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/array-fpi/mods.c [2022-11-18 19:41:07,710 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7ef82b3-d12c-4868-b30c-b806c85a42c1/bin/uautomizer-TMbwUNV5ro/data/75611f935/99b92dff0d9b49779a0e2e3d187dd292/FLAGf506840d7 [2022-11-18 19:41:08,265 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 19:41:08,266 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7ef82b3-d12c-4868-b30c-b806c85a42c1/sv-benchmarks/c/array-fpi/mods.c [2022-11-18 19:41:08,272 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7ef82b3-d12c-4868-b30c-b806c85a42c1/bin/uautomizer-TMbwUNV5ro/data/75611f935/99b92dff0d9b49779a0e2e3d187dd292/FLAGf506840d7 [2022-11-18 19:41:08,612 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7ef82b3-d12c-4868-b30c-b806c85a42c1/bin/uautomizer-TMbwUNV5ro/data/75611f935/99b92dff0d9b49779a0e2e3d187dd292 [2022-11-18 19:41:08,616 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 19:41:08,619 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 19:41:08,622 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 19:41:08,623 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 19:41:08,626 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 19:41:08,627 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 07:41:08" (1/1) ... [2022-11-18 19:41:08,629 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f82459b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:41:08, skipping insertion in model container [2022-11-18 19:41:08,630 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 07:41:08" (1/1) ... [2022-11-18 19:41:08,637 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 19:41:08,655 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 19:41:08,870 WARN L234 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_d7ef82b3-d12c-4868-b30c-b806c85a42c1/sv-benchmarks/c/array-fpi/mods.c[587,600] [2022-11-18 19:41:08,891 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 19:41:08,899 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 19:41:08,912 WARN L234 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_d7ef82b3-d12c-4868-b30c-b806c85a42c1/sv-benchmarks/c/array-fpi/mods.c[587,600] [2022-11-18 19:41:08,925 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 19:41:08,939 INFO L208 MainTranslator]: Completed translation [2022-11-18 19:41:08,939 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:41:08 WrapperNode [2022-11-18 19:41:08,939 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 19:41:08,940 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 19:41:08,940 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 19:41:08,940 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 19:41:08,948 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:41:08" (1/1) ... [2022-11-18 19:41:08,968 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:41:08" (1/1) ... [2022-11-18 19:41:08,990 INFO L138 Inliner]: procedures = 17, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 104 [2022-11-18 19:41:08,991 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 19:41:08,991 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 19:41:08,992 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 19:41:08,992 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 19:41:09,000 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:41:08" (1/1) ... [2022-11-18 19:41:09,001 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:41:08" (1/1) ... [2022-11-18 19:41:09,003 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:41:08" (1/1) ... [2022-11-18 19:41:09,004 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:41:08" (1/1) ... [2022-11-18 19:41:09,009 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:41:08" (1/1) ... [2022-11-18 19:41:09,014 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:41:08" (1/1) ... [2022-11-18 19:41:09,015 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:41:08" (1/1) ... [2022-11-18 19:41:09,016 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:41:08" (1/1) ... [2022-11-18 19:41:09,019 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 19:41:09,019 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 19:41:09,020 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 19:41:09,020 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 19:41:09,026 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:41:08" (1/1) ... [2022-11-18 19:41:09,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 19:41:09,045 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7ef82b3-d12c-4868-b30c-b806c85a42c1/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:41:09,057 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7ef82b3-d12c-4868-b30c-b806c85a42c1/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 19:41:09,060 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7ef82b3-d12c-4868-b30c-b806c85a42c1/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 19:41:09,101 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 19:41:09,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 19:41:09,102 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-18 19:41:09,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-18 19:41:09,102 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-18 19:41:09,102 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 19:41:09,102 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 19:41:09,102 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-18 19:41:09,102 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 19:41:09,216 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 19:41:09,219 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 19:41:09,492 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 19:41:09,498 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 19:41:09,498 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2022-11-18 19:41:09,500 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 07:41:09 BoogieIcfgContainer [2022-11-18 19:41:09,514 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 19:41:09,517 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 19:41:09,517 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 19:41:09,521 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 19:41:09,521 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 07:41:08" (1/3) ... [2022-11-18 19:41:09,522 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e3fbe2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 07:41:09, skipping insertion in model container [2022-11-18 19:41:09,522 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:41:08" (2/3) ... [2022-11-18 19:41:09,522 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e3fbe2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 07:41:09, skipping insertion in model container [2022-11-18 19:41:09,522 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 07:41:09" (3/3) ... [2022-11-18 19:41:09,524 INFO L112 eAbstractionObserver]: Analyzing ICFG mods.c [2022-11-18 19:41:09,554 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 19:41:09,554 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-18 19:41:09,640 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 19:41:09,649 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;@504fb02a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 19:41:09,650 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-18 19:41:09,656 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 25 states have (on average 1.56) internal successors, (39), 26 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:41:09,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-18 19:41:09,664 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:41:09,665 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:41:09,666 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:41:09,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:41:09,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1389277550, now seen corresponding path program 1 times [2022-11-18 19:41:09,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:41:09,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404439347] [2022-11-18 19:41:09,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:41:09,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:41:09,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:41:09,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:41:09,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:41:09,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404439347] [2022-11-18 19:41:09,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404439347] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:41:09,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:41:09,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 19:41:09,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013310643] [2022-11-18 19:41:09,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:41:09,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-18 19:41:09,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:41:09,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-18 19:41:09,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-18 19:41:09,933 INFO L87 Difference]: Start difference. First operand has 27 states, 25 states have (on average 1.56) internal successors, (39), 26 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:41:09,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:41:09,953 INFO L93 Difference]: Finished difference Result 50 states and 72 transitions. [2022-11-18 19:41:09,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-18 19:41:09,956 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-18 19:41:09,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:41:09,965 INFO L225 Difference]: With dead ends: 50 [2022-11-18 19:41:09,966 INFO L226 Difference]: Without dead ends: 23 [2022-11-18 19:41:09,969 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-18 19:41:09,973 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 19:41:09,974 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 19:41:09,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-11-18 19:41:10,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-11-18 19:41:10,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 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-18 19:41:10,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-11-18 19:41:10,017 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 16 [2022-11-18 19:41:10,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:41:10,018 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-11-18 19:41:10,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:41:10,019 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-11-18 19:41:10,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-18 19:41:10,020 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:41:10,021 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:41:10,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 19:41:10,021 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:41:10,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:41:10,022 INFO L85 PathProgramCache]: Analyzing trace with hash 796930410, now seen corresponding path program 1 times [2022-11-18 19:41:10,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:41:10,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946064570] [2022-11-18 19:41:10,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:41:10,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:41:10,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:41:10,233 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-18 19:41:10,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:41:10,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946064570] [2022-11-18 19:41:10,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946064570] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:41:10,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:41:10,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 19:41:10,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438568761] [2022-11-18 19:41:10,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:41:10,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 19:41:10,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:41:10,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 19:41:10,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-18 19:41:10,238 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:41:10,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:41:10,333 INFO L93 Difference]: Finished difference Result 53 states and 64 transitions. [2022-11-18 19:41:10,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 19:41:10,334 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-18 19:41:10,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:41:10,335 INFO L225 Difference]: With dead ends: 53 [2022-11-18 19:41:10,335 INFO L226 Difference]: Without dead ends: 37 [2022-11-18 19:41:10,335 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-18 19:41:10,337 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 46 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 19:41:10,337 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 17 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 19:41:10,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-11-18 19:41:10,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 27. [2022-11-18 19:41:10,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:41:10,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-11-18 19:41:10,345 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 16 [2022-11-18 19:41:10,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:41:10,346 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-11-18 19:41:10,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:41:10,347 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-11-18 19:41:10,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-18 19:41:10,348 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:41:10,348 INFO L195 NwaCegarLoop]: trace histogram [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-18 19:41:10,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 19:41:10,349 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:41:10,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:41:10,349 INFO L85 PathProgramCache]: Analyzing trace with hash 495241442, now seen corresponding path program 1 times [2022-11-18 19:41:10,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:41:10,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571427634] [2022-11-18 19:41:10,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:41:10,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:41:10,384 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-18 19:41:10,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1764361212] [2022-11-18 19:41:10,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:41:10,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:41:10,385 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7ef82b3-d12c-4868-b30c-b806c85a42c1/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:41:10,391 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7ef82b3-d12c-4868-b30c-b806c85a42c1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:41:10,422 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7ef82b3-d12c-4868-b30c-b806c85a42c1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-18 19:41:10,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:41:10,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 51 conjunts are in the unsatisfiable core [2022-11-18 19:41:10,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:41:10,650 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 10 treesize of output 8 [2022-11-18 19:41:10,667 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-18 19:41:10,702 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-18 19:41:10,811 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 0 case distinctions, treesize of input 36 treesize of output 23 [2022-11-18 19:41:10,928 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 0 case distinctions, treesize of input 36 treesize of output 23 [2022-11-18 19:41:11,123 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 0 case distinctions, treesize of input 84 treesize of output 51 [2022-11-18 19:41:11,312 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-18 19:41:11,312 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:41:12,135 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-18 19:41:12,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:41:12,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571427634] [2022-11-18 19:41:12,136 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-18 19:41:12,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1764361212] [2022-11-18 19:41:12,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1764361212] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 19:41:12,136 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 19:41:12,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 23 [2022-11-18 19:41:12,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276177144] [2022-11-18 19:41:12,137 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 19:41:12,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-18 19:41:12,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:41:12,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-18 19:41:12,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=425, Unknown=0, NotChecked=0, Total=506 [2022-11-18 19:41:12,140 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 23 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 23 states have internal predecessors, (45), 0 states have call successors, (0), 0 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-18 19:41:13,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:41:13,207 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2022-11-18 19:41:13,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-18 19:41:13,209 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 23 states have internal predecessors, (45), 0 states have call successors, (0), 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-18 19:41:13,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:41:13,209 INFO L225 Difference]: With dead ends: 52 [2022-11-18 19:41:13,210 INFO L226 Difference]: Without dead ends: 50 [2022-11-18 19:41:13,210 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=184, Invalid=938, Unknown=0, NotChecked=0, Total=1122 [2022-11-18 19:41:13,211 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 59 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 15 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-18 19:41:13,212 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 130 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 257 Invalid, 0 Unknown, 15 Unchecked, 0.5s Time] [2022-11-18 19:41:13,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-11-18 19:41:13,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 42. [2022-11-18 19:41:13,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 41 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:41:13,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2022-11-18 19:41:13,232 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 24 [2022-11-18 19:41:13,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:41:13,232 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2022-11-18 19:41:13,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 23 states have internal predecessors, (45), 0 states have call successors, (0), 0 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-18 19:41:13,233 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2022-11-18 19:41:13,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-18 19:41:13,234 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:41:13,234 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] [2022-11-18 19:41:13,249 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7ef82b3-d12c-4868-b30c-b806c85a42c1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-18 19:41:13,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7ef82b3-d12c-4868-b30c-b806c85a42c1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:41:13,448 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:41:13,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:41:13,449 INFO L85 PathProgramCache]: Analyzing trace with hash 831040416, now seen corresponding path program 2 times [2022-11-18 19:41:13,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:41:13,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204537637] [2022-11-18 19:41:13,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:41:13,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:41:13,481 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-18 19:41:13,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [347351178] [2022-11-18 19:41:13,481 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 19:41:13,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:41:13,482 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7ef82b3-d12c-4868-b30c-b806c85a42c1/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:41:13,485 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7ef82b3-d12c-4868-b30c-b806c85a42c1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:41:13,488 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7ef82b3-d12c-4868-b30c-b806c85a42c1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-18 19:41:13,561 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 19:41:13,561 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 19:41:13,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-18 19:41:13,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:41:13,624 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-18 19:41:13,625 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:41:13,677 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-18 19:41:13,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:41:13,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204537637] [2022-11-18 19:41:13,678 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-18 19:41:13,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [347351178] [2022-11-18 19:41:13,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [347351178] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 19:41:13,679 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 19:41:13,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-11-18 19:41:13,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905277120] [2022-11-18 19:41:13,680 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 19:41:13,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-18 19:41:13,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:41:13,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-18 19:41:13,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-11-18 19:41:13,682 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 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-18 19:41:13,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:41:13,866 INFO L93 Difference]: Finished difference Result 106 states and 123 transitions. [2022-11-18 19:41:13,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 19:41:13,867 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 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 26 [2022-11-18 19:41:13,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:41:13,868 INFO L225 Difference]: With dead ends: 106 [2022-11-18 19:41:13,868 INFO L226 Difference]: Without dead ends: 61 [2022-11-18 19:41:13,869 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-11-18 19:41:13,870 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 61 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 19:41:13,870 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 50 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 19:41:13,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-11-18 19:41:13,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 42. [2022-11-18 19:41:13,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.170731707317073) internal successors, (48), 41 states have internal predecessors, (48), 0 states have call successors, (0), 0 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-18 19:41:13,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2022-11-18 19:41:13,887 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 26 [2022-11-18 19:41:13,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:41:13,887 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2022-11-18 19:41:13,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 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-18 19:41:13,888 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2022-11-18 19:41:13,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-18 19:41:13,889 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:41:13,890 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] [2022-11-18 19:41:13,899 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7ef82b3-d12c-4868-b30c-b806c85a42c1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-18 19:41:14,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7ef82b3-d12c-4868-b30c-b806c85a42c1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:41:14,096 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:41:14,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:41:14,096 INFO L85 PathProgramCache]: Analyzing trace with hash -756951010, now seen corresponding path program 3 times [2022-11-18 19:41:14,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:41:14,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517541212] [2022-11-18 19:41:14,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:41:14,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:41:14,115 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-18 19:41:14,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1281414402] [2022-11-18 19:41:14,116 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-18 19:41:14,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:41:14,116 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7ef82b3-d12c-4868-b30c-b806c85a42c1/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:41:14,124 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7ef82b3-d12c-4868-b30c-b806c85a42c1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:41:14,129 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7ef82b3-d12c-4868-b30c-b806c85a42c1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-18 19:41:14,224 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-18 19:41:14,225 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 19:41:14,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-18 19:41:14,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:41:14,303 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-18 19:41:14,304 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:41:14,371 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-18 19:41:14,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:41:14,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517541212] [2022-11-18 19:41:14,371 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-18 19:41:14,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1281414402] [2022-11-18 19:41:14,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1281414402] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 19:41:14,372 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 19:41:14,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-11-18 19:41:14,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340453744] [2022-11-18 19:41:14,373 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 19:41:14,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-18 19:41:14,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:41:14,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-18 19:41:14,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-11-18 19:41:14,374 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 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-18 19:41:14,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:41:14,570 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2022-11-18 19:41:14,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 19:41:14,571 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 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 28 [2022-11-18 19:41:14,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:41:14,574 INFO L225 Difference]: With dead ends: 59 [2022-11-18 19:41:14,574 INFO L226 Difference]: Without dead ends: 50 [2022-11-18 19:41:14,575 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2022-11-18 19:41:14,577 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 79 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 19:41:14,578 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 39 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 19:41:14,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-11-18 19:41:14,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 35. [2022-11-18 19:41:14,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 34 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:41:14,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2022-11-18 19:41:14,592 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 28 [2022-11-18 19:41:14,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:41:14,593 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2022-11-18 19:41:14,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 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-18 19:41:14,593 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-11-18 19:41:14,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-18 19:41:14,594 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:41:14,595 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:41:14,607 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7ef82b3-d12c-4868-b30c-b806c85a42c1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-18 19:41:14,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7ef82b3-d12c-4868-b30c-b806c85a42c1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:41:14,807 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:41:14,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:41:14,808 INFO L85 PathProgramCache]: Analyzing trace with hash -826292134, now seen corresponding path program 4 times [2022-11-18 19:41:14,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:41:14,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809861796] [2022-11-18 19:41:14,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:41:14,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:41:14,830 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-18 19:41:14,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1632274689] [2022-11-18 19:41:14,831 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-18 19:41:14,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:41:14,831 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7ef82b3-d12c-4868-b30c-b806c85a42c1/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:41:14,832 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7ef82b3-d12c-4868-b30c-b806c85a42c1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:41:14,851 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7ef82b3-d12c-4868-b30c-b806c85a42c1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-18 19:41:15,031 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-18 19:41:15,031 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 19:41:15,034 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 74 conjunts are in the unsatisfiable core [2022-11-18 19:41:15,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:41:15,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 10 treesize of output 8 [2022-11-18 19:41:15,066 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-18 19:41:15,090 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-18 19:41:15,162 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 35 treesize of output 37 [2022-11-18 19:41:15,392 INFO L321 Elim1Store]: treesize reduction 26, result has 3.7 percent of original size [2022-11-18 19:41:15,392 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 53 [2022-11-18 19:41:15,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:41:15,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:41:15,533 INFO L321 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-11-18 19:41:15,533 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 60 [2022-11-18 19:41:15,906 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 19:41:15,907 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 19:41:15,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:41:15,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:41:15,912 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 19:41:15,943 INFO L321 Elim1Store]: treesize reduction 48, result has 22.6 percent of original size [2022-11-18 19:41:15,944 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 6 new quantified variables, introduced 16 case distinctions, treesize of input 72 treesize of output 81 [2022-11-18 19:41:16,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:41:16,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:41:16,126 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 19:41:16,127 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 19:41:16,134 INFO L321 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-11-18 19:41:16,135 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 75 treesize of output 60 [2022-11-18 19:41:16,399 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 19:41:16,400 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 19:41:16,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:41:16,424 INFO L321 Elim1Store]: treesize reduction 32, result has 25.6 percent of original size [2022-11-18 19:41:16,424 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 4 new quantified variables, introduced 7 case distinctions, treesize of input 310 treesize of output 160 [2022-11-18 19:41:16,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:41:16,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:41:16,683 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 19:41:16,687 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-18 19:41:16,687 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 46 [2022-11-18 19:41:16,898 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 19:41:16,910 INFO L321 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-11-18 19:41:16,911 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 36 [2022-11-18 19:41:16,948 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:41:16,949 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:41:26,129 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:41:26,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:41:26,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809861796] [2022-11-18 19:41:26,129 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-18 19:41:26,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1632274689] [2022-11-18 19:41:26,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1632274689] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 19:41:26,130 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 19:41:26,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 46 [2022-11-18 19:41:26,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303984371] [2022-11-18 19:41:26,130 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 19:41:26,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-11-18 19:41:26,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:41:26,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-11-18 19:41:26,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=1792, Unknown=0, NotChecked=0, Total=2070 [2022-11-18 19:41:26,133 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 46 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 46 states have internal predecessors, (59), 0 states have call successors, (0), 0 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-18 19:41:58,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:41:58,523 INFO L93 Difference]: Finished difference Result 74 states and 84 transitions. [2022-11-18 19:41:58,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-11-18 19:41:58,524 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 46 states have internal predecessors, (59), 0 states have call successors, (0), 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-18 19:41:58,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:41:58,525 INFO L225 Difference]: With dead ends: 74 [2022-11-18 19:41:58,525 INFO L226 Difference]: Without dead ends: 72 [2022-11-18 19:41:58,527 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 962 ImplicationChecksByTransitivity, 40.4s TimeCoverageRelationStatistics Valid=457, Invalid=3201, Unknown=2, NotChecked=0, Total=3660 [2022-11-18 19:41:58,528 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 22 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 138 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-18 19:41:58,528 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 240 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 140 Invalid, 0 Unknown, 138 Unchecked, 1.2s Time] [2022-11-18 19:41:58,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-11-18 19:41:58,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 60. [2022-11-18 19:41:58,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.1694915254237288) internal successors, (69), 59 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-18 19:41:58,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 69 transitions. [2022-11-18 19:41:58,544 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 69 transitions. Word has length 32 [2022-11-18 19:41:58,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:41:58,544 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 69 transitions. [2022-11-18 19:41:58,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 46 states have internal predecessors, (59), 0 states have call successors, (0), 0 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-18 19:41:58,545 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions. [2022-11-18 19:41:58,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-18 19:41:58,546 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:41:58,546 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:41:58,556 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7ef82b3-d12c-4868-b30c-b806c85a42c1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-11-18 19:41:58,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7ef82b3-d12c-4868-b30c-b806c85a42c1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:41:58,747 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:41:58,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:41:58,747 INFO L85 PathProgramCache]: Analyzing trace with hash 332676504, now seen corresponding path program 5 times [2022-11-18 19:41:58,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:41:58,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271179991] [2022-11-18 19:41:58,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:41:58,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:41:58,767 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-18 19:41:58,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [807368305] [2022-11-18 19:41:58,767 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-18 19:41:58,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:41:58,768 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7ef82b3-d12c-4868-b30c-b806c85a42c1/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:41:58,769 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7ef82b3-d12c-4868-b30c-b806c85a42c1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:41:58,815 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7ef82b3-d12c-4868-b30c-b806c85a42c1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-18 19:41:58,959 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-11-18 19:41:58,959 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 19:41:58,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-18 19:41:58,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:41:59,034 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-18 19:41:59,035 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:41:59,117 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-18 19:41:59,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:41:59,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271179991] [2022-11-18 19:41:59,118 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-18 19:41:59,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [807368305] [2022-11-18 19:41:59,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [807368305] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 19:41:59,118 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 19:41:59,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2022-11-18 19:41:59,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023396978] [2022-11-18 19:41:59,118 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 19:41:59,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-18 19:41:59,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:41:59,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-18 19:41:59,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-11-18 19:41:59,120 INFO L87 Difference]: Start difference. First operand 60 states and 69 transitions. Second operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 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-18 19:41:59,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:41:59,365 INFO L93 Difference]: Finished difference Result 140 states and 157 transitions. [2022-11-18 19:41:59,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-18 19:41:59,366 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 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 34 [2022-11-18 19:41:59,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:41:59,371 INFO L225 Difference]: With dead ends: 140 [2022-11-18 19:41:59,371 INFO L226 Difference]: Without dead ends: 105 [2022-11-18 19:41:59,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 52 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2022-11-18 19:41:59,374 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 108 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 19:41:59,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 61 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 19:41:59,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-11-18 19:41:59,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 77. [2022-11-18 19:41:59,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 76 states have (on average 1.131578947368421) internal successors, (86), 76 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:41:59,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2022-11-18 19:41:59,411 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 34 [2022-11-18 19:41:59,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:41:59,411 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2022-11-18 19:41:59,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 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-18 19:41:59,412 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2022-11-18 19:41:59,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-18 19:41:59,413 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:41:59,413 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:41:59,423 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7ef82b3-d12c-4868-b30c-b806c85a42c1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-18 19:41:59,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7ef82b3-d12c-4868-b30c-b806c85a42c1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-18 19:41:59,623 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:41:59,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:41:59,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1737020496, now seen corresponding path program 1 times [2022-11-18 19:41:59,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:41:59,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130658546] [2022-11-18 19:41:59,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:41:59,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:41:59,651 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-18 19:41:59,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1044512780] [2022-11-18 19:41:59,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:41:59,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:41:59,652 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7ef82b3-d12c-4868-b30c-b806c85a42c1/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:41:59,659 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7ef82b3-d12c-4868-b30c-b806c85a42c1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:41:59,667 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7ef82b3-d12c-4868-b30c-b806c85a42c1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-18 19:41:59,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:41:59,743 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 79 conjunts are in the unsatisfiable core [2022-11-18 19:41:59,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:41:59,790 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-18 19:41:59,796 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 10 treesize of output 8 [2022-11-18 19:41:59,819 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-18 19:41:59,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:41:59,873 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 28 treesize of output 30 [2022-11-18 19:41:59,965 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 19:41:59,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:41:59,967 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 42 [2022-11-18 19:42:00,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:42:00,056 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 0 case distinctions, treesize of input 50 treesize of output 38 [2022-11-18 19:42:00,195 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 19:42:00,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:42:00,198 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 41 [2022-11-18 19:42:00,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:42:00,297 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 0 case distinctions, treesize of input 63 treesize of output 39 [2022-11-18 19:42:00,486 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 19:42:00,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:42:00,489 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 350 treesize of output 170 [2022-11-18 19:42:00,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:42:00,628 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 0 case distinctions, treesize of input 156 treesize of output 84 [2022-11-18 19:42:01,032 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 74 treesize of output 38 [2022-11-18 19:42:01,068 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:42:01,068 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:42:08,687 WARN L233 SmtUtils]: Spent 6.05s on a formula simplification. DAG size of input: 76 DAG size of output: 55 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 19:43:38,315 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 17 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:43:38,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:43:38,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130658546] [2022-11-18 19:43:38,316 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-18 19:43:38,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1044512780] [2022-11-18 19:43:38,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1044512780] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 19:43:38,316 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 19:43:38,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 44 [2022-11-18 19:43:38,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122240392] [2022-11-18 19:43:38,317 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 19:43:38,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-11-18 19:43:38,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:43:38,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-11-18 19:43:38,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=341, Invalid=1519, Unknown=32, NotChecked=0, Total=1892 [2022-11-18 19:43:38,319 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand has 44 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 44 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-18 19:43:40,592 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse31 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse11 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse10 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse22 (+ .cse31 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse30 (select .cse10 .cse22)) (.cse14 (+ .cse11 1))) (let ((.cse16 (+ .cse31 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse23 (mod .cse30 .cse14)) (.cse1 (store .cse10 .cse22 (+ .cse11 .cse30))) (.cse2 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse9 (select .cse10 .cse2)) (.cse12 (select .cse10 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse1) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse20 (= .cse23 0)) (.cse19 (< .cse30 0)) (.cse17 (select .cse10 .cse16))) (and (let ((.cse0 (mod (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ .cse3 1)))) (or (not (= .cse0 0)) (= (mod (select .cse1 .cse2) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~a~0#1.offset| .cse0)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0))) (let ((.cse7 (+ .cse11 .cse12))) (let ((.cse8 (store .cse10 |c_ULTIMATE.start_main_~a~0#1.offset| .cse7))) (let ((.cse4 (+ .cse9 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse8) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (let ((.cse5 (store .cse8 .cse2 .cse4))) (let ((.cse6 (mod .cse7 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse5) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (= 0 (mod .cse4 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~a~0#1.offset| .cse6)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1))) (not (= .cse6 0)))))))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (<= 0 .cse11) (= |c_ULTIMATE.start_main_~i~0#1| 0) (let ((.cse13 (mod .cse12 .cse14))) (or (not (= .cse13 0)) (= (mod .cse9 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~a~0#1.offset| .cse13)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0))) (let ((.cse15 (store .cse10 .cse16 (mod .cse17 .cse14)))) (or (not (= (select .cse15 |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (= (select .cse15 .cse2) 0))) (let ((.cse18 (let ((.cse21 (store .cse10 .cse22 .cse23))) (store .cse21 .cse16 (mod .cse17 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse21) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))))) (or (= (select .cse18 .cse2) 0) (not (= (select .cse18 |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (and .cse19 (not .cse20)))) (let ((.cse25 (store .cse10 .cse16 (+ .cse11 .cse17)))) (let ((.cse24 (mod (select .cse25 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse25) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (not (= .cse24 0)) (= (mod (select .cse25 .cse2) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse25 |c_ULTIMATE.start_main_~a~0#1.offset| .cse24)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0)))) (let ((.cse26 (store .cse1 .cse16 (+ .cse17 .cse3)))) (let ((.cse27 (mod (select .cse26 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse26) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (= (mod (select .cse26 .cse2) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse26 |c_ULTIMATE.start_main_~a~0#1.offset| .cse27)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0) (not (= .cse27 0))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (or (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (let ((.cse28 (let ((.cse29 (store .cse10 .cse22 (+ .cse11 .cse23 1)))) (store .cse29 .cse16 (mod .cse17 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse29) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))))) (or .cse20 (= (select .cse28 .cse2) 0) (not .cse19) (not (= (select .cse28 |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))))))))) is different from false [2022-11-18 19:43:56,882 WARN L233 SmtUtils]: Spent 6.03s on a formula simplification. DAG size of input: 130 DAG size of output: 75 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 19:44:04,417 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse34 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse40 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse11 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse37 (+ .cse40 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse12 (select .cse34 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse15 (+ .cse12 1)) (.cse39 (select .cse11 .cse37)) (.cse17 (+ .cse40 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse18 (select .cse11 .cse17)) (.cse3 (store .cse11 .cse37 (+ .cse12 .cse39))) (.cse1 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse38 (mod .cse39 .cse15))) (let ((.cse0 (store .cse11 .cse37 .cse38)) (.cse13 (select .cse11 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse10 (select .cse11 .cse1)) (.cse4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse3) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse24 (+ .cse12 .cse18)) (.cse21 (= .cse38 0)) (.cse20 (< .cse39 0))) (and (or (= (select .cse0 .cse1) 0) (not (= (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 0))) (let ((.cse2 (mod (select .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ .cse4 1)))) (or (not (= .cse2 0)) (= (mod (select .cse3 .cse1) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~a~0#1.offset| .cse2)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0))) (let ((.cse8 (+ .cse12 .cse13))) (let ((.cse9 (store .cse11 |c_ULTIMATE.start_main_~a~0#1.offset| .cse8))) (let ((.cse5 (+ .cse10 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse9) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (let ((.cse6 (store .cse9 .cse1 .cse5))) (let ((.cse7 (mod .cse8 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse6) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (= 0 (mod .cse5 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~a~0#1.offset| .cse7)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1))) (not (= .cse7 0)))))))) (let ((.cse14 (mod .cse13 .cse15))) (or (not (= .cse14 0)) (= (mod .cse10 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~a~0#1.offset| .cse14)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0))) (let ((.cse16 (store .cse11 .cse17 (mod .cse18 .cse15)))) (or (not (= (select .cse16 |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (= (select .cse16 .cse1) 0))) (let ((.cse19 (store .cse0 .cse17 (mod .cse18 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse0) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1))))) (or (= (select .cse19 .cse1) 0) (not (= (select .cse19 |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (and .cse20 (not .cse21)))) (or (not (= 0 .cse13)) (= .cse10 0)) (let ((.cse23 (store .cse11 .cse17 .cse24))) (let ((.cse22 (mod (select .cse23 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse23) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (not (= .cse22 0)) (= (mod (select .cse23 .cse1) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse23 |c_ULTIMATE.start_main_~a~0#1.offset| .cse22)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0)))) (let ((.cse25 (store .cse3 .cse17 (+ .cse18 .cse4)))) (let ((.cse26 (mod (select .cse25 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse25) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (= (mod (select .cse25 .cse1) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse25 |c_ULTIMATE.start_main_~a~0#1.offset| .cse26)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0) (not (= .cse26 0))))) (forall ((v_ArrVal_301 Int)) (let ((.cse28 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse34 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_301)))) (let ((.cse33 (select .cse28 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse31 (+ v_ArrVal_301 (select .cse33 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse32 (store .cse33 |c_ULTIMATE.start_main_~a~0#1.offset| .cse31))) (let ((.cse27 (+ (select (select (store .cse28 |c_ULTIMATE.start_main_~a~0#1.base| .cse32) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse33 .cse1)))) (let ((.cse29 (store .cse32 .cse1 .cse27))) (let ((.cse30 (mod .cse31 (+ (select (select (store .cse28 |c_ULTIMATE.start_main_~a~0#1.base| .cse29) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (= (mod .cse27 (+ 1 (select (select (store .cse28 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse29 |c_ULTIMATE.start_main_~a~0#1.offset| .cse30)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) 0) (not (<= .cse24 v_ArrVal_301)) (not (= .cse30 0))))))))))) (let ((.cse35 (let ((.cse36 (store .cse11 .cse37 (+ .cse12 .cse38 1)))) (store .cse36 .cse17 (mod .cse18 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse36) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))))) (or .cse21 (= (select .cse35 .cse1) 0) (not .cse20) (not (= (select .cse35 |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))))))))) is different from false [2022-11-18 19:45:16,790 WARN L233 SmtUtils]: Spent 10.69s on a formula simplification that was a NOOP. DAG size: 66 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 19:45:17,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:45:17,357 INFO L93 Difference]: Finished difference Result 111 states and 124 transitions. [2022-11-18 19:45:17,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-11-18 19:45:17,358 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 44 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 36 [2022-11-18 19:45:17,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:45:17,360 INFO L225 Difference]: With dead ends: 111 [2022-11-18 19:45:17,360 INFO L226 Difference]: Without dead ends: 80 [2022-11-18 19:45:17,362 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 990 ImplicationChecksByTransitivity, 186.0s TimeCoverageRelationStatistics Valid=676, Invalid=2825, Unknown=47, NotChecked=234, Total=3782 [2022-11-18 19:45:17,362 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 118 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 322 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2022-11-18 19:45:17,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 144 Invalid, 878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 427 Invalid, 0 Unknown, 322 Unchecked, 8.2s Time] [2022-11-18 19:45:17,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-11-18 19:45:17,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 73. [2022-11-18 19:45:17,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 72 states have (on average 1.1527777777777777) internal successors, (83), 72 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-18 19:45:17,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 83 transitions. [2022-11-18 19:45:17,383 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 83 transitions. Word has length 36 [2022-11-18 19:45:17,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:45:17,383 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 83 transitions. [2022-11-18 19:45:17,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 44 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-18 19:45:17,384 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 83 transitions. [2022-11-18 19:45:17,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-18 19:45:17,384 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:45:17,385 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:45:17,391 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7ef82b3-d12c-4868-b30c-b806c85a42c1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-11-18 19:45:17,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7ef82b3-d12c-4868-b30c-b806c85a42c1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:45:17,591 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:45:17,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:45:17,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1245131882, now seen corresponding path program 6 times [2022-11-18 19:45:17,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:45:17,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309750987] [2022-11-18 19:45:17,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:45:17,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:45:17,615 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-18 19:45:17,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1406680654] [2022-11-18 19:45:17,615 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-18 19:45:17,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:45:17,616 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7ef82b3-d12c-4868-b30c-b806c85a42c1/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:45:17,617 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7ef82b3-d12c-4868-b30c-b806c85a42c1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:45:17,630 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7ef82b3-d12c-4868-b30c-b806c85a42c1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-18 19:45:17,724 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-11-18 19:45:17,724 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 19:45:17,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-18 19:45:17,727 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:45:17,836 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-18 19:45:17,836 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:45:17,929 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-18 19:45:17,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:45:17,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309750987] [2022-11-18 19:45:17,930 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-18 19:45:17,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1406680654] [2022-11-18 19:45:17,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1406680654] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 19:45:17,930 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 19:45:17,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2022-11-18 19:45:17,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537264361] [2022-11-18 19:45:17,930 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 19:45:17,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-18 19:45:17,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:45:17,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-18 19:45:17,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-11-18 19:45:17,932 INFO L87 Difference]: Start difference. First operand 73 states and 83 transitions. Second operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 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-18 19:45:18,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:45:18,180 INFO L93 Difference]: Finished difference Result 95 states and 104 transitions. [2022-11-18 19:45:18,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-18 19:45:18,181 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 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 36 [2022-11-18 19:45:18,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:45:18,181 INFO L225 Difference]: With dead ends: 95 [2022-11-18 19:45:18,181 INFO L226 Difference]: Without dead ends: 73 [2022-11-18 19:45:18,182 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 56 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2022-11-18 19:45:18,182 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 117 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 19:45:18,183 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 66 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 19:45:18,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-11-18 19:45:18,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 43. [2022-11-18 19:45:18,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.119047619047619) internal successors, (47), 42 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-18 19:45:18,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2022-11-18 19:45:18,195 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 36 [2022-11-18 19:45:18,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:45:18,196 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2022-11-18 19:45:18,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 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-18 19:45:18,196 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-11-18 19:45:18,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-18 19:45:18,197 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:45:18,197 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:45:18,212 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7ef82b3-d12c-4868-b30c-b806c85a42c1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-11-18 19:45:18,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7ef82b3-d12c-4868-b30c-b806c85a42c1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:45:18,403 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:45:18,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:45:18,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1201221586, now seen corresponding path program 7 times [2022-11-18 19:45:18,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:45:18,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233755289] [2022-11-18 19:45:18,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:45:18,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:45:18,420 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-18 19:45:18,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2100907744] [2022-11-18 19:45:18,420 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-18 19:45:18,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:45:18,420 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7ef82b3-d12c-4868-b30c-b806c85a42c1/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:45:18,421 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7ef82b3-d12c-4868-b30c-b806c85a42c1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:45:18,437 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7ef82b3-d12c-4868-b30c-b806c85a42c1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-18 19:45:18,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:45:18,546 WARN L261 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 95 conjunts are in the unsatisfiable core [2022-11-18 19:45:18,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:45:18,581 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 10 treesize of output 8 [2022-11-18 19:45:18,586 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-18 19:45:18,619 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-18 19:45:18,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:45:18,675 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 30 treesize of output 32 [2022-11-18 19:45:18,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:45:18,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:45:18,763 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 37 treesize of output 42 [2022-11-18 19:45:18,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:45:18,901 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 19:45:18,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:45:18,905 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-18 19:45:19,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:45:19,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:45:19,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:45:19,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:45:19,020 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 19:45:19,022 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 49 [2022-11-18 19:45:19,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:45:19,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:45:19,143 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 64 treesize of output 49 [2022-11-18 19:45:19,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:45:19,321 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 19:45:19,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:45:19,323 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 56 [2022-11-18 19:45:19,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:45:19,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:45:19,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:45:19,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:45:19,473 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 19:45:19,474 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 53 [2022-11-18 19:45:19,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:45:19,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:45:19,660 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 76 treesize of output 53 [2022-11-18 19:45:19,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:45:19,838 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 19:45:19,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:45:19,842 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 159 treesize of output 92 [2022-11-18 19:45:20,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:45:20,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:45:20,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:45:20,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:45:20,128 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 19:45:20,133 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 56 treesize of output 51 [2022-11-18 19:45:20,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:45:20,391 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 0 case distinctions, treesize of input 45 treesize of output 37 [2022-11-18 19:45:20,710 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 47 treesize of output 27 [2022-11-18 19:45:20,761 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:45:20,761 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:46:06,239 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:46:06,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:46:06,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233755289] [2022-11-18 19:46:06,240 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-18 19:46:06,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2100907744] [2022-11-18 19:46:06,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2100907744] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 19:46:06,240 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 19:46:06,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28] total 55 [2022-11-18 19:46:06,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485742575] [2022-11-18 19:46:06,241 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 19:46:06,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-11-18 19:46:06,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:46:06,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-11-18 19:46:06,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=337, Invalid=2633, Unknown=0, NotChecked=0, Total=2970 [2022-11-18 19:46:06,243 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand has 55 states, 55 states have (on average 1.4) internal successors, (77), 55 states have internal predecessors, (77), 0 states have call successors, (0), 0 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-18 19:46:46,517 WARN L233 SmtUtils]: Spent 9.88s on a formula simplification that was a NOOP. DAG size: 53 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 19:46:55,697 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse47 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse45 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse46 (+ .cse47 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse30 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse44 (+ .cse47 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse29 (store .cse30 .cse44 1)) (.cse0 (store .cse30 .cse46 (+ .cse45 (select .cse30 .cse46))))) (let ((.cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse0) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse17 (+ .cse47 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse5 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse8 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse16 (store .cse29 .cse46 1))) (and (= (mod (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ .cse1 1)) 0) (= (let ((.cse15 (store .cse16 .cse17 1))) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse15))) (let ((.cse14 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse9 (select .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse10 (select .cse15 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse11 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (let ((.cse12 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse10 .cse11))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (let ((.cse3 (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse10 .cse11 .cse12))))) (let ((.cse6 (select .cse3 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse2 (+ .cse9 .cse10 .cse11 .cse12 (select .cse6 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (mod .cse2 (+ (select (select (store .cse3 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse4 (let ((.cse7 (store .cse6 |c_ULTIMATE.start_main_~a~0#1.offset| .cse2))) (store .cse7 .cse8 (+ (select .cse6 .cse8) (select (select (store .cse3 |c_ULTIMATE.start_main_~a~0#1.base| .cse7) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))) (store .cse4 .cse5 (+ (select .cse6 .cse5) (select (select (store .cse3 |c_ULTIMATE.start_main_~a~0#1.base| .cse4) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1))))))))))) 0) (= (let ((.cse27 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse29))) (let ((.cse28 (select .cse27 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse23 (select .cse28 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse26 (select .cse29 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse25 (select (select (store .cse27 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse23 .cse26))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (let ((.cse24 (select (select (store .cse27 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse23 .cse25 .cse26))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (let ((.cse19 (store .cse27 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse23 .cse24 .cse25 .cse26))))) (let ((.cse21 (select .cse19 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse18 (+ .cse23 .cse24 (select .cse21 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse25 .cse26))) (mod .cse18 (+ (select (select (store .cse19 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse20 (let ((.cse22 (store .cse21 |c_ULTIMATE.start_main_~a~0#1.offset| .cse18))) (store .cse22 .cse8 (+ (select (select (store .cse19 |c_ULTIMATE.start_main_~a~0#1.base| .cse22) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse21 .cse8)))))) (store .cse20 .cse5 (+ (select (select (store .cse19 |c_ULTIMATE.start_main_~a~0#1.base| .cse20) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse21 .cse5))))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))))))))) 0) (= (select .cse30 .cse8) 4) (= (let ((.cse31 (store .cse0 .cse17 (+ .cse1 (select .cse30 .cse17))))) (mod (select .cse31 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse31) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1))) 0) (= |c_ULTIMATE.start_main_~i~0#1| 0) (= (select .cse30 .cse5) 4) (= (let ((.cse41 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse16))) (let ((.cse42 (select .cse41 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse37 (select .cse42 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse38 (select .cse16 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse40 (select (select (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse37 .cse38))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (let ((.cse39 (select (select (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse37 .cse38 .cse40))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (let ((.cse33 (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse37 .cse38 .cse39 .cse40))))) (let ((.cse35 (select .cse33 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse32 (+ .cse37 .cse38 .cse39 (select .cse35 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse40))) (mod .cse32 (+ (select (select (store .cse33 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse34 (let ((.cse36 (store .cse35 |c_ULTIMATE.start_main_~a~0#1.offset| .cse32))) (store .cse36 .cse8 (+ (select .cse35 .cse8) (select (select (store .cse33 |c_ULTIMATE.start_main_~a~0#1.base| .cse36) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))) (store .cse34 .cse5 (+ (select (select (store .cse33 |c_ULTIMATE.start_main_~a~0#1.base| .cse34) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse35 .cse5))))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))))))))) 0) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (or (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse43 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (and (= .cse43 3) (= (select .cse30 .cse44) (mod 4 (+ .cse43 1))) (not (= |ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))))) (= (mod (select .cse30 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ .cse45 1)) 0)))))) is different from true [2022-11-18 19:46:58,021 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-11-18 19:47:03,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:47:03,106 INFO L93 Difference]: Finished difference Result 89 states and 101 transitions. [2022-11-18 19:47:03,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-11-18 19:47:03,107 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 1.4) internal successors, (77), 55 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2022-11-18 19:47:03,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:47:03,108 INFO L225 Difference]: With dead ends: 89 [2022-11-18 19:47:03,108 INFO L226 Difference]: Without dead ends: 87 [2022-11-18 19:47:03,111 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1420 ImplicationChecksByTransitivity, 89.7s TimeCoverageRelationStatistics Valid=780, Invalid=6361, Unknown=3, NotChecked=166, Total=7310 [2022-11-18 19:47:03,111 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 99 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 229 IncrementalHoareTripleChecker+Unchecked, 13.1s IncrementalHoareTripleChecker+Time [2022-11-18 19:47:03,112 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 191 Invalid, 983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 608 Invalid, 0 Unknown, 229 Unchecked, 13.1s Time] [2022-11-18 19:47:03,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-11-18 19:47:03,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 78. [2022-11-18 19:47:03,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 77 states have (on average 1.155844155844156) internal successors, (89), 77 states have internal predecessors, (89), 0 states have call successors, (0), 0 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-18 19:47:03,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 89 transitions. [2022-11-18 19:47:03,133 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 89 transitions. Word has length 40 [2022-11-18 19:47:03,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:47:03,134 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 89 transitions. [2022-11-18 19:47:03,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 1.4) internal successors, (77), 55 states have internal predecessors, (77), 0 states have call successors, (0), 0 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-18 19:47:03,135 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 89 transitions. [2022-11-18 19:47:03,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-18 19:47:03,136 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:47:03,136 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:47:03,142 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7ef82b3-d12c-4868-b30c-b806c85a42c1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-11-18 19:47:03,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7ef82b3-d12c-4868-b30c-b806c85a42c1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:47:03,342 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:47:03,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:47:03,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1012369648, now seen corresponding path program 8 times [2022-11-18 19:47:03,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:47:03,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234008434] [2022-11-18 19:47:03,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:47:03,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:47:03,377 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-18 19:47:03,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [409667198] [2022-11-18 19:47:03,377 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 19:47:03,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:47:03,378 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7ef82b3-d12c-4868-b30c-b806c85a42c1/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:47:03,379 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7ef82b3-d12c-4868-b30c-b806c85a42c1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:47:03,387 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7ef82b3-d12c-4868-b30c-b806c85a42c1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-18 19:47:03,528 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 19:47:03,528 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 19:47:03,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-18 19:47:03,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:47:03,674 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-18 19:47:03,674 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:47:03,780 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-18 19:47:03,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:47:03,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234008434] [2022-11-18 19:47:03,780 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-18 19:47:03,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [409667198] [2022-11-18 19:47:03,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [409667198] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 19:47:03,781 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 19:47:03,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2022-11-18 19:47:03,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432410597] [2022-11-18 19:47:03,781 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 19:47:03,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-18 19:47:03,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:47:03,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-18 19:47:03,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2022-11-18 19:47:03,783 INFO L87 Difference]: Start difference. First operand 78 states and 89 transitions. Second operand has 15 states, 15 states have (on average 2.8) internal successors, (42), 15 states have internal predecessors, (42), 0 states have call successors, (0), 0 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-18 19:47:04,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:47:04,183 INFO L93 Difference]: Finished difference Result 178 states and 197 transitions. [2022-11-18 19:47:04,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-18 19:47:04,183 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.8) internal successors, (42), 15 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-11-18 19:47:04,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:47:04,185 INFO L225 Difference]: With dead ends: 178 [2022-11-18 19:47:04,185 INFO L226 Difference]: Without dead ends: 133 [2022-11-18 19:47:04,186 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 64 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2022-11-18 19:47:04,186 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 204 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 19:47:04,187 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 77 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 19:47:04,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-11-18 19:47:04,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 97. [2022-11-18 19:47:04,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 96 states have (on average 1.1145833333333333) internal successors, (107), 96 states have internal predecessors, (107), 0 states have call successors, (0), 0 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-18 19:47:04,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 107 transitions. [2022-11-18 19:47:04,228 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 107 transitions. Word has length 42 [2022-11-18 19:47:04,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:47:04,228 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 107 transitions. [2022-11-18 19:47:04,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.8) internal successors, (42), 15 states have internal predecessors, (42), 0 states have call successors, (0), 0 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-18 19:47:04,228 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 107 transitions. [2022-11-18 19:47:04,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-18 19:47:04,229 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:47:04,229 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:47:04,235 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7ef82b3-d12c-4868-b30c-b806c85a42c1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-11-18 19:47:04,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7ef82b3-d12c-4868-b30c-b806c85a42c1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:47:04,435 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:47:04,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:47:04,436 INFO L85 PathProgramCache]: Analyzing trace with hash 2112995272, now seen corresponding path program 2 times [2022-11-18 19:47:04,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:47:04,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971957035] [2022-11-18 19:47:04,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:47:04,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:47:04,458 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-18 19:47:04,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [900748197] [2022-11-18 19:47:04,459 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 19:47:04,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:47:04,459 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7ef82b3-d12c-4868-b30c-b806c85a42c1/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:47:04,460 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7ef82b3-d12c-4868-b30c-b806c85a42c1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:47:04,464 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7ef82b3-d12c-4868-b30c-b806c85a42c1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-18 19:47:04,593 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 19:47:04,593 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 19:47:04,596 WARN L261 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 99 conjunts are in the unsatisfiable core [2022-11-18 19:47:04,602 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:47:04,635 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-18 19:47:04,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:47:04,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 23 treesize of output 22 [2022-11-18 19:47:04,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:47:04,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:47:04,757 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 30 treesize of output 32 [2022-11-18 19:47:04,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:47:04,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:47:04,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:47:04,862 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 37 treesize of output 42 [2022-11-18 19:47:05,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:47:05,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:47:05,031 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 19:47:05,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:47:05,034 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-18 19:47:05,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:47:05,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:47:05,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:47:05,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:47:05,176 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 19:47:05,178 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 54 [2022-11-18 19:47:05,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:47:05,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:47:05,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:47:05,355 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 62 treesize of output 49 [2022-11-18 19:47:05,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:47:05,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:47:05,566 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 19:47:05,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:47:05,571 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 53 [2022-11-18 19:47:05,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:47:05,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:47:05,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:47:05,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:47:05,745 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 19:47:05,746 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 54 [2022-11-18 19:47:05,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:47:05,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:47:05,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:47:05,939 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 52 treesize of output 47 [2022-11-18 19:47:06,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:47:06,178 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 19:47:06,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:47:06,181 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 150 treesize of output 80 [2022-11-18 19:47:06,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:47:06,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:47:06,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:47:06,399 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 19:47:06,400 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 158 treesize of output 82 [2022-11-18 19:47:06,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:47:06,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:47:06,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:47:06,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:47:06,631 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 39 treesize of output 44 [2022-11-18 19:47:07,199 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:47:07,200 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:47:20,653 WARN L233 SmtUtils]: Spent 8.57s on a formula simplification. DAG size of input: 93 DAG size of output: 67 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 19:49:14,095 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 35 refuted. 3 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:49:14,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:49:14,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971957035] [2022-11-18 19:49:14,096 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-18 19:49:14,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [900748197] [2022-11-18 19:49:14,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [900748197] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 19:49:14,096 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 19:49:14,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 31] total 59 [2022-11-18 19:49:14,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013376349] [2022-11-18 19:49:14,096 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 19:49:14,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-11-18 19:49:14,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:49:14,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-11-18 19:49:14,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=627, Invalid=2765, Unknown=30, NotChecked=0, Total=3422 [2022-11-18 19:49:14,099 INFO L87 Difference]: Start difference. First operand 97 states and 107 transitions. Second operand has 59 states, 59 states have (on average 1.4406779661016949) internal successors, (85), 59 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-18 19:50:11,785 WARN L233 SmtUtils]: Spent 5.91s on a formula simplification that was a NOOP. DAG size: 179 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 19:54:16,382 WARN L233 SmtUtils]: Spent 7.02s on a formula simplification that was a NOOP. DAG size: 87 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 19:54:23,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:54:23,876 INFO L93 Difference]: Finished difference Result 162 states and 177 transitions. [2022-11-18 19:54:23,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-11-18 19:54:23,877 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 59 states have (on average 1.4406779661016949) internal successors, (85), 59 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 44 [2022-11-18 19:54:23,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:54:23,878 INFO L225 Difference]: With dead ends: 162 [2022-11-18 19:54:23,878 INFO L226 Difference]: Without dead ends: 160 [2022-11-18 19:54:23,881 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1930 ImplicationChecksByTransitivity, 432.1s TimeCoverageRelationStatistics Valid=1612, Invalid=8362, Unknown=126, NotChecked=0, Total=10100 [2022-11-18 19:54:23,882 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 170 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 1260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 946 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-18 19:54:23,882 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 193 Invalid, 1260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 282 Invalid, 0 Unknown, 946 Unchecked, 0.4s Time] [2022-11-18 19:54:23,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-11-18 19:54:23,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 134. [2022-11-18 19:54:23,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 133 states have (on average 1.112781954887218) internal successors, (148), 133 states have internal predecessors, (148), 0 states have call successors, (0), 0 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-18 19:54:23,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 148 transitions. [2022-11-18 19:54:23,930 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 148 transitions. Word has length 44 [2022-11-18 19:54:23,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:54:23,930 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 148 transitions. [2022-11-18 19:54:23,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 59 states have (on average 1.4406779661016949) internal successors, (85), 59 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-18 19:54:23,931 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 148 transitions. [2022-11-18 19:54:23,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-18 19:54:23,932 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:54:23,932 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:54:23,938 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7ef82b3-d12c-4868-b30c-b806c85a42c1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-18 19:54:24,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7ef82b3-d12c-4868-b30c-b806c85a42c1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:54:24,135 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:54:24,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:54:24,135 INFO L85 PathProgramCache]: Analyzing trace with hash -22665458, now seen corresponding path program 9 times [2022-11-18 19:54:24,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:54:24,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171467592] [2022-11-18 19:54:24,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:54:24,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:54:24,158 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-18 19:54:24,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1715172255] [2022-11-18 19:54:24,159 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-18 19:54:24,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:54:24,159 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7ef82b3-d12c-4868-b30c-b806c85a42c1/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:54:24,161 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7ef82b3-d12c-4868-b30c-b806c85a42c1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:54:24,202 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7ef82b3-d12c-4868-b30c-b806c85a42c1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-18 19:54:24,543 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-11-18 19:54:24,543 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 19:54:24,546 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-18 19:54:24,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:54:24,700 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-18 19:54:24,700 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:54:24,823 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-18 19:54:24,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:54:24,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171467592] [2022-11-18 19:54:24,824 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-18 19:54:24,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1715172255] [2022-11-18 19:54:24,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1715172255] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 19:54:24,824 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 19:54:24,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2022-11-18 19:54:24,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232966455] [2022-11-18 19:54:24,824 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 19:54:24,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-18 19:54:24,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:54:24,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-18 19:54:24,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2022-11-18 19:54:24,826 INFO L87 Difference]: Start difference. First operand 134 states and 148 transitions. Second operand has 15 states, 15 states have (on average 2.8) internal successors, (42), 15 states have internal predecessors, (42), 0 states have call successors, (0), 0 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-18 19:54:25,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:54:25,425 INFO L93 Difference]: Finished difference Result 192 states and 204 transitions. [2022-11-18 19:54:25,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-18 19:54:25,425 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.8) internal successors, (42), 15 states have internal predecessors, (42), 0 states have call successors, (0), 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 44 [2022-11-18 19:54:25,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:54:25,426 INFO L225 Difference]: With dead ends: 192 [2022-11-18 19:54:25,427 INFO L226 Difference]: Without dead ends: 129 [2022-11-18 19:54:25,427 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 73 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=149, Invalid=403, Unknown=0, NotChecked=0, Total=552 [2022-11-18 19:54:25,428 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 164 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-18 19:54:25,428 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 119 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-18 19:54:25,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-11-18 19:54:25,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 86. [2022-11-18 19:54:25,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 85 states have (on average 1.0705882352941176) internal successors, (91), 85 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-18 19:54:25,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2022-11-18 19:54:25,464 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 44 [2022-11-18 19:54:25,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:54:25,464 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2022-11-18 19:54:25,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.8) internal successors, (42), 15 states have internal predecessors, (42), 0 states have call successors, (0), 0 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-18 19:54:25,465 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2022-11-18 19:54:25,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-18 19:54:25,466 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:54:25,466 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:54:25,472 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7ef82b3-d12c-4868-b30c-b806c85a42c1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-18 19:54:25,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7ef82b3-d12c-4868-b30c-b806c85a42c1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-18 19:54:25,666 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:54:25,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:54:25,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1258986306, now seen corresponding path program 3 times [2022-11-18 19:54:25,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:54:25,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336697850] [2022-11-18 19:54:25,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:54:25,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:54:25,696 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-18 19:54:25,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [31517237] [2022-11-18 19:54:25,698 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-18 19:54:25,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:54:25,698 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7ef82b3-d12c-4868-b30c-b806c85a42c1/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:54:25,699 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7ef82b3-d12c-4868-b30c-b806c85a42c1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:54:25,708 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7ef82b3-d12c-4868-b30c-b806c85a42c1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-18 19:54:25,911 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-18 19:54:25,911 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 19:54:25,914 WARN L261 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 105 conjunts are in the unsatisfiable core [2022-11-18 19:54:25,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:54:25,933 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-18 19:54:25,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:54:25,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 23 treesize of output 22 [2022-11-18 19:54:26,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:54:26,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:54:26,038 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 28 treesize of output 30 [2022-11-18 19:54:26,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:54:26,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:54:26,139 INFO L321 Elim1Store]: treesize reduction 42, result has 28.8 percent of original size [2022-11-18 19:54:26,139 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 2 case distinctions, treesize of input 39 treesize of output 44 [2022-11-18 19:54:26,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:54:26,455 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 19:54:26,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:54:26,462 INFO L321 Elim1Store]: treesize reduction 22, result has 4.3 percent of original size [2022-11-18 19:54:26,463 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 53 [2022-11-18 19:54:26,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:54:26,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:54:26,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:54:26,653 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 19:54:26,657 INFO L321 Elim1Store]: treesize reduction 22, result has 4.3 percent of original size [2022-11-18 19:54:26,658 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 51 [2022-11-18 19:54:26,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:54:26,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:54:26,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:54:26,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:54:26,859 INFO L321 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-11-18 19:54:26,859 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 62 [2022-11-18 19:54:27,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:54:27,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:54:27,341 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 19:54:27,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:54:27,376 INFO L321 Elim1Store]: treesize reduction 55, result has 25.7 percent of original size [2022-11-18 19:54:27,377 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 79 treesize of output 73 [2022-11-18 19:54:27,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:54:27,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:54:27,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:54:27,762 INFO L321 Elim1Store]: treesize reduction 40, result has 41.2 percent of original size [2022-11-18 19:54:27,762 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 5 new quantified variables, introduced 4 case distinctions, treesize of input 98 treesize of output 96 [2022-11-18 19:54:28,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:54:28,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:54:28,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:54:28,270 INFO L321 Elim1Store]: treesize reduction 104, result has 50.2 percent of original size [2022-11-18 19:54:28,270 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 106 treesize of output 165 [2022-11-18 19:54:31,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:54:31,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:54:31,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:54:31,769 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 19:54:31,814 INFO L321 Elim1Store]: treesize reduction 40, result has 44.4 percent of original size [2022-11-18 19:54:31,814 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 5 new quantified variables, introduced 4 case distinctions, treesize of input 229 treesize of output 173 [2022-11-18 19:54:33,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:54:33,293 INFO L321 Elim1Store]: treesize reduction 28, result has 50.0 percent of original size [2022-11-18 19:54:33,293 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 411 treesize of output 238 [2022-11-18 19:54:35,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:54:36,611 INFO L321 Elim1Store]: treesize reduction 72, result has 53.2 percent of original size [2022-11-18 19:54:36,612 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 5 new quantified variables, introduced 8 case distinctions, treesize of input 637 treesize of output 393 [2022-11-18 19:54:57,230 WARN L837 $PredicateComparison]: unable to prove that (and (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0) (<= c_~N~0 3) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (let ((.cse8 (* 8 |c_ULTIMATE.start_main_~i~0#1|)) (.cse12 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse14 (select .cse12 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (.cse116 (= .cse8 16))) (let ((.cse31 (not .cse116)) (.cse2 (select .cse12 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|))) (.cse237 (< .cse14 0))) (let ((.cse7 (= .cse8 8)) (.cse6 (< 2 c_~N~0)) (.cse155 (not .cse237)) (.cse64 (<= c_~N~0 2)) (.cse115 (< 1 c_~N~0)) (.cse216 (or .cse31 (= .cse14 .cse2))) (.cse4 (+ 2 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ .cse2 2)) (.cse5 (select .cse12 (+ .cse8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (or (and (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse0 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse3 (+ .cse0 1))) (and (= (* .cse0 2) .cse1) (= .cse2 .cse3) (<= .cse4 |ULTIMATE.start_main_~#sum~0#1.base|) (= .cse5 (mod (mod .cse3 .cse3) .cse3)))))) .cse6 .cse7) (and (let ((.cse23 (< .cse2 0))) (let ((.cse53 (not .cse23))) (or (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (<= .cse4 |ULTIMATE.start_main_~#sum~0#1.base|) (exists ((|v_ULTIMATE.start_main_~i~0#1_239| Int)) (let ((.cse9 (* 8 |v_ULTIMATE.start_main_~i~0#1_239|))) (and (not (= .cse8 .cse9)) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_239| 1)) (not (= 8 .cse9)) (< |v_ULTIMATE.start_main_~i~0#1_239| c_~N~0) (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse13 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse11 (+ .cse13 1))) (and (exists ((v_arrayElimCell_196 Int)) (let ((.cse10 (mod v_arrayElimCell_196 .cse11))) (and (= .cse10 0) (= .cse5 .cse10)))) (not (< .cse11 0)) (= (select .cse12 (+ .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse11) (= .cse13 .cse1) (= .cse14 (mod .cse11 .cse11))))))))))) (and (or (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (exists ((|v_ULTIMATE.start_main_~i~0#1_239| Int)) (let ((.cse15 (* 8 |v_ULTIMATE.start_main_~i~0#1_239|))) (and (not (= .cse8 .cse15)) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_239| 1)) (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse18 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse16 (+ .cse18 1))) (let ((.cse17 (mod .cse2 .cse16))) (and (= (select .cse12 (+ .cse15 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse16) (not (= .cse17 0)) (= .cse5 (+ .cse17 .cse18 1)) (< .cse16 0) (= .cse18 .cse1) (= .cse14 (mod .cse16 .cse16))))))) (not (= 8 .cse15)) (< |v_ULTIMATE.start_main_~i~0#1_239| c_~N~0)))) (<= .cse4 |ULTIMATE.start_main_~#sum~0#1.base|))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (<= .cse4 |ULTIMATE.start_main_~#sum~0#1.base|) (exists ((|v_ULTIMATE.start_main_~i~0#1_239| Int)) (let ((.cse19 (* 8 |v_ULTIMATE.start_main_~i~0#1_239|))) (and (not (= .cse8 .cse19)) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_239| 1)) (not (= 8 .cse19)) (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse22 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse20 (+ .cse22 1))) (let ((.cse21 (mod .cse2 .cse20))) (and (not (< .cse20 0)) (= (select .cse12 (+ .cse19 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse20) (not (= .cse21 0)) (= .cse22 .cse1) (= .cse21 (+ .cse5 .cse22 1)) (= .cse14 (mod .cse20 .cse20))))))) (< |v_ULTIMATE.start_main_~i~0#1_239| c_~N~0))))))) .cse23) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (exists ((|v_ULTIMATE.start_main_~i~0#1_239| Int)) (let ((.cse25 (* 8 |v_ULTIMATE.start_main_~i~0#1_239|))) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse26 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse24 (+ .cse26 1))) (and (not (< .cse24 0)) (= (select .cse12 (+ .cse25 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse24) (= .cse26 .cse1) (exists ((v_arrayElimCell_196 Int)) (and (not (< v_arrayElimCell_196 0)) (= .cse5 (mod v_arrayElimCell_196 .cse24)))) (= .cse14 (mod .cse24 .cse24)))))) (not (= .cse8 .cse25)) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_239| 1)) (not (= 8 .cse25)) (< |v_ULTIMATE.start_main_~i~0#1_239| c_~N~0)))) (<= .cse4 |ULTIMATE.start_main_~#sum~0#1.base|))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (<= .cse4 |ULTIMATE.start_main_~#sum~0#1.base|) (exists ((|v_ULTIMATE.start_main_~i~0#1_239| Int)) (let ((.cse27 (* 8 |v_ULTIMATE.start_main_~i~0#1_239|))) (and (not (= .cse8 .cse27)) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_239| 1)) (not (= 8 .cse27)) (< |v_ULTIMATE.start_main_~i~0#1_239| c_~N~0) (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse30 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse28 (+ .cse30 1))) (let ((.cse29 (mod .cse2 .cse28))) (and (= (select .cse12 (+ .cse27 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse28) (= .cse5 .cse29) (= .cse30 .cse1) (= .cse29 0) (= .cse14 (mod .cse28 .cse28)))))))))))) (and .cse31 (or (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (exists ((|v_ULTIMATE.start_main_~i~0#1_239| Int)) (let ((.cse35 (* 8 |v_ULTIMATE.start_main_~i~0#1_239|))) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse34 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse32 (select .cse12 (+ .cse35 |c_ULTIMATE.start_main_~a~0#1.offset|))) (.cse33 (+ .cse34 1))) (and (= .cse32 .cse33) (= .cse5 (mod .cse32 .cse33)) (< .cse33 0) (= .cse34 .cse1) (= .cse14 (mod .cse33 .cse33)))))) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_239| 1)) (not (= 8 .cse35)) (< |v_ULTIMATE.start_main_~i~0#1_239| c_~N~0)))) (<= .cse4 |ULTIMATE.start_main_~#sum~0#1.base|))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (exists ((|v_ULTIMATE.start_main_~i~0#1_239| Int)) (let ((.cse39 (* 8 |v_ULTIMATE.start_main_~i~0#1_239|))) (let ((.cse36 (select .cse12 (+ .cse39 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (and (not (< .cse36 0)) (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse38 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse37 (+ .cse38 1))) (and (= .cse36 .cse37) (= .cse5 (mod .cse36 .cse37)) (= .cse38 .cse1) (= .cse14 (mod .cse37 .cse37)))))) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_239| 1)) (not (= 8 .cse39)) (< |v_ULTIMATE.start_main_~i~0#1_239| c_~N~0))))) (<= .cse4 |ULTIMATE.start_main_~#sum~0#1.base|))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (exists ((|v_ULTIMATE.start_main_~i~0#1_239| Int)) (let ((.cse44 (* 8 |v_ULTIMATE.start_main_~i~0#1_239|))) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse43 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse41 (select .cse12 (+ .cse44 |c_ULTIMATE.start_main_~a~0#1.offset|))) (.cse40 (+ .cse43 1))) (let ((.cse42 (mod .cse41 .cse40))) (and (not (< .cse40 0)) (= .cse41 .cse40) (= .cse5 .cse42) (= 0 .cse42) (= .cse43 .cse1) (= .cse14 (mod .cse40 .cse40))))))) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_239| 1)) (not (= 8 .cse44)) (< |v_ULTIMATE.start_main_~i~0#1_239| c_~N~0)))) (<= .cse4 |ULTIMATE.start_main_~#sum~0#1.base|))))) (and .cse6 (or (and .cse31 (or (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse45 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse47 (+ .cse45 1))) (and (= (* .cse45 2) .cse1) (exists ((v_arrayElimCell_196 Int)) (let ((.cse46 (mod v_arrayElimCell_196 .cse47))) (and (= .cse46 0) (= .cse5 .cse46)))) (= .cse2 .cse47) (= .cse14 (mod .cse47 .cse47)))))) (<= .cse4 |ULTIMATE.start_main_~#sum~0#1.base|))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse48 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse49 (+ .cse48 1))) (and (= (* .cse48 2) .cse1) (= .cse2 .cse49) (exists ((v_arrayElimCell_196 Int)) (let ((.cse50 (mod v_arrayElimCell_196 .cse49))) (and (< v_arrayElimCell_196 0) (= .cse50 (+ .cse5 .cse48 1)) (not (= .cse50 0))))) (= .cse14 (mod .cse49 .cse49)))))) (<= .cse4 |ULTIMATE.start_main_~#sum~0#1.base|))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (<= .cse4 |ULTIMATE.start_main_~#sum~0#1.base|) (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse51 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse52 (+ .cse51 1))) (and (= (* .cse51 2) .cse1) (= .cse2 .cse52) (exists ((v_arrayElimCell_196 Int)) (and (not (< v_arrayElimCell_196 0)) (= .cse5 (mod v_arrayElimCell_196 .cse52)))) (= .cse14 (mod .cse52 .cse52)))))))))) (and .cse53 (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse54 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse55 (+ .cse54 1))) (and (= (* .cse54 2) .cse1) (= .cse2 .cse55) (<= .cse4 |ULTIMATE.start_main_~#sum~0#1.base|) (= .cse5 (mod .cse2 .cse55)) (= .cse14 (mod .cse55 .cse55))))))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse56 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse57 (+ .cse56 1))) (and (= (* .cse56 2) .cse1) (= .cse2 .cse57) (= .cse5 (mod .cse2 .cse57)) (= .cse14 (mod .cse57 .cse57)))))) (<= .cse4 |ULTIMATE.start_main_~#sum~0#1.base|))))) (and (or (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (<= .cse4 |ULTIMATE.start_main_~#sum~0#1.base|) (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse60 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse59 (+ .cse60 1))) (let ((.cse58 (mod .cse59 .cse59))) (and (= .cse58 .cse5) (not (< .cse59 0)) (= .cse60 .cse1) (= .cse14 .cse58)))))))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (<= .cse4 |ULTIMATE.start_main_~#sum~0#1.base|) (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse63 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse62 (+ .cse63 1))) (let ((.cse61 (mod .cse62 .cse62))) (and (= .cse61 .cse5) (< .cse62 0) (= .cse63 .cse1) (= .cse14 .cse61))))))))) .cse31 (<= c_~N~0 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and .cse64 (or (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (<= .cse4 |ULTIMATE.start_main_~#sum~0#1.base|) (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse68 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse66 (+ .cse68 1))) (let ((.cse67 (mod (+ (* .cse68 2) 1) .cse66))) (and (exists ((v_arrayElimCell_196 Int)) (let ((.cse65 (mod v_arrayElimCell_196 .cse66))) (and (= .cse65 0) (= .cse5 .cse65)))) (not (< .cse66 0)) (= .cse14 .cse67) (= .cse68 .cse1) (= .cse67 0)))))))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse71 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse70 (+ .cse71 1))) (let ((.cse69 (mod (+ (* .cse71 2) 1) .cse70))) (and (= .cse14 .cse69) (exists ((v_arrayElimCell_196 Int)) (= .cse5 (mod v_arrayElimCell_196 .cse70))) (< .cse70 0) (= .cse71 .cse1) (= .cse69 0)))))) (<= .cse4 |ULTIMATE.start_main_~#sum~0#1.base|))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (<= .cse4 |ULTIMATE.start_main_~#sum~0#1.base|) (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse73 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse72 (+ .cse73 1))) (and (not (< .cse72 0)) (= .cse14 (mod (+ (* .cse73 2) 1) .cse72)) (= .cse73 .cse1) (exists ((v_arrayElimCell_196 Int)) (let ((.cse74 (mod v_arrayElimCell_196 .cse72))) (and (< v_arrayElimCell_196 0) (= .cse74 (+ .cse5 .cse73 1)) (not (= .cse74 0))))))))))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse77 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse76 (+ .cse77 1))) (let ((.cse75 (mod (+ (* .cse77 2) 1) .cse76))) (and (= .cse14 .cse75) (< .cse76 0) (= .cse77 .cse1) (= .cse75 0) (exists ((v_arrayElimCell_196 Int)) (and (not (< v_arrayElimCell_196 0)) (= .cse5 (mod v_arrayElimCell_196 .cse76))))))))) (<= .cse4 |ULTIMATE.start_main_~#sum~0#1.base|))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (<= .cse4 |ULTIMATE.start_main_~#sum~0#1.base|) (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse82 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse81 (+ (* .cse82 2) 1)) (.cse80 (+ .cse82 1))) (let ((.cse78 (mod .cse81 .cse80))) (and (not (= .cse78 0)) (exists ((v_arrayElimCell_196 Int)) (let ((.cse79 (mod v_arrayElimCell_196 .cse80))) (and (= .cse79 0) (= .cse5 .cse79)))) (not (< .cse80 0)) (< .cse81 0) (= .cse14 (+ .cse82 .cse78 1)) (= .cse82 .cse1)))))))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse86 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse85 (+ (* .cse86 2) 1)) (.cse84 (+ .cse86 1))) (let ((.cse83 (mod .cse85 .cse84))) (and (not (= .cse83 0)) (not (< .cse84 0)) (< .cse85 0) (= .cse14 (+ .cse86 .cse83 1)) (= .cse86 .cse1) (exists ((v_arrayElimCell_196 Int)) (and (not (< v_arrayElimCell_196 0)) (= .cse5 (mod v_arrayElimCell_196 .cse84))))))))) (<= .cse4 |ULTIMATE.start_main_~#sum~0#1.base|))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse88 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse89 (+ .cse88 1))) (let ((.cse87 (mod (+ (* .cse88 2) 1) .cse89))) (and (not (= .cse87 0)) (= .cse14 (+ .cse88 .cse87 1)) (< .cse89 0) (= .cse88 .cse1) (exists ((v_arrayElimCell_196 Int)) (and (not (< v_arrayElimCell_196 0)) (= .cse5 (mod v_arrayElimCell_196 .cse89))))))))) (<= .cse4 |ULTIMATE.start_main_~#sum~0#1.base|))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse91 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse92 (+ .cse91 1))) (let ((.cse90 (mod (+ (* .cse91 2) 1) .cse92))) (and (not (= .cse90 0)) (= .cse14 (+ .cse91 .cse90 1)) (< .cse92 0) (= .cse91 .cse1) (exists ((v_arrayElimCell_196 Int)) (let ((.cse93 (mod v_arrayElimCell_196 .cse92))) (and (< v_arrayElimCell_196 0) (= .cse5 (+ .cse91 .cse93 1)) (not (= .cse93 0)))))))))) (<= .cse4 |ULTIMATE.start_main_~#sum~0#1.base|))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (<= .cse4 |ULTIMATE.start_main_~#sum~0#1.base|) (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse96 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse95 (+ .cse96 1))) (and (exists ((v_arrayElimCell_196 Int)) (let ((.cse94 (mod v_arrayElimCell_196 .cse95))) (and (= .cse94 0) (= .cse5 .cse94)))) (not (< .cse95 0)) (= .cse14 (mod (+ (* .cse96 2) 1) .cse95)) (= .cse96 .cse1))))))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse100 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse99 (+ (* .cse100 2) 1)) (.cse98 (+ .cse100 1))) (let ((.cse97 (mod .cse99 .cse98))) (and (not (= .cse97 0)) (not (< .cse98 0)) (< .cse99 0) (= .cse14 (+ .cse100 .cse97 1)) (= .cse100 .cse1) (exists ((v_arrayElimCell_196 Int)) (let ((.cse101 (mod v_arrayElimCell_196 .cse98))) (and (< v_arrayElimCell_196 0) (= .cse101 (+ .cse5 .cse100 1)) (not (= .cse101 0)))))))))) (<= .cse4 |ULTIMATE.start_main_~#sum~0#1.base|))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse104 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse102 (+ .cse104 1))) (let ((.cse103 (mod (+ (* .cse104 2) 1) .cse102))) (and (not (< .cse102 0)) (= .cse14 .cse103) (= .cse104 .cse1) (= .cse103 0) (exists ((v_arrayElimCell_196 Int)) (let ((.cse105 (mod v_arrayElimCell_196 .cse102))) (and (< v_arrayElimCell_196 0) (= .cse105 (+ .cse5 .cse104 1)) (not (= .cse105 0)))))))))) (<= .cse4 |ULTIMATE.start_main_~#sum~0#1.base|))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse108 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse106 (+ .cse108 1))) (let ((.cse107 (mod (+ (* .cse108 2) 1) .cse106))) (and (not (< .cse106 0)) (= .cse14 .cse107) (= .cse108 .cse1) (= .cse107 0) (exists ((v_arrayElimCell_196 Int)) (and (not (< v_arrayElimCell_196 0)) (= .cse5 (mod v_arrayElimCell_196 .cse106))))))))) (<= .cse4 |ULTIMATE.start_main_~#sum~0#1.base|))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (<= .cse4 |ULTIMATE.start_main_~#sum~0#1.base|) (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse110 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse109 (+ .cse110 1))) (and (not (< .cse109 0)) (= .cse14 (mod (+ (* .cse110 2) 1) .cse109)) (= .cse110 .cse1) (exists ((v_arrayElimCell_196 Int)) (and (not (< v_arrayElimCell_196 0)) (= .cse5 (mod v_arrayElimCell_196 .cse109)))))))))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse114 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse113 (+ .cse114 1))) (let ((.cse111 (mod (+ (* .cse114 2) 1) .cse113))) (and (not (= .cse111 0)) (exists ((v_arrayElimCell_196 Int)) (let ((.cse112 (mod v_arrayElimCell_196 .cse113))) (and (= .cse112 0) (= .cse5 .cse112)))) (= .cse14 (+ .cse114 .cse111 1)) (< .cse113 0) (= .cse114 .cse1)))))) (<= .cse4 |ULTIMATE.start_main_~#sum~0#1.base|)))) .cse115) (and .cse116 (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse118 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse117 (let ((.cse119 (+ .cse118 1))) (mod .cse119 .cse119)))) (and (= .cse117 .cse5) (<= .cse4 |ULTIMATE.start_main_~#sum~0#1.base|) (= .cse118 3) (= .cse14 .cse117)))))) (and (or (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (<= .cse4 |ULTIMATE.start_main_~#sum~0#1.base|) (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse121 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse120 (+ .cse121 1))) (and (not (< .cse120 0)) (= .cse121 .cse1) (exists ((v_arrayElimCell_196 Int)) (and (not (< v_arrayElimCell_196 0)) (= .cse5 (mod v_arrayElimCell_196 .cse120)))) (= .cse14 (mod .cse120 .cse120)))))))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse123 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse122 (+ .cse123 1))) (and (< .cse122 0) (= .cse123 .cse1) (exists ((v_arrayElimCell_196 Int)) (and (not (< v_arrayElimCell_196 0)) (= .cse5 (mod v_arrayElimCell_196 .cse122)))) (= .cse14 (mod .cse122 .cse122)))))) (<= .cse4 |ULTIMATE.start_main_~#sum~0#1.base|))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse125 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse124 (+ .cse125 1))) (and (< .cse124 0) (= .cse125 .cse1) (exists ((v_arrayElimCell_196 Int)) (let ((.cse126 (mod v_arrayElimCell_196 .cse124))) (and (< v_arrayElimCell_196 0) (= .cse5 (+ .cse125 .cse126 1)) (not (= .cse126 0))))) (= .cse14 (mod .cse124 .cse124)))))) (<= .cse4 |ULTIMATE.start_main_~#sum~0#1.base|))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse129 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse128 (+ .cse129 1))) (and (exists ((v_arrayElimCell_196 Int)) (let ((.cse127 (mod v_arrayElimCell_196 .cse128))) (and (= .cse127 0) (= .cse5 .cse127)))) (not (< .cse128 0)) (= .cse129 .cse1) (= .cse14 (mod .cse128 .cse128)))))) (<= .cse4 |ULTIMATE.start_main_~#sum~0#1.base|))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse131 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse130 (+ .cse131 1))) (and (not (< .cse130 0)) (= .cse131 .cse1) (exists ((v_arrayElimCell_196 Int)) (let ((.cse132 (mod v_arrayElimCell_196 .cse130))) (and (< v_arrayElimCell_196 0) (= .cse132 (+ .cse5 .cse131 1)) (not (= .cse132 0))))) (= .cse14 (mod .cse130 .cse130)))))) (<= .cse4 |ULTIMATE.start_main_~#sum~0#1.base|))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (<= .cse4 |ULTIMATE.start_main_~#sum~0#1.base|) (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse135 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse134 (+ .cse135 1))) (and (exists ((v_arrayElimCell_196 Int)) (let ((.cse133 (mod v_arrayElimCell_196 .cse134))) (and (= .cse133 0) (= .cse5 .cse133)))) (< .cse134 0) (= .cse135 .cse1) (= .cse14 (mod .cse134 .cse134))))))))) (<= c_~N~0 1) (< 0 c_~N~0)) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (exists ((|v_ULTIMATE.start_main_~i~0#1_239| Int)) (let ((.cse136 (* 8 |v_ULTIMATE.start_main_~i~0#1_239|))) (and (not (= .cse8 .cse136)) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_239| 1)) (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse138 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse137 (+ .cse138 1))) (and (= (select .cse12 (+ .cse136 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse137) (< .cse137 0) (= .cse138 .cse1) (exists ((v_arrayElimCell_196 Int)) (and (not (< v_arrayElimCell_196 0)) (= .cse5 (mod v_arrayElimCell_196 .cse137)))) (= .cse14 (mod .cse137 .cse137)))))) (not (= 8 .cse136)) (< |v_ULTIMATE.start_main_~i~0#1_239| c_~N~0)))) (<= .cse4 |ULTIMATE.start_main_~#sum~0#1.base|))) (and .cse53 (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_239| Int)) (let ((.cse140 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse139 (+ .cse140 1))) (and (= (select .cse12 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_239|) |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse139) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_239| 1)) (<= .cse4 |ULTIMATE.start_main_~#sum~0#1.base|) (= .cse5 (mod .cse2 .cse139)) (< |v_ULTIMATE.start_main_~i~0#1_239| c_~N~0) (= .cse140 .cse1) (= .cse14 (mod .cse139 .cse139))))))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (<= .cse4 |ULTIMATE.start_main_~#sum~0#1.base|) (exists ((|v_ULTIMATE.start_main_~i~0#1_239| Int)) (let ((.cse142 (* 8 |v_ULTIMATE.start_main_~i~0#1_239|))) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse143 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse141 (+ .cse143 1))) (and (not (< .cse141 0)) (= (select .cse12 (+ .cse142 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse141) (= .cse143 .cse1) (exists ((v_arrayElimCell_196 Int)) (let ((.cse144 (mod v_arrayElimCell_196 .cse141))) (and (< v_arrayElimCell_196 0) (= .cse144 (+ .cse5 .cse143 1)) (not (= .cse144 0))))) (= .cse14 (mod .cse141 .cse141)))))) (not (= .cse8 .cse142)) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_239| 1)) (not (= 8 .cse142)) (< |v_ULTIMATE.start_main_~i~0#1_239| c_~N~0)))))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (exists ((|v_ULTIMATE.start_main_~i~0#1_239| Int)) (let ((.cse147 (* 8 |v_ULTIMATE.start_main_~i~0#1_239|))) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse148 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse146 (+ .cse148 1))) (and (exists ((v_arrayElimCell_196 Int)) (let ((.cse145 (mod v_arrayElimCell_196 .cse146))) (and (= .cse145 0) (= .cse5 .cse145)))) (= (select .cse12 (+ .cse147 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse146) (< .cse146 0) (= .cse148 .cse1) (= .cse14 (mod .cse146 .cse146)))))) (not (= .cse8 .cse147)) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_239| 1)) (not (= 8 .cse147)) (< |v_ULTIMATE.start_main_~i~0#1_239| c_~N~0)))) (<= .cse4 |ULTIMATE.start_main_~#sum~0#1.base|))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (exists ((|v_ULTIMATE.start_main_~i~0#1_239| Int)) (let ((.cse149 (* 8 |v_ULTIMATE.start_main_~i~0#1_239|))) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse151 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse150 (+ .cse151 1))) (and (= (select .cse12 (+ .cse149 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse150) (< .cse150 0) (= .cse151 .cse1) (exists ((v_arrayElimCell_196 Int)) (let ((.cse152 (mod v_arrayElimCell_196 .cse150))) (and (< v_arrayElimCell_196 0) (= .cse5 (+ .cse151 .cse152 1)) (not (= .cse152 0))))) (= .cse14 (mod .cse150 .cse150)))))) (not (= .cse8 .cse149)) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_239| 1)) (not (= 8 .cse149)) (< |v_ULTIMATE.start_main_~i~0#1_239| c_~N~0)))) (<= .cse4 |ULTIMATE.start_main_~#sum~0#1.base|)))))) (not .cse7)) (and .cse64 (or (and (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse154 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse153 (+ .cse154 1))) (and (not (< .cse153 0)) (= .cse14 (mod (+ (* .cse154 2) 1) .cse153)) (= .cse5 (mod .cse14 .cse153)) (<= .cse4 |ULTIMATE.start_main_~#sum~0#1.base|) (= .cse154 .cse1))))) .cse155) (and (or (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse158 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse157 (+ .cse158 1))) (let ((.cse156 (mod (mod (+ (* .cse158 2) 1) .cse157) .cse157))) (and (= .cse156 0) (not (< .cse157 0)) (= .cse156 .cse5) (= .cse158 .cse1)))))) (<= .cse4 |ULTIMATE.start_main_~#sum~0#1.base|))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse161 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse160 (+ .cse161 1))) (let ((.cse159 (mod (+ (* .cse161 2) 1) .cse160))) (and (not (< .cse159 0)) (not (< .cse160 0)) (= (mod .cse159 .cse160) .cse5) (= .cse161 .cse1)))))) (<= .cse4 |ULTIMATE.start_main_~#sum~0#1.base|))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (<= .cse4 |ULTIMATE.start_main_~#sum~0#1.base|) (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse164 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse163 (+ .cse164 1))) (let ((.cse165 (mod (+ (* .cse164 2) 1) .cse163))) (let ((.cse162 (mod .cse165 .cse163))) (and (= .cse162 0) (not (< .cse163 0)) (= .cse162 .cse5) (= .cse164 .cse1) (= .cse165 0))))))))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse169 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse167 (+ (* .cse169 2) 1)) (.cse170 (+ .cse169 1))) (let ((.cse166 (mod .cse167 .cse170))) (let ((.cse168 (+ .cse169 .cse166 1))) (and (not (= .cse166 0)) (< .cse167 0) (not (< .cse168 0)) (= .cse169 .cse1) (= .cse5 (mod .cse168 .cse170)))))))) (<= .cse4 |ULTIMATE.start_main_~#sum~0#1.base|))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (<= .cse4 |ULTIMATE.start_main_~#sum~0#1.base|) (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse173 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse174 (+ .cse173 1))) (let ((.cse171 (mod (+ (* .cse173 2) 1) .cse174))) (let ((.cse172 (mod (+ .cse173 .cse171 1) .cse174))) (and (not (= .cse171 0)) (= .cse172 0) (= .cse173 .cse1) (= .cse5 .cse172))))))))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse177 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse176 (+ .cse177 1))) (let ((.cse175 (mod (+ (* .cse177 2) 1) .cse176))) (and (= (mod .cse175 .cse176) .cse5) (= .cse177 .cse1) (= .cse175 0) (<= 0 .cse176)))))) (<= .cse4 |ULTIMATE.start_main_~#sum~0#1.base|)))) .cse7) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse180 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse178 (+ .cse180 1))) (let ((.cse179 (mod (+ (* .cse180 2) 1) .cse178))) (and (not (< .cse178 0)) (= .cse14 .cse179) (= .cse5 (mod .cse14 .cse178)) (<= .cse4 |ULTIMATE.start_main_~#sum~0#1.base|) (= .cse180 .cse1) (= .cse179 0)))))) .cse155) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse184 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse181 (+ .cse184 1))) (let ((.cse182 (mod .cse14 .cse181)) (.cse183 (mod (+ (* .cse184 2) 1) .cse181))) (and (not (< .cse181 0)) (= .cse182 0) (= .cse14 .cse183) (= .cse5 .cse182) (= .cse184 .cse1) (= .cse183 0)))))) (<= .cse4 |ULTIMATE.start_main_~#sum~0#1.base|))) (and .cse155 (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse188 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse187 (+ (* .cse188 2) 1)) (.cse186 (+ .cse188 1))) (let ((.cse185 (mod .cse187 .cse186))) (and (not (= .cse185 0)) (= .cse5 (mod .cse14 .cse186)) (< .cse187 0) (= .cse14 (+ .cse188 .cse185 1)) (<= .cse4 |ULTIMATE.start_main_~#sum~0#1.base|) (= .cse188 .cse1))))))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (<= .cse4 |ULTIMATE.start_main_~#sum~0#1.base|) (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse191 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse192 (+ .cse191 1))) (let ((.cse190 (mod .cse14 .cse192)) (.cse189 (mod (+ (* .cse191 2) 1) .cse192))) (and (not (= .cse189 0)) (= .cse190 0) (= .cse5 .cse190) (= .cse14 (+ .cse191 .cse189 1)) (= .cse191 .cse1)))))))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (<= .cse4 |ULTIMATE.start_main_~#sum~0#1.base|) (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse195 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse193 (+ .cse195 1))) (let ((.cse194 (mod .cse14 .cse193))) (and (not (< .cse193 0)) (= .cse194 0) (= .cse14 (mod (+ (* .cse195 2) 1) .cse193)) (= .cse5 .cse194) (= .cse195 .cse1))))))))) .cse115) (and .cse7 (or (and .cse64 (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse197 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse198 (+ .cse197 1))) (let ((.cse196 (mod (+ .cse197 (mod (+ (* .cse197 2) 1) .cse198) 1) .cse198))) (and (= .cse5 (+ .cse196 .cse197 1)) (<= .cse4 |ULTIMATE.start_main_~#sum~0#1.base|) (not (= .cse196 0)) (< .cse198 0) (= .cse197 .cse1))))))) (and .cse64 (or (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (<= .cse4 |ULTIMATE.start_main_~#sum~0#1.base|) (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse201 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse202 (+ .cse201 1))) (let ((.cse200 (mod (+ (* .cse201 2) 1) .cse202))) (let ((.cse199 (mod .cse200 .cse202))) (and (not (= .cse199 0)) (< .cse200 0) (= .cse199 (+ .cse5 .cse201 1)) (= .cse201 .cse1))))))))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse206 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse204 (+ .cse206 1))) (let ((.cse203 (+ .cse206 (mod (+ (* .cse206 2) 1) .cse204) 1))) (let ((.cse205 (mod .cse203 .cse204))) (and (< .cse203 0) (not (< .cse204 0)) (not (= .cse205 0)) (= .cse205 (+ .cse5 .cse206 1)) (= .cse206 .cse1))))))) (<= .cse4 |ULTIMATE.start_main_~#sum~0#1.base|))))))) (and .cse64 (or (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse209 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse208 (+ .cse209 1))) (let ((.cse207 (mod (+ (* .cse209 2) 1) .cse208))) (and (= .cse14 .cse207) (= .cse5 (mod .cse14 .cse208)) (< .cse208 0) (= .cse209 .cse1) (= .cse207 0)))))) (<= .cse4 |ULTIMATE.start_main_~#sum~0#1.base|))) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse212 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse211 (+ .cse212 1))) (let ((.cse210 (mod (+ (* .cse212 2) 1) .cse211))) (and (= .cse14 .cse210) (= .cse5 (mod .cse14 .cse211)) (<= .cse4 |ULTIMATE.start_main_~#sum~0#1.base|) (< .cse211 0) (= .cse212 .cse1) (= .cse210 0)))))) .cse155) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse215 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse213 (+ .cse215 1))) (let ((.cse214 (mod (+ (* .cse215 2) 1) .cse213))) (and (<= .cse4 |ULTIMATE.start_main_~#sum~0#1.base|) (< .cse213 0) (= (mod .cse214 .cse213) .cse5) (= .cse215 .cse1) (= .cse214 0)))))) .cse7)) .cse115) (and .cse216 (or (and (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_239| Int)) (let ((.cse218 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse217 (+ .cse218 1))) (and (= (select .cse12 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_239|) |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse217) (= .cse5 (mod .cse14 .cse217)) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_239| 1)) (<= .cse4 |ULTIMATE.start_main_~#sum~0#1.base|) (< .cse217 0) (< |v_ULTIMATE.start_main_~i~0#1_239| c_~N~0) (= .cse218 .cse1) (= .cse14 (mod .cse217 .cse217)))))) .cse155) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (<= .cse4 |ULTIMATE.start_main_~#sum~0#1.base|) (exists ((|v_ULTIMATE.start_main_~i~0#1_239| Int)) (let ((.cse219 (* 8 |v_ULTIMATE.start_main_~i~0#1_239|))) (and (not (= .cse8 .cse219)) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_239| 1)) (not (= 8 .cse219)) (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse221 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse220 (+ .cse221 1))) (and (= (select .cse12 (+ .cse219 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse220) (= .cse5 (mod .cse14 .cse220)) (< .cse220 0) (= .cse221 .cse1) (= .cse14 (mod .cse220 .cse220)))))) (< |v_ULTIMATE.start_main_~i~0#1_239| c_~N~0)))))))) (and .cse31 (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_239| Int)) (let ((.cse224 (* 8 |v_ULTIMATE.start_main_~i~0#1_239|)) (.cse225 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse223 (+ .cse225 1)) (.cse222 (select .cse12 (+ .cse224 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (and (= .cse222 .cse223) (= .cse5 (mod .cse222 .cse223)) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_239| 1)) (= .cse14 .cse222) (<= .cse4 |ULTIMATE.start_main_~#sum~0#1.base|) (not (= 8 .cse224)) (< |v_ULTIMATE.start_main_~i~0#1_239| c_~N~0) (= .cse225 .cse1) (= (mod .cse223 .cse223) .cse222)))))) (and .cse216 (or (and .cse6 (or (and (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse226 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse227 (+ .cse226 1))) (and (= (* .cse226 2) .cse1) (= .cse2 .cse227) (= .cse5 (mod .cse14 .cse227)) (<= .cse4 |ULTIMATE.start_main_~#sum~0#1.base|) (= .cse14 (mod .cse227 .cse227)))))) .cse155) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse228 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse229 (+ .cse228 1))) (and (= (* .cse228 2) .cse1) (= .cse2 .cse229) (= .cse5 (mod .cse14 .cse229)) (= .cse14 (mod .cse229 .cse229)))))) (<= .cse4 |ULTIMATE.start_main_~#sum~0#1.base|))))) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_239| Int)) (let ((.cse232 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse231 (* 8 |v_ULTIMATE.start_main_~i~0#1_239|)) (.cse230 (+ .cse232 1))) (and (not (< .cse230 0)) (= (select .cse12 (+ .cse231 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse230) (= .cse5 (mod .cse14 .cse230)) (not (= .cse8 .cse231)) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_239| 1)) (<= .cse4 |ULTIMATE.start_main_~#sum~0#1.base|) (not (= 8 .cse231)) (< |v_ULTIMATE.start_main_~i~0#1_239| c_~N~0) (= .cse232 .cse1) (= .cse14 (mod .cse230 .cse230)))))) .cse155) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (exists ((|v_ULTIMATE.start_main_~i~0#1_239| Int)) (let ((.cse235 (* 8 |v_ULTIMATE.start_main_~i~0#1_239|))) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse236 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse233 (+ .cse236 1))) (let ((.cse234 (mod .cse14 .cse233))) (and (not (< .cse233 0)) (= .cse234 0) (= (select .cse12 (+ .cse235 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse233) (= .cse5 .cse234) (= .cse236 .cse1) (= .cse14 (mod .cse233 .cse233))))))) (not (= .cse8 .cse235)) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_239| 1)) (not (= 8 .cse235)) (< |v_ULTIMATE.start_main_~i~0#1_239| c_~N~0)))) (<= .cse4 |ULTIMATE.start_main_~#sum~0#1.base|))))) (and .cse237 (or (and .cse64 (or (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (<= .cse4 |ULTIMATE.start_main_~#sum~0#1.base|) (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse238 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse239 (+ .cse238 1))) (let ((.cse240 (mod .cse14 .cse239))) (and (= .cse14 (mod (+ (* .cse238 2) 1) .cse239)) (= .cse238 .cse1) (not (= .cse240 0)) (= .cse240 (+ .cse5 .cse238 1))))))))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (<= .cse4 |ULTIMATE.start_main_~#sum~0#1.base|) (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse242 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse241 (+ .cse242 1))) (let ((.cse243 (mod .cse14 .cse241))) (and (not (< .cse241 0)) (= .cse14 (+ .cse242 (mod (+ (* .cse242 2) 1) .cse241) 1)) (= .cse242 .cse1) (not (= .cse243 0)) (= .cse243 (+ .cse5 .cse242 1)))))))))) .cse115) (and .cse64 (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse244 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse246 (+ .cse244 1))) (let ((.cse245 (mod .cse14 .cse246))) (and (= (+ .cse244 .cse245 1) .cse5) (= .cse14 (+ .cse244 (mod (+ (* .cse244 2) 1) .cse246) 1)) (<= .cse4 |ULTIMATE.start_main_~#sum~0#1.base|) (< .cse246 0) (= .cse244 .cse1) (not (= .cse245 0))))))) .cse115) (and .cse216 (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_239| Int)) (let ((.cse248 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse247 (+ .cse248 1))) (let ((.cse249 (mod .cse14 .cse247))) (and (= (select .cse12 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_239|) |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse247) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_239| 1)) (<= .cse4 |ULTIMATE.start_main_~#sum~0#1.base|) (< |v_ULTIMATE.start_main_~i~0#1_239| c_~N~0) (= .cse248 .cse1) (not (= .cse249 0)) (= .cse14 (mod .cse247 .cse247)) (= .cse249 (+ .cse5 .cse248 1)))))))))))))))) is different from false [2022-11-18 19:55:09,316 WARN L837 $PredicateComparison]: unable to prove that (and (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse60 (select .cse1 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|))) (.cse7 (select .cse1 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse179 (< .cse7 0)) (.cse193 (< .cse60 0))) (let ((.cse14 (= .cse7 .cse60)) (.cse57 (< 2 c_~N~0)) (.cse86 (not .cse193)) (.cse38 (<= c_~N~0 2)) (.cse50 (< 1 c_~N~0)) (.cse51 (<= |c_ULTIMATE.start_main_~i~0#1| 2)) (.cse17 (not .cse179)) (.cse6 (+ .cse60 2)) (.cse8 (+ 2 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (exists ((|v_ULTIMATE.start_main_~i~0#1_241| Int)) (let ((.cse0 (* 8 |v_ULTIMATE.start_main_~i~0#1_241|))) (and (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (not (= 16 .cse0)) (<= |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (exists ((|v_ULTIMATE.start_main_~i~0#1_239| Int)) (let ((.cse4 (* 8 |v_ULTIMATE.start_main_~i~0#1_239|))) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse5 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse3 (+ .cse5 1))) (let ((.cse2 (mod .cse7 .cse3))) (and (= (select .cse1 (+ .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse2) (not (< .cse3 0)) (= .cse2 0) (= (select .cse1 (+ .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse3) (= .cse5 .cse6) (= .cse7 (mod .cse3 .cse3))))))) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_239| 1)) (not (= 8 .cse4)) (not (= .cse0 .cse4)) (< |v_ULTIMATE.start_main_~i~0#1_239| c_~N~0)))) (<= .cse8 |ULTIMATE.start_main_~#sum~0#1.base|)))))) (exists ((|v_ULTIMATE.start_main_~i~0#1_241| Int)) (let ((.cse10 (* 8 |v_ULTIMATE.start_main_~i~0#1_241|)) (.cse9 (+ |v_ULTIMATE.start_main_~i~0#1_241| 1))) (and (<= c_~N~0 .cse9) (not (= .cse10 8)) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (not (= 16 .cse10)) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse12 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse11 (+ .cse12 1))) (let ((.cse13 (mod .cse11 .cse11))) (and (not (< .cse11 0)) (= .cse12 .cse6) (= .cse13 (select .cse1 (+ .cse10 |c_ULTIMATE.start_main_~a~0#1.offset|))) (= .cse7 .cse13)))))) (<= .cse8 |ULTIMATE.start_main_~#sum~0#1.base|))) (<= |c_ULTIMATE.start_main_~i~0#1| .cse9)))) (and .cse14 (or (and (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_239| Int)) (let ((.cse16 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse15 (+ .cse16 1))) (and (= (select .cse1 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_241|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (mod .cse7 .cse15)) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (= (select .cse1 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_239|) |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse15) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_239| 1)) (<= |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)) (<= .cse8 |ULTIMATE.start_main_~#sum~0#1.base|) (< |v_ULTIMATE.start_main_~i~0#1_239| c_~N~0) (= .cse16 .cse6) (= .cse7 (mod .cse15 .cse15)))))) .cse17) (exists ((|v_ULTIMATE.start_main_~i~0#1_241| Int)) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (<= .cse8 |ULTIMATE.start_main_~#sum~0#1.base|) (exists ((|v_ULTIMATE.start_main_~i~0#1_239| Int)) (let ((.cse19 (* 8 |v_ULTIMATE.start_main_~i~0#1_241|)) (.cse18 (* 8 |v_ULTIMATE.start_main_~i~0#1_239|))) (and (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_239| 1)) (not (= 8 .cse18)) (not (= .cse19 .cse18)) (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse22 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse21 (+ .cse22 1))) (let ((.cse20 (mod .cse7 .cse21))) (and (= (select .cse1 (+ .cse19 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse20) (= .cse20 0) (= (select .cse1 (+ .cse18 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse21) (= .cse22 .cse6) (= .cse7 (mod .cse21 .cse21))))))) (< |v_ULTIMATE.start_main_~i~0#1_239| c_~N~0)))))) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (<= |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)))))) (exists ((|v_ULTIMATE.start_main_~i~0#1_241| Int)) (let ((.cse23 (* 8 |v_ULTIMATE.start_main_~i~0#1_241|))) (and (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (not (= 16 .cse23)) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (exists ((|v_ULTIMATE.start_main_~i~0#1_239| Int)) (let ((.cse24 (* 8 |v_ULTIMATE.start_main_~i~0#1_239|))) (and (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_239| 1)) (not (= 8 .cse24)) (not (= .cse23 .cse24)) (< |v_ULTIMATE.start_main_~i~0#1_239| c_~N~0) (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse26 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse25 (+ .cse26 1))) (and (= (select .cse1 (+ .cse23 |c_ULTIMATE.start_main_~a~0#1.offset|)) (mod .cse7 .cse25)) (= (select .cse1 (+ .cse24 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse25) (< .cse25 0) (= .cse26 .cse6) (= .cse7 (mod .cse25 .cse25))))))))) (<= .cse8 |ULTIMATE.start_main_~#sum~0#1.base|))) (<= |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_241| 1))))) (exists ((|v_ULTIMATE.start_main_~i~0#1_241| Int)) (let ((.cse27 (* 8 |v_ULTIMATE.start_main_~i~0#1_241|))) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (exists ((|v_ULTIMATE.start_main_~i~0#1_239| Int)) (let ((.cse30 (* 8 |v_ULTIMATE.start_main_~i~0#1_239|))) (and (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_239| 1)) (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse31 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse29 (+ .cse31 1))) (and (exists ((v_arrayElimCell_196 Int)) (let ((.cse28 (mod v_arrayElimCell_196 .cse29))) (and (= (select .cse1 (+ .cse27 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse28) (= .cse28 0)))) (not (< .cse29 0)) (= (select .cse1 (+ .cse30 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse29) (= .cse31 .cse6) (= .cse7 (mod .cse29 .cse29)))))) (not (= 8 .cse30)) (not (= .cse27 .cse30)) (< |v_ULTIMATE.start_main_~i~0#1_239| c_~N~0)))) (<= .cse8 |ULTIMATE.start_main_~#sum~0#1.base|))) (not (= .cse27 8)) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (<= |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_241| 1))))) (exists ((|v_ULTIMATE.start_main_~i~0#1_241| Int)) (let ((.cse32 (* 8 |v_ULTIMATE.start_main_~i~0#1_241|))) (and (not (= .cse32 8)) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (not (= 16 .cse32)) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (exists ((|v_ULTIMATE.start_main_~i~0#1_239| Int)) (let ((.cse33 (* 8 |v_ULTIMATE.start_main_~i~0#1_239|))) (and (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_239| 1)) (not (= 8 .cse33)) (< |v_ULTIMATE.start_main_~i~0#1_239| c_~N~0) (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse37 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse36 (select .cse1 (+ .cse33 |c_ULTIMATE.start_main_~a~0#1.offset|))) (.cse35 (+ .cse37 1))) (let ((.cse34 (mod .cse36 .cse35))) (and (= (select .cse1 (+ .cse32 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse34) (not (< .cse35 0)) (= .cse36 .cse35) (= 0 .cse34) (= .cse37 .cse6) (= .cse7 (mod .cse35 .cse35)))))))))) (<= .cse8 |ULTIMATE.start_main_~#sum~0#1.base|))) (<= |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_241| 1))))) (and (or (and .cse38 (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse40 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse41 (+ .cse40 1))) (let ((.cse39 (mod (+ .cse40 (mod (+ (* .cse40 2) 1) .cse41) 1) .cse41))) (and (= .cse7 (+ .cse39 .cse40 1)) (<= .cse8 |ULTIMATE.start_main_~#sum~0#1.base|) (not (= .cse39 0)) (< .cse41 0) (= .cse40 .cse6))))))) (and .cse38 (or (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (<= .cse8 |ULTIMATE.start_main_~#sum~0#1.base|) (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse45 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse43 (+ .cse45 1))) (let ((.cse42 (+ .cse45 (mod (+ (* .cse45 2) 1) .cse43) 1))) (let ((.cse44 (mod .cse42 .cse43))) (and (< .cse42 0) (not (< .cse43 0)) (not (= .cse44 0)) (= .cse44 (+ .cse7 .cse45 1)) (= .cse45 .cse6))))))))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (<= .cse8 |ULTIMATE.start_main_~#sum~0#1.base|) (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse47 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse49 (+ .cse47 1))) (let ((.cse48 (mod (+ (* .cse47 2) 1) .cse49))) (let ((.cse46 (mod .cse48 .cse49))) (and (= .cse46 (+ .cse7 .cse47 1)) (not (= .cse46 0)) (< .cse48 0) (= .cse47 .cse6)))))))))))) .cse50 .cse51) (exists ((|v_ULTIMATE.start_main_~i~0#1_241| Int)) (let ((.cse53 (* 8 |v_ULTIMATE.start_main_~i~0#1_241|)) (.cse52 (+ |v_ULTIMATE.start_main_~i~0#1_241| 1))) (and (<= c_~N~0 .cse52) (not (= .cse53 8)) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (not (= 16 .cse53)) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (<= .cse8 |ULTIMATE.start_main_~#sum~0#1.base|) (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse55 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse54 (+ .cse55 1))) (let ((.cse56 (mod .cse54 .cse54))) (and (< .cse54 0) (= .cse55 .cse6) (= .cse56 (select .cse1 (+ .cse53 |c_ULTIMATE.start_main_~a~0#1.offset|))) (= .cse7 .cse56)))))))) (<= |c_ULTIMATE.start_main_~i~0#1| .cse52)))) (and .cse57 (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse59 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse58 (+ .cse59 1))) (and (= .cse7 (mod (mod .cse58 .cse58) .cse58)) (= (* .cse59 2) .cse6) (= .cse60 .cse58) (<= .cse8 |ULTIMATE.start_main_~#sum~0#1.base|))))) .cse51) (exists ((|v_ULTIMATE.start_main_~i~0#1_241| Int)) (let ((.cse61 (* 8 |v_ULTIMATE.start_main_~i~0#1_241|))) (and (not (= .cse61 8)) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (<= .cse8 |ULTIMATE.start_main_~#sum~0#1.base|) (exists ((|v_ULTIMATE.start_main_~i~0#1_239| Int)) (let ((.cse65 (* 8 |v_ULTIMATE.start_main_~i~0#1_239|))) (let ((.cse62 (select .cse1 (+ .cse65 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (and (not (< .cse62 0)) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_239| 1)) (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse64 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse63 (+ .cse64 1))) (and (= (select .cse1 (+ .cse61 |c_ULTIMATE.start_main_~a~0#1.offset|)) (mod .cse62 .cse63)) (= .cse62 .cse63) (= .cse64 .cse6) (= .cse7 (mod .cse63 .cse63)))))) (not (= 8 .cse65)) (< |v_ULTIMATE.start_main_~i~0#1_239| c_~N~0))))))) (not (= 16 .cse61)) (<= |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_241| 1))))) (exists ((|v_ULTIMATE.start_main_~i~0#1_241| Int)) (let ((.cse66 (* 8 |v_ULTIMATE.start_main_~i~0#1_241|))) (and (not (= .cse66 8)) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (exists ((|v_ULTIMATE.start_main_~i~0#1_239| Int)) (let ((.cse67 (* 8 |v_ULTIMATE.start_main_~i~0#1_239|))) (and (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_239| 1)) (not (= 8 .cse67)) (< |v_ULTIMATE.start_main_~i~0#1_239| c_~N~0) (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse70 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse68 (select .cse1 (+ .cse67 |c_ULTIMATE.start_main_~a~0#1.offset|))) (.cse69 (+ .cse70 1))) (and (= (select .cse1 (+ .cse66 |c_ULTIMATE.start_main_~a~0#1.offset|)) (mod .cse68 .cse69)) (= .cse68 .cse69) (< .cse69 0) (= .cse70 .cse6) (= .cse7 (mod .cse69 .cse69))))))))) (<= .cse8 |ULTIMATE.start_main_~#sum~0#1.base|))) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (not (= 16 .cse66)) (<= |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_241| 1))))) (and .cse38 .cse50 (or (and .cse51 (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse73 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse72 (+ .cse73 1))) (let ((.cse71 (mod (+ (* .cse73 2) 1) .cse72))) (and (= (mod .cse71 .cse72) .cse7) (<= .cse8 |ULTIMATE.start_main_~#sum~0#1.base|) (< .cse72 0) (= .cse73 .cse6) (= .cse71 0))))))) (exists ((|v_ULTIMATE.start_main_~i~0#1_241| Int)) (and (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse76 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse74 (+ .cse76 1))) (let ((.cse75 (mod (+ (* .cse76 2) 1) .cse74))) (and (= (select .cse1 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_241|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (mod .cse7 .cse74)) (= .cse7 .cse75) (< .cse74 0) (= .cse76 .cse6) (= .cse75 0)))))) (<= .cse8 |ULTIMATE.start_main_~#sum~0#1.base|))) (<= |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)))) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse79 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse77 (+ .cse79 1))) (let ((.cse78 (mod (+ (* .cse79 2) 1) .cse77))) (and (= (select .cse1 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_241|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (mod .cse7 .cse77)) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (= .cse7 .cse78) (<= |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)) (<= .cse8 |ULTIMATE.start_main_~#sum~0#1.base|) (< .cse77 0) (= .cse79 .cse6) (= .cse78 0)))))) .cse17))) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_239| Int)) (let ((.cse83 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse80 (* 8 |v_ULTIMATE.start_main_~i~0#1_241|)) (.cse82 (* 8 |v_ULTIMATE.start_main_~i~0#1_239|)) (.cse81 (+ .cse83 1))) (and (= (select .cse1 (+ .cse80 |c_ULTIMATE.start_main_~a~0#1.offset|)) (mod .cse7 .cse81)) (not (< .cse81 0)) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (= (select .cse1 (+ .cse82 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse81) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_239| 1)) (<= |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)) (<= .cse8 |ULTIMATE.start_main_~#sum~0#1.base|) (not (= 8 .cse82)) (not (= .cse80 .cse82)) (< |v_ULTIMATE.start_main_~i~0#1_239| c_~N~0) (= .cse83 .cse6) (= .cse7 (mod .cse81 .cse81)))))) .cse17) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_239| Int)) (let ((.cse85 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse84 (+ .cse85 1))) (and (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (= (select .cse1 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_239|) |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse84) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_239| 1)) (<= |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)) (<= .cse8 |ULTIMATE.start_main_~#sum~0#1.base|) (= (mod .cse60 .cse84) (select .cse1 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_241|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (< |v_ULTIMATE.start_main_~i~0#1_239| c_~N~0) (= .cse85 .cse6) (= .cse7 (mod .cse84 .cse84)))))) .cse86) (exists ((|v_ULTIMATE.start_main_~i~0#1_241| Int)) (let ((.cse87 (* 8 |v_ULTIMATE.start_main_~i~0#1_241|))) (and (not (= .cse87 8)) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (<= .cse8 |ULTIMATE.start_main_~#sum~0#1.base|) (exists ((|v_ULTIMATE.start_main_~i~0#1_239| Int)) (let ((.cse88 (* 8 |v_ULTIMATE.start_main_~i~0#1_239|))) (and (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_239| 1)) (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse90 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse89 (+ .cse90 1))) (and (= (select .cse1 (+ .cse88 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse89) (< .cse89 0) (exists ((v_arrayElimCell_196 Int)) (and (= (select .cse1 (+ .cse87 |c_ULTIMATE.start_main_~a~0#1.offset|)) (mod v_arrayElimCell_196 .cse89)) (not (< v_arrayElimCell_196 0)))) (= .cse90 .cse6) (= .cse7 (mod .cse89 .cse89)))))) (not (= 8 .cse88)) (not (= .cse87 .cse88)) (< |v_ULTIMATE.start_main_~i~0#1_239| c_~N~0)))))) (<= |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_241| 1))))) (exists ((|v_ULTIMATE.start_main_~i~0#1_241| Int)) (let ((.cse91 (* 8 |v_ULTIMATE.start_main_~i~0#1_241|))) (and (not (= .cse91 8)) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (<= |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (<= .cse8 |ULTIMATE.start_main_~#sum~0#1.base|) (exists ((|v_ULTIMATE.start_main_~i~0#1_239| Int)) (let ((.cse93 (* 8 |v_ULTIMATE.start_main_~i~0#1_239|))) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse95 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse92 (+ .cse95 1))) (and (not (< .cse92 0)) (= (select .cse1 (+ .cse93 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse92) (exists ((v_arrayElimCell_196 Int)) (let ((.cse94 (mod v_arrayElimCell_196 .cse92))) (and (< v_arrayElimCell_196 0) (= .cse94 (+ (select .cse1 (+ .cse91 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse95 1)) (not (= .cse94 0))))) (= .cse95 .cse6) (= .cse7 (mod .cse92 .cse92)))))) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_239| 1)) (not (= 8 .cse93)) (not (= .cse91 .cse93)) (< |v_ULTIMATE.start_main_~i~0#1_239| c_~N~0))))))))) (and .cse38 .cse50 (or (exists ((|v_ULTIMATE.start_main_~i~0#1_241| Int)) (let ((.cse96 (* 8 |v_ULTIMATE.start_main_~i~0#1_241|))) (and (not (= .cse96 8)) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (<= .cse8 |ULTIMATE.start_main_~#sum~0#1.base|) (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse100 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse101 (+ (* .cse100 2) 1)) (.cse98 (+ .cse100 1))) (let ((.cse97 (mod .cse101 .cse98))) (and (not (= .cse97 0)) (not (< .cse98 0)) (exists ((v_arrayElimCell_196 Int)) (let ((.cse99 (mod v_arrayElimCell_196 .cse98))) (and (< v_arrayElimCell_196 0) (= .cse99 (+ (select .cse1 (+ .cse96 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse100 1)) (not (= .cse99 0))))) (< .cse101 0) (= .cse7 (+ .cse100 .cse97 1)) (= .cse100 .cse6)))))))) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (<= |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_241| 1))))) (exists ((|v_ULTIMATE.start_main_~i~0#1_241| Int)) (let ((.cse102 (* 8 |v_ULTIMATE.start_main_~i~0#1_241|))) (and (not (= .cse102 8)) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (<= .cse8 |ULTIMATE.start_main_~#sum~0#1.base|) (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse104 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse105 (+ .cse104 1))) (let ((.cse103 (mod (+ (* .cse104 2) 1) .cse105))) (and (not (= .cse103 0)) (= .cse7 (+ .cse104 .cse103 1)) (< .cse105 0) (exists ((v_arrayElimCell_196 Int)) (and (= (select .cse1 (+ .cse102 |c_ULTIMATE.start_main_~a~0#1.offset|)) (mod v_arrayElimCell_196 .cse105)) (not (< v_arrayElimCell_196 0)))) (= .cse104 .cse6)))))))) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (<= |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_241| 1))))) (exists ((|v_ULTIMATE.start_main_~i~0#1_241| Int)) (let ((.cse106 (* 8 |v_ULTIMATE.start_main_~i~0#1_241|))) (and (not (= .cse106 8)) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (<= |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (<= .cse8 |ULTIMATE.start_main_~#sum~0#1.base|) (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse110 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse108 (+ .cse110 1))) (let ((.cse109 (mod (+ (* .cse110 2) 1) .cse108))) (and (exists ((v_arrayElimCell_196 Int)) (let ((.cse107 (mod v_arrayElimCell_196 .cse108))) (and (= (select .cse1 (+ .cse106 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse107) (= .cse107 0)))) (not (< .cse108 0)) (= .cse7 .cse109) (= .cse110 .cse6) (= .cse109 0))))))))))) (exists ((|v_ULTIMATE.start_main_~i~0#1_241| Int)) (let ((.cse111 (* 8 |v_ULTIMATE.start_main_~i~0#1_241|))) (and (not (= .cse111 8)) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (<= |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse114 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse113 (+ .cse114 1))) (let ((.cse112 (mod (+ (* .cse114 2) 1) .cse113))) (and (= .cse7 .cse112) (< .cse113 0) (exists ((v_arrayElimCell_196 Int)) (and (= (select .cse1 (+ .cse111 |c_ULTIMATE.start_main_~a~0#1.offset|)) (mod v_arrayElimCell_196 .cse113)) (not (< v_arrayElimCell_196 0)))) (= .cse114 .cse6) (= .cse112 0)))))) (<= .cse8 |ULTIMATE.start_main_~#sum~0#1.base|)))))) (exists ((|v_ULTIMATE.start_main_~i~0#1_241| Int)) (let ((.cse115 (* 8 |v_ULTIMATE.start_main_~i~0#1_241|))) (and (not (= .cse115 8)) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (<= |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse118 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse116 (+ .cse118 1))) (let ((.cse117 (mod (+ (* .cse118 2) 1) .cse116))) (and (not (< .cse116 0)) (= .cse7 .cse117) (exists ((v_arrayElimCell_196 Int)) (and (= (select .cse1 (+ .cse115 |c_ULTIMATE.start_main_~a~0#1.offset|)) (mod v_arrayElimCell_196 .cse116)) (not (< v_arrayElimCell_196 0)))) (= .cse118 .cse6) (= .cse117 0)))))) (<= .cse8 |ULTIMATE.start_main_~#sum~0#1.base|)))))) (exists ((|v_ULTIMATE.start_main_~i~0#1_241| Int)) (let ((.cse119 (* 8 |v_ULTIMATE.start_main_~i~0#1_241|))) (and (not (= .cse119 8)) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse123 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse122 (+ (* .cse123 2) 1)) (.cse121 (+ .cse123 1))) (let ((.cse120 (mod .cse122 .cse121))) (and (not (= .cse120 0)) (not (< .cse121 0)) (< .cse122 0) (= .cse7 (+ .cse123 .cse120 1)) (exists ((v_arrayElimCell_196 Int)) (and (= (select .cse1 (+ .cse119 |c_ULTIMATE.start_main_~a~0#1.offset|)) (mod v_arrayElimCell_196 .cse121)) (not (< v_arrayElimCell_196 0)))) (= .cse123 .cse6)))))) (<= .cse8 |ULTIMATE.start_main_~#sum~0#1.base|))) (<= |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_241| 1))))) (exists ((|v_ULTIMATE.start_main_~i~0#1_241| Int)) (let ((.cse124 (* 8 |v_ULTIMATE.start_main_~i~0#1_241|))) (and (not (= .cse124 8)) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (<= |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse127 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse125 (+ .cse127 1))) (let ((.cse126 (mod (+ (* .cse127 2) 1) .cse125))) (and (exists ((v_arrayElimCell_196 Int)) (= (select .cse1 (+ .cse124 |c_ULTIMATE.start_main_~a~0#1.offset|)) (mod v_arrayElimCell_196 .cse125))) (= .cse7 .cse126) (< .cse125 0) (= .cse127 .cse6) (= .cse126 0)))))) (<= .cse8 |ULTIMATE.start_main_~#sum~0#1.base|)))))) (exists ((|v_ULTIMATE.start_main_~i~0#1_241| Int)) (let ((.cse128 (* 8 |v_ULTIMATE.start_main_~i~0#1_241|))) (and (not (= .cse128 8)) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (<= |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse130 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse131 (+ .cse130 1))) (let ((.cse129 (mod (+ (* .cse130 2) 1) .cse131))) (and (not (= .cse129 0)) (= .cse7 (+ .cse130 .cse129 1)) (< .cse131 0) (exists ((v_arrayElimCell_196 Int)) (let ((.cse132 (mod v_arrayElimCell_196 .cse131))) (and (< v_arrayElimCell_196 0) (= (select .cse1 (+ .cse128 |c_ULTIMATE.start_main_~a~0#1.offset|)) (+ .cse130 .cse132 1)) (not (= .cse132 0))))) (= .cse130 .cse6)))))) (<= .cse8 |ULTIMATE.start_main_~#sum~0#1.base|)))))) (exists ((|v_ULTIMATE.start_main_~i~0#1_241| Int)) (let ((.cse133 (* 8 |v_ULTIMATE.start_main_~i~0#1_241|))) (and (not (= .cse133 8)) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse138 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse137 (+ (* .cse138 2) 1)) (.cse136 (+ .cse138 1))) (let ((.cse134 (mod .cse137 .cse136))) (and (not (= .cse134 0)) (exists ((v_arrayElimCell_196 Int)) (let ((.cse135 (mod v_arrayElimCell_196 .cse136))) (and (= (select .cse1 (+ .cse133 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse135) (= .cse135 0)))) (not (< .cse136 0)) (< .cse137 0) (= .cse7 (+ .cse138 .cse134 1)) (= .cse138 .cse6)))))) (<= .cse8 |ULTIMATE.start_main_~#sum~0#1.base|))) (<= |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_241| 1))))) (exists ((|v_ULTIMATE.start_main_~i~0#1_241| Int)) (let ((.cse139 (* 8 |v_ULTIMATE.start_main_~i~0#1_241|))) (and (not (= .cse139 8)) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (<= |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse142 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse141 (+ .cse142 1))) (and (exists ((v_arrayElimCell_196 Int)) (let ((.cse140 (mod v_arrayElimCell_196 .cse141))) (and (= (select .cse1 (+ .cse139 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse140) (= .cse140 0)))) (not (< .cse141 0)) (= .cse7 (mod (+ (* .cse142 2) 1) .cse141)) (= .cse142 .cse6))))) (<= .cse8 |ULTIMATE.start_main_~#sum~0#1.base|)))))) (exists ((|v_ULTIMATE.start_main_~i~0#1_241| Int)) (let ((.cse143 (* 8 |v_ULTIMATE.start_main_~i~0#1_241|))) (and (not (= .cse143 8)) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (<= |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (<= .cse8 |ULTIMATE.start_main_~#sum~0#1.base|) (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse145 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse144 (+ .cse145 1))) (and (not (< .cse144 0)) (= .cse7 (mod (+ (* .cse145 2) 1) .cse144)) (exists ((v_arrayElimCell_196 Int)) (let ((.cse146 (mod v_arrayElimCell_196 .cse144))) (and (< v_arrayElimCell_196 0) (= .cse146 (+ (select .cse1 (+ .cse143 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse145 1)) (not (= .cse146 0))))) (= .cse145 .cse6)))))))))) (exists ((|v_ULTIMATE.start_main_~i~0#1_241| Int)) (let ((.cse147 (* 8 |v_ULTIMATE.start_main_~i~0#1_241|))) (and (not (= .cse147 8)) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (<= |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse151 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse150 (+ .cse151 1))) (let ((.cse148 (mod (+ (* .cse151 2) 1) .cse150))) (and (not (= .cse148 0)) (exists ((v_arrayElimCell_196 Int)) (let ((.cse149 (mod v_arrayElimCell_196 .cse150))) (and (= (select .cse1 (+ .cse147 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse149) (= .cse149 0)))) (= .cse7 (+ .cse151 .cse148 1)) (< .cse150 0) (= .cse151 .cse6)))))) (<= .cse8 |ULTIMATE.start_main_~#sum~0#1.base|)))))) (exists ((|v_ULTIMATE.start_main_~i~0#1_241| Int)) (let ((.cse152 (* 8 |v_ULTIMATE.start_main_~i~0#1_241|))) (and (not (= .cse152 8)) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (<= |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse156 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse153 (+ .cse156 1))) (let ((.cse154 (mod (+ (* .cse156 2) 1) .cse153))) (and (not (< .cse153 0)) (= .cse7 .cse154) (exists ((v_arrayElimCell_196 Int)) (let ((.cse155 (mod v_arrayElimCell_196 .cse153))) (and (< v_arrayElimCell_196 0) (= .cse155 (+ (select .cse1 (+ .cse152 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse156 1)) (not (= .cse155 0))))) (= .cse156 .cse6) (= .cse154 0)))))) (<= .cse8 |ULTIMATE.start_main_~#sum~0#1.base|)))))) (exists ((|v_ULTIMATE.start_main_~i~0#1_241| Int)) (let ((.cse159 (* 8 |v_ULTIMATE.start_main_~i~0#1_241|))) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse158 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse157 (+ .cse158 1))) (and (not (< .cse157 0)) (= .cse7 (mod (+ (* .cse158 2) 1) .cse157)) (exists ((v_arrayElimCell_196 Int)) (and (= (select .cse1 (+ .cse159 |c_ULTIMATE.start_main_~a~0#1.offset|)) (mod v_arrayElimCell_196 .cse157)) (not (< v_arrayElimCell_196 0)))) (= .cse158 .cse6))))) (<= .cse8 |ULTIMATE.start_main_~#sum~0#1.base|))) (not (= .cse159 8)) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (<= |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_241| 1))))))) (exists ((|v_ULTIMATE.start_main_~i~0#1_241| Int)) (let ((.cse160 (* 8 |v_ULTIMATE.start_main_~i~0#1_241|))) (and (not (= .cse160 8)) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (<= |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (<= .cse8 |ULTIMATE.start_main_~#sum~0#1.base|) (exists ((|v_ULTIMATE.start_main_~i~0#1_239| Int)) (let ((.cse161 (* 8 |v_ULTIMATE.start_main_~i~0#1_239|))) (and (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_239| 1)) (not (= 8 .cse161)) (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse163 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse162 (+ .cse163 1))) (and (not (< .cse162 0)) (= (select .cse1 (+ .cse161 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse162) (exists ((v_arrayElimCell_196 Int)) (and (= (select .cse1 (+ .cse160 |c_ULTIMATE.start_main_~a~0#1.offset|)) (mod v_arrayElimCell_196 .cse162)) (not (< v_arrayElimCell_196 0)))) (= .cse163 .cse6) (= .cse7 (mod .cse162 .cse162)))))) (not (= .cse160 .cse161)) (< |v_ULTIMATE.start_main_~i~0#1_239| c_~N~0))))))))) (and (or (and .cse38 (or (exists ((|v_ULTIMATE.start_main_~i~0#1_241| Int)) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse164 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse165 (+ .cse164 1))) (let ((.cse166 (mod .cse7 .cse165))) (and (= .cse7 (mod (+ (* .cse164 2) 1) .cse165)) (= .cse166 (+ (select .cse1 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_241|) |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse164 1)) (= .cse164 .cse6) (not (= .cse166 0))))))) (<= .cse8 |ULTIMATE.start_main_~#sum~0#1.base|))) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (<= |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)))) (exists ((|v_ULTIMATE.start_main_~i~0#1_241| Int)) (and (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse169 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse167 (+ .cse169 1))) (let ((.cse168 (mod .cse7 .cse167))) (and (not (< .cse167 0)) (= .cse168 (+ (select .cse1 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_241|) |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse169 1)) (= .cse7 (+ .cse169 (mod (+ (* .cse169 2) 1) .cse167) 1)) (= .cse169 .cse6) (not (= .cse168 0))))))) (<= .cse8 |ULTIMATE.start_main_~#sum~0#1.base|))) (<= |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_241| 1))))) .cse50) (and .cse14 (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_239| Int)) (let ((.cse172 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse170 (+ .cse172 1))) (let ((.cse171 (mod .cse7 .cse170))) (and (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (= (select .cse1 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_239|) |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse170) (= .cse171 (+ (select .cse1 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_241|) |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse172 1)) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_239| 1)) (<= |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)) (<= .cse8 |ULTIMATE.start_main_~#sum~0#1.base|) (< |v_ULTIMATE.start_main_~i~0#1_239| c_~N~0) (= .cse172 .cse6) (not (= .cse171 0)) (= .cse7 (mod .cse170 .cse170)))))))) (exists ((|v_ULTIMATE.start_main_~i~0#1_239| Int)) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse175 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse173 (+ .cse175 1))) (let ((.cse174 (mod .cse7 .cse173))) (and (= (select .cse1 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_239|) |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse173) (exists ((|v_ULTIMATE.start_main_~i~0#1_241| Int)) (and (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (= .cse174 (+ (select .cse1 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_241|) |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse175 1)) (<= |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)))) (= .cse175 .cse6) (not (= .cse174 0)) (= .cse7 (mod .cse173 .cse173))))))) (<= .cse8 |ULTIMATE.start_main_~#sum~0#1.base|))) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_239| 1)) (< |v_ULTIMATE.start_main_~i~0#1_239| c_~N~0))) (and .cse38 .cse50 (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse176 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse178 (+ .cse176 1))) (let ((.cse177 (mod .cse7 .cse178))) (and (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (= (+ .cse176 .cse177 1) (select .cse1 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_241|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (<= |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)) (= .cse7 (+ .cse176 (mod (+ (* .cse176 2) 1) .cse178) 1)) (<= .cse8 |ULTIMATE.start_main_~#sum~0#1.base|) (< .cse178 0) (= .cse176 .cse6) (not (= .cse177 0))))))))) .cse179) (exists ((|v_ULTIMATE.start_main_~i~0#1_241| Int)) (let ((.cse180 (* 8 |v_ULTIMATE.start_main_~i~0#1_241|))) (and (not (= .cse180 8)) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (<= .cse8 |ULTIMATE.start_main_~#sum~0#1.base|) (exists ((|v_ULTIMATE.start_main_~i~0#1_239| Int)) (let ((.cse181 (* 8 |v_ULTIMATE.start_main_~i~0#1_239|))) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse183 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse182 (+ .cse183 1))) (and (= (select .cse1 (+ .cse181 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse182) (< .cse182 0) (exists ((v_arrayElimCell_196 Int)) (let ((.cse184 (mod v_arrayElimCell_196 .cse182))) (and (< v_arrayElimCell_196 0) (= (select .cse1 (+ .cse180 |c_ULTIMATE.start_main_~a~0#1.offset|)) (+ .cse183 .cse184 1)) (not (= .cse184 0))))) (= .cse183 .cse6) (= .cse7 (mod .cse182 .cse182)))))) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_239| 1)) (not (= 8 .cse181)) (not (= .cse180 .cse181)) (< |v_ULTIMATE.start_main_~i~0#1_239| c_~N~0)))))) (<= |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_241| 1))))) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse186 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse185 (let ((.cse187 (+ .cse186 1))) (mod .cse187 .cse187)))) (and (= .cse185 .cse60) (<= .cse8 |ULTIMATE.start_main_~#sum~0#1.base|) (= .cse186 3) (= .cse7 .cse185))))) .cse57 (<= |c_ULTIMATE.start_main_~i~0#1| 3)) (and .cse57 (or (exists ((|v_ULTIMATE.start_main_~i~0#1_241| Int)) (let ((.cse188 (* 8 |v_ULTIMATE.start_main_~i~0#1_241|))) (and (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (not (= 16 .cse188)) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse190 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse189 (+ .cse190 1))) (and (= (select .cse1 (+ .cse188 |c_ULTIMATE.start_main_~a~0#1.offset|)) (mod .cse7 .cse189)) (= (* .cse190 2) .cse6) (= .cse60 .cse189) (= .cse7 (mod .cse189 .cse189)))))) (<= .cse8 |ULTIMATE.start_main_~#sum~0#1.base|))) (<= |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_241| 1))))) (and .cse17 (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse192 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse191 (+ .cse192 1))) (and (= (select .cse1 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_241|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (mod .cse7 .cse191)) (= (* .cse192 2) .cse6) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (= .cse60 .cse191) (<= |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)) (<= .cse8 |ULTIMATE.start_main_~#sum~0#1.base|) (= .cse7 (mod .cse191 .cse191))))))))) (and .cse193 (or (exists ((|v_ULTIMATE.start_main_~i~0#1_241| Int)) (let ((.cse194 (* 8 |v_ULTIMATE.start_main_~i~0#1_241|))) (and (not (= .cse194 8)) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (exists ((|v_ULTIMATE.start_main_~i~0#1_239| Int)) (let ((.cse196 (* 8 |v_ULTIMATE.start_main_~i~0#1_239|))) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse198 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse195 (+ .cse198 1))) (let ((.cse197 (mod .cse60 .cse195))) (and (not (< .cse195 0)) (= (select .cse1 (+ .cse196 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse195) (not (= .cse197 0)) (= .cse197 (+ (select .cse1 (+ .cse194 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse198 1)) (= .cse198 .cse6) (= .cse7 (mod .cse195 .cse195))))))) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_239| 1)) (not (= 8 .cse196)) (not (= .cse194 .cse196)) (< |v_ULTIMATE.start_main_~i~0#1_239| c_~N~0)))) (<= .cse8 |ULTIMATE.start_main_~#sum~0#1.base|))) (<= |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_241| 1))))) (exists ((|v_ULTIMATE.start_main_~i~0#1_241| Int)) (let ((.cse199 (* 8 |v_ULTIMATE.start_main_~i~0#1_241|))) (and (not (= .cse199 8)) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (exists ((|v_ULTIMATE.start_main_~i~0#1_239| Int)) (let ((.cse200 (* 8 |v_ULTIMATE.start_main_~i~0#1_239|))) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse203 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse201 (+ .cse203 1))) (let ((.cse202 (mod .cse60 .cse201))) (and (= (select .cse1 (+ .cse200 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse201) (= (select .cse1 (+ .cse199 |c_ULTIMATE.start_main_~a~0#1.offset|)) (+ .cse202 .cse203 1)) (not (= .cse202 0)) (< .cse201 0) (= .cse203 .cse6) (= .cse7 (mod .cse201 .cse201))))))) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_239| 1)) (not (= 8 .cse200)) (not (= .cse199 .cse200)) (< |v_ULTIMATE.start_main_~i~0#1_239| c_~N~0)))) (<= .cse8 |ULTIMATE.start_main_~#sum~0#1.base|))) (<= |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_241| 1))))))) (and .cse57 (or (exists ((|v_ULTIMATE.start_main_~i~0#1_241| Int)) (let ((.cse206 (* 8 |v_ULTIMATE.start_main_~i~0#1_241|))) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse204 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse205 (+ .cse204 1))) (and (= (* .cse204 2) .cse6) (= .cse60 .cse205) (exists ((v_arrayElimCell_196 Int)) (and (= (select .cse1 (+ .cse206 |c_ULTIMATE.start_main_~a~0#1.offset|)) (mod v_arrayElimCell_196 .cse205)) (not (< v_arrayElimCell_196 0)))) (= .cse7 (mod .cse205 .cse205)))))) (<= .cse8 |ULTIMATE.start_main_~#sum~0#1.base|))) (not (= .cse206 8)) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (not (= 16 .cse206)) (<= |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_241| 1))))) (and .cse86 (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse208 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse207 (* 8 |v_ULTIMATE.start_main_~i~0#1_241|)) (.cse209 (+ .cse208 1))) (and (not (= .cse207 8)) (= (* .cse208 2) .cse6) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (= .cse60 .cse209) (<= |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)) (<= .cse8 |ULTIMATE.start_main_~#sum~0#1.base|) (= (mod .cse60 .cse209) (select .cse1 (+ .cse207 |c_ULTIMATE.start_main_~a~0#1.offset|))) (= .cse7 (mod .cse209 .cse209))))))) (exists ((|v_ULTIMATE.start_main_~i~0#1_241| Int)) (let ((.cse210 (* 8 |v_ULTIMATE.start_main_~i~0#1_241|))) (and (not (= .cse210 8)) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (<= .cse8 |ULTIMATE.start_main_~#sum~0#1.base|) (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse211 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse213 (+ .cse211 1))) (and (= (* .cse211 2) .cse6) (exists ((v_arrayElimCell_196 Int)) (let ((.cse212 (mod v_arrayElimCell_196 .cse213))) (and (= (select .cse1 (+ .cse210 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse212) (= .cse212 0)))) (= .cse60 .cse213) (= .cse7 (mod .cse213 .cse213)))))))) (not (= 16 .cse210)) (<= |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_241| 1))))) (exists ((|v_ULTIMATE.start_main_~i~0#1_241| Int)) (let ((.cse214 (* 8 |v_ULTIMATE.start_main_~i~0#1_241|))) (and (not (= .cse214 8)) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse215 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse216 (+ .cse215 1))) (and (= (* .cse215 2) .cse6) (= .cse60 .cse216) (exists ((v_arrayElimCell_196 Int)) (let ((.cse217 (mod v_arrayElimCell_196 .cse216))) (and (< v_arrayElimCell_196 0) (= .cse217 (+ (select .cse1 (+ .cse214 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse215 1)) (not (= .cse217 0))))) (= .cse7 (mod .cse216 .cse216)))))) (<= .cse8 |ULTIMATE.start_main_~#sum~0#1.base|))) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (not (= 16 .cse214)) (<= |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_241| 1))))) (exists ((|v_ULTIMATE.start_main_~i~0#1_241| Int)) (let ((.cse218 (* 8 |v_ULTIMATE.start_main_~i~0#1_241|))) (and (not (= .cse218 8)) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (<= .cse8 |ULTIMATE.start_main_~#sum~0#1.base|) (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse219 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse220 (+ .cse219 1))) (and (= (* .cse219 2) .cse6) (= .cse60 .cse220) (= (mod .cse60 .cse220) (select .cse1 (+ .cse218 |c_ULTIMATE.start_main_~a~0#1.offset|))) (= .cse7 (mod .cse220 .cse220)))))))) (<= |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_241| 1))))))) (and (or (exists ((|v_ULTIMATE.start_main_~i~0#1_241| Int)) (and (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (<= |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse222 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse221 (+ .cse222 1))) (and (not (< .cse221 0)) (exists ((v_arrayElimCell_196 Int)) (and (= (select .cse1 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_241|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (mod v_arrayElimCell_196 .cse221)) (not (< v_arrayElimCell_196 0)))) (= .cse222 .cse6) (= .cse7 (mod .cse221 .cse221)))))) (<= .cse8 |ULTIMATE.start_main_~#sum~0#1.base|))))) (exists ((|v_ULTIMATE.start_main_~i~0#1_241| Int)) (and (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (<= |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (<= .cse8 |ULTIMATE.start_main_~#sum~0#1.base|) (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse225 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse224 (+ .cse225 1))) (and (exists ((v_arrayElimCell_196 Int)) (let ((.cse223 (mod v_arrayElimCell_196 .cse224))) (and (= (select .cse1 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_241|) |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse223) (= .cse223 0)))) (< .cse224 0) (= .cse225 .cse6) (= .cse7 (mod .cse224 .cse224)))))))))) (exists ((|v_ULTIMATE.start_main_~i~0#1_241| Int)) (and (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse227 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse226 (+ .cse227 1))) (and (< .cse226 0) (exists ((v_arrayElimCell_196 Int)) (let ((.cse228 (mod v_arrayElimCell_196 .cse226))) (and (< v_arrayElimCell_196 0) (= (select .cse1 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_241|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (+ .cse227 .cse228 1)) (not (= .cse228 0))))) (= .cse227 .cse6) (= .cse7 (mod .cse226 .cse226)))))) (<= .cse8 |ULTIMATE.start_main_~#sum~0#1.base|))) (<= |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)))) (exists ((|v_ULTIMATE.start_main_~i~0#1_241| Int)) (and (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse231 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse229 (+ .cse231 1))) (and (not (< .cse229 0)) (exists ((v_arrayElimCell_196 Int)) (let ((.cse230 (mod v_arrayElimCell_196 .cse229))) (and (< v_arrayElimCell_196 0) (= .cse230 (+ (select .cse1 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_241|) |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse231 1)) (not (= .cse230 0))))) (= .cse231 .cse6) (= .cse7 (mod .cse229 .cse229)))))) (<= .cse8 |ULTIMATE.start_main_~#sum~0#1.base|))) (<= |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)))) (exists ((|v_ULTIMATE.start_main_~i~0#1_241| Int)) (and (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse233 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse232 (+ .cse233 1))) (and (< .cse232 0) (exists ((v_arrayElimCell_196 Int)) (and (= (select .cse1 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_241|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (mod v_arrayElimCell_196 .cse232)) (not (< v_arrayElimCell_196 0)))) (= .cse233 .cse6) (= .cse7 (mod .cse232 .cse232)))))) (<= .cse8 |ULTIMATE.start_main_~#sum~0#1.base|))) (<= |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)))) (exists ((|v_ULTIMATE.start_main_~i~0#1_241| Int)) (and (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse236 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse235 (+ .cse236 1))) (and (exists ((v_arrayElimCell_196 Int)) (let ((.cse234 (mod v_arrayElimCell_196 .cse235))) (and (= (select .cse1 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_241|) |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse234) (= .cse234 0)))) (not (< .cse235 0)) (= .cse236 .cse6) (= .cse7 (mod .cse235 .cse235)))))) (<= .cse8 |ULTIMATE.start_main_~#sum~0#1.base|))) (<= |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_241| 1))))) (<= c_~N~0 1) (< 0 c_~N~0)) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_239| Int)) (let ((.cse238 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse237 (+ .cse238 1))) (and (= (select .cse1 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_241|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (mod .cse7 .cse237)) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (= (select .cse1 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_239|) |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse237) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_239| 1)) (<= |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)) (<= .cse8 |ULTIMATE.start_main_~#sum~0#1.base|) (< .cse237 0) (< |v_ULTIMATE.start_main_~i~0#1_239| c_~N~0) (= .cse238 .cse6) (= .cse7 (mod .cse237 .cse237)))))) .cse17) (exists ((|v_ULTIMATE.start_main_~i~0#1_241| Int)) (let ((.cse239 (* 8 |v_ULTIMATE.start_main_~i~0#1_241|))) (and (not (= .cse239 8)) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (exists ((|v_ULTIMATE.start_main_~i~0#1_239| Int)) (let ((.cse240 (* 8 |v_ULTIMATE.start_main_~i~0#1_239|))) (and (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_239| 1)) (not (= 8 .cse240)) (not (= .cse239 .cse240)) (< |v_ULTIMATE.start_main_~i~0#1_239| c_~N~0) (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse243 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse241 (+ .cse243 1))) (let ((.cse242 (mod .cse60 .cse241))) (and (= (select .cse1 (+ .cse240 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse241) (= .cse242 (select .cse1 (+ .cse239 |c_ULTIMATE.start_main_~a~0#1.offset|))) (= .cse243 .cse6) (= .cse242 0) (= .cse7 (mod .cse241 .cse241)))))))))) (<= .cse8 |ULTIMATE.start_main_~#sum~0#1.base|))) (<= |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_241| 1))))) (exists ((|v_ULTIMATE.start_main_~i~0#1_241| Int)) (let ((.cse244 (* 8 |v_ULTIMATE.start_main_~i~0#1_241|))) (and (not (= .cse244 8)) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (<= |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (<= .cse8 |ULTIMATE.start_main_~#sum~0#1.base|) (exists ((|v_ULTIMATE.start_main_~i~0#1_239| Int)) (let ((.cse247 (* 8 |v_ULTIMATE.start_main_~i~0#1_239|))) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse248 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse246 (+ .cse248 1))) (and (exists ((v_arrayElimCell_196 Int)) (let ((.cse245 (mod v_arrayElimCell_196 .cse246))) (and (= (select .cse1 (+ .cse244 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse245) (= .cse245 0)))) (= (select .cse1 (+ .cse247 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse246) (< .cse246 0) (= .cse248 .cse6) (= .cse7 (mod .cse246 .cse246)))))) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_239| 1)) (not (= 8 .cse247)) (not (= .cse244 .cse247)) (< |v_ULTIMATE.start_main_~i~0#1_239| c_~N~0))))))))) (exists ((|v_ULTIMATE.start_main_~i~0#1_241| Int)) (let ((.cse249 (* 8 |v_ULTIMATE.start_main_~i~0#1_241|))) (and (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (not (= 16 .cse249)) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_239| Int)) (let ((.cse252 (* 8 |v_ULTIMATE.start_main_~i~0#1_239|)) (.cse253 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse251 (+ .cse253 1)) (.cse250 (select .cse1 (+ .cse252 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (and (= (select .cse1 (+ .cse249 |c_ULTIMATE.start_main_~a~0#1.offset|)) (mod .cse250 .cse251)) (= .cse250 .cse251) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_239| 1)) (= .cse7 .cse250) (<= .cse8 |ULTIMATE.start_main_~#sum~0#1.base|) (not (= 8 .cse252)) (< |v_ULTIMATE.start_main_~i~0#1_239| c_~N~0) (= .cse253 .cse6) (= (mod .cse251 .cse251) .cse250))))) (<= |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_241| 1))))) (and .cse38 .cse50 (or (and (or (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse258 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse257 (+ (* .cse258 2) 1)) (.cse256 (+ .cse258 1))) (let ((.cse254 (mod .cse257 .cse256))) (let ((.cse255 (+ .cse258 .cse254 1))) (and (not (= .cse254 0)) (= .cse7 (mod .cse255 .cse256)) (< .cse257 0) (not (< .cse255 0)) (= .cse258 .cse6))))))) (<= .cse8 |ULTIMATE.start_main_~#sum~0#1.base|))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (<= .cse8 |ULTIMATE.start_main_~#sum~0#1.base|) (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse261 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse260 (+ .cse261 1))) (let ((.cse262 (mod (+ (* .cse261 2) 1) .cse260))) (let ((.cse259 (mod .cse262 .cse260))) (and (= .cse259 .cse7) (= .cse259 0) (not (< .cse260 0)) (= .cse261 .cse6) (= .cse262 0))))))))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse265 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse264 (+ .cse265 1))) (let ((.cse263 (mod (+ (* .cse265 2) 1) .cse264))) (and (= (mod .cse263 .cse264) .cse7) (not (< .cse263 0)) (not (< .cse264 0)) (= .cse265 .cse6)))))) (<= .cse8 |ULTIMATE.start_main_~#sum~0#1.base|))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse268 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse267 (+ .cse268 1))) (let ((.cse266 (mod (mod (+ (* .cse268 2) 1) .cse267) .cse267))) (and (= .cse266 .cse7) (= .cse266 0) (not (< .cse267 0)) (= .cse268 .cse6)))))) (<= .cse8 |ULTIMATE.start_main_~#sum~0#1.base|))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse271 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse270 (+ .cse271 1))) (let ((.cse269 (mod (+ (* .cse271 2) 1) .cse270))) (and (= (mod .cse269 .cse270) .cse7) (= .cse271 .cse6) (= .cse269 0) (<= 0 .cse270)))))) (<= .cse8 |ULTIMATE.start_main_~#sum~0#1.base|))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (<= .cse8 |ULTIMATE.start_main_~#sum~0#1.base|) (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse274 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse275 (+ .cse274 1))) (let ((.cse272 (mod (+ (* .cse274 2) 1) .cse275))) (let ((.cse273 (mod (+ .cse274 .cse272 1) .cse275))) (and (not (= .cse272 0)) (= .cse7 .cse273) (= .cse273 0) (= .cse274 .cse6)))))))))) .cse51) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse278 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse276 (+ .cse278 1))) (let ((.cse277 (mod (+ (* .cse278 2) 1) .cse276))) (and (= (select .cse1 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_241|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (mod .cse7 .cse276)) (not (< .cse276 0)) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (= .cse7 .cse277) (<= |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)) (<= .cse8 |ULTIMATE.start_main_~#sum~0#1.base|) (= .cse278 .cse6) (= .cse277 0)))))) .cse17) (exists ((|v_ULTIMATE.start_main_~i~0#1_241| Int)) (and (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (<= |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse282 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse280 (+ .cse282 1))) (let ((.cse279 (mod .cse7 .cse280)) (.cse281 (mod (+ (* .cse282 2) 1) .cse280))) (and (= (select .cse1 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_241|) |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse279) (not (< .cse280 0)) (= .cse279 0) (= .cse7 .cse281) (= .cse282 .cse6) (= .cse281 0)))))) (<= .cse8 |ULTIMATE.start_main_~#sum~0#1.base|))))) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse284 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse283 (+ .cse284 1))) (and (= (select .cse1 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_241|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (mod .cse7 .cse283)) (not (< .cse283 0)) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (= .cse7 (mod (+ (* .cse284 2) 1) .cse283)) (<= |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)) (<= .cse8 |ULTIMATE.start_main_~#sum~0#1.base|) (= .cse284 .cse6))))) .cse17) (exists ((|v_ULTIMATE.start_main_~i~0#1_241| Int)) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse287 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse286 (+ .cse287 1))) (let ((.cse285 (mod .cse7 .cse286))) (and (= (select .cse1 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_241|) |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse285) (not (< .cse286 0)) (= .cse285 0) (= .cse7 (mod (+ (* .cse287 2) 1) .cse286)) (= .cse287 .cse6)))))) (<= .cse8 |ULTIMATE.start_main_~#sum~0#1.base|))) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (<= |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)))) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse291 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse290 (+ (* .cse291 2) 1)) (.cse288 (+ .cse291 1))) (let ((.cse289 (mod .cse290 .cse288))) (and (= (select .cse1 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_241|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (mod .cse7 .cse288)) (not (= .cse289 0)) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (<= |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)) (< .cse290 0) (= .cse7 (+ .cse291 .cse289 1)) (<= .cse8 |ULTIMATE.start_main_~#sum~0#1.base|) (= .cse291 .cse6)))))) .cse17) (exists ((|v_ULTIMATE.start_main_~i~0#1_241| Int)) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse294 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse295 (+ .cse294 1))) (let ((.cse292 (mod .cse7 .cse295)) (.cse293 (mod (+ (* .cse294 2) 1) .cse295))) (and (= (select .cse1 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_241|) |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse292) (not (= .cse293 0)) (= .cse292 0) (= .cse7 (+ .cse294 .cse293 1)) (= .cse294 .cse6)))))) (<= .cse8 |ULTIMATE.start_main_~#sum~0#1.base|))) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (<= |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_241| 1))))))))))) (<= c_~N~0 3) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) is different from false [2022-11-18 19:55:19,610 WARN L837 $PredicateComparison]: unable to prove that (and (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse7 (select .cse6 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse13 (select .cse6 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|))) (.cse90 (< .cse7 0))) (let ((.cse18 (not .cse90)) (.cse16 (<= c_~N~0 2)) (.cse24 (< 1 c_~N~0)) (.cse1 (+ 2 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse4 (+ .cse13 2))) (or (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse3 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse2 (+ .cse3 1))) (let ((.cse0 (* 8 |v_ULTIMATE.start_main_~i~0#1_241|)) (.cse5 (mod .cse2 .cse2))) (and (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)) (not (= .cse0 8)) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (<= .cse1 |ULTIMATE.start_main_~#sum~0#1.base|) (< .cse2 0) (= .cse3 .cse4) (= .cse5 (select .cse6 (+ .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|))) (= .cse7 .cse5)))))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_239| Int)) (let ((.cse10 (* 8 |v_ULTIMATE.start_main_~i~0#1_239|)) (.cse11 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse9 (+ .cse11 1)) (.cse8 (select .cse6 (+ .cse10 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (and (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (= .cse8 .cse9) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_239| 1)) (= .cse7 .cse8) (<= .cse1 |ULTIMATE.start_main_~#sum~0#1.base|) (not (= 8 .cse10)) (< |v_ULTIMATE.start_main_~i~0#1_239| c_~N~0) (= .cse11 .cse4) (= (mod .cse9 .cse9) .cse8))))) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse14 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse12 (let ((.cse15 (+ .cse14 1))) (mod .cse15 .cse15)))) (and (= .cse12 .cse13) (<= .cse1 |ULTIMATE.start_main_~#sum~0#1.base|) (= .cse14 3) (= .cse7 .cse12))))) (< 2 c_~N~0)) (and .cse16 (let ((.cse17 (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse23 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse22 (+ .cse23 1))) (and (= (select .cse6 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_241|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (mod .cse7 .cse22)) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (<= .cse1 |ULTIMATE.start_main_~#sum~0#1.base|) (< .cse22 0) (= .cse23 .cse4) (= (mod (+ (* .cse23 2) 1) .cse22) 0))))))) (or (and .cse17 .cse18) .cse17 (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse21 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse20 (+ .cse21 1))) (let ((.cse19 (mod (+ (* .cse21 2) 1) .cse20))) (and (= (mod .cse19 .cse20) .cse7) (<= .cse1 |ULTIMATE.start_main_~#sum~0#1.base|) (< .cse20 0) (= .cse21 .cse4) (= .cse19 0)))))))) .cse24) (and .cse16 (let ((.cse27 (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse58 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse56 (+ .cse58 1))) (let ((.cse57 (mod (+ (* .cse58 2) 1) .cse56))) (and (= (select .cse6 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_241|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (mod .cse7 .cse56)) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)) (not (< .cse56 0)) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (= .cse7 .cse57) (<= .cse1 |ULTIMATE.start_main_~#sum~0#1.base|) (= .cse58 .cse4) (= .cse57 0)))))))) (or (and (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse26 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse25 (+ .cse26 1))) (and (= (select .cse6 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_241|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (mod .cse7 .cse25)) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)) (not (< .cse25 0)) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (= .cse7 (mod (+ (* .cse26 2) 1) .cse25)) (<= .cse1 |ULTIMATE.start_main_~#sum~0#1.base|) (= .cse26 .cse4))))) .cse18) (and .cse27 .cse18) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse32 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse31 (+ (* .cse32 2) 1)) (.cse30 (+ .cse32 1))) (let ((.cse28 (mod .cse31 .cse30))) (let ((.cse29 (+ .cse32 .cse28 1))) (and (not (= .cse28 0)) (= .cse7 (mod .cse29 .cse30)) (< .cse31 0) (not (< .cse29 0)) (= .cse32 .cse4))))))) (<= .cse1 |ULTIMATE.start_main_~#sum~0#1.base|))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (<= .cse1 |ULTIMATE.start_main_~#sum~0#1.base|) (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse35 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse34 (+ .cse35 1))) (let ((.cse36 (mod (+ (* .cse35 2) 1) .cse34))) (let ((.cse33 (mod .cse36 .cse34))) (and (= .cse33 .cse7) (= .cse33 0) (not (< .cse34 0)) (= .cse35 .cse4) (= .cse36 0))))))))) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse39 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse37 (+ .cse39 1))) (let ((.cse38 (mod (+ (* .cse39 2) 1) .cse37))) (and (= (select .cse6 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_241|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (mod .cse7 .cse37)) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)) (not (= .cse38 0)) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (= .cse7 (+ .cse39 .cse38 1)) (<= .cse1 |ULTIMATE.start_main_~#sum~0#1.base|) (= .cse39 .cse4)))))) .cse18) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse42 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse41 (+ .cse42 1))) (let ((.cse40 (mod (+ (* .cse42 2) 1) .cse41))) (and (= (mod .cse40 .cse41) .cse7) (not (< .cse40 0)) (not (< .cse41 0)) (= .cse42 .cse4)))))) (<= .cse1 |ULTIMATE.start_main_~#sum~0#1.base|))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse45 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse44 (+ .cse45 1))) (let ((.cse43 (mod (mod (+ (* .cse45 2) 1) .cse44) .cse44))) (and (= .cse43 .cse7) (= .cse43 0) (not (< .cse44 0)) (= .cse45 .cse4)))))) (<= .cse1 |ULTIMATE.start_main_~#sum~0#1.base|))) .cse27 (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse48 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse47 (+ .cse48 1))) (let ((.cse46 (mod .cse7 .cse47))) (and (= (select .cse6 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_241|) |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse46) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)) (not (< .cse47 0)) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (= .cse46 0) (= .cse7 (mod (+ (* .cse48 2) 1) .cse47)) (<= .cse1 |ULTIMATE.start_main_~#sum~0#1.base|) (= .cse48 .cse4)))))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse51 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse50 (+ .cse51 1))) (let ((.cse49 (mod (+ (* .cse51 2) 1) .cse50))) (and (= (mod .cse49 .cse50) .cse7) (= .cse51 .cse4) (= .cse49 0) (<= 0 .cse50)))))) (<= .cse1 |ULTIMATE.start_main_~#sum~0#1.base|))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (<= .cse1 |ULTIMATE.start_main_~#sum~0#1.base|) (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse54 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse55 (+ .cse54 1))) (let ((.cse52 (mod (+ (* .cse54 2) 1) .cse55))) (let ((.cse53 (mod (+ .cse54 .cse52 1) .cse55))) (and (not (= .cse52 0)) (= .cse7 .cse53) (= .cse53 0) (= .cse54 .cse4))))))))))) .cse24) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse61 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse60 (+ .cse61 1))) (let ((.cse59 (* 8 |v_ULTIMATE.start_main_~i~0#1_241|)) (.cse62 (mod .cse60 .cse60))) (and (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)) (not (= .cse59 8)) (not (< .cse60 0)) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (not (= 16 .cse59)) (<= .cse1 |ULTIMATE.start_main_~#sum~0#1.base|) (= .cse61 .cse4) (= .cse62 (select .cse6 (+ .cse59 |c_ULTIMATE.start_main_~a~0#1.offset|))) (= .cse7 .cse62)))))) (and (or (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (v_arrayElimCell_196 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse64 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse63 (+ .cse64 1))) (and (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)) (= (select .cse6 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_241|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (mod v_arrayElimCell_196 .cse63)) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (not (< v_arrayElimCell_196 0)) (<= .cse1 |ULTIMATE.start_main_~#sum~0#1.base|) (< .cse63 0) (= .cse64 .cse4) (= .cse7 (mod .cse63 .cse63)))))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (v_arrayElimCell_196 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse67 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse66 (+ .cse67 1))) (let ((.cse65 (mod v_arrayElimCell_196 .cse66))) (and (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)) (= (select .cse6 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_241|) |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse65) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (= .cse65 0) (<= .cse1 |ULTIMATE.start_main_~#sum~0#1.base|) (< .cse66 0) (= .cse67 .cse4) (= .cse7 (mod .cse66 .cse66))))))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (v_arrayElimCell_196 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse70 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse69 (+ .cse70 1))) (let ((.cse68 (mod v_arrayElimCell_196 .cse69))) (and (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)) (= (select .cse6 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_241|) |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse68) (not (< .cse69 0)) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (= .cse68 0) (<= .cse1 |ULTIMATE.start_main_~#sum~0#1.base|) (= .cse70 .cse4) (= .cse7 (mod .cse69 .cse69))))))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (v_arrayElimCell_196 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse73 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse71 (+ .cse73 1))) (let ((.cse72 (mod v_arrayElimCell_196 .cse71))) (and (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)) (not (< .cse71 0)) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (< v_arrayElimCell_196 0) (= .cse72 (+ (select .cse6 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_241|) |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse73 1)) (<= .cse1 |ULTIMATE.start_main_~#sum~0#1.base|) (= .cse73 .cse4) (not (= .cse72 0)) (= .cse7 (mod .cse71 .cse71))))))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (v_arrayElimCell_196 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse74 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse76 (+ .cse74 1))) (let ((.cse75 (mod v_arrayElimCell_196 .cse76))) (and (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (< v_arrayElimCell_196 0) (= (select .cse6 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_241|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (+ .cse74 .cse75 1)) (<= .cse1 |ULTIMATE.start_main_~#sum~0#1.base|) (< .cse76 0) (= .cse74 .cse4) (not (= .cse75 0)) (= .cse7 (mod .cse76 .cse76))))))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (v_arrayElimCell_196 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse78 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse77 (+ .cse78 1))) (and (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)) (= (select .cse6 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_241|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (mod v_arrayElimCell_196 .cse77)) (not (< .cse77 0)) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (not (< v_arrayElimCell_196 0)) (<= .cse1 |ULTIMATE.start_main_~#sum~0#1.base|) (= .cse78 .cse4) (= .cse7 (mod .cse77 .cse77))))))) (<= c_~N~0 1) (< 0 c_~N~0)) (and (or (and .cse16 (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse80 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse81 (+ .cse80 1))) (let ((.cse79 (mod (+ .cse80 (mod (+ (* .cse80 2) 1) .cse81) 1) .cse81))) (and (= .cse7 (+ .cse79 .cse80 1)) (<= .cse1 |ULTIMATE.start_main_~#sum~0#1.base|) (not (= .cse79 0)) (< .cse81 0) (= .cse80 .cse4))))))) (and .cse16 (or (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (<= .cse1 |ULTIMATE.start_main_~#sum~0#1.base|) (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse85 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse83 (+ .cse85 1))) (let ((.cse82 (+ .cse85 (mod (+ (* .cse85 2) 1) .cse83) 1))) (let ((.cse84 (mod .cse82 .cse83))) (and (< .cse82 0) (not (< .cse83 0)) (not (= .cse84 0)) (= .cse84 (+ .cse7 .cse85 1)) (= .cse85 .cse4))))))))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (<= .cse1 |ULTIMATE.start_main_~#sum~0#1.base|) (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse87 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse89 (+ .cse87 1))) (let ((.cse88 (mod (+ (* .cse87 2) 1) .cse89))) (let ((.cse86 (mod .cse88 .cse89))) (and (= .cse86 (+ .cse7 .cse87 1)) (not (= .cse86 0)) (< .cse88 0) (= .cse87 .cse4)))))))))))) .cse24) (and .cse90 (or (and (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse91 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse92 (+ .cse91 1))) (and (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (= .cse7 (+ .cse91 (mod (+ (* .cse91 2) 1) .cse92) 1)) (<= .cse1 |ULTIMATE.start_main_~#sum~0#1.base|) (< .cse92 0) (= .cse91 .cse4) (not (= (mod .cse7 .cse92) 0)))))) .cse16 .cse24) (and .cse16 .cse24 (or (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse93 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse94 (+ .cse93 1))) (and (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (= .cse7 (mod (+ (* .cse93 2) 1) .cse94)) (= (mod .cse7 .cse94) (+ (select .cse6 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_241|) |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse93 1)) (<= .cse1 |ULTIMATE.start_main_~#sum~0#1.base|) (= .cse93 .cse4))))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse96 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse95 (+ .cse96 1))) (and (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (= (mod .cse7 .cse95) (+ (select .cse6 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_241|) |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse96 1)) (= .cse7 (+ .cse96 (mod (+ (* .cse96 2) 1) .cse95) 1)) (<= .cse1 |ULTIMATE.start_main_~#sum~0#1.base|) (= .cse96 .cse4))))))))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_239| Int)) (let ((.cse100 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse99 (* 8 |v_ULTIMATE.start_main_~i~0#1_239|))) (let ((.cse97 (select .cse6 (+ .cse99 |c_ULTIMATE.start_main_~a~0#1.offset|))) (.cse98 (+ .cse100 1))) (and (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)) (= (select .cse6 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_241|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (mod .cse97 .cse98)) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (= .cse97 .cse98) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_239| 1)) (<= .cse1 |ULTIMATE.start_main_~#sum~0#1.base|) (not (= 8 .cse99)) (< |v_ULTIMATE.start_main_~i~0#1_239| c_~N~0) (= .cse100 .cse4) (= .cse7 (mod .cse98 .cse98))))))))))) (<= c_~N~0 3) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) is different from false [2022-11-18 19:55:24,233 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~i~0#1| 0) (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse7 (select .cse6 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse9 (select .cse6 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|))) (.cse90 (< .cse7 0))) (let ((.cse14 (not .cse90)) (.cse12 (<= c_~N~0 2)) (.cse20 (< 1 c_~N~0)) (.cse1 (+ 2 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse4 (+ .cse9 2))) (or (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse3 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse2 (+ .cse3 1))) (let ((.cse0 (* 8 |v_ULTIMATE.start_main_~i~0#1_241|)) (.cse5 (mod .cse2 .cse2))) (and (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)) (not (= .cse0 8)) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (<= .cse1 |ULTIMATE.start_main_~#sum~0#1.base|) (< .cse2 0) (= .cse3 .cse4) (= .cse5 (select .cse6 (+ .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|))) (= .cse7 .cse5)))))) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse10 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse8 (let ((.cse11 (+ .cse10 1))) (mod .cse11 .cse11)))) (and (= .cse8 .cse9) (<= .cse1 |ULTIMATE.start_main_~#sum~0#1.base|) (= .cse10 3) (= .cse7 .cse8))))) (< 2 c_~N~0)) (and .cse12 (let ((.cse13 (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse19 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse18 (+ .cse19 1))) (and (= (select .cse6 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_241|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (mod .cse7 .cse18)) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (<= .cse1 |ULTIMATE.start_main_~#sum~0#1.base|) (< .cse18 0) (= .cse19 .cse4) (= (mod (+ (* .cse19 2) 1) .cse18) 0))))))) (or (and .cse13 .cse14) .cse13 (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse17 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse16 (+ .cse17 1))) (let ((.cse15 (mod (+ (* .cse17 2) 1) .cse16))) (and (= (mod .cse15 .cse16) .cse7) (<= .cse1 |ULTIMATE.start_main_~#sum~0#1.base|) (< .cse16 0) (= .cse17 .cse4) (= .cse15 0)))))))) .cse20) (and .cse12 (let ((.cse23 (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse54 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse52 (+ .cse54 1))) (let ((.cse53 (mod (+ (* .cse54 2) 1) .cse52))) (and (= (select .cse6 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_241|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (mod .cse7 .cse52)) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)) (not (< .cse52 0)) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (= .cse7 .cse53) (<= .cse1 |ULTIMATE.start_main_~#sum~0#1.base|) (= .cse54 .cse4) (= .cse53 0)))))))) (or (and (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse22 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse21 (+ .cse22 1))) (and (= (select .cse6 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_241|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (mod .cse7 .cse21)) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)) (not (< .cse21 0)) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (= .cse7 (mod (+ (* .cse22 2) 1) .cse21)) (<= .cse1 |ULTIMATE.start_main_~#sum~0#1.base|) (= .cse22 .cse4))))) .cse14) (and .cse23 .cse14) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse28 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse27 (+ (* .cse28 2) 1)) (.cse26 (+ .cse28 1))) (let ((.cse24 (mod .cse27 .cse26))) (let ((.cse25 (+ .cse28 .cse24 1))) (and (not (= .cse24 0)) (= .cse7 (mod .cse25 .cse26)) (< .cse27 0) (not (< .cse25 0)) (= .cse28 .cse4))))))) (<= .cse1 |ULTIMATE.start_main_~#sum~0#1.base|))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (<= .cse1 |ULTIMATE.start_main_~#sum~0#1.base|) (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse31 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse30 (+ .cse31 1))) (let ((.cse32 (mod (+ (* .cse31 2) 1) .cse30))) (let ((.cse29 (mod .cse32 .cse30))) (and (= .cse29 .cse7) (= .cse29 0) (not (< .cse30 0)) (= .cse31 .cse4) (= .cse32 0))))))))) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse35 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse33 (+ .cse35 1))) (let ((.cse34 (mod (+ (* .cse35 2) 1) .cse33))) (and (= (select .cse6 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_241|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (mod .cse7 .cse33)) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)) (not (= .cse34 0)) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (= .cse7 (+ .cse35 .cse34 1)) (<= .cse1 |ULTIMATE.start_main_~#sum~0#1.base|) (= .cse35 .cse4)))))) .cse14) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse38 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse37 (+ .cse38 1))) (let ((.cse36 (mod (+ (* .cse38 2) 1) .cse37))) (and (= (mod .cse36 .cse37) .cse7) (not (< .cse36 0)) (not (< .cse37 0)) (= .cse38 .cse4)))))) (<= .cse1 |ULTIMATE.start_main_~#sum~0#1.base|))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse41 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse40 (+ .cse41 1))) (let ((.cse39 (mod (mod (+ (* .cse41 2) 1) .cse40) .cse40))) (and (= .cse39 .cse7) (= .cse39 0) (not (< .cse40 0)) (= .cse41 .cse4)))))) (<= .cse1 |ULTIMATE.start_main_~#sum~0#1.base|))) .cse23 (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse44 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse43 (+ .cse44 1))) (let ((.cse42 (mod .cse7 .cse43))) (and (= (select .cse6 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_241|) |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse42) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)) (not (< .cse43 0)) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (= .cse42 0) (= .cse7 (mod (+ (* .cse44 2) 1) .cse43)) (<= .cse1 |ULTIMATE.start_main_~#sum~0#1.base|) (= .cse44 .cse4)))))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse47 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse46 (+ .cse47 1))) (let ((.cse45 (mod (+ (* .cse47 2) 1) .cse46))) (and (= (mod .cse45 .cse46) .cse7) (= .cse47 .cse4) (= .cse45 0) (<= 0 .cse46)))))) (<= .cse1 |ULTIMATE.start_main_~#sum~0#1.base|))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (<= .cse1 |ULTIMATE.start_main_~#sum~0#1.base|) (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse50 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse51 (+ .cse50 1))) (let ((.cse48 (mod (+ (* .cse50 2) 1) .cse51))) (let ((.cse49 (mod (+ .cse50 .cse48 1) .cse51))) (and (not (= .cse48 0)) (= .cse7 .cse49) (= .cse49 0) (= .cse50 .cse4))))))))))) .cse20) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse57 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse56 (+ .cse57 1))) (let ((.cse55 (* 8 |v_ULTIMATE.start_main_~i~0#1_241|)) (.cse58 (mod .cse56 .cse56))) (and (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)) (not (= .cse55 8)) (not (< .cse56 0)) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (not (= 16 .cse55)) (<= .cse1 |ULTIMATE.start_main_~#sum~0#1.base|) (= .cse57 .cse4) (= .cse58 (select .cse6 (+ .cse55 |c_ULTIMATE.start_main_~a~0#1.offset|))) (= .cse7 .cse58)))))) (and (or (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (v_arrayElimCell_196 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse60 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse59 (+ .cse60 1))) (and (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)) (= (select .cse6 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_241|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (mod v_arrayElimCell_196 .cse59)) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (not (< v_arrayElimCell_196 0)) (<= .cse1 |ULTIMATE.start_main_~#sum~0#1.base|) (< .cse59 0) (= .cse60 .cse4) (= .cse7 (mod .cse59 .cse59)))))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (v_arrayElimCell_196 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse63 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse62 (+ .cse63 1))) (let ((.cse61 (mod v_arrayElimCell_196 .cse62))) (and (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)) (= (select .cse6 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_241|) |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse61) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (= .cse61 0) (<= .cse1 |ULTIMATE.start_main_~#sum~0#1.base|) (< .cse62 0) (= .cse63 .cse4) (= .cse7 (mod .cse62 .cse62))))))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (v_arrayElimCell_196 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse66 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse65 (+ .cse66 1))) (let ((.cse64 (mod v_arrayElimCell_196 .cse65))) (and (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)) (= (select .cse6 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_241|) |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse64) (not (< .cse65 0)) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (= .cse64 0) (<= .cse1 |ULTIMATE.start_main_~#sum~0#1.base|) (= .cse66 .cse4) (= .cse7 (mod .cse65 .cse65))))))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (v_arrayElimCell_196 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse69 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse67 (+ .cse69 1))) (let ((.cse68 (mod v_arrayElimCell_196 .cse67))) (and (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)) (not (< .cse67 0)) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (< v_arrayElimCell_196 0) (= .cse68 (+ (select .cse6 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_241|) |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse69 1)) (<= .cse1 |ULTIMATE.start_main_~#sum~0#1.base|) (= .cse69 .cse4) (not (= .cse68 0)) (= .cse7 (mod .cse67 .cse67))))))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (v_arrayElimCell_196 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse70 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse72 (+ .cse70 1))) (let ((.cse71 (mod v_arrayElimCell_196 .cse72))) (and (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (< v_arrayElimCell_196 0) (= (select .cse6 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_241|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (+ .cse70 .cse71 1)) (<= .cse1 |ULTIMATE.start_main_~#sum~0#1.base|) (< .cse72 0) (= .cse70 .cse4) (not (= .cse71 0)) (= .cse7 (mod .cse72 .cse72))))))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (v_arrayElimCell_196 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse74 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse73 (+ .cse74 1))) (and (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)) (= (select .cse6 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_241|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (mod v_arrayElimCell_196 .cse73)) (not (< .cse73 0)) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (not (< v_arrayElimCell_196 0)) (<= .cse1 |ULTIMATE.start_main_~#sum~0#1.base|) (= .cse74 .cse4) (= .cse7 (mod .cse73 .cse73))))))) (<= c_~N~0 1) (< 0 c_~N~0)) (and (or (and .cse12 (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse76 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse77 (+ .cse76 1))) (let ((.cse75 (mod (+ .cse76 (mod (+ (* .cse76 2) 1) .cse77) 1) .cse77))) (and (= .cse7 (+ .cse75 .cse76 1)) (<= .cse1 |ULTIMATE.start_main_~#sum~0#1.base|) (not (= .cse75 0)) (< .cse77 0) (= .cse76 .cse4))))))) (and .cse12 (or (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (<= .cse1 |ULTIMATE.start_main_~#sum~0#1.base|) (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse81 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse79 (+ .cse81 1))) (let ((.cse78 (+ .cse81 (mod (+ (* .cse81 2) 1) .cse79) 1))) (let ((.cse80 (mod .cse78 .cse79))) (and (< .cse78 0) (not (< .cse79 0)) (not (= .cse80 0)) (= .cse80 (+ .cse7 .cse81 1)) (= .cse81 .cse4))))))))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (<= .cse1 |ULTIMATE.start_main_~#sum~0#1.base|) (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse83 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse85 (+ .cse83 1))) (let ((.cse84 (mod (+ (* .cse83 2) 1) .cse85))) (let ((.cse82 (mod .cse84 .cse85))) (and (= .cse82 (+ .cse7 .cse83 1)) (not (= .cse82 0)) (< .cse84 0) (= .cse83 .cse4)))))))))))) .cse20) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_239| Int)) (let ((.cse88 (* 8 |v_ULTIMATE.start_main_~i~0#1_239|)) (.cse89 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse87 (+ .cse89 1)) (.cse86 (select .cse6 (+ .cse88 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (and (= .cse86 .cse87) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_239| 1)) (= .cse7 .cse86) (<= .cse1 |ULTIMATE.start_main_~#sum~0#1.base|) (not (= 8 .cse88)) (< |v_ULTIMATE.start_main_~i~0#1_239| c_~N~0) (= .cse89 .cse4) (= (mod .cse87 .cse87) .cse86))))) (and .cse90 (or (and (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse91 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse92 (+ .cse91 1))) (and (= .cse7 (+ .cse91 (mod (+ (* .cse91 2) 1) .cse92) 1)) (<= .cse1 |ULTIMATE.start_main_~#sum~0#1.base|) (< .cse92 0) (= .cse91 .cse4) (not (= (mod .cse7 .cse92) 0)))))) .cse12 .cse20) (and .cse12 .cse20 (or (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse93 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse94 (+ .cse93 1))) (and (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (= .cse7 (mod (+ (* .cse93 2) 1) .cse94)) (= (mod .cse7 .cse94) (+ (select .cse6 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_241|) |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse93 1)) (<= .cse1 |ULTIMATE.start_main_~#sum~0#1.base|) (= .cse93 .cse4))))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse96 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse95 (+ .cse96 1))) (and (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (= (mod .cse7 .cse95) (+ (select .cse6 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_241|) |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse96 1)) (= .cse7 (+ .cse96 (mod (+ (* .cse96 2) 1) .cse95) 1)) (<= .cse1 |ULTIMATE.start_main_~#sum~0#1.base|) (= .cse96 .cse4))))))))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_239| Int)) (let ((.cse100 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse99 (* 8 |v_ULTIMATE.start_main_~i~0#1_239|))) (let ((.cse97 (select .cse6 (+ .cse99 |c_ULTIMATE.start_main_~a~0#1.offset|))) (.cse98 (+ .cse100 1))) (and (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)) (= (select .cse6 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_241|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (mod .cse97 .cse98)) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (= .cse97 .cse98) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_239| 1)) (<= .cse1 |ULTIMATE.start_main_~#sum~0#1.base|) (not (= 8 .cse99)) (< |v_ULTIMATE.start_main_~i~0#1_239| c_~N~0) (= .cse100 .cse4) (= .cse7 (mod .cse98 .cse98))))))))))) (<= c_~N~0 3) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) is different from false [2022-11-18 19:55:36,698 WARN L837 $PredicateComparison]: unable to prove that (and (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse7 (select .cse6 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse9 (select .cse6 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|))) (.cse90 (< .cse7 0))) (let ((.cse14 (not .cse90)) (.cse12 (<= c_~N~0 2)) (.cse20 (< 1 c_~N~0)) (.cse1 (+ 2 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse4 (+ .cse9 2))) (or (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse3 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse2 (+ .cse3 1))) (let ((.cse0 (* 8 |v_ULTIMATE.start_main_~i~0#1_241|)) (.cse5 (mod .cse2 .cse2))) (and (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)) (not (= .cse0 8)) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (<= .cse1 |ULTIMATE.start_main_~#sum~0#1.base|) (< .cse2 0) (= .cse3 .cse4) (= .cse5 (select .cse6 (+ .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|))) (= .cse7 .cse5)))))) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse10 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse8 (let ((.cse11 (+ .cse10 1))) (mod .cse11 .cse11)))) (and (= .cse8 .cse9) (<= .cse1 |ULTIMATE.start_main_~#sum~0#1.base|) (= .cse10 3) (= .cse7 .cse8))))) (< 2 c_~N~0)) (and .cse12 (let ((.cse13 (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse19 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse18 (+ .cse19 1))) (and (= (select .cse6 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_241|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (mod .cse7 .cse18)) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (<= .cse1 |ULTIMATE.start_main_~#sum~0#1.base|) (< .cse18 0) (= .cse19 .cse4) (= (mod (+ (* .cse19 2) 1) .cse18) 0))))))) (or (and .cse13 .cse14) .cse13 (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse17 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse16 (+ .cse17 1))) (let ((.cse15 (mod (+ (* .cse17 2) 1) .cse16))) (and (= (mod .cse15 .cse16) .cse7) (<= .cse1 |ULTIMATE.start_main_~#sum~0#1.base|) (< .cse16 0) (= .cse17 .cse4) (= .cse15 0)))))))) .cse20) (and .cse12 (let ((.cse23 (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse54 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse52 (+ .cse54 1))) (let ((.cse53 (mod (+ (* .cse54 2) 1) .cse52))) (and (= (select .cse6 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_241|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (mod .cse7 .cse52)) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)) (not (< .cse52 0)) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (= .cse7 .cse53) (<= .cse1 |ULTIMATE.start_main_~#sum~0#1.base|) (= .cse54 .cse4) (= .cse53 0)))))))) (or (and (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse22 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse21 (+ .cse22 1))) (and (= (select .cse6 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_241|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (mod .cse7 .cse21)) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)) (not (< .cse21 0)) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (= .cse7 (mod (+ (* .cse22 2) 1) .cse21)) (<= .cse1 |ULTIMATE.start_main_~#sum~0#1.base|) (= .cse22 .cse4))))) .cse14) (and .cse23 .cse14) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse28 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse27 (+ (* .cse28 2) 1)) (.cse26 (+ .cse28 1))) (let ((.cse24 (mod .cse27 .cse26))) (let ((.cse25 (+ .cse28 .cse24 1))) (and (not (= .cse24 0)) (= .cse7 (mod .cse25 .cse26)) (< .cse27 0) (not (< .cse25 0)) (= .cse28 .cse4))))))) (<= .cse1 |ULTIMATE.start_main_~#sum~0#1.base|))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (<= .cse1 |ULTIMATE.start_main_~#sum~0#1.base|) (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse31 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse30 (+ .cse31 1))) (let ((.cse32 (mod (+ (* .cse31 2) 1) .cse30))) (let ((.cse29 (mod .cse32 .cse30))) (and (= .cse29 .cse7) (= .cse29 0) (not (< .cse30 0)) (= .cse31 .cse4) (= .cse32 0))))))))) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse35 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse33 (+ .cse35 1))) (let ((.cse34 (mod (+ (* .cse35 2) 1) .cse33))) (and (= (select .cse6 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_241|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (mod .cse7 .cse33)) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)) (not (= .cse34 0)) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (= .cse7 (+ .cse35 .cse34 1)) (<= .cse1 |ULTIMATE.start_main_~#sum~0#1.base|) (= .cse35 .cse4)))))) .cse14) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse38 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse37 (+ .cse38 1))) (let ((.cse36 (mod (+ (* .cse38 2) 1) .cse37))) (and (= (mod .cse36 .cse37) .cse7) (not (< .cse36 0)) (not (< .cse37 0)) (= .cse38 .cse4)))))) (<= .cse1 |ULTIMATE.start_main_~#sum~0#1.base|))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse41 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse40 (+ .cse41 1))) (let ((.cse39 (mod (mod (+ (* .cse41 2) 1) .cse40) .cse40))) (and (= .cse39 .cse7) (= .cse39 0) (not (< .cse40 0)) (= .cse41 .cse4)))))) (<= .cse1 |ULTIMATE.start_main_~#sum~0#1.base|))) .cse23 (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse44 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse43 (+ .cse44 1))) (let ((.cse42 (mod .cse7 .cse43))) (and (= (select .cse6 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_241|) |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse42) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)) (not (< .cse43 0)) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (= .cse42 0) (= .cse7 (mod (+ (* .cse44 2) 1) .cse43)) (<= .cse1 |ULTIMATE.start_main_~#sum~0#1.base|) (= .cse44 .cse4)))))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse47 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse46 (+ .cse47 1))) (let ((.cse45 (mod (+ (* .cse47 2) 1) .cse46))) (and (= (mod .cse45 .cse46) .cse7) (= .cse47 .cse4) (= .cse45 0) (<= 0 .cse46)))))) (<= .cse1 |ULTIMATE.start_main_~#sum~0#1.base|))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (<= .cse1 |ULTIMATE.start_main_~#sum~0#1.base|) (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse50 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse51 (+ .cse50 1))) (let ((.cse48 (mod (+ (* .cse50 2) 1) .cse51))) (let ((.cse49 (mod (+ .cse50 .cse48 1) .cse51))) (and (not (= .cse48 0)) (= .cse7 .cse49) (= .cse49 0) (= .cse50 .cse4))))))))))) .cse20) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse57 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse56 (+ .cse57 1))) (let ((.cse55 (* 8 |v_ULTIMATE.start_main_~i~0#1_241|)) (.cse58 (mod .cse56 .cse56))) (and (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)) (not (= .cse55 8)) (not (< .cse56 0)) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (not (= 16 .cse55)) (<= .cse1 |ULTIMATE.start_main_~#sum~0#1.base|) (= .cse57 .cse4) (= .cse58 (select .cse6 (+ .cse55 |c_ULTIMATE.start_main_~a~0#1.offset|))) (= .cse7 .cse58)))))) (and (or (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (v_arrayElimCell_196 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse60 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse59 (+ .cse60 1))) (and (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)) (= (select .cse6 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_241|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (mod v_arrayElimCell_196 .cse59)) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (not (< v_arrayElimCell_196 0)) (<= .cse1 |ULTIMATE.start_main_~#sum~0#1.base|) (< .cse59 0) (= .cse60 .cse4) (= .cse7 (mod .cse59 .cse59)))))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (v_arrayElimCell_196 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse63 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse62 (+ .cse63 1))) (let ((.cse61 (mod v_arrayElimCell_196 .cse62))) (and (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)) (= (select .cse6 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_241|) |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse61) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (= .cse61 0) (<= .cse1 |ULTIMATE.start_main_~#sum~0#1.base|) (< .cse62 0) (= .cse63 .cse4) (= .cse7 (mod .cse62 .cse62))))))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (v_arrayElimCell_196 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse66 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse65 (+ .cse66 1))) (let ((.cse64 (mod v_arrayElimCell_196 .cse65))) (and (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)) (= (select .cse6 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_241|) |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse64) (not (< .cse65 0)) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (= .cse64 0) (<= .cse1 |ULTIMATE.start_main_~#sum~0#1.base|) (= .cse66 .cse4) (= .cse7 (mod .cse65 .cse65))))))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (v_arrayElimCell_196 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse69 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse67 (+ .cse69 1))) (let ((.cse68 (mod v_arrayElimCell_196 .cse67))) (and (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)) (not (< .cse67 0)) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (< v_arrayElimCell_196 0) (= .cse68 (+ (select .cse6 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_241|) |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse69 1)) (<= .cse1 |ULTIMATE.start_main_~#sum~0#1.base|) (= .cse69 .cse4) (not (= .cse68 0)) (= .cse7 (mod .cse67 .cse67))))))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (v_arrayElimCell_196 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse70 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse72 (+ .cse70 1))) (let ((.cse71 (mod v_arrayElimCell_196 .cse72))) (and (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (< v_arrayElimCell_196 0) (= (select .cse6 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_241|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (+ .cse70 .cse71 1)) (<= .cse1 |ULTIMATE.start_main_~#sum~0#1.base|) (< .cse72 0) (= .cse70 .cse4) (not (= .cse71 0)) (= .cse7 (mod .cse72 .cse72))))))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (v_arrayElimCell_196 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse74 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse73 (+ .cse74 1))) (and (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)) (= (select .cse6 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_241|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (mod v_arrayElimCell_196 .cse73)) (not (< .cse73 0)) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (not (< v_arrayElimCell_196 0)) (<= .cse1 |ULTIMATE.start_main_~#sum~0#1.base|) (= .cse74 .cse4) (= .cse7 (mod .cse73 .cse73))))))) (<= c_~N~0 1) (< 0 c_~N~0)) (and (or (and .cse12 (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse76 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse77 (+ .cse76 1))) (let ((.cse75 (mod (+ .cse76 (mod (+ (* .cse76 2) 1) .cse77) 1) .cse77))) (and (= .cse7 (+ .cse75 .cse76 1)) (<= .cse1 |ULTIMATE.start_main_~#sum~0#1.base|) (not (= .cse75 0)) (< .cse77 0) (= .cse76 .cse4))))))) (and .cse12 (or (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (<= .cse1 |ULTIMATE.start_main_~#sum~0#1.base|) (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse81 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse79 (+ .cse81 1))) (let ((.cse78 (+ .cse81 (mod (+ (* .cse81 2) 1) .cse79) 1))) (let ((.cse80 (mod .cse78 .cse79))) (and (< .cse78 0) (not (< .cse79 0)) (not (= .cse80 0)) (= .cse80 (+ .cse7 .cse81 1)) (= .cse81 .cse4))))))))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (<= .cse1 |ULTIMATE.start_main_~#sum~0#1.base|) (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse83 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse85 (+ .cse83 1))) (let ((.cse84 (mod (+ (* .cse83 2) 1) .cse85))) (let ((.cse82 (mod .cse84 .cse85))) (and (= .cse82 (+ .cse7 .cse83 1)) (not (= .cse82 0)) (< .cse84 0) (= .cse83 .cse4)))))))))))) .cse20) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_239| Int)) (let ((.cse88 (* 8 |v_ULTIMATE.start_main_~i~0#1_239|)) (.cse89 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse87 (+ .cse89 1)) (.cse86 (select .cse6 (+ .cse88 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (and (= .cse86 .cse87) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_239| 1)) (= .cse7 .cse86) (<= .cse1 |ULTIMATE.start_main_~#sum~0#1.base|) (not (= 8 .cse88)) (< |v_ULTIMATE.start_main_~i~0#1_239| c_~N~0) (= .cse89 .cse4) (= (mod .cse87 .cse87) .cse86))))) (and .cse90 (or (and (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse91 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse92 (+ .cse91 1))) (and (= .cse7 (+ .cse91 (mod (+ (* .cse91 2) 1) .cse92) 1)) (<= .cse1 |ULTIMATE.start_main_~#sum~0#1.base|) (< .cse92 0) (= .cse91 .cse4) (not (= (mod .cse7 .cse92) 0)))))) .cse12 .cse20) (and .cse12 .cse20 (or (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse93 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse94 (+ .cse93 1))) (and (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (= .cse7 (mod (+ (* .cse93 2) 1) .cse94)) (= (mod .cse7 .cse94) (+ (select .cse6 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_241|) |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse93 1)) (<= .cse1 |ULTIMATE.start_main_~#sum~0#1.base|) (= .cse93 .cse4))))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse96 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse95 (+ .cse96 1))) (and (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (= (mod .cse7 .cse95) (+ (select .cse6 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_241|) |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse96 1)) (= .cse7 (+ .cse96 (mod (+ (* .cse96 2) 1) .cse95) 1)) (<= .cse1 |ULTIMATE.start_main_~#sum~0#1.base|) (= .cse96 .cse4))))))))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_239| Int)) (let ((.cse100 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse99 (* 8 |v_ULTIMATE.start_main_~i~0#1_239|))) (let ((.cse97 (select .cse6 (+ .cse99 |c_ULTIMATE.start_main_~a~0#1.offset|))) (.cse98 (+ .cse100 1))) (and (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)) (= (select .cse6 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_241|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (mod .cse97 .cse98)) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (= .cse97 .cse98) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_239| 1)) (<= .cse1 |ULTIMATE.start_main_~#sum~0#1.base|) (not (= 8 .cse99)) (< |v_ULTIMATE.start_main_~i~0#1_239| c_~N~0) (= .cse100 .cse4) (= .cse7 (mod .cse98 .cse98))))))))))) (<= c_~N~0 3) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= |c_ULTIMATE.start_main_~i~0#1| 1)) is different from false [2022-11-18 19:55:41,338 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (let ((.cse0 (= (select .cse1 (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|)) 0))) (or (and (not .cse0) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| 0)) (and .cse0 (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| 1)))) (let ((.cse8 (select .cse1 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse10 (select .cse1 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|))) (.cse91 (< .cse8 0))) (let ((.cse15 (not .cse91)) (.cse13 (<= c_~N~0 2)) (.cse21 (< 1 c_~N~0)) (.cse3 (+ 2 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse6 (+ .cse10 2))) (or (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse5 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse4 (+ .cse5 1))) (let ((.cse2 (* 8 |v_ULTIMATE.start_main_~i~0#1_241|)) (.cse7 (mod .cse4 .cse4))) (and (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)) (not (= .cse2 8)) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (<= .cse3 |ULTIMATE.start_main_~#sum~0#1.base|) (< .cse4 0) (= .cse5 .cse6) (= .cse7 (select .cse1 (+ .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|))) (= .cse8 .cse7)))))) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse11 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse9 (let ((.cse12 (+ .cse11 1))) (mod .cse12 .cse12)))) (and (= .cse9 .cse10) (<= .cse3 |ULTIMATE.start_main_~#sum~0#1.base|) (= .cse11 3) (= .cse8 .cse9))))) (< 2 c_~N~0)) (and .cse13 (let ((.cse14 (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse20 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse19 (+ .cse20 1))) (and (= (select .cse1 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_241|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (mod .cse8 .cse19)) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (<= .cse3 |ULTIMATE.start_main_~#sum~0#1.base|) (< .cse19 0) (= .cse20 .cse6) (= (mod (+ (* .cse20 2) 1) .cse19) 0))))))) (or (and .cse14 .cse15) .cse14 (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse18 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse17 (+ .cse18 1))) (let ((.cse16 (mod (+ (* .cse18 2) 1) .cse17))) (and (= (mod .cse16 .cse17) .cse8) (<= .cse3 |ULTIMATE.start_main_~#sum~0#1.base|) (< .cse17 0) (= .cse18 .cse6) (= .cse16 0)))))))) .cse21) (and .cse13 (let ((.cse24 (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse55 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse53 (+ .cse55 1))) (let ((.cse54 (mod (+ (* .cse55 2) 1) .cse53))) (and (= (select .cse1 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_241|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (mod .cse8 .cse53)) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)) (not (< .cse53 0)) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (= .cse8 .cse54) (<= .cse3 |ULTIMATE.start_main_~#sum~0#1.base|) (= .cse55 .cse6) (= .cse54 0)))))))) (or (and (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse23 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse22 (+ .cse23 1))) (and (= (select .cse1 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_241|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (mod .cse8 .cse22)) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)) (not (< .cse22 0)) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (= .cse8 (mod (+ (* .cse23 2) 1) .cse22)) (<= .cse3 |ULTIMATE.start_main_~#sum~0#1.base|) (= .cse23 .cse6))))) .cse15) (and .cse24 .cse15) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse29 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse28 (+ (* .cse29 2) 1)) (.cse27 (+ .cse29 1))) (let ((.cse25 (mod .cse28 .cse27))) (let ((.cse26 (+ .cse29 .cse25 1))) (and (not (= .cse25 0)) (= .cse8 (mod .cse26 .cse27)) (< .cse28 0) (not (< .cse26 0)) (= .cse29 .cse6))))))) (<= .cse3 |ULTIMATE.start_main_~#sum~0#1.base|))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (<= .cse3 |ULTIMATE.start_main_~#sum~0#1.base|) (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse32 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse31 (+ .cse32 1))) (let ((.cse33 (mod (+ (* .cse32 2) 1) .cse31))) (let ((.cse30 (mod .cse33 .cse31))) (and (= .cse30 .cse8) (= .cse30 0) (not (< .cse31 0)) (= .cse32 .cse6) (= .cse33 0))))))))) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse36 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse34 (+ .cse36 1))) (let ((.cse35 (mod (+ (* .cse36 2) 1) .cse34))) (and (= (select .cse1 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_241|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (mod .cse8 .cse34)) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)) (not (= .cse35 0)) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (= .cse8 (+ .cse36 .cse35 1)) (<= .cse3 |ULTIMATE.start_main_~#sum~0#1.base|) (= .cse36 .cse6)))))) .cse15) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse39 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse38 (+ .cse39 1))) (let ((.cse37 (mod (+ (* .cse39 2) 1) .cse38))) (and (= (mod .cse37 .cse38) .cse8) (not (< .cse37 0)) (not (< .cse38 0)) (= .cse39 .cse6)))))) (<= .cse3 |ULTIMATE.start_main_~#sum~0#1.base|))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse42 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse41 (+ .cse42 1))) (let ((.cse40 (mod (mod (+ (* .cse42 2) 1) .cse41) .cse41))) (and (= .cse40 .cse8) (= .cse40 0) (not (< .cse41 0)) (= .cse42 .cse6)))))) (<= .cse3 |ULTIMATE.start_main_~#sum~0#1.base|))) .cse24 (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse45 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse44 (+ .cse45 1))) (let ((.cse43 (mod .cse8 .cse44))) (and (= (select .cse1 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_241|) |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse43) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)) (not (< .cse44 0)) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (= .cse43 0) (= .cse8 (mod (+ (* .cse45 2) 1) .cse44)) (<= .cse3 |ULTIMATE.start_main_~#sum~0#1.base|) (= .cse45 .cse6)))))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse48 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse47 (+ .cse48 1))) (let ((.cse46 (mod (+ (* .cse48 2) 1) .cse47))) (and (= (mod .cse46 .cse47) .cse8) (= .cse48 .cse6) (= .cse46 0) (<= 0 .cse47)))))) (<= .cse3 |ULTIMATE.start_main_~#sum~0#1.base|))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (<= .cse3 |ULTIMATE.start_main_~#sum~0#1.base|) (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse51 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse52 (+ .cse51 1))) (let ((.cse49 (mod (+ (* .cse51 2) 1) .cse52))) (let ((.cse50 (mod (+ .cse51 .cse49 1) .cse52))) (and (not (= .cse49 0)) (= .cse8 .cse50) (= .cse50 0) (= .cse51 .cse6))))))))))) .cse21) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse58 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse57 (+ .cse58 1))) (let ((.cse56 (* 8 |v_ULTIMATE.start_main_~i~0#1_241|)) (.cse59 (mod .cse57 .cse57))) (and (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)) (not (= .cse56 8)) (not (< .cse57 0)) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (not (= 16 .cse56)) (<= .cse3 |ULTIMATE.start_main_~#sum~0#1.base|) (= .cse58 .cse6) (= .cse59 (select .cse1 (+ .cse56 |c_ULTIMATE.start_main_~a~0#1.offset|))) (= .cse8 .cse59)))))) (and (or (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (v_arrayElimCell_196 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse61 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse60 (+ .cse61 1))) (and (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)) (= (select .cse1 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_241|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (mod v_arrayElimCell_196 .cse60)) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (not (< v_arrayElimCell_196 0)) (<= .cse3 |ULTIMATE.start_main_~#sum~0#1.base|) (< .cse60 0) (= .cse61 .cse6) (= .cse8 (mod .cse60 .cse60)))))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (v_arrayElimCell_196 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse64 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse63 (+ .cse64 1))) (let ((.cse62 (mod v_arrayElimCell_196 .cse63))) (and (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)) (= (select .cse1 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_241|) |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse62) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (= .cse62 0) (<= .cse3 |ULTIMATE.start_main_~#sum~0#1.base|) (< .cse63 0) (= .cse64 .cse6) (= .cse8 (mod .cse63 .cse63))))))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (v_arrayElimCell_196 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse67 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse66 (+ .cse67 1))) (let ((.cse65 (mod v_arrayElimCell_196 .cse66))) (and (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)) (= (select .cse1 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_241|) |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse65) (not (< .cse66 0)) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (= .cse65 0) (<= .cse3 |ULTIMATE.start_main_~#sum~0#1.base|) (= .cse67 .cse6) (= .cse8 (mod .cse66 .cse66))))))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (v_arrayElimCell_196 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse70 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse68 (+ .cse70 1))) (let ((.cse69 (mod v_arrayElimCell_196 .cse68))) (and (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)) (not (< .cse68 0)) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (< v_arrayElimCell_196 0) (= .cse69 (+ (select .cse1 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_241|) |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse70 1)) (<= .cse3 |ULTIMATE.start_main_~#sum~0#1.base|) (= .cse70 .cse6) (not (= .cse69 0)) (= .cse8 (mod .cse68 .cse68))))))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (v_arrayElimCell_196 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse71 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse73 (+ .cse71 1))) (let ((.cse72 (mod v_arrayElimCell_196 .cse73))) (and (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (< v_arrayElimCell_196 0) (= (select .cse1 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_241|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (+ .cse71 .cse72 1)) (<= .cse3 |ULTIMATE.start_main_~#sum~0#1.base|) (< .cse73 0) (= .cse71 .cse6) (not (= .cse72 0)) (= .cse8 (mod .cse73 .cse73))))))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (v_arrayElimCell_196 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse75 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse74 (+ .cse75 1))) (and (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)) (= (select .cse1 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_241|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (mod v_arrayElimCell_196 .cse74)) (not (< .cse74 0)) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (not (< v_arrayElimCell_196 0)) (<= .cse3 |ULTIMATE.start_main_~#sum~0#1.base|) (= .cse75 .cse6) (= .cse8 (mod .cse74 .cse74))))))) (<= c_~N~0 1) (< 0 c_~N~0)) (and (or (and .cse13 (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse77 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse78 (+ .cse77 1))) (let ((.cse76 (mod (+ .cse77 (mod (+ (* .cse77 2) 1) .cse78) 1) .cse78))) (and (= .cse8 (+ .cse76 .cse77 1)) (<= .cse3 |ULTIMATE.start_main_~#sum~0#1.base|) (not (= .cse76 0)) (< .cse78 0) (= .cse77 .cse6))))))) (and .cse13 (or (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (<= .cse3 |ULTIMATE.start_main_~#sum~0#1.base|) (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse82 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse80 (+ .cse82 1))) (let ((.cse79 (+ .cse82 (mod (+ (* .cse82 2) 1) .cse80) 1))) (let ((.cse81 (mod .cse79 .cse80))) (and (< .cse79 0) (not (< .cse80 0)) (not (= .cse81 0)) (= .cse81 (+ .cse8 .cse82 1)) (= .cse82 .cse6))))))))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (<= .cse3 |ULTIMATE.start_main_~#sum~0#1.base|) (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse84 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse86 (+ .cse84 1))) (let ((.cse85 (mod (+ (* .cse84 2) 1) .cse86))) (let ((.cse83 (mod .cse85 .cse86))) (and (= .cse83 (+ .cse8 .cse84 1)) (not (= .cse83 0)) (< .cse85 0) (= .cse84 .cse6)))))))))))) .cse21) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_239| Int)) (let ((.cse89 (* 8 |v_ULTIMATE.start_main_~i~0#1_239|)) (.cse90 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse88 (+ .cse90 1)) (.cse87 (select .cse1 (+ .cse89 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (and (= .cse87 .cse88) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_239| 1)) (= .cse8 .cse87) (<= .cse3 |ULTIMATE.start_main_~#sum~0#1.base|) (not (= 8 .cse89)) (< |v_ULTIMATE.start_main_~i~0#1_239| c_~N~0) (= .cse90 .cse6) (= (mod .cse88 .cse88) .cse87))))) (and .cse91 (or (and (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse92 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse93 (+ .cse92 1))) (and (= .cse8 (+ .cse92 (mod (+ (* .cse92 2) 1) .cse93) 1)) (<= .cse3 |ULTIMATE.start_main_~#sum~0#1.base|) (< .cse93 0) (= .cse92 .cse6) (not (= (mod .cse8 .cse93) 0)))))) .cse13 .cse21) (and .cse13 .cse21 (or (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse94 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse95 (+ .cse94 1))) (and (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (= .cse8 (mod (+ (* .cse94 2) 1) .cse95)) (= (mod .cse8 .cse95) (+ (select .cse1 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_241|) |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse94 1)) (<= .cse3 |ULTIMATE.start_main_~#sum~0#1.base|) (= .cse94 .cse6))))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse97 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse96 (+ .cse97 1))) (and (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (= (mod .cse8 .cse96) (+ (select .cse1 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_241|) |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse97 1)) (= .cse8 (+ .cse97 (mod (+ (* .cse97 2) 1) .cse96) 1)) (<= .cse3 |ULTIMATE.start_main_~#sum~0#1.base|) (= .cse97 .cse6))))))))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_239| Int)) (let ((.cse101 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse100 (* 8 |v_ULTIMATE.start_main_~i~0#1_239|))) (let ((.cse98 (select .cse1 (+ .cse100 |c_ULTIMATE.start_main_~a~0#1.offset|))) (.cse99 (+ .cse101 1))) (and (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)) (= (select .cse1 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_241|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (mod .cse98 .cse99)) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (= .cse98 .cse99) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_239| 1)) (<= .cse3 |ULTIMATE.start_main_~#sum~0#1.base|) (not (= 8 .cse100)) (< |v_ULTIMATE.start_main_~i~0#1_239| c_~N~0) (= .cse101 .cse6) (= .cse8 (mod .cse99 .cse99)))))))))) (<= c_~N~0 3) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= |c_ULTIMATE.start_main_~i~0#1| 1))) is different from false [2022-11-18 19:55:45,466 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= (select .cse0 (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|)) 0) (let ((.cse34 (select .cse0 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse17 (select .cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (.cse7 (<= c_~N~0 2)) (.cse8 (< 1 c_~N~0)) (.cse3 (+ 2 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse6 (+ .cse34 2))) (or (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_239| Int)) (let ((.cse5 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse4 (* 8 |v_ULTIMATE.start_main_~i~0#1_239|))) (let ((.cse1 (select .cse0 (+ .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|))) (.cse2 (+ .cse5 1))) (and (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)) (= (select .cse0 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_241|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (mod .cse1 .cse2)) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (= .cse1 .cse2) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_239| 1)) (<= .cse3 |ULTIMATE.start_main_~#sum~0#1.base|) (not (= 8 .cse4)) (< |v_ULTIMATE.start_main_~i~0#1_239| c_~N~0) (= .cse5 .cse6))))) (and .cse7 .cse8 (or (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (<= .cse3 |ULTIMATE.start_main_~#sum~0#1.base|) (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse11 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse10 (+ .cse11 1))) (let ((.cse9 (mod (+ (* .cse11 2) 1) .cse10))) (and (= (mod .cse9 .cse10) 0) (not (< .cse10 0)) (= .cse11 .cse6) (= .cse9 0)))))))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse13 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse14 (+ .cse13 1))) (let ((.cse12 (mod (+ (* .cse13 2) 1) .cse14))) (and (not (= .cse12 0)) (= (mod (+ .cse13 .cse12 1) .cse14) 0) (= .cse13 .cse6)))))) (<= .cse3 |ULTIMATE.start_main_~#sum~0#1.base|))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse18 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse16 (+ .cse18 1))) (let ((.cse15 (mod (+ (* .cse18 2) 1) .cse16))) (and (= (mod .cse15 .cse16) .cse17) (not (< .cse15 0)) (not (< .cse16 0)) (= .cse18 .cse6)))))) (<= .cse3 |ULTIMATE.start_main_~#sum~0#1.base|))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse21 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse20 (+ .cse21 1))) (let ((.cse19 (mod (+ (* .cse21 2) 1) .cse20))) (and (= (mod .cse19 .cse20) .cse17) (= .cse21 .cse6) (= .cse19 0) (<= 0 .cse20)))))) (<= .cse3 |ULTIMATE.start_main_~#sum~0#1.base|))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse23 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse22 (+ .cse23 1))) (and (= (select .cse0 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_241|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (mod .cse17 .cse22)) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)) (not (< .cse22 0)) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (<= .cse3 |ULTIMATE.start_main_~#sum~0#1.base|) (= .cse23 .cse6) (= (mod (+ (* .cse23 2) 1) .cse22) 0))))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse27 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse26 (+ .cse27 1))) (let ((.cse24 (mod (+ (* .cse27 2) 1) .cse26))) (let ((.cse25 (+ .cse27 .cse24 1))) (and (not (= .cse24 0)) (= .cse17 (mod .cse25 .cse26)) (not (< .cse25 0)) (= .cse27 .cse6))))))) (<= .cse3 |ULTIMATE.start_main_~#sum~0#1.base|))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse29 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse28 (+ .cse29 1))) (and (= (select .cse0 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_241|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (mod .cse17 .cse28)) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)) (not (< .cse28 0)) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (= .cse17 (mod (+ (* .cse29 2) 1) .cse28)) (<= .cse3 |ULTIMATE.start_main_~#sum~0#1.base|) (= .cse29 .cse6))))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse30 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse31 (+ .cse30 1))) (and (= (mod (mod (+ (* .cse30 2) 1) .cse31) .cse31) 0) (not (< .cse31 0)) (= .cse30 .cse6))))) (<= .cse3 |ULTIMATE.start_main_~#sum~0#1.base|))))) (and (< 2 c_~N~0) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse33 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (and (= (let ((.cse32 (+ .cse33 1))) (mod .cse32 .cse32)) .cse34) (<= .cse3 |ULTIMATE.start_main_~#sum~0#1.base|) (= .cse33 3))))) (and (or (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (v_arrayElimCell_196 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse37 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse36 (+ .cse37 1))) (let ((.cse35 (mod v_arrayElimCell_196 .cse36))) (and (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)) (= (select .cse0 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_241|) |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse35) (not (< .cse36 0)) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (= .cse35 0) (<= .cse3 |ULTIMATE.start_main_~#sum~0#1.base|) (= .cse37 .cse6) (= .cse17 (mod .cse36 .cse36))))))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (v_arrayElimCell_196 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse40 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse38 (+ .cse40 1))) (let ((.cse39 (mod v_arrayElimCell_196 .cse38))) (and (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)) (not (< .cse38 0)) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (< v_arrayElimCell_196 0) (= .cse39 (+ (select .cse0 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_241|) |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse40 1)) (<= .cse3 |ULTIMATE.start_main_~#sum~0#1.base|) (= .cse40 .cse6) (not (= .cse39 0)) (= .cse17 (mod .cse38 .cse38))))))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (v_arrayElimCell_196 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse41 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse43 (+ .cse41 1))) (let ((.cse42 (mod v_arrayElimCell_196 .cse43))) (and (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (< v_arrayElimCell_196 0) (= (select .cse0 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_241|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (+ .cse41 .cse42 1)) (<= .cse3 |ULTIMATE.start_main_~#sum~0#1.base|) (< .cse43 0) (= .cse41 .cse6) (not (= .cse42 0))))))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (v_arrayElimCell_196 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse45 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse44 (+ .cse45 1))) (and (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)) (= (select .cse0 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_241|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (mod v_arrayElimCell_196 .cse44)) (not (< .cse44 0)) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (not (< v_arrayElimCell_196 0)) (<= .cse3 |ULTIMATE.start_main_~#sum~0#1.base|) (= .cse45 .cse6) (= .cse17 (mod .cse44 .cse44)))))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (v_arrayElimCell_196 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse48 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse47 (+ .cse48 1))) (let ((.cse46 (mod v_arrayElimCell_196 .cse47))) (and (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)) (= (select .cse0 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_241|) |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse46) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (= .cse46 0) (<= .cse3 |ULTIMATE.start_main_~#sum~0#1.base|) (< .cse47 0) (= .cse48 .cse6)))))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (v_arrayElimCell_196 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse50 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse49 (+ .cse50 1))) (and (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)) (= (select .cse0 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_241|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (mod v_arrayElimCell_196 .cse49)) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (not (< v_arrayElimCell_196 0)) (<= .cse3 |ULTIMATE.start_main_~#sum~0#1.base|) (< .cse49 0) (= .cse50 .cse6)))))) (<= c_~N~0 1) (< 0 c_~N~0)) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse53 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse52 (+ .cse53 1)) (.cse51 (* 8 |v_ULTIMATE.start_main_~i~0#1_241|))) (and (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)) (not (= .cse51 8)) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (<= .cse3 |ULTIMATE.start_main_~#sum~0#1.base|) (< .cse52 0) (= .cse53 .cse6) (= (mod .cse52 .cse52) (select .cse0 (+ .cse51 |c_ULTIMATE.start_main_~a~0#1.offset|))))))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse56 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse55 (+ .cse56 1))) (let ((.cse54 (* 8 |v_ULTIMATE.start_main_~i~0#1_241|)) (.cse57 (mod .cse55 .cse55))) (and (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)) (not (= .cse54 8)) (not (< .cse55 0)) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (not (= 16 .cse54)) (<= .cse3 |ULTIMATE.start_main_~#sum~0#1.base|) (= .cse56 .cse6) (= .cse57 (select .cse0 (+ .cse54 |c_ULTIMATE.start_main_~a~0#1.offset|))) (= .cse17 .cse57)))))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_239| Int)) (let ((.cse60 (* 8 |v_ULTIMATE.start_main_~i~0#1_239|)) (.cse61 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse59 (+ .cse61 1)) (.cse58 (select .cse0 (+ .cse60 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (and (= .cse58 .cse59) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_239| 1)) (<= .cse3 |ULTIMATE.start_main_~#sum~0#1.base|) (not (= 8 .cse60)) (< |v_ULTIMATE.start_main_~i~0#1_239| c_~N~0) (= .cse61 .cse6) (= (mod .cse59 .cse59) .cse58))))) (and .cse7 .cse8 (or (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse63 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse62 (+ .cse63 1))) (and (<= .cse3 |ULTIMATE.start_main_~#sum~0#1.base|) (< .cse62 0) (= .cse63 .cse6) (= (mod (+ (* .cse63 2) 1) .cse62) 0))))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse65 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse64 (+ .cse65 1))) (and (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)) (< |v_ULTIMATE.start_main_~i~0#1_241| c_~N~0) (<= .cse3 |ULTIMATE.start_main_~#sum~0#1.base|) (< .cse64 0) (= .cse65 .cse6) (= (mod (+ (* .cse65 2) 1) .cse64) 0)))))))))) (<= c_~N~0 3) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= |c_ULTIMATE.start_main_~i~0#1| 1))) is different from false