./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/array-fpi/sina3.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b5237d83 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5674d58d-3223-4330-9a61-ffc8164dda5f/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5674d58d-3223-4330-9a61-ffc8164dda5f/bin/uautomizer-vX5HgA9Q3a/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5674d58d-3223-4330-9a61-ffc8164dda5f/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5674d58d-3223-4330-9a61-ffc8164dda5f/bin/uautomizer-vX5HgA9Q3a/config/AutomizerReach.xml -i ../../sv-benchmarks/c/array-fpi/sina3.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5674d58d-3223-4330-9a61-ffc8164dda5f/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5674d58d-3223-4330-9a61-ffc8164dda5f/bin/uautomizer-vX5HgA9Q3a --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 2aebf3cfbf85ca5d76e40b9ce94a108ab82985532ad1ea09b88a009b3e11ff5a --- 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-b5237d8 [2022-11-21 16:10:39,109 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 16:10:39,112 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 16:10:39,163 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 16:10:39,164 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 16:10:39,167 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 16:10:39,170 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 16:10:39,173 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 16:10:39,176 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 16:10:39,181 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 16:10:39,183 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 16:10:39,185 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 16:10:39,185 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 16:10:39,188 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 16:10:39,190 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 16:10:39,191 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 16:10:39,193 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 16:10:39,194 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 16:10:39,196 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 16:10:39,208 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 16:10:39,210 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 16:10:39,213 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 16:10:39,214 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 16:10:39,215 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 16:10:39,224 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 16:10:39,224 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 16:10:39,224 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 16:10:39,225 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 16:10:39,226 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 16:10:39,229 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 16:10:39,230 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 16:10:39,231 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 16:10:39,232 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 16:10:39,233 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 16:10:39,236 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 16:10:39,236 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 16:10:39,237 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 16:10:39,237 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 16:10:39,237 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 16:10:39,239 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 16:10:39,239 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 16:10:39,240 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5674d58d-3223-4330-9a61-ffc8164dda5f/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-21 16:10:39,276 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 16:10:39,276 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 16:10:39,277 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 16:10:39,277 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 16:10:39,278 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 16:10:39,278 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 16:10:39,278 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 16:10:39,279 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 16:10:39,279 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 16:10:39,279 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 16:10:39,280 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-21 16:10:39,280 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 16:10:39,281 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-21 16:10:39,281 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 16:10:39,281 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-21 16:10:39,281 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 16:10:39,281 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-21 16:10:39,281 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-21 16:10:39,282 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-21 16:10:39,282 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 16:10:39,282 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-21 16:10:39,282 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 16:10:39,282 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 16:10:39,283 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 16:10:39,283 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 16:10:39,283 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 16:10:39,283 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 16:10:39,283 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-21 16:10:39,283 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-21 16:10:39,284 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-21 16:10:39,284 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-21 16:10:39,284 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-21 16:10:39,284 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-21 16:10:39,285 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5674d58d-3223-4330-9a61-ffc8164dda5f/bin/uautomizer-vX5HgA9Q3a/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_5674d58d-3223-4330-9a61-ffc8164dda5f/bin/uautomizer-vX5HgA9Q3a 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 -> 2aebf3cfbf85ca5d76e40b9ce94a108ab82985532ad1ea09b88a009b3e11ff5a [2022-11-21 16:10:39,613 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 16:10:39,637 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 16:10:39,640 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 16:10:39,641 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 16:10:39,642 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 16:10:39,643 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5674d58d-3223-4330-9a61-ffc8164dda5f/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/array-fpi/sina3.c [2022-11-21 16:10:42,674 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 16:10:42,891 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 16:10:42,891 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5674d58d-3223-4330-9a61-ffc8164dda5f/sv-benchmarks/c/array-fpi/sina3.c [2022-11-21 16:10:42,898 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5674d58d-3223-4330-9a61-ffc8164dda5f/bin/uautomizer-vX5HgA9Q3a/data/33233fa24/ae9be59366954b95ba1890d7f48ba59d/FLAGc298d61b3 [2022-11-21 16:10:42,913 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5674d58d-3223-4330-9a61-ffc8164dda5f/bin/uautomizer-vX5HgA9Q3a/data/33233fa24/ae9be59366954b95ba1890d7f48ba59d [2022-11-21 16:10:42,916 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 16:10:42,918 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 16:10:42,919 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 16:10:42,920 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 16:10:42,923 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 16:10:42,924 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:10:42" (1/1) ... [2022-11-21 16:10:42,925 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1941639f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:10:42, skipping insertion in model container [2022-11-21 16:10:42,926 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:10:42" (1/1) ... [2022-11-21 16:10:42,932 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 16:10:42,947 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 16:10:43,112 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_5674d58d-3223-4330-9a61-ffc8164dda5f/sv-benchmarks/c/array-fpi/sina3.c[588,601] [2022-11-21 16:10:43,155 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:10:43,162 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 16:10:43,176 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_5674d58d-3223-4330-9a61-ffc8164dda5f/sv-benchmarks/c/array-fpi/sina3.c[588,601] [2022-11-21 16:10:43,185 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:10:43,199 INFO L208 MainTranslator]: Completed translation [2022-11-21 16:10:43,199 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:10:43 WrapperNode [2022-11-21 16:10:43,199 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 16:10:43,200 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 16:10:43,201 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 16:10:43,201 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 16:10:43,209 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:10:43" (1/1) ... [2022-11-21 16:10:43,219 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:10:43" (1/1) ... [2022-11-21 16:10:43,240 INFO L138 Inliner]: procedures = 17, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 104 [2022-11-21 16:10:43,240 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 16:10:43,241 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 16:10:43,241 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 16:10:43,241 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 16:10:43,251 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:10:43" (1/1) ... [2022-11-21 16:10:43,251 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:10:43" (1/1) ... [2022-11-21 16:10:43,254 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:10:43" (1/1) ... [2022-11-21 16:10:43,254 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:10:43" (1/1) ... [2022-11-21 16:10:43,261 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:10:43" (1/1) ... [2022-11-21 16:10:43,273 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:10:43" (1/1) ... [2022-11-21 16:10:43,274 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:10:43" (1/1) ... [2022-11-21 16:10:43,275 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:10:43" (1/1) ... [2022-11-21 16:10:43,277 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 16:10:43,278 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 16:10:43,279 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 16:10:43,279 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 16:10:43,280 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:10:43" (1/1) ... [2022-11-21 16:10:43,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 16:10:43,301 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5674d58d-3223-4330-9a61-ffc8164dda5f/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:10:43,312 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5674d58d-3223-4330-9a61-ffc8164dda5f/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 16:10:43,318 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5674d58d-3223-4330-9a61-ffc8164dda5f/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 16:10:43,353 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-21 16:10:43,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-21 16:10:43,353 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-21 16:10:43,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-21 16:10:43,354 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-21 16:10:43,354 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 16:10:43,354 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 16:10:43,354 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-21 16:10:43,354 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-21 16:10:43,423 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 16:10:43,425 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 16:10:43,613 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 16:10:43,619 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 16:10:43,619 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2022-11-21 16:10:43,621 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:10:43 BoogieIcfgContainer [2022-11-21 16:10:43,622 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 16:10:43,625 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 16:10:43,625 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 16:10:43,629 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 16:10:43,629 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 04:10:42" (1/3) ... [2022-11-21 16:10:43,630 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@114c3751 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:10:43, skipping insertion in model container [2022-11-21 16:10:43,630 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:10:43" (2/3) ... [2022-11-21 16:10:43,630 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@114c3751 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:10:43, skipping insertion in model container [2022-11-21 16:10:43,631 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:10:43" (3/3) ... [2022-11-21 16:10:43,632 INFO L112 eAbstractionObserver]: Analyzing ICFG sina3.c [2022-11-21 16:10:43,677 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 16:10:43,681 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-21 16:10:43,781 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 16:10:43,797 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;@33a99322, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 16:10:43,798 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-21 16:10:43,804 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 25 states have (on average 1.56) internal successors, (39), 26 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:10:43,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-21 16:10:43,817 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:10:43,818 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:10:43,820 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:10:43,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:10:43,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1389277550, now seen corresponding path program 1 times [2022-11-21 16:10:43,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:10:43,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321973605] [2022-11-21 16:10:43,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:10:43,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:10:44,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:44,101 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-21 16:10:44,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:10:44,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321973605] [2022-11-21 16:10:44,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321973605] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:10:44,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:10:44,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:10:44,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965507097] [2022-11-21 16:10:44,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:10:44,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-21 16:10:44,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:10:44,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-21 16:10:44,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-21 16:10:44,160 INFO L87 Difference]: Start difference. First operand has 27 states, 25 states have (on average 1.56) internal successors, (39), 26 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:10:44,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:10:44,187 INFO L93 Difference]: Finished difference Result 50 states and 72 transitions. [2022-11-21 16:10:44,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-21 16:10:44,197 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-21 16:10:44,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:10:44,205 INFO L225 Difference]: With dead ends: 50 [2022-11-21 16:10:44,206 INFO L226 Difference]: Without dead ends: 23 [2022-11-21 16:10:44,209 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-21 16:10:44,214 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 16:10:44,215 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 16:10:44,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-11-21 16:10:44,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-11-21 16:10:44,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:10:44,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-11-21 16:10:44,258 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 16 [2022-11-21 16:10:44,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:10:44,259 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-11-21 16:10:44,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:10:44,261 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-11-21 16:10:44,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-21 16:10:44,262 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:10:44,262 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:10:44,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-21 16:10:44,263 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:10:44,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:10:44,266 INFO L85 PathProgramCache]: Analyzing trace with hash 796930410, now seen corresponding path program 1 times [2022-11-21 16:10:44,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:10:44,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385292471] [2022-11-21 16:10:44,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:10:44,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:10:44,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:44,544 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-21 16:10:44,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:10:44,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385292471] [2022-11-21 16:10:44,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385292471] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:10:44,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:10:44,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 16:10:44,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746144606] [2022-11-21 16:10:44,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:10:44,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 16:10:44,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:10:44,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 16:10:44,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-21 16:10:44,548 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:10:44,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:10:44,661 INFO L93 Difference]: Finished difference Result 53 states and 64 transitions. [2022-11-21 16:10:44,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 16:10:44,661 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-21 16:10:44,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:10:44,662 INFO L225 Difference]: With dead ends: 53 [2022-11-21 16:10:44,662 INFO L226 Difference]: Without dead ends: 37 [2022-11-21 16:10:44,663 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-21 16:10:44,664 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 46 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:10:44,665 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 17 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:10:44,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-11-21 16:10:44,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 27. [2022-11-21 16:10:44,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:10:44,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-11-21 16:10:44,672 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 16 [2022-11-21 16:10:44,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:10:44,673 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-11-21 16:10:44,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:10:44,673 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-11-21 16:10:44,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-21 16:10:44,674 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:10:44,674 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:10:44,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-21 16:10:44,675 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:10:44,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:10:44,676 INFO L85 PathProgramCache]: Analyzing trace with hash 495241442, now seen corresponding path program 1 times [2022-11-21 16:10:44,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:10:44,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107522081] [2022-11-21 16:10:44,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:10:44,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:10:44,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:46,888 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:10:46,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:10:46,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107522081] [2022-11-21 16:10:46,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107522081] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:10:46,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [845045461] [2022-11-21 16:10:46,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:10:46,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:10:46,892 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5674d58d-3223-4330-9a61-ffc8164dda5f/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:10:46,899 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5674d58d-3223-4330-9a61-ffc8164dda5f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:10:46,926 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5674d58d-3223-4330-9a61-ffc8164dda5f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-21 16:10:47,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:47,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 53 conjunts are in the unsatisfiable core [2022-11-21 16:10:47,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:10:47,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:10:47,151 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-21 16:10:47,157 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 24 [2022-11-21 16:10:47,197 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-21 16:10:47,294 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-21 16:10:47,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:10:47,618 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-21 16:10:47,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:10:47,876 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 33 [2022-11-21 16:10:48,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:10:48,175 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 33 [2022-11-21 16:10:48,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:10:48,475 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 16:10:48,476 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 38 [2022-11-21 16:10:48,511 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:10:48,511 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:10:49,173 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:10:49,173 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:10:49,176 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:10:49,189 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:10:49,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [845045461] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:10:49,190 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:10:49,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 38 [2022-11-21 16:10:49,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521952264] [2022-11-21 16:10:49,191 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:10:49,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-21 16:10:49,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:10:49,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-21 16:10:49,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=1192, Unknown=0, NotChecked=0, Total=1406 [2022-11-21 16:10:49,197 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 38 states, 38 states have (on average 1.605263157894737) internal successors, (61), 38 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:10:51,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:10:51,546 INFO L93 Difference]: Finished difference Result 79 states and 90 transitions. [2022-11-21 16:10:51,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-21 16:10:51,546 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.605263157894737) internal successors, (61), 38 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-21 16:10:51,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:10:51,547 INFO L225 Difference]: With dead ends: 79 [2022-11-21 16:10:51,548 INFO L226 Difference]: Without dead ends: 77 [2022-11-21 16:10:51,549 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 24 SyntacticMatches, 4 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 991 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=504, Invalid=2802, Unknown=0, NotChecked=0, Total=3306 [2022-11-21 16:10:51,550 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 199 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-21 16:10:51,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 158 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-21 16:10:51,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-11-21 16:10:51,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 46. [2022-11-21 16:10:51,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.2222222222222223) internal successors, (55), 45 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:10:51,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 55 transitions. [2022-11-21 16:10:51,562 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 55 transitions. Word has length 24 [2022-11-21 16:10:51,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:10:51,563 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 55 transitions. [2022-11-21 16:10:51,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.605263157894737) internal successors, (61), 38 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:10:51,563 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2022-11-21 16:10:51,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-21 16:10:51,564 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:10:51,564 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:10:51,579 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5674d58d-3223-4330-9a61-ffc8164dda5f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-21 16:10:51,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5674d58d-3223-4330-9a61-ffc8164dda5f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:10:51,779 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:10:51,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:10:51,780 INFO L85 PathProgramCache]: Analyzing trace with hash 924425184, now seen corresponding path program 2 times [2022-11-21 16:10:51,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:10:51,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220990990] [2022-11-21 16:10:51,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:10:51,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:10:51,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:51,890 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-21 16:10:51,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:10:51,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220990990] [2022-11-21 16:10:51,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220990990] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:10:51,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1387228801] [2022-11-21 16:10:51,892 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 16:10:51,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:10:51,892 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5674d58d-3223-4330-9a61-ffc8164dda5f/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:10:51,894 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5674d58d-3223-4330-9a61-ffc8164dda5f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:10:51,903 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5674d58d-3223-4330-9a61-ffc8164dda5f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-21 16:10:51,999 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-21 16:10:51,999 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 16:10:52,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-21 16:10:52,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:10:52,074 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-21 16:10:52,075 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:10:52,150 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-21 16:10:52,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1387228801] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:10:52,150 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:10:52,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2022-11-21 16:10:52,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453778420] [2022-11-21 16:10:52,151 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:10:52,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-21 16:10:52,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:10:52,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-21 16:10:52,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-11-21 16:10:52,153 INFO L87 Difference]: Start difference. First operand 46 states and 55 transitions. Second operand has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:10:52,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:10:52,577 INFO L93 Difference]: Finished difference Result 99 states and 116 transitions. [2022-11-21 16:10:52,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-21 16:10:52,578 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-21 16:10:52,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:10:52,578 INFO L225 Difference]: With dead ends: 99 [2022-11-21 16:10:52,579 INFO L226 Difference]: Without dead ends: 51 [2022-11-21 16:10:52,579 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=396, Unknown=0, NotChecked=0, Total=506 [2022-11-21 16:10:52,580 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 123 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 16:10:52,581 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 95 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 16:10:52,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-11-21 16:10:52,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 35. [2022-11-21 16:10:52,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 34 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:10:52,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2022-11-21 16:10:52,590 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 26 [2022-11-21 16:10:52,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:10:52,591 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2022-11-21 16:10:52,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:10:52,591 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-11-21 16:10:52,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-21 16:10:52,592 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:10:52,592 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:10:52,603 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5674d58d-3223-4330-9a61-ffc8164dda5f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-21 16:10:52,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5674d58d-3223-4330-9a61-ffc8164dda5f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:10:52,799 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:10:52,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:10:52,799 INFO L85 PathProgramCache]: Analyzing trace with hash -826292134, now seen corresponding path program 3 times [2022-11-21 16:10:52,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:10:52,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680956814] [2022-11-21 16:10:52,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:10:52,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:10:52,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:55,310 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:10:55,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:10:55,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680956814] [2022-11-21 16:10:55,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680956814] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:10:55,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [371655491] [2022-11-21 16:10:55,311 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-21 16:10:55,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:10:55,311 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5674d58d-3223-4330-9a61-ffc8164dda5f/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:10:55,313 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5674d58d-3223-4330-9a61-ffc8164dda5f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:10:55,342 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5674d58d-3223-4330-9a61-ffc8164dda5f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-21 16:10:55,419 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-21 16:10:55,419 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 16:10:55,421 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 73 conjunts are in the unsatisfiable core [2022-11-21 16:10:55,428 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:10:55,535 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 16:10:55,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:10:55,547 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 18 treesize of output 16 [2022-11-21 16:10:55,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:10:55,655 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-21 16:10:55,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:10:55,860 INFO L321 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-11-21 16:10:55,860 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2022-11-21 16:10:56,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:10:56,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:10:56,364 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-21 16:10:56,364 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 42 [2022-11-21 16:10:56,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:10:56,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:10:56,585 INFO L321 Elim1Store]: treesize reduction 25, result has 34.2 percent of original size [2022-11-21 16:10:56,586 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 62 [2022-11-21 16:10:57,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:10:57,249 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:10:57,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:10:57,255 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-21 16:10:57,255 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 55 [2022-11-21 16:10:57,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:10:57,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:10:57,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:10:57,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:10:57,586 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:10:57,595 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 51 [2022-11-21 16:10:58,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:10:58,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:10:58,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:10:58,033 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 49 [2022-11-21 16:10:58,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:10:58,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:10:58,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:10:58,265 INFO L321 Elim1Store]: treesize reduction 34, result has 49.3 percent of original size [2022-11-21 16:10:58,266 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 74 [2022-11-21 16:10:58,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:10:58,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:10:58,961 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 16:10:58,961 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 34 [2022-11-21 16:10:59,022 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:10:59,022 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:12:41,853 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:12:41,854 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:12:41,855 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:12:41,857 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:12:41,858 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:12:41,860 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:12:41,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:12:41,866 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:12:41,867 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:12:41,867 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:12:41,868 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:12:41,869 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:12:41,874 INFO L321 Elim1Store]: treesize reduction 44, result has 2.2 percent of original size [2022-11-21 16:12:41,875 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 167 treesize of output 1 [2022-11-21 16:12:41,876 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:12:41,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [371655491] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:12:41,877 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:12:41,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 26, 24] total 67 [2022-11-21 16:12:41,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474533252] [2022-11-21 16:12:41,877 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:12:41,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-11-21 16:12:41,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:12:41,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-11-21 16:12:41,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=490, Invalid=3885, Unknown=47, NotChecked=0, Total=4422 [2022-11-21 16:12:41,881 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 67 states, 67 states have (on average 1.2985074626865671) internal successors, (87), 67 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:13:29,513 WARN L233 SmtUtils]: Spent 24.82s on a formula simplification that was a NOOP. DAG size: 236 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 16:13:31,761 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 16:13:33,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 16:13:35,357 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 16:13:36,937 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 16:13:58,678 WARN L233 SmtUtils]: Spent 17.75s on a formula simplification. DAG size of input: 98 DAG size of output: 92 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 16:14:35,720 WARN L233 SmtUtils]: Spent 36.48s on a formula simplification. DAG size of input: 128 DAG size of output: 122 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 16:14:37,802 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 16:14:39,836 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 16:14:41,968 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 16:14:45,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 16:14:47,917 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 16:14:49,932 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 16:14:54,432 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 16:14:56,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 16:14:58,460 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 16:15:32,353 WARN L233 SmtUtils]: Spent 28.74s on a formula simplification. DAG size of input: 131 DAG size of output: 125 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 16:16:04,503 WARN L233 SmtUtils]: Spent 29.22s on a formula simplification. DAG size of input: 134 DAG size of output: 129 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 16:16:07,176 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 16:16:09,187 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 16:16:30,969 WARN L233 SmtUtils]: Spent 18.37s on a formula simplification. DAG size of input: 101 DAG size of output: 96 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 16:16:32,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:16:32,906 INFO L93 Difference]: Finished difference Result 100 states and 112 transitions. [2022-11-21 16:16:32,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-21 16:16:32,907 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 67 states have (on average 1.2985074626865671) internal successors, (87), 67 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-11-21 16:16:32,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:16:32,908 INFO L225 Difference]: With dead ends: 100 [2022-11-21 16:16:32,912 INFO L226 Difference]: Without dead ends: 79 [2022-11-21 16:16:32,922 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3193 ImplicationChecksByTransitivity, 301.6s TimeCoverageRelationStatistics Valid=1237, Invalid=9217, Unknown=52, NotChecked=0, Total=10506 [2022-11-21 16:16:32,923 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 298 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 862 mSolverCounterSat, 236 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 33.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 1111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 236 IncrementalHoareTripleChecker+Valid, 862 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 33.9s IncrementalHoareTripleChecker+Time [2022-11-21 16:16:32,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 312 Invalid, 1111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [236 Valid, 862 Invalid, 13 Unknown, 0 Unchecked, 33.9s Time] [2022-11-21 16:16:32,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-11-21 16:16:32,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 58. [2022-11-21 16:16:32,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 1.1228070175438596) internal successors, (64), 57 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:16:32,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 64 transitions. [2022-11-21 16:16:32,956 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 64 transitions. Word has length 32 [2022-11-21 16:16:32,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:16:32,957 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 64 transitions. [2022-11-21 16:16:32,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 1.2985074626865671) internal successors, (87), 67 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:16:32,958 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2022-11-21 16:16:32,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-21 16:16:32,959 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:16:32,959 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:16:32,967 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5674d58d-3223-4330-9a61-ffc8164dda5f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-21 16:16:33,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5674d58d-3223-4330-9a61-ffc8164dda5f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:16:33,166 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:16:33,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:16:33,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1205583320, now seen corresponding path program 4 times [2022-11-21 16:16:33,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:16:33,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572544334] [2022-11-21 16:16:33,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:16:33,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:16:33,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:16:33,365 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-21 16:16:33,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:16:33,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572544334] [2022-11-21 16:16:33,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572544334] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:16:33,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [217534548] [2022-11-21 16:16:33,366 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-21 16:16:33,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:16:33,366 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5674d58d-3223-4330-9a61-ffc8164dda5f/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:16:33,367 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5674d58d-3223-4330-9a61-ffc8164dda5f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:16:33,394 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5674d58d-3223-4330-9a61-ffc8164dda5f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-21 16:16:33,498 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-21 16:16:33,498 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 16:16:33,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-21 16:16:33,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:16:33,600 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-21 16:16:33,600 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:16:33,695 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-21 16:16:33,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [217534548] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:16:33,696 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:16:33,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-11-21 16:16:33,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072099097] [2022-11-21 16:16:33,696 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:16:33,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-21 16:16:33,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:16:33,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-21 16:16:33,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-11-21 16:16:33,698 INFO L87 Difference]: Start difference. First operand 58 states and 64 transitions. Second operand has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:16:34,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:16:34,158 INFO L93 Difference]: Finished difference Result 118 states and 130 transitions. [2022-11-21 16:16:34,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-21 16:16:34,159 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-11-21 16:16:34,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:16:34,160 INFO L225 Difference]: With dead ends: 118 [2022-11-21 16:16:34,160 INFO L226 Difference]: Without dead ends: 99 [2022-11-21 16:16:34,161 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 57 SyntacticMatches, 6 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2022-11-21 16:16:34,162 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 110 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 16:16:34,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 125 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 16:16:34,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-11-21 16:16:34,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 64. [2022-11-21 16:16:34,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.1111111111111112) internal successors, (70), 63 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:16:34,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2022-11-21 16:16:34,189 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 34 [2022-11-21 16:16:34,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:16:34,190 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2022-11-21 16:16:34,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:16:34,190 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2022-11-21 16:16:34,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-21 16:16:34,191 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:16:34,191 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:16:34,199 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5674d58d-3223-4330-9a61-ffc8164dda5f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-21 16:16:34,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5674d58d-3223-4330-9a61-ffc8164dda5f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:16:34,395 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:16:34,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:16:34,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1737020496, now seen corresponding path program 1 times [2022-11-21 16:16:34,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:16:34,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879207119] [2022-11-21 16:16:34,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:16:34,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:16:34,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:16:36,936 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:16:36,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:16:36,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879207119] [2022-11-21 16:16:36,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879207119] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:16:36,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1678587895] [2022-11-21 16:16:36,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:16:36,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:16:36,938 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5674d58d-3223-4330-9a61-ffc8164dda5f/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:16:36,943 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5674d58d-3223-4330-9a61-ffc8164dda5f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:16:36,966 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5674d58d-3223-4330-9a61-ffc8164dda5f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-21 16:16:37,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:16:37,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 81 conjunts are in the unsatisfiable core [2022-11-21 16:16:37,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:16:37,177 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-21 16:16:37,178 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2022-11-21 16:16:37,202 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 16:16:37,301 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-21 16:16:37,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:16:37,542 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-21 16:16:38,058 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 33 [2022-11-21 16:16:38,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:16:38,243 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2022-11-21 16:16:38,612 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:16:38,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:16:38,615 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-21 16:16:38,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:16:38,903 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 47 [2022-11-21 16:16:39,264 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 40 [2022-11-21 16:16:39,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:16:39,280 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2022-11-21 16:16:39,498 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2022-11-21 16:16:40,132 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 34 [2022-11-21 16:16:40,191 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:16:40,192 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:16:40,782 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_319 (Array Int Int))) (= (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_319))) (+ (select (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|)))) (+ c_~N~0 1))) is different from false [2022-11-21 16:16:40,981 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_319 (Array Int Int))) (= (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_319))) (+ (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|)) (select (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ c_~N~0 1))) is different from false [2022-11-21 16:16:40,995 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_319 (Array Int Int))) (= (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse4 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse2 .cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse4 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_319))) (+ (select (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|)))) (+ c_~N~0 1))) is different from false [2022-11-21 16:16:41,008 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_319 (Array Int Int))) (= (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ .cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse3))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_319))) (+ (select (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|)))) (+ c_~N~0 1))) is different from false [2022-11-21 16:16:41,042 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_319 (Array Int Int))) (= (let ((.cse0 (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) 1)))) (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse3 (select (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse4 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse3 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse4)))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_319))) (+ (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|)) (select (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ c_~N~0 1))) is different from false [2022-11-21 16:16:41,062 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_319 (Array Int Int))) (= (let ((.cse0 (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 4 |c_ULTIMATE.start_main_~b~0#1.offset|) 1)))) (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse4 (select (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse3 .cse4)))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_319))) (+ (select (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|)))) (+ c_~N~0 1))) is different from false [2022-11-21 16:16:41,079 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:16:41,079 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 285 treesize of output 169 [2022-11-21 16:16:41,102 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_2 (Array Int Int)) (v_ArrVal_319 (Array Int Int))) (or (= (let ((.cse0 (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_arrayElimArr_2))) (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse3 (select (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse4 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse3 .cse4)))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_319))) (+ (select (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|)))) (+ c_~N~0 1)) (not (= (select v_arrayElimArr_2 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 4 |c_ULTIMATE.start_main_~b~0#1.offset|)) 1)))) is different from false [2022-11-21 16:16:41,133 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_2 (Array Int Int)) (v_ArrVal_319 (Array Int Int))) (let ((.cse1 (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|))) (or (= (let ((.cse0 (store (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_arrayElimArr_2))) (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse4 (select (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse5 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse4 .cse5)))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_319))) (+ (select (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) .cse1))) (+ c_~N~0 1)) (not (= (select v_arrayElimArr_2 .cse1) 1))))) is different from false [2022-11-21 16:16:45,164 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:16:45,170 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-21 16:16:45,170 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 583 treesize of output 1 [2022-11-21 16:16:45,174 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2022-11-21 16:16:45,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1678587895] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:16:45,174 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:16:45,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 23] total 66 [2022-11-21 16:16:45,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113950465] [2022-11-21 16:16:45,175 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:16:45,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-11-21 16:16:45,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:16:45,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-11-21 16:16:45,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=2953, Unknown=55, NotChecked=952, Total=4290 [2022-11-21 16:16:45,179 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand has 66 states, 66 states have (on average 1.5) internal successors, (99), 66 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:17:06,756 WARN L233 SmtUtils]: Spent 6.53s on a formula simplification. DAG size of input: 129 DAG size of output: 124 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 16:17:18,675 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 16:17:53,309 WARN L233 SmtUtils]: Spent 19.60s on a formula simplification. DAG size of input: 138 DAG size of output: 133 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 16:18:19,904 WARN L233 SmtUtils]: Spent 20.45s on a formula simplification. DAG size of input: 134 DAG size of output: 129 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 16:18:49,994 WARN L233 SmtUtils]: Spent 8.47s on a formula simplification that was a NOOP. DAG size: 127 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 16:19:05,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:19:05,112 INFO L93 Difference]: Finished difference Result 154 states and 167 transitions. [2022-11-21 16:19:05,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2022-11-21 16:19:05,113 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 1.5) internal successors, (99), 66 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-11-21 16:19:05,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:19:05,114 INFO L225 Difference]: With dead ends: 154 [2022-11-21 16:19:05,114 INFO L226 Difference]: Without dead ends: 145 [2022-11-21 16:19:05,120 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 5464 ImplicationChecksByTransitivity, 134.7s TimeCoverageRelationStatistics Valid=1867, Invalid=15891, Unknown=96, NotChecked=2168, Total=20022 [2022-11-21 16:19:05,121 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 711 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 1390 mSolverCounterSat, 307 mSolverCounterUnsat, 28 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 711 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 2459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 307 IncrementalHoareTripleChecker+Valid, 1390 IncrementalHoareTripleChecker+Invalid, 28 IncrementalHoareTripleChecker+Unknown, 734 IncrementalHoareTripleChecker+Unchecked, 12.3s IncrementalHoareTripleChecker+Time [2022-11-21 16:19:05,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [711 Valid, 422 Invalid, 2459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [307 Valid, 1390 Invalid, 28 Unknown, 734 Unchecked, 12.3s Time] [2022-11-21 16:19:05,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-11-21 16:19:05,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 75. [2022-11-21 16:19:05,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 74 states have (on average 1.1081081081081081) internal successors, (82), 74 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:19:05,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2022-11-21 16:19:05,155 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 36 [2022-11-21 16:19:05,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:19:05,156 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2022-11-21 16:19:05,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 1.5) internal successors, (99), 66 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:19:05,156 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2022-11-21 16:19:05,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-21 16:19:05,158 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:19:05,158 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:19:05,169 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5674d58d-3223-4330-9a61-ffc8164dda5f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-21 16:19:05,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5674d58d-3223-4330-9a61-ffc8164dda5f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-21 16:19:05,369 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:19:05,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:19:05,369 INFO L85 PathProgramCache]: Analyzing trace with hash 475985222, now seen corresponding path program 2 times [2022-11-21 16:19:05,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:19:05,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678726079] [2022-11-21 16:19:05,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:19:05,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:19:05,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:19:05,978 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-21 16:19:05,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:19:05,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678726079] [2022-11-21 16:19:05,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678726079] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:19:05,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [725568659] [2022-11-21 16:19:05,979 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 16:19:05,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:19:05,980 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5674d58d-3223-4330-9a61-ffc8164dda5f/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:19:05,983 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5674d58d-3223-4330-9a61-ffc8164dda5f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:19:06,014 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5674d58d-3223-4330-9a61-ffc8164dda5f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-21 16:19:06,107 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-21 16:19:06,108 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 16:19:06,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-21 16:19:06,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:19:07,196 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-21 16:19:07,196 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:19:08,012 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-21 16:19:08,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [725568659] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:19:08,012 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:19:08,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-11-21 16:19:08,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701154797] [2022-11-21 16:19:08,013 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:19:08,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-21 16:19:08,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:19:08,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-21 16:19:08,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-11-21 16:19:08,014 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:19:09,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:19:09,166 INFO L93 Difference]: Finished difference Result 108 states and 115 transitions. [2022-11-21 16:19:09,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-21 16:19:09,167 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2022-11-21 16:19:09,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:19:09,168 INFO L225 Difference]: With dead ends: 108 [2022-11-21 16:19:09,168 INFO L226 Difference]: Without dead ends: 65 [2022-11-21 16:19:09,169 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 69 SyntacticMatches, 6 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2022-11-21 16:19:09,169 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 126 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-21 16:19:09,170 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 58 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-21 16:19:09,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-21 16:19:09,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 43. [2022-11-21 16:19:09,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.119047619047619) internal successors, (47), 42 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:19:09,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2022-11-21 16:19:09,188 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 40 [2022-11-21 16:19:09,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:19:09,188 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2022-11-21 16:19:09,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:19:09,189 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-11-21 16:19:09,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-21 16:19:09,190 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:19:09,190 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:19:09,199 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5674d58d-3223-4330-9a61-ffc8164dda5f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-11-21 16:19:09,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5674d58d-3223-4330-9a61-ffc8164dda5f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-21 16:19:09,395 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:19:09,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:19:09,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1201221586, now seen corresponding path program 5 times [2022-11-21 16:19:09,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:19:09,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628058750] [2022-11-21 16:19:09,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:19:09,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:19:09,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:19:22,121 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:19:22,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:19:22,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628058750] [2022-11-21 16:19:22,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628058750] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:19:22,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [841083912] [2022-11-21 16:19:22,122 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-21 16:19:22,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:19:22,122 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5674d58d-3223-4330-9a61-ffc8164dda5f/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:19:22,123 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5674d58d-3223-4330-9a61-ffc8164dda5f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:19:22,126 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5674d58d-3223-4330-9a61-ffc8164dda5f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-21 16:19:22,396 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-11-21 16:19:22,396 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 16:19:22,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 98 conjunts are in the unsatisfiable core [2022-11-21 16:19:22,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:19:23,030 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 16:19:23,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:19:23,086 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-21 16:19:23,086 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 24 [2022-11-21 16:19:23,571 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-21 16:19:24,636 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2022-11-21 16:19:25,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:19:25,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:19:25,680 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2022-11-21 16:19:27,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:19:27,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:19:27,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:19:27,088 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-11-21 16:19:28,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:19:28,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:19:28,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:19:28,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:19:28,379 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 66 [2022-11-21 16:19:29,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:19:29,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:19:29,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:19:29,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:19:29,302 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 66 [2022-11-21 16:19:30,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:19:30,849 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:19:30,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:19:30,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:19:30,861 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 61 [2022-11-21 16:19:32,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:19:32,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:19:32,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:19:32,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:19:32,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:19:32,185 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:19:32,191 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 59 [2022-11-21 16:19:33,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:19:33,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:19:33,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:19:33,665 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 59 [2022-11-21 16:19:35,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:19:35,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:19:35,382 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:19:35,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:19:35,388 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:19:35,390 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 65 [2022-11-21 16:19:36,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:19:36,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:19:36,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:19:36,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:19:36,731 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:19:36,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:19:36,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:19:36,750 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:19:36,756 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-21 16:19:36,756 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 68 [2022-11-21 16:19:38,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:19:38,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:19:38,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:19:38,103 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:19:38,108 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-21 16:19:38,109 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 45 [2022-11-21 16:19:40,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:19:40,612 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 16:19:40,612 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 34 [2022-11-21 16:19:40,997 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 1 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:19:40,997 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:20:30,628 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:20:30,629 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:20:30,631 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:20:30,632 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:20:30,633 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:20:30,647 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 1 proven. 34 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:20:30,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [841083912] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:20:30,648 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:20:30,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 30] total 87 [2022-11-21 16:20:30,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469015429] [2022-11-21 16:20:30,648 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:20:30,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 87 states [2022-11-21 16:20:30,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:20:30,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2022-11-21 16:20:30,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=658, Invalid=6819, Unknown=5, NotChecked=0, Total=7482 [2022-11-21 16:20:30,651 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand has 87 states, 87 states have (on average 1.2758620689655173) internal successors, (111), 87 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:20:32,908 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse51 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse49 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse48 (store .cse51 (+ .cse49 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) (.cse50 (+ .cse49 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse19 (store .cse51 .cse50 1)) (.cse9 (store .cse48 .cse50 1)) (.cse20 (+ .cse49 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse6 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse7 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse10 (+ c_~N~0 1)) (.cse11 (< 3 c_~N~0))) (and (or (forall ((|v_ULTIMATE.start_main_~i~0#1_143| Int) (|v_ULTIMATE.start_main_~i~0#1_142| Int) (v_ArrVal_461 Int) (v_ArrVal_459 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_143| 1) |v_ULTIMATE.start_main_~i~0#1_142|)) (= (let ((.cse2 (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse9))) (store .cse8 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (store (select .cse8 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) (+ (* |v_ULTIMATE.start_main_~i~0#1_143| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_459) (+ (* |v_ULTIMATE.start_main_~i~0#1_142| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_461))))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse4 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse5 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (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 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (+ .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 .cse4 .cse5))) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse4 .cse5)))))) .cse10) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_143|)) (not (< |v_ULTIMATE.start_main_~i~0#1_142| c_~N~0)))) .cse11) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_143| Int) (|v_ULTIMATE.start_main_~i~0#1_142| Int) (v_ArrVal_461 Int) (v_ArrVal_459 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_143| 1) |v_ULTIMATE.start_main_~i~0#1_142|)) (= (let ((.cse13 (let ((.cse18 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse19 .cse20 1)))) (store .cse18 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (store (select .cse18 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) (+ (* |v_ULTIMATE.start_main_~i~0#1_143| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_459) (+ (* |v_ULTIMATE.start_main_~i~0#1_142| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_461))))) (let ((.cse14 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse15 (select .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse17 (select (select .cse13 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse12 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse15 .cse17))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (let ((.cse16 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse15 .cse17))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (+ .cse12 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse15 .cse16 .cse17))) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse15 .cse16 .cse17)))))) .cse10) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_143|)) (not (< |v_ULTIMATE.start_main_~i~0#1_142| c_~N~0)))) .cse11) (<= (mod c_~N~0 4294967296) 536870911) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_143| Int) (|v_ULTIMATE.start_main_~i~0#1_142| Int) (v_ArrVal_461 Int) (v_ArrVal_459 Int)) (or (= (let ((.cse25 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) (+ (* |v_ULTIMATE.start_main_~i~0#1_143| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_459) (+ (* |v_ULTIMATE.start_main_~i~0#1_142| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_461)))) (let ((.cse26 (select .cse25 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse21 (select .cse26 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse24 (select (select .cse25 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse22 (select (select (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse21 .cse24))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (let ((.cse23 (select (select (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse21 .cse22 .cse24))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (+ .cse21 .cse22 .cse23 .cse24 (select (select (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse21 .cse22 .cse23 .cse24))) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|))))))) .cse10) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_143| 1) |v_ULTIMATE.start_main_~i~0#1_142|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_143|)) (not (< |v_ULTIMATE.start_main_~i~0#1_142| c_~N~0)))) .cse11) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_143| Int) (|v_ULTIMATE.start_main_~i~0#1_142| Int) (v_ArrVal_461 Int) (v_ArrVal_459 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_143| 1) |v_ULTIMATE.start_main_~i~0#1_142|)) (= (let ((.cse30 (let ((.cse33 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse19))) (store .cse33 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (store (select .cse33 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) (+ (* |v_ULTIMATE.start_main_~i~0#1_143| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_459) (+ (* |v_ULTIMATE.start_main_~i~0#1_142| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_461))))) (let ((.cse31 (select .cse30 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse29 (select (select .cse30 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse32 (select .cse31 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse28 (select (select (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse31 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse29 .cse32))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (let ((.cse27 (select (select (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse31 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse28 .cse29 .cse32))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (+ .cse27 .cse28 .cse29 (select (select (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse31 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse27 .cse28 .cse29 .cse32))) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse32)))))) .cse10) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_143|)) (not (< |v_ULTIMATE.start_main_~i~0#1_142| c_~N~0)))) .cse11) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_143| Int) (|v_ULTIMATE.start_main_~i~0#1_142| Int) (v_ArrVal_461 Int) (v_ArrVal_459 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_143| 1) |v_ULTIMATE.start_main_~i~0#1_142|)) (= (let ((.cse35 (let ((.cse40 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse9 .cse20 1)))) (store .cse40 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (store (select .cse40 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) (+ (* |v_ULTIMATE.start_main_~i~0#1_143| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_459) (+ (* |v_ULTIMATE.start_main_~i~0#1_142| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_461))))) (let ((.cse36 (select .cse35 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse34 (select .cse36 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse39 (select (select .cse35 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse38 (select (select (store .cse35 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse34 .cse39))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (let ((.cse37 (select (select (store .cse35 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse34 .cse38 .cse39))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (+ .cse34 (select (select (store .cse35 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse34 .cse37 .cse38 .cse39))) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse37 .cse38 .cse39)))))) .cse10) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_143|)) (not (< |v_ULTIMATE.start_main_~i~0#1_142| c_~N~0)))) .cse11) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_143| Int) (|v_ULTIMATE.start_main_~i~0#1_142| Int) (v_ArrVal_461 Int) (v_ArrVal_459 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_143| 1) |v_ULTIMATE.start_main_~i~0#1_142|)) (= (let ((.cse45 (let ((.cse47 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse48))) (store .cse47 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (store (select .cse47 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) (+ (* |v_ULTIMATE.start_main_~i~0#1_143| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_459) (+ (* |v_ULTIMATE.start_main_~i~0#1_142| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_461))))) (let ((.cse46 (select .cse45 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse41 (select (select .cse45 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse42 (select .cse46 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse43 (select (select (store .cse45 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse46 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse41 .cse42))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (let ((.cse44 (select (select (store .cse45 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse46 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse41 .cse42 .cse43))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (+ .cse41 .cse42 .cse43 .cse44 (select (select (store .cse45 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse46 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse41 .cse42 .cse43 .cse44))) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|))))))) .cse10) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_143|)) (not (< |v_ULTIMATE.start_main_~i~0#1_142| c_~N~0)))) .cse11))))) is different from true [2022-11-21 16:20:51,314 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 16:21:41,889 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse13 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse93 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse94 (+ .cse13 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse64 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse14 (select .cse64 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse40 (select .cse93 .cse94))) (let ((.cse41 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse64 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse14 .cse40)))) (.cse92 (+ .cse13 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse43 (select .cse93 .cse92)) (.cse66 (select (select .cse41 |c_ULTIMATE.start_main_~a~0#1.base|) .cse92)) (.cse84 (store .cse93 .cse94 1))) (let ((.cse39 (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0)) (.cse32 (<= (mod c_~N~0 4294967296) 536870911)) (.cse30 (store .cse93 .cse92 1)) (.cse9 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse42 (select .cse93 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse22 (store .cse84 .cse92 1)) (.cse67 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse64 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse14 .cse40 .cse66)))) (.cse6 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse7 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse11 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse44 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse64 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse14 .cse43)))) (.cse31 (+ .cse13 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse10 (+ c_~N~0 1)) (.cse12 (< 3 c_~N~0))) (and (or (forall ((|v_ULTIMATE.start_main_~i~0#1_143| Int) (|v_ULTIMATE.start_main_~i~0#1_142| Int) (v_ArrVal_461 Int) (v_ArrVal_459 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_143| 1) |v_ULTIMATE.start_main_~i~0#1_142|)) (= (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (store (store .cse8 .cse9 1) (+ (* |v_ULTIMATE.start_main_~i~0#1_143| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_459) (+ (* |v_ULTIMATE.start_main_~i~0#1_142| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_461)))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse5 (select (select .cse2 |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| (+ .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (let ((.cse1 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (+ .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 .cse4 .cse5))) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse4 .cse5)))))) .cse10) (not (<= .cse11 |v_ULTIMATE.start_main_~i~0#1_143|)) (not (< |v_ULTIMATE.start_main_~i~0#1_142| c_~N~0)))) .cse12) (or (<= (+ .cse13 |c_ULTIMATE.start_main_~a~0#1.offset| 1) (* c_~N~0 8)) (and (<= c_~N~0 .cse14) (<= .cse14 c_~N~0))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_143| Int) (|v_ULTIMATE.start_main_~i~0#1_142| Int) (v_ArrVal_461 Int) (v_ArrVal_459 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_143| 1) |v_ULTIMATE.start_main_~i~0#1_142|)) (= (let ((.cse17 (let ((.cse21 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse22))) (store .cse21 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (store (select .cse21 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) (+ (* |v_ULTIMATE.start_main_~i~0#1_143| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_459) (+ (* |v_ULTIMATE.start_main_~i~0#1_142| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_461))))) (let ((.cse18 (select .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse16 (select (select .cse17 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse19 (select .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse20 (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|) .cse7))) (let ((.cse15 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse16 .cse19 .cse20))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (+ .cse15 .cse16 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse15 .cse16 .cse19 .cse20))) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse19 .cse20)))))) .cse10) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_143|)) (not (< |v_ULTIMATE.start_main_~i~0#1_142| c_~N~0)))) .cse12) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_143| Int) (|v_ULTIMATE.start_main_~i~0#1_142| Int) (v_ArrVal_461 Int) (v_ArrVal_459 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_143| 1) |v_ULTIMATE.start_main_~i~0#1_142|)) (= (let ((.cse24 (let ((.cse29 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse30 .cse31 1)))) (store .cse29 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (store (select .cse29 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) (+ (* |v_ULTIMATE.start_main_~i~0#1_143| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_459) (+ (* |v_ULTIMATE.start_main_~i~0#1_142| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_461))))) (let ((.cse25 (select .cse24 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse26 (select .cse25 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse28 (select (select .cse24 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse23 (select (select (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse26 .cse28))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (let ((.cse27 (select (select (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse23 .cse26 .cse28))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (+ .cse23 (select (select (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse23 .cse26 .cse27 .cse28))) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse26 .cse27 .cse28)))))) .cse10) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_143|)) (not (< |v_ULTIMATE.start_main_~i~0#1_142| c_~N~0)))) .cse12) (or .cse12 (= (+ .cse14 (select .cse8 |c_ULTIMATE.start_main_~b~0#1.offset|)) .cse10)) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) .cse32 (or (forall ((v_ArrVal_461 Int)) (= (let ((.cse36 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store .cse8 .cse9 v_ArrVal_461)))) (let ((.cse37 (select .cse36 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse34 (select (select .cse36 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse38 (select .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse35 (select (select (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse34 .cse38))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (let ((.cse33 (select (select (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse34 .cse35 .cse38))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (+ .cse33 .cse34 .cse35 (select (select (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse33 .cse34 .cse35 .cse38))) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse38)))))) .cse10)) (not .cse39) .cse12) (or (= (+ .cse14 .cse40 (select (select .cse41 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)) .cse10) .cse12) (or (= .cse10 .cse42) .cse39) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (or (= (+ .cse14 .cse43 (select (select .cse44 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)) .cse10) .cse12) (or (and (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse32) (and (not .cse32) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| 0))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_143| Int) (|v_ULTIMATE.start_main_~i~0#1_142| Int) (v_ArrVal_461 Int) (v_ArrVal_459 Int)) (or (= (let ((.cse49 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (store (store .cse8 |c_ULTIMATE.start_main_~b~0#1.offset| 1) (+ (* |v_ULTIMATE.start_main_~i~0#1_143| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_459) (+ (* |v_ULTIMATE.start_main_~i~0#1_142| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_461)))) (let ((.cse50 (select .cse49 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse45 (select .cse50 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse48 (select (select .cse49 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse46 (select (select (store .cse49 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse50 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse45 .cse48))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (let ((.cse47 (select (select (store .cse49 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse50 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse45 .cse46 .cse48))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (+ .cse45 .cse46 .cse47 .cse48 (select (select (store .cse49 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse50 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse45 .cse46 .cse47 .cse48))) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|))))))) .cse10) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_143| 1) |v_ULTIMATE.start_main_~i~0#1_142|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_143|)) (not (< |v_ULTIMATE.start_main_~i~0#1_142| c_~N~0)))) .cse12) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_143| Int) (|v_ULTIMATE.start_main_~i~0#1_142| Int) (v_ArrVal_461 Int) (v_ArrVal_459 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_143| 1) |v_ULTIMATE.start_main_~i~0#1_142|)) (= (let ((.cse54 (let ((.cse57 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse30))) (store .cse57 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (store (select .cse57 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) (+ (* |v_ULTIMATE.start_main_~i~0#1_143| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_459) (+ (* |v_ULTIMATE.start_main_~i~0#1_142| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_461))))) (let ((.cse55 (select .cse54 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse53 (select (select .cse54 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse56 (select .cse55 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse52 (select (select (store .cse54 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse55 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse53 .cse56))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (let ((.cse51 (select (select (store .cse54 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse55 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse52 .cse53 .cse56))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (+ .cse51 .cse52 .cse53 (select (select (store .cse54 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse55 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse51 .cse52 .cse53 .cse56))) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse56)))))) .cse10) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_143|)) (not (< |v_ULTIMATE.start_main_~i~0#1_142| c_~N~0)))) .cse12) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_142| Int) (v_ArrVal_461 Int) (v_ArrVal_459 Int)) (or (not (<= .cse11 |v_ULTIMATE.start_main_~i~0#1_142|)) (= (let ((.cse60 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (store .cse8 .cse9 v_ArrVal_459) (+ (* |v_ULTIMATE.start_main_~i~0#1_142| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_461)))) (let ((.cse61 (select .cse60 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse59 (select (select .cse60 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse63 (select .cse61 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse58 (select (select (store .cse60 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse61 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse59 .cse63))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (let ((.cse62 (select (select (store .cse60 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse61 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse58 .cse59 .cse63))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (+ .cse58 .cse59 (select (select (store .cse60 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse61 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse58 .cse59 .cse62 .cse63))) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse62 .cse63)))))) .cse10) (not (< |v_ULTIMATE.start_main_~i~0#1_142| c_~N~0)))) .cse12) (= (select .cse8 0) 1) (or (= .cse10 (let ((.cse65 (select (select .cse67 |c_ULTIMATE.start_main_~a~0#1.base|) .cse31))) (+ .cse14 .cse40 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse64 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse14 .cse40 .cse65 .cse66))) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse65 .cse66))) .cse12) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (or (= (let ((.cse68 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse64 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse14 .cse42))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (let ((.cse69 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse64 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse14 .cse68 .cse42))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (+ .cse14 .cse68 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse64 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse14 .cse68 .cse69 .cse42))) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse69 .cse42))) .cse10) .cse12) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_143| Int) (|v_ULTIMATE.start_main_~i~0#1_142| Int) (v_ArrVal_461 Int) (v_ArrVal_459 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_143| 1) |v_ULTIMATE.start_main_~i~0#1_142|)) (= (let ((.cse71 (let ((.cse76 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse22 .cse31 1)))) (store .cse76 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (store (select .cse76 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) (+ (* |v_ULTIMATE.start_main_~i~0#1_143| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_459) (+ (* |v_ULTIMATE.start_main_~i~0#1_142| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_461))))) (let ((.cse72 (select .cse71 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse70 (select .cse72 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse75 (select (select .cse71 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse74 (select (select (store .cse71 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse72 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse70 .cse75))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (let ((.cse73 (select (select (store .cse71 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse72 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse70 .cse74 .cse75))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (+ .cse70 (select (select (store .cse71 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse72 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse70 .cse73 .cse74 .cse75))) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse73 .cse74 .cse75)))))) .cse10) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_143|)) (not (< |v_ULTIMATE.start_main_~i~0#1_142| c_~N~0)))) .cse12) (or (= (+ .cse14 .cse40 (select (select .cse67 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse66) .cse10) .cse12) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_143| Int) (|v_ULTIMATE.start_main_~i~0#1_142| Int) (v_ArrVal_461 Int) (v_ArrVal_459 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_143| 1) |v_ULTIMATE.start_main_~i~0#1_142|)) (= (let ((.cse81 (let ((.cse83 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse84))) (store .cse83 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (store (select .cse83 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) (+ (* |v_ULTIMATE.start_main_~i~0#1_143| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_459) (+ (* |v_ULTIMATE.start_main_~i~0#1_142| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_461))))) (let ((.cse82 (select .cse81 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse77 (select (select .cse81 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse78 (select .cse82 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse79 (select (select (store .cse81 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse82 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse77 .cse78))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (let ((.cse80 (select (select (store .cse81 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse82 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse77 .cse78 .cse79))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (+ .cse77 .cse78 .cse79 .cse80 (select (select (store .cse81 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse82 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse77 .cse78 .cse79 .cse80))) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|))))))) .cse10) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_143|)) (not (< |v_ULTIMATE.start_main_~i~0#1_142| c_~N~0)))) .cse12) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_142| Int) (v_ArrVal_461 Int)) (or (= (let ((.cse89 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store .cse8 (+ (* |v_ULTIMATE.start_main_~i~0#1_142| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_461)))) (let ((.cse90 (select .cse89 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse87 (select (select .cse89 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse88 (select .cse90 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse85 (select (select (store .cse89 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse90 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse87 .cse88))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (let ((.cse86 (select (select (store .cse89 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse90 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse85 .cse87 .cse88))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (+ .cse85 .cse86 .cse87 .cse88 (select (select (store .cse89 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse90 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse85 .cse86 .cse87 .cse88))) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|))))))) .cse10) (not (<= .cse11 |v_ULTIMATE.start_main_~i~0#1_142|)) (not (< |v_ULTIMATE.start_main_~i~0#1_142| c_~N~0)))) .cse12) (or (= (let ((.cse91 (select (select .cse44 |c_ULTIMATE.start_main_~a~0#1.base|) .cse31))) (+ .cse91 .cse14 .cse43 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse64 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse91 .cse14 .cse43))) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|))) .cse10) .cse12)))))))) is different from true [2022-11-21 16:22:18,022 WARN L233 SmtUtils]: Spent 24.04s on a formula simplification. DAG size of input: 186 DAG size of output: 120 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 16:22:54,298 WARN L233 SmtUtils]: Spent 22.31s on a formula simplification. DAG size of input: 166 DAG size of output: 139 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 16:22:58,718 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 16:23:20,103 WARN L233 SmtUtils]: Spent 11.50s on a formula simplification. DAG size of input: 154 DAG size of output: 92 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 16:23:59,791 WARN L233 SmtUtils]: Spent 23.06s on a formula simplification. DAG size of input: 148 DAG size of output: 84 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 16:24:32,559 WARN L233 SmtUtils]: Spent 22.53s on a formula simplification. DAG size of input: 151 DAG size of output: 89 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 16:24:53,136 WARN L233 SmtUtils]: Spent 5.50s on a formula simplification. DAG size of input: 209 DAG size of output: 109 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 16:25:00,792 WARN L233 SmtUtils]: Spent 6.05s on a formula simplification. DAG size of input: 212 DAG size of output: 112 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 16:25:05,725 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse45 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse54 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse11 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse10 (store .cse54 (+ .cse11 8 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) (.cse21 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse0 (select .cse45 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse7 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse8 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse20 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse37 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse13 (< 3 c_~N~0)) (.cse47 (select .cse54 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse12 (+ c_~N~0 1)) (.cse22 (select .cse54 0))) (and (<= c_~N~0 .cse0) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_143| Int) (|v_ULTIMATE.start_main_~i~0#1_142| Int) (v_ArrVal_461 Int) (v_ArrVal_459 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_143| 1) |v_ULTIMATE.start_main_~i~0#1_142|)) (= (let ((.cse2 (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse10 (+ .cse11 16 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (store .cse9 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (store (select .cse9 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) (+ (* |v_ULTIMATE.start_main_~i~0#1_143| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_459) (+ (* |v_ULTIMATE.start_main_~i~0#1_142| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_461))))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse6 (select (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse1 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (let ((.cse5 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse4 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (+ .cse1 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse4 .cse5 .cse6))) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse4 .cse5 .cse6)))))) .cse12) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_143|)) (not (< |v_ULTIMATE.start_main_~i~0#1_142| c_~N~0)))) .cse13) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (or (forall ((v_ArrVal_461 Int)) (= (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store .cse20 .cse21 v_ArrVal_461)))) (let ((.cse18 (select .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse15 (select (select .cse17 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse19 (select .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse16 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse15 .cse19))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (let ((.cse14 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse15 .cse16 .cse19))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (+ .cse14 .cse15 .cse16 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse14 .cse15 .cse16 .cse19))) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse19)))))) .cse12)) (not (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0)) .cse13) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (<= .cse22 .cse12) (<= 3 c_~N~0) (let ((.cse23 (<= (mod c_~N~0 4294967296) 536870911))) (or (and (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse23) (and (not .cse23) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| 0)))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_143| Int) (|v_ULTIMATE.start_main_~i~0#1_142| Int) (v_ArrVal_461 Int) (v_ArrVal_459 Int)) (or (= (let ((.cse28 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (store (store .cse20 |c_ULTIMATE.start_main_~b~0#1.offset| 1) (+ (* |v_ULTIMATE.start_main_~i~0#1_143| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_459) (+ (* |v_ULTIMATE.start_main_~i~0#1_142| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_461)))) (let ((.cse29 (select .cse28 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse24 (select .cse29 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse27 (select (select .cse28 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse25 (select (select (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse24 .cse27))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (let ((.cse26 (select (select (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse24 .cse25 .cse27))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (+ .cse24 .cse25 .cse26 .cse27 (select (select (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse24 .cse25 .cse26 .cse27))) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|))))))) .cse12) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_143| 1) |v_ULTIMATE.start_main_~i~0#1_142|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_143|)) (not (< |v_ULTIMATE.start_main_~i~0#1_142| c_~N~0)))) .cse13) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_143| Int) (|v_ULTIMATE.start_main_~i~0#1_142| Int) (v_ArrVal_461 Int) (v_ArrVal_459 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_143| 1) |v_ULTIMATE.start_main_~i~0#1_142|)) (= (let ((.cse33 (let ((.cse36 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse10))) (store .cse36 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (store (select .cse36 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) (+ (* |v_ULTIMATE.start_main_~i~0#1_143| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_459) (+ (* |v_ULTIMATE.start_main_~i~0#1_142| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_461))))) (let ((.cse34 (select .cse33 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse32 (select (select .cse33 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse35 (select .cse34 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse31 (select (select (store .cse33 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse34 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse32 .cse35))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (let ((.cse30 (select (select (store .cse33 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse34 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse31 .cse32 .cse35))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (+ .cse30 .cse31 .cse32 (select (select (store .cse33 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse34 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse30 .cse31 .cse32 .cse35))) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse35)))))) .cse12) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_143|)) (not (< |v_ULTIMATE.start_main_~i~0#1_142| c_~N~0)))) .cse13) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (<= .cse0 c_~N~0) (not (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| 0)) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (and (= (select (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0) 1) (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 3) (<= (+ 2 |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.base|) (not (= |ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_142| Int) (v_ArrVal_461 Int) (v_ArrVal_459 Int)) (or (not (<= .cse37 |v_ULTIMATE.start_main_~i~0#1_142|)) (= (let ((.cse40 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (store .cse20 .cse21 v_ArrVal_459) (+ (* |v_ULTIMATE.start_main_~i~0#1_142| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_461)))) (let ((.cse41 (select .cse40 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse39 (select (select .cse40 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse43 (select .cse41 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse38 (select (select (store .cse40 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse39 .cse43))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (let ((.cse42 (select (select (store .cse40 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse38 .cse39 .cse43))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (+ .cse38 .cse39 (select (select (store .cse40 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse38 .cse39 .cse42 .cse43))) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse42 .cse43)))))) .cse12) (not (< |v_ULTIMATE.start_main_~i~0#1_142| c_~N~0)))) .cse13) (= (select .cse20 0) 1) (<= c_~N~0 3) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (or (= (let ((.cse44 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse45 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse47))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (let ((.cse46 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse45 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse44 .cse47))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (+ .cse0 .cse44 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse45 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse44 .cse46 .cse47))) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse46 .cse47))) .cse12) .cse13) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_142| Int) (v_ArrVal_461 Int)) (or (= (let ((.cse52 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store .cse20 (+ (* |v_ULTIMATE.start_main_~i~0#1_142| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_461)))) (let ((.cse53 (select .cse52 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse50 (select (select .cse52 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse51 (select .cse53 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse48 (select (select (store .cse52 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse53 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse50 .cse51))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (let ((.cse49 (select (select (store .cse52 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse53 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse48 .cse50 .cse51))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (+ .cse48 .cse49 .cse50 .cse51 (select (select (store .cse52 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse53 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse48 .cse49 .cse50 .cse51))) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|))))))) .cse12) (not (<= .cse37 |v_ULTIMATE.start_main_~i~0#1_142|)) (not (< |v_ULTIMATE.start_main_~i~0#1_142| c_~N~0)))) .cse13) (= 4 .cse47) (<= .cse12 .cse22) (<= (+ (div (- |c_ULTIMATE.start_main_~a~0#1.offset|) 8) 1) |c_ULTIMATE.start_main_~i~0#1|)))) is different from true [2022-11-21 16:25:05,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:25:05,731 INFO L93 Difference]: Finished difference Result 141 states and 156 transitions. [2022-11-21 16:25:05,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2022-11-21 16:25:05,731 INFO L78 Accepts]: Start accepts. Automaton has has 87 states, 87 states have (on average 1.2758620689655173) internal successors, (111), 87 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2022-11-21 16:25:05,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:25:05,732 INFO L225 Difference]: With dead ends: 141 [2022-11-21 16:25:05,732 INFO L226 Difference]: Without dead ends: 139 [2022-11-21 16:25:05,735 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 8450 ImplicationChecksByTransitivity, 305.5s TimeCoverageRelationStatistics Valid=2357, Invalid=24044, Unknown=17, NotChecked=972, Total=27390 [2022-11-21 16:25:05,735 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 461 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 1915 mSolverCounterSat, 448 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 34.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 461 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 2377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 448 IncrementalHoareTripleChecker+Valid, 1915 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 12 IncrementalHoareTripleChecker+Unchecked, 35.4s IncrementalHoareTripleChecker+Time [2022-11-21 16:25:05,736 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [461 Valid, 531 Invalid, 2377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [448 Valid, 1915 Invalid, 2 Unknown, 12 Unchecked, 35.4s Time] [2022-11-21 16:25:05,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-11-21 16:25:05,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 70. [2022-11-21 16:25:05,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 1.1594202898550725) internal successors, (80), 69 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:25:05,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 80 transitions. [2022-11-21 16:25:05,772 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 80 transitions. Word has length 40 [2022-11-21 16:25:05,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:25:05,772 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 80 transitions. [2022-11-21 16:25:05,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 87 states, 87 states have (on average 1.2758620689655173) internal successors, (111), 87 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:25:05,773 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 80 transitions. [2022-11-21 16:25:05,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-21 16:25:05,774 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:25:05,774 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:25:05,781 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5674d58d-3223-4330-9a61-ffc8164dda5f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-11-21 16:25:05,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5674d58d-3223-4330-9a61-ffc8164dda5f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:25:05,981 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:25:05,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:25:05,981 INFO L85 PathProgramCache]: Analyzing trace with hash 2112995272, now seen corresponding path program 3 times [2022-11-21 16:25:05,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:25:05,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558571021] [2022-11-21 16:25:05,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:25:05,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:25:06,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:25:21,663 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:25:21,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:25:21,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558571021] [2022-11-21 16:25:21,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558571021] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:25:21,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2078476332] [2022-11-21 16:25:21,664 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-21 16:25:21,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:25:21,664 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5674d58d-3223-4330-9a61-ffc8164dda5f/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:25:21,665 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5674d58d-3223-4330-9a61-ffc8164dda5f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:25:21,667 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5674d58d-3223-4330-9a61-ffc8164dda5f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-21 16:25:21,791 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-21 16:25:21,791 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 16:25:21,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 74 conjunts are in the unsatisfiable core [2022-11-21 16:25:21,801 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:25:22,513 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-21 16:25:22,514 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2022-11-21 16:25:23,839 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-21 16:25:24,755 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-11-21 16:25:25,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:25:25,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:25:25,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:25:25,717 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-11-21 16:25:26,599 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-11-21 16:25:26,817 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-11-21 16:25:27,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:25:27,152 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-21 16:25:28,039 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:25:28,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:25:28,045 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 47 [2022-11-21 16:25:29,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:25:29,280 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 51 [2022-11-21 16:25:29,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:25:30,121 INFO L321 Elim1Store]: treesize reduction 30, result has 49.2 percent of original size [2022-11-21 16:25:30,122 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 75 [2022-11-21 16:25:35,896 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-21 16:25:35,896 INFO L328 TraceCheckSpWp]: Computing backward predicates...