./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/array-fpi/ssina.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a 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_4d4ceb48-bd85-4aef-aaf2-a2a179b20c38/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4ceb48-bd85-4aef-aaf2-a2a179b20c38/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4ceb48-bd85-4aef-aaf2-a2a179b20c38/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4ceb48-bd85-4aef-aaf2-a2a179b20c38/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/array-fpi/ssina.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4ceb48-bd85-4aef-aaf2-a2a179b20c38/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4ceb48-bd85-4aef-aaf2-a2a179b20c38/bin/uautomizer-ZsLfNo2U6R --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 4c9ca6c94ff0fae82185b19014fc033eef7a37c04f3b092e10c4eebb38e41241 --- 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-38b53e6 [2022-11-25 15:50:35,974 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 15:50:35,976 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 15:50:36,019 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 15:50:36,019 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 15:50:36,023 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 15:50:36,026 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 15:50:36,029 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 15:50:36,031 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 15:50:36,034 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 15:50:36,035 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 15:50:36,036 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 15:50:36,036 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 15:50:36,037 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 15:50:36,038 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 15:50:36,039 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 15:50:36,040 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 15:50:36,041 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 15:50:36,043 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 15:50:36,045 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 15:50:36,046 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 15:50:36,047 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 15:50:36,048 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 15:50:36,050 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 15:50:36,053 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 15:50:36,058 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 15:50:36,058 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 15:50:36,059 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 15:50:36,061 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 15:50:36,062 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 15:50:36,063 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 15:50:36,064 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 15:50:36,066 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 15:50:36,068 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 15:50:36,070 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 15:50:36,070 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 15:50:36,071 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 15:50:36,071 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 15:50:36,071 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 15:50:36,073 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 15:50:36,075 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 15:50:36,075 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4ceb48-bd85-4aef-aaf2-a2a179b20c38/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-25 15:50:36,105 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 15:50:36,106 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 15:50:36,107 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 15:50:36,107 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 15:50:36,108 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 15:50:36,108 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 15:50:36,108 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 15:50:36,109 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 15:50:36,109 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 15:50:36,109 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 15:50:36,109 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 15:50:36,109 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 15:50:36,110 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 15:50:36,110 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 15:50:36,110 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 15:50:36,110 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 15:50:36,110 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 15:50:36,111 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 15:50:36,111 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 15:50:36,111 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 15:50:36,111 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 15:50:36,111 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 15:50:36,112 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 15:50:36,112 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 15:50:36,112 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 15:50:36,112 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 15:50:36,112 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 15:50:36,112 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 15:50:36,113 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 15:50:36,113 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 15:50:36,113 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 15:50:36,113 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 15:50:36,113 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 15:50:36,114 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 15:50:36,114 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4ceb48-bd85-4aef-aaf2-a2a179b20c38/bin/uautomizer-ZsLfNo2U6R/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_4d4ceb48-bd85-4aef-aaf2-a2a179b20c38/bin/uautomizer-ZsLfNo2U6R 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 -> 4c9ca6c94ff0fae82185b19014fc033eef7a37c04f3b092e10c4eebb38e41241 [2022-11-25 15:50:36,417 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 15:50:36,446 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 15:50:36,448 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 15:50:36,449 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 15:50:36,449 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 15:50:36,451 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4ceb48-bd85-4aef-aaf2-a2a179b20c38/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/array-fpi/ssina.c [2022-11-25 15:50:39,440 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 15:50:39,637 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 15:50:39,638 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4ceb48-bd85-4aef-aaf2-a2a179b20c38/sv-benchmarks/c/array-fpi/ssina.c [2022-11-25 15:50:39,643 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4ceb48-bd85-4aef-aaf2-a2a179b20c38/bin/uautomizer-ZsLfNo2U6R/data/18fa1c5dd/1e43f97e1c844232879879aa504a9510/FLAG9e953a161 [2022-11-25 15:50:39,655 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4ceb48-bd85-4aef-aaf2-a2a179b20c38/bin/uautomizer-ZsLfNo2U6R/data/18fa1c5dd/1e43f97e1c844232879879aa504a9510 [2022-11-25 15:50:39,658 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 15:50:39,659 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 15:50:39,661 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 15:50:39,661 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 15:50:39,664 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 15:50:39,665 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:50:39" (1/1) ... [2022-11-25 15:50:39,666 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1519623e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:50:39, skipping insertion in model container [2022-11-25 15:50:39,667 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:50:39" (1/1) ... [2022-11-25 15:50:39,674 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 15:50:39,688 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 15:50:39,824 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4ceb48-bd85-4aef-aaf2-a2a179b20c38/sv-benchmarks/c/array-fpi/ssina.c[588,601] [2022-11-25 15:50:39,845 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 15:50:39,853 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 15:50:39,866 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4ceb48-bd85-4aef-aaf2-a2a179b20c38/sv-benchmarks/c/array-fpi/ssina.c[588,601] [2022-11-25 15:50:39,877 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 15:50:39,892 INFO L208 MainTranslator]: Completed translation [2022-11-25 15:50:39,892 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:50:39 WrapperNode [2022-11-25 15:50:39,893 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 15:50:39,894 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 15:50:39,894 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 15:50:39,894 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 15:50:39,902 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:50:39" (1/1) ... [2022-11-25 15:50:39,910 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:50:39" (1/1) ... [2022-11-25 15:50:39,932 INFO L138 Inliner]: procedures = 17, calls = 37, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 119 [2022-11-25 15:50:39,932 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 15:50:39,933 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 15:50:39,933 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 15:50:39,934 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 15:50:39,943 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:50:39" (1/1) ... [2022-11-25 15:50:39,944 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:50:39" (1/1) ... [2022-11-25 15:50:39,946 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:50:39" (1/1) ... [2022-11-25 15:50:39,946 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:50:39" (1/1) ... [2022-11-25 15:50:39,953 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:50:39" (1/1) ... [2022-11-25 15:50:39,958 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:50:39" (1/1) ... [2022-11-25 15:50:39,959 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:50:39" (1/1) ... [2022-11-25 15:50:39,960 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:50:39" (1/1) ... [2022-11-25 15:50:39,963 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 15:50:39,963 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 15:50:39,964 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 15:50:39,964 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 15:50:39,965 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:50:39" (1/1) ... [2022-11-25 15:50:39,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 15:50:39,987 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4ceb48-bd85-4aef-aaf2-a2a179b20c38/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:50:40,000 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4ceb48-bd85-4aef-aaf2-a2a179b20c38/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 15:50:40,025 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4ceb48-bd85-4aef-aaf2-a2a179b20c38/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 15:50:40,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 15:50:40,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 15:50:40,050 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 15:50:40,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 15:50:40,050 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-25 15:50:40,050 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 15:50:40,051 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 15:50:40,051 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 15:50:40,051 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 15:50:40,138 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 15:50:40,144 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 15:50:40,423 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 15:50:40,429 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 15:50:40,430 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-11-25 15:50:40,432 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:50:40 BoogieIcfgContainer [2022-11-25 15:50:40,432 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 15:50:40,434 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 15:50:40,451 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 15:50:40,454 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 15:50:40,454 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 03:50:39" (1/3) ... [2022-11-25 15:50:40,455 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11454ec3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 03:50:40, skipping insertion in model container [2022-11-25 15:50:40,455 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:50:39" (2/3) ... [2022-11-25 15:50:40,456 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11454ec3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 03:50:40, skipping insertion in model container [2022-11-25 15:50:40,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:50:40" (3/3) ... [2022-11-25 15:50:40,457 INFO L112 eAbstractionObserver]: Analyzing ICFG ssina.c [2022-11-25 15:50:40,490 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 15:50:40,490 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-25 15:50:40,593 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 15:50:40,599 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;@6d8e833, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 15:50:40,599 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-25 15:50:40,620 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 28 states have (on average 1.5714285714285714) internal successors, (44), 29 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:50:40,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-25 15:50:40,627 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:50:40,627 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:50:40,628 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:50:40,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:50:40,648 INFO L85 PathProgramCache]: Analyzing trace with hash -635308358, now seen corresponding path program 1 times [2022-11-25 15:50:40,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:50:40,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598770242] [2022-11-25 15:50:40,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:50:40,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:50:40,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:40,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:50:40,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598770242] [2022-11-25 15:50:40,844 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2022-11-25 15:50:40,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1731013556] [2022-11-25 15:50:40,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:50:40,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:50:40,846 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4ceb48-bd85-4aef-aaf2-a2a179b20c38/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:50:40,851 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4ceb48-bd85-4aef-aaf2-a2a179b20c38/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:50:40,854 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4ceb48-bd85-4aef-aaf2-a2a179b20c38/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 15:50:40,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:40,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-25 15:50:40,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:50:40,974 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-25 15:50:40,974 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:50:40,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1731013556] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:50:40,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:50:40,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 15:50:40,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596596205] [2022-11-25 15:50:40,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:50:40,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 15:50:40,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:50:41,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 15:50:41,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 15:50:41,017 INFO L87 Difference]: Start difference. First operand has 30 states, 28 states have (on average 1.5714285714285714) internal successors, (44), 29 states have internal predecessors, (44), 0 states have call successors, (0), 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 9.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:50:41,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:50:41,036 INFO L93 Difference]: Finished difference Result 56 states and 82 transitions. [2022-11-25 15:50:41,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 15:50:41,039 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-25 15:50:41,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:50:41,046 INFO L225 Difference]: With dead ends: 56 [2022-11-25 15:50:41,046 INFO L226 Difference]: Without dead ends: 26 [2022-11-25 15:50:41,049 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 17 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-25 15:50:41,053 INFO L413 NwaCegarLoop]: 36 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, 36 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-25 15:50:41,054 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:50:41,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-11-25 15:50:41,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-11-25 15:50:41,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.24) internal successors, (31), 25 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-25 15:50:41,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2022-11-25 15:50:41,085 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 18 [2022-11-25 15:50:41,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:50:41,085 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2022-11-25 15:50:41,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:50:41,086 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-11-25 15:50:41,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-25 15:50:41,086 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:50:41,087 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:50:41,095 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4ceb48-bd85-4aef-aaf2-a2a179b20c38/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-25 15:50:41,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4ceb48-bd85-4aef-aaf2-a2a179b20c38/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-11-25 15:50:41,296 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:50:41,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:50:41,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1344199344, now seen corresponding path program 1 times [2022-11-25 15:50:41,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:50:41,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25307522] [2022-11-25 15:50:41,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:50:41,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:50:41,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:41,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:50:41,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25307522] [2022-11-25 15:50:41,388 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2022-11-25 15:50:41,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1013500951] [2022-11-25 15:50:41,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:50:41,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:50:41,389 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4ceb48-bd85-4aef-aaf2-a2a179b20c38/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:50:41,390 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4ceb48-bd85-4aef-aaf2-a2a179b20c38/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:50:41,411 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4ceb48-bd85-4aef-aaf2-a2a179b20c38/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 15:50:41,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:41,471 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 15:50:41,472 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:50:41,527 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-25 15:50:41,528 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:50:41,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1013500951] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:50:41,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:50:41,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 15:50:41,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136752383] [2022-11-25 15:50:41,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:50:41,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 15:50:41,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:50:41,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 15:50:41,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:50:41,531 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:50:41,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:50:41,608 INFO L93 Difference]: Finished difference Result 61 states and 75 transitions. [2022-11-25 15:50:41,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 15:50:41,609 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-25 15:50:41,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:50:41,610 INFO L225 Difference]: With dead ends: 61 [2022-11-25 15:50:41,610 INFO L226 Difference]: Without dead ends: 42 [2022-11-25 15:50:41,611 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 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-25 15:50:41,612 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 52 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 15:50:41,613 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 18 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 15:50:41,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-11-25 15:50:41,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 31. [2022-11-25 15:50:41,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.2) internal successors, (36), 30 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-25 15:50:41,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2022-11-25 15:50:41,620 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 18 [2022-11-25 15:50:41,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:50:41,621 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2022-11-25 15:50:41,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:50:41,621 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2022-11-25 15:50:41,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-25 15:50:41,622 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:50:41,622 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, 1, 1, 1, 1] [2022-11-25 15:50:41,632 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4ceb48-bd85-4aef-aaf2-a2a179b20c38/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-25 15:50:41,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4ceb48-bd85-4aef-aaf2-a2a179b20c38/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-11-25 15:50:41,828 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:50:41,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:50:41,829 INFO L85 PathProgramCache]: Analyzing trace with hash -933126362, now seen corresponding path program 1 times [2022-11-25 15:50:41,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:50:41,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819114264] [2022-11-25 15:50:41,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:50:41,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:50:41,867 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 15:50:41,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [702076165] [2022-11-25 15:50:41,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:50:41,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:50:41,868 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4ceb48-bd85-4aef-aaf2-a2a179b20c38/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:50:41,869 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4ceb48-bd85-4aef-aaf2-a2a179b20c38/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:50:41,896 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4ceb48-bd85-4aef-aaf2-a2a179b20c38/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 15:50:41,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:41,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 64 conjunts are in the unsatisfiable core [2022-11-25 15:50:42,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:50:42,152 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-25 15:50:42,165 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-25 15:50:42,236 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-25 15:50:42,436 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-25 15:50:42,593 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-25 15:50:42,708 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 32 treesize of output 23 [2022-11-25 15:50:42,777 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-25 15:50:42,933 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-25 15:50:43,191 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 53 treesize of output 37 [2022-11-25 15:50:43,225 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:50:43,225 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:50:45,572 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 15:50:45,757 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:50:45,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:50:45,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819114264] [2022-11-25 15:50:45,758 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 15:50:45,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [702076165] [2022-11-25 15:50:45,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [702076165] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 15:50:45,758 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 15:50:45,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2022-11-25 15:50:45,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068539464] [2022-11-25 15:50:45,759 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 15:50:45,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-25 15:50:45,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:50:45,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-25 15:50:45,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=963, Unknown=0, NotChecked=0, Total=1122 [2022-11-25 15:50:45,772 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 34 states, 34 states have (on average 1.5588235294117647) internal successors, (53), 34 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:51:05,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:51:05,022 INFO L93 Difference]: Finished difference Result 80 states and 93 transitions. [2022-11-25 15:51:05,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-11-25 15:51:05,023 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.5588235294117647) internal successors, (53), 34 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-11-25 15:51:05,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:51:05,029 INFO L225 Difference]: With dead ends: 80 [2022-11-25 15:51:05,029 INFO L226 Difference]: Without dead ends: 78 [2022-11-25 15:51:05,034 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1046 ImplicationChecksByTransitivity, 16.0s TimeCoverageRelationStatistics Valid=603, Invalid=3819, Unknown=0, NotChecked=0, Total=4422 [2022-11-25 15:51:05,036 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 162 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 732 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-11-25 15:51:05,037 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 177 Invalid, 785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 732 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2022-11-25 15:51:05,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-11-25 15:51:05,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 54. [2022-11-25 15:51:05,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.2264150943396226) internal successors, (65), 53 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:51:05,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2022-11-25 15:51:05,056 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 28 [2022-11-25 15:51:05,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:51:05,056 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2022-11-25 15:51:05,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.5588235294117647) internal successors, (53), 34 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:51:05,057 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2022-11-25 15:51:05,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-25 15:51:05,058 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:51:05,058 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:51:05,067 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4ceb48-bd85-4aef-aaf2-a2a179b20c38/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-25 15:51:05,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4ceb48-bd85-4aef-aaf2-a2a179b20c38/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:51:05,265 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:51:05,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:51:05,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1642466588, now seen corresponding path program 2 times [2022-11-25 15:51:05,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:51:05,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148758656] [2022-11-25 15:51:05,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:51:05,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:51:05,321 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 15:51:05,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [495324436] [2022-11-25 15:51:05,322 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 15:51:05,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:51:05,323 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4ceb48-bd85-4aef-aaf2-a2a179b20c38/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:51:05,325 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4ceb48-bd85-4aef-aaf2-a2a179b20c38/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:51:05,332 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4ceb48-bd85-4aef-aaf2-a2a179b20c38/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-25 15:51:05,409 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 15:51:05,409 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 15:51:05,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 15:51:05,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:51:05,475 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 15:51:05,475 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:51:05,532 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 15:51:05,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:51:05,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148758656] [2022-11-25 15:51:05,532 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 15:51:05,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [495324436] [2022-11-25 15:51:05,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [495324436] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 15:51:05,533 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 15:51:05,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-11-25 15:51:05,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106058105] [2022-11-25 15:51:05,534 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 15:51:05,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 15:51:05,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:51:05,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 15:51:05,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-11-25 15:51:05,535 INFO L87 Difference]: Start difference. First operand 54 states and 65 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:51:05,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:51:05,750 INFO L93 Difference]: Finished difference Result 126 states and 148 transitions. [2022-11-25 15:51:05,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 15:51:05,751 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-11-25 15:51:05,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:51:05,751 INFO L225 Difference]: With dead ends: 126 [2022-11-25 15:51:05,752 INFO L226 Difference]: Without dead ends: 78 [2022-11-25 15:51:05,752 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 48 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-25 15:51:05,753 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 79 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 15:51:05,754 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 51 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 15:51:05,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-11-25 15:51:05,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 56. [2022-11-25 15:51:05,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.1818181818181819) internal successors, (65), 55 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:51:05,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 65 transitions. [2022-11-25 15:51:05,772 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 65 transitions. Word has length 30 [2022-11-25 15:51:05,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:51:05,772 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 65 transitions. [2022-11-25 15:51:05,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:51:05,773 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2022-11-25 15:51:05,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-25 15:51:05,774 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:51:05,774 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:51:05,788 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4ceb48-bd85-4aef-aaf2-a2a179b20c38/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-25 15:51:05,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4ceb48-bd85-4aef-aaf2-a2a179b20c38/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:51:05,979 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:51:05,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:51:05,979 INFO L85 PathProgramCache]: Analyzing trace with hash -396360796, now seen corresponding path program 3 times [2022-11-25 15:51:05,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:51:05,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233943788] [2022-11-25 15:51:05,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:51:05,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:51:06,006 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 15:51:06,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1504014033] [2022-11-25 15:51:06,015 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 15:51:06,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:51:06,015 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4ceb48-bd85-4aef-aaf2-a2a179b20c38/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:51:06,016 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4ceb48-bd85-4aef-aaf2-a2a179b20c38/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:51:06,018 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4ceb48-bd85-4aef-aaf2-a2a179b20c38/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-25 15:51:06,106 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-25 15:51:06,106 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 15:51:06,107 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 15:51:06,108 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:51:06,173 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 15:51:06,174 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:51:06,225 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 15:51:06,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:51:06,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233943788] [2022-11-25 15:51:06,226 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 15:51:06,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1504014033] [2022-11-25 15:51:06,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1504014033] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 15:51:06,226 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 15:51:06,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-11-25 15:51:06,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023140205] [2022-11-25 15:51:06,227 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 15:51:06,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 15:51:06,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:51:06,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 15:51:06,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-11-25 15:51:06,228 INFO L87 Difference]: Start difference. First operand 56 states and 65 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:51:06,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:51:06,444 INFO L93 Difference]: Finished difference Result 74 states and 82 transitions. [2022-11-25 15:51:06,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 15:51:06,445 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-11-25 15:51:06,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:51:06,446 INFO L225 Difference]: With dead ends: 74 [2022-11-25 15:51:06,446 INFO L226 Difference]: Without dead ends: 57 [2022-11-25 15:51:06,446 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 48 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-25 15:51:06,447 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 107 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 15:51:06,448 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 41 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 15:51:06,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-11-25 15:51:06,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 41. [2022-11-25 15:51:06,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.15) internal successors, (46), 40 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:51:06,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2022-11-25 15:51:06,460 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 30 [2022-11-25 15:51:06,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:51:06,460 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2022-11-25 15:51:06,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:51:06,461 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2022-11-25 15:51:06,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-25 15:51:06,462 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:51:06,462 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:51:06,472 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4ceb48-bd85-4aef-aaf2-a2a179b20c38/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-11-25 15:51:06,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4ceb48-bd85-4aef-aaf2-a2a179b20c38/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:51:06,668 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:51:06,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:51:06,668 INFO L85 PathProgramCache]: Analyzing trace with hash 389318684, now seen corresponding path program 4 times [2022-11-25 15:51:06,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:51:06,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176335489] [2022-11-25 15:51:06,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:51:06,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:51:06,702 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 15:51:06,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [427604868] [2022-11-25 15:51:06,703 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-25 15:51:06,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:51:06,703 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4ceb48-bd85-4aef-aaf2-a2a179b20c38/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:51:06,704 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4ceb48-bd85-4aef-aaf2-a2a179b20c38/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:51:06,719 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4ceb48-bd85-4aef-aaf2-a2a179b20c38/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-25 15:51:06,831 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-25 15:51:06,831 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 15:51:06,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 89 conjunts are in the unsatisfiable core [2022-11-25 15:51:06,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:51:06,851 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-25 15:51:06,860 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-25 15:51:06,886 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-25 15:51:06,953 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-25 15:51:07,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:51:07,209 INFO L321 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-11-25 15:51:07,210 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 53 [2022-11-25 15:51:07,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:51:07,376 INFO L321 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2022-11-25 15:51:07,376 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 65 treesize of output 65 [2022-11-25 15:51:07,809 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 15:51:07,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:51:07,813 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 15:51:07,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:51:07,816 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 15:51:07,844 INFO L321 Elim1Store]: treesize reduction 48, result has 22.6 percent of original size [2022-11-25 15:51:07,844 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-25 15:51:08,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:51:08,067 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 15:51:08,076 INFO L321 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-11-25 15:51:08,076 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 73 treesize of output 57 [2022-11-25 15:51:08,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:51:08,259 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-25 15:51:08,259 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 4 case distinctions, treesize of input 49 treesize of output 39 [2022-11-25 15:51:08,341 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 15:51:08,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:51:08,367 INFO L321 Elim1Store]: treesize reduction 55, result has 29.5 percent of original size [2022-11-25 15:51:08,368 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 8 case distinctions, treesize of input 49 treesize of output 50 [2022-11-25 15:51:08,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:51:08,571 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 51 treesize of output 35 [2022-11-25 15:51:08,796 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 15:51:08,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:51:08,815 INFO L321 Elim1Store]: treesize reduction 34, result has 24.4 percent of original size [2022-11-25 15:51:08,815 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 59 treesize of output 53 [2022-11-25 15:51:09,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:51:09,022 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 15:51:09,023 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 51 treesize of output 39 [2022-11-25 15:51:09,224 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 15:51:09,224 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 41 [2022-11-25 15:51:09,277 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:51:09,277 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:51:30,275 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:51:30,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:51:30,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176335489] [2022-11-25 15:51:30,275 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 15:51:30,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [427604868] [2022-11-25 15:51:30,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [427604868] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 15:51:30,276 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 15:51:30,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 54 [2022-11-25 15:51:30,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034608773] [2022-11-25 15:51:30,277 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 15:51:30,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-11-25 15:51:30,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:51:30,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-11-25 15:51:30,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=2581, Unknown=0, NotChecked=0, Total=2862 [2022-11-25 15:51:30,280 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand has 54 states, 54 states have (on average 1.3148148148148149) internal successors, (71), 54 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:51:44,272 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2022-11-25 15:52:11,855 WARN L233 SmtUtils]: Spent 5.98s on a formula simplification. DAG size of input: 152 DAG size of output: 88 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 15:52:52,873 WARN L233 SmtUtils]: Spent 11.95s on a formula simplification that was a NOOP. DAG size: 181 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 15:53:50,752 WARN L233 SmtUtils]: Spent 19.47s on a formula simplification. DAG size of input: 278 DAG size of output: 96 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 15:53:54,789 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0, 1] [2022-11-25 15:53:55,872 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0, 1] [2022-11-25 15:53:57,809 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 [0, 1] [2022-11-25 15:54:00,683 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0, 1] [2022-11-25 15:54:02,094 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0, 1] [2022-11-25 15:54:03,149 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0, 1] [2022-11-25 15:54:05,690 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0, 1] [2022-11-25 15:54:07,112 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 [0, 1] [2022-11-25 15:54:11,141 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0, 1] [2022-11-25 15:54:13,557 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0, 1] [2022-11-25 15:54:16,254 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0, 1] [2022-11-25 15:54:17,505 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0, 1] [2022-11-25 15:55:05,258 WARN L233 SmtUtils]: Spent 26.26s on a formula simplification that was a NOOP. DAG size: 165 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 15:55:10,249 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-11-25 15:55:11,434 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-11-25 15:55:14,302 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2022-11-25 15:55:15,984 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2022-11-25 15:55:18,217 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-11-25 15:55:20,222 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-11-25 15:55:57,758 WARN L233 SmtUtils]: Spent 16.39s on a formula simplification that was a NOOP. DAG size: 148 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 15:56:46,322 WARN L233 SmtUtils]: Spent 14.08s on a formula simplification. DAG size of input: 275 DAG size of output: 54 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 15:56:51,576 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2022-11-25 15:56:53,678 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2022-11-25 15:56:55,686 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2022-11-25 15:56:57,697 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2022-11-25 15:57:00,640 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2022-11-25 15:57:05,438 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2022-11-25 15:57:09,142 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse14 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse33 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse30 (select .cse33 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse32 (select .cse14 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse15 (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0)) (.cse21 (+ .cse30 .cse32)) (.cse4 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse22 (+ (* c_~N~0 2) (* c_~N~0 c_~N~0) 1))) (and (forall ((~N~0 Int)) (or (= (+ (* 2 ~N~0) (* ~N~0 ~N~0) 1) (let ((.cse2 (let ((.cse13 (store .cse14 (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse13))) (let ((.cse12 (select .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse8 (select .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse10 (select .cse13 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse9 (select (select (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (let ((.cse5 (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse9 .cse10))))) (store .cse5 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse7 (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse6 (store .cse7 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse8 (select .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse9 .cse10)))) (store .cse6 .cse4 (+ (select .cse7 .cse4) (select (select (store .cse5 |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|)))))))))))))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| 0)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse0 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse1)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (+ .cse0 .cse1 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))))))) (not (< 1 ~N~0)) (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0) (< 2 ~N~0) (not (< |c_ULTIMATE.start_main_~i~0#1| ~N~0)))) (or .cse15 (= (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse20 (store .cse14 |c_ULTIMATE.start_main_~a~0#1.offset| .cse21))) (store .cse20 .cse4 (+ (select .cse14 .cse4) (select (select (store |c_#memory_int| |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|))))))) (let ((.cse18 (select .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse16 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| 0)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse19 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse16)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (+ .cse16 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse16 .cse19))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse19))))) .cse22)) (or (< 2 c_~N~0) .cse15 (not (< 1 c_~N~0)) (= (let ((.cse25 (let ((.cse31 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse33 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse21)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (let ((.cse27 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse33 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse30 .cse31 .cse32))))) (store .cse27 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse29 (select .cse27 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse28 (store .cse29 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse30 .cse31 (select .cse29 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse32)))) (store .cse28 .cse4 (+ (select .cse29 .cse4) (select (select (store .cse27 |c_ULTIMATE.start_main_~a~0#1.base| .cse28) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))))))) (let ((.cse26 (select .cse25 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse23 (select (select (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.offset| 0)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse24 (select (select (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse23)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (+ .cse23 .cse24 (select (select (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse23 .cse24))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))))) .cse22)))))) is different from false [2022-11-25 15:57:25,011 WARN L233 SmtUtils]: Spent 6.89s on a formula simplification that was a NOOP. DAG size: 125 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 15:58:31,448 WARN L233 SmtUtils]: Spent 23.07s on a formula simplification. DAG size of input: 284 DAG size of output: 102 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 15:58:48,959 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse91 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse16 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse89 (+ .cse91 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse39 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse36 (select .cse39 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse37 (select .cse16 .cse89))) (let ((.cse90 (+ .cse36 .cse37))) (let ((.cse14 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse21 (+ .cse91 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse81 (store .cse16 .cse89 .cse90))) (let ((.cse87 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse39 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse90))) (.cse25 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse81)) (.cse76 (select .cse16 .cse21)) (.cse82 (< .cse14 c_~N~0)) (.cse42 (+ 2 |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse13 (store .cse16 .cse89 1)) (.cse15 (select .cse16 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse28 (< .cse42 c_~N~0)) (.cse41 (not .cse82)) (.cse22 (+ .cse36 .cse76)) (.cse26 (select .cse25 |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse4 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse40 (select .cse87 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse23 (+ (* c_~N~0 2) (* c_~N~0 c_~N~0) 1))) (and (forall ((~N~0 Int)) (or (= (+ (* 2 ~N~0) (* ~N~0 ~N~0) 1) (let ((.cse2 (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse13))) (let ((.cse12 (select .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse8 (select .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse10 (select .cse13 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse9 (select (select (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (let ((.cse5 (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse9 .cse10))))) (store .cse5 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse7 (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse6 (store .cse7 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse8 (select .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse9 .cse10)))) (store .cse6 .cse4 (+ (select .cse7 .cse4) (select (select (store .cse5 |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|))))))))))))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| 0)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse0 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse1)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (+ .cse0 .cse1 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))))))) (not (< 1 ~N~0)) (< .cse14 ~N~0) (< 2 ~N~0) (not (< |c_ULTIMATE.start_main_~i~0#1| ~N~0)))) (= (* 2 .cse15) (+ (select .cse16 .cse4) 3)) (<= c_~N~0 2) (= |c_ULTIMATE.start_main_~#sum~0#1.offset| 0) (= (let ((.cse18 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse16 .cse21 .cse22)))) (let ((.cse19 (select .cse18 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse20 (select (select (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.offset| 0)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse17 (select (select (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse20)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (+ .cse17 (select (select (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse17 .cse20))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse20))))) .cse23) (= (let ((.cse24 (select (select (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.offset| 0)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse27 (select (select (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse24)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (+ .cse24 (select (select (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse24 .cse27))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse27))) .cse23) (or .cse28 (= (let ((.cse31 (let ((.cse38 (select .cse40 .cse21))) (let ((.cse33 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse39 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse36 .cse37 .cse38))))) (store .cse33 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse35 (select .cse33 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse34 (store .cse35 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse36 .cse37 (select .cse35 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse38)))) (store .cse34 .cse4 (+ (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 .cse4)))))))))) (let ((.cse32 (select .cse31 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse29 (select (select (store .cse31 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse32 |c_ULTIMATE.start_main_~#sum~0#1.offset| 0)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse30 (select (select (store .cse31 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse32 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse29)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (+ .cse29 .cse30 (select (select (store .cse31 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse32 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse29 .cse30))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))))) .cse23) .cse41) (= 3 .cse15) (forall ((~N~0 Int)) (or (< .cse42 ~N~0) (not (< .cse14 ~N~0)) (= (+ (* 2 ~N~0) (* ~N~0 ~N~0) 1) (let ((.cse45 (let ((.cse55 (store .cse13 .cse21 1))) (let ((.cse53 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse55))) (let ((.cse54 (select .cse53 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse50 (select .cse54 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse51 (select .cse55 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse52 (select (select (store .cse53 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse54 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse50 .cse51))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (let ((.cse47 (store .cse53 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse54 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse50 .cse51 .cse52))))) (store .cse47 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse49 (select .cse47 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse48 (store .cse49 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse50 .cse51 .cse52 (select .cse49 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (store .cse48 .cse4 (+ (select (select (store .cse47 |c_ULTIMATE.start_main_~a~0#1.base| .cse48) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse49 .cse4)))))))))))))) (let ((.cse46 (select .cse45 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse43 (select (select (store .cse45 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse46 |c_ULTIMATE.start_main_~#sum~0#1.offset| 0)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse44 (select (select (store .cse45 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse46 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse43)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (+ .cse43 .cse44 (select (select (store .cse45 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse46 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse43 .cse44))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))))))) (not (< 1 ~N~0)) (< 2 ~N~0))) (forall ((~N~0 Int)) (or (= (+ (* 2 ~N~0) (* ~N~0 ~N~0) 1) (let ((.cse56 (let ((.cse68 (store .cse16 .cse21 1))) (let ((.cse66 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse68))) (let ((.cse67 (select .cse66 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse63 (select .cse68 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse65 (select .cse67 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse64 (select (select (store .cse66 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse67 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse63 .cse65))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (let ((.cse60 (store .cse66 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse67 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse63 .cse64 .cse65))))) (store .cse60 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse62 (select .cse60 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse61 (store .cse62 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse62 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse63 .cse64 .cse65)))) (store .cse61 .cse4 (+ (select (select (store .cse60 |c_ULTIMATE.start_main_~a~0#1.base| .cse61) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse62 .cse4)))))))))))))) (let ((.cse57 (select .cse56 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse58 (select (select (store .cse56 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse57 |c_ULTIMATE.start_main_~#sum~0#1.offset| 0)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse59 (select (select (store .cse56 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse57 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse58)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (+ (select (select (store .cse56 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse57 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse58 .cse59))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse58 .cse59)))))) (< .cse42 ~N~0) (not (< .cse14 ~N~0)) (not (< 1 ~N~0)) (< 2 ~N~0))) (< 1 c_~N~0) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (+ .cse36 1) .cse15) (or .cse28 .cse41 (= (let ((.cse71 (let ((.cse73 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse39 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse22)))) (store .cse73 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse75 (select .cse73 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse74 (store .cse75 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse36 .cse76 (select .cse75 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (store .cse74 .cse4 (+ (select (select (store .cse73 |c_ULTIMATE.start_main_~a~0#1.base| .cse74) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse75 .cse4))))))))) (let ((.cse72 (select .cse71 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse70 (select (select (store .cse71 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse72 |c_ULTIMATE.start_main_~#sum~0#1.offset| 0)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse69 (select (select (store .cse71 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse72 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse70)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (+ .cse69 .cse70 (select (select (store .cse71 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse72 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse69 .cse70))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))))) .cse23)) (= (let ((.cse78 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse81 .cse21 (+ .cse76 (select .cse26 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))) (let ((.cse79 (select .cse78 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse80 (select (select (store .cse78 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse79 |c_ULTIMATE.start_main_~#sum~0#1.offset| 0)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse77 (select (select (store .cse78 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse79 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse80)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (+ .cse77 (select (select (store .cse78 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse79 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse77 .cse80))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse80))))) .cse23) (or .cse82 (not (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0)) (= (let ((.cse84 (store .cse87 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse88 (store .cse40 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse36 .cse37 (select .cse40 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (store .cse88 .cse4 (+ (select .cse40 .cse4) (select (select (store .cse87 |c_ULTIMATE.start_main_~a~0#1.base| .cse88) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))))) (let ((.cse85 (select .cse84 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse86 (select (select (store .cse84 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse85 |c_ULTIMATE.start_main_~#sum~0#1.offset| 0)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse83 (select (select (store .cse84 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse85 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse86)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (+ .cse83 (select (select (store .cse84 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse85 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse83 .cse86))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse86))))) .cse23)))))))))) is different from false [2022-11-25 15:58:50,995 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse91 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse16 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse89 (+ .cse91 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse39 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse36 (select .cse39 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse37 (select .cse16 .cse89))) (let ((.cse90 (+ .cse36 .cse37))) (let ((.cse14 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse21 (+ .cse91 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse81 (store .cse16 .cse89 .cse90))) (let ((.cse87 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse39 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse90))) (.cse25 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse81)) (.cse76 (select .cse16 .cse21)) (.cse82 (< .cse14 c_~N~0)) (.cse42 (+ 2 |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse13 (store .cse16 .cse89 1)) (.cse15 (select .cse16 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse28 (< .cse42 c_~N~0)) (.cse41 (not .cse82)) (.cse22 (+ .cse36 .cse76)) (.cse26 (select .cse25 |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse4 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse40 (select .cse87 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse23 (+ (* c_~N~0 2) (* c_~N~0 c_~N~0) 1))) (and (forall ((~N~0 Int)) (or (= (+ (* 2 ~N~0) (* ~N~0 ~N~0) 1) (let ((.cse2 (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse13))) (let ((.cse12 (select .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse8 (select .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse10 (select .cse13 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse9 (select (select (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (let ((.cse5 (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse9 .cse10))))) (store .cse5 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse7 (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse6 (store .cse7 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse8 (select .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse9 .cse10)))) (store .cse6 .cse4 (+ (select .cse7 .cse4) (select (select (store .cse5 |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|))))))))))))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| 0)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse0 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse1)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (+ .cse0 .cse1 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))))))) (not (< 1 ~N~0)) (< .cse14 ~N~0) (< 2 ~N~0) (not (< |c_ULTIMATE.start_main_~i~0#1| ~N~0)))) (= (* 2 .cse15) (+ (select .cse16 .cse4) 3)) (<= c_~N~0 2) (= |c_ULTIMATE.start_main_~#sum~0#1.offset| 0) (= (let ((.cse18 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse16 .cse21 .cse22)))) (let ((.cse19 (select .cse18 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse20 (select (select (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.offset| 0)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse17 (select (select (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse20)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (+ .cse17 (select (select (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse17 .cse20))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse20))))) .cse23) (= (let ((.cse24 (select (select (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.offset| 0)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse27 (select (select (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse24)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (+ .cse24 (select (select (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse24 .cse27))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse27))) .cse23) (or .cse28 (= (let ((.cse31 (let ((.cse38 (select .cse40 .cse21))) (let ((.cse33 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse39 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse36 .cse37 .cse38))))) (store .cse33 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse35 (select .cse33 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse34 (store .cse35 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse36 .cse37 (select .cse35 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse38)))) (store .cse34 .cse4 (+ (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 .cse4)))))))))) (let ((.cse32 (select .cse31 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse29 (select (select (store .cse31 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse32 |c_ULTIMATE.start_main_~#sum~0#1.offset| 0)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse30 (select (select (store .cse31 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse32 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse29)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (+ .cse29 .cse30 (select (select (store .cse31 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse32 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse29 .cse30))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))))) .cse23) .cse41) (= 3 .cse15) (forall ((~N~0 Int)) (or (< .cse42 ~N~0) (not (< .cse14 ~N~0)) (= (+ (* 2 ~N~0) (* ~N~0 ~N~0) 1) (let ((.cse45 (let ((.cse55 (store .cse13 .cse21 1))) (let ((.cse53 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse55))) (let ((.cse54 (select .cse53 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse50 (select .cse54 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse51 (select .cse55 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse52 (select (select (store .cse53 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse54 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse50 .cse51))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (let ((.cse47 (store .cse53 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse54 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse50 .cse51 .cse52))))) (store .cse47 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse49 (select .cse47 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse48 (store .cse49 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse50 .cse51 .cse52 (select .cse49 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (store .cse48 .cse4 (+ (select (select (store .cse47 |c_ULTIMATE.start_main_~a~0#1.base| .cse48) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse49 .cse4)))))))))))))) (let ((.cse46 (select .cse45 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse43 (select (select (store .cse45 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse46 |c_ULTIMATE.start_main_~#sum~0#1.offset| 0)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse44 (select (select (store .cse45 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse46 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse43)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (+ .cse43 .cse44 (select (select (store .cse45 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse46 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse43 .cse44))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))))))) (not (< 1 ~N~0)) (< 2 ~N~0))) (forall ((~N~0 Int)) (or (= (+ (* 2 ~N~0) (* ~N~0 ~N~0) 1) (let ((.cse56 (let ((.cse68 (store .cse16 .cse21 1))) (let ((.cse66 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse68))) (let ((.cse67 (select .cse66 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse63 (select .cse68 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse65 (select .cse67 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse64 (select (select (store .cse66 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse67 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse63 .cse65))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (let ((.cse60 (store .cse66 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse67 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse63 .cse64 .cse65))))) (store .cse60 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse62 (select .cse60 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse61 (store .cse62 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse62 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse63 .cse64 .cse65)))) (store .cse61 .cse4 (+ (select (select (store .cse60 |c_ULTIMATE.start_main_~a~0#1.base| .cse61) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse62 .cse4)))))))))))))) (let ((.cse57 (select .cse56 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse58 (select (select (store .cse56 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse57 |c_ULTIMATE.start_main_~#sum~0#1.offset| 0)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse59 (select (select (store .cse56 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse57 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse58)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (+ (select (select (store .cse56 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse57 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse58 .cse59))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse58 .cse59)))))) (< .cse42 ~N~0) (not (< .cse14 ~N~0)) (not (< 1 ~N~0)) (< 2 ~N~0))) (< 1 c_~N~0) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (+ .cse36 1) .cse15) (or .cse28 .cse41 (= (let ((.cse71 (let ((.cse73 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse39 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse22)))) (store .cse73 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse75 (select .cse73 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse74 (store .cse75 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse36 .cse76 (select .cse75 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (store .cse74 .cse4 (+ (select (select (store .cse73 |c_ULTIMATE.start_main_~a~0#1.base| .cse74) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse75 .cse4))))))))) (let ((.cse72 (select .cse71 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse70 (select (select (store .cse71 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse72 |c_ULTIMATE.start_main_~#sum~0#1.offset| 0)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse69 (select (select (store .cse71 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse72 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse70)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (+ .cse69 .cse70 (select (select (store .cse71 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse72 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse69 .cse70))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))))) .cse23)) (= (let ((.cse78 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse81 .cse21 (+ .cse76 (select .cse26 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))) (let ((.cse79 (select .cse78 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse80 (select (select (store .cse78 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse79 |c_ULTIMATE.start_main_~#sum~0#1.offset| 0)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse77 (select (select (store .cse78 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse79 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse80)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (+ .cse77 (select (select (store .cse78 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse79 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse77 .cse80))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse80))))) .cse23) (or .cse82 (not (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0)) (= (let ((.cse84 (store .cse87 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse88 (store .cse40 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse36 .cse37 (select .cse40 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (store .cse88 .cse4 (+ (select .cse40 .cse4) (select (select (store .cse87 |c_ULTIMATE.start_main_~a~0#1.base| .cse88) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))))) (let ((.cse85 (select .cse84 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse86 (select (select (store .cse84 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse85 |c_ULTIMATE.start_main_~#sum~0#1.offset| 0)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse83 (select (select (store .cse84 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse85 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse86)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (+ .cse83 (select (select (store .cse84 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse85 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse83 .cse86))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse86))))) .cse23)))))))))) is different from true [2022-11-25 16:00:25,781 WARN L233 SmtUtils]: Spent 26.61s on a formula simplification. DAG size of input: 344 DAG size of output: 52 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 16:01:36,147 WARN L233 SmtUtils]: Spent 23.97s on a formula simplification that was a NOOP. DAG size: 164 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 16:01:39,535 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2022-11-25 16:01:42,690 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-11-25 16:02:38,431 WARN L233 SmtUtils]: Spent 15.82s on a formula simplification. DAG size of input: 273 DAG size of output: 52 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 16:03:55,331 WARN L233 SmtUtils]: Spent 38.16s on a formula simplification that was a NOOP. DAG size: 189 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 16:05:15,644 WARN L233 SmtUtils]: Spent 21.43s on a formula simplification. DAG size of input: 282 DAG size of output: 84 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 16:05:19,219 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-11-25 16:05:21,504 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2022-11-25 16:05:23,399 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-11-25 16:05:26,136 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2022-11-25 16:05:28,698 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2022-11-25 16:05:31,883 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2022-11-25 16:05:33,888 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-11-25 16:05:35,382 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-11-25 16:05:38,321 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-11-25 16:05:39,442 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-11-25 16:05:44,590 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse97 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse23 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse24 (+ .cse97 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse17 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse34 (select .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse35 (select .cse23 .cse24))) (let ((.cse14 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse25 (+ .cse34 .cse35))) (let ((.cse95 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse25))) (.cse67 (< .cse14 c_~N~0)) (.cse40 (+ 2 |c_ULTIMATE.start_main_~i~0#1|)) (.cse76 (select .cse23 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse13 (store .cse23 .cse24 1)) (.cse77 (+ .cse34 .cse76)) (.cse26 (< .cse40 c_~N~0)) (.cse39 (not .cse67)) (.cse38 (+ .cse97 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse4 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse37 (select .cse95 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse18 (+ (* c_~N~0 2) (* c_~N~0 c_~N~0) 1))) (and (forall ((~N~0 Int)) (or (= (+ (* 2 ~N~0) (* ~N~0 ~N~0) 1) (let ((.cse2 (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse13))) (let ((.cse12 (select .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse8 (select .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse10 (select .cse13 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse9 (select (select (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (let ((.cse5 (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse9 .cse10))))) (store .cse5 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse7 (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse6 (store .cse7 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse8 (select .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse9 .cse10)))) (store .cse6 .cse4 (+ (select .cse7 .cse4) (select (select (store .cse5 |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|))))))))))))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| 0)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse0 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse1)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (+ .cse0 .cse1 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))))))) (not (< 1 ~N~0)) (< .cse14 ~N~0) (< 2 ~N~0) (not (< |c_ULTIMATE.start_main_~i~0#1| ~N~0)))) (= (let ((.cse15 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| 0)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse16 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse15)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (+ .cse15 .cse16 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse15 .cse16))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))) .cse18) (= (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse23 .cse24 .cse25)))) (let ((.cse21 (select .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse19 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| 0)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse22 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse19)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (+ .cse19 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse19 .cse22))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse22))))) .cse18) (or .cse26 (= (let ((.cse29 (let ((.cse36 (select .cse37 .cse38))) (let ((.cse31 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse34 .cse35 .cse36))))) (store .cse31 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse33 (select .cse31 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse32 (store .cse33 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse34 .cse35 (select .cse33 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse36)))) (store .cse32 .cse4 (+ (select (select (store .cse31 |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 .cse4)))))))))) (let ((.cse30 (select .cse29 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse27 (select (select (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.offset| 0)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse28 (select (select (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse27)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (+ .cse27 .cse28 (select (select (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse27 .cse28))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))))) .cse18) .cse39) (forall ((~N~0 Int)) (or (< .cse40 ~N~0) (not (< .cse14 ~N~0)) (= (+ (* 2 ~N~0) (* ~N~0 ~N~0) 1) (let ((.cse43 (let ((.cse53 (store .cse13 .cse38 1))) (let ((.cse51 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse53))) (let ((.cse52 (select .cse51 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse48 (select .cse52 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse49 (select .cse53 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse50 (select (select (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse52 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse48 .cse49))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (let ((.cse45 (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse52 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse48 .cse49 .cse50))))) (store .cse45 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse47 (select .cse45 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse46 (store .cse47 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse48 .cse49 .cse50 (select .cse47 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (store .cse46 .cse4 (+ (select (select (store .cse45 |c_ULTIMATE.start_main_~a~0#1.base| .cse46) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse47 .cse4)))))))))))))) (let ((.cse44 (select .cse43 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse41 (select (select (store .cse43 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse44 |c_ULTIMATE.start_main_~#sum~0#1.offset| 0)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse42 (select (select (store .cse43 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse44 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse41)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (+ .cse41 .cse42 (select (select (store .cse43 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse44 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse41 .cse42))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))))))) (not (< 1 ~N~0)) (< 2 ~N~0))) (forall ((~N~0 Int)) (or (= (+ (* 2 ~N~0) (* ~N~0 ~N~0) 1) (let ((.cse54 (let ((.cse66 (store .cse23 .cse38 1))) (let ((.cse64 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse66))) (let ((.cse65 (select .cse64 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse61 (select .cse66 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse63 (select .cse65 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse62 (select (select (store .cse64 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse65 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse61 .cse63))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (let ((.cse58 (store .cse64 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse65 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse61 .cse62 .cse63))))) (store .cse58 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse60 (select .cse58 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse59 (store .cse60 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse60 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse61 .cse62 .cse63)))) (store .cse59 .cse4 (+ (select (select (store .cse58 |c_ULTIMATE.start_main_~a~0#1.base| .cse59) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse60 .cse4)))))))))))))) (let ((.cse55 (select .cse54 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse56 (select (select (store .cse54 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse55 |c_ULTIMATE.start_main_~#sum~0#1.offset| 0)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse57 (select (select (store .cse54 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse55 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse56)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (+ (select (select (store .cse54 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse55 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse56 .cse57))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse56 .cse57)))))) (< .cse40 ~N~0) (not (< .cse14 ~N~0)) (not (< 1 ~N~0)) (< 2 ~N~0))) (or (< 2 c_~N~0) .cse67 (not (< 1 c_~N~0)) (= (let ((.cse70 (let ((.cse75 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse77)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (let ((.cse72 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse34 .cse75 .cse76))))) (store .cse72 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse74 (select .cse72 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse73 (store .cse74 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse34 .cse75 (select .cse74 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse76)))) (store .cse73 .cse4 (+ (select .cse74 .cse4) (select (select (store .cse72 |c_ULTIMATE.start_main_~a~0#1.base| .cse73) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))))))) (let ((.cse71 (select .cse70 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse68 (select (select (store .cse70 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse71 |c_ULTIMATE.start_main_~#sum~0#1.offset| 0)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse69 (select (select (store .cse70 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse71 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse68)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (+ .cse68 .cse69 (select (select (store .cse70 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse71 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse68 .cse69))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))))) .cse18)) (or .cse67 (= (let ((.cse79 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse82 (store .cse23 |c_ULTIMATE.start_main_~a~0#1.offset| .cse77))) (store .cse82 .cse4 (+ (select .cse23 .cse4) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse82) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))))) (let ((.cse80 (select .cse79 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse78 (select (select (store .cse79 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse80 |c_ULTIMATE.start_main_~#sum~0#1.offset| 0)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse81 (select (select (store .cse79 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse80 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse78)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (+ .cse78 (select (select (store .cse79 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse80 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse78 .cse81))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse81))))) .cse18)) (or .cse26 .cse39 (= (let ((.cse85 (let ((.cse90 (select .cse23 .cse38))) (let ((.cse87 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse34 .cse90))))) (store .cse87 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse89 (select .cse87 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse88 (store .cse89 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse34 .cse90 (select .cse89 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (store .cse88 .cse4 (+ (select (select (store .cse87 |c_ULTIMATE.start_main_~a~0#1.base| .cse88) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse89 .cse4)))))))))) (let ((.cse86 (select .cse85 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse84 (select (select (store .cse85 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse86 |c_ULTIMATE.start_main_~#sum~0#1.offset| 0)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse83 (select (select (store .cse85 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse86 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse84)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (+ .cse83 .cse84 (select (select (store .cse85 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse86 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse83 .cse84))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))))) .cse18)) (or .cse67 (not (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0)) (= (let ((.cse92 (store .cse95 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse96 (store .cse37 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse34 .cse35 (select .cse37 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (store .cse96 .cse4 (+ (select .cse37 .cse4) (select (select (store .cse95 |c_ULTIMATE.start_main_~a~0#1.base| .cse96) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))))) (let ((.cse93 (select .cse92 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse94 (select (select (store .cse92 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse93 |c_ULTIMATE.start_main_~#sum~0#1.offset| 0)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse91 (select (select (store .cse92 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse93 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse94)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (+ .cse91 (select (select (store .cse92 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse93 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse91 .cse94))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse94))))) .cse18))))))))) is different from false [2022-11-25 16:05:46,605 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse97 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse23 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse24 (+ .cse97 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse17 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse34 (select .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse35 (select .cse23 .cse24))) (let ((.cse14 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse25 (+ .cse34 .cse35))) (let ((.cse95 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse25))) (.cse67 (< .cse14 c_~N~0)) (.cse40 (+ 2 |c_ULTIMATE.start_main_~i~0#1|)) (.cse76 (select .cse23 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse13 (store .cse23 .cse24 1)) (.cse77 (+ .cse34 .cse76)) (.cse26 (< .cse40 c_~N~0)) (.cse39 (not .cse67)) (.cse38 (+ .cse97 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse4 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse37 (select .cse95 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse18 (+ (* c_~N~0 2) (* c_~N~0 c_~N~0) 1))) (and (forall ((~N~0 Int)) (or (= (+ (* 2 ~N~0) (* ~N~0 ~N~0) 1) (let ((.cse2 (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse13))) (let ((.cse12 (select .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse8 (select .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse10 (select .cse13 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse9 (select (select (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (let ((.cse5 (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse9 .cse10))))) (store .cse5 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse7 (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse6 (store .cse7 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse8 (select .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse9 .cse10)))) (store .cse6 .cse4 (+ (select .cse7 .cse4) (select (select (store .cse5 |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|))))))))))))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| 0)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse0 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse1)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (+ .cse0 .cse1 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))))))) (not (< 1 ~N~0)) (< .cse14 ~N~0) (< 2 ~N~0) (not (< |c_ULTIMATE.start_main_~i~0#1| ~N~0)))) (= (let ((.cse15 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| 0)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse16 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse15)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (+ .cse15 .cse16 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse15 .cse16))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))) .cse18) (= (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse23 .cse24 .cse25)))) (let ((.cse21 (select .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse19 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| 0)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse22 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse19)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (+ .cse19 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse19 .cse22))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse22))))) .cse18) (or .cse26 (= (let ((.cse29 (let ((.cse36 (select .cse37 .cse38))) (let ((.cse31 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse34 .cse35 .cse36))))) (store .cse31 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse33 (select .cse31 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse32 (store .cse33 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse34 .cse35 (select .cse33 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse36)))) (store .cse32 .cse4 (+ (select (select (store .cse31 |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 .cse4)))))))))) (let ((.cse30 (select .cse29 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse27 (select (select (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.offset| 0)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse28 (select (select (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse27)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (+ .cse27 .cse28 (select (select (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse27 .cse28))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))))) .cse18) .cse39) (forall ((~N~0 Int)) (or (< .cse40 ~N~0) (not (< .cse14 ~N~0)) (= (+ (* 2 ~N~0) (* ~N~0 ~N~0) 1) (let ((.cse43 (let ((.cse53 (store .cse13 .cse38 1))) (let ((.cse51 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse53))) (let ((.cse52 (select .cse51 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse48 (select .cse52 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse49 (select .cse53 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse50 (select (select (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse52 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse48 .cse49))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (let ((.cse45 (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse52 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse48 .cse49 .cse50))))) (store .cse45 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse47 (select .cse45 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse46 (store .cse47 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse48 .cse49 .cse50 (select .cse47 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (store .cse46 .cse4 (+ (select (select (store .cse45 |c_ULTIMATE.start_main_~a~0#1.base| .cse46) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse47 .cse4)))))))))))))) (let ((.cse44 (select .cse43 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse41 (select (select (store .cse43 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse44 |c_ULTIMATE.start_main_~#sum~0#1.offset| 0)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse42 (select (select (store .cse43 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse44 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse41)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (+ .cse41 .cse42 (select (select (store .cse43 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse44 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse41 .cse42))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))))))) (not (< 1 ~N~0)) (< 2 ~N~0))) (forall ((~N~0 Int)) (or (= (+ (* 2 ~N~0) (* ~N~0 ~N~0) 1) (let ((.cse54 (let ((.cse66 (store .cse23 .cse38 1))) (let ((.cse64 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse66))) (let ((.cse65 (select .cse64 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse61 (select .cse66 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse63 (select .cse65 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse62 (select (select (store .cse64 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse65 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse61 .cse63))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (let ((.cse58 (store .cse64 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse65 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse61 .cse62 .cse63))))) (store .cse58 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse60 (select .cse58 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse59 (store .cse60 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse60 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse61 .cse62 .cse63)))) (store .cse59 .cse4 (+ (select (select (store .cse58 |c_ULTIMATE.start_main_~a~0#1.base| .cse59) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse60 .cse4)))))))))))))) (let ((.cse55 (select .cse54 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse56 (select (select (store .cse54 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse55 |c_ULTIMATE.start_main_~#sum~0#1.offset| 0)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse57 (select (select (store .cse54 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse55 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse56)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (+ (select (select (store .cse54 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse55 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse56 .cse57))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse56 .cse57)))))) (< .cse40 ~N~0) (not (< .cse14 ~N~0)) (not (< 1 ~N~0)) (< 2 ~N~0))) (or (< 2 c_~N~0) .cse67 (not (< 1 c_~N~0)) (= (let ((.cse70 (let ((.cse75 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse77)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (let ((.cse72 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse34 .cse75 .cse76))))) (store .cse72 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse74 (select .cse72 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse73 (store .cse74 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse34 .cse75 (select .cse74 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse76)))) (store .cse73 .cse4 (+ (select .cse74 .cse4) (select (select (store .cse72 |c_ULTIMATE.start_main_~a~0#1.base| .cse73) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))))))) (let ((.cse71 (select .cse70 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse68 (select (select (store .cse70 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse71 |c_ULTIMATE.start_main_~#sum~0#1.offset| 0)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse69 (select (select (store .cse70 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse71 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse68)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (+ .cse68 .cse69 (select (select (store .cse70 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse71 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse68 .cse69))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))))) .cse18)) (or .cse67 (= (let ((.cse79 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse82 (store .cse23 |c_ULTIMATE.start_main_~a~0#1.offset| .cse77))) (store .cse82 .cse4 (+ (select .cse23 .cse4) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse82) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))))) (let ((.cse80 (select .cse79 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse78 (select (select (store .cse79 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse80 |c_ULTIMATE.start_main_~#sum~0#1.offset| 0)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse81 (select (select (store .cse79 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse80 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse78)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (+ .cse78 (select (select (store .cse79 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse80 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse78 .cse81))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse81))))) .cse18)) (or .cse26 .cse39 (= (let ((.cse85 (let ((.cse90 (select .cse23 .cse38))) (let ((.cse87 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse34 .cse90))))) (store .cse87 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse89 (select .cse87 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse88 (store .cse89 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse34 .cse90 (select .cse89 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (store .cse88 .cse4 (+ (select (select (store .cse87 |c_ULTIMATE.start_main_~a~0#1.base| .cse88) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse89 .cse4)))))))))) (let ((.cse86 (select .cse85 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse84 (select (select (store .cse85 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse86 |c_ULTIMATE.start_main_~#sum~0#1.offset| 0)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse83 (select (select (store .cse85 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse86 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse84)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (+ .cse83 .cse84 (select (select (store .cse85 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse86 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse83 .cse84))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))))) .cse18)) (or .cse67 (not (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0)) (= (let ((.cse92 (store .cse95 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse96 (store .cse37 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse34 .cse35 (select .cse37 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (store .cse96 .cse4 (+ (select .cse37 .cse4) (select (select (store .cse95 |c_ULTIMATE.start_main_~a~0#1.base| .cse96) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))))) (let ((.cse93 (select .cse92 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse94 (select (select (store .cse92 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse93 |c_ULTIMATE.start_main_~#sum~0#1.offset| 0)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse91 (select (select (store .cse92 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse93 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse94)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (+ .cse91 (select (select (store .cse92 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse93 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse91 .cse94))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse94))))) .cse18))))))))) is different from true