./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/array-fpi/sina2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/array-fpi/sina2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --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 1ea1eb4a8af9eb0da04a9f2b25d1b98ecd98ff3b6d87ba0d8e53000f12b8adcc --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 00:43:54,177 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 00:43:54,237 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 00:43:54,241 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 00:43:54,242 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 00:43:54,266 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 00:43:54,266 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 00:43:54,267 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 00:43:54,267 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 00:43:54,268 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 00:43:54,268 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 00:43:54,269 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 00:43:54,270 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 00:43:54,270 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 00:43:54,271 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 00:43:54,271 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 00:43:54,272 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 00:43:54,273 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 00:43:54,273 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 00:43:54,274 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 00:43:54,274 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 00:43:54,275 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 00:43:54,275 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 00:43:54,276 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 00:43:54,276 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 00:43:54,277 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 00:43:54,277 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 00:43:54,277 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 00:43:54,278 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 00:43:54,278 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 00:43:54,279 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 00:43:54,279 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:43:54,279 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 00:43:54,280 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 00:43:54,280 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 00:43:54,280 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 00:43:54,280 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 00:43:54,280 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 00:43:54,280 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 00:43:54,281 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 00:43:54,281 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 00:43:54,281 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 00:43:54,281 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/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_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 1ea1eb4a8af9eb0da04a9f2b25d1b98ecd98ff3b6d87ba0d8e53000f12b8adcc [2023-11-29 00:43:54,480 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 00:43:54,500 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 00:43:54,502 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 00:43:54,503 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 00:43:54,504 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 00:43:54,505 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/array-fpi/sina2.c [2023-11-29 00:43:57,315 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 00:43:57,472 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 00:43:57,473 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/sv-benchmarks/c/array-fpi/sina2.c [2023-11-29 00:43:57,479 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/data/d8893c3fa/25073cb61ce44137b54171ebbe6a918e/FLAG07f8ec680 [2023-11-29 00:43:57,494 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/data/d8893c3fa/25073cb61ce44137b54171ebbe6a918e [2023-11-29 00:43:57,496 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 00:43:57,498 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 00:43:57,500 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 00:43:57,500 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 00:43:57,505 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 00:43:57,506 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:43:57" (1/1) ... [2023-11-29 00:43:57,507 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62453b60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:43:57, skipping insertion in model container [2023-11-29 00:43:57,507 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:43:57" (1/1) ... [2023-11-29 00:43:57,527 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 00:43:57,661 WARN L240 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_16138067-b194-4902-9c67-ea14b1029cf2/sv-benchmarks/c/array-fpi/sina2.c[588,601] [2023-11-29 00:43:57,682 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:43:57,691 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 00:43:57,703 WARN L240 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_16138067-b194-4902-9c67-ea14b1029cf2/sv-benchmarks/c/array-fpi/sina2.c[588,601] [2023-11-29 00:43:57,713 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:43:57,726 INFO L206 MainTranslator]: Completed translation [2023-11-29 00:43:57,727 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:43:57 WrapperNode [2023-11-29 00:43:57,727 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 00:43:57,728 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 00:43:57,728 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 00:43:57,728 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 00:43:57,734 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:43:57" (1/1) ... [2023-11-29 00:43:57,741 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:43:57" (1/1) ... [2023-11-29 00:43:57,765 INFO L138 Inliner]: procedures = 17, calls = 30, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 92 [2023-11-29 00:43:57,765 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 00:43:57,766 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 00:43:57,766 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 00:43:57,766 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 00:43:57,776 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:43:57" (1/1) ... [2023-11-29 00:43:57,776 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:43:57" (1/1) ... [2023-11-29 00:43:57,779 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:43:57" (1/1) ... [2023-11-29 00:43:57,794 INFO L175 MemorySlicer]: Split 19 memory accesses to 4 slices as follows [2, 8, 4, 5]. 42 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8, 0, 0]. The 4 writes are split as follows [0, 0, 2, 2]. [2023-11-29 00:43:57,794 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:43:57" (1/1) ... [2023-11-29 00:43:57,794 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:43:57" (1/1) ... [2023-11-29 00:43:57,801 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:43:57" (1/1) ... [2023-11-29 00:43:57,806 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:43:57" (1/1) ... [2023-11-29 00:43:57,807 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:43:57" (1/1) ... [2023-11-29 00:43:57,809 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:43:57" (1/1) ... [2023-11-29 00:43:57,812 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 00:43:57,813 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 00:43:57,813 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 00:43:57,813 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 00:43:57,814 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:43:57" (1/1) ... [2023-11-29 00:43:57,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:43:57,829 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:43:57,840 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 00:43:57,845 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 00:43:57,874 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 00:43:57,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 00:43:57,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 00:43:57,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 00:43:57,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-29 00:43:57,875 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 00:43:57,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 00:43:57,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 00:43:57,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 00:43:57,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-29 00:43:57,876 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 00:43:57,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 00:43:57,877 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 00:43:57,877 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 00:43:57,877 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-29 00:43:57,878 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-29 00:43:57,878 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-29 00:43:57,878 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 00:43:57,960 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 00:43:57,962 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 00:43:58,119 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 00:43:58,151 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 00:43:58,152 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-29 00:43:58,152 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:43:58 BoogieIcfgContainer [2023-11-29 00:43:58,152 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 00:43:58,156 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 00:43:58,156 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 00:43:58,160 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 00:43:58,160 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 12:43:57" (1/3) ... [2023-11-29 00:43:58,161 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a1f0b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:43:58, skipping insertion in model container [2023-11-29 00:43:58,161 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:43:57" (2/3) ... [2023-11-29 00:43:58,162 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a1f0b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:43:58, skipping insertion in model container [2023-11-29 00:43:58,162 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:43:58" (3/3) ... [2023-11-29 00:43:58,164 INFO L112 eAbstractionObserver]: Analyzing ICFG sina2.c [2023-11-29 00:43:58,180 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 00:43:58,180 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 00:43:58,224 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 00:43:58,231 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=LoopHeads, 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;@3f362624, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 00:43:58,231 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 00:43:58,235 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 16 states have (on average 1.75) internal successors, (28), 17 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:43:58,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-29 00:43:58,240 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:43:58,241 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:43:58,241 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:43:58,246 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:43:58,246 INFO L85 PathProgramCache]: Analyzing trace with hash -895324270, now seen corresponding path program 1 times [2023-11-29 00:43:58,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:43:58,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736693048] [2023-11-29 00:43:58,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:43:58,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:43:58,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:58,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:43:58,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:43:58,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736693048] [2023-11-29 00:43:58,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736693048] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:43:58,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:43:58,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:43:58,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984280513] [2023-11-29 00:43:58,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:43:58,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 00:43:58,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:43:58,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 00:43:58,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 00:43:58,435 INFO L87 Difference]: Start difference. First operand has 18 states, 16 states have (on average 1.75) internal successors, (28), 17 states have internal predecessors, (28), 0 states have call successors, (0), 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 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:43:58,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:43:58,465 INFO L93 Difference]: Finished difference Result 33 states and 51 transitions. [2023-11-29 00:43:58,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 00:43:58,467 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2023-11-29 00:43:58,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:43:58,473 INFO L225 Difference]: With dead ends: 33 [2023-11-29 00:43:58,473 INFO L226 Difference]: Without dead ends: 15 [2023-11-29 00:43:58,476 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 [2023-11-29 00:43:58,479 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:43:58,481 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 16 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:43:58,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2023-11-29 00:43:58,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2023-11-29 00:43:58,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:43:58,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2023-11-29 00:43:58,508 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 18 transitions. Word has length 13 [2023-11-29 00:43:58,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:43:58,508 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 18 transitions. [2023-11-29 00:43:58,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:43:58,509 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 18 transitions. [2023-11-29 00:43:58,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-29 00:43:58,509 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:43:58,510 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:43:58,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 00:43:58,510 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:43:58,511 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:43:58,511 INFO L85 PathProgramCache]: Analyzing trace with hash -194259692, now seen corresponding path program 1 times [2023-11-29 00:43:58,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:43:58,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810727064] [2023-11-29 00:43:58,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:43:58,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:43:58,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:58,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:43:58,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:43:58,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810727064] [2023-11-29 00:43:58,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810727064] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:43:58,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:43:58,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:43:58,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549946857] [2023-11-29 00:43:58,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:43:58,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:43:58,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:43:58,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:43:58,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:43:58,702 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:43:58,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:43:58,760 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2023-11-29 00:43:58,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:43:58,760 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2023-11-29 00:43:58,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:43:58,761 INFO L225 Difference]: With dead ends: 33 [2023-11-29 00:43:58,761 INFO L226 Difference]: Without dead ends: 23 [2023-11-29 00:43:58,762 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 [2023-11-29 00:43:58,764 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 26 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:43:58,764 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 12 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:43:58,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-11-29 00:43:58,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 18. [2023-11-29 00:43:58,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:43:58,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2023-11-29 00:43:58,771 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 13 [2023-11-29 00:43:58,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:43:58,772 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2023-11-29 00:43:58,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:43:58,772 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2023-11-29 00:43:58,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-29 00:43:58,773 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:43:58,773 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:43:58,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 00:43:58,774 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:43:58,774 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:43:58,775 INFO L85 PathProgramCache]: Analyzing trace with hash -925805478, now seen corresponding path program 1 times [2023-11-29 00:43:58,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:43:58,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525173519] [2023-11-29 00:43:58,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:43:58,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:43:58,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:59,702 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:43:59,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:43:59,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525173519] [2023-11-29 00:43:59,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525173519] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:43:59,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [123660716] [2023-11-29 00:43:59,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:43:59,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:43:59,704 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:43:59,708 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:43:59,714 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 00:43:59,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:59,792 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 35 conjunts are in the unsatisfiable core [2023-11-29 00:43:59,799 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:43:59,860 INFO L378 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 [2023-11-29 00:43:59,897 INFO L378 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 [2023-11-29 00:43:59,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 00:44:00,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 00:44:00,118 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:44:00,118 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:44:00,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2023-11-29 00:44:00,331 INFO L378 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 34 treesize of output 32 [2023-11-29 00:44:00,381 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:44:00,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [123660716] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:44:00,382 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:44:00,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2023-11-29 00:44:00,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764599425] [2023-11-29 00:44:00,382 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:44:00,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-29 00:44:00,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:44:00,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-29 00:44:00,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2023-11-29 00:44:00,386 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 23 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:44:00,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:44:00,901 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2023-11-29 00:44:00,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-29 00:44:00,901 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 0 states have call successors, (0), 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 [2023-11-29 00:44:00,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:44:00,902 INFO L225 Difference]: With dead ends: 43 [2023-11-29 00:44:00,902 INFO L226 Difference]: Without dead ends: 41 [2023-11-29 00:44:00,903 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=177, Invalid=815, Unknown=0, NotChecked=0, Total=992 [2023-11-29 00:44:00,904 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 64 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 00:44:00,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 92 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 00:44:00,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-11-29 00:44:00,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 29. [2023-11-29 00:44:00,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:44:00,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2023-11-29 00:44:00,914 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 16 [2023-11-29 00:44:00,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:44:00,915 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2023-11-29 00:44:00,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:44:00,915 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2023-11-29 00:44:00,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-29 00:44:00,916 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:44:00,916 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:44:00,925 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 00:44:01,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:44:01,121 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:44:01,121 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:44:01,122 INFO L85 PathProgramCache]: Analyzing trace with hash -2031512559, now seen corresponding path program 2 times [2023-11-29 00:44:01,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:44:01,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947456033] [2023-11-29 00:44:01,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:44:01,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:44:01,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:44:01,203 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 00:44:01,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:44:01,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947456033] [2023-11-29 00:44:01,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947456033] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:44:01,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1580515432] [2023-11-29 00:44:01,204 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 00:44:01,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:44:01,204 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:44:01,205 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:44:01,208 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 00:44:01,281 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 00:44:01,281 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:44:01,282 INFO L262 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 00:44:01,284 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:44:01,326 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 00:44:01,326 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:44:01,366 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 00:44:01,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1580515432] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:44:01,366 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:44:01,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2023-11-29 00:44:01,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817383894] [2023-11-29 00:44:01,367 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:44:01,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 00:44:01,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:44:01,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 00:44:01,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-11-29 00:44:01,369 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:44:01,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:44:01,480 INFO L93 Difference]: Finished difference Result 65 states and 77 transitions. [2023-11-29 00:44:01,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 00:44:01,481 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-11-29 00:44:01,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:44:01,482 INFO L225 Difference]: With dead ends: 65 [2023-11-29 00:44:01,482 INFO L226 Difference]: Without dead ends: 40 [2023-11-29 00:44:01,482 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2023-11-29 00:44:01,484 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 25 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:44:01,484 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 41 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 00:44:01,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2023-11-29 00:44:01,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 27. [2023-11-29 00:44:01,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:44:01,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2023-11-29 00:44:01,493 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 17 [2023-11-29 00:44:01,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:44:01,493 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2023-11-29 00:44:01,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:44:01,494 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2023-11-29 00:44:01,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-29 00:44:01,494 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:44:01,494 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:44:01,499 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 00:44:01,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:44:01,695 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:44:01,696 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:44:01,696 INFO L85 PathProgramCache]: Analyzing trace with hash -2030966525, now seen corresponding path program 3 times [2023-11-29 00:44:01,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:44:01,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905972610] [2023-11-29 00:44:01,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:44:01,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:44:01,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:44:01,771 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 00:44:01,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:44:01,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905972610] [2023-11-29 00:44:01,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905972610] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:44:01,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [308291615] [2023-11-29 00:44:01,772 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 00:44:01,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:44:01,772 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:44:01,773 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:44:01,775 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 00:44:01,841 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-29 00:44:01,841 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:44:01,842 INFO L262 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 00:44:01,843 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:44:01,883 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 00:44:01,883 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:44:01,925 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 00:44:01,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [308291615] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:44:01,926 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:44:01,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2023-11-29 00:44:01,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525857128] [2023-11-29 00:44:01,926 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:44:01,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 00:44:01,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:44:01,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 00:44:01,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-11-29 00:44:01,928 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:44:02,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:44:02,028 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2023-11-29 00:44:02,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 00:44:02,029 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-11-29 00:44:02,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:44:02,030 INFO L225 Difference]: With dead ends: 39 [2023-11-29 00:44:02,030 INFO L226 Difference]: Without dead ends: 31 [2023-11-29 00:44:02,030 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 26 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2023-11-29 00:44:02,031 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 55 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:44:02,031 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 32 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 00:44:02,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-11-29 00:44:02,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 21. [2023-11-29 00:44:02,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:44:02,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2023-11-29 00:44:02,038 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 17 [2023-11-29 00:44:02,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:44:02,038 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2023-11-29 00:44:02,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:44:02,038 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2023-11-29 00:44:02,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-29 00:44:02,039 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:44:02,039 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:44:02,044 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-29 00:44:02,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:44:02,240 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:44:02,240 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:44:02,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1382312724, now seen corresponding path program 4 times [2023-11-29 00:44:02,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:44:02,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710379484] [2023-11-29 00:44:02,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:44:02,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:44:02,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:44:03,245 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:44:03,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:44:03,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710379484] [2023-11-29 00:44:03,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710379484] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:44:03,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [73076231] [2023-11-29 00:44:03,245 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 00:44:03,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:44:03,246 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:44:03,247 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:44:03,249 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 00:44:03,344 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 00:44:03,344 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:44:03,346 INFO L262 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 47 conjunts are in the unsatisfiable core [2023-11-29 00:44:03,352 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:44:03,360 INFO L378 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 [2023-11-29 00:44:03,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-29 00:44:03,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:44:03,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-11-29 00:44:03,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2023-11-29 00:44:03,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2023-11-29 00:44:04,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:44:04,097 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 00:44:04,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:44:04,099 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 00:44:04,112 INFO L349 Elim1Store]: treesize reduction 4, result has 42.9 percent of original size [2023-11-29 00:44:04,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 59 treesize of output 65 [2023-11-29 00:44:04,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:44:04,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:44:04,245 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 00:44:04,282 INFO L349 Elim1Store]: treesize reduction 61, result has 29.1 percent of original size [2023-11-29 00:44:04,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 63 treesize of output 68 [2023-11-29 00:44:04,626 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:44:04,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 59 [2023-11-29 00:44:04,707 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:44:04,707 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:44:05,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 429 treesize of output 397 [2023-11-29 00:44:05,880 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:44:05,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 11033 treesize of output 10010 [2023-11-29 00:44:07,838 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:44:07,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [73076231] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:44:07,838 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:44:07,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 38 [2023-11-29 00:44:07,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304527913] [2023-11-29 00:44:07,838 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:44:07,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-11-29 00:44:07,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:44:07,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-11-29 00:44:07,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1226, Unknown=0, NotChecked=0, Total=1406 [2023-11-29 00:44:07,841 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 38 states, 38 states have (on average 1.263157894736842) internal successors, (48), 38 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) [2023-11-29 00:44:10,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:44:10,083 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2023-11-29 00:44:10,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-11-29 00:44:10,084 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.263157894736842) internal successors, (48), 38 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 19 [2023-11-29 00:44:10,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:44:10,084 INFO L225 Difference]: With dead ends: 53 [2023-11-29 00:44:10,084 INFO L226 Difference]: Without dead ends: 51 [2023-11-29 00:44:10,086 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 923 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=392, Invalid=2800, Unknown=0, NotChecked=0, Total=3192 [2023-11-29 00:44:10,087 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 105 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 00:44:10,087 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 117 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 00:44:10,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-11-29 00:44:10,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 29. [2023-11-29 00:44:10,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:44:10,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2023-11-29 00:44:10,095 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 19 [2023-11-29 00:44:10,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:44:10,096 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2023-11-29 00:44:10,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.263157894736842) internal successors, (48), 38 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) [2023-11-29 00:44:10,096 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2023-11-29 00:44:10,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-29 00:44:10,096 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:44:10,097 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:44:10,101 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-29 00:44:10,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-29 00:44:10,297 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:44:10,297 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:44:10,298 INFO L85 PathProgramCache]: Analyzing trace with hash -2070853287, now seen corresponding path program 5 times [2023-11-29 00:44:10,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:44:10,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569904387] [2023-11-29 00:44:10,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:44:10,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:44:10,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:44:10,402 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 00:44:10,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:44:10,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569904387] [2023-11-29 00:44:10,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569904387] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:44:10,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [83269959] [2023-11-29 00:44:10,403 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 00:44:10,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:44:10,404 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:44:10,405 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:44:10,408 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-29 00:44:10,484 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-11-29 00:44:10,484 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:44:10,486 INFO L262 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 00:44:10,487 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:44:10,540 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 00:44:10,540 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:44:10,581 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 00:44:10,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [83269959] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:44:10,582 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:44:10,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2023-11-29 00:44:10,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495358934] [2023-11-29 00:44:10,582 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:44:10,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-29 00:44:10,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:44:10,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 00:44:10,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2023-11-29 00:44:10,584 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 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) [2023-11-29 00:44:10,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:44:10,737 INFO L93 Difference]: Finished difference Result 78 states and 89 transitions. [2023-11-29 00:44:10,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 00:44:10,737 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-11-29 00:44:10,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:44:10,738 INFO L225 Difference]: With dead ends: 78 [2023-11-29 00:44:10,738 INFO L226 Difference]: Without dead ends: 61 [2023-11-29 00:44:10,739 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2023-11-29 00:44:10,739 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 39 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:44:10,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 60 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 00:44:10,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-11-29 00:44:10,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 41. [2023-11-29 00:44:10,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.2) internal successors, (48), 40 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) [2023-11-29 00:44:10,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2023-11-29 00:44:10,755 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 20 [2023-11-29 00:44:10,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:44:10,755 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2023-11-29 00:44:10,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 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) [2023-11-29 00:44:10,756 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2023-11-29 00:44:10,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-29 00:44:10,756 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:44:10,756 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:44:10,762 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-29 00:44:10,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-11-29 00:44:10,961 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:44:10,961 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:44:10,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1637179778, now seen corresponding path program 6 times [2023-11-29 00:44:10,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:44:10,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890702024] [2023-11-29 00:44:10,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:44:10,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:44:10,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:44:11,074 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-29 00:44:11,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:44:11,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890702024] [2023-11-29 00:44:11,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890702024] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:44:11,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [525311983] [2023-11-29 00:44:11,075 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-29 00:44:11,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:44:11,075 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:44:11,076 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:44:11,079 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-29 00:44:11,165 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-11-29 00:44:11,165 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:44:11,166 INFO L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 00:44:11,168 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:44:11,226 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-29 00:44:11,227 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:44:11,275 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-29 00:44:11,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [525311983] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:44:11,275 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:44:11,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2023-11-29 00:44:11,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719264304] [2023-11-29 00:44:11,276 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:44:11,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-29 00:44:11,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:44:11,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 00:44:11,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2023-11-29 00:44:11,277 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. Second operand has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 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) [2023-11-29 00:44:11,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:44:11,426 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2023-11-29 00:44:11,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 00:44:11,426 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-11-29 00:44:11,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:44:11,427 INFO L225 Difference]: With dead ends: 70 [2023-11-29 00:44:11,427 INFO L226 Difference]: Without dead ends: 55 [2023-11-29 00:44:11,428 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 31 SyntacticMatches, 6 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2023-11-29 00:44:11,428 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 81 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:44:11,429 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 70 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 00:44:11,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-11-29 00:44:11,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 38. [2023-11-29 00:44:11,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 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) [2023-11-29 00:44:11,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2023-11-29 00:44:11,441 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 21 [2023-11-29 00:44:11,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:44:11,442 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2023-11-29 00:44:11,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 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) [2023-11-29 00:44:11,442 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2023-11-29 00:44:11,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-29 00:44:11,443 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:44:11,443 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:44:11,449 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-29 00:44:11,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-11-29 00:44:11,644 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:44:11,644 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:44:11,644 INFO L85 PathProgramCache]: Analyzing trace with hash 337203711, now seen corresponding path program 1 times [2023-11-29 00:44:11,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:44:11,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176255453] [2023-11-29 00:44:11,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:44:11,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:44:11,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:44:12,843 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:44:12,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:44:12,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176255453] [2023-11-29 00:44:12,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176255453] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:44:12,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1417139320] [2023-11-29 00:44:12,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:44:12,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:44:12,844 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:44:12,845 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:44:12,848 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-29 00:44:12,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:44:12,922 INFO L262 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 55 conjunts are in the unsatisfiable core [2023-11-29 00:44:12,925 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:44:12,933 INFO L378 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 [2023-11-29 00:44:12,942 INFO L378 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 [2023-11-29 00:44:12,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-29 00:44:13,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 00:44:13,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 00:44:13,260 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:44:13,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 21 [2023-11-29 00:44:13,310 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:44:13,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 21 [2023-11-29 00:44:13,450 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:44:13,450 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:44:13,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50 [2023-11-29 00:44:13,900 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:44:13,900 INFO L378 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 327 treesize of output 303 [2023-11-29 00:44:13,948 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:44:13,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1417139320] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:44:13,948 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:44:13,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15, 15] total 42 [2023-11-29 00:44:13,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659050179] [2023-11-29 00:44:13,949 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:44:13,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-11-29 00:44:13,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:44:13,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-11-29 00:44:13,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1543, Unknown=0, NotChecked=0, Total=1722 [2023-11-29 00:44:13,951 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 42 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 42 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:44:14,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:44:14,518 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2023-11-29 00:44:14,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-29 00:44:14,519 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 42 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-11-29 00:44:14,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:44:14,519 INFO L225 Difference]: With dead ends: 48 [2023-11-29 00:44:14,519 INFO L226 Difference]: Without dead ends: 32 [2023-11-29 00:44:14,521 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 557 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=258, Invalid=2192, Unknown=0, NotChecked=0, Total=2450 [2023-11-29 00:44:14,521 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 20 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 00:44:14,521 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 106 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 00:44:14,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-11-29 00:44:14,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 24. [2023-11-29 00:44:14,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 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) [2023-11-29 00:44:14,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2023-11-29 00:44:14,528 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 22 [2023-11-29 00:44:14,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:44:14,528 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2023-11-29 00:44:14,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 42 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:44:14,528 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2023-11-29 00:44:14,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-29 00:44:14,529 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:44:14,529 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:44:14,534 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-11-29 00:44:14,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:44:14,730 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:44:14,730 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:44:14,730 INFO L85 PathProgramCache]: Analyzing trace with hash 350502234, now seen corresponding path program 7 times [2023-11-29 00:44:14,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:44:14,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37476034] [2023-11-29 00:44:14,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:44:14,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:44:14,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:44:15,783 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:44:15,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:44:15,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37476034] [2023-11-29 00:44:15,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37476034] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:44:15,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [311595128] [2023-11-29 00:44:15,784 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-29 00:44:15,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:44:15,784 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:44:15,785 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:44:15,787 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-29 00:44:15,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:44:15,876 INFO L262 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 66 conjunts are in the unsatisfiable core [2023-11-29 00:44:15,880 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:44:15,887 INFO L378 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 [2023-11-29 00:44:15,897 INFO L378 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 [2023-11-29 00:44:15,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-29 00:44:15,932 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:44:15,932 INFO L378 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 1 case distinctions, treesize of input 26 treesize of output 28 [2023-11-29 00:44:16,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 00:44:16,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 00:44:16,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 00:44:16,288 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:44:16,289 INFO L378 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 3 case distinctions, treesize of input 33 treesize of output 31 [2023-11-29 00:44:16,345 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:44:16,345 INFO L378 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 3 case distinctions, treesize of input 33 treesize of output 31 [2023-11-29 00:44:16,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:44:16,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:44:16,422 INFO L349 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2023-11-29 00:44:16,423 INFO L378 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 7 case distinctions, treesize of input 43 treesize of output 54 [2023-11-29 00:44:16,555 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:44:16,555 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:44:17,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 560 treesize of output 526 [2023-11-29 00:44:17,793 INFO L349 Elim1Store]: treesize reduction 17, result has 32.0 percent of original size [2023-11-29 00:44:17,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1846971 treesize of output 1630651 [2023-11-29 00:44:18,044 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:44:18,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [311595128] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:44:18,045 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:44:18,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 41 [2023-11-29 00:44:18,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005582987] [2023-11-29 00:44:18,045 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:44:18,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-11-29 00:44:18,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:44:18,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-11-29 00:44:18,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1477, Unknown=0, NotChecked=0, Total=1640 [2023-11-29 00:44:18,047 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 41 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 41 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:44:19,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:44:19,223 INFO L93 Difference]: Finished difference Result 60 states and 69 transitions. [2023-11-29 00:44:19,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-11-29 00:44:19,223 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 41 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-11-29 00:44:19,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:44:19,224 INFO L225 Difference]: With dead ends: 60 [2023-11-29 00:44:19,224 INFO L226 Difference]: Without dead ends: 58 [2023-11-29 00:44:19,225 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 681 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=314, Invalid=2442, Unknown=0, NotChecked=0, Total=2756 [2023-11-29 00:44:19,226 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 75 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 00:44:19,226 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 164 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 00:44:19,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2023-11-29 00:44:19,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 43. [2023-11-29 00:44:19,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 42 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:44:19,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2023-11-29 00:44:19,244 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 22 [2023-11-29 00:44:19,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:44:19,244 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 50 transitions. [2023-11-29 00:44:19,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 41 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:44:19,244 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2023-11-29 00:44:19,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-29 00:44:19,245 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:44:19,245 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:44:19,250 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-11-29 00:44:19,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-29 00:44:19,446 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:44:19,446 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:44:19,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1479697233, now seen corresponding path program 8 times [2023-11-29 00:44:19,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:44:19,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665585188] [2023-11-29 00:44:19,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:44:19,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:44:19,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:44:19,582 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-29 00:44:19,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:44:19,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665585188] [2023-11-29 00:44:19,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665585188] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:44:19,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1723674974] [2023-11-29 00:44:19,583 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 00:44:19,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:44:19,583 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:44:19,587 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:44:19,587 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-29 00:44:19,682 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 00:44:19,682 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:44:19,683 INFO L262 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-29 00:44:19,685 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:44:19,757 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-29 00:44:19,757 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:44:19,821 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-29 00:44:19,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1723674974] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:44:19,822 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:44:19,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2023-11-29 00:44:19,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466016347] [2023-11-29 00:44:19,822 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:44:19,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-29 00:44:19,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:44:19,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-29 00:44:19,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2023-11-29 00:44:19,824 INFO L87 Difference]: Start difference. First operand 43 states and 50 transitions. Second operand has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:44:20,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:44:20,022 INFO L93 Difference]: Finished difference Result 102 states and 114 transitions. [2023-11-29 00:44:20,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 00:44:20,023 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-11-29 00:44:20,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:44:20,024 INFO L225 Difference]: With dead ends: 102 [2023-11-29 00:44:20,024 INFO L226 Difference]: Without dead ends: 84 [2023-11-29 00:44:20,024 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 33 SyntacticMatches, 7 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2023-11-29 00:44:20,025 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 59 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:44:20,025 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 75 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 00:44:20,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-11-29 00:44:20,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 57. [2023-11-29 00:44:20,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.1607142857142858) internal successors, (65), 56 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:44:20,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 65 transitions. [2023-11-29 00:44:20,050 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 65 transitions. Word has length 23 [2023-11-29 00:44:20,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:44:20,050 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 65 transitions. [2023-11-29 00:44:20,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:44:20,051 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 65 transitions. [2023-11-29 00:44:20,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-29 00:44:20,052 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:44:20,052 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:44:20,058 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-11-29 00:44:20,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:44:20,254 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:44:20,254 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:44:20,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1052577981, now seen corresponding path program 9 times [2023-11-29 00:44:20,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:44:20,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039451472] [2023-11-29 00:44:20,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:44:20,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:44:20,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:44:20,399 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-29 00:44:20,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:44:20,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039451472] [2023-11-29 00:44:20,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039451472] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:44:20,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [423415337] [2023-11-29 00:44:20,399 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 00:44:20,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:44:20,400 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:44:20,401 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:44:20,404 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-29 00:44:20,531 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-29 00:44:20,531 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:44:20,533 INFO L262 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-29 00:44:20,534 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:44:20,613 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-29 00:44:20,613 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:44:20,692 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-29 00:44:20,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [423415337] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:44:20,692 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:44:20,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2023-11-29 00:44:20,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593178810] [2023-11-29 00:44:20,692 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:44:20,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-29 00:44:20,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:44:20,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-29 00:44:20,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2023-11-29 00:44:20,694 INFO L87 Difference]: Start difference. First operand 57 states and 65 transitions. Second operand has 17 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 17 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:44:20,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:44:20,925 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2023-11-29 00:44:20,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 00:44:20,926 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 17 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-11-29 00:44:20,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:44:20,926 INFO L225 Difference]: With dead ends: 84 [2023-11-29 00:44:20,926 INFO L226 Difference]: Without dead ends: 68 [2023-11-29 00:44:20,927 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 32 SyntacticMatches, 8 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2023-11-29 00:44:20,928 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 57 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:44:20,928 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 118 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 00:44:20,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2023-11-29 00:44:20,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 46. [2023-11-29 00:44:20,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.1111111111111112) internal successors, (50), 45 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:44:20,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2023-11-29 00:44:20,945 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 23 [2023-11-29 00:44:20,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:44:20,945 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2023-11-29 00:44:20,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 17 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:44:20,946 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2023-11-29 00:44:20,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-29 00:44:20,946 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:44:20,946 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:44:20,952 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-11-29 00:44:21,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:44:21,147 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:44:21,147 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:44:21,147 INFO L85 PathProgramCache]: Analyzing trace with hash 23154964, now seen corresponding path program 10 times [2023-11-29 00:44:21,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:44:21,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124342344] [2023-11-29 00:44:21,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:44:21,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:44:21,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:44:22,880 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:44:22,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:44:22,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124342344] [2023-11-29 00:44:22,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124342344] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:44:22,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [431669785] [2023-11-29 00:44:22,881 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 00:44:22,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:44:22,881 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:44:22,882 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:44:22,885 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-29 00:44:23,012 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 00:44:23,012 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:44:23,014 INFO L262 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 83 conjunts are in the unsatisfiable core [2023-11-29 00:44:23,020 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:44:23,027 INFO L378 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 [2023-11-29 00:44:23,061 INFO L378 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 15 treesize of output 11 [2023-11-29 00:44:23,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2023-11-29 00:44:23,177 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:44:23,178 INFO L378 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 1 case distinctions, treesize of input 38 treesize of output 40 [2023-11-29 00:44:23,253 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:44:23,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 52 [2023-11-29 00:44:23,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2023-11-29 00:44:23,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2023-11-29 00:44:23,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2023-11-29 00:44:23,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 00:44:23,881 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:44:23,882 INFO L378 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 6 case distinctions, treesize of input 40 treesize of output 41 [2023-11-29 00:44:23,959 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:44:23,959 INFO L378 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 6 case distinctions, treesize of input 40 treesize of output 41 [2023-11-29 00:44:24,038 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:44:24,039 INFO L378 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 6 case distinctions, treesize of input 40 treesize of output 41 [2023-11-29 00:44:24,115 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:44:24,116 INFO L378 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 6 case distinctions, treesize of input 40 treesize of output 41 [2023-11-29 00:44:24,284 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:44:24,284 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:44:25,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 154 [2023-11-29 00:44:25,332 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:44:25,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1473459 treesize of output 1416115 [2023-11-29 00:44:25,457 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:44:25,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [431669785] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:44:25,457 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:44:25,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 55 [2023-11-29 00:44:25,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017466557] [2023-11-29 00:44:25,458 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:44:25,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2023-11-29 00:44:25,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:44:25,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2023-11-29 00:44:25,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=2673, Unknown=0, NotChecked=0, Total=2970 [2023-11-29 00:44:25,460 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand has 55 states, 55 states have (on average 1.2) internal successors, (66), 55 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:44:31,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:44:31,286 INFO L93 Difference]: Finished difference Result 126 states and 146 transitions. [2023-11-29 00:44:31,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2023-11-29 00:44:31,286 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 1.2) internal successors, (66), 55 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-11-29 00:44:31,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:44:31,287 INFO L225 Difference]: With dead ends: 126 [2023-11-29 00:44:31,287 INFO L226 Difference]: Without dead ends: 101 [2023-11-29 00:44:31,291 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2741 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=1142, Invalid=10414, Unknown=0, NotChecked=0, Total=11556 [2023-11-29 00:44:31,291 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 126 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 1443 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 1580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 1443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-11-29 00:44:31,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 374 Invalid, 1580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 1443 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-11-29 00:44:31,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-11-29 00:44:31,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 63. [2023-11-29 00:44:31,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.1290322580645162) internal successors, (70), 62 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) [2023-11-29 00:44:31,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2023-11-29 00:44:31,320 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 25 [2023-11-29 00:44:31,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:44:31,320 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2023-11-29 00:44:31,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 1.2) internal successors, (66), 55 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:44:31,320 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2023-11-29 00:44:31,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-29 00:44:31,321 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:44:31,321 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:44:31,326 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-11-29 00:44:31,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:44:31,522 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:44:31,522 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:44:31,522 INFO L85 PathProgramCache]: Analyzing trace with hash -517805429, now seen corresponding path program 11 times [2023-11-29 00:44:31,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:44:31,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483624637] [2023-11-29 00:44:31,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:44:31,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:44:31,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:44:31,659 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-29 00:44:31,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:44:31,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483624637] [2023-11-29 00:44:31,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483624637] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:44:31,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [257448884] [2023-11-29 00:44:31,660 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 00:44:31,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:44:31,660 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:44:31,661 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:44:31,663 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-29 00:44:31,840 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2023-11-29 00:44:31,840 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:44:31,842 INFO L262 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-29 00:44:31,843 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:44:31,916 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-29 00:44:31,916 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:44:31,998 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-29 00:44:31,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [257448884] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:44:31,998 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:44:31,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2023-11-29 00:44:31,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768282580] [2023-11-29 00:44:31,999 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:44:31,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-29 00:44:31,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:44:32,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-29 00:44:32,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2023-11-29 00:44:32,000 INFO L87 Difference]: Start difference. First operand 63 states and 70 transitions. Second operand has 20 states, 20 states have (on average 1.65) internal successors, (33), 20 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:44:32,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:44:32,332 INFO L93 Difference]: Finished difference Result 108 states and 117 transitions. [2023-11-29 00:44:32,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-29 00:44:32,333 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.65) internal successors, (33), 20 states have internal predecessors, (33), 0 states have call successors, (0), 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 [2023-11-29 00:44:32,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:44:32,334 INFO L225 Difference]: With dead ends: 108 [2023-11-29 00:44:32,334 INFO L226 Difference]: Without dead ends: 96 [2023-11-29 00:44:32,335 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 35 SyntacticMatches, 10 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=194, Invalid=618, Unknown=0, NotChecked=0, Total=812 [2023-11-29 00:44:32,335 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 106 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 00:44:32,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 128 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 00:44:32,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-11-29 00:44:32,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 65. [2023-11-29 00:44:32,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.125) internal successors, (72), 64 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:44:32,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 72 transitions. [2023-11-29 00:44:32,365 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 72 transitions. Word has length 26 [2023-11-29 00:44:32,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:44:32,365 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 72 transitions. [2023-11-29 00:44:32,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.65) internal successors, (33), 20 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:44:32,365 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2023-11-29 00:44:32,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-29 00:44:32,366 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:44:32,366 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:44:32,371 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-11-29 00:44:32,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-29 00:44:32,566 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:44:32,567 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:44:32,567 INFO L85 PathProgramCache]: Analyzing trace with hash -374602502, now seen corresponding path program 2 times [2023-11-29 00:44:32,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:44:32,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749246455] [2023-11-29 00:44:32,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:44:32,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:44:32,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:44:34,410 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:44:34,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:44:34,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749246455] [2023-11-29 00:44:34,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749246455] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:44:34,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1624668608] [2023-11-29 00:44:34,411 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 00:44:34,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:44:34,411 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:44:34,412 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:44:34,412 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-11-29 00:44:34,503 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 00:44:34,503 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:44:34,505 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 76 conjunts are in the unsatisfiable core [2023-11-29 00:44:34,510 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:44:34,586 INFO L378 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 [2023-11-29 00:44:34,628 INFO L378 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 [2023-11-29 00:44:34,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-29 00:44:34,740 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:44:34,741 INFO L378 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 1 case distinctions, treesize of input 26 treesize of output 28 [2023-11-29 00:44:34,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 00:44:34,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 00:44:34,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 00:44:35,009 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:44:35,009 INFO L378 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 3 case distinctions, treesize of input 33 treesize of output 31 [2023-11-29 00:44:35,072 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:44:35,072 INFO L378 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 3 case distinctions, treesize of input 33 treesize of output 31 [2023-11-29 00:44:35,128 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:44:35,129 INFO L378 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 3 case distinctions, treesize of input 33 treesize of output 31 [2023-11-29 00:44:35,405 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:44:35,405 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:44:36,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 94 [2023-11-29 00:44:36,158 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:44:36,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 10681 treesize of output 10041 [2023-11-29 00:44:36,384 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:44:36,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1624668608] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:44:36,385 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:44:36,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 19] total 52 [2023-11-29 00:44:36,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854253063] [2023-11-29 00:44:36,385 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:44:36,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2023-11-29 00:44:36,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:44:36,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2023-11-29 00:44:36,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=2376, Unknown=0, NotChecked=0, Total=2652 [2023-11-29 00:44:36,388 INFO L87 Difference]: Start difference. First operand 65 states and 72 transitions. Second operand has 52 states, 52 states have (on average 1.4423076923076923) internal successors, (75), 52 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:44:37,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:44:37,287 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2023-11-29 00:44:37,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-11-29 00:44:37,287 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 1.4423076923076923) internal successors, (75), 52 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2023-11-29 00:44:37,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:44:37,288 INFO L225 Difference]: With dead ends: 67 [2023-11-29 00:44:37,288 INFO L226 Difference]: Without dead ends: 46 [2023-11-29 00:44:37,289 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1018 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=409, Invalid=3373, Unknown=0, NotChecked=0, Total=3782 [2023-11-29 00:44:37,290 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 37 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 726 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 00:44:37,290 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 91 Invalid, 746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 726 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 00:44:37,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-11-29 00:44:37,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2023-11-29 00:44:37,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 45 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) [2023-11-29 00:44:37,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2023-11-29 00:44:37,314 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 28 [2023-11-29 00:44:37,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:44:37,314 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2023-11-29 00:44:37,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 1.4423076923076923) internal successors, (75), 52 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:44:37,314 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2023-11-29 00:44:37,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-29 00:44:37,315 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:44:37,315 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:44:37,320 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-11-29 00:44:37,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-11-29 00:44:37,516 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:44:37,516 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:44:37,516 INFO L85 PathProgramCache]: Analyzing trace with hash 3888730, now seen corresponding path program 12 times [2023-11-29 00:44:37,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:44:37,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075531733] [2023-11-29 00:44:37,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:44:37,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:44:37,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:44:39,464 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 3 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:44:39,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:44:39,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075531733] [2023-11-29 00:44:39,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075531733] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:44:39,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [76520843] [2023-11-29 00:44:39,465 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-29 00:44:39,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:44:39,465 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:44:39,466 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:44:39,467 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-11-29 00:44:39,599 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2023-11-29 00:44:39,599 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:44:39,602 WARN L260 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 107 conjunts are in the unsatisfiable core [2023-11-29 00:44:39,607 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:44:39,675 INFO L378 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 [2023-11-29 00:44:39,728 INFO L378 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 [2023-11-29 00:44:39,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-29 00:44:39,842 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:44:39,842 INFO L378 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 1 case distinctions, treesize of input 26 treesize of output 28 [2023-11-29 00:44:39,915 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:44:39,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 38 [2023-11-29 00:44:39,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:44:39,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:44:39,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:44:39,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:44:40,002 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:44:40,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 50 [2023-11-29 00:44:40,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 00:44:40,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 00:44:40,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 00:44:40,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 00:44:40,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2023-11-29 00:44:41,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:44:41,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:44:41,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:44:41,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:44:41,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:44:41,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:44:41,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:44:41,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:44:41,151 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-29 00:44:41,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 72 treesize of output 79 [2023-11-29 00:44:41,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:44:41,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:44:41,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:44:41,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:44:41,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:44:41,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:44:41,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:44:41,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:44:41,318 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-29 00:44:41,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 78 treesize of output 85 [2023-11-29 00:44:41,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:44:41,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:44:41,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:44:41,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:44:41,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:44:41,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:44:41,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:44:41,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:44:41,495 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-29 00:44:41,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 84 treesize of output 91 [2023-11-29 00:44:41,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:44:41,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:44:41,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:44:41,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:44:41,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:44:41,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:44:41,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:44:41,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:44:41,674 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-29 00:44:41,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 90 treesize of output 97 [2023-11-29 00:44:41,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:44:41,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:44:41,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:44:41,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:44:41,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:44:41,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:44:41,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:44:41,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:44:41,889 INFO L349 Elim1Store]: treesize reduction 52, result has 46.4 percent of original size [2023-11-29 00:44:41,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 18 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 23 case distinctions, treesize of input 100 treesize of output 134 [2023-11-29 00:44:41,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 84 [2023-11-29 00:44:42,326 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:44:42,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 84 treesize of output 36 [2023-11-29 00:44:42,375 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:44:42,376 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:44:47,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 233 treesize of output 223 [2023-11-29 00:44:47,281 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:44:47,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 601620831 treesize of output 582746463 [2023-11-29 00:44:48,580 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 44 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:44:48,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [76520843] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:44:48,580 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:44:48,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 26, 24] total 69 [2023-11-29 00:44:48,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764390964] [2023-11-29 00:44:48,581 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:44:48,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2023-11-29 00:44:48,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:44:48,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2023-11-29 00:44:48,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=461, Invalid=4230, Unknown=1, NotChecked=0, Total=4692 [2023-11-29 00:44:48,584 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand has 69 states, 69 states have (on average 1.1159420289855073) internal successors, (77), 69 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:44:59,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:44:59,995 INFO L93 Difference]: Finished difference Result 138 states and 162 transitions. [2023-11-29 00:44:59,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2023-11-29 00:44:59,995 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 69 states have (on average 1.1159420289855073) internal successors, (77), 69 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2023-11-29 00:44:59,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:44:59,997 INFO L225 Difference]: With dead ends: 138 [2023-11-29 00:44:59,997 INFO L226 Difference]: Without dead ends: 109 [2023-11-29 00:45:00,002 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4519 ImplicationChecksByTransitivity, 16.0s TimeCoverageRelationStatistics Valid=2019, Invalid=15536, Unknown=1, NotChecked=0, Total=17556 [2023-11-29 00:45:00,002 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 151 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 1893 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 2088 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 1893 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-11-29 00:45:00,002 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 384 Invalid, 2088 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 1893 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2023-11-29 00:45:00,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-11-29 00:45:00,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 62. [2023-11-29 00:45:00,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.180327868852459) internal successors, (72), 61 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:45:00,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2023-11-29 00:45:00,053 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 72 transitions. Word has length 28 [2023-11-29 00:45:00,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:45:00,053 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 72 transitions. [2023-11-29 00:45:00,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 69 states have (on average 1.1159420289855073) internal successors, (77), 69 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:45:00,053 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2023-11-29 00:45:00,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-29 00:45:00,054 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:45:00,054 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:45:00,058 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2023-11-29 00:45:00,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-11-29 00:45:00,254 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:45:00,254 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:45:00,255 INFO L85 PathProgramCache]: Analyzing trace with hash 521529483, now seen corresponding path program 3 times [2023-11-29 00:45:00,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:45:00,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453718462] [2023-11-29 00:45:00,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:45:00,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:45:00,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:45:00,384 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-29 00:45:00,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:45:00,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453718462] [2023-11-29 00:45:00,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453718462] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:45:00,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [594429991] [2023-11-29 00:45:00,385 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 00:45:00,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:45:00,385 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:45:00,386 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:45:00,387 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-11-29 00:45:00,580 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-11-29 00:45:00,580 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:45:00,581 INFO L262 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-29 00:45:00,582 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:45:00,662 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-29 00:45:00,662 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:45:00,722 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-29 00:45:00,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [594429991] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:45:00,722 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:45:00,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2023-11-29 00:45:00,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465946117] [2023-11-29 00:45:00,723 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:45:00,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-29 00:45:00,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:45:00,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-29 00:45:00,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2023-11-29 00:45:00,724 INFO L87 Difference]: Start difference. First operand 62 states and 72 transitions. Second operand has 20 states, 20 states have (on average 1.75) internal successors, (35), 20 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:45:00,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:45:00,883 INFO L93 Difference]: Finished difference Result 113 states and 127 transitions. [2023-11-29 00:45:00,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 00:45:00,883 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.75) internal successors, (35), 20 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2023-11-29 00:45:00,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:45:00,884 INFO L225 Difference]: With dead ends: 113 [2023-11-29 00:45:00,884 INFO L226 Difference]: Without dead ends: 78 [2023-11-29 00:45:00,884 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 42 SyntacticMatches, 9 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=161, Invalid=439, Unknown=0, NotChecked=0, Total=600 [2023-11-29 00:45:00,884 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 41 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:45:00,885 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 44 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 00:45:00,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-11-29 00:45:00,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 53. [2023-11-29 00:45:00,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.1730769230769231) internal successors, (61), 52 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) [2023-11-29 00:45:00,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2023-11-29 00:45:00,917 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 29 [2023-11-29 00:45:00,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:45:00,917 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2023-11-29 00:45:00,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.75) internal successors, (35), 20 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:45:00,917 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2023-11-29 00:45:00,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-29 00:45:00,918 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:45:00,918 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:45:00,922 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2023-11-29 00:45:01,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-11-29 00:45:01,118 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:45:01,118 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:45:01,119 INFO L85 PathProgramCache]: Analyzing trace with hash -155547884, now seen corresponding path program 13 times [2023-11-29 00:45:01,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:45:01,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679780430] [2023-11-29 00:45:01,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:45:01,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:45:01,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:45:03,176 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 6 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:45:03,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:45:03,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679780430] [2023-11-29 00:45:03,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679780430] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:45:03,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1125712167] [2023-11-29 00:45:03,177 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-29 00:45:03,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:45:03,177 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:45:03,178 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:45:03,179 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-11-29 00:45:03,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:45:03,269 WARN L260 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 114 conjunts are in the unsatisfiable core [2023-11-29 00:45:03,274 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:45:03,279 INFO L378 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 [2023-11-29 00:45:03,288 INFO L378 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 [2023-11-29 00:45:03,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-29 00:45:03,317 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:45:03,317 INFO L378 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 1 case distinctions, treesize of input 26 treesize of output 28 [2023-11-29 00:45:03,341 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:45:03,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 38 [2023-11-29 00:45:03,360 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:45:03,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 48 [2023-11-29 00:45:03,386 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:45:03,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 47 treesize of output 58 [2023-11-29 00:45:03,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 00:45:03,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 00:45:03,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 00:45:03,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 00:45:03,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 00:45:03,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 00:45:04,011 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:45:04,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 54 treesize of output 61 [2023-11-29 00:45:04,093 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:45:04,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 54 treesize of output 61 [2023-11-29 00:45:04,190 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:45:04,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 54 treesize of output 61 [2023-11-29 00:45:04,276 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:45:04,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 54 treesize of output 61 [2023-11-29 00:45:04,371 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:45:04,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 54 treesize of output 61 [2023-11-29 00:45:04,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:45:04,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:45:04,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:45:04,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:45:04,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:45:04,482 INFO L349 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2023-11-29 00:45:04,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 20 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 22 case distinctions, treesize of input 64 treesize of output 84 [2023-11-29 00:45:04,701 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:45:04,701 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:45:09,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3782 treesize of output 3646 [2023-11-29 00:45:35,947 WARN L293 SmtUtils]: Spent 6.61s on a formula simplification. DAG size of input: 39 DAG size of output: 8 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-11-29 00:45:35,947 INFO L349 Elim1Store]: treesize reduction 41, result has 16.3 percent of original size [2023-11-29 00:45:36,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 1051108439806197459 treesize of output 951390499954157867 [2023-11-29 00:46:35,635 WARN L293 SmtUtils]: Spent 58.82s on a formula simplification. DAG size of input: 195833 DAG size of output: 113 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:46:36,039 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 10 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:46:36,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1125712167] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:46:36,039 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:46:36,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 64 [2023-11-29 00:46:36,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845789821] [2023-11-29 00:46:36,040 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:46:36,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2023-11-29 00:46:36,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:46:36,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2023-11-29 00:46:36,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=320, Invalid=3712, Unknown=0, NotChecked=0, Total=4032 [2023-11-29 00:46:36,041 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand has 64 states, 64 states have (on average 1.1875) internal successors, (76), 64 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:46:47,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:46:47,772 INFO L93 Difference]: Finished difference Result 133 states and 151 transitions. [2023-11-29 00:46:47,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2023-11-29 00:46:47,772 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 1.1875) internal successors, (76), 64 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-11-29 00:46:47,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:46:47,773 INFO L225 Difference]: With dead ends: 133 [2023-11-29 00:46:47,773 INFO L226 Difference]: Without dead ends: 117 [2023-11-29 00:46:47,774 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1723 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=780, Invalid=6876, Unknown=0, NotChecked=0, Total=7656 [2023-11-29 00:46:47,774 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 73 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 1437 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 1459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2023-11-29 00:46:47,775 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 520 Invalid, 1459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1437 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2023-11-29 00:46:47,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2023-11-29 00:46:47,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 74. [2023-11-29 00:46:47,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 73 states have (on average 1.1643835616438356) internal successors, (85), 73 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:46:47,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 85 transitions. [2023-11-29 00:46:47,825 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 85 transitions. Word has length 31 [2023-11-29 00:46:47,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:46:47,825 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 85 transitions. [2023-11-29 00:46:47,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 1.1875) internal successors, (76), 64 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:46:47,825 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 85 transitions. [2023-11-29 00:46:47,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-29 00:46:47,826 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:46:47,826 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:46:47,831 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2023-11-29 00:46:48,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-11-29 00:46:48,027 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:46:48,027 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:46:48,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1799346897, now seen corresponding path program 4 times [2023-11-29 00:46:48,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:46:48,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615432060] [2023-11-29 00:46:48,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:46:48,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:46:48,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:46:48,596 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 16 proven. 20 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-29 00:46:48,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:46:48,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615432060] [2023-11-29 00:46:48,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615432060] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:46:48,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119035994] [2023-11-29 00:46:48,597 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 00:46:48,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:46:48,597 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:46:48,598 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:46:48,599 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-11-29 00:46:48,692 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 00:46:48,692 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:46:48,693 INFO L262 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-29 00:46:48,694 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:46:49,234 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-29 00:46:49,235 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:46:49,650 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-29 00:46:49,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2119035994] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:46:49,650 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:46:49,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 23 [2023-11-29 00:46:49,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022720632] [2023-11-29 00:46:49,651 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:46:49,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-29 00:46:49,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:46:49,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-29 00:46:49,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2023-11-29 00:46:49,653 INFO L87 Difference]: Start difference. First operand 74 states and 85 transitions. Second operand has 23 states, 23 states have (on average 2.0) internal successors, (46), 23 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:46:50,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:46:50,818 INFO L93 Difference]: Finished difference Result 151 states and 166 transitions. [2023-11-29 00:46:50,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-29 00:46:50,819 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.0) internal successors, (46), 23 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2023-11-29 00:46:50,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:46:50,820 INFO L225 Difference]: With dead ends: 151 [2023-11-29 00:46:50,820 INFO L226 Difference]: Without dead ends: 113 [2023-11-29 00:46:50,820 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 46 SyntacticMatches, 11 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=212, Invalid=600, Unknown=0, NotChecked=0, Total=812 [2023-11-29 00:46:50,821 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 99 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 00:46:50,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 169 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-29 00:46:50,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-11-29 00:46:50,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 73. [2023-11-29 00:46:50,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 72 states have (on average 1.1666666666666667) internal successors, (84), 72 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:46:50,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 84 transitions. [2023-11-29 00:46:50,869 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 84 transitions. Word has length 32 [2023-11-29 00:46:50,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:46:50,869 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 84 transitions. [2023-11-29 00:46:50,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.0) internal successors, (46), 23 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:46:50,869 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 84 transitions. [2023-11-29 00:46:50,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-29 00:46:50,869 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:46:50,870 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:46:50,874 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2023-11-29 00:46:51,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:46:51,070 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:46:51,070 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:46:51,071 INFO L85 PathProgramCache]: Analyzing trace with hash 290102489, now seen corresponding path program 14 times [2023-11-29 00:46:51,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:46:51,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972157861] [2023-11-29 00:46:51,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:46:51,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:46:51,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:46:51,743 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 22 proven. 27 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-11-29 00:46:51,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:46:51,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972157861] [2023-11-29 00:46:51,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972157861] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:46:51,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1143836462] [2023-11-29 00:46:51,744 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 00:46:51,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:46:51,744 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:46:51,745 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:46:51,746 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-11-29 00:46:51,854 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 00:46:51,854 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:46:51,856 INFO L262 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-29 00:46:51,857 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:46:52,546 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 28 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-11-29 00:46:52,546 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:46:53,081 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 28 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-11-29 00:46:53,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1143836462] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:46:53,081 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:46:53,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 26 [2023-11-29 00:46:53,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613640196] [2023-11-29 00:46:53,082 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:46:53,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-29 00:46:53,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:46:53,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-29 00:46:53,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=485, Unknown=0, NotChecked=0, Total=650 [2023-11-29 00:46:53,083 INFO L87 Difference]: Start difference. First operand 73 states and 84 transitions. Second operand has 26 states, 26 states have (on average 1.5) 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) [2023-11-29 00:46:54,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:46:54,563 INFO L93 Difference]: Finished difference Result 192 states and 209 transitions. [2023-11-29 00:46:54,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-29 00:46:54,563 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.5) 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) Word has length 32 [2023-11-29 00:46:54,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:46:54,564 INFO L225 Difference]: With dead ends: 192 [2023-11-29 00:46:54,564 INFO L226 Difference]: Without dead ends: 156 [2023-11-29 00:46:54,565 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 42 SyntacticMatches, 13 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 562 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=385, Invalid=1175, Unknown=0, NotChecked=0, Total=1560 [2023-11-29 00:46:54,565 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 270 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 00:46:54,565 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 189 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-29 00:46:54,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2023-11-29 00:46:54,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 85. [2023-11-29 00:46:54,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 84 states have (on average 1.1666666666666667) internal successors, (98), 84 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:46:54,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 98 transitions. [2023-11-29 00:46:54,620 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 98 transitions. Word has length 32 [2023-11-29 00:46:54,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:46:54,620 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 98 transitions. [2023-11-29 00:46:54,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.5) 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) [2023-11-29 00:46:54,620 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 98 transitions. [2023-11-29 00:46:54,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-29 00:46:54,621 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:46:54,621 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:46:54,626 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-11-29 00:46:54,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:46:54,821 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:46:54,822 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:46:54,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1915415371, now seen corresponding path program 15 times [2023-11-29 00:46:54,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:46:54,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496569402] [2023-11-29 00:46:54,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:46:54,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:46:54,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:46:55,529 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 15 proven. 34 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-11-29 00:46:55,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:46:55,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496569402] [2023-11-29 00:46:55,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496569402] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:46:55,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1243743966] [2023-11-29 00:46:55,530 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 00:46:55,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:46:55,530 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:46:55,531 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:46:55,532 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-11-29 00:46:55,846 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-11-29 00:46:55,846 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:46:55,848 INFO L262 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-29 00:46:55,849 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:46:56,487 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 21 proven. 28 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-11-29 00:46:56,487 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:46:57,126 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 21 proven. 28 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-11-29 00:46:57,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1243743966] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:46:57,127 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:46:57,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 26 [2023-11-29 00:46:57,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868336661] [2023-11-29 00:46:57,127 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:46:57,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-29 00:46:57,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:46:57,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-29 00:46:57,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=485, Unknown=0, NotChecked=0, Total=650 [2023-11-29 00:46:57,129 INFO L87 Difference]: Start difference. First operand 85 states and 98 transitions. Second operand has 26 states, 26 states have (on average 1.8461538461538463) internal successors, (48), 26 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) [2023-11-29 00:46:59,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:46:59,139 INFO L93 Difference]: Finished difference Result 144 states and 155 transitions. [2023-11-29 00:46:59,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-29 00:46:59,139 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.8461538461538463) internal successors, (48), 26 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 32 [2023-11-29 00:46:59,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:46:59,140 INFO L225 Difference]: With dead ends: 144 [2023-11-29 00:46:59,140 INFO L226 Difference]: Without dead ends: 113 [2023-11-29 00:46:59,141 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 41 SyntacticMatches, 14 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 616 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=352, Invalid=1208, Unknown=0, NotChecked=0, Total=1560 [2023-11-29 00:46:59,142 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 146 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-11-29 00:46:59,142 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 240 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-11-29 00:46:59,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-11-29 00:46:59,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 70. [2023-11-29 00:46:59,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 1.1159420289855073) internal successors, (77), 69 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:46:59,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 77 transitions. [2023-11-29 00:46:59,190 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 77 transitions. Word has length 32 [2023-11-29 00:46:59,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:46:59,190 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 77 transitions. [2023-11-29 00:46:59,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.8461538461538463) internal successors, (48), 26 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) [2023-11-29 00:46:59,191 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2023-11-29 00:46:59,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-29 00:46:59,191 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:46:59,191 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:46:59,197 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2023-11-29 00:46:59,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-11-29 00:46:59,391 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:46:59,392 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:46:59,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1128358054, now seen corresponding path program 16 times [2023-11-29 00:46:59,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:46:59,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442256920] [2023-11-29 00:46:59,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:46:59,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:46:59,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:47:05,808 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 10 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:47:05,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:47:05,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442256920] [2023-11-29 00:47:05,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442256920] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:47:05,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [753170142] [2023-11-29 00:47:05,809 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 00:47:05,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:47:05,809 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:47:05,810 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:47:05,811 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-11-29 00:47:06,001 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 00:47:06,001 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:47:06,004 WARN L260 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 134 conjunts are in the unsatisfiable core [2023-11-29 00:47:06,010 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:47:06,029 INFO L378 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 [2023-11-29 00:47:06,057 INFO L378 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 [2023-11-29 00:47:06,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-29 00:47:06,134 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:47:06,134 INFO L378 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 1 case distinctions, treesize of input 26 treesize of output 28 [2023-11-29 00:47:06,199 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:47:06,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 38 [2023-11-29 00:47:06,275 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:47:06,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 48 [2023-11-29 00:47:06,342 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:47:06,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 47 treesize of output 58 [2023-11-29 00:47:06,439 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:47:06,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 54 treesize of output 68 [2023-11-29 00:47:06,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 00:47:07,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 00:47:07,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 00:47:07,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 00:47:08,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 00:47:08,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 00:47:08,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 00:47:09,862 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:47:09,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 61 treesize of output 71 [2023-11-29 00:47:10,209 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:47:10,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 61 treesize of output 71 [2023-11-29 00:47:10,556 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:47:10,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 61 treesize of output 71 [2023-11-29 00:47:10,913 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:47:10,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 61 treesize of output 71 [2023-11-29 00:47:11,251 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:47:11,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 61 treesize of output 71 [2023-11-29 00:47:11,662 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:47:11,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 61 treesize of output 71 [2023-11-29 00:47:12,011 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:47:12,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 61 treesize of output 71 [2023-11-29 00:47:12,940 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:47:12,941 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:47:19,649 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:47:19,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [753170142] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:47:19,649 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:47:19,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 76 [2023-11-29 00:47:19,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374360138] [2023-11-29 00:47:19,650 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:47:19,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2023-11-29 00:47:19,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:47:19,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2023-11-29 00:47:19,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=839, Invalid=4861, Unknown=0, NotChecked=0, Total=5700 [2023-11-29 00:47:19,653 INFO L87 Difference]: Start difference. First operand 70 states and 77 transitions. Second operand has 76 states, 76 states have (on average 1.118421052631579) internal successors, (85), 76 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:47:52,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:47:52,131 INFO L93 Difference]: Finished difference Result 225 states and 263 transitions. [2023-11-29 00:47:52,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2023-11-29 00:47:52,132 INFO L78 Accepts]: Start accepts. Automaton has has 76 states, 76 states have (on average 1.118421052631579) internal successors, (85), 76 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2023-11-29 00:47:52,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:47:52,133 INFO L225 Difference]: With dead ends: 225 [2023-11-29 00:47:52,133 INFO L226 Difference]: Without dead ends: 178 [2023-11-29 00:47:52,136 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7827 ImplicationChecksByTransitivity, 39.0s TimeCoverageRelationStatistics Valid=3811, Invalid=22271, Unknown=0, NotChecked=0, Total=26082 [2023-11-29 00:47:52,137 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 508 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 1856 mSolverCounterSat, 485 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 508 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 2341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 485 IncrementalHoareTripleChecker+Valid, 1856 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2023-11-29 00:47:52,137 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [508 Valid, 501 Invalid, 2341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [485 Valid, 1856 Invalid, 0 Unknown, 0 Unchecked, 7.3s Time] [2023-11-29 00:47:52,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2023-11-29 00:47:52,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 125. [2023-11-29 00:47:52,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 124 states have (on average 1.1774193548387097) internal successors, (146), 124 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:47:52,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 146 transitions. [2023-11-29 00:47:52,252 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 146 transitions. Word has length 34 [2023-11-29 00:47:52,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:47:52,252 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 146 transitions. [2023-11-29 00:47:52,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 76 states have (on average 1.118421052631579) internal successors, (85), 76 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:47:52,253 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 146 transitions. [2023-11-29 00:47:52,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-29 00:47:52,253 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:47:52,253 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:47:52,258 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2023-11-29 00:47:52,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-11-29 00:47:52,454 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:47:52,454 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:47:52,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1770278264, now seen corresponding path program 17 times [2023-11-29 00:47:52,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:47:52,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100146337] [2023-11-29 00:47:52,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:47:52,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:47:52,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:47:53,378 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 21 proven. 43 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-11-29 00:47:53,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:47:53,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100146337] [2023-11-29 00:47:53,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100146337] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:47:53,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [142422521] [2023-11-29 00:47:53,378 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 00:47:53,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:47:53,379 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:47:53,379 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:47:53,380 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-11-29 00:47:55,926 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2023-11-29 00:47:55,927 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:47:55,934 INFO L262 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-29 00:47:55,935 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:47:56,736 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 28 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-11-29 00:47:56,736 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:47:57,626 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 28 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-11-29 00:47:57,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [142422521] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:47:57,626 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:47:57,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 29 [2023-11-29 00:47:57,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738644750] [2023-11-29 00:47:57,627 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:47:57,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-11-29 00:47:57,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:47:57,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-11-29 00:47:57,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=609, Unknown=0, NotChecked=0, Total=812 [2023-11-29 00:47:57,628 INFO L87 Difference]: Start difference. First operand 125 states and 146 transitions. Second operand has 29 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 29 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) [2023-11-29 00:48:00,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:48:00,768 INFO L93 Difference]: Finished difference Result 205 states and 229 transitions. [2023-11-29 00:48:00,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-11-29 00:48:00,768 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 29 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 36 [2023-11-29 00:48:00,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:48:00,769 INFO L225 Difference]: With dead ends: 205 [2023-11-29 00:48:00,769 INFO L226 Difference]: Without dead ends: 177 [2023-11-29 00:48:00,770 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 46 SyntacticMatches, 16 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 780 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=422, Invalid=1470, Unknown=0, NotChecked=0, Total=1892 [2023-11-29 00:48:00,770 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 164 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 744 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-11-29 00:48:00,770 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 328 Invalid, 828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 744 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2023-11-29 00:48:00,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2023-11-29 00:48:00,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 112. [2023-11-29 00:48:00,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 111 states have (on average 1.117117117117117) internal successors, (124), 111 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:00,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 124 transitions. [2023-11-29 00:48:00,861 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 124 transitions. Word has length 36 [2023-11-29 00:48:00,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:48:00,861 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 124 transitions. [2023-11-29 00:48:00,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 29 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) [2023-11-29 00:48:00,861 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 124 transitions. [2023-11-29 00:48:00,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-11-29 00:48:00,862 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:48:00,862 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:48:00,868 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2023-11-29 00:48:01,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2023-11-29 00:48:01,062 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:48:01,062 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:48:01,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1456563404, now seen corresponding path program 5 times [2023-11-29 00:48:01,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:48:01,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674918839] [2023-11-29 00:48:01,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:48:01,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:48:01,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:48:06,493 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 4 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:48:06,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:48:06,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674918839] [2023-11-29 00:48:06,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674918839] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:48:06,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1452050023] [2023-11-29 00:48:06,494 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 00:48:06,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:48:06,494 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:48:06,495 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:48:06,496 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-11-29 00:48:07,373 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2023-11-29 00:48:07,373 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:48:07,378 WARN L260 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 124 conjunts are in the unsatisfiable core [2023-11-29 00:48:07,383 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:48:07,391 INFO L378 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 [2023-11-29 00:48:07,577 INFO L378 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 [2023-11-29 00:48:07,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-29 00:48:07,987 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:48:07,988 INFO L378 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 1 case distinctions, treesize of input 26 treesize of output 28 [2023-11-29 00:48:08,250 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:48:08,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 38 [2023-11-29 00:48:08,513 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:48:08,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 48 [2023-11-29 00:48:08,826 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:48:08,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 47 treesize of output 58 [2023-11-29 00:48:09,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 00:48:10,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 00:48:10,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 00:48:10,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 00:48:11,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 00:48:11,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 00:48:12,323 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:48:12,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 54 treesize of output 61 [2023-11-29 00:48:12,682 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:48:12,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 54 treesize of output 61 [2023-11-29 00:48:13,048 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:48:13,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 54 treesize of output 61 [2023-11-29 00:48:13,388 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:48:13,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 54 treesize of output 61 [2023-11-29 00:48:13,786 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:48:13,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 54 treesize of output 61 [2023-11-29 00:48:14,177 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:48:14,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 54 treesize of output 61 [2023-11-29 00:48:16,395 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:48:16,395 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:48:24,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 334 treesize of output 322 [2023-11-29 00:48:24,696 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:48:24,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 1598563832703 treesize of output 1574941512575 [2023-11-29 00:48:27,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 332 treesize of output 320 [2023-11-29 00:48:27,211 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:48:27,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 1474622689749 treesize of output 1451000369621 [2023-11-29 00:48:28,337 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:48:28,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1452050023] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:48:28,337 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:48:28,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29, 29] total 83 [2023-11-29 00:48:28,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986159625] [2023-11-29 00:48:28,338 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:48:28,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 83 states [2023-11-29 00:48:28,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:48:28,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2023-11-29 00:48:28,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=626, Invalid=6180, Unknown=0, NotChecked=0, Total=6806 [2023-11-29 00:48:28,341 INFO L87 Difference]: Start difference. First operand 112 states and 124 transitions. Second operand has 83 states, 83 states have (on average 1.2289156626506024) internal successors, (102), 83 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:45,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:48:45,720 INFO L93 Difference]: Finished difference Result 129 states and 140 transitions. [2023-11-29 00:48:45,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2023-11-29 00:48:45,721 INFO L78 Accepts]: Start accepts. Automaton has has 83 states, 83 states have (on average 1.2289156626506024) internal successors, (102), 83 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2023-11-29 00:48:45,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:48:45,722 INFO L225 Difference]: With dead ends: 129 [2023-11-29 00:48:45,722 INFO L226 Difference]: Without dead ends: 93 [2023-11-29 00:48:45,723 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4658 ImplicationChecksByTransitivity, 29.2s TimeCoverageRelationStatistics Valid=1484, Invalid=13768, Unknown=0, NotChecked=0, Total=15252 [2023-11-29 00:48:45,723 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 234 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 1483 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 1690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 1483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2023-11-29 00:48:45,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 173 Invalid, 1690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 1483 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2023-11-29 00:48:45,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-11-29 00:48:45,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 78. [2023-11-29 00:48:45,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 77 states have (on average 1.1168831168831168) internal successors, (86), 77 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:45,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 86 transitions. [2023-11-29 00:48:45,795 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 86 transitions. Word has length 37 [2023-11-29 00:48:45,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:48:45,796 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 86 transitions. [2023-11-29 00:48:45,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 83 states, 83 states have (on average 1.2289156626506024) internal successors, (102), 83 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:45,796 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 86 transitions. [2023-11-29 00:48:45,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-11-29 00:48:45,796 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:48:45,796 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:48:45,802 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2023-11-29 00:48:45,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2023-11-29 00:48:45,997 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:48:45,997 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:48:45,997 INFO L85 PathProgramCache]: Analyzing trace with hash 2093485332, now seen corresponding path program 18 times [2023-11-29 00:48:45,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:48:45,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548856394] [2023-11-29 00:48:45,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:48:45,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:48:46,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:48:53,842 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 15 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:48:53,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:48:53,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548856394] [2023-11-29 00:48:53,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548856394] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:48:53,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1582618379] [2023-11-29 00:48:53,843 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-29 00:48:53,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:48:53,843 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:48:53,844 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:48:53,845 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-11-29 00:48:54,455 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2023-11-29 00:48:54,455 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:48:54,459 WARN L260 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 158 conjunts are in the unsatisfiable core [2023-11-29 00:48:54,465 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:48:54,950 INFO L378 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 [2023-11-29 00:48:55,226 INFO L378 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 [2023-11-29 00:48:55,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-29 00:48:55,818 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:48:55,818 INFO L378 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 1 case distinctions, treesize of input 26 treesize of output 28 [2023-11-29 00:48:56,176 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:48:56,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 38 [2023-11-29 00:48:56,542 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:48:56,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 48 [2023-11-29 00:48:56,987 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:48:56,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 47 treesize of output 58 [2023-11-29 00:48:57,433 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:48:57,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 54 treesize of output 68 [2023-11-29 00:48:57,886 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:48:57,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 61 treesize of output 78 [2023-11-29 00:48:59,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 00:48:59,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 00:49:00,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2023-11-29 00:49:00,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 31 [2023-11-29 00:49:01,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 40 [2023-11-29 00:49:01,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 49 [2023-11-29 00:49:02,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 58 [2023-11-29 00:49:02,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 65 [2023-11-29 00:49:04,155 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:49:04,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 68 treesize of output 81 [2023-11-29 00:49:04,648 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:49:04,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 68 treesize of output 81 [2023-11-29 00:49:05,127 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:49:05,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 68 treesize of output 81 [2023-11-29 00:49:05,616 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:49:05,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 68 treesize of output 81 [2023-11-29 00:49:06,140 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:49:06,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 68 treesize of output 81 [2023-11-29 00:49:06,651 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:49:06,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 68 treesize of output 81 [2023-11-29 00:49:07,177 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:49:07,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 68 treesize of output 81 [2023-11-29 00:49:08,479 INFO L349 Elim1Store]: treesize reduction 112, result has 57.7 percent of original size [2023-11-29 00:49:08,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 28 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 44 case distinctions, treesize of input 78 treesize of output 188 [2023-11-29 00:49:11,166 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:49:11,166 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:49:29,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3085 treesize of output 3001 [2023-11-29 00:50:05,005 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-11-29 00:50:05,012 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2023-11-29 00:50:05,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-11-29 00:50:05,206 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 1032249 column 7: canceled at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:192) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:543) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:522) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:515) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:326) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:341) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 1032249 column 7: canceled at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1511) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.push(UndoableWrapperScript.java:54) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:620) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:120) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:370) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:649) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:180) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:230) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:324) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:346) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:227) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) ... 55 more [2023-11-29 00:50:05,210 INFO L158 Benchmark]: Toolchain (without parser) took 367711.77ms. Allocated memory was 157.3MB in the beginning and 13.1GB in the end (delta: 12.9GB). Free memory was 117.8MB in the beginning and 9.8GB in the end (delta: -9.7GB). Peak memory consumption was 4.3GB. Max. memory is 16.1GB. [2023-11-29 00:50:05,210 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 107.0MB. Free memory is still 52.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 00:50:05,210 INFO L158 Benchmark]: CACSL2BoogieTranslator took 227.53ms. Allocated memory is still 157.3MB. Free memory was 117.8MB in the beginning and 106.8MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-29 00:50:05,210 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.76ms. Allocated memory is still 157.3MB. Free memory was 106.8MB in the beginning and 104.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 00:50:05,210 INFO L158 Benchmark]: Boogie Preprocessor took 45.89ms. Allocated memory is still 157.3MB. Free memory was 104.7MB in the beginning and 102.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 00:50:05,211 INFO L158 Benchmark]: RCFGBuilder took 339.71ms. Allocated memory is still 157.3MB. Free memory was 102.6MB in the beginning and 89.0MB in the end (delta: 13.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-29 00:50:05,211 INFO L158 Benchmark]: TraceAbstraction took 367053.19ms. Allocated memory was 157.3MB in the beginning and 13.1GB in the end (delta: 12.9GB). Free memory was 88.4MB in the beginning and 9.8GB in the end (delta: -9.7GB). Peak memory consumption was 4.3GB. Max. memory is 16.1GB. [2023-11-29 00:50:05,212 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 107.0MB. Free memory is still 52.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 227.53ms. Allocated memory is still 157.3MB. Free memory was 117.8MB in the beginning and 106.8MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.76ms. Allocated memory is still 157.3MB. Free memory was 106.8MB in the beginning and 104.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.89ms. Allocated memory is still 157.3MB. Free memory was 104.7MB in the beginning and 102.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 339.71ms. Allocated memory is still 157.3MB. Free memory was 102.6MB in the beginning and 89.0MB in the end (delta: 13.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 367053.19ms. Allocated memory was 157.3MB in the beginning and 13.1GB in the end (delta: 12.9GB). Free memory was 88.4MB in the beginning and 9.8GB in the end (delta: -9.7GB). Peak memory consumption was 4.3GB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 1032249 column 7: canceled de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 1032249 column 7: canceled: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:192) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2023-11-29 00:50:05,419 WARN L435 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2023-11-29 00:50:05,501 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/array-fpi/sina2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --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 1ea1eb4a8af9eb0da04a9f2b25d1b98ecd98ff3b6d87ba0d8e53000f12b8adcc --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 00:50:07,779 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 00:50:07,850 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-29 00:50:07,865 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 00:50:07,866 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 00:50:07,895 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 00:50:07,896 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 00:50:07,897 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 00:50:07,897 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 00:50:07,898 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 00:50:07,899 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 00:50:07,899 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 00:50:07,900 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 00:50:07,901 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 00:50:07,901 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 00:50:07,902 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 00:50:07,903 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 00:50:07,903 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 00:50:07,904 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 00:50:07,905 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 00:50:07,905 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 00:50:07,906 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 00:50:07,906 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 00:50:07,907 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 00:50:07,907 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 00:50:07,908 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 00:50:07,908 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 00:50:07,909 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 00:50:07,909 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 00:50:07,909 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 00:50:07,910 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 00:50:07,910 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 00:50:07,911 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 00:50:07,911 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:50:07,911 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 00:50:07,911 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 00:50:07,912 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 00:50:07,912 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 00:50:07,912 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 00:50:07,912 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 00:50:07,913 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 00:50:07,913 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 00:50:07,913 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 00:50:07,913 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 00:50:07,913 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 00:50:07,914 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/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_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 1ea1eb4a8af9eb0da04a9f2b25d1b98ecd98ff3b6d87ba0d8e53000f12b8adcc [2023-11-29 00:50:08,195 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 00:50:08,214 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 00:50:08,217 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 00:50:08,218 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 00:50:08,219 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 00:50:08,220 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/array-fpi/sina2.c [2023-11-29 00:50:11,026 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 00:50:11,217 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 00:50:11,218 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/sv-benchmarks/c/array-fpi/sina2.c [2023-11-29 00:50:11,226 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/data/6b2e82f4f/c558ccf401ec4e50b3519f7eb4d53b9f/FLAG2384febc0 [2023-11-29 00:50:11,242 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/data/6b2e82f4f/c558ccf401ec4e50b3519f7eb4d53b9f [2023-11-29 00:50:11,245 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 00:50:11,246 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 00:50:11,248 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 00:50:11,248 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 00:50:11,253 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 00:50:11,254 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:50:11" (1/1) ... [2023-11-29 00:50:11,255 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a45c4cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:50:11, skipping insertion in model container [2023-11-29 00:50:11,256 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:50:11" (1/1) ... [2023-11-29 00:50:11,277 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 00:50:11,437 WARN L240 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_16138067-b194-4902-9c67-ea14b1029cf2/sv-benchmarks/c/array-fpi/sina2.c[588,601] [2023-11-29 00:50:11,460 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:50:11,475 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 00:50:11,490 WARN L240 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_16138067-b194-4902-9c67-ea14b1029cf2/sv-benchmarks/c/array-fpi/sina2.c[588,601] [2023-11-29 00:50:11,499 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:50:11,517 INFO L206 MainTranslator]: Completed translation [2023-11-29 00:50:11,517 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:50:11 WrapperNode [2023-11-29 00:50:11,518 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 00:50:11,519 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 00:50:11,519 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 00:50:11,519 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 00:50:11,527 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:50:11" (1/1) ... [2023-11-29 00:50:11,536 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:50:11" (1/1) ... [2023-11-29 00:50:11,560 INFO L138 Inliner]: procedures = 19, calls = 30, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 91 [2023-11-29 00:50:11,560 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 00:50:11,561 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 00:50:11,561 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 00:50:11,562 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 00:50:11,573 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:50:11" (1/1) ... [2023-11-29 00:50:11,573 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:50:11" (1/1) ... [2023-11-29 00:50:11,577 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:50:11" (1/1) ... [2023-11-29 00:50:11,592 INFO L175 MemorySlicer]: Split 19 memory accesses to 4 slices as follows [2, 8, 5, 4]. 42 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8, 0, 0]. The 4 writes are split as follows [0, 0, 2, 2]. [2023-11-29 00:50:11,593 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:50:11" (1/1) ... [2023-11-29 00:50:11,593 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:50:11" (1/1) ... [2023-11-29 00:50:11,601 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:50:11" (1/1) ... [2023-11-29 00:50:11,605 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:50:11" (1/1) ... [2023-11-29 00:50:11,607 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:50:11" (1/1) ... [2023-11-29 00:50:11,609 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:50:11" (1/1) ... [2023-11-29 00:50:11,612 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 00:50:11,613 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 00:50:11,613 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 00:50:11,614 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 00:50:11,614 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:50:11" (1/1) ... [2023-11-29 00:50:11,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:50:11,633 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:50:11,646 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 00:50:11,657 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 00:50:11,691 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 00:50:11,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 00:50:11,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-29 00:50:11,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-29 00:50:11,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-11-29 00:50:11,700 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 00:50:11,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#0 [2023-11-29 00:50:11,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#1 [2023-11-29 00:50:11,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#2 [2023-11-29 00:50:11,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#3 [2023-11-29 00:50:11,701 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 00:50:11,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 00:50:11,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 00:50:11,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#0 [2023-11-29 00:50:11,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#1 [2023-11-29 00:50:11,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#2 [2023-11-29 00:50:11,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#3 [2023-11-29 00:50:11,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 00:50:11,792 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 00:50:11,795 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 00:50:11,986 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 00:50:12,023 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 00:50:12,023 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-29 00:50:12,024 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:50:12 BoogieIcfgContainer [2023-11-29 00:50:12,024 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 00:50:12,026 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 00:50:12,027 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 00:50:12,030 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 00:50:12,030 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 12:50:11" (1/3) ... [2023-11-29 00:50:12,031 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2038a613 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:50:12, skipping insertion in model container [2023-11-29 00:50:12,031 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:50:11" (2/3) ... [2023-11-29 00:50:12,031 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2038a613 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:50:12, skipping insertion in model container [2023-11-29 00:50:12,032 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:50:12" (3/3) ... [2023-11-29 00:50:12,033 INFO L112 eAbstractionObserver]: Analyzing ICFG sina2.c [2023-11-29 00:50:12,052 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 00:50:12,053 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 00:50:12,099 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 00:50:12,106 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=LoopHeads, 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;@13165c3a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 00:50:12,106 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 00:50:12,111 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 16 states have (on average 1.75) internal successors, (28), 17 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:50:12,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-29 00:50:12,117 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:50:12,118 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:50:12,118 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:50:12,123 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:50:12,124 INFO L85 PathProgramCache]: Analyzing trace with hash -895324270, now seen corresponding path program 1 times [2023-11-29 00:50:12,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:50:12,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2048058935] [2023-11-29 00:50:12,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:50:12,137 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:50:12,138 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:50:12,161 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:50:12,167 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-29 00:50:12,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:50:12,252 INFO L262 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-29 00:50:12,256 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:50:12,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:50:12,272 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:50:12,272 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:50:12,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2048058935] [2023-11-29 00:50:12,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2048058935] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:50:12,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:50:12,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:50:12,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183360132] [2023-11-29 00:50:12,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:50:12,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 00:50:12,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:50:12,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 00:50:12,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 00:50:12,307 INFO L87 Difference]: Start difference. First operand has 18 states, 16 states have (on average 1.75) internal successors, (28), 17 states have internal predecessors, (28), 0 states have call successors, (0), 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 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:50:12,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:50:12,367 INFO L93 Difference]: Finished difference Result 33 states and 51 transitions. [2023-11-29 00:50:12,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 00:50:12,370 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2023-11-29 00:50:12,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:50:12,377 INFO L225 Difference]: With dead ends: 33 [2023-11-29 00:50:12,377 INFO L226 Difference]: Without dead ends: 15 [2023-11-29 00:50:12,379 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 00:50:12,384 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:50:12,385 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 16 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:50:12,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2023-11-29 00:50:12,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2023-11-29 00:50:12,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:50:12,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2023-11-29 00:50:12,415 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 18 transitions. Word has length 13 [2023-11-29 00:50:12,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:50:12,415 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 18 transitions. [2023-11-29 00:50:12,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:50:12,416 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 18 transitions. [2023-11-29 00:50:12,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-29 00:50:12,416 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:50:12,416 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:50:12,420 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-29 00:50:12,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:50:12,618 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:50:12,618 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:50:12,618 INFO L85 PathProgramCache]: Analyzing trace with hash -194259692, now seen corresponding path program 1 times [2023-11-29 00:50:12,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:50:12,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1669282846] [2023-11-29 00:50:12,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:50:12,620 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:50:12,620 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:50:12,621 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:50:12,624 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-29 00:50:12,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:50:12,703 INFO L262 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 00:50:12,705 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:50:12,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:50:12,842 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:50:12,842 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:50:12,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1669282846] [2023-11-29 00:50:12,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1669282846] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:50:12,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:50:12,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:50:12,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829517198] [2023-11-29 00:50:12,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:50:12,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:50:12,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:50:12,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:50:12,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:50:12,846 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:50:12,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:50:12,958 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2023-11-29 00:50:12,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:50:12,960 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2023-11-29 00:50:12,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:50:12,960 INFO L225 Difference]: With dead ends: 33 [2023-11-29 00:50:12,961 INFO L226 Difference]: Without dead ends: 23 [2023-11-29 00:50:12,961 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:50:12,963 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 27 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:50:12,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 16 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 00:50:12,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-11-29 00:50:12,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 18. [2023-11-29 00:50:12,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:50:12,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2023-11-29 00:50:12,970 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 13 [2023-11-29 00:50:12,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:50:12,970 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2023-11-29 00:50:12,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:50:12,971 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2023-11-29 00:50:12,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-29 00:50:12,972 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:50:12,972 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:50:12,974 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-11-29 00:50:13,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:50:13,175 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:50:13,175 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:50:13,176 INFO L85 PathProgramCache]: Analyzing trace with hash -925805478, now seen corresponding path program 1 times [2023-11-29 00:50:13,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:50:13,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2141489181] [2023-11-29 00:50:13,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:50:13,177 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:50:13,177 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:50:13,178 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:50:13,179 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-29 00:50:13,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:50:13,304 INFO L262 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 30 conjunts are in the unsatisfiable core [2023-11-29 00:50:13,308 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:50:13,419 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 00:50:13,426 INFO L378 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 16 treesize of output 17 [2023-11-29 00:50:13,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:50:13,505 INFO L378 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 16 treesize of output 17 [2023-11-29 00:50:13,856 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:50:13,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 53 [2023-11-29 00:50:14,151 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:50:14,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 85 [2023-11-29 00:50:14,162 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:50:14,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 61 [2023-11-29 00:50:14,353 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:50:14,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 119 treesize of output 95 [2023-11-29 00:50:14,391 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:50:14,391 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:50:15,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 354 treesize of output 330 [2023-11-29 00:50:15,932 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:50:15,932 INFO L378 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 1946 treesize of output 1802 [2023-11-29 00:50:18,087 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:50:18,087 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:50:18,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2141489181] [2023-11-29 00:50:18,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2141489181] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:50:18,087 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:50:18,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2023-11-29 00:50:18,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671482416] [2023-11-29 00:50:18,088 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:50:18,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-11-29 00:50:18,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:50:18,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-11-29 00:50:18,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=455, Unknown=0, NotChecked=0, Total=552 [2023-11-29 00:50:18,091 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 24 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:50:24,102 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 00:50:27,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:50:27,327 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2023-11-29 00:50:27,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-29 00:50:27,327 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-11-29 00:50:27,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:50:27,328 INFO L225 Difference]: With dead ends: 44 [2023-11-29 00:50:27,328 INFO L226 Difference]: Without dead ends: 42 [2023-11-29 00:50:27,329 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=209, Invalid=913, Unknown=0, NotChecked=0, Total=1122 [2023-11-29 00:50:27,330 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 52 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2023-11-29 00:50:27,331 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 86 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 274 Invalid, 1 Unknown, 0 Unchecked, 5.8s Time] [2023-11-29 00:50:27,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-11-29 00:50:27,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 29. [2023-11-29 00:50:27,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:50:27,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2023-11-29 00:50:27,340 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 16 [2023-11-29 00:50:27,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:50:27,340 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2023-11-29 00:50:27,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:50:27,341 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2023-11-29 00:50:27,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-29 00:50:27,341 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:50:27,342 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:50:27,349 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-11-29 00:50:27,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:50:27,543 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:50:27,543 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:50:27,543 INFO L85 PathProgramCache]: Analyzing trace with hash -2031512559, now seen corresponding path program 2 times [2023-11-29 00:50:27,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:50:27,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [520043262] [2023-11-29 00:50:27,544 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 00:50:27,544 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:50:27,544 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:50:27,545 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:50:27,546 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-29 00:50:27,628 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 00:50:27,628 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:50:27,632 INFO L262 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-29 00:50:27,633 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:50:27,786 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 00:50:27,786 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:50:27,906 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 00:50:27,906 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:50:27,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [520043262] [2023-11-29 00:50:27,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [520043262] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:50:27,907 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:50:27,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2023-11-29 00:50:27,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016408830] [2023-11-29 00:50:27,907 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:50:27,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-29 00:50:27,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:50:27,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 00:50:27,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2023-11-29 00:50:27,909 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:50:28,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:50:28,283 INFO L93 Difference]: Finished difference Result 64 states and 76 transitions. [2023-11-29 00:50:28,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 00:50:28,283 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 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 17 [2023-11-29 00:50:28,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:50:28,284 INFO L225 Difference]: With dead ends: 64 [2023-11-29 00:50:28,284 INFO L226 Difference]: Without dead ends: 39 [2023-11-29 00:50:28,285 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2023-11-29 00:50:28,286 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 37 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 00:50:28,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 67 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 00:50:28,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-11-29 00:50:28,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 27. [2023-11-29 00:50:28,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:50:28,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2023-11-29 00:50:28,296 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 17 [2023-11-29 00:50:28,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:50:28,297 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2023-11-29 00:50:28,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:50:28,297 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2023-11-29 00:50:28,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-29 00:50:28,298 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:50:28,298 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:50:28,301 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-11-29 00:50:28,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:50:28,499 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:50:28,499 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:50:28,499 INFO L85 PathProgramCache]: Analyzing trace with hash -2030966525, now seen corresponding path program 3 times [2023-11-29 00:50:28,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:50:28,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1045267646] [2023-11-29 00:50:28,500 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 00:50:28,500 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:50:28,500 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:50:28,501 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:50:28,502 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-29 00:50:28,580 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-29 00:50:28,580 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:50:28,583 INFO L262 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-29 00:50:28,585 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:50:28,754 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 00:50:28,754 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:50:28,923 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 00:50:28,923 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:50:28,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1045267646] [2023-11-29 00:50:28,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1045267646] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:50:28,924 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:50:28,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2023-11-29 00:50:28,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824665805] [2023-11-29 00:50:28,924 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:50:28,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-29 00:50:28,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:50:28,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-29 00:50:28,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2023-11-29 00:50:28,926 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand has 16 states, 16 states have (on average 1.625) internal successors, (26), 16 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:50:29,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:50:29,340 INFO L93 Difference]: Finished difference Result 76 states and 91 transitions. [2023-11-29 00:50:29,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 00:50:29,341 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.625) internal successors, (26), 16 states have internal predecessors, (26), 0 states have call successors, (0), 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 17 [2023-11-29 00:50:29,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:50:29,342 INFO L225 Difference]: With dead ends: 76 [2023-11-29 00:50:29,342 INFO L226 Difference]: Without dead ends: 57 [2023-11-29 00:50:29,342 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2023-11-29 00:50:29,343 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 142 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 00:50:29,344 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 64 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 00:50:29,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-11-29 00:50:29,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 38. [2023-11-29 00:50:29,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 37 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:50:29,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2023-11-29 00:50:29,354 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 17 [2023-11-29 00:50:29,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:50:29,355 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2023-11-29 00:50:29,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.625) internal successors, (26), 16 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:50:29,355 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2023-11-29 00:50:29,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-29 00:50:29,355 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:50:29,355 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:50:29,358 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-11-29 00:50:29,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:50:29,556 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:50:29,556 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:50:29,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1382312724, now seen corresponding path program 4 times [2023-11-29 00:50:29,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:50:29,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [330633604] [2023-11-29 00:50:29,557 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 00:50:29,557 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:50:29,557 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:50:29,558 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:50:29,559 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-11-29 00:50:29,676 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 00:50:29,676 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:50:29,682 INFO L262 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 42 conjunts are in the unsatisfiable core [2023-11-29 00:50:29,687 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:50:29,742 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 00:50:29,744 INFO L378 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 16 treesize of output 17 [2023-11-29 00:50:29,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:50:29,803 INFO L378 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 16 treesize of output 17 [2023-11-29 00:50:29,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:50:29,915 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:50:29,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 39 [2023-11-29 00:50:30,304 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:50:30,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 53 [2023-11-29 00:50:30,469 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:50:30,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 85 [2023-11-29 00:50:30,790 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:50:30,790 INFO L378 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 6 case distinctions, treesize of input 205 treesize of output 139 [2023-11-29 00:50:30,807 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:50:30,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 131 treesize of output 107 [2023-11-29 00:50:30,903 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:50:30,903 INFO L378 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 6 case distinctions, treesize of input 207 treesize of output 167 [2023-11-29 00:50:31,060 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:50:31,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 199 treesize of output 175 [2023-11-29 00:50:31,088 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:50:31,088 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:50:35,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1314 treesize of output 1258 [2023-11-29 00:50:36,169 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:50:36,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 15569410782 treesize of output 15183534814 [2023-11-29 00:50:54,008 WARN L876 $PredicateComparison]: unable to prove that (or (let ((.cse8 ((_ extract 63 32) (_ bv1 64))) (.cse12 ((_ extract 31 0) (_ bv1 64)))) (let ((.cse25 (concat .cse8 .cse12)) (.cse6 (let ((.cse434 (select |c_#memory_int#3| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (concat (select .cse434 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (select .cse434 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (.cse415 (bvmul (_ bv8 32) |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse418 (= .cse415 (_ bv0 32))) (.cse0 (= (_ bv8 32) .cse415)) (.cse19 (concat .cse12 .cse8)) (.cse1 ((_ sign_extend 32) (bvadd c_~N~0 (_ bv1 32)))) (.cse24 (let ((.cse433 (bvadd .cse25 .cse6))) (concat ((_ extract 63 32) .cse433) ((_ extract 31 0) .cse433))))) (let ((.cse98 (forall ((v_arrayElimCell_31 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32))) (= .cse1 (let ((.cse431 (bvadd (let ((.cse432 (bvadd (concat v_arrayElimCell_31 v_arrayElimCell_34) .cse24))) (concat ((_ extract 63 32) .cse432) ((_ extract 31 0) .cse432))) .cse25))) (concat ((_ extract 63 32) .cse431) ((_ extract 31 0) .cse431)))))) (.cse232 (forall ((v_arrayElimCell_32 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (or (= (let ((.cse423 (let ((.cse424 (concat .cse12 v_arrayElimCell_32))) (bvadd .cse424 (let ((.cse425 (bvadd .cse19 (let ((.cse426 (bvadd .cse424 .cse6))) (concat ((_ extract 63 32) .cse426) ((_ extract 31 0) .cse426)))))) (concat ((_ extract 63 32) .cse425) ((_ extract 31 0) .cse425))))))) (concat ((_ extract 63 32) .cse423) ((_ extract 31 0) .cse423))) .cse1) (= (let ((.cse427 (let ((.cse430 (concat v_arrayElimCell_33 v_arrayElimCell_32))) (bvadd (let ((.cse428 (bvadd (let ((.cse429 (bvadd .cse6 .cse430))) (concat ((_ extract 63 32) .cse429) ((_ extract 31 0) .cse429))) .cse25))) (concat ((_ extract 63 32) .cse428) ((_ extract 31 0) .cse428))) .cse430)))) (concat ((_ extract 63 32) .cse427) ((_ extract 31 0) .cse427))) .cse1)))) (.cse142 (forall ((v_arrayElimCell_32 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (= (let ((.cse419 (let ((.cse422 (concat v_arrayElimCell_33 v_arrayElimCell_32))) (bvadd (let ((.cse420 (bvadd (let ((.cse421 (bvadd .cse6 .cse422))) (concat ((_ extract 63 32) .cse421) ((_ extract 31 0) .cse421))) .cse25))) (concat ((_ extract 63 32) .cse420) ((_ extract 31 0) .cse420))) .cse422)))) (concat ((_ extract 63 32) .cse419) ((_ extract 31 0) .cse419))) .cse1))) (.cse143 (not .cse0)) (.cse99 (not .cse418)) (.cse233 (and (= (let ((.cse416 (bvadd .cse25 (let ((.cse417 (bvadd .cse25 .cse24))) (concat ((_ extract 63 32) .cse417) ((_ extract 31 0) .cse417)))))) (concat ((_ extract 63 32) .cse416) ((_ extract 31 0) .cse416))) .cse1) .cse418)) (.cse234 (= (bvadd (_ bv8 32) .cse415) (_ bv0 32)))) (and (or (and (or .cse0 (and (forall ((v_arrayElimCell_31 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32))) (let ((.cse4 (concat v_arrayElimCell_31 v_arrayElimCell_34))) (or (forall ((v_arrayElimCell_33 (_ BitVec 32))) (or (= .cse1 (let ((.cse2 (let ((.cse7 (concat v_arrayElimCell_33 .cse8))) (bvadd (let ((.cse3 (bvadd .cse4 (let ((.cse5 (bvadd .cse6 .cse7))) (concat ((_ extract 63 32) .cse5) ((_ extract 31 0) .cse5)))))) (concat ((_ extract 63 32) .cse3) ((_ extract 31 0) .cse3))) .cse7)))) (concat ((_ extract 63 32) .cse2) ((_ extract 31 0) .cse2)))) (forall ((v_arrayElimCell_32 (_ BitVec 32))) (let ((.cse13 (concat v_arrayElimCell_33 v_arrayElimCell_32))) (let ((.cse11 (let ((.cse21 (bvadd .cse6 .cse13))) (concat ((_ extract 63 32) .cse21) ((_ extract 31 0) .cse21))))) (or (= (let ((.cse9 (bvadd (let ((.cse10 (bvadd .cse11 (concat .cse12 v_arrayElimCell_34)))) (concat ((_ extract 63 32) .cse10) ((_ extract 31 0) .cse10))) .cse13))) (concat ((_ extract 63 32) .cse9) ((_ extract 31 0) .cse9))) .cse1) (= (let ((.cse14 (bvadd (let ((.cse15 (bvadd .cse11 .cse4))) (concat ((_ extract 63 32) .cse15) ((_ extract 31 0) .cse15))) .cse13))) (concat ((_ extract 63 32) .cse14) ((_ extract 31 0) .cse14))) .cse1) (= (let ((.cse16 (let ((.cse17 (concat .cse12 v_arrayElimCell_32))) (bvadd .cse17 (let ((.cse18 (bvadd .cse19 (let ((.cse20 (bvadd .cse17 .cse6))) (concat ((_ extract 63 32) .cse20) ((_ extract 31 0) .cse20)))))) (concat ((_ extract 63 32) .cse18) ((_ extract 31 0) .cse18))))))) (concat ((_ extract 63 32) .cse16) ((_ extract 31 0) .cse16))) .cse1))))))) (= .cse1 (let ((.cse22 (bvadd (let ((.cse23 (bvadd .cse4 .cse24))) (concat ((_ extract 63 32) .cse23) ((_ extract 31 0) .cse23))) .cse25))) (concat ((_ extract 63 32) .cse22) ((_ extract 31 0) .cse22))))))) (forall ((v_arrayElimCell_31 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32))) (let ((.cse28 (concat v_arrayElimCell_31 v_arrayElimCell_34))) (or (= .cse1 (let ((.cse26 (bvadd (let ((.cse27 (bvadd .cse28 .cse24))) (concat ((_ extract 63 32) .cse27) ((_ extract 31 0) .cse27))) .cse25))) (concat ((_ extract 63 32) .cse26) ((_ extract 31 0) .cse26)))) (forall ((v_arrayElimCell_32 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (or (= (let ((.cse29 (let ((.cse32 (concat v_arrayElimCell_33 v_arrayElimCell_32))) (bvadd (let ((.cse30 (bvadd (let ((.cse31 (bvadd .cse6 .cse32))) (concat ((_ extract 63 32) .cse31) ((_ extract 31 0) .cse31))) .cse28))) (concat ((_ extract 63 32) .cse30) ((_ extract 31 0) .cse30))) .cse32)))) (concat ((_ extract 63 32) .cse29) ((_ extract 31 0) .cse29))) .cse1) (= (let ((.cse33 (let ((.cse34 (concat .cse12 v_arrayElimCell_32))) (bvadd .cse34 (let ((.cse35 (bvadd .cse19 (let ((.cse36 (bvadd .cse34 .cse6))) (concat ((_ extract 63 32) .cse36) ((_ extract 31 0) .cse36)))))) (concat ((_ extract 63 32) .cse35) ((_ extract 31 0) .cse35))))))) (concat ((_ extract 63 32) .cse33) ((_ extract 31 0) .cse33))) .cse1)))))) (forall ((v_arrayElimCell_31 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32))) (let ((.cse39 (concat v_arrayElimCell_31 v_arrayElimCell_34))) (or (forall ((v_arrayElimCell_33 (_ BitVec 32))) (or (= .cse1 (let ((.cse37 (let ((.cse41 (concat v_arrayElimCell_33 .cse8))) (bvadd (let ((.cse38 (bvadd .cse39 (let ((.cse40 (bvadd .cse6 .cse41))) (concat ((_ extract 63 32) .cse40) ((_ extract 31 0) .cse40)))))) (concat ((_ extract 63 32) .cse38) ((_ extract 31 0) .cse38))) .cse41)))) (concat ((_ extract 63 32) .cse37) ((_ extract 31 0) .cse37)))) (forall ((v_arrayElimCell_32 (_ BitVec 32))) (or (= (let ((.cse42 (let ((.cse45 (concat v_arrayElimCell_33 v_arrayElimCell_32))) (bvadd (let ((.cse43 (bvadd (let ((.cse44 (bvadd .cse6 .cse45))) (concat ((_ extract 63 32) .cse44) ((_ extract 31 0) .cse44))) .cse39))) (concat ((_ extract 63 32) .cse43) ((_ extract 31 0) .cse43))) .cse45)))) (concat ((_ extract 63 32) .cse42) ((_ extract 31 0) .cse42))) .cse1) (= (let ((.cse46 (let ((.cse47 (concat .cse12 v_arrayElimCell_32))) (bvadd .cse47 (let ((.cse48 (bvadd .cse19 (let ((.cse49 (bvadd .cse47 .cse6))) (concat ((_ extract 63 32) .cse49) ((_ extract 31 0) .cse49)))))) (concat ((_ extract 63 32) .cse48) ((_ extract 31 0) .cse48))))))) (concat ((_ extract 63 32) .cse46) ((_ extract 31 0) .cse46))) .cse1))))) (= .cse1 (let ((.cse50 (bvadd (let ((.cse51 (bvadd .cse39 .cse24))) (concat ((_ extract 63 32) .cse51) ((_ extract 31 0) .cse51))) .cse25))) (concat ((_ extract 63 32) .cse50) ((_ extract 31 0) .cse50))))))) (forall ((v_arrayElimCell_31 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32))) (let ((.cse54 (concat v_arrayElimCell_31 v_arrayElimCell_34))) (or (= .cse1 (let ((.cse52 (bvadd (let ((.cse53 (bvadd .cse54 .cse24))) (concat ((_ extract 63 32) .cse53) ((_ extract 31 0) .cse53))) .cse25))) (concat ((_ extract 63 32) .cse52) ((_ extract 31 0) .cse52)))) (forall ((v_arrayElimCell_32 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse58 (concat v_arrayElimCell_33 v_arrayElimCell_32))) (let ((.cse57 (let ((.cse65 (bvadd .cse6 .cse58))) (concat ((_ extract 63 32) .cse65) ((_ extract 31 0) .cse65))))) (or (= (let ((.cse55 (bvadd (let ((.cse56 (bvadd .cse57 (concat .cse12 v_arrayElimCell_34)))) (concat ((_ extract 63 32) .cse56) ((_ extract 31 0) .cse56))) .cse58))) (concat ((_ extract 63 32) .cse55) ((_ extract 31 0) .cse55))) .cse1) (= (let ((.cse59 (bvadd (let ((.cse60 (bvadd .cse57 .cse54))) (concat ((_ extract 63 32) .cse60) ((_ extract 31 0) .cse60))) .cse58))) (concat ((_ extract 63 32) .cse59) ((_ extract 31 0) .cse59))) .cse1) (= (let ((.cse61 (let ((.cse62 (concat .cse12 v_arrayElimCell_32))) (bvadd .cse62 (let ((.cse63 (bvadd .cse19 (let ((.cse64 (bvadd .cse62 .cse6))) (concat ((_ extract 63 32) .cse64) ((_ extract 31 0) .cse64)))))) (concat ((_ extract 63 32) .cse63) ((_ extract 31 0) .cse63))))))) (concat ((_ extract 63 32) .cse61) ((_ extract 31 0) .cse61))) .cse1)))))))))) (forall ((v_arrayElimCell_31 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32))) (let ((.cse68 (concat v_arrayElimCell_31 v_arrayElimCell_34))) (or (= .cse1 (let ((.cse66 (bvadd (let ((.cse67 (bvadd .cse68 .cse24))) (concat ((_ extract 63 32) .cse67) ((_ extract 31 0) .cse67))) .cse25))) (concat ((_ extract 63 32) .cse66) ((_ extract 31 0) .cse66)))) (forall ((v_arrayElimCell_32 (_ BitVec 32))) (or (forall ((v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse72 (concat v_arrayElimCell_33 v_arrayElimCell_32))) (let ((.cse71 (let ((.cse77 (bvadd .cse6 .cse72))) (concat ((_ extract 63 32) .cse77) ((_ extract 31 0) .cse77))))) (or (= (let ((.cse69 (bvadd (let ((.cse70 (bvadd .cse71 (concat .cse12 v_arrayElimCell_34)))) (concat ((_ extract 63 32) .cse70) ((_ extract 31 0) .cse70))) .cse72))) (concat ((_ extract 63 32) .cse69) ((_ extract 31 0) .cse69))) .cse1) (= (let ((.cse73 (bvadd (let ((.cse74 (bvadd .cse71 .cse68))) (concat ((_ extract 63 32) .cse74) ((_ extract 31 0) .cse74))) .cse72))) (concat ((_ extract 63 32) .cse73) ((_ extract 31 0) .cse73))) .cse1) (= (let ((.cse75 (bvadd (let ((.cse76 (bvadd .cse71 .cse25))) (concat ((_ extract 63 32) .cse76) ((_ extract 31 0) .cse76))) .cse72))) (concat ((_ extract 63 32) .cse75) ((_ extract 31 0) .cse75))) .cse1))))) (= (let ((.cse78 (let ((.cse79 (concat .cse12 v_arrayElimCell_32))) (bvadd .cse79 (let ((.cse80 (bvadd .cse19 (let ((.cse81 (bvadd .cse79 .cse6))) (concat ((_ extract 63 32) .cse81) ((_ extract 31 0) .cse81)))))) (concat ((_ extract 63 32) .cse80) ((_ extract 31 0) .cse80))))))) (concat ((_ extract 63 32) .cse78) ((_ extract 31 0) .cse78))) .cse1)))))) (forall ((v_arrayElimCell_31 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32))) (let ((.cse88 (concat v_arrayElimCell_31 v_arrayElimCell_34))) (or (forall ((v_arrayElimCell_32 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse85 (concat v_arrayElimCell_33 v_arrayElimCell_32))) (let ((.cse84 (let ((.cse95 (bvadd .cse6 .cse85))) (concat ((_ extract 63 32) .cse95) ((_ extract 31 0) .cse95))))) (or (= (let ((.cse82 (bvadd (let ((.cse83 (bvadd .cse84 (concat .cse12 v_arrayElimCell_34)))) (concat ((_ extract 63 32) .cse83) ((_ extract 31 0) .cse83))) .cse85))) (concat ((_ extract 63 32) .cse82) ((_ extract 31 0) .cse82))) .cse1) (= (let ((.cse86 (bvadd (let ((.cse87 (bvadd .cse84 .cse88))) (concat ((_ extract 63 32) .cse87) ((_ extract 31 0) .cse87))) .cse85))) (concat ((_ extract 63 32) .cse86) ((_ extract 31 0) .cse86))) .cse1) (= .cse1 (let ((.cse89 (let ((.cse92 (concat v_arrayElimCell_33 .cse8))) (bvadd (let ((.cse90 (bvadd .cse88 (let ((.cse91 (bvadd .cse6 .cse92))) (concat ((_ extract 63 32) .cse91) ((_ extract 31 0) .cse91)))))) (concat ((_ extract 63 32) .cse90) ((_ extract 31 0) .cse90))) .cse92)))) (concat ((_ extract 63 32) .cse89) ((_ extract 31 0) .cse89)))) (= (let ((.cse93 (bvadd (let ((.cse94 (bvadd .cse84 .cse25))) (concat ((_ extract 63 32) .cse94) ((_ extract 31 0) .cse94))) .cse85))) (concat ((_ extract 63 32) .cse93) ((_ extract 31 0) .cse93))) .cse1))))) (= .cse1 (let ((.cse96 (bvadd (let ((.cse97 (bvadd .cse88 .cse24))) (concat ((_ extract 63 32) .cse97) ((_ extract 31 0) .cse97))) .cse25))) (concat ((_ extract 63 32) .cse96) ((_ extract 31 0) .cse96))))))) (or .cse98 .cse99) (or (and (forall ((v_arrayElimCell_31 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32))) (let ((.cse102 (concat v_arrayElimCell_31 v_arrayElimCell_34))) (or (= .cse1 (let ((.cse100 (bvadd (let ((.cse101 (bvadd .cse102 .cse24))) (concat ((_ extract 63 32) .cse101) ((_ extract 31 0) .cse101))) .cse25))) (concat ((_ extract 63 32) .cse100) ((_ extract 31 0) .cse100)))) (forall ((v_arrayElimCell_32 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (= (let ((.cse103 (let ((.cse106 (concat v_arrayElimCell_33 v_arrayElimCell_32))) (bvadd (let ((.cse104 (bvadd (let ((.cse105 (bvadd .cse6 .cse106))) (concat ((_ extract 63 32) .cse105) ((_ extract 31 0) .cse105))) .cse102))) (concat ((_ extract 63 32) .cse104) ((_ extract 31 0) .cse104))) .cse106)))) (concat ((_ extract 63 32) .cse103) ((_ extract 31 0) .cse103))) .cse1))))) (forall ((v_arrayElimCell_31 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32))) (let ((.cse109 (concat v_arrayElimCell_31 v_arrayElimCell_34))) (or (= .cse1 (let ((.cse107 (bvadd (let ((.cse108 (bvadd .cse109 .cse24))) (concat ((_ extract 63 32) .cse108) ((_ extract 31 0) .cse108))) .cse25))) (concat ((_ extract 63 32) .cse107) ((_ extract 31 0) .cse107)))) (forall ((v_arrayElimCell_33 (_ BitVec 32))) (or (= .cse1 (let ((.cse110 (let ((.cse113 (concat v_arrayElimCell_33 .cse8))) (bvadd (let ((.cse111 (bvadd .cse109 (let ((.cse112 (bvadd .cse6 .cse113))) (concat ((_ extract 63 32) .cse112) ((_ extract 31 0) .cse112)))))) (concat ((_ extract 63 32) .cse111) ((_ extract 31 0) .cse111))) .cse113)))) (concat ((_ extract 63 32) .cse110) ((_ extract 31 0) .cse110)))) (forall ((v_arrayElimCell_32 (_ BitVec 32))) (let ((.cse117 (concat v_arrayElimCell_33 v_arrayElimCell_32))) (let ((.cse116 (let ((.cse120 (bvadd .cse6 .cse117))) (concat ((_ extract 63 32) .cse120) ((_ extract 31 0) .cse120))))) (or (= (let ((.cse114 (bvadd (let ((.cse115 (bvadd .cse116 (concat .cse12 v_arrayElimCell_34)))) (concat ((_ extract 63 32) .cse115) ((_ extract 31 0) .cse115))) .cse117))) (concat ((_ extract 63 32) .cse114) ((_ extract 31 0) .cse114))) .cse1) (= (let ((.cse118 (bvadd (let ((.cse119 (bvadd .cse116 .cse109))) (concat ((_ extract 63 32) .cse119) ((_ extract 31 0) .cse119))) .cse117))) (concat ((_ extract 63 32) .cse118) ((_ extract 31 0) .cse118))) .cse1)))))))))) (forall ((v_arrayElimCell_31 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32))) (let ((.cse123 (concat v_arrayElimCell_31 v_arrayElimCell_34))) (or (= .cse1 (let ((.cse121 (bvadd (let ((.cse122 (bvadd .cse123 .cse24))) (concat ((_ extract 63 32) .cse122) ((_ extract 31 0) .cse122))) .cse25))) (concat ((_ extract 63 32) .cse121) ((_ extract 31 0) .cse121)))) (forall ((v_arrayElimCell_32 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse127 (concat v_arrayElimCell_33 v_arrayElimCell_32))) (let ((.cse126 (let ((.cse130 (bvadd .cse6 .cse127))) (concat ((_ extract 63 32) .cse130) ((_ extract 31 0) .cse130))))) (or (= (let ((.cse124 (bvadd (let ((.cse125 (bvadd .cse126 (concat .cse12 v_arrayElimCell_34)))) (concat ((_ extract 63 32) .cse125) ((_ extract 31 0) .cse125))) .cse127))) (concat ((_ extract 63 32) .cse124) ((_ extract 31 0) .cse124))) .cse1) (= (let ((.cse128 (bvadd (let ((.cse129 (bvadd .cse126 .cse123))) (concat ((_ extract 63 32) .cse129) ((_ extract 31 0) .cse129))) .cse127))) (concat ((_ extract 63 32) .cse128) ((_ extract 31 0) .cse128))) .cse1)))))))) (forall ((v_arrayElimCell_31 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32))) (let ((.cse133 (concat v_arrayElimCell_31 v_arrayElimCell_34))) (or (forall ((v_arrayElimCell_33 (_ BitVec 32))) (or (= .cse1 (let ((.cse131 (let ((.cse135 (concat v_arrayElimCell_33 .cse8))) (bvadd (let ((.cse132 (bvadd .cse133 (let ((.cse134 (bvadd .cse6 .cse135))) (concat ((_ extract 63 32) .cse134) ((_ extract 31 0) .cse134)))))) (concat ((_ extract 63 32) .cse132) ((_ extract 31 0) .cse132))) .cse135)))) (concat ((_ extract 63 32) .cse131) ((_ extract 31 0) .cse131)))) (forall ((v_arrayElimCell_32 (_ BitVec 32))) (= (let ((.cse136 (let ((.cse139 (concat v_arrayElimCell_33 v_arrayElimCell_32))) (bvadd (let ((.cse137 (bvadd (let ((.cse138 (bvadd .cse6 .cse139))) (concat ((_ extract 63 32) .cse138) ((_ extract 31 0) .cse138))) .cse133))) (concat ((_ extract 63 32) .cse137) ((_ extract 31 0) .cse137))) .cse139)))) (concat ((_ extract 63 32) .cse136) ((_ extract 31 0) .cse136))) .cse1)))) (= .cse1 (let ((.cse140 (bvadd (let ((.cse141 (bvadd .cse133 .cse24))) (concat ((_ extract 63 32) .cse141) ((_ extract 31 0) .cse141))) .cse25))) (concat ((_ extract 63 32) .cse140) ((_ extract 31 0) .cse140)))))))) .cse0) (or .cse98 .cse142 .cse143) (forall ((v_arrayElimCell_31 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32))) (let ((.cse146 (concat v_arrayElimCell_31 v_arrayElimCell_34))) (or (= .cse1 (let ((.cse144 (bvadd (let ((.cse145 (bvadd .cse146 .cse24))) (concat ((_ extract 63 32) .cse145) ((_ extract 31 0) .cse145))) .cse25))) (concat ((_ extract 63 32) .cse144) ((_ extract 31 0) .cse144)))) (forall ((v_arrayElimCell_32 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse150 (concat v_arrayElimCell_33 v_arrayElimCell_32))) (let ((.cse149 (let ((.cse157 (bvadd .cse6 .cse150))) (concat ((_ extract 63 32) .cse157) ((_ extract 31 0) .cse157))))) (or (= (let ((.cse147 (bvadd (let ((.cse148 (bvadd .cse149 .cse146))) (concat ((_ extract 63 32) .cse148) ((_ extract 31 0) .cse148))) .cse150))) (concat ((_ extract 63 32) .cse147) ((_ extract 31 0) .cse147))) .cse1) (= .cse1 (let ((.cse151 (let ((.cse154 (concat v_arrayElimCell_33 .cse8))) (bvadd (let ((.cse152 (bvadd .cse146 (let ((.cse153 (bvadd .cse6 .cse154))) (concat ((_ extract 63 32) .cse153) ((_ extract 31 0) .cse153)))))) (concat ((_ extract 63 32) .cse152) ((_ extract 31 0) .cse152))) .cse154)))) (concat ((_ extract 63 32) .cse151) ((_ extract 31 0) .cse151)))) (= (let ((.cse155 (bvadd (let ((.cse156 (bvadd .cse149 .cse25))) (concat ((_ extract 63 32) .cse156) ((_ extract 31 0) .cse156))) .cse150))) (concat ((_ extract 63 32) .cse155) ((_ extract 31 0) .cse155))) .cse1)))))))) (forall ((v_arrayElimCell_31 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32))) (let ((.cse161 (concat v_arrayElimCell_31 v_arrayElimCell_34))) (or (forall ((v_arrayElimCell_32 (_ BitVec 32))) (or (forall ((v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse162 (concat v_arrayElimCell_33 v_arrayElimCell_32))) (let ((.cse160 (let ((.cse169 (bvadd .cse6 .cse162))) (concat ((_ extract 63 32) .cse169) ((_ extract 31 0) .cse169))))) (or (= (let ((.cse158 (bvadd (let ((.cse159 (bvadd .cse160 .cse161))) (concat ((_ extract 63 32) .cse159) ((_ extract 31 0) .cse159))) .cse162))) (concat ((_ extract 63 32) .cse158) ((_ extract 31 0) .cse158))) .cse1) (= .cse1 (let ((.cse163 (let ((.cse166 (concat v_arrayElimCell_33 .cse8))) (bvadd (let ((.cse164 (bvadd .cse161 (let ((.cse165 (bvadd .cse6 .cse166))) (concat ((_ extract 63 32) .cse165) ((_ extract 31 0) .cse165)))))) (concat ((_ extract 63 32) .cse164) ((_ extract 31 0) .cse164))) .cse166)))) (concat ((_ extract 63 32) .cse163) ((_ extract 31 0) .cse163)))) (= (let ((.cse167 (bvadd (let ((.cse168 (bvadd .cse160 .cse25))) (concat ((_ extract 63 32) .cse168) ((_ extract 31 0) .cse168))) .cse162))) (concat ((_ extract 63 32) .cse167) ((_ extract 31 0) .cse167))) .cse1))))) (= (let ((.cse170 (let ((.cse171 (concat .cse12 v_arrayElimCell_32))) (bvadd .cse171 (let ((.cse172 (bvadd .cse19 (let ((.cse173 (bvadd .cse171 .cse6))) (concat ((_ extract 63 32) .cse173) ((_ extract 31 0) .cse173)))))) (concat ((_ extract 63 32) .cse172) ((_ extract 31 0) .cse172))))))) (concat ((_ extract 63 32) .cse170) ((_ extract 31 0) .cse170))) .cse1))) (= .cse1 (let ((.cse174 (bvadd (let ((.cse175 (bvadd .cse161 .cse24))) (concat ((_ extract 63 32) .cse175) ((_ extract 31 0) .cse175))) .cse25))) (concat ((_ extract 63 32) .cse174) ((_ extract 31 0) .cse174))))))) (forall ((v_arrayElimCell_31 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32))) (let ((.cse182 (concat v_arrayElimCell_31 v_arrayElimCell_34))) (or (forall ((v_arrayElimCell_32 (_ BitVec 32))) (or (forall ((v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse179 (concat v_arrayElimCell_33 v_arrayElimCell_32))) (let ((.cse178 (let ((.cse189 (bvadd .cse6 .cse179))) (concat ((_ extract 63 32) .cse189) ((_ extract 31 0) .cse189))))) (or (= (let ((.cse176 (bvadd (let ((.cse177 (bvadd .cse178 (concat .cse12 v_arrayElimCell_34)))) (concat ((_ extract 63 32) .cse177) ((_ extract 31 0) .cse177))) .cse179))) (concat ((_ extract 63 32) .cse176) ((_ extract 31 0) .cse176))) .cse1) (= (let ((.cse180 (bvadd (let ((.cse181 (bvadd .cse178 .cse182))) (concat ((_ extract 63 32) .cse181) ((_ extract 31 0) .cse181))) .cse179))) (concat ((_ extract 63 32) .cse180) ((_ extract 31 0) .cse180))) .cse1) (= .cse1 (let ((.cse183 (let ((.cse186 (concat v_arrayElimCell_33 .cse8))) (bvadd (let ((.cse184 (bvadd .cse182 (let ((.cse185 (bvadd .cse6 .cse186))) (concat ((_ extract 63 32) .cse185) ((_ extract 31 0) .cse185)))))) (concat ((_ extract 63 32) .cse184) ((_ extract 31 0) .cse184))) .cse186)))) (concat ((_ extract 63 32) .cse183) ((_ extract 31 0) .cse183)))) (= (let ((.cse187 (bvadd (let ((.cse188 (bvadd .cse178 .cse25))) (concat ((_ extract 63 32) .cse188) ((_ extract 31 0) .cse188))) .cse179))) (concat ((_ extract 63 32) .cse187) ((_ extract 31 0) .cse187))) .cse1))))) (= (let ((.cse190 (let ((.cse191 (concat .cse12 v_arrayElimCell_32))) (bvadd .cse191 (let ((.cse192 (bvadd .cse19 (let ((.cse193 (bvadd .cse191 .cse6))) (concat ((_ extract 63 32) .cse193) ((_ extract 31 0) .cse193)))))) (concat ((_ extract 63 32) .cse192) ((_ extract 31 0) .cse192))))))) (concat ((_ extract 63 32) .cse190) ((_ extract 31 0) .cse190))) .cse1))) (= .cse1 (let ((.cse194 (bvadd (let ((.cse195 (bvadd .cse182 .cse24))) (concat ((_ extract 63 32) .cse195) ((_ extract 31 0) .cse195))) .cse25))) (concat ((_ extract 63 32) .cse194) ((_ extract 31 0) .cse194))))))) (forall ((v_arrayElimCell_31 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32))) (let ((.cse202 (concat v_arrayElimCell_31 v_arrayElimCell_34))) (or (forall ((v_arrayElimCell_32 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse199 (concat v_arrayElimCell_33 v_arrayElimCell_32))) (let ((.cse198 (let ((.cse205 (bvadd .cse6 .cse199))) (concat ((_ extract 63 32) .cse205) ((_ extract 31 0) .cse205))))) (or (= (let ((.cse196 (bvadd (let ((.cse197 (bvadd .cse198 (concat .cse12 v_arrayElimCell_34)))) (concat ((_ extract 63 32) .cse197) ((_ extract 31 0) .cse197))) .cse199))) (concat ((_ extract 63 32) .cse196) ((_ extract 31 0) .cse196))) .cse1) (= (let ((.cse200 (bvadd (let ((.cse201 (bvadd .cse198 .cse202))) (concat ((_ extract 63 32) .cse201) ((_ extract 31 0) .cse201))) .cse199))) (concat ((_ extract 63 32) .cse200) ((_ extract 31 0) .cse200))) .cse1) (= (let ((.cse203 (bvadd (let ((.cse204 (bvadd .cse198 .cse25))) (concat ((_ extract 63 32) .cse204) ((_ extract 31 0) .cse204))) .cse199))) (concat ((_ extract 63 32) .cse203) ((_ extract 31 0) .cse203))) .cse1))))) (= .cse1 (let ((.cse206 (bvadd (let ((.cse207 (bvadd .cse202 .cse24))) (concat ((_ extract 63 32) .cse207) ((_ extract 31 0) .cse207))) .cse25))) (concat ((_ extract 63 32) .cse206) ((_ extract 31 0) .cse206))))))) (forall ((v_arrayElimCell_31 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32))) (let ((.cse211 (concat v_arrayElimCell_31 v_arrayElimCell_34))) (or (forall ((v_arrayElimCell_32 (_ BitVec 32))) (or (forall ((v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse212 (concat v_arrayElimCell_33 v_arrayElimCell_32))) (let ((.cse210 (let ((.cse215 (bvadd .cse6 .cse212))) (concat ((_ extract 63 32) .cse215) ((_ extract 31 0) .cse215))))) (or (= (let ((.cse208 (bvadd (let ((.cse209 (bvadd .cse210 .cse211))) (concat ((_ extract 63 32) .cse209) ((_ extract 31 0) .cse209))) .cse212))) (concat ((_ extract 63 32) .cse208) ((_ extract 31 0) .cse208))) .cse1) (= (let ((.cse213 (bvadd (let ((.cse214 (bvadd .cse210 .cse25))) (concat ((_ extract 63 32) .cse214) ((_ extract 31 0) .cse214))) .cse212))) (concat ((_ extract 63 32) .cse213) ((_ extract 31 0) .cse213))) .cse1))))) (= (let ((.cse216 (let ((.cse217 (concat .cse12 v_arrayElimCell_32))) (bvadd .cse217 (let ((.cse218 (bvadd .cse19 (let ((.cse219 (bvadd .cse217 .cse6))) (concat ((_ extract 63 32) .cse219) ((_ extract 31 0) .cse219)))))) (concat ((_ extract 63 32) .cse218) ((_ extract 31 0) .cse218))))))) (concat ((_ extract 63 32) .cse216) ((_ extract 31 0) .cse216))) .cse1))) (= .cse1 (let ((.cse220 (bvadd (let ((.cse221 (bvadd .cse211 .cse24))) (concat ((_ extract 63 32) .cse221) ((_ extract 31 0) .cse221))) .cse25))) (concat ((_ extract 63 32) .cse220) ((_ extract 31 0) .cse220))))))) (forall ((v_arrayElimCell_31 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32))) (let ((.cse225 (concat v_arrayElimCell_31 v_arrayElimCell_34))) (or (forall ((v_arrayElimCell_32 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse226 (concat v_arrayElimCell_33 v_arrayElimCell_32))) (let ((.cse224 (let ((.cse229 (bvadd .cse6 .cse226))) (concat ((_ extract 63 32) .cse229) ((_ extract 31 0) .cse229))))) (or (= (let ((.cse222 (bvadd (let ((.cse223 (bvadd .cse224 .cse225))) (concat ((_ extract 63 32) .cse223) ((_ extract 31 0) .cse223))) .cse226))) (concat ((_ extract 63 32) .cse222) ((_ extract 31 0) .cse222))) .cse1) (= (let ((.cse227 (bvadd (let ((.cse228 (bvadd .cse224 .cse25))) (concat ((_ extract 63 32) .cse228) ((_ extract 31 0) .cse228))) .cse226))) (concat ((_ extract 63 32) .cse227) ((_ extract 31 0) .cse227))) .cse1))))) (= .cse1 (let ((.cse230 (bvadd (let ((.cse231 (bvadd .cse225 .cse24))) (concat ((_ extract 63 32) .cse231) ((_ extract 31 0) .cse231))) .cse25))) (concat ((_ extract 63 32) .cse230) ((_ extract 31 0) .cse230))))))) (or .cse98 .cse232 .cse143)) .cse233) (or .cse98 (not .cse234)) (or (and (forall ((v_arrayElimCell_32 (_ BitVec 32)) (v_arrayElimCell_31 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse238 (concat v_arrayElimCell_33 v_arrayElimCell_32))) (let ((.cse241 (concat v_arrayElimCell_31 v_arrayElimCell_34)) (.cse237 (let ((.cse248 (bvadd .cse6 .cse238))) (concat ((_ extract 63 32) .cse248) ((_ extract 31 0) .cse248))))) (or (= (let ((.cse235 (bvadd (let ((.cse236 (bvadd .cse237 (concat .cse12 v_arrayElimCell_34)))) (concat ((_ extract 63 32) .cse236) ((_ extract 31 0) .cse236))) .cse238))) (concat ((_ extract 63 32) .cse235) ((_ extract 31 0) .cse235))) .cse1) (= (let ((.cse239 (bvadd (let ((.cse240 (bvadd .cse237 .cse241))) (concat ((_ extract 63 32) .cse240) ((_ extract 31 0) .cse240))) .cse238))) (concat ((_ extract 63 32) .cse239) ((_ extract 31 0) .cse239))) .cse1) (= .cse1 (let ((.cse242 (let ((.cse245 (concat v_arrayElimCell_33 .cse8))) (bvadd (let ((.cse243 (bvadd .cse241 (let ((.cse244 (bvadd .cse6 .cse245))) (concat ((_ extract 63 32) .cse244) ((_ extract 31 0) .cse244)))))) (concat ((_ extract 63 32) .cse243) ((_ extract 31 0) .cse243))) .cse245)))) (concat ((_ extract 63 32) .cse242) ((_ extract 31 0) .cse242)))) (= (let ((.cse246 (bvadd (let ((.cse247 (bvadd .cse237 .cse25))) (concat ((_ extract 63 32) .cse247) ((_ extract 31 0) .cse247))) .cse238))) (concat ((_ extract 63 32) .cse246) ((_ extract 31 0) .cse246))) .cse1))))) (or (and (forall ((v_arrayElimCell_32 (_ BitVec 32)) (v_arrayElimCell_31 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse252 (concat v_arrayElimCell_33 v_arrayElimCell_32))) (let ((.cse251 (let ((.cse255 (bvadd .cse6 .cse252))) (concat ((_ extract 63 32) .cse255) ((_ extract 31 0) .cse255))))) (or (= (let ((.cse249 (bvadd (let ((.cse250 (bvadd .cse251 (concat .cse12 v_arrayElimCell_34)))) (concat ((_ extract 63 32) .cse250) ((_ extract 31 0) .cse250))) .cse252))) (concat ((_ extract 63 32) .cse249) ((_ extract 31 0) .cse249))) .cse1) (= (let ((.cse253 (bvadd (let ((.cse254 (bvadd .cse251 (concat v_arrayElimCell_31 v_arrayElimCell_34)))) (concat ((_ extract 63 32) .cse254) ((_ extract 31 0) .cse254))) .cse252))) (concat ((_ extract 63 32) .cse253) ((_ extract 31 0) .cse253))) .cse1))))) (forall ((v_arrayElimCell_31 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse258 (concat v_arrayElimCell_31 v_arrayElimCell_34))) (or (= .cse1 (let ((.cse256 (let ((.cse260 (concat v_arrayElimCell_33 .cse8))) (bvadd (let ((.cse257 (bvadd .cse258 (let ((.cse259 (bvadd .cse6 .cse260))) (concat ((_ extract 63 32) .cse259) ((_ extract 31 0) .cse259)))))) (concat ((_ extract 63 32) .cse257) ((_ extract 31 0) .cse257))) .cse260)))) (concat ((_ extract 63 32) .cse256) ((_ extract 31 0) .cse256)))) (forall ((v_arrayElimCell_32 (_ BitVec 32))) (= (let ((.cse261 (let ((.cse264 (concat v_arrayElimCell_33 v_arrayElimCell_32))) (bvadd (let ((.cse262 (bvadd (let ((.cse263 (bvadd .cse6 .cse264))) (concat ((_ extract 63 32) .cse263) ((_ extract 31 0) .cse263))) .cse258))) (concat ((_ extract 63 32) .cse262) ((_ extract 31 0) .cse262))) .cse264)))) (concat ((_ extract 63 32) .cse261) ((_ extract 31 0) .cse261))) .cse1))))) (forall ((v_arrayElimCell_31 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse267 (concat v_arrayElimCell_31 v_arrayElimCell_34))) (or (= .cse1 (let ((.cse265 (let ((.cse269 (concat v_arrayElimCell_33 .cse8))) (bvadd (let ((.cse266 (bvadd .cse267 (let ((.cse268 (bvadd .cse6 .cse269))) (concat ((_ extract 63 32) .cse268) ((_ extract 31 0) .cse268)))))) (concat ((_ extract 63 32) .cse266) ((_ extract 31 0) .cse266))) .cse269)))) (concat ((_ extract 63 32) .cse265) ((_ extract 31 0) .cse265)))) (forall ((v_arrayElimCell_32 (_ BitVec 32))) (let ((.cse273 (concat v_arrayElimCell_33 v_arrayElimCell_32))) (let ((.cse272 (let ((.cse276 (bvadd .cse6 .cse273))) (concat ((_ extract 63 32) .cse276) ((_ extract 31 0) .cse276))))) (or (= (let ((.cse270 (bvadd (let ((.cse271 (bvadd .cse272 (concat .cse12 v_arrayElimCell_34)))) (concat ((_ extract 63 32) .cse271) ((_ extract 31 0) .cse271))) .cse273))) (concat ((_ extract 63 32) .cse270) ((_ extract 31 0) .cse270))) .cse1) (= (let ((.cse274 (bvadd (let ((.cse275 (bvadd .cse272 .cse267))) (concat ((_ extract 63 32) .cse275) ((_ extract 31 0) .cse275))) .cse273))) (concat ((_ extract 63 32) .cse274) ((_ extract 31 0) .cse274))) .cse1)))))))) (forall ((v_arrayElimCell_32 (_ BitVec 32)) (v_arrayElimCell_31 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (= (let ((.cse277 (let ((.cse280 (concat v_arrayElimCell_33 v_arrayElimCell_32))) (bvadd (let ((.cse278 (bvadd (let ((.cse279 (bvadd .cse6 .cse280))) (concat ((_ extract 63 32) .cse279) ((_ extract 31 0) .cse279))) (concat v_arrayElimCell_31 v_arrayElimCell_34)))) (concat ((_ extract 63 32) .cse278) ((_ extract 31 0) .cse278))) .cse280)))) (concat ((_ extract 63 32) .cse277) ((_ extract 31 0) .cse277))) .cse1))) .cse0) (forall ((v_arrayElimCell_32 (_ BitVec 32)) (v_arrayElimCell_31 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse285 (concat v_arrayElimCell_33 v_arrayElimCell_32))) (let ((.cse284 (concat v_arrayElimCell_31 v_arrayElimCell_34)) (.cse283 (let ((.cse292 (bvadd .cse6 .cse285))) (concat ((_ extract 63 32) .cse292) ((_ extract 31 0) .cse292))))) (or (= (let ((.cse281 (bvadd (let ((.cse282 (bvadd .cse283 .cse284))) (concat ((_ extract 63 32) .cse282) ((_ extract 31 0) .cse282))) .cse285))) (concat ((_ extract 63 32) .cse281) ((_ extract 31 0) .cse281))) .cse1) (= .cse1 (let ((.cse286 (let ((.cse289 (concat v_arrayElimCell_33 .cse8))) (bvadd (let ((.cse287 (bvadd .cse284 (let ((.cse288 (bvadd .cse6 .cse289))) (concat ((_ extract 63 32) .cse288) ((_ extract 31 0) .cse288)))))) (concat ((_ extract 63 32) .cse287) ((_ extract 31 0) .cse287))) .cse289)))) (concat ((_ extract 63 32) .cse286) ((_ extract 31 0) .cse286)))) (= (let ((.cse290 (bvadd (let ((.cse291 (bvadd .cse283 .cse25))) (concat ((_ extract 63 32) .cse291) ((_ extract 31 0) .cse291))) .cse285))) (concat ((_ extract 63 32) .cse290) ((_ extract 31 0) .cse290))) .cse1))))) (forall ((v_arrayElimCell_32 (_ BitVec 32)) (v_arrayElimCell_31 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32))) (or (forall ((v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse296 (concat v_arrayElimCell_33 v_arrayElimCell_32))) (let ((.cse299 (concat v_arrayElimCell_31 v_arrayElimCell_34)) (.cse295 (let ((.cse306 (bvadd .cse6 .cse296))) (concat ((_ extract 63 32) .cse306) ((_ extract 31 0) .cse306))))) (or (= (let ((.cse293 (bvadd (let ((.cse294 (bvadd .cse295 (concat .cse12 v_arrayElimCell_34)))) (concat ((_ extract 63 32) .cse294) ((_ extract 31 0) .cse294))) .cse296))) (concat ((_ extract 63 32) .cse293) ((_ extract 31 0) .cse293))) .cse1) (= (let ((.cse297 (bvadd (let ((.cse298 (bvadd .cse295 .cse299))) (concat ((_ extract 63 32) .cse298) ((_ extract 31 0) .cse298))) .cse296))) (concat ((_ extract 63 32) .cse297) ((_ extract 31 0) .cse297))) .cse1) (= .cse1 (let ((.cse300 (let ((.cse303 (concat v_arrayElimCell_33 .cse8))) (bvadd (let ((.cse301 (bvadd .cse299 (let ((.cse302 (bvadd .cse6 .cse303))) (concat ((_ extract 63 32) .cse302) ((_ extract 31 0) .cse302)))))) (concat ((_ extract 63 32) .cse301) ((_ extract 31 0) .cse301))) .cse303)))) (concat ((_ extract 63 32) .cse300) ((_ extract 31 0) .cse300)))) (= (let ((.cse304 (bvadd (let ((.cse305 (bvadd .cse295 .cse25))) (concat ((_ extract 63 32) .cse305) ((_ extract 31 0) .cse305))) .cse296))) (concat ((_ extract 63 32) .cse304) ((_ extract 31 0) .cse304))) .cse1))))) (= (let ((.cse307 (let ((.cse308 (concat .cse12 v_arrayElimCell_32))) (bvadd .cse308 (let ((.cse309 (bvadd .cse19 (let ((.cse310 (bvadd .cse308 .cse6))) (concat ((_ extract 63 32) .cse310) ((_ extract 31 0) .cse310)))))) (concat ((_ extract 63 32) .cse309) ((_ extract 31 0) .cse309))))))) (concat ((_ extract 63 32) .cse307) ((_ extract 31 0) .cse307))) .cse1))) (or .cse232 .cse143) (forall ((v_arrayElimCell_32 (_ BitVec 32)) (v_arrayElimCell_31 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse314 (concat v_arrayElimCell_33 v_arrayElimCell_32))) (let ((.cse313 (let ((.cse319 (bvadd .cse6 .cse314))) (concat ((_ extract 63 32) .cse319) ((_ extract 31 0) .cse319))))) (or (= (let ((.cse311 (bvadd (let ((.cse312 (bvadd .cse313 (concat .cse12 v_arrayElimCell_34)))) (concat ((_ extract 63 32) .cse312) ((_ extract 31 0) .cse312))) .cse314))) (concat ((_ extract 63 32) .cse311) ((_ extract 31 0) .cse311))) .cse1) (= (let ((.cse315 (bvadd (let ((.cse316 (bvadd .cse313 (concat v_arrayElimCell_31 v_arrayElimCell_34)))) (concat ((_ extract 63 32) .cse316) ((_ extract 31 0) .cse316))) .cse314))) (concat ((_ extract 63 32) .cse315) ((_ extract 31 0) .cse315))) .cse1) (= (let ((.cse317 (bvadd (let ((.cse318 (bvadd .cse313 .cse25))) (concat ((_ extract 63 32) .cse318) ((_ extract 31 0) .cse318))) .cse314))) (concat ((_ extract 63 32) .cse317) ((_ extract 31 0) .cse317))) .cse1))))) (forall ((v_arrayElimCell_32 (_ BitVec 32)) (v_arrayElimCell_31 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32))) (or (forall ((v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse323 (concat v_arrayElimCell_33 v_arrayElimCell_32))) (let ((.cse322 (let ((.cse328 (bvadd .cse6 .cse323))) (concat ((_ extract 63 32) .cse328) ((_ extract 31 0) .cse328))))) (or (= (let ((.cse320 (bvadd (let ((.cse321 (bvadd .cse322 (concat .cse12 v_arrayElimCell_34)))) (concat ((_ extract 63 32) .cse321) ((_ extract 31 0) .cse321))) .cse323))) (concat ((_ extract 63 32) .cse320) ((_ extract 31 0) .cse320))) .cse1) (= (let ((.cse324 (bvadd (let ((.cse325 (bvadd .cse322 (concat v_arrayElimCell_31 v_arrayElimCell_34)))) (concat ((_ extract 63 32) .cse325) ((_ extract 31 0) .cse325))) .cse323))) (concat ((_ extract 63 32) .cse324) ((_ extract 31 0) .cse324))) .cse1) (= (let ((.cse326 (bvadd (let ((.cse327 (bvadd .cse322 .cse25))) (concat ((_ extract 63 32) .cse327) ((_ extract 31 0) .cse327))) .cse323))) (concat ((_ extract 63 32) .cse326) ((_ extract 31 0) .cse326))) .cse1))))) (= (let ((.cse329 (let ((.cse330 (concat .cse12 v_arrayElimCell_32))) (bvadd .cse330 (let ((.cse331 (bvadd .cse19 (let ((.cse332 (bvadd .cse330 .cse6))) (concat ((_ extract 63 32) .cse332) ((_ extract 31 0) .cse332)))))) (concat ((_ extract 63 32) .cse331) ((_ extract 31 0) .cse331))))))) (concat ((_ extract 63 32) .cse329) ((_ extract 31 0) .cse329))) .cse1))) (forall ((v_arrayElimCell_32 (_ BitVec 32)) (v_arrayElimCell_31 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32))) (or (forall ((v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse336 (concat v_arrayElimCell_33 v_arrayElimCell_32))) (let ((.cse335 (let ((.cse339 (bvadd .cse6 .cse336))) (concat ((_ extract 63 32) .cse339) ((_ extract 31 0) .cse339))))) (or (= (let ((.cse333 (bvadd (let ((.cse334 (bvadd .cse335 (concat v_arrayElimCell_31 v_arrayElimCell_34)))) (concat ((_ extract 63 32) .cse334) ((_ extract 31 0) .cse334))) .cse336))) (concat ((_ extract 63 32) .cse333) ((_ extract 31 0) .cse333))) .cse1) (= (let ((.cse337 (bvadd (let ((.cse338 (bvadd .cse335 .cse25))) (concat ((_ extract 63 32) .cse338) ((_ extract 31 0) .cse338))) .cse336))) (concat ((_ extract 63 32) .cse337) ((_ extract 31 0) .cse337))) .cse1))))) (= (let ((.cse340 (let ((.cse341 (concat .cse12 v_arrayElimCell_32))) (bvadd .cse341 (let ((.cse342 (bvadd .cse19 (let ((.cse343 (bvadd .cse341 .cse6))) (concat ((_ extract 63 32) .cse343) ((_ extract 31 0) .cse343)))))) (concat ((_ extract 63 32) .cse342) ((_ extract 31 0) .cse342))))))) (concat ((_ extract 63 32) .cse340) ((_ extract 31 0) .cse340))) .cse1))) (or .cse142 .cse143) (forall ((v_arrayElimCell_32 (_ BitVec 32)) (v_arrayElimCell_31 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32))) (or (forall ((v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse348 (concat v_arrayElimCell_33 v_arrayElimCell_32))) (let ((.cse347 (concat v_arrayElimCell_31 v_arrayElimCell_34)) (.cse346 (let ((.cse355 (bvadd .cse6 .cse348))) (concat ((_ extract 63 32) .cse355) ((_ extract 31 0) .cse355))))) (or (= (let ((.cse344 (bvadd (let ((.cse345 (bvadd .cse346 .cse347))) (concat ((_ extract 63 32) .cse345) ((_ extract 31 0) .cse345))) .cse348))) (concat ((_ extract 63 32) .cse344) ((_ extract 31 0) .cse344))) .cse1) (= .cse1 (let ((.cse349 (let ((.cse352 (concat v_arrayElimCell_33 .cse8))) (bvadd (let ((.cse350 (bvadd .cse347 (let ((.cse351 (bvadd .cse6 .cse352))) (concat ((_ extract 63 32) .cse351) ((_ extract 31 0) .cse351)))))) (concat ((_ extract 63 32) .cse350) ((_ extract 31 0) .cse350))) .cse352)))) (concat ((_ extract 63 32) .cse349) ((_ extract 31 0) .cse349)))) (= (let ((.cse353 (bvadd (let ((.cse354 (bvadd .cse346 .cse25))) (concat ((_ extract 63 32) .cse354) ((_ extract 31 0) .cse354))) .cse348))) (concat ((_ extract 63 32) .cse353) ((_ extract 31 0) .cse353))) .cse1))))) (= (let ((.cse356 (let ((.cse357 (concat .cse12 v_arrayElimCell_32))) (bvadd .cse357 (let ((.cse358 (bvadd .cse19 (let ((.cse359 (bvadd .cse357 .cse6))) (concat ((_ extract 63 32) .cse359) ((_ extract 31 0) .cse359)))))) (concat ((_ extract 63 32) .cse358) ((_ extract 31 0) .cse358))))))) (concat ((_ extract 63 32) .cse356) ((_ extract 31 0) .cse356))) .cse1))) (forall ((v_arrayElimCell_32 (_ BitVec 32)) (v_arrayElimCell_31 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse363 (concat v_arrayElimCell_33 v_arrayElimCell_32))) (let ((.cse362 (let ((.cse366 (bvadd .cse6 .cse363))) (concat ((_ extract 63 32) .cse366) ((_ extract 31 0) .cse366))))) (or (= (let ((.cse360 (bvadd (let ((.cse361 (bvadd .cse362 (concat v_arrayElimCell_31 v_arrayElimCell_34)))) (concat ((_ extract 63 32) .cse361) ((_ extract 31 0) .cse361))) .cse363))) (concat ((_ extract 63 32) .cse360) ((_ extract 31 0) .cse360))) .cse1) (= (let ((.cse364 (bvadd (let ((.cse365 (bvadd .cse362 .cse25))) (concat ((_ extract 63 32) .cse365) ((_ extract 31 0) .cse365))) .cse363))) (concat ((_ extract 63 32) .cse364) ((_ extract 31 0) .cse364))) .cse1))))) .cse99 (or (and (forall ((v_arrayElimCell_31 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse369 (concat v_arrayElimCell_31 v_arrayElimCell_34))) (or (= .cse1 (let ((.cse367 (let ((.cse371 (concat v_arrayElimCell_33 .cse8))) (bvadd (let ((.cse368 (bvadd .cse369 (let ((.cse370 (bvadd .cse6 .cse371))) (concat ((_ extract 63 32) .cse370) ((_ extract 31 0) .cse370)))))) (concat ((_ extract 63 32) .cse368) ((_ extract 31 0) .cse368))) .cse371)))) (concat ((_ extract 63 32) .cse367) ((_ extract 31 0) .cse367)))) (forall ((v_arrayElimCell_32 (_ BitVec 32))) (or (= (let ((.cse372 (let ((.cse375 (concat v_arrayElimCell_33 v_arrayElimCell_32))) (bvadd (let ((.cse373 (bvadd (let ((.cse374 (bvadd .cse6 .cse375))) (concat ((_ extract 63 32) .cse374) ((_ extract 31 0) .cse374))) .cse369))) (concat ((_ extract 63 32) .cse373) ((_ extract 31 0) .cse373))) .cse375)))) (concat ((_ extract 63 32) .cse372) ((_ extract 31 0) .cse372))) .cse1) (= (let ((.cse376 (let ((.cse377 (concat .cse12 v_arrayElimCell_32))) (bvadd .cse377 (let ((.cse378 (bvadd .cse19 (let ((.cse379 (bvadd .cse377 .cse6))) (concat ((_ extract 63 32) .cse379) ((_ extract 31 0) .cse379)))))) (concat ((_ extract 63 32) .cse378) ((_ extract 31 0) .cse378))))))) (concat ((_ extract 63 32) .cse376) ((_ extract 31 0) .cse376))) .cse1)))))) (forall ((v_arrayElimCell_31 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse382 (concat v_arrayElimCell_31 v_arrayElimCell_34))) (or (= .cse1 (let ((.cse380 (let ((.cse384 (concat v_arrayElimCell_33 .cse8))) (bvadd (let ((.cse381 (bvadd .cse382 (let ((.cse383 (bvadd .cse6 .cse384))) (concat ((_ extract 63 32) .cse383) ((_ extract 31 0) .cse383)))))) (concat ((_ extract 63 32) .cse381) ((_ extract 31 0) .cse381))) .cse384)))) (concat ((_ extract 63 32) .cse380) ((_ extract 31 0) .cse380)))) (forall ((v_arrayElimCell_32 (_ BitVec 32))) (let ((.cse388 (concat v_arrayElimCell_33 v_arrayElimCell_32))) (let ((.cse387 (let ((.cse395 (bvadd .cse6 .cse388))) (concat ((_ extract 63 32) .cse395) ((_ extract 31 0) .cse395))))) (or (= (let ((.cse385 (bvadd (let ((.cse386 (bvadd .cse387 (concat .cse12 v_arrayElimCell_34)))) (concat ((_ extract 63 32) .cse386) ((_ extract 31 0) .cse386))) .cse388))) (concat ((_ extract 63 32) .cse385) ((_ extract 31 0) .cse385))) .cse1) (= (let ((.cse389 (bvadd (let ((.cse390 (bvadd .cse387 .cse382))) (concat ((_ extract 63 32) .cse390) ((_ extract 31 0) .cse390))) .cse388))) (concat ((_ extract 63 32) .cse389) ((_ extract 31 0) .cse389))) .cse1) (= (let ((.cse391 (let ((.cse392 (concat .cse12 v_arrayElimCell_32))) (bvadd .cse392 (let ((.cse393 (bvadd .cse19 (let ((.cse394 (bvadd .cse392 .cse6))) (concat ((_ extract 63 32) .cse394) ((_ extract 31 0) .cse394)))))) (concat ((_ extract 63 32) .cse393) ((_ extract 31 0) .cse393))))))) (concat ((_ extract 63 32) .cse391) ((_ extract 31 0) .cse391))) .cse1)))))))) (forall ((v_arrayElimCell_32 (_ BitVec 32)) (v_arrayElimCell_31 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (or (= (let ((.cse396 (let ((.cse399 (concat v_arrayElimCell_33 v_arrayElimCell_32))) (bvadd (let ((.cse397 (bvadd (let ((.cse398 (bvadd .cse6 .cse399))) (concat ((_ extract 63 32) .cse398) ((_ extract 31 0) .cse398))) (concat v_arrayElimCell_31 v_arrayElimCell_34)))) (concat ((_ extract 63 32) .cse397) ((_ extract 31 0) .cse397))) .cse399)))) (concat ((_ extract 63 32) .cse396) ((_ extract 31 0) .cse396))) .cse1) (= (let ((.cse400 (let ((.cse401 (concat .cse12 v_arrayElimCell_32))) (bvadd .cse401 (let ((.cse402 (bvadd .cse19 (let ((.cse403 (bvadd .cse401 .cse6))) (concat ((_ extract 63 32) .cse403) ((_ extract 31 0) .cse403)))))) (concat ((_ extract 63 32) .cse402) ((_ extract 31 0) .cse402))))))) (concat ((_ extract 63 32) .cse400) ((_ extract 31 0) .cse400))) .cse1))) (forall ((v_arrayElimCell_32 (_ BitVec 32)) (v_arrayElimCell_31 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse407 (concat v_arrayElimCell_33 v_arrayElimCell_32))) (let ((.cse406 (let ((.cse414 (bvadd .cse6 .cse407))) (concat ((_ extract 63 32) .cse414) ((_ extract 31 0) .cse414))))) (or (= (let ((.cse404 (bvadd (let ((.cse405 (bvadd .cse406 (concat .cse12 v_arrayElimCell_34)))) (concat ((_ extract 63 32) .cse405) ((_ extract 31 0) .cse405))) .cse407))) (concat ((_ extract 63 32) .cse404) ((_ extract 31 0) .cse404))) .cse1) (= (let ((.cse408 (bvadd (let ((.cse409 (bvadd .cse406 (concat v_arrayElimCell_31 v_arrayElimCell_34)))) (concat ((_ extract 63 32) .cse409) ((_ extract 31 0) .cse409))) .cse407))) (concat ((_ extract 63 32) .cse408) ((_ extract 31 0) .cse408))) .cse1) (= (let ((.cse410 (let ((.cse411 (concat .cse12 v_arrayElimCell_32))) (bvadd .cse411 (let ((.cse412 (bvadd .cse19 (let ((.cse413 (bvadd .cse411 .cse6))) (concat ((_ extract 63 32) .cse413) ((_ extract 31 0) .cse413)))))) (concat ((_ extract 63 32) .cse412) ((_ extract 31 0) .cse412))))))) (concat ((_ extract 63 32) .cse410) ((_ extract 31 0) .cse410))) .cse1)))))) .cse0)) .cse233 .cse234)))))) (bvslt (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~i~0#1|) c_~N~0) (not (bvslt (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~i~0#1|) c_~N~0))) is different from true [2023-11-29 00:50:54,076 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-29 00:50:54,076 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:50:54,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [330633604] [2023-11-29 00:50:54,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [330633604] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:50:54,077 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:50:54,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 28 [2023-11-29 00:50:54,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3393314] [2023-11-29 00:50:54,077 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:50:54,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-11-29 00:50:54,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:50:54,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-11-29 00:50:54,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=607, Unknown=1, NotChecked=50, Total=756 [2023-11-29 00:50:54,079 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand has 28 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:50:59,130 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse434 (select |c_#memory_int#3| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (and (= |c_ULTIMATE.start_main_~#sum~0#1.offset| (_ bv0 32)) (or (let ((.cse8 ((_ extract 63 32) (_ bv1 64))) (.cse12 ((_ extract 31 0) (_ bv1 64)))) (let ((.cse25 (concat .cse8 .cse12)) (.cse6 (concat (select .cse434 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (select .cse434 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (.cse415 (bvmul (_ bv8 32) |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse418 (= .cse415 (_ bv0 32))) (.cse0 (= (_ bv8 32) .cse415)) (.cse19 (concat .cse12 .cse8)) (.cse1 ((_ sign_extend 32) (bvadd c_~N~0 (_ bv1 32)))) (.cse24 (let ((.cse433 (bvadd .cse25 .cse6))) (concat ((_ extract 63 32) .cse433) ((_ extract 31 0) .cse433))))) (let ((.cse98 (forall ((v_arrayElimCell_31 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32))) (= .cse1 (let ((.cse431 (bvadd (let ((.cse432 (bvadd (concat v_arrayElimCell_31 v_arrayElimCell_34) .cse24))) (concat ((_ extract 63 32) .cse432) ((_ extract 31 0) .cse432))) .cse25))) (concat ((_ extract 63 32) .cse431) ((_ extract 31 0) .cse431)))))) (.cse232 (forall ((v_arrayElimCell_32 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (or (= (let ((.cse423 (let ((.cse424 (concat .cse12 v_arrayElimCell_32))) (bvadd .cse424 (let ((.cse425 (bvadd .cse19 (let ((.cse426 (bvadd .cse424 .cse6))) (concat ((_ extract 63 32) .cse426) ((_ extract 31 0) .cse426)))))) (concat ((_ extract 63 32) .cse425) ((_ extract 31 0) .cse425))))))) (concat ((_ extract 63 32) .cse423) ((_ extract 31 0) .cse423))) .cse1) (= (let ((.cse427 (let ((.cse430 (concat v_arrayElimCell_33 v_arrayElimCell_32))) (bvadd (let ((.cse428 (bvadd (let ((.cse429 (bvadd .cse6 .cse430))) (concat ((_ extract 63 32) .cse429) ((_ extract 31 0) .cse429))) .cse25))) (concat ((_ extract 63 32) .cse428) ((_ extract 31 0) .cse428))) .cse430)))) (concat ((_ extract 63 32) .cse427) ((_ extract 31 0) .cse427))) .cse1)))) (.cse142 (forall ((v_arrayElimCell_32 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (= (let ((.cse419 (let ((.cse422 (concat v_arrayElimCell_33 v_arrayElimCell_32))) (bvadd (let ((.cse420 (bvadd (let ((.cse421 (bvadd .cse6 .cse422))) (concat ((_ extract 63 32) .cse421) ((_ extract 31 0) .cse421))) .cse25))) (concat ((_ extract 63 32) .cse420) ((_ extract 31 0) .cse420))) .cse422)))) (concat ((_ extract 63 32) .cse419) ((_ extract 31 0) .cse419))) .cse1))) (.cse143 (not .cse0)) (.cse99 (not .cse418)) (.cse233 (and (= (let ((.cse416 (bvadd .cse25 (let ((.cse417 (bvadd .cse25 .cse24))) (concat ((_ extract 63 32) .cse417) ((_ extract 31 0) .cse417)))))) (concat ((_ extract 63 32) .cse416) ((_ extract 31 0) .cse416))) .cse1) .cse418)) (.cse234 (= (bvadd (_ bv8 32) .cse415) (_ bv0 32)))) (and (or (and (or .cse0 (and (forall ((v_arrayElimCell_31 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32))) (let ((.cse4 (concat v_arrayElimCell_31 v_arrayElimCell_34))) (or (forall ((v_arrayElimCell_33 (_ BitVec 32))) (or (= .cse1 (let ((.cse2 (let ((.cse7 (concat v_arrayElimCell_33 .cse8))) (bvadd (let ((.cse3 (bvadd .cse4 (let ((.cse5 (bvadd .cse6 .cse7))) (concat ((_ extract 63 32) .cse5) ((_ extract 31 0) .cse5)))))) (concat ((_ extract 63 32) .cse3) ((_ extract 31 0) .cse3))) .cse7)))) (concat ((_ extract 63 32) .cse2) ((_ extract 31 0) .cse2)))) (forall ((v_arrayElimCell_32 (_ BitVec 32))) (let ((.cse13 (concat v_arrayElimCell_33 v_arrayElimCell_32))) (let ((.cse11 (let ((.cse21 (bvadd .cse6 .cse13))) (concat ((_ extract 63 32) .cse21) ((_ extract 31 0) .cse21))))) (or (= (let ((.cse9 (bvadd (let ((.cse10 (bvadd .cse11 (concat .cse12 v_arrayElimCell_34)))) (concat ((_ extract 63 32) .cse10) ((_ extract 31 0) .cse10))) .cse13))) (concat ((_ extract 63 32) .cse9) ((_ extract 31 0) .cse9))) .cse1) (= (let ((.cse14 (bvadd (let ((.cse15 (bvadd .cse11 .cse4))) (concat ((_ extract 63 32) .cse15) ((_ extract 31 0) .cse15))) .cse13))) (concat ((_ extract 63 32) .cse14) ((_ extract 31 0) .cse14))) .cse1) (= (let ((.cse16 (let ((.cse17 (concat .cse12 v_arrayElimCell_32))) (bvadd .cse17 (let ((.cse18 (bvadd .cse19 (let ((.cse20 (bvadd .cse17 .cse6))) (concat ((_ extract 63 32) .cse20) ((_ extract 31 0) .cse20)))))) (concat ((_ extract 63 32) .cse18) ((_ extract 31 0) .cse18))))))) (concat ((_ extract 63 32) .cse16) ((_ extract 31 0) .cse16))) .cse1))))))) (= .cse1 (let ((.cse22 (bvadd (let ((.cse23 (bvadd .cse4 .cse24))) (concat ((_ extract 63 32) .cse23) ((_ extract 31 0) .cse23))) .cse25))) (concat ((_ extract 63 32) .cse22) ((_ extract 31 0) .cse22))))))) (forall ((v_arrayElimCell_31 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32))) (let ((.cse28 (concat v_arrayElimCell_31 v_arrayElimCell_34))) (or (= .cse1 (let ((.cse26 (bvadd (let ((.cse27 (bvadd .cse28 .cse24))) (concat ((_ extract 63 32) .cse27) ((_ extract 31 0) .cse27))) .cse25))) (concat ((_ extract 63 32) .cse26) ((_ extract 31 0) .cse26)))) (forall ((v_arrayElimCell_32 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (or (= (let ((.cse29 (let ((.cse32 (concat v_arrayElimCell_33 v_arrayElimCell_32))) (bvadd (let ((.cse30 (bvadd (let ((.cse31 (bvadd .cse6 .cse32))) (concat ((_ extract 63 32) .cse31) ((_ extract 31 0) .cse31))) .cse28))) (concat ((_ extract 63 32) .cse30) ((_ extract 31 0) .cse30))) .cse32)))) (concat ((_ extract 63 32) .cse29) ((_ extract 31 0) .cse29))) .cse1) (= (let ((.cse33 (let ((.cse34 (concat .cse12 v_arrayElimCell_32))) (bvadd .cse34 (let ((.cse35 (bvadd .cse19 (let ((.cse36 (bvadd .cse34 .cse6))) (concat ((_ extract 63 32) .cse36) ((_ extract 31 0) .cse36)))))) (concat ((_ extract 63 32) .cse35) ((_ extract 31 0) .cse35))))))) (concat ((_ extract 63 32) .cse33) ((_ extract 31 0) .cse33))) .cse1)))))) (forall ((v_arrayElimCell_31 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32))) (let ((.cse39 (concat v_arrayElimCell_31 v_arrayElimCell_34))) (or (forall ((v_arrayElimCell_33 (_ BitVec 32))) (or (= .cse1 (let ((.cse37 (let ((.cse41 (concat v_arrayElimCell_33 .cse8))) (bvadd (let ((.cse38 (bvadd .cse39 (let ((.cse40 (bvadd .cse6 .cse41))) (concat ((_ extract 63 32) .cse40) ((_ extract 31 0) .cse40)))))) (concat ((_ extract 63 32) .cse38) ((_ extract 31 0) .cse38))) .cse41)))) (concat ((_ extract 63 32) .cse37) ((_ extract 31 0) .cse37)))) (forall ((v_arrayElimCell_32 (_ BitVec 32))) (or (= (let ((.cse42 (let ((.cse45 (concat v_arrayElimCell_33 v_arrayElimCell_32))) (bvadd (let ((.cse43 (bvadd (let ((.cse44 (bvadd .cse6 .cse45))) (concat ((_ extract 63 32) .cse44) ((_ extract 31 0) .cse44))) .cse39))) (concat ((_ extract 63 32) .cse43) ((_ extract 31 0) .cse43))) .cse45)))) (concat ((_ extract 63 32) .cse42) ((_ extract 31 0) .cse42))) .cse1) (= (let ((.cse46 (let ((.cse47 (concat .cse12 v_arrayElimCell_32))) (bvadd .cse47 (let ((.cse48 (bvadd .cse19 (let ((.cse49 (bvadd .cse47 .cse6))) (concat ((_ extract 63 32) .cse49) ((_ extract 31 0) .cse49)))))) (concat ((_ extract 63 32) .cse48) ((_ extract 31 0) .cse48))))))) (concat ((_ extract 63 32) .cse46) ((_ extract 31 0) .cse46))) .cse1))))) (= .cse1 (let ((.cse50 (bvadd (let ((.cse51 (bvadd .cse39 .cse24))) (concat ((_ extract 63 32) .cse51) ((_ extract 31 0) .cse51))) .cse25))) (concat ((_ extract 63 32) .cse50) ((_ extract 31 0) .cse50))))))) (forall ((v_arrayElimCell_31 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32))) (let ((.cse54 (concat v_arrayElimCell_31 v_arrayElimCell_34))) (or (= .cse1 (let ((.cse52 (bvadd (let ((.cse53 (bvadd .cse54 .cse24))) (concat ((_ extract 63 32) .cse53) ((_ extract 31 0) .cse53))) .cse25))) (concat ((_ extract 63 32) .cse52) ((_ extract 31 0) .cse52)))) (forall ((v_arrayElimCell_32 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse58 (concat v_arrayElimCell_33 v_arrayElimCell_32))) (let ((.cse57 (let ((.cse65 (bvadd .cse6 .cse58))) (concat ((_ extract 63 32) .cse65) ((_ extract 31 0) .cse65))))) (or (= (let ((.cse55 (bvadd (let ((.cse56 (bvadd .cse57 (concat .cse12 v_arrayElimCell_34)))) (concat ((_ extract 63 32) .cse56) ((_ extract 31 0) .cse56))) .cse58))) (concat ((_ extract 63 32) .cse55) ((_ extract 31 0) .cse55))) .cse1) (= (let ((.cse59 (bvadd (let ((.cse60 (bvadd .cse57 .cse54))) (concat ((_ extract 63 32) .cse60) ((_ extract 31 0) .cse60))) .cse58))) (concat ((_ extract 63 32) .cse59) ((_ extract 31 0) .cse59))) .cse1) (= (let ((.cse61 (let ((.cse62 (concat .cse12 v_arrayElimCell_32))) (bvadd .cse62 (let ((.cse63 (bvadd .cse19 (let ((.cse64 (bvadd .cse62 .cse6))) (concat ((_ extract 63 32) .cse64) ((_ extract 31 0) .cse64)))))) (concat ((_ extract 63 32) .cse63) ((_ extract 31 0) .cse63))))))) (concat ((_ extract 63 32) .cse61) ((_ extract 31 0) .cse61))) .cse1)))))))))) (forall ((v_arrayElimCell_31 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32))) (let ((.cse68 (concat v_arrayElimCell_31 v_arrayElimCell_34))) (or (= .cse1 (let ((.cse66 (bvadd (let ((.cse67 (bvadd .cse68 .cse24))) (concat ((_ extract 63 32) .cse67) ((_ extract 31 0) .cse67))) .cse25))) (concat ((_ extract 63 32) .cse66) ((_ extract 31 0) .cse66)))) (forall ((v_arrayElimCell_32 (_ BitVec 32))) (or (forall ((v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse72 (concat v_arrayElimCell_33 v_arrayElimCell_32))) (let ((.cse71 (let ((.cse77 (bvadd .cse6 .cse72))) (concat ((_ extract 63 32) .cse77) ((_ extract 31 0) .cse77))))) (or (= (let ((.cse69 (bvadd (let ((.cse70 (bvadd .cse71 (concat .cse12 v_arrayElimCell_34)))) (concat ((_ extract 63 32) .cse70) ((_ extract 31 0) .cse70))) .cse72))) (concat ((_ extract 63 32) .cse69) ((_ extract 31 0) .cse69))) .cse1) (= (let ((.cse73 (bvadd (let ((.cse74 (bvadd .cse71 .cse68))) (concat ((_ extract 63 32) .cse74) ((_ extract 31 0) .cse74))) .cse72))) (concat ((_ extract 63 32) .cse73) ((_ extract 31 0) .cse73))) .cse1) (= (let ((.cse75 (bvadd (let ((.cse76 (bvadd .cse71 .cse25))) (concat ((_ extract 63 32) .cse76) ((_ extract 31 0) .cse76))) .cse72))) (concat ((_ extract 63 32) .cse75) ((_ extract 31 0) .cse75))) .cse1))))) (= (let ((.cse78 (let ((.cse79 (concat .cse12 v_arrayElimCell_32))) (bvadd .cse79 (let ((.cse80 (bvadd .cse19 (let ((.cse81 (bvadd .cse79 .cse6))) (concat ((_ extract 63 32) .cse81) ((_ extract 31 0) .cse81)))))) (concat ((_ extract 63 32) .cse80) ((_ extract 31 0) .cse80))))))) (concat ((_ extract 63 32) .cse78) ((_ extract 31 0) .cse78))) .cse1)))))) (forall ((v_arrayElimCell_31 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32))) (let ((.cse88 (concat v_arrayElimCell_31 v_arrayElimCell_34))) (or (forall ((v_arrayElimCell_32 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse85 (concat v_arrayElimCell_33 v_arrayElimCell_32))) (let ((.cse84 (let ((.cse95 (bvadd .cse6 .cse85))) (concat ((_ extract 63 32) .cse95) ((_ extract 31 0) .cse95))))) (or (= (let ((.cse82 (bvadd (let ((.cse83 (bvadd .cse84 (concat .cse12 v_arrayElimCell_34)))) (concat ((_ extract 63 32) .cse83) ((_ extract 31 0) .cse83))) .cse85))) (concat ((_ extract 63 32) .cse82) ((_ extract 31 0) .cse82))) .cse1) (= (let ((.cse86 (bvadd (let ((.cse87 (bvadd .cse84 .cse88))) (concat ((_ extract 63 32) .cse87) ((_ extract 31 0) .cse87))) .cse85))) (concat ((_ extract 63 32) .cse86) ((_ extract 31 0) .cse86))) .cse1) (= .cse1 (let ((.cse89 (let ((.cse92 (concat v_arrayElimCell_33 .cse8))) (bvadd (let ((.cse90 (bvadd .cse88 (let ((.cse91 (bvadd .cse6 .cse92))) (concat ((_ extract 63 32) .cse91) ((_ extract 31 0) .cse91)))))) (concat ((_ extract 63 32) .cse90) ((_ extract 31 0) .cse90))) .cse92)))) (concat ((_ extract 63 32) .cse89) ((_ extract 31 0) .cse89)))) (= (let ((.cse93 (bvadd (let ((.cse94 (bvadd .cse84 .cse25))) (concat ((_ extract 63 32) .cse94) ((_ extract 31 0) .cse94))) .cse85))) (concat ((_ extract 63 32) .cse93) ((_ extract 31 0) .cse93))) .cse1))))) (= .cse1 (let ((.cse96 (bvadd (let ((.cse97 (bvadd .cse88 .cse24))) (concat ((_ extract 63 32) .cse97) ((_ extract 31 0) .cse97))) .cse25))) (concat ((_ extract 63 32) .cse96) ((_ extract 31 0) .cse96))))))) (or .cse98 .cse99) (or (and (forall ((v_arrayElimCell_31 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32))) (let ((.cse102 (concat v_arrayElimCell_31 v_arrayElimCell_34))) (or (= .cse1 (let ((.cse100 (bvadd (let ((.cse101 (bvadd .cse102 .cse24))) (concat ((_ extract 63 32) .cse101) ((_ extract 31 0) .cse101))) .cse25))) (concat ((_ extract 63 32) .cse100) ((_ extract 31 0) .cse100)))) (forall ((v_arrayElimCell_32 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (= (let ((.cse103 (let ((.cse106 (concat v_arrayElimCell_33 v_arrayElimCell_32))) (bvadd (let ((.cse104 (bvadd (let ((.cse105 (bvadd .cse6 .cse106))) (concat ((_ extract 63 32) .cse105) ((_ extract 31 0) .cse105))) .cse102))) (concat ((_ extract 63 32) .cse104) ((_ extract 31 0) .cse104))) .cse106)))) (concat ((_ extract 63 32) .cse103) ((_ extract 31 0) .cse103))) .cse1))))) (forall ((v_arrayElimCell_31 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32))) (let ((.cse109 (concat v_arrayElimCell_31 v_arrayElimCell_34))) (or (= .cse1 (let ((.cse107 (bvadd (let ((.cse108 (bvadd .cse109 .cse24))) (concat ((_ extract 63 32) .cse108) ((_ extract 31 0) .cse108))) .cse25))) (concat ((_ extract 63 32) .cse107) ((_ extract 31 0) .cse107)))) (forall ((v_arrayElimCell_33 (_ BitVec 32))) (or (= .cse1 (let ((.cse110 (let ((.cse113 (concat v_arrayElimCell_33 .cse8))) (bvadd (let ((.cse111 (bvadd .cse109 (let ((.cse112 (bvadd .cse6 .cse113))) (concat ((_ extract 63 32) .cse112) ((_ extract 31 0) .cse112)))))) (concat ((_ extract 63 32) .cse111) ((_ extract 31 0) .cse111))) .cse113)))) (concat ((_ extract 63 32) .cse110) ((_ extract 31 0) .cse110)))) (forall ((v_arrayElimCell_32 (_ BitVec 32))) (let ((.cse117 (concat v_arrayElimCell_33 v_arrayElimCell_32))) (let ((.cse116 (let ((.cse120 (bvadd .cse6 .cse117))) (concat ((_ extract 63 32) .cse120) ((_ extract 31 0) .cse120))))) (or (= (let ((.cse114 (bvadd (let ((.cse115 (bvadd .cse116 (concat .cse12 v_arrayElimCell_34)))) (concat ((_ extract 63 32) .cse115) ((_ extract 31 0) .cse115))) .cse117))) (concat ((_ extract 63 32) .cse114) ((_ extract 31 0) .cse114))) .cse1) (= (let ((.cse118 (bvadd (let ((.cse119 (bvadd .cse116 .cse109))) (concat ((_ extract 63 32) .cse119) ((_ extract 31 0) .cse119))) .cse117))) (concat ((_ extract 63 32) .cse118) ((_ extract 31 0) .cse118))) .cse1)))))))))) (forall ((v_arrayElimCell_31 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32))) (let ((.cse123 (concat v_arrayElimCell_31 v_arrayElimCell_34))) (or (= .cse1 (let ((.cse121 (bvadd (let ((.cse122 (bvadd .cse123 .cse24))) (concat ((_ extract 63 32) .cse122) ((_ extract 31 0) .cse122))) .cse25))) (concat ((_ extract 63 32) .cse121) ((_ extract 31 0) .cse121)))) (forall ((v_arrayElimCell_32 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse127 (concat v_arrayElimCell_33 v_arrayElimCell_32))) (let ((.cse126 (let ((.cse130 (bvadd .cse6 .cse127))) (concat ((_ extract 63 32) .cse130) ((_ extract 31 0) .cse130))))) (or (= (let ((.cse124 (bvadd (let ((.cse125 (bvadd .cse126 (concat .cse12 v_arrayElimCell_34)))) (concat ((_ extract 63 32) .cse125) ((_ extract 31 0) .cse125))) .cse127))) (concat ((_ extract 63 32) .cse124) ((_ extract 31 0) .cse124))) .cse1) (= (let ((.cse128 (bvadd (let ((.cse129 (bvadd .cse126 .cse123))) (concat ((_ extract 63 32) .cse129) ((_ extract 31 0) .cse129))) .cse127))) (concat ((_ extract 63 32) .cse128) ((_ extract 31 0) .cse128))) .cse1)))))))) (forall ((v_arrayElimCell_31 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32))) (let ((.cse133 (concat v_arrayElimCell_31 v_arrayElimCell_34))) (or (forall ((v_arrayElimCell_33 (_ BitVec 32))) (or (= .cse1 (let ((.cse131 (let ((.cse135 (concat v_arrayElimCell_33 .cse8))) (bvadd (let ((.cse132 (bvadd .cse133 (let ((.cse134 (bvadd .cse6 .cse135))) (concat ((_ extract 63 32) .cse134) ((_ extract 31 0) .cse134)))))) (concat ((_ extract 63 32) .cse132) ((_ extract 31 0) .cse132))) .cse135)))) (concat ((_ extract 63 32) .cse131) ((_ extract 31 0) .cse131)))) (forall ((v_arrayElimCell_32 (_ BitVec 32))) (= (let ((.cse136 (let ((.cse139 (concat v_arrayElimCell_33 v_arrayElimCell_32))) (bvadd (let ((.cse137 (bvadd (let ((.cse138 (bvadd .cse6 .cse139))) (concat ((_ extract 63 32) .cse138) ((_ extract 31 0) .cse138))) .cse133))) (concat ((_ extract 63 32) .cse137) ((_ extract 31 0) .cse137))) .cse139)))) (concat ((_ extract 63 32) .cse136) ((_ extract 31 0) .cse136))) .cse1)))) (= .cse1 (let ((.cse140 (bvadd (let ((.cse141 (bvadd .cse133 .cse24))) (concat ((_ extract 63 32) .cse141) ((_ extract 31 0) .cse141))) .cse25))) (concat ((_ extract 63 32) .cse140) ((_ extract 31 0) .cse140)))))))) .cse0) (or .cse98 .cse142 .cse143) (forall ((v_arrayElimCell_31 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32))) (let ((.cse146 (concat v_arrayElimCell_31 v_arrayElimCell_34))) (or (= .cse1 (let ((.cse144 (bvadd (let ((.cse145 (bvadd .cse146 .cse24))) (concat ((_ extract 63 32) .cse145) ((_ extract 31 0) .cse145))) .cse25))) (concat ((_ extract 63 32) .cse144) ((_ extract 31 0) .cse144)))) (forall ((v_arrayElimCell_32 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse150 (concat v_arrayElimCell_33 v_arrayElimCell_32))) (let ((.cse149 (let ((.cse157 (bvadd .cse6 .cse150))) (concat ((_ extract 63 32) .cse157) ((_ extract 31 0) .cse157))))) (or (= (let ((.cse147 (bvadd (let ((.cse148 (bvadd .cse149 .cse146))) (concat ((_ extract 63 32) .cse148) ((_ extract 31 0) .cse148))) .cse150))) (concat ((_ extract 63 32) .cse147) ((_ extract 31 0) .cse147))) .cse1) (= .cse1 (let ((.cse151 (let ((.cse154 (concat v_arrayElimCell_33 .cse8))) (bvadd (let ((.cse152 (bvadd .cse146 (let ((.cse153 (bvadd .cse6 .cse154))) (concat ((_ extract 63 32) .cse153) ((_ extract 31 0) .cse153)))))) (concat ((_ extract 63 32) .cse152) ((_ extract 31 0) .cse152))) .cse154)))) (concat ((_ extract 63 32) .cse151) ((_ extract 31 0) .cse151)))) (= (let ((.cse155 (bvadd (let ((.cse156 (bvadd .cse149 .cse25))) (concat ((_ extract 63 32) .cse156) ((_ extract 31 0) .cse156))) .cse150))) (concat ((_ extract 63 32) .cse155) ((_ extract 31 0) .cse155))) .cse1)))))))) (forall ((v_arrayElimCell_31 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32))) (let ((.cse161 (concat v_arrayElimCell_31 v_arrayElimCell_34))) (or (forall ((v_arrayElimCell_32 (_ BitVec 32))) (or (forall ((v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse162 (concat v_arrayElimCell_33 v_arrayElimCell_32))) (let ((.cse160 (let ((.cse169 (bvadd .cse6 .cse162))) (concat ((_ extract 63 32) .cse169) ((_ extract 31 0) .cse169))))) (or (= (let ((.cse158 (bvadd (let ((.cse159 (bvadd .cse160 .cse161))) (concat ((_ extract 63 32) .cse159) ((_ extract 31 0) .cse159))) .cse162))) (concat ((_ extract 63 32) .cse158) ((_ extract 31 0) .cse158))) .cse1) (= .cse1 (let ((.cse163 (let ((.cse166 (concat v_arrayElimCell_33 .cse8))) (bvadd (let ((.cse164 (bvadd .cse161 (let ((.cse165 (bvadd .cse6 .cse166))) (concat ((_ extract 63 32) .cse165) ((_ extract 31 0) .cse165)))))) (concat ((_ extract 63 32) .cse164) ((_ extract 31 0) .cse164))) .cse166)))) (concat ((_ extract 63 32) .cse163) ((_ extract 31 0) .cse163)))) (= (let ((.cse167 (bvadd (let ((.cse168 (bvadd .cse160 .cse25))) (concat ((_ extract 63 32) .cse168) ((_ extract 31 0) .cse168))) .cse162))) (concat ((_ extract 63 32) .cse167) ((_ extract 31 0) .cse167))) .cse1))))) (= (let ((.cse170 (let ((.cse171 (concat .cse12 v_arrayElimCell_32))) (bvadd .cse171 (let ((.cse172 (bvadd .cse19 (let ((.cse173 (bvadd .cse171 .cse6))) (concat ((_ extract 63 32) .cse173) ((_ extract 31 0) .cse173)))))) (concat ((_ extract 63 32) .cse172) ((_ extract 31 0) .cse172))))))) (concat ((_ extract 63 32) .cse170) ((_ extract 31 0) .cse170))) .cse1))) (= .cse1 (let ((.cse174 (bvadd (let ((.cse175 (bvadd .cse161 .cse24))) (concat ((_ extract 63 32) .cse175) ((_ extract 31 0) .cse175))) .cse25))) (concat ((_ extract 63 32) .cse174) ((_ extract 31 0) .cse174))))))) (forall ((v_arrayElimCell_31 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32))) (let ((.cse182 (concat v_arrayElimCell_31 v_arrayElimCell_34))) (or (forall ((v_arrayElimCell_32 (_ BitVec 32))) (or (forall ((v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse179 (concat v_arrayElimCell_33 v_arrayElimCell_32))) (let ((.cse178 (let ((.cse189 (bvadd .cse6 .cse179))) (concat ((_ extract 63 32) .cse189) ((_ extract 31 0) .cse189))))) (or (= (let ((.cse176 (bvadd (let ((.cse177 (bvadd .cse178 (concat .cse12 v_arrayElimCell_34)))) (concat ((_ extract 63 32) .cse177) ((_ extract 31 0) .cse177))) .cse179))) (concat ((_ extract 63 32) .cse176) ((_ extract 31 0) .cse176))) .cse1) (= (let ((.cse180 (bvadd (let ((.cse181 (bvadd .cse178 .cse182))) (concat ((_ extract 63 32) .cse181) ((_ extract 31 0) .cse181))) .cse179))) (concat ((_ extract 63 32) .cse180) ((_ extract 31 0) .cse180))) .cse1) (= .cse1 (let ((.cse183 (let ((.cse186 (concat v_arrayElimCell_33 .cse8))) (bvadd (let ((.cse184 (bvadd .cse182 (let ((.cse185 (bvadd .cse6 .cse186))) (concat ((_ extract 63 32) .cse185) ((_ extract 31 0) .cse185)))))) (concat ((_ extract 63 32) .cse184) ((_ extract 31 0) .cse184))) .cse186)))) (concat ((_ extract 63 32) .cse183) ((_ extract 31 0) .cse183)))) (= (let ((.cse187 (bvadd (let ((.cse188 (bvadd .cse178 .cse25))) (concat ((_ extract 63 32) .cse188) ((_ extract 31 0) .cse188))) .cse179))) (concat ((_ extract 63 32) .cse187) ((_ extract 31 0) .cse187))) .cse1))))) (= (let ((.cse190 (let ((.cse191 (concat .cse12 v_arrayElimCell_32))) (bvadd .cse191 (let ((.cse192 (bvadd .cse19 (let ((.cse193 (bvadd .cse191 .cse6))) (concat ((_ extract 63 32) .cse193) ((_ extract 31 0) .cse193)))))) (concat ((_ extract 63 32) .cse192) ((_ extract 31 0) .cse192))))))) (concat ((_ extract 63 32) .cse190) ((_ extract 31 0) .cse190))) .cse1))) (= .cse1 (let ((.cse194 (bvadd (let ((.cse195 (bvadd .cse182 .cse24))) (concat ((_ extract 63 32) .cse195) ((_ extract 31 0) .cse195))) .cse25))) (concat ((_ extract 63 32) .cse194) ((_ extract 31 0) .cse194))))))) (forall ((v_arrayElimCell_31 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32))) (let ((.cse202 (concat v_arrayElimCell_31 v_arrayElimCell_34))) (or (forall ((v_arrayElimCell_32 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse199 (concat v_arrayElimCell_33 v_arrayElimCell_32))) (let ((.cse198 (let ((.cse205 (bvadd .cse6 .cse199))) (concat ((_ extract 63 32) .cse205) ((_ extract 31 0) .cse205))))) (or (= (let ((.cse196 (bvadd (let ((.cse197 (bvadd .cse198 (concat .cse12 v_arrayElimCell_34)))) (concat ((_ extract 63 32) .cse197) ((_ extract 31 0) .cse197))) .cse199))) (concat ((_ extract 63 32) .cse196) ((_ extract 31 0) .cse196))) .cse1) (= (let ((.cse200 (bvadd (let ((.cse201 (bvadd .cse198 .cse202))) (concat ((_ extract 63 32) .cse201) ((_ extract 31 0) .cse201))) .cse199))) (concat ((_ extract 63 32) .cse200) ((_ extract 31 0) .cse200))) .cse1) (= (let ((.cse203 (bvadd (let ((.cse204 (bvadd .cse198 .cse25))) (concat ((_ extract 63 32) .cse204) ((_ extract 31 0) .cse204))) .cse199))) (concat ((_ extract 63 32) .cse203) ((_ extract 31 0) .cse203))) .cse1))))) (= .cse1 (let ((.cse206 (bvadd (let ((.cse207 (bvadd .cse202 .cse24))) (concat ((_ extract 63 32) .cse207) ((_ extract 31 0) .cse207))) .cse25))) (concat ((_ extract 63 32) .cse206) ((_ extract 31 0) .cse206))))))) (forall ((v_arrayElimCell_31 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32))) (let ((.cse211 (concat v_arrayElimCell_31 v_arrayElimCell_34))) (or (forall ((v_arrayElimCell_32 (_ BitVec 32))) (or (forall ((v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse212 (concat v_arrayElimCell_33 v_arrayElimCell_32))) (let ((.cse210 (let ((.cse215 (bvadd .cse6 .cse212))) (concat ((_ extract 63 32) .cse215) ((_ extract 31 0) .cse215))))) (or (= (let ((.cse208 (bvadd (let ((.cse209 (bvadd .cse210 .cse211))) (concat ((_ extract 63 32) .cse209) ((_ extract 31 0) .cse209))) .cse212))) (concat ((_ extract 63 32) .cse208) ((_ extract 31 0) .cse208))) .cse1) (= (let ((.cse213 (bvadd (let ((.cse214 (bvadd .cse210 .cse25))) (concat ((_ extract 63 32) .cse214) ((_ extract 31 0) .cse214))) .cse212))) (concat ((_ extract 63 32) .cse213) ((_ extract 31 0) .cse213))) .cse1))))) (= (let ((.cse216 (let ((.cse217 (concat .cse12 v_arrayElimCell_32))) (bvadd .cse217 (let ((.cse218 (bvadd .cse19 (let ((.cse219 (bvadd .cse217 .cse6))) (concat ((_ extract 63 32) .cse219) ((_ extract 31 0) .cse219)))))) (concat ((_ extract 63 32) .cse218) ((_ extract 31 0) .cse218))))))) (concat ((_ extract 63 32) .cse216) ((_ extract 31 0) .cse216))) .cse1))) (= .cse1 (let ((.cse220 (bvadd (let ((.cse221 (bvadd .cse211 .cse24))) (concat ((_ extract 63 32) .cse221) ((_ extract 31 0) .cse221))) .cse25))) (concat ((_ extract 63 32) .cse220) ((_ extract 31 0) .cse220))))))) (forall ((v_arrayElimCell_31 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32))) (let ((.cse225 (concat v_arrayElimCell_31 v_arrayElimCell_34))) (or (forall ((v_arrayElimCell_32 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse226 (concat v_arrayElimCell_33 v_arrayElimCell_32))) (let ((.cse224 (let ((.cse229 (bvadd .cse6 .cse226))) (concat ((_ extract 63 32) .cse229) ((_ extract 31 0) .cse229))))) (or (= (let ((.cse222 (bvadd (let ((.cse223 (bvadd .cse224 .cse225))) (concat ((_ extract 63 32) .cse223) ((_ extract 31 0) .cse223))) .cse226))) (concat ((_ extract 63 32) .cse222) ((_ extract 31 0) .cse222))) .cse1) (= (let ((.cse227 (bvadd (let ((.cse228 (bvadd .cse224 .cse25))) (concat ((_ extract 63 32) .cse228) ((_ extract 31 0) .cse228))) .cse226))) (concat ((_ extract 63 32) .cse227) ((_ extract 31 0) .cse227))) .cse1))))) (= .cse1 (let ((.cse230 (bvadd (let ((.cse231 (bvadd .cse225 .cse24))) (concat ((_ extract 63 32) .cse231) ((_ extract 31 0) .cse231))) .cse25))) (concat ((_ extract 63 32) .cse230) ((_ extract 31 0) .cse230))))))) (or .cse98 .cse232 .cse143)) .cse233) (or .cse98 (not .cse234)) (or (and (forall ((v_arrayElimCell_32 (_ BitVec 32)) (v_arrayElimCell_31 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse238 (concat v_arrayElimCell_33 v_arrayElimCell_32))) (let ((.cse241 (concat v_arrayElimCell_31 v_arrayElimCell_34)) (.cse237 (let ((.cse248 (bvadd .cse6 .cse238))) (concat ((_ extract 63 32) .cse248) ((_ extract 31 0) .cse248))))) (or (= (let ((.cse235 (bvadd (let ((.cse236 (bvadd .cse237 (concat .cse12 v_arrayElimCell_34)))) (concat ((_ extract 63 32) .cse236) ((_ extract 31 0) .cse236))) .cse238))) (concat ((_ extract 63 32) .cse235) ((_ extract 31 0) .cse235))) .cse1) (= (let ((.cse239 (bvadd (let ((.cse240 (bvadd .cse237 .cse241))) (concat ((_ extract 63 32) .cse240) ((_ extract 31 0) .cse240))) .cse238))) (concat ((_ extract 63 32) .cse239) ((_ extract 31 0) .cse239))) .cse1) (= .cse1 (let ((.cse242 (let ((.cse245 (concat v_arrayElimCell_33 .cse8))) (bvadd (let ((.cse243 (bvadd .cse241 (let ((.cse244 (bvadd .cse6 .cse245))) (concat ((_ extract 63 32) .cse244) ((_ extract 31 0) .cse244)))))) (concat ((_ extract 63 32) .cse243) ((_ extract 31 0) .cse243))) .cse245)))) (concat ((_ extract 63 32) .cse242) ((_ extract 31 0) .cse242)))) (= (let ((.cse246 (bvadd (let ((.cse247 (bvadd .cse237 .cse25))) (concat ((_ extract 63 32) .cse247) ((_ extract 31 0) .cse247))) .cse238))) (concat ((_ extract 63 32) .cse246) ((_ extract 31 0) .cse246))) .cse1))))) (or (and (forall ((v_arrayElimCell_32 (_ BitVec 32)) (v_arrayElimCell_31 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse252 (concat v_arrayElimCell_33 v_arrayElimCell_32))) (let ((.cse251 (let ((.cse255 (bvadd .cse6 .cse252))) (concat ((_ extract 63 32) .cse255) ((_ extract 31 0) .cse255))))) (or (= (let ((.cse249 (bvadd (let ((.cse250 (bvadd .cse251 (concat .cse12 v_arrayElimCell_34)))) (concat ((_ extract 63 32) .cse250) ((_ extract 31 0) .cse250))) .cse252))) (concat ((_ extract 63 32) .cse249) ((_ extract 31 0) .cse249))) .cse1) (= (let ((.cse253 (bvadd (let ((.cse254 (bvadd .cse251 (concat v_arrayElimCell_31 v_arrayElimCell_34)))) (concat ((_ extract 63 32) .cse254) ((_ extract 31 0) .cse254))) .cse252))) (concat ((_ extract 63 32) .cse253) ((_ extract 31 0) .cse253))) .cse1))))) (forall ((v_arrayElimCell_31 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse258 (concat v_arrayElimCell_31 v_arrayElimCell_34))) (or (= .cse1 (let ((.cse256 (let ((.cse260 (concat v_arrayElimCell_33 .cse8))) (bvadd (let ((.cse257 (bvadd .cse258 (let ((.cse259 (bvadd .cse6 .cse260))) (concat ((_ extract 63 32) .cse259) ((_ extract 31 0) .cse259)))))) (concat ((_ extract 63 32) .cse257) ((_ extract 31 0) .cse257))) .cse260)))) (concat ((_ extract 63 32) .cse256) ((_ extract 31 0) .cse256)))) (forall ((v_arrayElimCell_32 (_ BitVec 32))) (= (let ((.cse261 (let ((.cse264 (concat v_arrayElimCell_33 v_arrayElimCell_32))) (bvadd (let ((.cse262 (bvadd (let ((.cse263 (bvadd .cse6 .cse264))) (concat ((_ extract 63 32) .cse263) ((_ extract 31 0) .cse263))) .cse258))) (concat ((_ extract 63 32) .cse262) ((_ extract 31 0) .cse262))) .cse264)))) (concat ((_ extract 63 32) .cse261) ((_ extract 31 0) .cse261))) .cse1))))) (forall ((v_arrayElimCell_31 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse267 (concat v_arrayElimCell_31 v_arrayElimCell_34))) (or (= .cse1 (let ((.cse265 (let ((.cse269 (concat v_arrayElimCell_33 .cse8))) (bvadd (let ((.cse266 (bvadd .cse267 (let ((.cse268 (bvadd .cse6 .cse269))) (concat ((_ extract 63 32) .cse268) ((_ extract 31 0) .cse268)))))) (concat ((_ extract 63 32) .cse266) ((_ extract 31 0) .cse266))) .cse269)))) (concat ((_ extract 63 32) .cse265) ((_ extract 31 0) .cse265)))) (forall ((v_arrayElimCell_32 (_ BitVec 32))) (let ((.cse273 (concat v_arrayElimCell_33 v_arrayElimCell_32))) (let ((.cse272 (let ((.cse276 (bvadd .cse6 .cse273))) (concat ((_ extract 63 32) .cse276) ((_ extract 31 0) .cse276))))) (or (= (let ((.cse270 (bvadd (let ((.cse271 (bvadd .cse272 (concat .cse12 v_arrayElimCell_34)))) (concat ((_ extract 63 32) .cse271) ((_ extract 31 0) .cse271))) .cse273))) (concat ((_ extract 63 32) .cse270) ((_ extract 31 0) .cse270))) .cse1) (= (let ((.cse274 (bvadd (let ((.cse275 (bvadd .cse272 .cse267))) (concat ((_ extract 63 32) .cse275) ((_ extract 31 0) .cse275))) .cse273))) (concat ((_ extract 63 32) .cse274) ((_ extract 31 0) .cse274))) .cse1)))))))) (forall ((v_arrayElimCell_32 (_ BitVec 32)) (v_arrayElimCell_31 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (= (let ((.cse277 (let ((.cse280 (concat v_arrayElimCell_33 v_arrayElimCell_32))) (bvadd (let ((.cse278 (bvadd (let ((.cse279 (bvadd .cse6 .cse280))) (concat ((_ extract 63 32) .cse279) ((_ extract 31 0) .cse279))) (concat v_arrayElimCell_31 v_arrayElimCell_34)))) (concat ((_ extract 63 32) .cse278) ((_ extract 31 0) .cse278))) .cse280)))) (concat ((_ extract 63 32) .cse277) ((_ extract 31 0) .cse277))) .cse1))) .cse0) (forall ((v_arrayElimCell_32 (_ BitVec 32)) (v_arrayElimCell_31 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse285 (concat v_arrayElimCell_33 v_arrayElimCell_32))) (let ((.cse284 (concat v_arrayElimCell_31 v_arrayElimCell_34)) (.cse283 (let ((.cse292 (bvadd .cse6 .cse285))) (concat ((_ extract 63 32) .cse292) ((_ extract 31 0) .cse292))))) (or (= (let ((.cse281 (bvadd (let ((.cse282 (bvadd .cse283 .cse284))) (concat ((_ extract 63 32) .cse282) ((_ extract 31 0) .cse282))) .cse285))) (concat ((_ extract 63 32) .cse281) ((_ extract 31 0) .cse281))) .cse1) (= .cse1 (let ((.cse286 (let ((.cse289 (concat v_arrayElimCell_33 .cse8))) (bvadd (let ((.cse287 (bvadd .cse284 (let ((.cse288 (bvadd .cse6 .cse289))) (concat ((_ extract 63 32) .cse288) ((_ extract 31 0) .cse288)))))) (concat ((_ extract 63 32) .cse287) ((_ extract 31 0) .cse287))) .cse289)))) (concat ((_ extract 63 32) .cse286) ((_ extract 31 0) .cse286)))) (= (let ((.cse290 (bvadd (let ((.cse291 (bvadd .cse283 .cse25))) (concat ((_ extract 63 32) .cse291) ((_ extract 31 0) .cse291))) .cse285))) (concat ((_ extract 63 32) .cse290) ((_ extract 31 0) .cse290))) .cse1))))) (forall ((v_arrayElimCell_32 (_ BitVec 32)) (v_arrayElimCell_31 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32))) (or (forall ((v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse296 (concat v_arrayElimCell_33 v_arrayElimCell_32))) (let ((.cse299 (concat v_arrayElimCell_31 v_arrayElimCell_34)) (.cse295 (let ((.cse306 (bvadd .cse6 .cse296))) (concat ((_ extract 63 32) .cse306) ((_ extract 31 0) .cse306))))) (or (= (let ((.cse293 (bvadd (let ((.cse294 (bvadd .cse295 (concat .cse12 v_arrayElimCell_34)))) (concat ((_ extract 63 32) .cse294) ((_ extract 31 0) .cse294))) .cse296))) (concat ((_ extract 63 32) .cse293) ((_ extract 31 0) .cse293))) .cse1) (= (let ((.cse297 (bvadd (let ((.cse298 (bvadd .cse295 .cse299))) (concat ((_ extract 63 32) .cse298) ((_ extract 31 0) .cse298))) .cse296))) (concat ((_ extract 63 32) .cse297) ((_ extract 31 0) .cse297))) .cse1) (= .cse1 (let ((.cse300 (let ((.cse303 (concat v_arrayElimCell_33 .cse8))) (bvadd (let ((.cse301 (bvadd .cse299 (let ((.cse302 (bvadd .cse6 .cse303))) (concat ((_ extract 63 32) .cse302) ((_ extract 31 0) .cse302)))))) (concat ((_ extract 63 32) .cse301) ((_ extract 31 0) .cse301))) .cse303)))) (concat ((_ extract 63 32) .cse300) ((_ extract 31 0) .cse300)))) (= (let ((.cse304 (bvadd (let ((.cse305 (bvadd .cse295 .cse25))) (concat ((_ extract 63 32) .cse305) ((_ extract 31 0) .cse305))) .cse296))) (concat ((_ extract 63 32) .cse304) ((_ extract 31 0) .cse304))) .cse1))))) (= (let ((.cse307 (let ((.cse308 (concat .cse12 v_arrayElimCell_32))) (bvadd .cse308 (let ((.cse309 (bvadd .cse19 (let ((.cse310 (bvadd .cse308 .cse6))) (concat ((_ extract 63 32) .cse310) ((_ extract 31 0) .cse310)))))) (concat ((_ extract 63 32) .cse309) ((_ extract 31 0) .cse309))))))) (concat ((_ extract 63 32) .cse307) ((_ extract 31 0) .cse307))) .cse1))) (or .cse232 .cse143) (forall ((v_arrayElimCell_32 (_ BitVec 32)) (v_arrayElimCell_31 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse314 (concat v_arrayElimCell_33 v_arrayElimCell_32))) (let ((.cse313 (let ((.cse319 (bvadd .cse6 .cse314))) (concat ((_ extract 63 32) .cse319) ((_ extract 31 0) .cse319))))) (or (= (let ((.cse311 (bvadd (let ((.cse312 (bvadd .cse313 (concat .cse12 v_arrayElimCell_34)))) (concat ((_ extract 63 32) .cse312) ((_ extract 31 0) .cse312))) .cse314))) (concat ((_ extract 63 32) .cse311) ((_ extract 31 0) .cse311))) .cse1) (= (let ((.cse315 (bvadd (let ((.cse316 (bvadd .cse313 (concat v_arrayElimCell_31 v_arrayElimCell_34)))) (concat ((_ extract 63 32) .cse316) ((_ extract 31 0) .cse316))) .cse314))) (concat ((_ extract 63 32) .cse315) ((_ extract 31 0) .cse315))) .cse1) (= (let ((.cse317 (bvadd (let ((.cse318 (bvadd .cse313 .cse25))) (concat ((_ extract 63 32) .cse318) ((_ extract 31 0) .cse318))) .cse314))) (concat ((_ extract 63 32) .cse317) ((_ extract 31 0) .cse317))) .cse1))))) (forall ((v_arrayElimCell_32 (_ BitVec 32)) (v_arrayElimCell_31 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32))) (or (forall ((v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse323 (concat v_arrayElimCell_33 v_arrayElimCell_32))) (let ((.cse322 (let ((.cse328 (bvadd .cse6 .cse323))) (concat ((_ extract 63 32) .cse328) ((_ extract 31 0) .cse328))))) (or (= (let ((.cse320 (bvadd (let ((.cse321 (bvadd .cse322 (concat .cse12 v_arrayElimCell_34)))) (concat ((_ extract 63 32) .cse321) ((_ extract 31 0) .cse321))) .cse323))) (concat ((_ extract 63 32) .cse320) ((_ extract 31 0) .cse320))) .cse1) (= (let ((.cse324 (bvadd (let ((.cse325 (bvadd .cse322 (concat v_arrayElimCell_31 v_arrayElimCell_34)))) (concat ((_ extract 63 32) .cse325) ((_ extract 31 0) .cse325))) .cse323))) (concat ((_ extract 63 32) .cse324) ((_ extract 31 0) .cse324))) .cse1) (= (let ((.cse326 (bvadd (let ((.cse327 (bvadd .cse322 .cse25))) (concat ((_ extract 63 32) .cse327) ((_ extract 31 0) .cse327))) .cse323))) (concat ((_ extract 63 32) .cse326) ((_ extract 31 0) .cse326))) .cse1))))) (= (let ((.cse329 (let ((.cse330 (concat .cse12 v_arrayElimCell_32))) (bvadd .cse330 (let ((.cse331 (bvadd .cse19 (let ((.cse332 (bvadd .cse330 .cse6))) (concat ((_ extract 63 32) .cse332) ((_ extract 31 0) .cse332)))))) (concat ((_ extract 63 32) .cse331) ((_ extract 31 0) .cse331))))))) (concat ((_ extract 63 32) .cse329) ((_ extract 31 0) .cse329))) .cse1))) (forall ((v_arrayElimCell_32 (_ BitVec 32)) (v_arrayElimCell_31 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32))) (or (forall ((v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse336 (concat v_arrayElimCell_33 v_arrayElimCell_32))) (let ((.cse335 (let ((.cse339 (bvadd .cse6 .cse336))) (concat ((_ extract 63 32) .cse339) ((_ extract 31 0) .cse339))))) (or (= (let ((.cse333 (bvadd (let ((.cse334 (bvadd .cse335 (concat v_arrayElimCell_31 v_arrayElimCell_34)))) (concat ((_ extract 63 32) .cse334) ((_ extract 31 0) .cse334))) .cse336))) (concat ((_ extract 63 32) .cse333) ((_ extract 31 0) .cse333))) .cse1) (= (let ((.cse337 (bvadd (let ((.cse338 (bvadd .cse335 .cse25))) (concat ((_ extract 63 32) .cse338) ((_ extract 31 0) .cse338))) .cse336))) (concat ((_ extract 63 32) .cse337) ((_ extract 31 0) .cse337))) .cse1))))) (= (let ((.cse340 (let ((.cse341 (concat .cse12 v_arrayElimCell_32))) (bvadd .cse341 (let ((.cse342 (bvadd .cse19 (let ((.cse343 (bvadd .cse341 .cse6))) (concat ((_ extract 63 32) .cse343) ((_ extract 31 0) .cse343)))))) (concat ((_ extract 63 32) .cse342) ((_ extract 31 0) .cse342))))))) (concat ((_ extract 63 32) .cse340) ((_ extract 31 0) .cse340))) .cse1))) (or .cse142 .cse143) (forall ((v_arrayElimCell_32 (_ BitVec 32)) (v_arrayElimCell_31 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32))) (or (forall ((v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse348 (concat v_arrayElimCell_33 v_arrayElimCell_32))) (let ((.cse347 (concat v_arrayElimCell_31 v_arrayElimCell_34)) (.cse346 (let ((.cse355 (bvadd .cse6 .cse348))) (concat ((_ extract 63 32) .cse355) ((_ extract 31 0) .cse355))))) (or (= (let ((.cse344 (bvadd (let ((.cse345 (bvadd .cse346 .cse347))) (concat ((_ extract 63 32) .cse345) ((_ extract 31 0) .cse345))) .cse348))) (concat ((_ extract 63 32) .cse344) ((_ extract 31 0) .cse344))) .cse1) (= .cse1 (let ((.cse349 (let ((.cse352 (concat v_arrayElimCell_33 .cse8))) (bvadd (let ((.cse350 (bvadd .cse347 (let ((.cse351 (bvadd .cse6 .cse352))) (concat ((_ extract 63 32) .cse351) ((_ extract 31 0) .cse351)))))) (concat ((_ extract 63 32) .cse350) ((_ extract 31 0) .cse350))) .cse352)))) (concat ((_ extract 63 32) .cse349) ((_ extract 31 0) .cse349)))) (= (let ((.cse353 (bvadd (let ((.cse354 (bvadd .cse346 .cse25))) (concat ((_ extract 63 32) .cse354) ((_ extract 31 0) .cse354))) .cse348))) (concat ((_ extract 63 32) .cse353) ((_ extract 31 0) .cse353))) .cse1))))) (= (let ((.cse356 (let ((.cse357 (concat .cse12 v_arrayElimCell_32))) (bvadd .cse357 (let ((.cse358 (bvadd .cse19 (let ((.cse359 (bvadd .cse357 .cse6))) (concat ((_ extract 63 32) .cse359) ((_ extract 31 0) .cse359)))))) (concat ((_ extract 63 32) .cse358) ((_ extract 31 0) .cse358))))))) (concat ((_ extract 63 32) .cse356) ((_ extract 31 0) .cse356))) .cse1))) (forall ((v_arrayElimCell_32 (_ BitVec 32)) (v_arrayElimCell_31 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse363 (concat v_arrayElimCell_33 v_arrayElimCell_32))) (let ((.cse362 (let ((.cse366 (bvadd .cse6 .cse363))) (concat ((_ extract 63 32) .cse366) ((_ extract 31 0) .cse366))))) (or (= (let ((.cse360 (bvadd (let ((.cse361 (bvadd .cse362 (concat v_arrayElimCell_31 v_arrayElimCell_34)))) (concat ((_ extract 63 32) .cse361) ((_ extract 31 0) .cse361))) .cse363))) (concat ((_ extract 63 32) .cse360) ((_ extract 31 0) .cse360))) .cse1) (= (let ((.cse364 (bvadd (let ((.cse365 (bvadd .cse362 .cse25))) (concat ((_ extract 63 32) .cse365) ((_ extract 31 0) .cse365))) .cse363))) (concat ((_ extract 63 32) .cse364) ((_ extract 31 0) .cse364))) .cse1))))) .cse99 (or (and (forall ((v_arrayElimCell_31 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse369 (concat v_arrayElimCell_31 v_arrayElimCell_34))) (or (= .cse1 (let ((.cse367 (let ((.cse371 (concat v_arrayElimCell_33 .cse8))) (bvadd (let ((.cse368 (bvadd .cse369 (let ((.cse370 (bvadd .cse6 .cse371))) (concat ((_ extract 63 32) .cse370) ((_ extract 31 0) .cse370)))))) (concat ((_ extract 63 32) .cse368) ((_ extract 31 0) .cse368))) .cse371)))) (concat ((_ extract 63 32) .cse367) ((_ extract 31 0) .cse367)))) (forall ((v_arrayElimCell_32 (_ BitVec 32))) (or (= (let ((.cse372 (let ((.cse375 (concat v_arrayElimCell_33 v_arrayElimCell_32))) (bvadd (let ((.cse373 (bvadd (let ((.cse374 (bvadd .cse6 .cse375))) (concat ((_ extract 63 32) .cse374) ((_ extract 31 0) .cse374))) .cse369))) (concat ((_ extract 63 32) .cse373) ((_ extract 31 0) .cse373))) .cse375)))) (concat ((_ extract 63 32) .cse372) ((_ extract 31 0) .cse372))) .cse1) (= (let ((.cse376 (let ((.cse377 (concat .cse12 v_arrayElimCell_32))) (bvadd .cse377 (let ((.cse378 (bvadd .cse19 (let ((.cse379 (bvadd .cse377 .cse6))) (concat ((_ extract 63 32) .cse379) ((_ extract 31 0) .cse379)))))) (concat ((_ extract 63 32) .cse378) ((_ extract 31 0) .cse378))))))) (concat ((_ extract 63 32) .cse376) ((_ extract 31 0) .cse376))) .cse1)))))) (forall ((v_arrayElimCell_31 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse382 (concat v_arrayElimCell_31 v_arrayElimCell_34))) (or (= .cse1 (let ((.cse380 (let ((.cse384 (concat v_arrayElimCell_33 .cse8))) (bvadd (let ((.cse381 (bvadd .cse382 (let ((.cse383 (bvadd .cse6 .cse384))) (concat ((_ extract 63 32) .cse383) ((_ extract 31 0) .cse383)))))) (concat ((_ extract 63 32) .cse381) ((_ extract 31 0) .cse381))) .cse384)))) (concat ((_ extract 63 32) .cse380) ((_ extract 31 0) .cse380)))) (forall ((v_arrayElimCell_32 (_ BitVec 32))) (let ((.cse388 (concat v_arrayElimCell_33 v_arrayElimCell_32))) (let ((.cse387 (let ((.cse395 (bvadd .cse6 .cse388))) (concat ((_ extract 63 32) .cse395) ((_ extract 31 0) .cse395))))) (or (= (let ((.cse385 (bvadd (let ((.cse386 (bvadd .cse387 (concat .cse12 v_arrayElimCell_34)))) (concat ((_ extract 63 32) .cse386) ((_ extract 31 0) .cse386))) .cse388))) (concat ((_ extract 63 32) .cse385) ((_ extract 31 0) .cse385))) .cse1) (= (let ((.cse389 (bvadd (let ((.cse390 (bvadd .cse387 .cse382))) (concat ((_ extract 63 32) .cse390) ((_ extract 31 0) .cse390))) .cse388))) (concat ((_ extract 63 32) .cse389) ((_ extract 31 0) .cse389))) .cse1) (= (let ((.cse391 (let ((.cse392 (concat .cse12 v_arrayElimCell_32))) (bvadd .cse392 (let ((.cse393 (bvadd .cse19 (let ((.cse394 (bvadd .cse392 .cse6))) (concat ((_ extract 63 32) .cse394) ((_ extract 31 0) .cse394)))))) (concat ((_ extract 63 32) .cse393) ((_ extract 31 0) .cse393))))))) (concat ((_ extract 63 32) .cse391) ((_ extract 31 0) .cse391))) .cse1)))))))) (forall ((v_arrayElimCell_32 (_ BitVec 32)) (v_arrayElimCell_31 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (or (= (let ((.cse396 (let ((.cse399 (concat v_arrayElimCell_33 v_arrayElimCell_32))) (bvadd (let ((.cse397 (bvadd (let ((.cse398 (bvadd .cse6 .cse399))) (concat ((_ extract 63 32) .cse398) ((_ extract 31 0) .cse398))) (concat v_arrayElimCell_31 v_arrayElimCell_34)))) (concat ((_ extract 63 32) .cse397) ((_ extract 31 0) .cse397))) .cse399)))) (concat ((_ extract 63 32) .cse396) ((_ extract 31 0) .cse396))) .cse1) (= (let ((.cse400 (let ((.cse401 (concat .cse12 v_arrayElimCell_32))) (bvadd .cse401 (let ((.cse402 (bvadd .cse19 (let ((.cse403 (bvadd .cse401 .cse6))) (concat ((_ extract 63 32) .cse403) ((_ extract 31 0) .cse403)))))) (concat ((_ extract 63 32) .cse402) ((_ extract 31 0) .cse402))))))) (concat ((_ extract 63 32) .cse400) ((_ extract 31 0) .cse400))) .cse1))) (forall ((v_arrayElimCell_32 (_ BitVec 32)) (v_arrayElimCell_31 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse407 (concat v_arrayElimCell_33 v_arrayElimCell_32))) (let ((.cse406 (let ((.cse414 (bvadd .cse6 .cse407))) (concat ((_ extract 63 32) .cse414) ((_ extract 31 0) .cse414))))) (or (= (let ((.cse404 (bvadd (let ((.cse405 (bvadd .cse406 (concat .cse12 v_arrayElimCell_34)))) (concat ((_ extract 63 32) .cse405) ((_ extract 31 0) .cse405))) .cse407))) (concat ((_ extract 63 32) .cse404) ((_ extract 31 0) .cse404))) .cse1) (= (let ((.cse408 (bvadd (let ((.cse409 (bvadd .cse406 (concat v_arrayElimCell_31 v_arrayElimCell_34)))) (concat ((_ extract 63 32) .cse409) ((_ extract 31 0) .cse409))) .cse407))) (concat ((_ extract 63 32) .cse408) ((_ extract 31 0) .cse408))) .cse1) (= (let ((.cse410 (let ((.cse411 (concat .cse12 v_arrayElimCell_32))) (bvadd .cse411 (let ((.cse412 (bvadd .cse19 (let ((.cse413 (bvadd .cse411 .cse6))) (concat ((_ extract 63 32) .cse413) ((_ extract 31 0) .cse413)))))) (concat ((_ extract 63 32) .cse412) ((_ extract 31 0) .cse412))))))) (concat ((_ extract 63 32) .cse410) ((_ extract 31 0) .cse410))) .cse1)))))) .cse0)) .cse233 .cse234)))))) (bvslt (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~i~0#1|) c_~N~0) (not (bvslt (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~i~0#1|) c_~N~0))) (not (bvsle c_~N~0 (_ bv0 32))) (= |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv0 32)) (= (select .cse434 (_ bv4 32)) ((_ extract 63 32) (_ bv0 64))) (= (_ bv0 32) |c_ULTIMATE.start_main_~i~0#1|) (bvule c_~N~0 (_ bv536870911 32)) (= (select .cse434 (_ bv0 32)) ((_ extract 31 0) (_ bv0 64))))) is different from true [2023-11-29 00:51:06,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:51:06,749 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2023-11-29 00:51:06,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-29 00:51:06,751 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-11-29 00:51:06,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:51:06,751 INFO L225 Difference]: With dead ends: 53 [2023-11-29 00:51:06,751 INFO L226 Difference]: Without dead ends: 51 [2023-11-29 00:51:06,752 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 18.5s TimeCoverageRelationStatistics Valid=182, Invalid=1084, Unknown=2, NotChecked=138, Total=1406 [2023-11-29 00:51:06,752 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 48 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 63 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:51:06,753 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 97 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 288 Invalid, 0 Unknown, 63 Unchecked, 3.1s Time] [2023-11-29 00:51:06,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-11-29 00:51:06,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 45. [2023-11-29 00:51:06,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.1818181818181819) internal successors, (52), 44 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) [2023-11-29 00:51:06,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2023-11-29 00:51:06,772 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 19 [2023-11-29 00:51:06,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:51:06,773 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2023-11-29 00:51:06,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:51:06,773 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2023-11-29 00:51:06,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-29 00:51:06,773 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:51:06,774 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:51:06,777 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-11-29 00:51:06,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:51:06,974 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:51:06,974 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:51:06,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1546114613, now seen corresponding path program 5 times [2023-11-29 00:51:06,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:51:06,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1626239834] [2023-11-29 00:51:06,975 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 00:51:06,975 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:51:06,975 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:51:06,976 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:51:06,977 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-11-29 00:51:07,127 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-11-29 00:51:07,127 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:51:07,133 INFO L262 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-29 00:51:07,134 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:51:07,839 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 00:51:07,839 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:51:08,787 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 00:51:08,787 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:51:08,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1626239834] [2023-11-29 00:51:08,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1626239834] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:51:08,787 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:51:08,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2023-11-29 00:51:08,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387454559] [2023-11-29 00:51:08,788 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:51:08,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-29 00:51:08,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:51:08,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-29 00:51:08,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2023-11-29 00:51:08,789 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. Second operand has 20 states, 20 states have (on average 1.5) internal successors, (30), 20 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:51:10,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:51:10,966 INFO L93 Difference]: Finished difference Result 112 states and 128 transitions. [2023-11-29 00:51:10,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-29 00:51:10,967 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.5) internal successors, (30), 20 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-11-29 00:51:10,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:51:10,968 INFO L225 Difference]: With dead ends: 112 [2023-11-29 00:51:10,968 INFO L226 Difference]: Without dead ends: 88 [2023-11-29 00:51:10,969 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=214, Invalid=656, Unknown=0, NotChecked=0, Total=870 [2023-11-29 00:51:10,970 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 210 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-11-29 00:51:10,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 145 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-11-29 00:51:10,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-11-29 00:51:10,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 57. [2023-11-29 00:51:10,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.1785714285714286) internal successors, (66), 56 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:51:10,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 66 transitions. [2023-11-29 00:51:10,997 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 66 transitions. Word has length 20 [2023-11-29 00:51:10,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:51:10,997 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 66 transitions. [2023-11-29 00:51:10,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.5) internal successors, (30), 20 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:51:10,997 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 66 transitions. [2023-11-29 00:51:10,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-29 00:51:10,998 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:51:10,998 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:51:11,002 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-11-29 00:51:11,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:51:11,199 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:51:11,199 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:51:11,199 INFO L85 PathProgramCache]: Analyzing trace with hash 337203711, now seen corresponding path program 1 times [2023-11-29 00:51:11,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:51:11,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [263744509] [2023-11-29 00:51:11,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:51:11,200 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:51:11,200 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:51:11,201 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:51:11,207 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-11-29 00:51:11,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:51:11,335 INFO L262 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 45 conjunts are in the unsatisfiable core [2023-11-29 00:51:11,340 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:51:11,468 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 00:51:11,469 INFO L378 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 16 treesize of output 17 [2023-11-29 00:51:11,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:51:11,635 INFO L378 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 16 treesize of output 17 [2023-11-29 00:51:11,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:51:11,831 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:51:11,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 39 [2023-11-29 00:51:12,411 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:51:12,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 53 [2023-11-29 00:51:12,663 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:51:12,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 85 [2023-11-29 00:51:13,335 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:51:13,335 INFO L378 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 6 case distinctions, treesize of input 186 treesize of output 117 [2023-11-29 00:51:13,600 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:51:13,601 INFO L378 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 3 case distinctions, treesize of input 183 treesize of output 154 [2023-11-29 00:51:13,613 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:51:13,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 149 treesize of output 117 [2023-11-29 00:51:14,902 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:51:14,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 293 treesize of output 257 [2023-11-29 00:51:15,010 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:51:15,010 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:51:22,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1981 treesize of output 1897 [2023-11-29 00:51:23,536 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:51:23,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 6045379004 treesize of output 5896481212 [2023-11-29 00:51:48,951 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse12 ((_ extract 63 32) (_ bv1 64))) (.cse28 ((_ extract 31 0) (_ bv1 64)))) (let ((.cse477 (bvmul (_ bv8 32) |c_ULTIMATE.start_main_~i~0#1|)) (.cse4 (concat .cse12 .cse28)) (.cse23 (let ((.cse479 (select |c_#memory_int#3| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (concat (select .cse479 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (select .cse479 |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (let ((.cse6 (let ((.cse478 (bvadd .cse4 .cse23))) (concat ((_ extract 63 32) .cse478) ((_ extract 31 0) .cse478)))) (.cse2 ((_ sign_extend 32) (bvadd c_~N~0 (_ bv1 32)))) (.cse3 (= .cse477 (_ bv0 32)))) (and (let ((.cse0 (bvadd .cse4 (let ((.cse5 (bvadd .cse4 .cse6))) (concat ((_ extract 63 32) .cse5) ((_ extract 31 0) .cse5)))))) (let ((.cse1 ((_ extract 31 0) .cse0))) (or (= (concat ((_ extract 63 32) .cse0) .cse1) .cse2) (not .cse3) (forall ((v_ArrVal_186 (_ BitVec 32))) (not (= (concat v_ArrVal_186 .cse1) .cse2)))))) (or (let ((.cse219 (= (bvadd (_ bv8 32) .cse477) (_ bv0 32))) (.cse26 (concat .cse28 .cse12)) (.cse58 (= (_ bv8 32) .cse477))) (let ((.cse109 (not .cse58)) (.cse110 (forall ((v_arrayElimCell_57 (_ BitVec 32)) (v_arrayElimCell_56 (_ BitVec 32)) (v_ArrVal_186 (_ BitVec 32))) (let ((.cse474 (concat v_arrayElimCell_57 v_arrayElimCell_56))) (let ((.cse473 (let ((.cse475 (bvadd .cse4 (let ((.cse476 (bvadd .cse23 .cse474))) (concat ((_ extract 63 32) .cse476) ((_ extract 31 0) .cse476)))))) (concat ((_ extract 63 32) .cse475) ((_ extract 31 0) .cse475))))) (or (= .cse2 (let ((.cse472 (bvadd .cse4 .cse473))) (concat ((_ extract 63 32) .cse472) ((_ extract 31 0) .cse472)))) (not (= .cse2 (concat v_ArrVal_186 ((_ extract 31 0) (bvadd .cse473 .cse474)))))))))) (.cse10 (let ((.cse471 (bvadd .cse26 .cse23))) (concat ((_ extract 63 32) .cse471) ((_ extract 31 0) .cse471)))) (.cse16 (not .cse219))) (and (or (forall ((v_arrayElimCell_58 (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32)) (v_ArrVal_186 (_ BitVec 32))) (let ((.cse14 (concat v_arrayElimCell_55 v_arrayElimCell_58))) (let ((.cse7 (let ((.cse15 (bvadd .cse14 .cse6))) (concat ((_ extract 63 32) .cse15) ((_ extract 31 0) .cse15))))) (or (not (= (concat v_ArrVal_186 ((_ extract 31 0) (bvadd .cse7 .cse4))) .cse2)) (= (let ((.cse8 (let ((.cse11 (concat v_arrayElimCell_55 .cse12))) (bvadd (let ((.cse9 (bvadd .cse10 .cse11))) (concat ((_ extract 63 32) .cse9) ((_ extract 31 0) .cse9))) .cse11)))) (concat ((_ extract 63 32) .cse8) ((_ extract 31 0) .cse8))) .cse2) (= (let ((.cse13 (bvadd .cse7 .cse14))) (concat ((_ extract 63 32) .cse13) ((_ extract 31 0) .cse13))) .cse2))))) .cse16) (or (and (or (and (forall ((v_arrayElimCell_58 (_ BitVec 32)) (v_arrayElimCell_57 (_ BitVec 32)) (v_arrayElimCell_56 (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32)) (v_ArrVal_186 (_ BitVec 32))) (let ((.cse18 (concat v_arrayElimCell_55 v_arrayElimCell_58)) (.cse20 (concat v_arrayElimCell_57 v_arrayElimCell_56))) (let ((.cse19 (let ((.cse21 (bvadd .cse18 (let ((.cse22 (bvadd .cse23 .cse20))) (concat ((_ extract 63 32) .cse22) ((_ extract 31 0) .cse22)))))) (concat ((_ extract 63 32) .cse21) ((_ extract 31 0) .cse21))))) (or (= (let ((.cse17 (bvadd .cse18 .cse19))) (concat ((_ extract 63 32) .cse17) ((_ extract 31 0) .cse17))) .cse2) (not (= .cse2 (concat v_ArrVal_186 ((_ extract 31 0) (bvadd .cse19 .cse20))))))))) (forall ((v_arrayElimCell_58 (_ BitVec 32)) (v_arrayElimCell_57 (_ BitVec 32)) (v_arrayElimCell_56 (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32)) (v_ArrVal_186 (_ BitVec 32))) (let ((.cse30 (concat v_arrayElimCell_55 v_arrayElimCell_58)) (.cse32 (concat v_arrayElimCell_57 v_arrayElimCell_56))) (let ((.cse31 (let ((.cse33 (bvadd .cse30 (let ((.cse34 (bvadd .cse23 .cse32))) (concat ((_ extract 63 32) .cse34) ((_ extract 31 0) .cse34)))))) (concat ((_ extract 63 32) .cse33) ((_ extract 31 0) .cse33))))) (or (= (let ((.cse24 (bvadd (let ((.cse25 (bvadd .cse26 (let ((.cse27 (bvadd .cse23 (concat .cse28 v_arrayElimCell_56)))) (concat ((_ extract 63 32) .cse27) ((_ extract 31 0) .cse27)))))) (concat ((_ extract 63 32) .cse25) ((_ extract 31 0) .cse25))) .cse26))) (concat ((_ extract 63 32) .cse24) ((_ extract 31 0) .cse24))) .cse2) (= (let ((.cse29 (bvadd .cse30 .cse31))) (concat ((_ extract 63 32) .cse29) ((_ extract 31 0) .cse29))) .cse2) (not (= .cse2 (concat v_ArrVal_186 ((_ extract 31 0) (bvadd .cse31 .cse32))))))))) (forall ((v_arrayElimCell_58 (_ BitVec 32)) (v_arrayElimCell_57 (_ BitVec 32)) (v_arrayElimCell_56 (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32)) (v_ArrVal_186 (_ BitVec 32))) (let ((.cse45 (concat v_arrayElimCell_57 v_arrayElimCell_56))) (let ((.cse43 (concat v_arrayElimCell_55 v_arrayElimCell_58)) (.cse41 (let ((.cse47 (bvadd .cse23 .cse45))) (concat ((_ extract 63 32) .cse47) ((_ extract 31 0) .cse47))))) (let ((.cse44 (let ((.cse46 (bvadd .cse43 .cse41))) (concat ((_ extract 63 32) .cse46) ((_ extract 31 0) .cse46))))) (or (= (let ((.cse35 (bvadd (let ((.cse36 (bvadd .cse26 (let ((.cse37 (bvadd .cse23 (concat .cse28 v_arrayElimCell_56)))) (concat ((_ extract 63 32) .cse37) ((_ extract 31 0) .cse37)))))) (concat ((_ extract 63 32) .cse36) ((_ extract 31 0) .cse36))) .cse26))) (concat ((_ extract 63 32) .cse35) ((_ extract 31 0) .cse35))) .cse2) (= (let ((.cse38 (let ((.cse39 (concat .cse28 v_arrayElimCell_58))) (bvadd .cse39 (let ((.cse40 (bvadd .cse39 .cse41))) (concat ((_ extract 63 32) .cse40) ((_ extract 31 0) .cse40))))))) (concat ((_ extract 63 32) .cse38) ((_ extract 31 0) .cse38))) .cse2) (= (let ((.cse42 (bvadd .cse43 .cse44))) (concat ((_ extract 63 32) .cse42) ((_ extract 31 0) .cse42))) .cse2) (not (= .cse2 (concat v_ArrVal_186 ((_ extract 31 0) (bvadd .cse44 .cse45)))))))))) (forall ((v_arrayElimCell_58 (_ BitVec 32)) (v_arrayElimCell_57 (_ BitVec 32)) (v_arrayElimCell_56 (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32)) (v_ArrVal_186 (_ BitVec 32))) (let ((.cse55 (concat v_arrayElimCell_57 v_arrayElimCell_56))) (let ((.cse53 (concat v_arrayElimCell_55 v_arrayElimCell_58)) (.cse51 (let ((.cse57 (bvadd .cse23 .cse55))) (concat ((_ extract 63 32) .cse57) ((_ extract 31 0) .cse57))))) (let ((.cse54 (let ((.cse56 (bvadd .cse53 .cse51))) (concat ((_ extract 63 32) .cse56) ((_ extract 31 0) .cse56))))) (or (= (let ((.cse48 (let ((.cse49 (concat .cse28 v_arrayElimCell_58))) (bvadd .cse49 (let ((.cse50 (bvadd .cse49 .cse51))) (concat ((_ extract 63 32) .cse50) ((_ extract 31 0) .cse50))))))) (concat ((_ extract 63 32) .cse48) ((_ extract 31 0) .cse48))) .cse2) (= (let ((.cse52 (bvadd .cse53 .cse54))) (concat ((_ extract 63 32) .cse52) ((_ extract 31 0) .cse52))) .cse2) (not (= .cse2 (concat v_ArrVal_186 ((_ extract 31 0) (bvadd .cse54 .cse55))))))))))) .cse58) (or (and (forall ((v_arrayElimCell_58 (_ BitVec 32)) (v_arrayElimCell_57 (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32))) (let ((.cse67 (concat v_arrayElimCell_55 v_arrayElimCell_58))) (or (forall ((v_arrayElimCell_56 (_ BitVec 32)) (v_ArrVal_186 (_ BitVec 32))) (let ((.cse69 (concat v_arrayElimCell_57 v_arrayElimCell_56))) (let ((.cse65 (let ((.cse71 (bvadd .cse23 .cse69))) (concat ((_ extract 63 32) .cse71) ((_ extract 31 0) .cse71))))) (let ((.cse68 (let ((.cse70 (bvadd .cse67 .cse65))) (concat ((_ extract 63 32) .cse70) ((_ extract 31 0) .cse70))))) (or (= (let ((.cse59 (bvadd (let ((.cse60 (bvadd .cse26 (let ((.cse61 (bvadd .cse23 (concat .cse28 v_arrayElimCell_56)))) (concat ((_ extract 63 32) .cse61) ((_ extract 31 0) .cse61)))))) (concat ((_ extract 63 32) .cse60) ((_ extract 31 0) .cse60))) .cse26))) (concat ((_ extract 63 32) .cse59) ((_ extract 31 0) .cse59))) .cse2) (= (let ((.cse62 (let ((.cse63 (concat .cse28 v_arrayElimCell_58))) (bvadd .cse63 (let ((.cse64 (bvadd .cse63 .cse65))) (concat ((_ extract 63 32) .cse64) ((_ extract 31 0) .cse64))))))) (concat ((_ extract 63 32) .cse62) ((_ extract 31 0) .cse62))) .cse2) (= (let ((.cse66 (bvadd .cse67 .cse68))) (concat ((_ extract 63 32) .cse66) ((_ extract 31 0) .cse66))) .cse2) (not (= .cse2 (concat v_ArrVal_186 ((_ extract 31 0) (bvadd .cse68 .cse69)))))))))) (= (let ((.cse72 (bvadd .cse67 (let ((.cse73 (bvadd .cse67 (let ((.cse74 (bvadd (concat v_arrayElimCell_57 .cse12) .cse23))) (concat ((_ extract 63 32) .cse74) ((_ extract 31 0) .cse74)))))) (concat ((_ extract 63 32) .cse73) ((_ extract 31 0) .cse73)))))) (concat ((_ extract 63 32) .cse72) ((_ extract 31 0) .cse72))) .cse2)))) (forall ((v_arrayElimCell_58 (_ BitVec 32)) (v_arrayElimCell_57 (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32))) (let ((.cse80 (concat v_arrayElimCell_55 v_arrayElimCell_58))) (or (forall ((v_arrayElimCell_56 (_ BitVec 32)) (v_ArrVal_186 (_ BitVec 32))) (let ((.cse82 (concat v_arrayElimCell_57 v_arrayElimCell_56))) (let ((.cse78 (let ((.cse84 (bvadd .cse23 .cse82))) (concat ((_ extract 63 32) .cse84) ((_ extract 31 0) .cse84))))) (let ((.cse81 (let ((.cse83 (bvadd .cse80 .cse78))) (concat ((_ extract 63 32) .cse83) ((_ extract 31 0) .cse83))))) (or (= (let ((.cse75 (let ((.cse76 (concat .cse28 v_arrayElimCell_58))) (bvadd .cse76 (let ((.cse77 (bvadd .cse76 .cse78))) (concat ((_ extract 63 32) .cse77) ((_ extract 31 0) .cse77))))))) (concat ((_ extract 63 32) .cse75) ((_ extract 31 0) .cse75))) .cse2) (= (let ((.cse79 (bvadd .cse80 .cse81))) (concat ((_ extract 63 32) .cse79) ((_ extract 31 0) .cse79))) .cse2) (not (= .cse2 (concat v_ArrVal_186 ((_ extract 31 0) (bvadd .cse81 .cse82)))))))))) (= (let ((.cse85 (bvadd .cse80 (let ((.cse86 (bvadd .cse80 (let ((.cse87 (bvadd (concat v_arrayElimCell_57 .cse12) .cse23))) (concat ((_ extract 63 32) .cse87) ((_ extract 31 0) .cse87)))))) (concat ((_ extract 63 32) .cse86) ((_ extract 31 0) .cse86)))))) (concat ((_ extract 63 32) .cse85) ((_ extract 31 0) .cse85))) .cse2)))) (forall ((v_arrayElimCell_58 (_ BitVec 32)) (v_arrayElimCell_57 (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32))) (let ((.cse89 (concat v_arrayElimCell_55 v_arrayElimCell_58))) (or (= (let ((.cse88 (bvadd .cse89 (let ((.cse90 (bvadd .cse89 (let ((.cse91 (bvadd (concat v_arrayElimCell_57 .cse12) .cse23))) (concat ((_ extract 63 32) .cse91) ((_ extract 31 0) .cse91)))))) (concat ((_ extract 63 32) .cse90) ((_ extract 31 0) .cse90)))))) (concat ((_ extract 63 32) .cse88) ((_ extract 31 0) .cse88))) .cse2) (forall ((v_arrayElimCell_56 (_ BitVec 32)) (v_ArrVal_186 (_ BitVec 32))) (let ((.cse97 (concat v_arrayElimCell_57 v_arrayElimCell_56))) (let ((.cse96 (let ((.cse98 (bvadd .cse89 (let ((.cse99 (bvadd .cse23 .cse97))) (concat ((_ extract 63 32) .cse99) ((_ extract 31 0) .cse99)))))) (concat ((_ extract 63 32) .cse98) ((_ extract 31 0) .cse98))))) (or (= (let ((.cse92 (bvadd (let ((.cse93 (bvadd .cse26 (let ((.cse94 (bvadd .cse23 (concat .cse28 v_arrayElimCell_56)))) (concat ((_ extract 63 32) .cse94) ((_ extract 31 0) .cse94)))))) (concat ((_ extract 63 32) .cse93) ((_ extract 31 0) .cse93))) .cse26))) (concat ((_ extract 63 32) .cse92) ((_ extract 31 0) .cse92))) .cse2) (= (let ((.cse95 (bvadd .cse89 .cse96))) (concat ((_ extract 63 32) .cse95) ((_ extract 31 0) .cse95))) .cse2) (not (= .cse2 (concat v_ArrVal_186 ((_ extract 31 0) (bvadd .cse96 .cse97)))))))))))) (forall ((v_arrayElimCell_58 (_ BitVec 32)) (v_arrayElimCell_57 (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32))) (let ((.cse101 (concat v_arrayElimCell_55 v_arrayElimCell_58))) (or (= (let ((.cse100 (bvadd .cse101 (let ((.cse102 (bvadd .cse101 (let ((.cse103 (bvadd (concat v_arrayElimCell_57 .cse12) .cse23))) (concat ((_ extract 63 32) .cse103) ((_ extract 31 0) .cse103)))))) (concat ((_ extract 63 32) .cse102) ((_ extract 31 0) .cse102)))))) (concat ((_ extract 63 32) .cse100) ((_ extract 31 0) .cse100))) .cse2) (forall ((v_arrayElimCell_56 (_ BitVec 32)) (v_ArrVal_186 (_ BitVec 32))) (let ((.cse106 (concat v_arrayElimCell_57 v_arrayElimCell_56))) (let ((.cse105 (let ((.cse107 (bvadd .cse101 (let ((.cse108 (bvadd .cse23 .cse106))) (concat ((_ extract 63 32) .cse108) ((_ extract 31 0) .cse108)))))) (concat ((_ extract 63 32) .cse107) ((_ extract 31 0) .cse107))))) (or (= (let ((.cse104 (bvadd .cse101 .cse105))) (concat ((_ extract 63 32) .cse104) ((_ extract 31 0) .cse104))) .cse2) (not (= .cse2 (concat v_ArrVal_186 ((_ extract 31 0) (bvadd .cse105 .cse106))))))))))))) .cse58) (or .cse109 .cse110) (or (and (forall ((v_arrayElimCell_58 (_ BitVec 32)) (v_arrayElimCell_57 (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32))) (let ((.cse121 (concat v_arrayElimCell_55 v_arrayElimCell_58))) (or (forall ((v_arrayElimCell_56 (_ BitVec 32)) (v_ArrVal_186 (_ BitVec 32))) (let ((.cse123 (concat v_arrayElimCell_57 v_arrayElimCell_56))) (let ((.cse113 (let ((.cse125 (bvadd .cse23 .cse123))) (concat ((_ extract 63 32) .cse125) ((_ extract 31 0) .cse125))))) (let ((.cse122 (let ((.cse124 (bvadd .cse121 .cse113))) (concat ((_ extract 63 32) .cse124) ((_ extract 31 0) .cse124))))) (or (= .cse2 (let ((.cse111 (bvadd .cse4 (let ((.cse112 (bvadd .cse4 .cse113))) (concat ((_ extract 63 32) .cse112) ((_ extract 31 0) .cse112)))))) (concat ((_ extract 63 32) .cse111) ((_ extract 31 0) .cse111)))) (= (let ((.cse114 (bvadd (let ((.cse115 (bvadd .cse26 (let ((.cse116 (bvadd .cse23 (concat .cse28 v_arrayElimCell_56)))) (concat ((_ extract 63 32) .cse116) ((_ extract 31 0) .cse116)))))) (concat ((_ extract 63 32) .cse115) ((_ extract 31 0) .cse115))) .cse26))) (concat ((_ extract 63 32) .cse114) ((_ extract 31 0) .cse114))) .cse2) (= (let ((.cse117 (let ((.cse118 (concat .cse28 v_arrayElimCell_58))) (bvadd .cse118 (let ((.cse119 (bvadd .cse118 .cse113))) (concat ((_ extract 63 32) .cse119) ((_ extract 31 0) .cse119))))))) (concat ((_ extract 63 32) .cse117) ((_ extract 31 0) .cse117))) .cse2) (= (let ((.cse120 (bvadd .cse121 .cse122))) (concat ((_ extract 63 32) .cse120) ((_ extract 31 0) .cse120))) .cse2) (not (= .cse2 (concat v_ArrVal_186 ((_ extract 31 0) (bvadd .cse122 .cse123)))))))))) (= (let ((.cse126 (bvadd .cse121 (let ((.cse127 (bvadd .cse121 (let ((.cse128 (bvadd (concat v_arrayElimCell_57 .cse12) .cse23))) (concat ((_ extract 63 32) .cse128) ((_ extract 31 0) .cse128)))))) (concat ((_ extract 63 32) .cse127) ((_ extract 31 0) .cse127)))))) (concat ((_ extract 63 32) .cse126) ((_ extract 31 0) .cse126))) .cse2)))) (forall ((v_arrayElimCell_58 (_ BitVec 32)) (v_arrayElimCell_57 (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32))) (let ((.cse130 (concat v_arrayElimCell_55 v_arrayElimCell_58))) (or (= (let ((.cse129 (bvadd .cse130 (let ((.cse131 (bvadd .cse130 (let ((.cse132 (bvadd (concat v_arrayElimCell_57 .cse12) .cse23))) (concat ((_ extract 63 32) .cse132) ((_ extract 31 0) .cse132)))))) (concat ((_ extract 63 32) .cse131) ((_ extract 31 0) .cse131)))))) (concat ((_ extract 63 32) .cse129) ((_ extract 31 0) .cse129))) .cse2) (forall ((v_arrayElimCell_56 (_ BitVec 32)) (v_ArrVal_186 (_ BitVec 32))) (let ((.cse141 (concat v_arrayElimCell_57 v_arrayElimCell_56))) (let ((.cse135 (let ((.cse143 (bvadd .cse23 .cse141))) (concat ((_ extract 63 32) .cse143) ((_ extract 31 0) .cse143))))) (let ((.cse140 (let ((.cse142 (bvadd .cse130 .cse135))) (concat ((_ extract 63 32) .cse142) ((_ extract 31 0) .cse142))))) (or (= .cse2 (let ((.cse133 (bvadd .cse4 (let ((.cse134 (bvadd .cse4 .cse135))) (concat ((_ extract 63 32) .cse134) ((_ extract 31 0) .cse134)))))) (concat ((_ extract 63 32) .cse133) ((_ extract 31 0) .cse133)))) (= (let ((.cse136 (bvadd (let ((.cse137 (bvadd .cse26 (let ((.cse138 (bvadd .cse23 (concat .cse28 v_arrayElimCell_56)))) (concat ((_ extract 63 32) .cse138) ((_ extract 31 0) .cse138)))))) (concat ((_ extract 63 32) .cse137) ((_ extract 31 0) .cse137))) .cse26))) (concat ((_ extract 63 32) .cse136) ((_ extract 31 0) .cse136))) .cse2) (= (let ((.cse139 (bvadd .cse130 .cse140))) (concat ((_ extract 63 32) .cse139) ((_ extract 31 0) .cse139))) .cse2) (not (= .cse2 (concat v_ArrVal_186 ((_ extract 31 0) (bvadd .cse140 .cse141))))))))))))) (forall ((v_arrayElimCell_58 (_ BitVec 32)) (v_arrayElimCell_57 (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32))) (let ((.cse145 (concat v_arrayElimCell_55 v_arrayElimCell_58))) (or (= (let ((.cse144 (bvadd .cse145 (let ((.cse146 (bvadd .cse145 (let ((.cse147 (bvadd (concat v_arrayElimCell_57 .cse12) .cse23))) (concat ((_ extract 63 32) .cse147) ((_ extract 31 0) .cse147)))))) (concat ((_ extract 63 32) .cse146) ((_ extract 31 0) .cse146)))))) (concat ((_ extract 63 32) .cse144) ((_ extract 31 0) .cse144))) .cse2) (forall ((v_arrayElimCell_56 (_ BitVec 32)) (v_ArrVal_186 (_ BitVec 32))) (let ((.cse153 (concat v_arrayElimCell_57 v_arrayElimCell_56))) (let ((.cse150 (let ((.cse155 (bvadd .cse23 .cse153))) (concat ((_ extract 63 32) .cse155) ((_ extract 31 0) .cse155))))) (let ((.cse152 (let ((.cse154 (bvadd .cse145 .cse150))) (concat ((_ extract 63 32) .cse154) ((_ extract 31 0) .cse154))))) (or (= .cse2 (let ((.cse148 (bvadd .cse4 (let ((.cse149 (bvadd .cse4 .cse150))) (concat ((_ extract 63 32) .cse149) ((_ extract 31 0) .cse149)))))) (concat ((_ extract 63 32) .cse148) ((_ extract 31 0) .cse148)))) (= (let ((.cse151 (bvadd .cse145 .cse152))) (concat ((_ extract 63 32) .cse151) ((_ extract 31 0) .cse151))) .cse2) (not (= .cse2 (concat v_ArrVal_186 ((_ extract 31 0) (bvadd .cse152 .cse153))))))))))))) (forall ((v_arrayElimCell_58 (_ BitVec 32)) (v_arrayElimCell_57 (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32))) (let ((.cse157 (concat v_arrayElimCell_55 v_arrayElimCell_58))) (or (= (let ((.cse156 (bvadd .cse157 (let ((.cse158 (bvadd .cse157 (let ((.cse159 (bvadd (concat v_arrayElimCell_57 .cse12) .cse23))) (concat ((_ extract 63 32) .cse159) ((_ extract 31 0) .cse159)))))) (concat ((_ extract 63 32) .cse158) ((_ extract 31 0) .cse158)))))) (concat ((_ extract 63 32) .cse156) ((_ extract 31 0) .cse156))) .cse2) (forall ((v_arrayElimCell_56 (_ BitVec 32)) (v_ArrVal_186 (_ BitVec 32))) (let ((.cse168 (concat v_arrayElimCell_57 v_arrayElimCell_56))) (let ((.cse162 (let ((.cse170 (bvadd .cse23 .cse168))) (concat ((_ extract 63 32) .cse170) ((_ extract 31 0) .cse170))))) (let ((.cse167 (let ((.cse169 (bvadd .cse157 .cse162))) (concat ((_ extract 63 32) .cse169) ((_ extract 31 0) .cse169))))) (or (= .cse2 (let ((.cse160 (bvadd .cse4 (let ((.cse161 (bvadd .cse4 .cse162))) (concat ((_ extract 63 32) .cse161) ((_ extract 31 0) .cse161)))))) (concat ((_ extract 63 32) .cse160) ((_ extract 31 0) .cse160)))) (= (let ((.cse163 (let ((.cse164 (concat .cse28 v_arrayElimCell_58))) (bvadd .cse164 (let ((.cse165 (bvadd .cse164 .cse162))) (concat ((_ extract 63 32) .cse165) ((_ extract 31 0) .cse165))))))) (concat ((_ extract 63 32) .cse163) ((_ extract 31 0) .cse163))) .cse2) (= (let ((.cse166 (bvadd .cse157 .cse167))) (concat ((_ extract 63 32) .cse166) ((_ extract 31 0) .cse166))) .cse2) (not (= .cse2 (concat v_ArrVal_186 ((_ extract 31 0) (bvadd .cse167 .cse168)))))))))))))) .cse58) (or (and (forall ((v_arrayElimCell_58 (_ BitVec 32)) (v_arrayElimCell_57 (_ BitVec 32)) (v_arrayElimCell_56 (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32)) (v_ArrVal_186 (_ BitVec 32))) (let ((.cse180 (concat v_arrayElimCell_57 v_arrayElimCell_56))) (let ((.cse178 (concat v_arrayElimCell_55 v_arrayElimCell_58)) (.cse173 (let ((.cse182 (bvadd .cse23 .cse180))) (concat ((_ extract 63 32) .cse182) ((_ extract 31 0) .cse182))))) (let ((.cse179 (let ((.cse181 (bvadd .cse178 .cse173))) (concat ((_ extract 63 32) .cse181) ((_ extract 31 0) .cse181))))) (or (= .cse2 (let ((.cse171 (bvadd .cse4 (let ((.cse172 (bvadd .cse4 .cse173))) (concat ((_ extract 63 32) .cse172) ((_ extract 31 0) .cse172)))))) (concat ((_ extract 63 32) .cse171) ((_ extract 31 0) .cse171)))) (= (let ((.cse174 (bvadd (let ((.cse175 (bvadd .cse26 (let ((.cse176 (bvadd .cse23 (concat .cse28 v_arrayElimCell_56)))) (concat ((_ extract 63 32) .cse176) ((_ extract 31 0) .cse176)))))) (concat ((_ extract 63 32) .cse175) ((_ extract 31 0) .cse175))) .cse26))) (concat ((_ extract 63 32) .cse174) ((_ extract 31 0) .cse174))) .cse2) (= (let ((.cse177 (bvadd .cse178 .cse179))) (concat ((_ extract 63 32) .cse177) ((_ extract 31 0) .cse177))) .cse2) (not (= .cse2 (concat v_ArrVal_186 ((_ extract 31 0) (bvadd .cse179 .cse180)))))))))) (forall ((v_arrayElimCell_58 (_ BitVec 32)) (v_arrayElimCell_57 (_ BitVec 32)) (v_arrayElimCell_56 (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32)) (v_ArrVal_186 (_ BitVec 32))) (let ((.cse189 (concat v_arrayElimCell_57 v_arrayElimCell_56))) (let ((.cse187 (concat v_arrayElimCell_55 v_arrayElimCell_58)) (.cse185 (let ((.cse191 (bvadd .cse23 .cse189))) (concat ((_ extract 63 32) .cse191) ((_ extract 31 0) .cse191))))) (let ((.cse188 (let ((.cse190 (bvadd .cse187 .cse185))) (concat ((_ extract 63 32) .cse190) ((_ extract 31 0) .cse190))))) (or (= .cse2 (let ((.cse183 (bvadd .cse4 (let ((.cse184 (bvadd .cse4 .cse185))) (concat ((_ extract 63 32) .cse184) ((_ extract 31 0) .cse184)))))) (concat ((_ extract 63 32) .cse183) ((_ extract 31 0) .cse183)))) (= (let ((.cse186 (bvadd .cse187 .cse188))) (concat ((_ extract 63 32) .cse186) ((_ extract 31 0) .cse186))) .cse2) (not (= .cse2 (concat v_ArrVal_186 ((_ extract 31 0) (bvadd .cse188 .cse189)))))))))) (forall ((v_arrayElimCell_58 (_ BitVec 32)) (v_arrayElimCell_57 (_ BitVec 32)) (v_arrayElimCell_56 (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32)) (v_ArrVal_186 (_ BitVec 32))) (let ((.cse201 (concat v_arrayElimCell_57 v_arrayElimCell_56))) (let ((.cse199 (concat v_arrayElimCell_55 v_arrayElimCell_58)) (.cse194 (let ((.cse203 (bvadd .cse23 .cse201))) (concat ((_ extract 63 32) .cse203) ((_ extract 31 0) .cse203))))) (let ((.cse200 (let ((.cse202 (bvadd .cse199 .cse194))) (concat ((_ extract 63 32) .cse202) ((_ extract 31 0) .cse202))))) (or (= .cse2 (let ((.cse192 (bvadd .cse4 (let ((.cse193 (bvadd .cse4 .cse194))) (concat ((_ extract 63 32) .cse193) ((_ extract 31 0) .cse193)))))) (concat ((_ extract 63 32) .cse192) ((_ extract 31 0) .cse192)))) (= (let ((.cse195 (let ((.cse196 (concat .cse28 v_arrayElimCell_58))) (bvadd .cse196 (let ((.cse197 (bvadd .cse196 .cse194))) (concat ((_ extract 63 32) .cse197) ((_ extract 31 0) .cse197))))))) (concat ((_ extract 63 32) .cse195) ((_ extract 31 0) .cse195))) .cse2) (= (let ((.cse198 (bvadd .cse199 .cse200))) (concat ((_ extract 63 32) .cse198) ((_ extract 31 0) .cse198))) .cse2) (not (= .cse2 (concat v_ArrVal_186 ((_ extract 31 0) (bvadd .cse200 .cse201)))))))))) (forall ((v_arrayElimCell_58 (_ BitVec 32)) (v_arrayElimCell_57 (_ BitVec 32)) (v_arrayElimCell_56 (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32)) (v_ArrVal_186 (_ BitVec 32))) (let ((.cse216 (concat v_arrayElimCell_57 v_arrayElimCell_56))) (let ((.cse214 (concat v_arrayElimCell_55 v_arrayElimCell_58)) (.cse206 (let ((.cse218 (bvadd .cse23 .cse216))) (concat ((_ extract 63 32) .cse218) ((_ extract 31 0) .cse218))))) (let ((.cse215 (let ((.cse217 (bvadd .cse214 .cse206))) (concat ((_ extract 63 32) .cse217) ((_ extract 31 0) .cse217))))) (or (= .cse2 (let ((.cse204 (bvadd .cse4 (let ((.cse205 (bvadd .cse4 .cse206))) (concat ((_ extract 63 32) .cse205) ((_ extract 31 0) .cse205)))))) (concat ((_ extract 63 32) .cse204) ((_ extract 31 0) .cse204)))) (= (let ((.cse207 (bvadd (let ((.cse208 (bvadd .cse26 (let ((.cse209 (bvadd .cse23 (concat .cse28 v_arrayElimCell_56)))) (concat ((_ extract 63 32) .cse209) ((_ extract 31 0) .cse209)))))) (concat ((_ extract 63 32) .cse208) ((_ extract 31 0) .cse208))) .cse26))) (concat ((_ extract 63 32) .cse207) ((_ extract 31 0) .cse207))) .cse2) (= (let ((.cse210 (let ((.cse211 (concat .cse28 v_arrayElimCell_58))) (bvadd .cse211 (let ((.cse212 (bvadd .cse211 .cse206))) (concat ((_ extract 63 32) .cse212) ((_ extract 31 0) .cse212))))))) (concat ((_ extract 63 32) .cse210) ((_ extract 31 0) .cse210))) .cse2) (= (let ((.cse213 (bvadd .cse214 .cse215))) (concat ((_ extract 63 32) .cse213) ((_ extract 31 0) .cse213))) .cse2) (not (= .cse2 (concat v_ArrVal_186 ((_ extract 31 0) (bvadd .cse215 .cse216))))))))))) .cse58)) .cse219) (or (and (or .cse109 (forall ((v_arrayElimCell_55 (_ BitVec 32))) (= (let ((.cse220 (let ((.cse222 (concat v_arrayElimCell_55 .cse12))) (bvadd (let ((.cse221 (bvadd .cse10 .cse222))) (concat ((_ extract 63 32) .cse221) ((_ extract 31 0) .cse221))) .cse222)))) (concat ((_ extract 63 32) .cse220) ((_ extract 31 0) .cse220))) .cse2)) .cse110) (or (and (forall ((v_arrayElimCell_55 (_ BitVec 32))) (or (= (let ((.cse223 (let ((.cse225 (concat v_arrayElimCell_55 .cse12))) (bvadd (let ((.cse224 (bvadd .cse10 .cse225))) (concat ((_ extract 63 32) .cse224) ((_ extract 31 0) .cse224))) .cse225)))) (concat ((_ extract 63 32) .cse223) ((_ extract 31 0) .cse223))) .cse2) (forall ((v_arrayElimCell_58 (_ BitVec 32)) (v_arrayElimCell_57 (_ BitVec 32))) (let ((.cse227 (concat v_arrayElimCell_55 v_arrayElimCell_58))) (or (= (let ((.cse226 (bvadd .cse227 (let ((.cse228 (bvadd .cse227 (let ((.cse229 (bvadd (concat v_arrayElimCell_57 .cse12) .cse23))) (concat ((_ extract 63 32) .cse229) ((_ extract 31 0) .cse229)))))) (concat ((_ extract 63 32) .cse228) ((_ extract 31 0) .cse228)))))) (concat ((_ extract 63 32) .cse226) ((_ extract 31 0) .cse226))) .cse2) (forall ((v_arrayElimCell_56 (_ BitVec 32)) (v_ArrVal_186 (_ BitVec 32))) (let ((.cse232 (concat v_arrayElimCell_57 v_arrayElimCell_56))) (let ((.cse231 (let ((.cse233 (bvadd .cse227 (let ((.cse234 (bvadd .cse23 .cse232))) (concat ((_ extract 63 32) .cse234) ((_ extract 31 0) .cse234)))))) (concat ((_ extract 63 32) .cse233) ((_ extract 31 0) .cse233))))) (or (= (let ((.cse230 (bvadd .cse227 .cse231))) (concat ((_ extract 63 32) .cse230) ((_ extract 31 0) .cse230))) .cse2) (not (= .cse2 (concat v_ArrVal_186 ((_ extract 31 0) (bvadd .cse231 .cse232)))))))))))))) (forall ((v_arrayElimCell_55 (_ BitVec 32))) (or (forall ((v_arrayElimCell_58 (_ BitVec 32)) (v_arrayElimCell_57 (_ BitVec 32))) (let ((.cse236 (concat v_arrayElimCell_55 v_arrayElimCell_58))) (or (= (let ((.cse235 (bvadd .cse236 (let ((.cse237 (bvadd .cse236 (let ((.cse238 (bvadd (concat v_arrayElimCell_57 .cse12) .cse23))) (concat ((_ extract 63 32) .cse238) ((_ extract 31 0) .cse238)))))) (concat ((_ extract 63 32) .cse237) ((_ extract 31 0) .cse237)))))) (concat ((_ extract 63 32) .cse235) ((_ extract 31 0) .cse235))) .cse2) (forall ((v_arrayElimCell_56 (_ BitVec 32)) (v_ArrVal_186 (_ BitVec 32))) (let ((.cse244 (concat v_arrayElimCell_57 v_arrayElimCell_56))) (let ((.cse243 (let ((.cse245 (bvadd .cse236 (let ((.cse246 (bvadd .cse23 .cse244))) (concat ((_ extract 63 32) .cse246) ((_ extract 31 0) .cse246)))))) (concat ((_ extract 63 32) .cse245) ((_ extract 31 0) .cse245))))) (or (= (let ((.cse239 (bvadd (let ((.cse240 (bvadd .cse26 (let ((.cse241 (bvadd .cse23 (concat .cse28 v_arrayElimCell_56)))) (concat ((_ extract 63 32) .cse241) ((_ extract 31 0) .cse241)))))) (concat ((_ extract 63 32) .cse240) ((_ extract 31 0) .cse240))) .cse26))) (concat ((_ extract 63 32) .cse239) ((_ extract 31 0) .cse239))) .cse2) (= (let ((.cse242 (bvadd .cse236 .cse243))) (concat ((_ extract 63 32) .cse242) ((_ extract 31 0) .cse242))) .cse2) (not (= .cse2 (concat v_ArrVal_186 ((_ extract 31 0) (bvadd .cse243 .cse244)))))))))))) (= (let ((.cse247 (let ((.cse249 (concat v_arrayElimCell_55 .cse12))) (bvadd (let ((.cse248 (bvadd .cse10 .cse249))) (concat ((_ extract 63 32) .cse248) ((_ extract 31 0) .cse248))) .cse249)))) (concat ((_ extract 63 32) .cse247) ((_ extract 31 0) .cse247))) .cse2))) (forall ((v_arrayElimCell_55 (_ BitVec 32))) (or (= (let ((.cse250 (let ((.cse252 (concat v_arrayElimCell_55 .cse12))) (bvadd (let ((.cse251 (bvadd .cse10 .cse252))) (concat ((_ extract 63 32) .cse251) ((_ extract 31 0) .cse251))) .cse252)))) (concat ((_ extract 63 32) .cse250) ((_ extract 31 0) .cse250))) .cse2) (forall ((v_arrayElimCell_58 (_ BitVec 32)) (v_arrayElimCell_57 (_ BitVec 32))) (let ((.cse261 (concat v_arrayElimCell_55 v_arrayElimCell_58))) (or (forall ((v_arrayElimCell_56 (_ BitVec 32)) (v_ArrVal_186 (_ BitVec 32))) (let ((.cse263 (concat v_arrayElimCell_57 v_arrayElimCell_56))) (let ((.cse259 (let ((.cse265 (bvadd .cse23 .cse263))) (concat ((_ extract 63 32) .cse265) ((_ extract 31 0) .cse265))))) (let ((.cse262 (let ((.cse264 (bvadd .cse261 .cse259))) (concat ((_ extract 63 32) .cse264) ((_ extract 31 0) .cse264))))) (or (= (let ((.cse253 (bvadd (let ((.cse254 (bvadd .cse26 (let ((.cse255 (bvadd .cse23 (concat .cse28 v_arrayElimCell_56)))) (concat ((_ extract 63 32) .cse255) ((_ extract 31 0) .cse255)))))) (concat ((_ extract 63 32) .cse254) ((_ extract 31 0) .cse254))) .cse26))) (concat ((_ extract 63 32) .cse253) ((_ extract 31 0) .cse253))) .cse2) (= (let ((.cse256 (let ((.cse257 (concat .cse28 v_arrayElimCell_58))) (bvadd .cse257 (let ((.cse258 (bvadd .cse257 .cse259))) (concat ((_ extract 63 32) .cse258) ((_ extract 31 0) .cse258))))))) (concat ((_ extract 63 32) .cse256) ((_ extract 31 0) .cse256))) .cse2) (= (let ((.cse260 (bvadd .cse261 .cse262))) (concat ((_ extract 63 32) .cse260) ((_ extract 31 0) .cse260))) .cse2) (not (= .cse2 (concat v_ArrVal_186 ((_ extract 31 0) (bvadd .cse262 .cse263)))))))))) (= (let ((.cse266 (bvadd .cse261 (let ((.cse267 (bvadd .cse261 (let ((.cse268 (bvadd (concat v_arrayElimCell_57 .cse12) .cse23))) (concat ((_ extract 63 32) .cse268) ((_ extract 31 0) .cse268)))))) (concat ((_ extract 63 32) .cse267) ((_ extract 31 0) .cse267)))))) (concat ((_ extract 63 32) .cse266) ((_ extract 31 0) .cse266))) .cse2)))))) (forall ((v_arrayElimCell_55 (_ BitVec 32))) (or (= (let ((.cse269 (let ((.cse271 (concat v_arrayElimCell_55 .cse12))) (bvadd (let ((.cse270 (bvadd .cse10 .cse271))) (concat ((_ extract 63 32) .cse270) ((_ extract 31 0) .cse270))) .cse271)))) (concat ((_ extract 63 32) .cse269) ((_ extract 31 0) .cse269))) .cse2) (forall ((v_arrayElimCell_58 (_ BitVec 32)) (v_arrayElimCell_57 (_ BitVec 32))) (let ((.cse277 (concat v_arrayElimCell_55 v_arrayElimCell_58))) (or (forall ((v_arrayElimCell_56 (_ BitVec 32)) (v_ArrVal_186 (_ BitVec 32))) (let ((.cse279 (concat v_arrayElimCell_57 v_arrayElimCell_56))) (let ((.cse275 (let ((.cse281 (bvadd .cse23 .cse279))) (concat ((_ extract 63 32) .cse281) ((_ extract 31 0) .cse281))))) (let ((.cse278 (let ((.cse280 (bvadd .cse277 .cse275))) (concat ((_ extract 63 32) .cse280) ((_ extract 31 0) .cse280))))) (or (= (let ((.cse272 (let ((.cse273 (concat .cse28 v_arrayElimCell_58))) (bvadd .cse273 (let ((.cse274 (bvadd .cse273 .cse275))) (concat ((_ extract 63 32) .cse274) ((_ extract 31 0) .cse274))))))) (concat ((_ extract 63 32) .cse272) ((_ extract 31 0) .cse272))) .cse2) (= (let ((.cse276 (bvadd .cse277 .cse278))) (concat ((_ extract 63 32) .cse276) ((_ extract 31 0) .cse276))) .cse2) (not (= .cse2 (concat v_ArrVal_186 ((_ extract 31 0) (bvadd .cse278 .cse279)))))))))) (= (let ((.cse282 (bvadd .cse277 (let ((.cse283 (bvadd .cse277 (let ((.cse284 (bvadd (concat v_arrayElimCell_57 .cse12) .cse23))) (concat ((_ extract 63 32) .cse284) ((_ extract 31 0) .cse284)))))) (concat ((_ extract 63 32) .cse283) ((_ extract 31 0) .cse283)))))) (concat ((_ extract 63 32) .cse282) ((_ extract 31 0) .cse282))) .cse2))))))) .cse58) (or (and (forall ((v_arrayElimCell_55 (_ BitVec 32))) (or (forall ((v_arrayElimCell_58 (_ BitVec 32)) (v_arrayElimCell_57 (_ BitVec 32)) (v_arrayElimCell_56 (_ BitVec 32)) (v_ArrVal_186 (_ BitVec 32))) (let ((.cse294 (concat v_arrayElimCell_57 v_arrayElimCell_56))) (let ((.cse292 (concat v_arrayElimCell_55 v_arrayElimCell_58)) (.cse287 (let ((.cse296 (bvadd .cse23 .cse294))) (concat ((_ extract 63 32) .cse296) ((_ extract 31 0) .cse296))))) (let ((.cse293 (let ((.cse295 (bvadd .cse292 .cse287))) (concat ((_ extract 63 32) .cse295) ((_ extract 31 0) .cse295))))) (or (= .cse2 (let ((.cse285 (bvadd .cse4 (let ((.cse286 (bvadd .cse4 .cse287))) (concat ((_ extract 63 32) .cse286) ((_ extract 31 0) .cse286)))))) (concat ((_ extract 63 32) .cse285) ((_ extract 31 0) .cse285)))) (= (let ((.cse288 (bvadd (let ((.cse289 (bvadd .cse26 (let ((.cse290 (bvadd .cse23 (concat .cse28 v_arrayElimCell_56)))) (concat ((_ extract 63 32) .cse290) ((_ extract 31 0) .cse290)))))) (concat ((_ extract 63 32) .cse289) ((_ extract 31 0) .cse289))) .cse26))) (concat ((_ extract 63 32) .cse288) ((_ extract 31 0) .cse288))) .cse2) (= (let ((.cse291 (bvadd .cse292 .cse293))) (concat ((_ extract 63 32) .cse291) ((_ extract 31 0) .cse291))) .cse2) (not (= .cse2 (concat v_ArrVal_186 ((_ extract 31 0) (bvadd .cse293 .cse294)))))))))) (= (let ((.cse297 (let ((.cse299 (concat v_arrayElimCell_55 .cse12))) (bvadd (let ((.cse298 (bvadd .cse10 .cse299))) (concat ((_ extract 63 32) .cse298) ((_ extract 31 0) .cse298))) .cse299)))) (concat ((_ extract 63 32) .cse297) ((_ extract 31 0) .cse297))) .cse2))) (forall ((v_arrayElimCell_55 (_ BitVec 32))) (or (forall ((v_arrayElimCell_58 (_ BitVec 32)) (v_arrayElimCell_57 (_ BitVec 32)) (v_arrayElimCell_56 (_ BitVec 32)) (v_ArrVal_186 (_ BitVec 32))) (let ((.cse306 (concat v_arrayElimCell_57 v_arrayElimCell_56))) (let ((.cse304 (concat v_arrayElimCell_55 v_arrayElimCell_58)) (.cse302 (let ((.cse308 (bvadd .cse23 .cse306))) (concat ((_ extract 63 32) .cse308) ((_ extract 31 0) .cse308))))) (let ((.cse305 (let ((.cse307 (bvadd .cse304 .cse302))) (concat ((_ extract 63 32) .cse307) ((_ extract 31 0) .cse307))))) (or (= .cse2 (let ((.cse300 (bvadd .cse4 (let ((.cse301 (bvadd .cse4 .cse302))) (concat ((_ extract 63 32) .cse301) ((_ extract 31 0) .cse301)))))) (concat ((_ extract 63 32) .cse300) ((_ extract 31 0) .cse300)))) (= (let ((.cse303 (bvadd .cse304 .cse305))) (concat ((_ extract 63 32) .cse303) ((_ extract 31 0) .cse303))) .cse2) (not (= .cse2 (concat v_ArrVal_186 ((_ extract 31 0) (bvadd .cse305 .cse306)))))))))) (= (let ((.cse309 (let ((.cse311 (concat v_arrayElimCell_55 .cse12))) (bvadd (let ((.cse310 (bvadd .cse10 .cse311))) (concat ((_ extract 63 32) .cse310) ((_ extract 31 0) .cse310))) .cse311)))) (concat ((_ extract 63 32) .cse309) ((_ extract 31 0) .cse309))) .cse2))) (forall ((v_arrayElimCell_55 (_ BitVec 32))) (or (forall ((v_arrayElimCell_58 (_ BitVec 32)) (v_arrayElimCell_57 (_ BitVec 32)) (v_arrayElimCell_56 (_ BitVec 32)) (v_ArrVal_186 (_ BitVec 32))) (let ((.cse321 (concat v_arrayElimCell_57 v_arrayElimCell_56))) (let ((.cse319 (concat v_arrayElimCell_55 v_arrayElimCell_58)) (.cse314 (let ((.cse323 (bvadd .cse23 .cse321))) (concat ((_ extract 63 32) .cse323) ((_ extract 31 0) .cse323))))) (let ((.cse320 (let ((.cse322 (bvadd .cse319 .cse314))) (concat ((_ extract 63 32) .cse322) ((_ extract 31 0) .cse322))))) (or (= .cse2 (let ((.cse312 (bvadd .cse4 (let ((.cse313 (bvadd .cse4 .cse314))) (concat ((_ extract 63 32) .cse313) ((_ extract 31 0) .cse313)))))) (concat ((_ extract 63 32) .cse312) ((_ extract 31 0) .cse312)))) (= (let ((.cse315 (let ((.cse316 (concat .cse28 v_arrayElimCell_58))) (bvadd .cse316 (let ((.cse317 (bvadd .cse316 .cse314))) (concat ((_ extract 63 32) .cse317) ((_ extract 31 0) .cse317))))))) (concat ((_ extract 63 32) .cse315) ((_ extract 31 0) .cse315))) .cse2) (= (let ((.cse318 (bvadd .cse319 .cse320))) (concat ((_ extract 63 32) .cse318) ((_ extract 31 0) .cse318))) .cse2) (not (= .cse2 (concat v_ArrVal_186 ((_ extract 31 0) (bvadd .cse320 .cse321)))))))))) (= (let ((.cse324 (let ((.cse326 (concat v_arrayElimCell_55 .cse12))) (bvadd (let ((.cse325 (bvadd .cse10 .cse326))) (concat ((_ extract 63 32) .cse325) ((_ extract 31 0) .cse325))) .cse326)))) (concat ((_ extract 63 32) .cse324) ((_ extract 31 0) .cse324))) .cse2))) (forall ((v_arrayElimCell_55 (_ BitVec 32))) (or (forall ((v_arrayElimCell_58 (_ BitVec 32)) (v_arrayElimCell_57 (_ BitVec 32)) (v_arrayElimCell_56 (_ BitVec 32)) (v_ArrVal_186 (_ BitVec 32))) (let ((.cse339 (concat v_arrayElimCell_57 v_arrayElimCell_56))) (let ((.cse337 (concat v_arrayElimCell_55 v_arrayElimCell_58)) (.cse329 (let ((.cse341 (bvadd .cse23 .cse339))) (concat ((_ extract 63 32) .cse341) ((_ extract 31 0) .cse341))))) (let ((.cse338 (let ((.cse340 (bvadd .cse337 .cse329))) (concat ((_ extract 63 32) .cse340) ((_ extract 31 0) .cse340))))) (or (= .cse2 (let ((.cse327 (bvadd .cse4 (let ((.cse328 (bvadd .cse4 .cse329))) (concat ((_ extract 63 32) .cse328) ((_ extract 31 0) .cse328)))))) (concat ((_ extract 63 32) .cse327) ((_ extract 31 0) .cse327)))) (= (let ((.cse330 (bvadd (let ((.cse331 (bvadd .cse26 (let ((.cse332 (bvadd .cse23 (concat .cse28 v_arrayElimCell_56)))) (concat ((_ extract 63 32) .cse332) ((_ extract 31 0) .cse332)))))) (concat ((_ extract 63 32) .cse331) ((_ extract 31 0) .cse331))) .cse26))) (concat ((_ extract 63 32) .cse330) ((_ extract 31 0) .cse330))) .cse2) (= (let ((.cse333 (let ((.cse334 (concat .cse28 v_arrayElimCell_58))) (bvadd .cse334 (let ((.cse335 (bvadd .cse334 .cse329))) (concat ((_ extract 63 32) .cse335) ((_ extract 31 0) .cse335))))))) (concat ((_ extract 63 32) .cse333) ((_ extract 31 0) .cse333))) .cse2) (= (let ((.cse336 (bvadd .cse337 .cse338))) (concat ((_ extract 63 32) .cse336) ((_ extract 31 0) .cse336))) .cse2) (not (= .cse2 (concat v_ArrVal_186 ((_ extract 31 0) (bvadd .cse338 .cse339)))))))))) (= (let ((.cse342 (let ((.cse344 (concat v_arrayElimCell_55 .cse12))) (bvadd (let ((.cse343 (bvadd .cse10 .cse344))) (concat ((_ extract 63 32) .cse343) ((_ extract 31 0) .cse343))) .cse344)))) (concat ((_ extract 63 32) .cse342) ((_ extract 31 0) .cse342))) .cse2)))) .cse58) (or .cse58 (and (forall ((v_arrayElimCell_55 (_ BitVec 32))) (or (= (let ((.cse345 (let ((.cse347 (concat v_arrayElimCell_55 .cse12))) (bvadd (let ((.cse346 (bvadd .cse10 .cse347))) (concat ((_ extract 63 32) .cse346) ((_ extract 31 0) .cse346))) .cse347)))) (concat ((_ extract 63 32) .cse345) ((_ extract 31 0) .cse345))) .cse2) (forall ((v_arrayElimCell_58 (_ BitVec 32)) (v_arrayElimCell_57 (_ BitVec 32))) (let ((.cse349 (concat v_arrayElimCell_55 v_arrayElimCell_58))) (or (= (let ((.cse348 (bvadd .cse349 (let ((.cse350 (bvadd .cse349 (let ((.cse351 (bvadd (concat v_arrayElimCell_57 .cse12) .cse23))) (concat ((_ extract 63 32) .cse351) ((_ extract 31 0) .cse351)))))) (concat ((_ extract 63 32) .cse350) ((_ extract 31 0) .cse350)))))) (concat ((_ extract 63 32) .cse348) ((_ extract 31 0) .cse348))) .cse2) (forall ((v_arrayElimCell_56 (_ BitVec 32)) (v_ArrVal_186 (_ BitVec 32))) (let ((.cse360 (concat v_arrayElimCell_57 v_arrayElimCell_56))) (let ((.cse354 (let ((.cse362 (bvadd .cse23 .cse360))) (concat ((_ extract 63 32) .cse362) ((_ extract 31 0) .cse362))))) (let ((.cse359 (let ((.cse361 (bvadd .cse349 .cse354))) (concat ((_ extract 63 32) .cse361) ((_ extract 31 0) .cse361))))) (or (= .cse2 (let ((.cse352 (bvadd .cse4 (let ((.cse353 (bvadd .cse4 .cse354))) (concat ((_ extract 63 32) .cse353) ((_ extract 31 0) .cse353)))))) (concat ((_ extract 63 32) .cse352) ((_ extract 31 0) .cse352)))) (= (let ((.cse355 (let ((.cse356 (concat .cse28 v_arrayElimCell_58))) (bvadd .cse356 (let ((.cse357 (bvadd .cse356 .cse354))) (concat ((_ extract 63 32) .cse357) ((_ extract 31 0) .cse357))))))) (concat ((_ extract 63 32) .cse355) ((_ extract 31 0) .cse355))) .cse2) (= (let ((.cse358 (bvadd .cse349 .cse359))) (concat ((_ extract 63 32) .cse358) ((_ extract 31 0) .cse358))) .cse2) (not (= .cse2 (concat v_ArrVal_186 ((_ extract 31 0) (bvadd .cse359 .cse360))))))))))))))) (forall ((v_arrayElimCell_55 (_ BitVec 32))) (or (= (let ((.cse363 (let ((.cse365 (concat v_arrayElimCell_55 .cse12))) (bvadd (let ((.cse364 (bvadd .cse10 .cse365))) (concat ((_ extract 63 32) .cse364) ((_ extract 31 0) .cse364))) .cse365)))) (concat ((_ extract 63 32) .cse363) ((_ extract 31 0) .cse363))) .cse2) (forall ((v_arrayElimCell_58 (_ BitVec 32)) (v_arrayElimCell_57 (_ BitVec 32))) (let ((.cse376 (concat v_arrayElimCell_55 v_arrayElimCell_58))) (or (forall ((v_arrayElimCell_56 (_ BitVec 32)) (v_ArrVal_186 (_ BitVec 32))) (let ((.cse378 (concat v_arrayElimCell_57 v_arrayElimCell_56))) (let ((.cse368 (let ((.cse380 (bvadd .cse23 .cse378))) (concat ((_ extract 63 32) .cse380) ((_ extract 31 0) .cse380))))) (let ((.cse377 (let ((.cse379 (bvadd .cse376 .cse368))) (concat ((_ extract 63 32) .cse379) ((_ extract 31 0) .cse379))))) (or (= .cse2 (let ((.cse366 (bvadd .cse4 (let ((.cse367 (bvadd .cse4 .cse368))) (concat ((_ extract 63 32) .cse367) ((_ extract 31 0) .cse367)))))) (concat ((_ extract 63 32) .cse366) ((_ extract 31 0) .cse366)))) (= (let ((.cse369 (bvadd (let ((.cse370 (bvadd .cse26 (let ((.cse371 (bvadd .cse23 (concat .cse28 v_arrayElimCell_56)))) (concat ((_ extract 63 32) .cse371) ((_ extract 31 0) .cse371)))))) (concat ((_ extract 63 32) .cse370) ((_ extract 31 0) .cse370))) .cse26))) (concat ((_ extract 63 32) .cse369) ((_ extract 31 0) .cse369))) .cse2) (= (let ((.cse372 (let ((.cse373 (concat .cse28 v_arrayElimCell_58))) (bvadd .cse373 (let ((.cse374 (bvadd .cse373 .cse368))) (concat ((_ extract 63 32) .cse374) ((_ extract 31 0) .cse374))))))) (concat ((_ extract 63 32) .cse372) ((_ extract 31 0) .cse372))) .cse2) (= (let ((.cse375 (bvadd .cse376 .cse377))) (concat ((_ extract 63 32) .cse375) ((_ extract 31 0) .cse375))) .cse2) (not (= .cse2 (concat v_ArrVal_186 ((_ extract 31 0) (bvadd .cse377 .cse378)))))))))) (= (let ((.cse381 (bvadd .cse376 (let ((.cse382 (bvadd .cse376 (let ((.cse383 (bvadd (concat v_arrayElimCell_57 .cse12) .cse23))) (concat ((_ extract 63 32) .cse383) ((_ extract 31 0) .cse383)))))) (concat ((_ extract 63 32) .cse382) ((_ extract 31 0) .cse382)))))) (concat ((_ extract 63 32) .cse381) ((_ extract 31 0) .cse381))) .cse2)))))) (forall ((v_arrayElimCell_55 (_ BitVec 32))) (or (= (let ((.cse384 (let ((.cse386 (concat v_arrayElimCell_55 .cse12))) (bvadd (let ((.cse385 (bvadd .cse10 .cse386))) (concat ((_ extract 63 32) .cse385) ((_ extract 31 0) .cse385))) .cse386)))) (concat ((_ extract 63 32) .cse384) ((_ extract 31 0) .cse384))) .cse2) (forall ((v_arrayElimCell_58 (_ BitVec 32)) (v_arrayElimCell_57 (_ BitVec 32))) (let ((.cse388 (concat v_arrayElimCell_55 v_arrayElimCell_58))) (or (= (let ((.cse387 (bvadd .cse388 (let ((.cse389 (bvadd .cse388 (let ((.cse390 (bvadd (concat v_arrayElimCell_57 .cse12) .cse23))) (concat ((_ extract 63 32) .cse390) ((_ extract 31 0) .cse390)))))) (concat ((_ extract 63 32) .cse389) ((_ extract 31 0) .cse389)))))) (concat ((_ extract 63 32) .cse387) ((_ extract 31 0) .cse387))) .cse2) (forall ((v_arrayElimCell_56 (_ BitVec 32)) (v_ArrVal_186 (_ BitVec 32))) (let ((.cse396 (concat v_arrayElimCell_57 v_arrayElimCell_56))) (let ((.cse393 (let ((.cse398 (bvadd .cse23 .cse396))) (concat ((_ extract 63 32) .cse398) ((_ extract 31 0) .cse398))))) (let ((.cse395 (let ((.cse397 (bvadd .cse388 .cse393))) (concat ((_ extract 63 32) .cse397) ((_ extract 31 0) .cse397))))) (or (= .cse2 (let ((.cse391 (bvadd .cse4 (let ((.cse392 (bvadd .cse4 .cse393))) (concat ((_ extract 63 32) .cse392) ((_ extract 31 0) .cse392)))))) (concat ((_ extract 63 32) .cse391) ((_ extract 31 0) .cse391)))) (= (let ((.cse394 (bvadd .cse388 .cse395))) (concat ((_ extract 63 32) .cse394) ((_ extract 31 0) .cse394))) .cse2) (not (= .cse2 (concat v_ArrVal_186 ((_ extract 31 0) (bvadd .cse395 .cse396))))))))))))))) (forall ((v_arrayElimCell_55 (_ BitVec 32))) (or (forall ((v_arrayElimCell_58 (_ BitVec 32)) (v_arrayElimCell_57 (_ BitVec 32))) (let ((.cse400 (concat v_arrayElimCell_55 v_arrayElimCell_58))) (or (= (let ((.cse399 (bvadd .cse400 (let ((.cse401 (bvadd .cse400 (let ((.cse402 (bvadd (concat v_arrayElimCell_57 .cse12) .cse23))) (concat ((_ extract 63 32) .cse402) ((_ extract 31 0) .cse402)))))) (concat ((_ extract 63 32) .cse401) ((_ extract 31 0) .cse401)))))) (concat ((_ extract 63 32) .cse399) ((_ extract 31 0) .cse399))) .cse2) (forall ((v_arrayElimCell_56 (_ BitVec 32)) (v_ArrVal_186 (_ BitVec 32))) (let ((.cse411 (concat v_arrayElimCell_57 v_arrayElimCell_56))) (let ((.cse405 (let ((.cse413 (bvadd .cse23 .cse411))) (concat ((_ extract 63 32) .cse413) ((_ extract 31 0) .cse413))))) (let ((.cse410 (let ((.cse412 (bvadd .cse400 .cse405))) (concat ((_ extract 63 32) .cse412) ((_ extract 31 0) .cse412))))) (or (= .cse2 (let ((.cse403 (bvadd .cse4 (let ((.cse404 (bvadd .cse4 .cse405))) (concat ((_ extract 63 32) .cse404) ((_ extract 31 0) .cse404)))))) (concat ((_ extract 63 32) .cse403) ((_ extract 31 0) .cse403)))) (= (let ((.cse406 (bvadd (let ((.cse407 (bvadd .cse26 (let ((.cse408 (bvadd .cse23 (concat .cse28 v_arrayElimCell_56)))) (concat ((_ extract 63 32) .cse408) ((_ extract 31 0) .cse408)))))) (concat ((_ extract 63 32) .cse407) ((_ extract 31 0) .cse407))) .cse26))) (concat ((_ extract 63 32) .cse406) ((_ extract 31 0) .cse406))) .cse2) (= (let ((.cse409 (bvadd .cse400 .cse410))) (concat ((_ extract 63 32) .cse409) ((_ extract 31 0) .cse409))) .cse2) (not (= .cse2 (concat v_ArrVal_186 ((_ extract 31 0) (bvadd .cse410 .cse411))))))))))))) (= (let ((.cse414 (let ((.cse416 (concat v_arrayElimCell_55 .cse12))) (bvadd (let ((.cse415 (bvadd .cse10 .cse416))) (concat ((_ extract 63 32) .cse415) ((_ extract 31 0) .cse415))) .cse416)))) (concat ((_ extract 63 32) .cse414) ((_ extract 31 0) .cse414))) .cse2))))) (or (and (forall ((v_arrayElimCell_55 (_ BitVec 32))) (or (forall ((v_arrayElimCell_58 (_ BitVec 32)) (v_arrayElimCell_57 (_ BitVec 32)) (v_arrayElimCell_56 (_ BitVec 32)) (v_ArrVal_186 (_ BitVec 32))) (let ((.cse418 (concat v_arrayElimCell_55 v_arrayElimCell_58)) (.cse420 (concat v_arrayElimCell_57 v_arrayElimCell_56))) (let ((.cse419 (let ((.cse421 (bvadd .cse418 (let ((.cse422 (bvadd .cse23 .cse420))) (concat ((_ extract 63 32) .cse422) ((_ extract 31 0) .cse422)))))) (concat ((_ extract 63 32) .cse421) ((_ extract 31 0) .cse421))))) (or (= (let ((.cse417 (bvadd .cse418 .cse419))) (concat ((_ extract 63 32) .cse417) ((_ extract 31 0) .cse417))) .cse2) (not (= .cse2 (concat v_ArrVal_186 ((_ extract 31 0) (bvadd .cse419 .cse420))))))))) (= (let ((.cse423 (let ((.cse425 (concat v_arrayElimCell_55 .cse12))) (bvadd (let ((.cse424 (bvadd .cse10 .cse425))) (concat ((_ extract 63 32) .cse424) ((_ extract 31 0) .cse424))) .cse425)))) (concat ((_ extract 63 32) .cse423) ((_ extract 31 0) .cse423))) .cse2))) (forall ((v_arrayElimCell_55 (_ BitVec 32))) (or (forall ((v_arrayElimCell_58 (_ BitVec 32)) (v_arrayElimCell_57 (_ BitVec 32)) (v_arrayElimCell_56 (_ BitVec 32)) (v_ArrVal_186 (_ BitVec 32))) (let ((.cse436 (concat v_arrayElimCell_57 v_arrayElimCell_56))) (let ((.cse434 (concat v_arrayElimCell_55 v_arrayElimCell_58)) (.cse432 (let ((.cse438 (bvadd .cse23 .cse436))) (concat ((_ extract 63 32) .cse438) ((_ extract 31 0) .cse438))))) (let ((.cse435 (let ((.cse437 (bvadd .cse434 .cse432))) (concat ((_ extract 63 32) .cse437) ((_ extract 31 0) .cse437))))) (or (= (let ((.cse426 (bvadd (let ((.cse427 (bvadd .cse26 (let ((.cse428 (bvadd .cse23 (concat .cse28 v_arrayElimCell_56)))) (concat ((_ extract 63 32) .cse428) ((_ extract 31 0) .cse428)))))) (concat ((_ extract 63 32) .cse427) ((_ extract 31 0) .cse427))) .cse26))) (concat ((_ extract 63 32) .cse426) ((_ extract 31 0) .cse426))) .cse2) (= (let ((.cse429 (let ((.cse430 (concat .cse28 v_arrayElimCell_58))) (bvadd .cse430 (let ((.cse431 (bvadd .cse430 .cse432))) (concat ((_ extract 63 32) .cse431) ((_ extract 31 0) .cse431))))))) (concat ((_ extract 63 32) .cse429) ((_ extract 31 0) .cse429))) .cse2) (= (let ((.cse433 (bvadd .cse434 .cse435))) (concat ((_ extract 63 32) .cse433) ((_ extract 31 0) .cse433))) .cse2) (not (= .cse2 (concat v_ArrVal_186 ((_ extract 31 0) (bvadd .cse435 .cse436)))))))))) (= (let ((.cse439 (let ((.cse441 (concat v_arrayElimCell_55 .cse12))) (bvadd (let ((.cse440 (bvadd .cse10 .cse441))) (concat ((_ extract 63 32) .cse440) ((_ extract 31 0) .cse440))) .cse441)))) (concat ((_ extract 63 32) .cse439) ((_ extract 31 0) .cse439))) .cse2))) (forall ((v_arrayElimCell_55 (_ BitVec 32))) (or (= (let ((.cse442 (let ((.cse444 (concat v_arrayElimCell_55 .cse12))) (bvadd (let ((.cse443 (bvadd .cse10 .cse444))) (concat ((_ extract 63 32) .cse443) ((_ extract 31 0) .cse443))) .cse444)))) (concat ((_ extract 63 32) .cse442) ((_ extract 31 0) .cse442))) .cse2) (forall ((v_arrayElimCell_58 (_ BitVec 32)) (v_arrayElimCell_57 (_ BitVec 32)) (v_arrayElimCell_56 (_ BitVec 32)) (v_ArrVal_186 (_ BitVec 32))) (let ((.cse452 (concat v_arrayElimCell_57 v_arrayElimCell_56))) (let ((.cse450 (concat v_arrayElimCell_55 v_arrayElimCell_58)) (.cse448 (let ((.cse454 (bvadd .cse23 .cse452))) (concat ((_ extract 63 32) .cse454) ((_ extract 31 0) .cse454))))) (let ((.cse451 (let ((.cse453 (bvadd .cse450 .cse448))) (concat ((_ extract 63 32) .cse453) ((_ extract 31 0) .cse453))))) (or (= (let ((.cse445 (let ((.cse446 (concat .cse28 v_arrayElimCell_58))) (bvadd .cse446 (let ((.cse447 (bvadd .cse446 .cse448))) (concat ((_ extract 63 32) .cse447) ((_ extract 31 0) .cse447))))))) (concat ((_ extract 63 32) .cse445) ((_ extract 31 0) .cse445))) .cse2) (= (let ((.cse449 (bvadd .cse450 .cse451))) (concat ((_ extract 63 32) .cse449) ((_ extract 31 0) .cse449))) .cse2) (not (= .cse2 (concat v_ArrVal_186 ((_ extract 31 0) (bvadd .cse451 .cse452)))))))))))) (forall ((v_arrayElimCell_55 (_ BitVec 32))) (or (forall ((v_arrayElimCell_58 (_ BitVec 32)) (v_arrayElimCell_57 (_ BitVec 32)) (v_arrayElimCell_56 (_ BitVec 32)) (v_ArrVal_186 (_ BitVec 32))) (let ((.cse459 (concat v_arrayElimCell_55 v_arrayElimCell_58)) (.cse461 (concat v_arrayElimCell_57 v_arrayElimCell_56))) (let ((.cse460 (let ((.cse462 (bvadd .cse459 (let ((.cse463 (bvadd .cse23 .cse461))) (concat ((_ extract 63 32) .cse463) ((_ extract 31 0) .cse463)))))) (concat ((_ extract 63 32) .cse462) ((_ extract 31 0) .cse462))))) (or (= (let ((.cse455 (bvadd (let ((.cse456 (bvadd .cse26 (let ((.cse457 (bvadd .cse23 (concat .cse28 v_arrayElimCell_56)))) (concat ((_ extract 63 32) .cse457) ((_ extract 31 0) .cse457)))))) (concat ((_ extract 63 32) .cse456) ((_ extract 31 0) .cse456))) .cse26))) (concat ((_ extract 63 32) .cse455) ((_ extract 31 0) .cse455))) .cse2) (= (let ((.cse458 (bvadd .cse459 .cse460))) (concat ((_ extract 63 32) .cse458) ((_ extract 31 0) .cse458))) .cse2) (not (= .cse2 (concat v_ArrVal_186 ((_ extract 31 0) (bvadd .cse460 .cse461))))))))) (= (let ((.cse464 (let ((.cse466 (concat v_arrayElimCell_55 .cse12))) (bvadd (let ((.cse465 (bvadd .cse10 .cse466))) (concat ((_ extract 63 32) .cse465) ((_ extract 31 0) .cse465))) .cse466)))) (concat ((_ extract 63 32) .cse464) ((_ extract 31 0) .cse464))) .cse2)))) .cse58)) .cse219) (or (forall ((v_arrayElimCell_58 (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32)) (v_ArrVal_186 (_ BitVec 32))) (let ((.cse469 (concat v_arrayElimCell_55 v_arrayElimCell_58))) (let ((.cse467 (let ((.cse470 (bvadd .cse469 .cse6))) (concat ((_ extract 63 32) .cse470) ((_ extract 31 0) .cse470))))) (or (not (= (concat v_ArrVal_186 ((_ extract 31 0) (bvadd .cse467 .cse4))) .cse2)) (= (let ((.cse468 (bvadd .cse467 .cse469))) (concat ((_ extract 63 32) .cse468) ((_ extract 31 0) .cse468))) .cse2))))) .cse16)))) .cse3))))) is different from true [2023-11-29 00:51:48,980 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-29 00:51:48,980 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:51:48,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [263744509] [2023-11-29 00:51:48,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [263744509] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:51:48,981 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:51:48,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 32 [2023-11-29 00:51:48,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247519850] [2023-11-29 00:51:48,981 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:51:48,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-11-29 00:51:48,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:51:48,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-11-29 00:51:48,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=791, Unknown=1, NotChecked=58, Total=992 [2023-11-29 00:51:48,983 INFO L87 Difference]: Start difference. First operand 57 states and 66 transitions. Second operand has 32 states, 32 states have (on average 1.3125) internal successors, (42), 32 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) [2023-11-29 00:51:54,245 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int#3| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse13 ((_ extract 63 32) (_ bv1 64))) (.cse29 ((_ extract 31 0) (_ bv1 64)))) (let ((.cse478 (bvmul (_ bv8 32) |c_ULTIMATE.start_main_~i~0#1|)) (.cse5 (concat .cse13 .cse29)) (.cse24 (concat (select .cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (let ((.cse7 (let ((.cse479 (bvadd .cse5 .cse24))) (concat ((_ extract 63 32) .cse479) ((_ extract 31 0) .cse479)))) (.cse3 ((_ sign_extend 32) (bvadd c_~N~0 (_ bv1 32)))) (.cse4 (= .cse478 (_ bv0 32)))) (and (= |c_ULTIMATE.start_main_~#sum~0#1.offset| (_ bv0 32)) (not (bvsle c_~N~0 (_ bv0 32))) (= |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv0 32)) (= (select .cse0 (_ bv4 32)) ((_ extract 63 32) (_ bv0 64))) (= (_ bv0 32) |c_ULTIMATE.start_main_~i~0#1|) (bvule c_~N~0 (_ bv536870911 32)) (let ((.cse1 (bvadd .cse5 (let ((.cse6 (bvadd .cse5 .cse7))) (concat ((_ extract 63 32) .cse6) ((_ extract 31 0) .cse6)))))) (let ((.cse2 ((_ extract 31 0) .cse1))) (or (= (concat ((_ extract 63 32) .cse1) .cse2) .cse3) (not .cse4) (forall ((v_ArrVal_186 (_ BitVec 32))) (not (= (concat v_ArrVal_186 .cse2) .cse3)))))) (or (let ((.cse220 (= (bvadd (_ bv8 32) .cse478) (_ bv0 32))) (.cse27 (concat .cse29 .cse13)) (.cse59 (= (_ bv8 32) .cse478))) (let ((.cse110 (not .cse59)) (.cse111 (forall ((v_arrayElimCell_57 (_ BitVec 32)) (v_arrayElimCell_56 (_ BitVec 32)) (v_ArrVal_186 (_ BitVec 32))) (let ((.cse475 (concat v_arrayElimCell_57 v_arrayElimCell_56))) (let ((.cse474 (let ((.cse476 (bvadd .cse5 (let ((.cse477 (bvadd .cse24 .cse475))) (concat ((_ extract 63 32) .cse477) ((_ extract 31 0) .cse477)))))) (concat ((_ extract 63 32) .cse476) ((_ extract 31 0) .cse476))))) (or (= .cse3 (let ((.cse473 (bvadd .cse5 .cse474))) (concat ((_ extract 63 32) .cse473) ((_ extract 31 0) .cse473)))) (not (= .cse3 (concat v_ArrVal_186 ((_ extract 31 0) (bvadd .cse474 .cse475)))))))))) (.cse11 (let ((.cse472 (bvadd .cse27 .cse24))) (concat ((_ extract 63 32) .cse472) ((_ extract 31 0) .cse472)))) (.cse17 (not .cse220))) (and (or (forall ((v_arrayElimCell_58 (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32)) (v_ArrVal_186 (_ BitVec 32))) (let ((.cse15 (concat v_arrayElimCell_55 v_arrayElimCell_58))) (let ((.cse8 (let ((.cse16 (bvadd .cse15 .cse7))) (concat ((_ extract 63 32) .cse16) ((_ extract 31 0) .cse16))))) (or (not (= (concat v_ArrVal_186 ((_ extract 31 0) (bvadd .cse8 .cse5))) .cse3)) (= (let ((.cse9 (let ((.cse12 (concat v_arrayElimCell_55 .cse13))) (bvadd (let ((.cse10 (bvadd .cse11 .cse12))) (concat ((_ extract 63 32) .cse10) ((_ extract 31 0) .cse10))) .cse12)))) (concat ((_ extract 63 32) .cse9) ((_ extract 31 0) .cse9))) .cse3) (= (let ((.cse14 (bvadd .cse8 .cse15))) (concat ((_ extract 63 32) .cse14) ((_ extract 31 0) .cse14))) .cse3))))) .cse17) (or (and (or (and (forall ((v_arrayElimCell_58 (_ BitVec 32)) (v_arrayElimCell_57 (_ BitVec 32)) (v_arrayElimCell_56 (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32)) (v_ArrVal_186 (_ BitVec 32))) (let ((.cse19 (concat v_arrayElimCell_55 v_arrayElimCell_58)) (.cse21 (concat v_arrayElimCell_57 v_arrayElimCell_56))) (let ((.cse20 (let ((.cse22 (bvadd .cse19 (let ((.cse23 (bvadd .cse24 .cse21))) (concat ((_ extract 63 32) .cse23) ((_ extract 31 0) .cse23)))))) (concat ((_ extract 63 32) .cse22) ((_ extract 31 0) .cse22))))) (or (= (let ((.cse18 (bvadd .cse19 .cse20))) (concat ((_ extract 63 32) .cse18) ((_ extract 31 0) .cse18))) .cse3) (not (= .cse3 (concat v_ArrVal_186 ((_ extract 31 0) (bvadd .cse20 .cse21))))))))) (forall ((v_arrayElimCell_58 (_ BitVec 32)) (v_arrayElimCell_57 (_ BitVec 32)) (v_arrayElimCell_56 (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32)) (v_ArrVal_186 (_ BitVec 32))) (let ((.cse31 (concat v_arrayElimCell_55 v_arrayElimCell_58)) (.cse33 (concat v_arrayElimCell_57 v_arrayElimCell_56))) (let ((.cse32 (let ((.cse34 (bvadd .cse31 (let ((.cse35 (bvadd .cse24 .cse33))) (concat ((_ extract 63 32) .cse35) ((_ extract 31 0) .cse35)))))) (concat ((_ extract 63 32) .cse34) ((_ extract 31 0) .cse34))))) (or (= (let ((.cse25 (bvadd (let ((.cse26 (bvadd .cse27 (let ((.cse28 (bvadd .cse24 (concat .cse29 v_arrayElimCell_56)))) (concat ((_ extract 63 32) .cse28) ((_ extract 31 0) .cse28)))))) (concat ((_ extract 63 32) .cse26) ((_ extract 31 0) .cse26))) .cse27))) (concat ((_ extract 63 32) .cse25) ((_ extract 31 0) .cse25))) .cse3) (= (let ((.cse30 (bvadd .cse31 .cse32))) (concat ((_ extract 63 32) .cse30) ((_ extract 31 0) .cse30))) .cse3) (not (= .cse3 (concat v_ArrVal_186 ((_ extract 31 0) (bvadd .cse32 .cse33))))))))) (forall ((v_arrayElimCell_58 (_ BitVec 32)) (v_arrayElimCell_57 (_ BitVec 32)) (v_arrayElimCell_56 (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32)) (v_ArrVal_186 (_ BitVec 32))) (let ((.cse46 (concat v_arrayElimCell_57 v_arrayElimCell_56))) (let ((.cse44 (concat v_arrayElimCell_55 v_arrayElimCell_58)) (.cse42 (let ((.cse48 (bvadd .cse24 .cse46))) (concat ((_ extract 63 32) .cse48) ((_ extract 31 0) .cse48))))) (let ((.cse45 (let ((.cse47 (bvadd .cse44 .cse42))) (concat ((_ extract 63 32) .cse47) ((_ extract 31 0) .cse47))))) (or (= (let ((.cse36 (bvadd (let ((.cse37 (bvadd .cse27 (let ((.cse38 (bvadd .cse24 (concat .cse29 v_arrayElimCell_56)))) (concat ((_ extract 63 32) .cse38) ((_ extract 31 0) .cse38)))))) (concat ((_ extract 63 32) .cse37) ((_ extract 31 0) .cse37))) .cse27))) (concat ((_ extract 63 32) .cse36) ((_ extract 31 0) .cse36))) .cse3) (= (let ((.cse39 (let ((.cse40 (concat .cse29 v_arrayElimCell_58))) (bvadd .cse40 (let ((.cse41 (bvadd .cse40 .cse42))) (concat ((_ extract 63 32) .cse41) ((_ extract 31 0) .cse41))))))) (concat ((_ extract 63 32) .cse39) ((_ extract 31 0) .cse39))) .cse3) (= (let ((.cse43 (bvadd .cse44 .cse45))) (concat ((_ extract 63 32) .cse43) ((_ extract 31 0) .cse43))) .cse3) (not (= .cse3 (concat v_ArrVal_186 ((_ extract 31 0) (bvadd .cse45 .cse46)))))))))) (forall ((v_arrayElimCell_58 (_ BitVec 32)) (v_arrayElimCell_57 (_ BitVec 32)) (v_arrayElimCell_56 (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32)) (v_ArrVal_186 (_ BitVec 32))) (let ((.cse56 (concat v_arrayElimCell_57 v_arrayElimCell_56))) (let ((.cse54 (concat v_arrayElimCell_55 v_arrayElimCell_58)) (.cse52 (let ((.cse58 (bvadd .cse24 .cse56))) (concat ((_ extract 63 32) .cse58) ((_ extract 31 0) .cse58))))) (let ((.cse55 (let ((.cse57 (bvadd .cse54 .cse52))) (concat ((_ extract 63 32) .cse57) ((_ extract 31 0) .cse57))))) (or (= (let ((.cse49 (let ((.cse50 (concat .cse29 v_arrayElimCell_58))) (bvadd .cse50 (let ((.cse51 (bvadd .cse50 .cse52))) (concat ((_ extract 63 32) .cse51) ((_ extract 31 0) .cse51))))))) (concat ((_ extract 63 32) .cse49) ((_ extract 31 0) .cse49))) .cse3) (= (let ((.cse53 (bvadd .cse54 .cse55))) (concat ((_ extract 63 32) .cse53) ((_ extract 31 0) .cse53))) .cse3) (not (= .cse3 (concat v_ArrVal_186 ((_ extract 31 0) (bvadd .cse55 .cse56))))))))))) .cse59) (or (and (forall ((v_arrayElimCell_58 (_ BitVec 32)) (v_arrayElimCell_57 (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32))) (let ((.cse68 (concat v_arrayElimCell_55 v_arrayElimCell_58))) (or (forall ((v_arrayElimCell_56 (_ BitVec 32)) (v_ArrVal_186 (_ BitVec 32))) (let ((.cse70 (concat v_arrayElimCell_57 v_arrayElimCell_56))) (let ((.cse66 (let ((.cse72 (bvadd .cse24 .cse70))) (concat ((_ extract 63 32) .cse72) ((_ extract 31 0) .cse72))))) (let ((.cse69 (let ((.cse71 (bvadd .cse68 .cse66))) (concat ((_ extract 63 32) .cse71) ((_ extract 31 0) .cse71))))) (or (= (let ((.cse60 (bvadd (let ((.cse61 (bvadd .cse27 (let ((.cse62 (bvadd .cse24 (concat .cse29 v_arrayElimCell_56)))) (concat ((_ extract 63 32) .cse62) ((_ extract 31 0) .cse62)))))) (concat ((_ extract 63 32) .cse61) ((_ extract 31 0) .cse61))) .cse27))) (concat ((_ extract 63 32) .cse60) ((_ extract 31 0) .cse60))) .cse3) (= (let ((.cse63 (let ((.cse64 (concat .cse29 v_arrayElimCell_58))) (bvadd .cse64 (let ((.cse65 (bvadd .cse64 .cse66))) (concat ((_ extract 63 32) .cse65) ((_ extract 31 0) .cse65))))))) (concat ((_ extract 63 32) .cse63) ((_ extract 31 0) .cse63))) .cse3) (= (let ((.cse67 (bvadd .cse68 .cse69))) (concat ((_ extract 63 32) .cse67) ((_ extract 31 0) .cse67))) .cse3) (not (= .cse3 (concat v_ArrVal_186 ((_ extract 31 0) (bvadd .cse69 .cse70)))))))))) (= (let ((.cse73 (bvadd .cse68 (let ((.cse74 (bvadd .cse68 (let ((.cse75 (bvadd (concat v_arrayElimCell_57 .cse13) .cse24))) (concat ((_ extract 63 32) .cse75) ((_ extract 31 0) .cse75)))))) (concat ((_ extract 63 32) .cse74) ((_ extract 31 0) .cse74)))))) (concat ((_ extract 63 32) .cse73) ((_ extract 31 0) .cse73))) .cse3)))) (forall ((v_arrayElimCell_58 (_ BitVec 32)) (v_arrayElimCell_57 (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32))) (let ((.cse81 (concat v_arrayElimCell_55 v_arrayElimCell_58))) (or (forall ((v_arrayElimCell_56 (_ BitVec 32)) (v_ArrVal_186 (_ BitVec 32))) (let ((.cse83 (concat v_arrayElimCell_57 v_arrayElimCell_56))) (let ((.cse79 (let ((.cse85 (bvadd .cse24 .cse83))) (concat ((_ extract 63 32) .cse85) ((_ extract 31 0) .cse85))))) (let ((.cse82 (let ((.cse84 (bvadd .cse81 .cse79))) (concat ((_ extract 63 32) .cse84) ((_ extract 31 0) .cse84))))) (or (= (let ((.cse76 (let ((.cse77 (concat .cse29 v_arrayElimCell_58))) (bvadd .cse77 (let ((.cse78 (bvadd .cse77 .cse79))) (concat ((_ extract 63 32) .cse78) ((_ extract 31 0) .cse78))))))) (concat ((_ extract 63 32) .cse76) ((_ extract 31 0) .cse76))) .cse3) (= (let ((.cse80 (bvadd .cse81 .cse82))) (concat ((_ extract 63 32) .cse80) ((_ extract 31 0) .cse80))) .cse3) (not (= .cse3 (concat v_ArrVal_186 ((_ extract 31 0) (bvadd .cse82 .cse83)))))))))) (= (let ((.cse86 (bvadd .cse81 (let ((.cse87 (bvadd .cse81 (let ((.cse88 (bvadd (concat v_arrayElimCell_57 .cse13) .cse24))) (concat ((_ extract 63 32) .cse88) ((_ extract 31 0) .cse88)))))) (concat ((_ extract 63 32) .cse87) ((_ extract 31 0) .cse87)))))) (concat ((_ extract 63 32) .cse86) ((_ extract 31 0) .cse86))) .cse3)))) (forall ((v_arrayElimCell_58 (_ BitVec 32)) (v_arrayElimCell_57 (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32))) (let ((.cse90 (concat v_arrayElimCell_55 v_arrayElimCell_58))) (or (= (let ((.cse89 (bvadd .cse90 (let ((.cse91 (bvadd .cse90 (let ((.cse92 (bvadd (concat v_arrayElimCell_57 .cse13) .cse24))) (concat ((_ extract 63 32) .cse92) ((_ extract 31 0) .cse92)))))) (concat ((_ extract 63 32) .cse91) ((_ extract 31 0) .cse91)))))) (concat ((_ extract 63 32) .cse89) ((_ extract 31 0) .cse89))) .cse3) (forall ((v_arrayElimCell_56 (_ BitVec 32)) (v_ArrVal_186 (_ BitVec 32))) (let ((.cse98 (concat v_arrayElimCell_57 v_arrayElimCell_56))) (let ((.cse97 (let ((.cse99 (bvadd .cse90 (let ((.cse100 (bvadd .cse24 .cse98))) (concat ((_ extract 63 32) .cse100) ((_ extract 31 0) .cse100)))))) (concat ((_ extract 63 32) .cse99) ((_ extract 31 0) .cse99))))) (or (= (let ((.cse93 (bvadd (let ((.cse94 (bvadd .cse27 (let ((.cse95 (bvadd .cse24 (concat .cse29 v_arrayElimCell_56)))) (concat ((_ extract 63 32) .cse95) ((_ extract 31 0) .cse95)))))) (concat ((_ extract 63 32) .cse94) ((_ extract 31 0) .cse94))) .cse27))) (concat ((_ extract 63 32) .cse93) ((_ extract 31 0) .cse93))) .cse3) (= (let ((.cse96 (bvadd .cse90 .cse97))) (concat ((_ extract 63 32) .cse96) ((_ extract 31 0) .cse96))) .cse3) (not (= .cse3 (concat v_ArrVal_186 ((_ extract 31 0) (bvadd .cse97 .cse98)))))))))))) (forall ((v_arrayElimCell_58 (_ BitVec 32)) (v_arrayElimCell_57 (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32))) (let ((.cse102 (concat v_arrayElimCell_55 v_arrayElimCell_58))) (or (= (let ((.cse101 (bvadd .cse102 (let ((.cse103 (bvadd .cse102 (let ((.cse104 (bvadd (concat v_arrayElimCell_57 .cse13) .cse24))) (concat ((_ extract 63 32) .cse104) ((_ extract 31 0) .cse104)))))) (concat ((_ extract 63 32) .cse103) ((_ extract 31 0) .cse103)))))) (concat ((_ extract 63 32) .cse101) ((_ extract 31 0) .cse101))) .cse3) (forall ((v_arrayElimCell_56 (_ BitVec 32)) (v_ArrVal_186 (_ BitVec 32))) (let ((.cse107 (concat v_arrayElimCell_57 v_arrayElimCell_56))) (let ((.cse106 (let ((.cse108 (bvadd .cse102 (let ((.cse109 (bvadd .cse24 .cse107))) (concat ((_ extract 63 32) .cse109) ((_ extract 31 0) .cse109)))))) (concat ((_ extract 63 32) .cse108) ((_ extract 31 0) .cse108))))) (or (= (let ((.cse105 (bvadd .cse102 .cse106))) (concat ((_ extract 63 32) .cse105) ((_ extract 31 0) .cse105))) .cse3) (not (= .cse3 (concat v_ArrVal_186 ((_ extract 31 0) (bvadd .cse106 .cse107))))))))))))) .cse59) (or .cse110 .cse111) (or (and (forall ((v_arrayElimCell_58 (_ BitVec 32)) (v_arrayElimCell_57 (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32))) (let ((.cse122 (concat v_arrayElimCell_55 v_arrayElimCell_58))) (or (forall ((v_arrayElimCell_56 (_ BitVec 32)) (v_ArrVal_186 (_ BitVec 32))) (let ((.cse124 (concat v_arrayElimCell_57 v_arrayElimCell_56))) (let ((.cse114 (let ((.cse126 (bvadd .cse24 .cse124))) (concat ((_ extract 63 32) .cse126) ((_ extract 31 0) .cse126))))) (let ((.cse123 (let ((.cse125 (bvadd .cse122 .cse114))) (concat ((_ extract 63 32) .cse125) ((_ extract 31 0) .cse125))))) (or (= .cse3 (let ((.cse112 (bvadd .cse5 (let ((.cse113 (bvadd .cse5 .cse114))) (concat ((_ extract 63 32) .cse113) ((_ extract 31 0) .cse113)))))) (concat ((_ extract 63 32) .cse112) ((_ extract 31 0) .cse112)))) (= (let ((.cse115 (bvadd (let ((.cse116 (bvadd .cse27 (let ((.cse117 (bvadd .cse24 (concat .cse29 v_arrayElimCell_56)))) (concat ((_ extract 63 32) .cse117) ((_ extract 31 0) .cse117)))))) (concat ((_ extract 63 32) .cse116) ((_ extract 31 0) .cse116))) .cse27))) (concat ((_ extract 63 32) .cse115) ((_ extract 31 0) .cse115))) .cse3) (= (let ((.cse118 (let ((.cse119 (concat .cse29 v_arrayElimCell_58))) (bvadd .cse119 (let ((.cse120 (bvadd .cse119 .cse114))) (concat ((_ extract 63 32) .cse120) ((_ extract 31 0) .cse120))))))) (concat ((_ extract 63 32) .cse118) ((_ extract 31 0) .cse118))) .cse3) (= (let ((.cse121 (bvadd .cse122 .cse123))) (concat ((_ extract 63 32) .cse121) ((_ extract 31 0) .cse121))) .cse3) (not (= .cse3 (concat v_ArrVal_186 ((_ extract 31 0) (bvadd .cse123 .cse124)))))))))) (= (let ((.cse127 (bvadd .cse122 (let ((.cse128 (bvadd .cse122 (let ((.cse129 (bvadd (concat v_arrayElimCell_57 .cse13) .cse24))) (concat ((_ extract 63 32) .cse129) ((_ extract 31 0) .cse129)))))) (concat ((_ extract 63 32) .cse128) ((_ extract 31 0) .cse128)))))) (concat ((_ extract 63 32) .cse127) ((_ extract 31 0) .cse127))) .cse3)))) (forall ((v_arrayElimCell_58 (_ BitVec 32)) (v_arrayElimCell_57 (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32))) (let ((.cse131 (concat v_arrayElimCell_55 v_arrayElimCell_58))) (or (= (let ((.cse130 (bvadd .cse131 (let ((.cse132 (bvadd .cse131 (let ((.cse133 (bvadd (concat v_arrayElimCell_57 .cse13) .cse24))) (concat ((_ extract 63 32) .cse133) ((_ extract 31 0) .cse133)))))) (concat ((_ extract 63 32) .cse132) ((_ extract 31 0) .cse132)))))) (concat ((_ extract 63 32) .cse130) ((_ extract 31 0) .cse130))) .cse3) (forall ((v_arrayElimCell_56 (_ BitVec 32)) (v_ArrVal_186 (_ BitVec 32))) (let ((.cse142 (concat v_arrayElimCell_57 v_arrayElimCell_56))) (let ((.cse136 (let ((.cse144 (bvadd .cse24 .cse142))) (concat ((_ extract 63 32) .cse144) ((_ extract 31 0) .cse144))))) (let ((.cse141 (let ((.cse143 (bvadd .cse131 .cse136))) (concat ((_ extract 63 32) .cse143) ((_ extract 31 0) .cse143))))) (or (= .cse3 (let ((.cse134 (bvadd .cse5 (let ((.cse135 (bvadd .cse5 .cse136))) (concat ((_ extract 63 32) .cse135) ((_ extract 31 0) .cse135)))))) (concat ((_ extract 63 32) .cse134) ((_ extract 31 0) .cse134)))) (= (let ((.cse137 (bvadd (let ((.cse138 (bvadd .cse27 (let ((.cse139 (bvadd .cse24 (concat .cse29 v_arrayElimCell_56)))) (concat ((_ extract 63 32) .cse139) ((_ extract 31 0) .cse139)))))) (concat ((_ extract 63 32) .cse138) ((_ extract 31 0) .cse138))) .cse27))) (concat ((_ extract 63 32) .cse137) ((_ extract 31 0) .cse137))) .cse3) (= (let ((.cse140 (bvadd .cse131 .cse141))) (concat ((_ extract 63 32) .cse140) ((_ extract 31 0) .cse140))) .cse3) (not (= .cse3 (concat v_ArrVal_186 ((_ extract 31 0) (bvadd .cse141 .cse142))))))))))))) (forall ((v_arrayElimCell_58 (_ BitVec 32)) (v_arrayElimCell_57 (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32))) (let ((.cse146 (concat v_arrayElimCell_55 v_arrayElimCell_58))) (or (= (let ((.cse145 (bvadd .cse146 (let ((.cse147 (bvadd .cse146 (let ((.cse148 (bvadd (concat v_arrayElimCell_57 .cse13) .cse24))) (concat ((_ extract 63 32) .cse148) ((_ extract 31 0) .cse148)))))) (concat ((_ extract 63 32) .cse147) ((_ extract 31 0) .cse147)))))) (concat ((_ extract 63 32) .cse145) ((_ extract 31 0) .cse145))) .cse3) (forall ((v_arrayElimCell_56 (_ BitVec 32)) (v_ArrVal_186 (_ BitVec 32))) (let ((.cse154 (concat v_arrayElimCell_57 v_arrayElimCell_56))) (let ((.cse151 (let ((.cse156 (bvadd .cse24 .cse154))) (concat ((_ extract 63 32) .cse156) ((_ extract 31 0) .cse156))))) (let ((.cse153 (let ((.cse155 (bvadd .cse146 .cse151))) (concat ((_ extract 63 32) .cse155) ((_ extract 31 0) .cse155))))) (or (= .cse3 (let ((.cse149 (bvadd .cse5 (let ((.cse150 (bvadd .cse5 .cse151))) (concat ((_ extract 63 32) .cse150) ((_ extract 31 0) .cse150)))))) (concat ((_ extract 63 32) .cse149) ((_ extract 31 0) .cse149)))) (= (let ((.cse152 (bvadd .cse146 .cse153))) (concat ((_ extract 63 32) .cse152) ((_ extract 31 0) .cse152))) .cse3) (not (= .cse3 (concat v_ArrVal_186 ((_ extract 31 0) (bvadd .cse153 .cse154))))))))))))) (forall ((v_arrayElimCell_58 (_ BitVec 32)) (v_arrayElimCell_57 (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32))) (let ((.cse158 (concat v_arrayElimCell_55 v_arrayElimCell_58))) (or (= (let ((.cse157 (bvadd .cse158 (let ((.cse159 (bvadd .cse158 (let ((.cse160 (bvadd (concat v_arrayElimCell_57 .cse13) .cse24))) (concat ((_ extract 63 32) .cse160) ((_ extract 31 0) .cse160)))))) (concat ((_ extract 63 32) .cse159) ((_ extract 31 0) .cse159)))))) (concat ((_ extract 63 32) .cse157) ((_ extract 31 0) .cse157))) .cse3) (forall ((v_arrayElimCell_56 (_ BitVec 32)) (v_ArrVal_186 (_ BitVec 32))) (let ((.cse169 (concat v_arrayElimCell_57 v_arrayElimCell_56))) (let ((.cse163 (let ((.cse171 (bvadd .cse24 .cse169))) (concat ((_ extract 63 32) .cse171) ((_ extract 31 0) .cse171))))) (let ((.cse168 (let ((.cse170 (bvadd .cse158 .cse163))) (concat ((_ extract 63 32) .cse170) ((_ extract 31 0) .cse170))))) (or (= .cse3 (let ((.cse161 (bvadd .cse5 (let ((.cse162 (bvadd .cse5 .cse163))) (concat ((_ extract 63 32) .cse162) ((_ extract 31 0) .cse162)))))) (concat ((_ extract 63 32) .cse161) ((_ extract 31 0) .cse161)))) (= (let ((.cse164 (let ((.cse165 (concat .cse29 v_arrayElimCell_58))) (bvadd .cse165 (let ((.cse166 (bvadd .cse165 .cse163))) (concat ((_ extract 63 32) .cse166) ((_ extract 31 0) .cse166))))))) (concat ((_ extract 63 32) .cse164) ((_ extract 31 0) .cse164))) .cse3) (= (let ((.cse167 (bvadd .cse158 .cse168))) (concat ((_ extract 63 32) .cse167) ((_ extract 31 0) .cse167))) .cse3) (not (= .cse3 (concat v_ArrVal_186 ((_ extract 31 0) (bvadd .cse168 .cse169)))))))))))))) .cse59) (or (and (forall ((v_arrayElimCell_58 (_ BitVec 32)) (v_arrayElimCell_57 (_ BitVec 32)) (v_arrayElimCell_56 (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32)) (v_ArrVal_186 (_ BitVec 32))) (let ((.cse181 (concat v_arrayElimCell_57 v_arrayElimCell_56))) (let ((.cse179 (concat v_arrayElimCell_55 v_arrayElimCell_58)) (.cse174 (let ((.cse183 (bvadd .cse24 .cse181))) (concat ((_ extract 63 32) .cse183) ((_ extract 31 0) .cse183))))) (let ((.cse180 (let ((.cse182 (bvadd .cse179 .cse174))) (concat ((_ extract 63 32) .cse182) ((_ extract 31 0) .cse182))))) (or (= .cse3 (let ((.cse172 (bvadd .cse5 (let ((.cse173 (bvadd .cse5 .cse174))) (concat ((_ extract 63 32) .cse173) ((_ extract 31 0) .cse173)))))) (concat ((_ extract 63 32) .cse172) ((_ extract 31 0) .cse172)))) (= (let ((.cse175 (bvadd (let ((.cse176 (bvadd .cse27 (let ((.cse177 (bvadd .cse24 (concat .cse29 v_arrayElimCell_56)))) (concat ((_ extract 63 32) .cse177) ((_ extract 31 0) .cse177)))))) (concat ((_ extract 63 32) .cse176) ((_ extract 31 0) .cse176))) .cse27))) (concat ((_ extract 63 32) .cse175) ((_ extract 31 0) .cse175))) .cse3) (= (let ((.cse178 (bvadd .cse179 .cse180))) (concat ((_ extract 63 32) .cse178) ((_ extract 31 0) .cse178))) .cse3) (not (= .cse3 (concat v_ArrVal_186 ((_ extract 31 0) (bvadd .cse180 .cse181)))))))))) (forall ((v_arrayElimCell_58 (_ BitVec 32)) (v_arrayElimCell_57 (_ BitVec 32)) (v_arrayElimCell_56 (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32)) (v_ArrVal_186 (_ BitVec 32))) (let ((.cse190 (concat v_arrayElimCell_57 v_arrayElimCell_56))) (let ((.cse188 (concat v_arrayElimCell_55 v_arrayElimCell_58)) (.cse186 (let ((.cse192 (bvadd .cse24 .cse190))) (concat ((_ extract 63 32) .cse192) ((_ extract 31 0) .cse192))))) (let ((.cse189 (let ((.cse191 (bvadd .cse188 .cse186))) (concat ((_ extract 63 32) .cse191) ((_ extract 31 0) .cse191))))) (or (= .cse3 (let ((.cse184 (bvadd .cse5 (let ((.cse185 (bvadd .cse5 .cse186))) (concat ((_ extract 63 32) .cse185) ((_ extract 31 0) .cse185)))))) (concat ((_ extract 63 32) .cse184) ((_ extract 31 0) .cse184)))) (= (let ((.cse187 (bvadd .cse188 .cse189))) (concat ((_ extract 63 32) .cse187) ((_ extract 31 0) .cse187))) .cse3) (not (= .cse3 (concat v_ArrVal_186 ((_ extract 31 0) (bvadd .cse189 .cse190)))))))))) (forall ((v_arrayElimCell_58 (_ BitVec 32)) (v_arrayElimCell_57 (_ BitVec 32)) (v_arrayElimCell_56 (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32)) (v_ArrVal_186 (_ BitVec 32))) (let ((.cse202 (concat v_arrayElimCell_57 v_arrayElimCell_56))) (let ((.cse200 (concat v_arrayElimCell_55 v_arrayElimCell_58)) (.cse195 (let ((.cse204 (bvadd .cse24 .cse202))) (concat ((_ extract 63 32) .cse204) ((_ extract 31 0) .cse204))))) (let ((.cse201 (let ((.cse203 (bvadd .cse200 .cse195))) (concat ((_ extract 63 32) .cse203) ((_ extract 31 0) .cse203))))) (or (= .cse3 (let ((.cse193 (bvadd .cse5 (let ((.cse194 (bvadd .cse5 .cse195))) (concat ((_ extract 63 32) .cse194) ((_ extract 31 0) .cse194)))))) (concat ((_ extract 63 32) .cse193) ((_ extract 31 0) .cse193)))) (= (let ((.cse196 (let ((.cse197 (concat .cse29 v_arrayElimCell_58))) (bvadd .cse197 (let ((.cse198 (bvadd .cse197 .cse195))) (concat ((_ extract 63 32) .cse198) ((_ extract 31 0) .cse198))))))) (concat ((_ extract 63 32) .cse196) ((_ extract 31 0) .cse196))) .cse3) (= (let ((.cse199 (bvadd .cse200 .cse201))) (concat ((_ extract 63 32) .cse199) ((_ extract 31 0) .cse199))) .cse3) (not (= .cse3 (concat v_ArrVal_186 ((_ extract 31 0) (bvadd .cse201 .cse202)))))))))) (forall ((v_arrayElimCell_58 (_ BitVec 32)) (v_arrayElimCell_57 (_ BitVec 32)) (v_arrayElimCell_56 (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32)) (v_ArrVal_186 (_ BitVec 32))) (let ((.cse217 (concat v_arrayElimCell_57 v_arrayElimCell_56))) (let ((.cse215 (concat v_arrayElimCell_55 v_arrayElimCell_58)) (.cse207 (let ((.cse219 (bvadd .cse24 .cse217))) (concat ((_ extract 63 32) .cse219) ((_ extract 31 0) .cse219))))) (let ((.cse216 (let ((.cse218 (bvadd .cse215 .cse207))) (concat ((_ extract 63 32) .cse218) ((_ extract 31 0) .cse218))))) (or (= .cse3 (let ((.cse205 (bvadd .cse5 (let ((.cse206 (bvadd .cse5 .cse207))) (concat ((_ extract 63 32) .cse206) ((_ extract 31 0) .cse206)))))) (concat ((_ extract 63 32) .cse205) ((_ extract 31 0) .cse205)))) (= (let ((.cse208 (bvadd (let ((.cse209 (bvadd .cse27 (let ((.cse210 (bvadd .cse24 (concat .cse29 v_arrayElimCell_56)))) (concat ((_ extract 63 32) .cse210) ((_ extract 31 0) .cse210)))))) (concat ((_ extract 63 32) .cse209) ((_ extract 31 0) .cse209))) .cse27))) (concat ((_ extract 63 32) .cse208) ((_ extract 31 0) .cse208))) .cse3) (= (let ((.cse211 (let ((.cse212 (concat .cse29 v_arrayElimCell_58))) (bvadd .cse212 (let ((.cse213 (bvadd .cse212 .cse207))) (concat ((_ extract 63 32) .cse213) ((_ extract 31 0) .cse213))))))) (concat ((_ extract 63 32) .cse211) ((_ extract 31 0) .cse211))) .cse3) (= (let ((.cse214 (bvadd .cse215 .cse216))) (concat ((_ extract 63 32) .cse214) ((_ extract 31 0) .cse214))) .cse3) (not (= .cse3 (concat v_ArrVal_186 ((_ extract 31 0) (bvadd .cse216 .cse217))))))))))) .cse59)) .cse220) (or (and (or .cse110 (forall ((v_arrayElimCell_55 (_ BitVec 32))) (= (let ((.cse221 (let ((.cse223 (concat v_arrayElimCell_55 .cse13))) (bvadd (let ((.cse222 (bvadd .cse11 .cse223))) (concat ((_ extract 63 32) .cse222) ((_ extract 31 0) .cse222))) .cse223)))) (concat ((_ extract 63 32) .cse221) ((_ extract 31 0) .cse221))) .cse3)) .cse111) (or (and (forall ((v_arrayElimCell_55 (_ BitVec 32))) (or (= (let ((.cse224 (let ((.cse226 (concat v_arrayElimCell_55 .cse13))) (bvadd (let ((.cse225 (bvadd .cse11 .cse226))) (concat ((_ extract 63 32) .cse225) ((_ extract 31 0) .cse225))) .cse226)))) (concat ((_ extract 63 32) .cse224) ((_ extract 31 0) .cse224))) .cse3) (forall ((v_arrayElimCell_58 (_ BitVec 32)) (v_arrayElimCell_57 (_ BitVec 32))) (let ((.cse228 (concat v_arrayElimCell_55 v_arrayElimCell_58))) (or (= (let ((.cse227 (bvadd .cse228 (let ((.cse229 (bvadd .cse228 (let ((.cse230 (bvadd (concat v_arrayElimCell_57 .cse13) .cse24))) (concat ((_ extract 63 32) .cse230) ((_ extract 31 0) .cse230)))))) (concat ((_ extract 63 32) .cse229) ((_ extract 31 0) .cse229)))))) (concat ((_ extract 63 32) .cse227) ((_ extract 31 0) .cse227))) .cse3) (forall ((v_arrayElimCell_56 (_ BitVec 32)) (v_ArrVal_186 (_ BitVec 32))) (let ((.cse233 (concat v_arrayElimCell_57 v_arrayElimCell_56))) (let ((.cse232 (let ((.cse234 (bvadd .cse228 (let ((.cse235 (bvadd .cse24 .cse233))) (concat ((_ extract 63 32) .cse235) ((_ extract 31 0) .cse235)))))) (concat ((_ extract 63 32) .cse234) ((_ extract 31 0) .cse234))))) (or (= (let ((.cse231 (bvadd .cse228 .cse232))) (concat ((_ extract 63 32) .cse231) ((_ extract 31 0) .cse231))) .cse3) (not (= .cse3 (concat v_ArrVal_186 ((_ extract 31 0) (bvadd .cse232 .cse233)))))))))))))) (forall ((v_arrayElimCell_55 (_ BitVec 32))) (or (forall ((v_arrayElimCell_58 (_ BitVec 32)) (v_arrayElimCell_57 (_ BitVec 32))) (let ((.cse237 (concat v_arrayElimCell_55 v_arrayElimCell_58))) (or (= (let ((.cse236 (bvadd .cse237 (let ((.cse238 (bvadd .cse237 (let ((.cse239 (bvadd (concat v_arrayElimCell_57 .cse13) .cse24))) (concat ((_ extract 63 32) .cse239) ((_ extract 31 0) .cse239)))))) (concat ((_ extract 63 32) .cse238) ((_ extract 31 0) .cse238)))))) (concat ((_ extract 63 32) .cse236) ((_ extract 31 0) .cse236))) .cse3) (forall ((v_arrayElimCell_56 (_ BitVec 32)) (v_ArrVal_186 (_ BitVec 32))) (let ((.cse245 (concat v_arrayElimCell_57 v_arrayElimCell_56))) (let ((.cse244 (let ((.cse246 (bvadd .cse237 (let ((.cse247 (bvadd .cse24 .cse245))) (concat ((_ extract 63 32) .cse247) ((_ extract 31 0) .cse247)))))) (concat ((_ extract 63 32) .cse246) ((_ extract 31 0) .cse246))))) (or (= (let ((.cse240 (bvadd (let ((.cse241 (bvadd .cse27 (let ((.cse242 (bvadd .cse24 (concat .cse29 v_arrayElimCell_56)))) (concat ((_ extract 63 32) .cse242) ((_ extract 31 0) .cse242)))))) (concat ((_ extract 63 32) .cse241) ((_ extract 31 0) .cse241))) .cse27))) (concat ((_ extract 63 32) .cse240) ((_ extract 31 0) .cse240))) .cse3) (= (let ((.cse243 (bvadd .cse237 .cse244))) (concat ((_ extract 63 32) .cse243) ((_ extract 31 0) .cse243))) .cse3) (not (= .cse3 (concat v_ArrVal_186 ((_ extract 31 0) (bvadd .cse244 .cse245)))))))))))) (= (let ((.cse248 (let ((.cse250 (concat v_arrayElimCell_55 .cse13))) (bvadd (let ((.cse249 (bvadd .cse11 .cse250))) (concat ((_ extract 63 32) .cse249) ((_ extract 31 0) .cse249))) .cse250)))) (concat ((_ extract 63 32) .cse248) ((_ extract 31 0) .cse248))) .cse3))) (forall ((v_arrayElimCell_55 (_ BitVec 32))) (or (= (let ((.cse251 (let ((.cse253 (concat v_arrayElimCell_55 .cse13))) (bvadd (let ((.cse252 (bvadd .cse11 .cse253))) (concat ((_ extract 63 32) .cse252) ((_ extract 31 0) .cse252))) .cse253)))) (concat ((_ extract 63 32) .cse251) ((_ extract 31 0) .cse251))) .cse3) (forall ((v_arrayElimCell_58 (_ BitVec 32)) (v_arrayElimCell_57 (_ BitVec 32))) (let ((.cse262 (concat v_arrayElimCell_55 v_arrayElimCell_58))) (or (forall ((v_arrayElimCell_56 (_ BitVec 32)) (v_ArrVal_186 (_ BitVec 32))) (let ((.cse264 (concat v_arrayElimCell_57 v_arrayElimCell_56))) (let ((.cse260 (let ((.cse266 (bvadd .cse24 .cse264))) (concat ((_ extract 63 32) .cse266) ((_ extract 31 0) .cse266))))) (let ((.cse263 (let ((.cse265 (bvadd .cse262 .cse260))) (concat ((_ extract 63 32) .cse265) ((_ extract 31 0) .cse265))))) (or (= (let ((.cse254 (bvadd (let ((.cse255 (bvadd .cse27 (let ((.cse256 (bvadd .cse24 (concat .cse29 v_arrayElimCell_56)))) (concat ((_ extract 63 32) .cse256) ((_ extract 31 0) .cse256)))))) (concat ((_ extract 63 32) .cse255) ((_ extract 31 0) .cse255))) .cse27))) (concat ((_ extract 63 32) .cse254) ((_ extract 31 0) .cse254))) .cse3) (= (let ((.cse257 (let ((.cse258 (concat .cse29 v_arrayElimCell_58))) (bvadd .cse258 (let ((.cse259 (bvadd .cse258 .cse260))) (concat ((_ extract 63 32) .cse259) ((_ extract 31 0) .cse259))))))) (concat ((_ extract 63 32) .cse257) ((_ extract 31 0) .cse257))) .cse3) (= (let ((.cse261 (bvadd .cse262 .cse263))) (concat ((_ extract 63 32) .cse261) ((_ extract 31 0) .cse261))) .cse3) (not (= .cse3 (concat v_ArrVal_186 ((_ extract 31 0) (bvadd .cse263 .cse264)))))))))) (= (let ((.cse267 (bvadd .cse262 (let ((.cse268 (bvadd .cse262 (let ((.cse269 (bvadd (concat v_arrayElimCell_57 .cse13) .cse24))) (concat ((_ extract 63 32) .cse269) ((_ extract 31 0) .cse269)))))) (concat ((_ extract 63 32) .cse268) ((_ extract 31 0) .cse268)))))) (concat ((_ extract 63 32) .cse267) ((_ extract 31 0) .cse267))) .cse3)))))) (forall ((v_arrayElimCell_55 (_ BitVec 32))) (or (= (let ((.cse270 (let ((.cse272 (concat v_arrayElimCell_55 .cse13))) (bvadd (let ((.cse271 (bvadd .cse11 .cse272))) (concat ((_ extract 63 32) .cse271) ((_ extract 31 0) .cse271))) .cse272)))) (concat ((_ extract 63 32) .cse270) ((_ extract 31 0) .cse270))) .cse3) (forall ((v_arrayElimCell_58 (_ BitVec 32)) (v_arrayElimCell_57 (_ BitVec 32))) (let ((.cse278 (concat v_arrayElimCell_55 v_arrayElimCell_58))) (or (forall ((v_arrayElimCell_56 (_ BitVec 32)) (v_ArrVal_186 (_ BitVec 32))) (let ((.cse280 (concat v_arrayElimCell_57 v_arrayElimCell_56))) (let ((.cse276 (let ((.cse282 (bvadd .cse24 .cse280))) (concat ((_ extract 63 32) .cse282) ((_ extract 31 0) .cse282))))) (let ((.cse279 (let ((.cse281 (bvadd .cse278 .cse276))) (concat ((_ extract 63 32) .cse281) ((_ extract 31 0) .cse281))))) (or (= (let ((.cse273 (let ((.cse274 (concat .cse29 v_arrayElimCell_58))) (bvadd .cse274 (let ((.cse275 (bvadd .cse274 .cse276))) (concat ((_ extract 63 32) .cse275) ((_ extract 31 0) .cse275))))))) (concat ((_ extract 63 32) .cse273) ((_ extract 31 0) .cse273))) .cse3) (= (let ((.cse277 (bvadd .cse278 .cse279))) (concat ((_ extract 63 32) .cse277) ((_ extract 31 0) .cse277))) .cse3) (not (= .cse3 (concat v_ArrVal_186 ((_ extract 31 0) (bvadd .cse279 .cse280)))))))))) (= (let ((.cse283 (bvadd .cse278 (let ((.cse284 (bvadd .cse278 (let ((.cse285 (bvadd (concat v_arrayElimCell_57 .cse13) .cse24))) (concat ((_ extract 63 32) .cse285) ((_ extract 31 0) .cse285)))))) (concat ((_ extract 63 32) .cse284) ((_ extract 31 0) .cse284)))))) (concat ((_ extract 63 32) .cse283) ((_ extract 31 0) .cse283))) .cse3))))))) .cse59) (or (and (forall ((v_arrayElimCell_55 (_ BitVec 32))) (or (forall ((v_arrayElimCell_58 (_ BitVec 32)) (v_arrayElimCell_57 (_ BitVec 32)) (v_arrayElimCell_56 (_ BitVec 32)) (v_ArrVal_186 (_ BitVec 32))) (let ((.cse295 (concat v_arrayElimCell_57 v_arrayElimCell_56))) (let ((.cse293 (concat v_arrayElimCell_55 v_arrayElimCell_58)) (.cse288 (let ((.cse297 (bvadd .cse24 .cse295))) (concat ((_ extract 63 32) .cse297) ((_ extract 31 0) .cse297))))) (let ((.cse294 (let ((.cse296 (bvadd .cse293 .cse288))) (concat ((_ extract 63 32) .cse296) ((_ extract 31 0) .cse296))))) (or (= .cse3 (let ((.cse286 (bvadd .cse5 (let ((.cse287 (bvadd .cse5 .cse288))) (concat ((_ extract 63 32) .cse287) ((_ extract 31 0) .cse287)))))) (concat ((_ extract 63 32) .cse286) ((_ extract 31 0) .cse286)))) (= (let ((.cse289 (bvadd (let ((.cse290 (bvadd .cse27 (let ((.cse291 (bvadd .cse24 (concat .cse29 v_arrayElimCell_56)))) (concat ((_ extract 63 32) .cse291) ((_ extract 31 0) .cse291)))))) (concat ((_ extract 63 32) .cse290) ((_ extract 31 0) .cse290))) .cse27))) (concat ((_ extract 63 32) .cse289) ((_ extract 31 0) .cse289))) .cse3) (= (let ((.cse292 (bvadd .cse293 .cse294))) (concat ((_ extract 63 32) .cse292) ((_ extract 31 0) .cse292))) .cse3) (not (= .cse3 (concat v_ArrVal_186 ((_ extract 31 0) (bvadd .cse294 .cse295)))))))))) (= (let ((.cse298 (let ((.cse300 (concat v_arrayElimCell_55 .cse13))) (bvadd (let ((.cse299 (bvadd .cse11 .cse300))) (concat ((_ extract 63 32) .cse299) ((_ extract 31 0) .cse299))) .cse300)))) (concat ((_ extract 63 32) .cse298) ((_ extract 31 0) .cse298))) .cse3))) (forall ((v_arrayElimCell_55 (_ BitVec 32))) (or (forall ((v_arrayElimCell_58 (_ BitVec 32)) (v_arrayElimCell_57 (_ BitVec 32)) (v_arrayElimCell_56 (_ BitVec 32)) (v_ArrVal_186 (_ BitVec 32))) (let ((.cse307 (concat v_arrayElimCell_57 v_arrayElimCell_56))) (let ((.cse305 (concat v_arrayElimCell_55 v_arrayElimCell_58)) (.cse303 (let ((.cse309 (bvadd .cse24 .cse307))) (concat ((_ extract 63 32) .cse309) ((_ extract 31 0) .cse309))))) (let ((.cse306 (let ((.cse308 (bvadd .cse305 .cse303))) (concat ((_ extract 63 32) .cse308) ((_ extract 31 0) .cse308))))) (or (= .cse3 (let ((.cse301 (bvadd .cse5 (let ((.cse302 (bvadd .cse5 .cse303))) (concat ((_ extract 63 32) .cse302) ((_ extract 31 0) .cse302)))))) (concat ((_ extract 63 32) .cse301) ((_ extract 31 0) .cse301)))) (= (let ((.cse304 (bvadd .cse305 .cse306))) (concat ((_ extract 63 32) .cse304) ((_ extract 31 0) .cse304))) .cse3) (not (= .cse3 (concat v_ArrVal_186 ((_ extract 31 0) (bvadd .cse306 .cse307)))))))))) (= (let ((.cse310 (let ((.cse312 (concat v_arrayElimCell_55 .cse13))) (bvadd (let ((.cse311 (bvadd .cse11 .cse312))) (concat ((_ extract 63 32) .cse311) ((_ extract 31 0) .cse311))) .cse312)))) (concat ((_ extract 63 32) .cse310) ((_ extract 31 0) .cse310))) .cse3))) (forall ((v_arrayElimCell_55 (_ BitVec 32))) (or (forall ((v_arrayElimCell_58 (_ BitVec 32)) (v_arrayElimCell_57 (_ BitVec 32)) (v_arrayElimCell_56 (_ BitVec 32)) (v_ArrVal_186 (_ BitVec 32))) (let ((.cse322 (concat v_arrayElimCell_57 v_arrayElimCell_56))) (let ((.cse320 (concat v_arrayElimCell_55 v_arrayElimCell_58)) (.cse315 (let ((.cse324 (bvadd .cse24 .cse322))) (concat ((_ extract 63 32) .cse324) ((_ extract 31 0) .cse324))))) (let ((.cse321 (let ((.cse323 (bvadd .cse320 .cse315))) (concat ((_ extract 63 32) .cse323) ((_ extract 31 0) .cse323))))) (or (= .cse3 (let ((.cse313 (bvadd .cse5 (let ((.cse314 (bvadd .cse5 .cse315))) (concat ((_ extract 63 32) .cse314) ((_ extract 31 0) .cse314)))))) (concat ((_ extract 63 32) .cse313) ((_ extract 31 0) .cse313)))) (= (let ((.cse316 (let ((.cse317 (concat .cse29 v_arrayElimCell_58))) (bvadd .cse317 (let ((.cse318 (bvadd .cse317 .cse315))) (concat ((_ extract 63 32) .cse318) ((_ extract 31 0) .cse318))))))) (concat ((_ extract 63 32) .cse316) ((_ extract 31 0) .cse316))) .cse3) (= (let ((.cse319 (bvadd .cse320 .cse321))) (concat ((_ extract 63 32) .cse319) ((_ extract 31 0) .cse319))) .cse3) (not (= .cse3 (concat v_ArrVal_186 ((_ extract 31 0) (bvadd .cse321 .cse322)))))))))) (= (let ((.cse325 (let ((.cse327 (concat v_arrayElimCell_55 .cse13))) (bvadd (let ((.cse326 (bvadd .cse11 .cse327))) (concat ((_ extract 63 32) .cse326) ((_ extract 31 0) .cse326))) .cse327)))) (concat ((_ extract 63 32) .cse325) ((_ extract 31 0) .cse325))) .cse3))) (forall ((v_arrayElimCell_55 (_ BitVec 32))) (or (forall ((v_arrayElimCell_58 (_ BitVec 32)) (v_arrayElimCell_57 (_ BitVec 32)) (v_arrayElimCell_56 (_ BitVec 32)) (v_ArrVal_186 (_ BitVec 32))) (let ((.cse340 (concat v_arrayElimCell_57 v_arrayElimCell_56))) (let ((.cse338 (concat v_arrayElimCell_55 v_arrayElimCell_58)) (.cse330 (let ((.cse342 (bvadd .cse24 .cse340))) (concat ((_ extract 63 32) .cse342) ((_ extract 31 0) .cse342))))) (let ((.cse339 (let ((.cse341 (bvadd .cse338 .cse330))) (concat ((_ extract 63 32) .cse341) ((_ extract 31 0) .cse341))))) (or (= .cse3 (let ((.cse328 (bvadd .cse5 (let ((.cse329 (bvadd .cse5 .cse330))) (concat ((_ extract 63 32) .cse329) ((_ extract 31 0) .cse329)))))) (concat ((_ extract 63 32) .cse328) ((_ extract 31 0) .cse328)))) (= (let ((.cse331 (bvadd (let ((.cse332 (bvadd .cse27 (let ((.cse333 (bvadd .cse24 (concat .cse29 v_arrayElimCell_56)))) (concat ((_ extract 63 32) .cse333) ((_ extract 31 0) .cse333)))))) (concat ((_ extract 63 32) .cse332) ((_ extract 31 0) .cse332))) .cse27))) (concat ((_ extract 63 32) .cse331) ((_ extract 31 0) .cse331))) .cse3) (= (let ((.cse334 (let ((.cse335 (concat .cse29 v_arrayElimCell_58))) (bvadd .cse335 (let ((.cse336 (bvadd .cse335 .cse330))) (concat ((_ extract 63 32) .cse336) ((_ extract 31 0) .cse336))))))) (concat ((_ extract 63 32) .cse334) ((_ extract 31 0) .cse334))) .cse3) (= (let ((.cse337 (bvadd .cse338 .cse339))) (concat ((_ extract 63 32) .cse337) ((_ extract 31 0) .cse337))) .cse3) (not (= .cse3 (concat v_ArrVal_186 ((_ extract 31 0) (bvadd .cse339 .cse340)))))))))) (= (let ((.cse343 (let ((.cse345 (concat v_arrayElimCell_55 .cse13))) (bvadd (let ((.cse344 (bvadd .cse11 .cse345))) (concat ((_ extract 63 32) .cse344) ((_ extract 31 0) .cse344))) .cse345)))) (concat ((_ extract 63 32) .cse343) ((_ extract 31 0) .cse343))) .cse3)))) .cse59) (or .cse59 (and (forall ((v_arrayElimCell_55 (_ BitVec 32))) (or (= (let ((.cse346 (let ((.cse348 (concat v_arrayElimCell_55 .cse13))) (bvadd (let ((.cse347 (bvadd .cse11 .cse348))) (concat ((_ extract 63 32) .cse347) ((_ extract 31 0) .cse347))) .cse348)))) (concat ((_ extract 63 32) .cse346) ((_ extract 31 0) .cse346))) .cse3) (forall ((v_arrayElimCell_58 (_ BitVec 32)) (v_arrayElimCell_57 (_ BitVec 32))) (let ((.cse350 (concat v_arrayElimCell_55 v_arrayElimCell_58))) (or (= (let ((.cse349 (bvadd .cse350 (let ((.cse351 (bvadd .cse350 (let ((.cse352 (bvadd (concat v_arrayElimCell_57 .cse13) .cse24))) (concat ((_ extract 63 32) .cse352) ((_ extract 31 0) .cse352)))))) (concat ((_ extract 63 32) .cse351) ((_ extract 31 0) .cse351)))))) (concat ((_ extract 63 32) .cse349) ((_ extract 31 0) .cse349))) .cse3) (forall ((v_arrayElimCell_56 (_ BitVec 32)) (v_ArrVal_186 (_ BitVec 32))) (let ((.cse361 (concat v_arrayElimCell_57 v_arrayElimCell_56))) (let ((.cse355 (let ((.cse363 (bvadd .cse24 .cse361))) (concat ((_ extract 63 32) .cse363) ((_ extract 31 0) .cse363))))) (let ((.cse360 (let ((.cse362 (bvadd .cse350 .cse355))) (concat ((_ extract 63 32) .cse362) ((_ extract 31 0) .cse362))))) (or (= .cse3 (let ((.cse353 (bvadd .cse5 (let ((.cse354 (bvadd .cse5 .cse355))) (concat ((_ extract 63 32) .cse354) ((_ extract 31 0) .cse354)))))) (concat ((_ extract 63 32) .cse353) ((_ extract 31 0) .cse353)))) (= (let ((.cse356 (let ((.cse357 (concat .cse29 v_arrayElimCell_58))) (bvadd .cse357 (let ((.cse358 (bvadd .cse357 .cse355))) (concat ((_ extract 63 32) .cse358) ((_ extract 31 0) .cse358))))))) (concat ((_ extract 63 32) .cse356) ((_ extract 31 0) .cse356))) .cse3) (= (let ((.cse359 (bvadd .cse350 .cse360))) (concat ((_ extract 63 32) .cse359) ((_ extract 31 0) .cse359))) .cse3) (not (= .cse3 (concat v_ArrVal_186 ((_ extract 31 0) (bvadd .cse360 .cse361))))))))))))))) (forall ((v_arrayElimCell_55 (_ BitVec 32))) (or (= (let ((.cse364 (let ((.cse366 (concat v_arrayElimCell_55 .cse13))) (bvadd (let ((.cse365 (bvadd .cse11 .cse366))) (concat ((_ extract 63 32) .cse365) ((_ extract 31 0) .cse365))) .cse366)))) (concat ((_ extract 63 32) .cse364) ((_ extract 31 0) .cse364))) .cse3) (forall ((v_arrayElimCell_58 (_ BitVec 32)) (v_arrayElimCell_57 (_ BitVec 32))) (let ((.cse377 (concat v_arrayElimCell_55 v_arrayElimCell_58))) (or (forall ((v_arrayElimCell_56 (_ BitVec 32)) (v_ArrVal_186 (_ BitVec 32))) (let ((.cse379 (concat v_arrayElimCell_57 v_arrayElimCell_56))) (let ((.cse369 (let ((.cse381 (bvadd .cse24 .cse379))) (concat ((_ extract 63 32) .cse381) ((_ extract 31 0) .cse381))))) (let ((.cse378 (let ((.cse380 (bvadd .cse377 .cse369))) (concat ((_ extract 63 32) .cse380) ((_ extract 31 0) .cse380))))) (or (= .cse3 (let ((.cse367 (bvadd .cse5 (let ((.cse368 (bvadd .cse5 .cse369))) (concat ((_ extract 63 32) .cse368) ((_ extract 31 0) .cse368)))))) (concat ((_ extract 63 32) .cse367) ((_ extract 31 0) .cse367)))) (= (let ((.cse370 (bvadd (let ((.cse371 (bvadd .cse27 (let ((.cse372 (bvadd .cse24 (concat .cse29 v_arrayElimCell_56)))) (concat ((_ extract 63 32) .cse372) ((_ extract 31 0) .cse372)))))) (concat ((_ extract 63 32) .cse371) ((_ extract 31 0) .cse371))) .cse27))) (concat ((_ extract 63 32) .cse370) ((_ extract 31 0) .cse370))) .cse3) (= (let ((.cse373 (let ((.cse374 (concat .cse29 v_arrayElimCell_58))) (bvadd .cse374 (let ((.cse375 (bvadd .cse374 .cse369))) (concat ((_ extract 63 32) .cse375) ((_ extract 31 0) .cse375))))))) (concat ((_ extract 63 32) .cse373) ((_ extract 31 0) .cse373))) .cse3) (= (let ((.cse376 (bvadd .cse377 .cse378))) (concat ((_ extract 63 32) .cse376) ((_ extract 31 0) .cse376))) .cse3) (not (= .cse3 (concat v_ArrVal_186 ((_ extract 31 0) (bvadd .cse378 .cse379)))))))))) (= (let ((.cse382 (bvadd .cse377 (let ((.cse383 (bvadd .cse377 (let ((.cse384 (bvadd (concat v_arrayElimCell_57 .cse13) .cse24))) (concat ((_ extract 63 32) .cse384) ((_ extract 31 0) .cse384)))))) (concat ((_ extract 63 32) .cse383) ((_ extract 31 0) .cse383)))))) (concat ((_ extract 63 32) .cse382) ((_ extract 31 0) .cse382))) .cse3)))))) (forall ((v_arrayElimCell_55 (_ BitVec 32))) (or (= (let ((.cse385 (let ((.cse387 (concat v_arrayElimCell_55 .cse13))) (bvadd (let ((.cse386 (bvadd .cse11 .cse387))) (concat ((_ extract 63 32) .cse386) ((_ extract 31 0) .cse386))) .cse387)))) (concat ((_ extract 63 32) .cse385) ((_ extract 31 0) .cse385))) .cse3) (forall ((v_arrayElimCell_58 (_ BitVec 32)) (v_arrayElimCell_57 (_ BitVec 32))) (let ((.cse389 (concat v_arrayElimCell_55 v_arrayElimCell_58))) (or (= (let ((.cse388 (bvadd .cse389 (let ((.cse390 (bvadd .cse389 (let ((.cse391 (bvadd (concat v_arrayElimCell_57 .cse13) .cse24))) (concat ((_ extract 63 32) .cse391) ((_ extract 31 0) .cse391)))))) (concat ((_ extract 63 32) .cse390) ((_ extract 31 0) .cse390)))))) (concat ((_ extract 63 32) .cse388) ((_ extract 31 0) .cse388))) .cse3) (forall ((v_arrayElimCell_56 (_ BitVec 32)) (v_ArrVal_186 (_ BitVec 32))) (let ((.cse397 (concat v_arrayElimCell_57 v_arrayElimCell_56))) (let ((.cse394 (let ((.cse399 (bvadd .cse24 .cse397))) (concat ((_ extract 63 32) .cse399) ((_ extract 31 0) .cse399))))) (let ((.cse396 (let ((.cse398 (bvadd .cse389 .cse394))) (concat ((_ extract 63 32) .cse398) ((_ extract 31 0) .cse398))))) (or (= .cse3 (let ((.cse392 (bvadd .cse5 (let ((.cse393 (bvadd .cse5 .cse394))) (concat ((_ extract 63 32) .cse393) ((_ extract 31 0) .cse393)))))) (concat ((_ extract 63 32) .cse392) ((_ extract 31 0) .cse392)))) (= (let ((.cse395 (bvadd .cse389 .cse396))) (concat ((_ extract 63 32) .cse395) ((_ extract 31 0) .cse395))) .cse3) (not (= .cse3 (concat v_ArrVal_186 ((_ extract 31 0) (bvadd .cse396 .cse397))))))))))))))) (forall ((v_arrayElimCell_55 (_ BitVec 32))) (or (forall ((v_arrayElimCell_58 (_ BitVec 32)) (v_arrayElimCell_57 (_ BitVec 32))) (let ((.cse401 (concat v_arrayElimCell_55 v_arrayElimCell_58))) (or (= (let ((.cse400 (bvadd .cse401 (let ((.cse402 (bvadd .cse401 (let ((.cse403 (bvadd (concat v_arrayElimCell_57 .cse13) .cse24))) (concat ((_ extract 63 32) .cse403) ((_ extract 31 0) .cse403)))))) (concat ((_ extract 63 32) .cse402) ((_ extract 31 0) .cse402)))))) (concat ((_ extract 63 32) .cse400) ((_ extract 31 0) .cse400))) .cse3) (forall ((v_arrayElimCell_56 (_ BitVec 32)) (v_ArrVal_186 (_ BitVec 32))) (let ((.cse412 (concat v_arrayElimCell_57 v_arrayElimCell_56))) (let ((.cse406 (let ((.cse414 (bvadd .cse24 .cse412))) (concat ((_ extract 63 32) .cse414) ((_ extract 31 0) .cse414))))) (let ((.cse411 (let ((.cse413 (bvadd .cse401 .cse406))) (concat ((_ extract 63 32) .cse413) ((_ extract 31 0) .cse413))))) (or (= .cse3 (let ((.cse404 (bvadd .cse5 (let ((.cse405 (bvadd .cse5 .cse406))) (concat ((_ extract 63 32) .cse405) ((_ extract 31 0) .cse405)))))) (concat ((_ extract 63 32) .cse404) ((_ extract 31 0) .cse404)))) (= (let ((.cse407 (bvadd (let ((.cse408 (bvadd .cse27 (let ((.cse409 (bvadd .cse24 (concat .cse29 v_arrayElimCell_56)))) (concat ((_ extract 63 32) .cse409) ((_ extract 31 0) .cse409)))))) (concat ((_ extract 63 32) .cse408) ((_ extract 31 0) .cse408))) .cse27))) (concat ((_ extract 63 32) .cse407) ((_ extract 31 0) .cse407))) .cse3) (= (let ((.cse410 (bvadd .cse401 .cse411))) (concat ((_ extract 63 32) .cse410) ((_ extract 31 0) .cse410))) .cse3) (not (= .cse3 (concat v_ArrVal_186 ((_ extract 31 0) (bvadd .cse411 .cse412))))))))))))) (= (let ((.cse415 (let ((.cse417 (concat v_arrayElimCell_55 .cse13))) (bvadd (let ((.cse416 (bvadd .cse11 .cse417))) (concat ((_ extract 63 32) .cse416) ((_ extract 31 0) .cse416))) .cse417)))) (concat ((_ extract 63 32) .cse415) ((_ extract 31 0) .cse415))) .cse3))))) (or (and (forall ((v_arrayElimCell_55 (_ BitVec 32))) (or (forall ((v_arrayElimCell_58 (_ BitVec 32)) (v_arrayElimCell_57 (_ BitVec 32)) (v_arrayElimCell_56 (_ BitVec 32)) (v_ArrVal_186 (_ BitVec 32))) (let ((.cse419 (concat v_arrayElimCell_55 v_arrayElimCell_58)) (.cse421 (concat v_arrayElimCell_57 v_arrayElimCell_56))) (let ((.cse420 (let ((.cse422 (bvadd .cse419 (let ((.cse423 (bvadd .cse24 .cse421))) (concat ((_ extract 63 32) .cse423) ((_ extract 31 0) .cse423)))))) (concat ((_ extract 63 32) .cse422) ((_ extract 31 0) .cse422))))) (or (= (let ((.cse418 (bvadd .cse419 .cse420))) (concat ((_ extract 63 32) .cse418) ((_ extract 31 0) .cse418))) .cse3) (not (= .cse3 (concat v_ArrVal_186 ((_ extract 31 0) (bvadd .cse420 .cse421))))))))) (= (let ((.cse424 (let ((.cse426 (concat v_arrayElimCell_55 .cse13))) (bvadd (let ((.cse425 (bvadd .cse11 .cse426))) (concat ((_ extract 63 32) .cse425) ((_ extract 31 0) .cse425))) .cse426)))) (concat ((_ extract 63 32) .cse424) ((_ extract 31 0) .cse424))) .cse3))) (forall ((v_arrayElimCell_55 (_ BitVec 32))) (or (forall ((v_arrayElimCell_58 (_ BitVec 32)) (v_arrayElimCell_57 (_ BitVec 32)) (v_arrayElimCell_56 (_ BitVec 32)) (v_ArrVal_186 (_ BitVec 32))) (let ((.cse437 (concat v_arrayElimCell_57 v_arrayElimCell_56))) (let ((.cse435 (concat v_arrayElimCell_55 v_arrayElimCell_58)) (.cse433 (let ((.cse439 (bvadd .cse24 .cse437))) (concat ((_ extract 63 32) .cse439) ((_ extract 31 0) .cse439))))) (let ((.cse436 (let ((.cse438 (bvadd .cse435 .cse433))) (concat ((_ extract 63 32) .cse438) ((_ extract 31 0) .cse438))))) (or (= (let ((.cse427 (bvadd (let ((.cse428 (bvadd .cse27 (let ((.cse429 (bvadd .cse24 (concat .cse29 v_arrayElimCell_56)))) (concat ((_ extract 63 32) .cse429) ((_ extract 31 0) .cse429)))))) (concat ((_ extract 63 32) .cse428) ((_ extract 31 0) .cse428))) .cse27))) (concat ((_ extract 63 32) .cse427) ((_ extract 31 0) .cse427))) .cse3) (= (let ((.cse430 (let ((.cse431 (concat .cse29 v_arrayElimCell_58))) (bvadd .cse431 (let ((.cse432 (bvadd .cse431 .cse433))) (concat ((_ extract 63 32) .cse432) ((_ extract 31 0) .cse432))))))) (concat ((_ extract 63 32) .cse430) ((_ extract 31 0) .cse430))) .cse3) (= (let ((.cse434 (bvadd .cse435 .cse436))) (concat ((_ extract 63 32) .cse434) ((_ extract 31 0) .cse434))) .cse3) (not (= .cse3 (concat v_ArrVal_186 ((_ extract 31 0) (bvadd .cse436 .cse437)))))))))) (= (let ((.cse440 (let ((.cse442 (concat v_arrayElimCell_55 .cse13))) (bvadd (let ((.cse441 (bvadd .cse11 .cse442))) (concat ((_ extract 63 32) .cse441) ((_ extract 31 0) .cse441))) .cse442)))) (concat ((_ extract 63 32) .cse440) ((_ extract 31 0) .cse440))) .cse3))) (forall ((v_arrayElimCell_55 (_ BitVec 32))) (or (= (let ((.cse443 (let ((.cse445 (concat v_arrayElimCell_55 .cse13))) (bvadd (let ((.cse444 (bvadd .cse11 .cse445))) (concat ((_ extract 63 32) .cse444) ((_ extract 31 0) .cse444))) .cse445)))) (concat ((_ extract 63 32) .cse443) ((_ extract 31 0) .cse443))) .cse3) (forall ((v_arrayElimCell_58 (_ BitVec 32)) (v_arrayElimCell_57 (_ BitVec 32)) (v_arrayElimCell_56 (_ BitVec 32)) (v_ArrVal_186 (_ BitVec 32))) (let ((.cse453 (concat v_arrayElimCell_57 v_arrayElimCell_56))) (let ((.cse451 (concat v_arrayElimCell_55 v_arrayElimCell_58)) (.cse449 (let ((.cse455 (bvadd .cse24 .cse453))) (concat ((_ extract 63 32) .cse455) ((_ extract 31 0) .cse455))))) (let ((.cse452 (let ((.cse454 (bvadd .cse451 .cse449))) (concat ((_ extract 63 32) .cse454) ((_ extract 31 0) .cse454))))) (or (= (let ((.cse446 (let ((.cse447 (concat .cse29 v_arrayElimCell_58))) (bvadd .cse447 (let ((.cse448 (bvadd .cse447 .cse449))) (concat ((_ extract 63 32) .cse448) ((_ extract 31 0) .cse448))))))) (concat ((_ extract 63 32) .cse446) ((_ extract 31 0) .cse446))) .cse3) (= (let ((.cse450 (bvadd .cse451 .cse452))) (concat ((_ extract 63 32) .cse450) ((_ extract 31 0) .cse450))) .cse3) (not (= .cse3 (concat v_ArrVal_186 ((_ extract 31 0) (bvadd .cse452 .cse453)))))))))))) (forall ((v_arrayElimCell_55 (_ BitVec 32))) (or (forall ((v_arrayElimCell_58 (_ BitVec 32)) (v_arrayElimCell_57 (_ BitVec 32)) (v_arrayElimCell_56 (_ BitVec 32)) (v_ArrVal_186 (_ BitVec 32))) (let ((.cse460 (concat v_arrayElimCell_55 v_arrayElimCell_58)) (.cse462 (concat v_arrayElimCell_57 v_arrayElimCell_56))) (let ((.cse461 (let ((.cse463 (bvadd .cse460 (let ((.cse464 (bvadd .cse24 .cse462))) (concat ((_ extract 63 32) .cse464) ((_ extract 31 0) .cse464)))))) (concat ((_ extract 63 32) .cse463) ((_ extract 31 0) .cse463))))) (or (= (let ((.cse456 (bvadd (let ((.cse457 (bvadd .cse27 (let ((.cse458 (bvadd .cse24 (concat .cse29 v_arrayElimCell_56)))) (concat ((_ extract 63 32) .cse458) ((_ extract 31 0) .cse458)))))) (concat ((_ extract 63 32) .cse457) ((_ extract 31 0) .cse457))) .cse27))) (concat ((_ extract 63 32) .cse456) ((_ extract 31 0) .cse456))) .cse3) (= (let ((.cse459 (bvadd .cse460 .cse461))) (concat ((_ extract 63 32) .cse459) ((_ extract 31 0) .cse459))) .cse3) (not (= .cse3 (concat v_ArrVal_186 ((_ extract 31 0) (bvadd .cse461 .cse462))))))))) (= (let ((.cse465 (let ((.cse467 (concat v_arrayElimCell_55 .cse13))) (bvadd (let ((.cse466 (bvadd .cse11 .cse467))) (concat ((_ extract 63 32) .cse466) ((_ extract 31 0) .cse466))) .cse467)))) (concat ((_ extract 63 32) .cse465) ((_ extract 31 0) .cse465))) .cse3)))) .cse59)) .cse220) (or (forall ((v_arrayElimCell_58 (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32)) (v_ArrVal_186 (_ BitVec 32))) (let ((.cse470 (concat v_arrayElimCell_55 v_arrayElimCell_58))) (let ((.cse468 (let ((.cse471 (bvadd .cse470 .cse7))) (concat ((_ extract 63 32) .cse471) ((_ extract 31 0) .cse471))))) (or (not (= (concat v_ArrVal_186 ((_ extract 31 0) (bvadd .cse468 .cse5))) .cse3)) (= (let ((.cse469 (bvadd .cse468 .cse470))) (concat ((_ extract 63 32) .cse469) ((_ extract 31 0) .cse469))) .cse3))))) .cse17)))) .cse4) (= (select .cse0 (_ bv0 32)) ((_ extract 31 0) (_ bv0 64))))))) is different from true [2023-11-29 00:52:05,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:52:05,886 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2023-11-29 00:52:05,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-29 00:52:05,888 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.3125) internal successors, (42), 32 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 22 [2023-11-29 00:52:05,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:52:05,890 INFO L225 Difference]: With dead ends: 62 [2023-11-29 00:52:05,890 INFO L226 Difference]: Without dead ends: 46 [2023-11-29 00:52:05,892 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 394 ImplicationChecksByTransitivity, 25.1s TimeCoverageRelationStatistics Valid=277, Invalid=1535, Unknown=2, NotChecked=166, Total=1980 [2023-11-29 00:52:05,892 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 38 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 61 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2023-11-29 00:52:05,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 65 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 362 Invalid, 0 Unknown, 61 Unchecked, 4.8s Time] [2023-11-29 00:52:05,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-11-29 00:52:05,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2023-11-29 00:52:05,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.2) internal successors, (54), 45 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:52:05,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2023-11-29 00:52:05,928 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 22 [2023-11-29 00:52:05,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:52:05,928 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2023-11-29 00:52:05,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.3125) internal successors, (42), 32 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) [2023-11-29 00:52:05,928 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2023-11-29 00:52:05,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-29 00:52:05,929 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:52:05,929 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:52:05,933 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2023-11-29 00:52:06,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:52:06,130 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:52:06,130 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:52:06,130 INFO L85 PathProgramCache]: Analyzing trace with hash 350502234, now seen corresponding path program 6 times [2023-11-29 00:52:06,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:52:06,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [461082012] [2023-11-29 00:52:06,131 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-29 00:52:06,131 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:52:06,131 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:52:06,132 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:52:06,134 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-11-29 00:52:06,302 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-11-29 00:52:06,302 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:52:06,310 INFO L262 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 52 conjunts are in the unsatisfiable core [2023-11-29 00:52:06,315 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:52:06,448 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 00:52:06,449 INFO L378 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 18 treesize of output 19 [2023-11-29 00:52:06,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:52:06,573 INFO L378 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 18 treesize of output 19 [2023-11-29 00:52:06,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:52:06,738 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:52:06,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 45 [2023-11-29 00:52:06,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:52:06,994 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:52:06,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 59 treesize of output 71 [2023-11-29 00:52:07,964 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:52:07,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 59 [2023-11-29 00:52:08,394 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:52:08,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 129 treesize of output 99 [2023-11-29 00:52:08,737 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:52:08,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 205 treesize of output 175 [2023-11-29 00:52:09,791 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:52:09,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 353 treesize of output 323 [2023-11-29 00:52:09,807 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:52:09,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 641 treesize of output 319 [2023-11-29 00:52:10,218 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:52:10,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 489 treesize of output 339 [2023-11-29 00:52:10,510 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:52:10,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 389 treesize of output 329 [2023-11-29 00:52:11,034 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:52:11,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 365 treesize of output 335 [2023-11-29 00:52:11,158 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:52:11,159 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:52:29,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3882 treesize of output 3762 [2023-11-29 00:52:37,585 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:52:37,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [461082012] [2023-11-29 00:52:37,586 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-11-29 00:52:37,590 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2023-11-29 00:52:37,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:52:37,787 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 138663 column 7: canceled at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:192) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:122) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:543) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:522) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:515) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyEliminationToAtom(QuantifierPusher.java:291) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:341) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 138663 column 7: canceled at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1511) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.push(UndoableWrapperScript.java:54) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:620) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:120) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:370) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:649) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:180) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:230) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:324) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:346) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:227) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) ... 54 more [2023-11-29 00:52:37,791 INFO L158 Benchmark]: Toolchain (without parser) took 146544.43ms. Allocated memory was 86.0MB in the beginning and 499.1MB in the end (delta: 413.1MB). Free memory was 65.3MB in the beginning and 283.7MB in the end (delta: -218.4MB). Peak memory consumption was 451.9MB. Max. memory is 16.1GB. [2023-11-29 00:52:37,791 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 60.8MB. Free memory is still 37.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 00:52:37,791 INFO L158 Benchmark]: CACSL2BoogieTranslator took 270.10ms. Allocated memory is still 86.0MB. Free memory was 65.1MB in the beginning and 53.5MB in the end (delta: 11.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-29 00:52:37,792 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.92ms. Allocated memory is still 86.0MB. Free memory was 53.2MB in the beginning and 51.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 00:52:37,792 INFO L158 Benchmark]: Boogie Preprocessor took 51.11ms. Allocated memory is still 86.0MB. Free memory was 51.6MB in the beginning and 49.3MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 00:52:37,792 INFO L158 Benchmark]: RCFGBuilder took 410.71ms. Allocated memory is still 86.0MB. Free memory was 49.3MB in the beginning and 52.5MB in the end (delta: -3.2MB). Peak memory consumption was 5.8MB. Max. memory is 16.1GB. [2023-11-29 00:52:37,793 INFO L158 Benchmark]: TraceAbstraction took 145763.83ms. Allocated memory was 86.0MB in the beginning and 499.1MB in the end (delta: 413.1MB). Free memory was 51.7MB in the beginning and 283.7MB in the end (delta: -232.0MB). Peak memory consumption was 437.8MB. Max. memory is 16.1GB. [2023-11-29 00:52:37,794 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 60.8MB. Free memory is still 37.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 270.10ms. Allocated memory is still 86.0MB. Free memory was 65.1MB in the beginning and 53.5MB in the end (delta: 11.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.92ms. Allocated memory is still 86.0MB. Free memory was 53.2MB in the beginning and 51.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.11ms. Allocated memory is still 86.0MB. Free memory was 51.6MB in the beginning and 49.3MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 410.71ms. Allocated memory is still 86.0MB. Free memory was 49.3MB in the beginning and 52.5MB in the end (delta: -3.2MB). Peak memory consumption was 5.8MB. Max. memory is 16.1GB. * TraceAbstraction took 145763.83ms. Allocated memory was 86.0MB in the beginning and 499.1MB in the end (delta: 413.1MB). Free memory was 51.7MB in the beginning and 283.7MB in the end (delta: -232.0MB). Peak memory consumption was 437.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 138663 column 7: canceled de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 138663 column 7: canceled: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:192) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2023-11-29 00:52:38,003 WARN L435 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2023-11-29 00:52:38,020 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16138067-b194-4902-9c67-ea14b1029cf2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 1 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 138663 column 7: canceled