./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/parallel-misc-1.wvr.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_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/config/TaipanReach.xml -i ../../sv-benchmarks/c/weaver/parallel-misc-1.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash faddac23864cc4e42f962ac43a8d0f59593853dbb1d55e3baabe0c76b2187dd4 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 17:30:53,485 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 17:30:53,548 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-12-02 17:30:53,552 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 17:30:53,552 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 17:30:53,575 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 17:30:53,576 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 17:30:53,576 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 17:30:53,577 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 17:30:53,578 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 17:30:53,578 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 17:30:53,579 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 17:30:53,579 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 17:30:53,580 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 17:30:53,580 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 17:30:53,581 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 17:30:53,582 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 17:30:53,582 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 17:30:53,583 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 17:30:53,583 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 17:30:53,584 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 17:30:53,584 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 17:30:53,585 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 17:30:53,586 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 17:30:53,586 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 17:30:53,587 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 17:30:53,587 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 17:30:53,587 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 17:30:53,588 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 17:30:53,588 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 17:30:53,589 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 17:30:53,589 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 17:30:53,589 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 17:30:53,589 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 17:30:53,590 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 17:30:53,590 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 17:30:53,590 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 17:30:53,590 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 17:30:53,591 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 17:30:53,591 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 17:30:53,591 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 17:30:53,591 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 17:30:53,591 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 17:30:53,592 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 17:30:53,592 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 17:30:53,592 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 17:30:53,592 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 17:30:53,592 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/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_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh 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 -> Taipan 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 -> faddac23864cc4e42f962ac43a8d0f59593853dbb1d55e3baabe0c76b2187dd4 [2023-12-02 17:30:53,810 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 17:30:53,832 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 17:30:53,835 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 17:30:53,836 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 17:30:53,837 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 17:30:53,838 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/weaver/parallel-misc-1.wvr.c [2023-12-02 17:30:56,696 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 17:30:56,883 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 17:30:56,884 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/sv-benchmarks/c/weaver/parallel-misc-1.wvr.c [2023-12-02 17:30:56,891 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/data/9d1f9b5f7/5288143798ad4017a4a7b6320c78a9f6/FLAGaac57e6ab [2023-12-02 17:30:56,904 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/data/9d1f9b5f7/5288143798ad4017a4a7b6320c78a9f6 [2023-12-02 17:30:56,906 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 17:30:56,907 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 17:30:56,908 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 17:30:56,909 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 17:30:56,914 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 17:30:56,915 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:30:56" (1/1) ... [2023-12-02 17:30:56,916 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43045098 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:30:56, skipping insertion in model container [2023-12-02 17:30:56,916 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:30:56" (1/1) ... [2023-12-02 17:30:56,943 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 17:30:57,119 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_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/sv-benchmarks/c/weaver/parallel-misc-1.wvr.c[2781,2794] [2023-12-02 17:30:57,132 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 17:30:57,142 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 17:30:57,166 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_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/sv-benchmarks/c/weaver/parallel-misc-1.wvr.c[2781,2794] [2023-12-02 17:30:57,171 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 17:30:57,185 INFO L206 MainTranslator]: Completed translation [2023-12-02 17:30:57,186 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:30:57 WrapperNode [2023-12-02 17:30:57,186 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 17:30:57,187 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 17:30:57,187 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 17:30:57,187 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 17:30:57,195 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:30:57" (1/1) ... [2023-12-02 17:30:57,204 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:30:57" (1/1) ... [2023-12-02 17:30:57,238 INFO L138 Inliner]: procedures = 23, calls = 41, calls flagged for inlining = 17, calls inlined = 31, statements flattened = 289 [2023-12-02 17:30:57,238 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 17:30:57,239 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 17:30:57,239 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 17:30:57,239 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 17:30:57,249 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:30:57" (1/1) ... [2023-12-02 17:30:57,249 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:30:57" (1/1) ... [2023-12-02 17:30:57,254 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:30:57" (1/1) ... [2023-12-02 17:30:57,255 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:30:57" (1/1) ... [2023-12-02 17:30:57,266 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:30:57" (1/1) ... [2023-12-02 17:30:57,271 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:30:57" (1/1) ... [2023-12-02 17:30:57,274 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:30:57" (1/1) ... [2023-12-02 17:30:57,276 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:30:57" (1/1) ... [2023-12-02 17:30:57,281 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 17:30:57,282 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 17:30:57,282 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 17:30:57,282 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 17:30:57,283 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:30:57" (1/1) ... [2023-12-02 17:30:57,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 17:30:57,306 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:30:57,323 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 17:30:57,325 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 17:30:57,354 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 17:30:57,354 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-12-02 17:30:57,355 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-12-02 17:30:57,355 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-12-02 17:30:57,355 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-12-02 17:30:57,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 17:30:57,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-02 17:30:57,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-02 17:30:57,356 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-02 17:30:57,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 17:30:57,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 17:30:57,356 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-02 17:30:57,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 17:30:57,358 WARN L213 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-12-02 17:30:57,458 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 17:30:57,460 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 17:30:57,862 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 17:30:58,334 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 17:30:58,335 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-12-02 17:30:58,335 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:30:58 BoogieIcfgContainer [2023-12-02 17:30:58,335 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 17:30:58,338 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 17:30:58,339 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 17:30:58,342 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 17:30:58,343 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 05:30:56" (1/3) ... [2023-12-02 17:30:58,343 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11a697f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 05:30:58, skipping insertion in model container [2023-12-02 17:30:58,344 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:30:57" (2/3) ... [2023-12-02 17:30:58,344 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11a697f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 05:30:58, skipping insertion in model container [2023-12-02 17:30:58,344 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:30:58" (3/3) ... [2023-12-02 17:30:58,346 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-misc-1.wvr.c [2023-12-02 17:30:58,356 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-12-02 17:30:58,367 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 17:30:58,367 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-02 17:30:58,367 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-02 17:30:58,415 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-12-02 17:30:58,445 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 25 places, 21 transitions, 56 flow [2023-12-02 17:30:58,461 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 36 states, 35 states have (on average 2.1714285714285713) internal successors, (76), 35 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-12-02 17:30:58,479 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 17:30:58,486 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=FINITE_AUTOMATA, 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;@6af067d8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 17:30:58,486 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-02 17:30:58,488 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 35 states have (on average 2.1714285714285713) internal successors, (76), 35 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-12-02 17:30:58,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-02 17:30:58,495 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:30:58,496 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:30:58,496 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-02 17:30:58,502 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:30:58,502 INFO L85 PathProgramCache]: Analyzing trace with hash -990800054, now seen corresponding path program 1 times [2023-12-02 17:30:58,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:30:58,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571339686] [2023-12-02 17:30:58,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:30:58,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:30:58,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:30:58,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:30:58,999 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:30:59,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571339686] [2023-12-02 17:30:59,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571339686] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:30:59,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:30:59,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 17:30:59,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404363395] [2023-12-02 17:30:59,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:30:59,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 17:30:59,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:30:59,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 17:30:59,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 17:30:59,043 INFO L87 Difference]: Start difference. First operand has 36 states, 35 states have (on average 2.1714285714285713) internal successors, (76), 35 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) Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 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-12-02 17:30:59,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:30:59,201 INFO L93 Difference]: Finished difference Result 79 states and 191 transitions. [2023-12-02 17:30:59,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 17:30:59,203 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-12-02 17:30:59,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:30:59,212 INFO L225 Difference]: With dead ends: 79 [2023-12-02 17:30:59,212 INFO L226 Difference]: Without dead ends: 74 [2023-12-02 17:30:59,213 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-02 17:30:59,217 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 24 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 17:30:59,218 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 12 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 17:30:59,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2023-12-02 17:30:59,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 58. [2023-12-02 17:30:59,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 2.2280701754385963) internal successors, (127), 57 states have internal predecessors, (127), 0 states have call successors, (0), 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-12-02 17:30:59,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 127 transitions. [2023-12-02 17:30:59,254 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 127 transitions. Word has length 15 [2023-12-02 17:30:59,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:30:59,254 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 127 transitions. [2023-12-02 17:30:59,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 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-12-02 17:30:59,255 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 127 transitions. [2023-12-02 17:30:59,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-12-02 17:30:59,256 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:30:59,256 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:30:59,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-02 17:30:59,257 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-02 17:30:59,258 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:30:59,258 INFO L85 PathProgramCache]: Analyzing trace with hash -779775699, now seen corresponding path program 1 times [2023-12-02 17:30:59,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:30:59,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114613711] [2023-12-02 17:30:59,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:30:59,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:30:59,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:30:59,449 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:30:59,449 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:30:59,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114613711] [2023-12-02 17:30:59,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114613711] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:30:59,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:30:59,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 17:30:59,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858735339] [2023-12-02 17:30:59,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:30:59,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 17:30:59,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:30:59,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 17:30:59,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 17:30:59,453 INFO L87 Difference]: Start difference. First operand 58 states and 127 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:30:59,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:30:59,524 INFO L93 Difference]: Finished difference Result 98 states and 212 transitions. [2023-12-02 17:30:59,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 17:30:59,525 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-12-02 17:30:59,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:30:59,527 INFO L225 Difference]: With dead ends: 98 [2023-12-02 17:30:59,527 INFO L226 Difference]: Without dead ends: 88 [2023-12-02 17:30:59,527 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 17:30:59,529 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 8 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 17:30:59,530 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 8 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 17:30:59,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-12-02 17:30:59,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2023-12-02 17:30:59,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 87 states have (on average 2.2298850574712645) internal successors, (194), 87 states have internal predecessors, (194), 0 states have call successors, (0), 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-12-02 17:30:59,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 194 transitions. [2023-12-02 17:30:59,545 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 194 transitions. Word has length 16 [2023-12-02 17:30:59,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:30:59,546 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 194 transitions. [2023-12-02 17:30:59,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:30:59,546 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 194 transitions. [2023-12-02 17:30:59,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-12-02 17:30:59,548 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:30:59,548 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:30:59,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-02 17:30:59,548 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-02 17:30:59,549 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:30:59,549 INFO L85 PathProgramCache]: Analyzing trace with hash 771817338, now seen corresponding path program 1 times [2023-12-02 17:30:59,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:30:59,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254209989] [2023-12-02 17:30:59,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:30:59,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:30:59,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:30:59,684 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:30:59,684 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:30:59,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254209989] [2023-12-02 17:30:59,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254209989] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:30:59,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:30:59,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 17:30:59,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873235025] [2023-12-02 17:30:59,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:30:59,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 17:30:59,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:30:59,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 17:30:59,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 17:30:59,687 INFO L87 Difference]: Start difference. First operand 88 states and 194 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:30:59,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:30:59,744 INFO L93 Difference]: Finished difference Result 76 states and 156 transitions. [2023-12-02 17:30:59,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 17:30:59,744 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-12-02 17:30:59,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:30:59,746 INFO L225 Difference]: With dead ends: 76 [2023-12-02 17:30:59,746 INFO L226 Difference]: Without dead ends: 59 [2023-12-02 17:30:59,746 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 17:30:59,748 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 10 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 17:30:59,749 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 8 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 17:30:59,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-12-02 17:30:59,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2023-12-02 17:30:59,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 2.206896551724138) internal successors, (128), 58 states have internal predecessors, (128), 0 states have call successors, (0), 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-12-02 17:30:59,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 128 transitions. [2023-12-02 17:30:59,757 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 128 transitions. Word has length 16 [2023-12-02 17:30:59,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:30:59,757 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 128 transitions. [2023-12-02 17:30:59,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:30:59,758 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 128 transitions. [2023-12-02 17:30:59,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-02 17:30:59,759 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:30:59,759 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:30:59,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-02 17:30:59,759 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-02 17:30:59,760 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:30:59,760 INFO L85 PathProgramCache]: Analyzing trace with hash -311395640, now seen corresponding path program 1 times [2023-12-02 17:30:59,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:30:59,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192474295] [2023-12-02 17:30:59,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:30:59,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:30:59,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:30:59,900 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 17:30:59,901 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:30:59,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192474295] [2023-12-02 17:30:59,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192474295] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:30:59,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [97958290] [2023-12-02 17:30:59,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:30:59,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:30:59,902 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:30:59,904 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:30:59,907 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-02 17:31:00,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:31:00,030 INFO L262 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 17:31:00,035 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:31:00,122 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 17:31:00,123 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:31:00,205 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 17:31:00,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [97958290] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-02 17:31:00,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-02 17:31:00,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2023-12-02 17:31:00,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404695410] [2023-12-02 17:31:00,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:31:00,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 17:31:00,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:31:00,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 17:31:00,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-12-02 17:31:00,208 INFO L87 Difference]: Start difference. First operand 59 states and 128 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:31:00,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:31:00,267 INFO L93 Difference]: Finished difference Result 53 states and 116 transitions. [2023-12-02 17:31:00,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 17:31:00,268 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-12-02 17:31:00,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:31:00,269 INFO L225 Difference]: With dead ends: 53 [2023-12-02 17:31:00,269 INFO L226 Difference]: Without dead ends: 53 [2023-12-02 17:31:00,269 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-12-02 17:31:00,271 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 51 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 17:31:00,271 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 5 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 17:31:00,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-12-02 17:31:00,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 45. [2023-12-02 17:31:00,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 2.1818181818181817) internal successors, (96), 44 states have internal predecessors, (96), 0 states have call successors, (0), 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-12-02 17:31:00,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 96 transitions. [2023-12-02 17:31:00,278 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 96 transitions. Word has length 17 [2023-12-02 17:31:00,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:31:00,279 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 96 transitions. [2023-12-02 17:31:00,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:31:00,279 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 96 transitions. [2023-12-02 17:31:00,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-02 17:31:00,280 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:31:00,280 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:31:00,291 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-02 17:31:00,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:31:00,482 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-02 17:31:00,483 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:31:00,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1240197397, now seen corresponding path program 1 times [2023-12-02 17:31:00,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:31:00,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906163266] [2023-12-02 17:31:00,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:31:00,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:31:00,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:31:00,645 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 17:31:00,646 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:31:00,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906163266] [2023-12-02 17:31:00,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906163266] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:31:00,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1822690164] [2023-12-02 17:31:00,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:31:00,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:31:00,647 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:31:00,648 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:31:00,658 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-02 17:31:00,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:31:00,778 INFO L262 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 17:31:00,780 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:31:00,859 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 17:31:00,859 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:31:00,922 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 17:31:00,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1822690164] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-02 17:31:00,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-02 17:31:00,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2023-12-02 17:31:00,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862398964] [2023-12-02 17:31:00,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:31:00,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 17:31:00,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:31:00,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 17:31:00,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-12-02 17:31:00,925 INFO L87 Difference]: Start difference. First operand 45 states and 96 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:31:00,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:31:00,996 INFO L93 Difference]: Finished difference Result 55 states and 120 transitions. [2023-12-02 17:31:00,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 17:31:00,998 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-12-02 17:31:00,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:31:00,999 INFO L225 Difference]: With dead ends: 55 [2023-12-02 17:31:00,999 INFO L226 Difference]: Without dead ends: 55 [2023-12-02 17:31:00,999 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-12-02 17:31:01,000 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 49 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 17:31:01,001 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 5 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 17:31:01,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-12-02 17:31:01,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2023-12-02 17:31:01,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 2.2222222222222223) internal successors, (120), 54 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:31:01,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 120 transitions. [2023-12-02 17:31:01,008 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 120 transitions. Word has length 17 [2023-12-02 17:31:01,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:31:01,008 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 120 transitions. [2023-12-02 17:31:01,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:31:01,008 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 120 transitions. [2023-12-02 17:31:01,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-02 17:31:01,009 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:31:01,009 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:31:01,016 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-02 17:31:01,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:31:01,214 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-02 17:31:01,214 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:31:01,214 INFO L85 PathProgramCache]: Analyzing trace with hash -338331454, now seen corresponding path program 1 times [2023-12-02 17:31:01,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:31:01,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246195886] [2023-12-02 17:31:01,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:31:01,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:31:01,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:31:02,475 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:31:02,475 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:31:02,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246195886] [2023-12-02 17:31:02,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246195886] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:31:02,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [630731015] [2023-12-02 17:31:02,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:31:02,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:31:02,476 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:31:02,477 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:31:02,490 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-02 17:31:02,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:31:02,594 INFO L262 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-02 17:31:02,597 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:31:02,878 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 87 treesize of output 59 [2023-12-02 17:31:02,928 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 17:31:02,928 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:31:03,288 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:31:03,289 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 233 treesize of output 145 [2023-12-02 17:31:03,681 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 17:31:03,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [630731015] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:31:03,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1953363948] [2023-12-02 17:31:03,688 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) 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.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) 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) [2023-12-02 17:31:03,690 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:31:03,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 17 [2023-12-02 17:31:03,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590213239] [2023-12-02 17:31:03,691 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:31:03,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-02 17:31:03,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:31:03,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-02 17:31:03,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2023-12-02 17:31:03,692 INFO L87 Difference]: Start difference. First operand 55 states and 120 transitions. Second operand has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 17 states have internal predecessors, (41), 0 states have call successors, (0), 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-12-02 17:31:03,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:31:03,953 INFO L93 Difference]: Finished difference Result 92 states and 213 transitions. [2023-12-02 17:31:03,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-02 17:31:03,954 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 17 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-12-02 17:31:03,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:31:03,955 INFO L225 Difference]: With dead ends: 92 [2023-12-02 17:31:03,955 INFO L226 Difference]: Without dead ends: 87 [2023-12-02 17:31:03,955 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2023-12-02 17:31:03,956 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 49 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 17:31:03,957 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 47 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 17:31:03,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-12-02 17:31:03,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 69. [2023-12-02 17:31:03,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 68 states have (on average 2.235294117647059) internal successors, (152), 68 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:31:03,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 152 transitions. [2023-12-02 17:31:03,964 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 152 transitions. Word has length 18 [2023-12-02 17:31:03,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:31:03,965 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 152 transitions. [2023-12-02 17:31:03,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 17 states have internal predecessors, (41), 0 states have call successors, (0), 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-12-02 17:31:03,965 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 152 transitions. [2023-12-02 17:31:03,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-02 17:31:03,966 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:31:03,966 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:31:03,973 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-12-02 17:31:04,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-12-02 17:31:04,170 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-02 17:31:04,170 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:31:04,171 INFO L85 PathProgramCache]: Analyzing trace with hash 554700626, now seen corresponding path program 2 times [2023-12-02 17:31:04,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:31:04,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772639373] [2023-12-02 17:31:04,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:31:04,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:31:04,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:31:05,154 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:31:05,154 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:31:05,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772639373] [2023-12-02 17:31:05,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772639373] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:31:05,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257189205] [2023-12-02 17:31:05,155 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 17:31:05,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:31:05,155 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:31:05,156 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:31:05,159 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-02 17:31:05,271 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-02 17:31:05,271 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 17:31:05,273 INFO L262 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-02 17:31:05,277 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:31:05,596 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 87 treesize of output 59 [2023-12-02 17:31:05,659 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:31:05,659 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:31:06,067 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:31:06,067 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 233 treesize of output 145 [2023-12-02 17:31:06,460 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 17:31:06,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1257189205] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:31:06,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [394252556] [2023-12-02 17:31:06,461 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) 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.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) 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) [2023-12-02 17:31:06,461 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:31:06,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 19 [2023-12-02 17:31:06,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046467668] [2023-12-02 17:31:06,462 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:31:06,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-02 17:31:06,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:31:06,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-02 17:31:06,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2023-12-02 17:31:06,463 INFO L87 Difference]: Start difference. First operand 69 states and 152 transitions. Second operand has 19 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 19 states have internal predecessors, (41), 0 states have call successors, (0), 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-12-02 17:31:06,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:31:06,831 INFO L93 Difference]: Finished difference Result 97 states and 235 transitions. [2023-12-02 17:31:06,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-02 17:31:06,832 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 19 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-12-02 17:31:06,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:31:06,833 INFO L225 Difference]: With dead ends: 97 [2023-12-02 17:31:06,833 INFO L226 Difference]: Without dead ends: 92 [2023-12-02 17:31:06,833 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=88, Invalid=464, Unknown=0, NotChecked=0, Total=552 [2023-12-02 17:31:06,834 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 36 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 17:31:06,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 52 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 17:31:06,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-12-02 17:31:06,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 71. [2023-12-02 17:31:06,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 70 states have (on average 2.3) internal successors, (161), 70 states have internal predecessors, (161), 0 states have call successors, (0), 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-12-02 17:31:06,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 161 transitions. [2023-12-02 17:31:06,842 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 161 transitions. Word has length 18 [2023-12-02 17:31:06,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:31:06,843 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 161 transitions. [2023-12-02 17:31:06,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 19 states have internal predecessors, (41), 0 states have call successors, (0), 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-12-02 17:31:06,844 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 161 transitions. [2023-12-02 17:31:06,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-02 17:31:06,845 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:31:06,845 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:31:06,851 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-02 17:31:07,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-12-02 17:31:07,051 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-02 17:31:07,052 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:31:07,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1174346708, now seen corresponding path program 3 times [2023-12-02 17:31:07,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:31:07,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271325674] [2023-12-02 17:31:07,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:31:07,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:31:07,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:31:08,090 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:31:08,090 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:31:08,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271325674] [2023-12-02 17:31:08,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271325674] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:31:08,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [262279248] [2023-12-02 17:31:08,091 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-02 17:31:08,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:31:08,091 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:31:08,092 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:31:08,094 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-02 17:31:08,196 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-02 17:31:08,196 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 17:31:08,198 INFO L262 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 33 conjunts are in the unsatisfiable core [2023-12-02 17:31:08,201 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:31:08,476 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 87 treesize of output 59 [2023-12-02 17:31:08,546 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:31:08,546 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:31:08,926 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 17:31:08,926 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 233 treesize of output 141 [2023-12-02 17:31:09,281 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 17:31:09,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [262279248] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:31:09,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1640493775] [2023-12-02 17:31:09,282 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) 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.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) 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) [2023-12-02 17:31:09,282 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:31:09,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 18 [2023-12-02 17:31:09,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525685821] [2023-12-02 17:31:09,283 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:31:09,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-02 17:31:09,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:31:09,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-02 17:31:09,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2023-12-02 17:31:09,284 INFO L87 Difference]: Start difference. First operand 71 states and 161 transitions. Second operand has 18 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 18 states have internal predecessors, (41), 0 states have call successors, (0), 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-12-02 17:31:10,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:31:10,773 INFO L93 Difference]: Finished difference Result 290 states and 704 transitions. [2023-12-02 17:31:10,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-12-02 17:31:10,774 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 18 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-12-02 17:31:10,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:31:10,776 INFO L225 Difference]: With dead ends: 290 [2023-12-02 17:31:10,777 INFO L226 Difference]: Without dead ends: 280 [2023-12-02 17:31:10,777 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 422 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=370, Invalid=1352, Unknown=0, NotChecked=0, Total=1722 [2023-12-02 17:31:10,778 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 203 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-02 17:31:10,778 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 67 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-02 17:31:10,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2023-12-02 17:31:10,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 133. [2023-12-02 17:31:10,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 2.787878787878788) internal successors, (368), 132 states have internal predecessors, (368), 0 states have call successors, (0), 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-12-02 17:31:10,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 368 transitions. [2023-12-02 17:31:10,792 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 368 transitions. Word has length 18 [2023-12-02 17:31:10,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:31:10,792 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 368 transitions. [2023-12-02 17:31:10,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 18 states have internal predecessors, (41), 0 states have call successors, (0), 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-12-02 17:31:10,793 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 368 transitions. [2023-12-02 17:31:10,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-02 17:31:10,794 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:31:10,794 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:31:10,800 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-12-02 17:31:10,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-12-02 17:31:10,998 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-02 17:31:10,998 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:31:10,999 INFO L85 PathProgramCache]: Analyzing trace with hash 532354148, now seen corresponding path program 4 times [2023-12-02 17:31:10,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:31:10,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328374776] [2023-12-02 17:31:10,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:31:10,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:31:11,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:31:12,219 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:31:12,219 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:31:12,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328374776] [2023-12-02 17:31:12,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328374776] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:31:12,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2110556380] [2023-12-02 17:31:12,220 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-02 17:31:12,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:31:12,220 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:31:12,221 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:31:12,224 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-02 17:31:12,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:31:12,340 INFO L262 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-02 17:31:12,343 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:31:12,560 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 77 treesize of output 49 [2023-12-02 17:31:12,615 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 17:31:12,615 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:31:12,822 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:31:12,822 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 214 treesize of output 142 [2023-12-02 17:31:13,122 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 17:31:13,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2110556380] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:31:13,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [664672078] [2023-12-02 17:31:13,123 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) 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.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) 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) [2023-12-02 17:31:13,123 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:31:13,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 17 [2023-12-02 17:31:13,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471527492] [2023-12-02 17:31:13,124 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:31:13,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-02 17:31:13,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:31:13,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-02 17:31:13,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2023-12-02 17:31:13,125 INFO L87 Difference]: Start difference. First operand 133 states and 368 transitions. Second operand has 17 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 17 states have internal predecessors, (40), 0 states have call successors, (0), 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-12-02 17:31:13,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:31:13,294 INFO L93 Difference]: Finished difference Result 167 states and 479 transitions. [2023-12-02 17:31:13,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-02 17:31:13,295 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 17 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-12-02 17:31:13,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:31:13,296 INFO L225 Difference]: With dead ends: 167 [2023-12-02 17:31:13,296 INFO L226 Difference]: Without dead ends: 162 [2023-12-02 17:31:13,296 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2023-12-02 17:31:13,297 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 25 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 17:31:13,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 29 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 17:31:13,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2023-12-02 17:31:13,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 141. [2023-12-02 17:31:13,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 140 states have (on average 2.857142857142857) internal successors, (400), 140 states have internal predecessors, (400), 0 states have call successors, (0), 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-12-02 17:31:13,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 400 transitions. [2023-12-02 17:31:13,310 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 400 transitions. Word has length 18 [2023-12-02 17:31:13,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:31:13,310 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 400 transitions. [2023-12-02 17:31:13,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 17 states have internal predecessors, (40), 0 states have call successors, (0), 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-12-02 17:31:13,310 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 400 transitions. [2023-12-02 17:31:13,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-02 17:31:13,311 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:31:13,311 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:31:13,316 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-12-02 17:31:13,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:31:13,512 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-02 17:31:13,513 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:31:13,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1196693186, now seen corresponding path program 5 times [2023-12-02 17:31:13,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:31:13,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761334237] [2023-12-02 17:31:13,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:31:13,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:31:13,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:31:14,289 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:31:14,290 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:31:14,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761334237] [2023-12-02 17:31:14,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761334237] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:31:14,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [487877148] [2023-12-02 17:31:14,290 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 17:31:14,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:31:14,290 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:31:14,291 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:31:14,292 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-02 17:31:14,370 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-02 17:31:14,370 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 17:31:14,372 INFO L262 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 29 conjunts are in the unsatisfiable core [2023-12-02 17:31:14,375 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:31:14,404 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 1 [2023-12-02 17:31:14,444 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 8 treesize of output 1 [2023-12-02 17:31:14,498 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 8 treesize of output 1 [2023-12-02 17:31:14,613 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 77 treesize of output 49 [2023-12-02 17:31:14,671 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:31:14,671 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:31:15,475 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_~A~0.offset (* c_~j~0 4))) (.cse4 (+ c_~A~0.offset (* c_~i~0 4))) (.cse5 (< 2147483647 (+ c_~bag1~0 c_~sum1~0))) (.cse8 (< (+ c_~bag1~0 c_~sum1~0 2147483648) 0))) (and (forall ((v_ArrVal_202 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_202) c_~A~0.base))) (let ((.cse0 (select .cse2 .cse4)) (.cse1 (select .cse2 .cse3))) (or (< (+ c_~bag1~0 2147483648 .cse0) 0) (< (+ c_~bag2~0 .cse1 2147483648) 0) (= (+ c_~bag2~0 .cse1 c_~sum2~0) (+ c_~bag1~0 c_~sum1~0 .cse0)) (< 2147483647 (+ c_~bag1~0 .cse0)) (< 2147483647 (+ c_~bag2~0 .cse1)))))) (or .cse5 (forall ((v_ArrVal_202 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_202) c_~A~0.base))) (let ((.cse6 (select .cse7 .cse3))) (or (< (+ c_~bag2~0 .cse6 2147483648) 0) (= (+ c_~bag2~0 .cse6 c_~sum2~0) (+ c_~bag1~0 c_~sum1~0 (select .cse7 .cse4))) (< 2147483647 (+ c_~bag2~0 .cse6)))))) .cse8) (or (< (+ c_~bag2~0 c_~sum2~0 2147483648) 0) (and (forall ((v_ArrVal_202 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_202) c_~A~0.base))) (let ((.cse9 (select .cse10 .cse4))) (or (< (+ c_~bag1~0 2147483648 .cse9) 0) (= (+ c_~bag2~0 (select .cse10 .cse3) c_~sum2~0) (+ c_~bag1~0 c_~sum1~0 .cse9)) (< 2147483647 (+ c_~bag1~0 .cse9)))))) (or (forall ((v_ArrVal_202 (Array Int Int))) (let ((.cse11 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_202) c_~A~0.base))) (= (+ c_~bag2~0 (select .cse11 .cse3) c_~sum2~0) (+ c_~bag1~0 c_~sum1~0 (select .cse11 .cse4))))) .cse5 .cse8)) (< 2147483647 (+ c_~bag2~0 c_~sum2~0))))) is different from false [2023-12-02 17:31:15,603 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 17:31:15,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [487877148] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:31:15,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [612064437] [2023-12-02 17:31:15,604 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) 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.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) 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) [2023-12-02 17:31:15,605 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:31:15,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 19 [2023-12-02 17:31:15,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831530126] [2023-12-02 17:31:15,606 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:31:15,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-02 17:31:15,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:31:15,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-02 17:31:15,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=252, Unknown=1, NotChecked=32, Total=342 [2023-12-02 17:31:15,608 INFO L87 Difference]: Start difference. First operand 141 states and 400 transitions. Second operand has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 19 states have internal predecessors, (40), 0 states have call successors, (0), 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-12-02 17:31:16,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:31:16,009 INFO L93 Difference]: Finished difference Result 159 states and 446 transitions. [2023-12-02 17:31:16,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 17:31:16,010 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 19 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-12-02 17:31:16,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:31:16,011 INFO L225 Difference]: With dead ends: 159 [2023-12-02 17:31:16,012 INFO L226 Difference]: Without dead ends: 154 [2023-12-02 17:31:16,012 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=85, Invalid=380, Unknown=1, NotChecked=40, Total=506 [2023-12-02 17:31:16,013 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 27 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 57 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 17:31:16,013 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 49 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 296 Invalid, 0 Unknown, 57 Unchecked, 0.2s Time] [2023-12-02 17:31:16,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2023-12-02 17:31:16,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 139. [2023-12-02 17:31:16,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 138 states have (on average 2.8333333333333335) internal successors, (391), 138 states have internal predecessors, (391), 0 states have call successors, (0), 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-12-02 17:31:16,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 391 transitions. [2023-12-02 17:31:16,022 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 391 transitions. Word has length 18 [2023-12-02 17:31:16,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:31:16,022 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 391 transitions. [2023-12-02 17:31:16,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 19 states have internal predecessors, (40), 0 states have call successors, (0), 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-12-02 17:31:16,023 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 391 transitions. [2023-12-02 17:31:16,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-02 17:31:16,024 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:31:16,024 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:31:16,029 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-12-02 17:31:16,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-12-02 17:31:16,226 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-02 17:31:16,226 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:31:16,226 INFO L85 PathProgramCache]: Analyzing trace with hash 292711810, now seen corresponding path program 6 times [2023-12-02 17:31:16,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:31:16,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084343482] [2023-12-02 17:31:16,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:31:16,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:31:16,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:31:17,060 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:31:17,060 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:31:17,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084343482] [2023-12-02 17:31:17,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084343482] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:31:17,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [11873009] [2023-12-02 17:31:17,060 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-02 17:31:17,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:31:17,061 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:31:17,062 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:31:17,064 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-02 17:31:17,179 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-02 17:31:17,179 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 17:31:17,181 INFO L262 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 33 conjunts are in the unsatisfiable core [2023-12-02 17:31:17,185 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:31:17,477 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 77 treesize of output 49 [2023-12-02 17:31:17,529 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:31:17,529 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:31:17,903 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 17:31:17,904 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 214 treesize of output 138 [2023-12-02 17:31:18,291 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 17:31:18,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [11873009] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:31:18,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [639747611] [2023-12-02 17:31:18,292 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) 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.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) 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) [2023-12-02 17:31:18,293 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:31:18,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 20 [2023-12-02 17:31:18,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494578557] [2023-12-02 17:31:18,293 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:31:18,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-02 17:31:18,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:31:18,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-02 17:31:18,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2023-12-02 17:31:18,294 INFO L87 Difference]: Start difference. First operand 139 states and 391 transitions. Second operand has 20 states, 20 states have (on average 2.1) internal successors, (42), 20 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-12-02 17:31:19,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:31:19,190 INFO L93 Difference]: Finished difference Result 263 states and 667 transitions. [2023-12-02 17:31:19,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-02 17:31:19,191 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.1) internal successors, (42), 20 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 18 [2023-12-02 17:31:19,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:31:19,193 INFO L225 Difference]: With dead ends: 263 [2023-12-02 17:31:19,193 INFO L226 Difference]: Without dead ends: 258 [2023-12-02 17:31:19,193 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=154, Invalid=716, Unknown=0, NotChecked=0, Total=870 [2023-12-02 17:31:19,194 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 96 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 17:31:19,194 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 81 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 17:31:19,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2023-12-02 17:31:19,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 164. [2023-12-02 17:31:19,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 163 states have (on average 2.8588957055214723) internal successors, (466), 163 states have internal predecessors, (466), 0 states have call successors, (0), 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-12-02 17:31:19,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 466 transitions. [2023-12-02 17:31:19,203 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 466 transitions. Word has length 18 [2023-12-02 17:31:19,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:31:19,203 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 466 transitions. [2023-12-02 17:31:19,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.1) internal successors, (42), 20 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-12-02 17:31:19,203 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 466 transitions. [2023-12-02 17:31:19,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-02 17:31:19,204 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:31:19,204 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:31:19,210 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-12-02 17:31:19,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-12-02 17:31:19,405 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-02 17:31:19,406 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:31:19,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1817944250, now seen corresponding path program 7 times [2023-12-02 17:31:19,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:31:19,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336312685] [2023-12-02 17:31:19,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:31:19,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:31:19,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:31:20,270 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:31:20,270 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:31:20,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336312685] [2023-12-02 17:31:20,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336312685] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:31:20,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [294979588] [2023-12-02 17:31:20,270 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-02 17:31:20,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:31:20,271 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:31:20,271 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:31:20,274 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-02 17:31:20,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:31:20,380 INFO L262 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-02 17:31:20,383 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:31:20,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:31:20,560 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 16 treesize of output 11 [2023-12-02 17:31:20,683 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 87 treesize of output 59 [2023-12-02 17:31:20,720 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 17:31:20,720 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:31:21,122 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:31:21,123 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 320 treesize of output 232 [2023-12-02 17:31:21,136 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 128 treesize of output 110 [2023-12-02 17:31:21,146 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 110 treesize of output 104 [2023-12-02 17:31:21,532 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 17:31:21,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [294979588] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:31:21,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [324356466] [2023-12-02 17:31:21,533 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) 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.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) 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) [2023-12-02 17:31:21,535 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:31:21,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 20 [2023-12-02 17:31:21,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421093759] [2023-12-02 17:31:21,535 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:31:21,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-02 17:31:21,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:31:21,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-02 17:31:21,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=347, Unknown=5, NotChecked=0, Total=420 [2023-12-02 17:31:21,537 INFO L87 Difference]: Start difference. First operand 164 states and 466 transitions. Second operand has 21 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 20 states have internal predecessors, (41), 0 states have call successors, (0), 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-12-02 17:31:21,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:31:21,897 INFO L93 Difference]: Finished difference Result 206 states and 557 transitions. [2023-12-02 17:31:21,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-02 17:31:21,897 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 20 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-12-02 17:31:21,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:31:21,899 INFO L225 Difference]: With dead ends: 206 [2023-12-02 17:31:21,899 INFO L226 Difference]: Without dead ends: 201 [2023-12-02 17:31:21,900 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=423, Unknown=5, NotChecked=0, Total=506 [2023-12-02 17:31:21,900 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 26 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 17:31:21,901 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 63 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 398 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 17:31:21,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2023-12-02 17:31:21,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 170. [2023-12-02 17:31:21,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 169 states have (on average 2.8757396449704142) internal successors, (486), 169 states have internal predecessors, (486), 0 states have call successors, (0), 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-12-02 17:31:21,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 486 transitions. [2023-12-02 17:31:21,907 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 486 transitions. Word has length 18 [2023-12-02 17:31:21,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:31:21,908 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 486 transitions. [2023-12-02 17:31:21,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 20 states have internal predecessors, (41), 0 states have call successors, (0), 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-12-02 17:31:21,908 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 486 transitions. [2023-12-02 17:31:21,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-02 17:31:21,909 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:31:21,909 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:31:21,914 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-12-02 17:31:22,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-12-02 17:31:22,114 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-02 17:31:22,114 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:31:22,114 INFO L85 PathProgramCache]: Analyzing trace with hash -924912170, now seen corresponding path program 8 times [2023-12-02 17:31:22,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:31:22,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124017704] [2023-12-02 17:31:22,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:31:22,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:31:22,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:31:23,043 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:31:23,044 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:31:23,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124017704] [2023-12-02 17:31:23,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124017704] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:31:23,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [36572103] [2023-12-02 17:31:23,044 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 17:31:23,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:31:23,044 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:31:23,045 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:31:23,048 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-12-02 17:31:23,157 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-02 17:31:23,157 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 17:31:23,159 INFO L262 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 31 conjunts are in the unsatisfiable core [2023-12-02 17:31:23,161 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:31:23,199 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 1 [2023-12-02 17:31:23,242 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 8 treesize of output 1 [2023-12-02 17:31:23,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:31:23,373 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 16 treesize of output 11 [2023-12-02 17:31:23,456 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 87 treesize of output 59 [2023-12-02 17:31:23,509 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:31:23,510 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:31:24,199 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_278 (Array Int Int)) (v_ArrVal_277 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_277))) (let ((.cse0 (select (select (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_278) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< (+ .cse0 2147483648) 0) (< 2147483647 .cse0) (= .cse0 (select (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (forall ((v_ArrVal_278 (Array Int Int)) (v_ArrVal_277 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_277))) (= (select (select (store .cse2 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_278) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (select (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) is different from false [2023-12-02 17:31:24,209 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:31:24,210 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 33 [2023-12-02 17:31:24,213 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 246 treesize of output 214 [2023-12-02 17:31:24,217 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 22 treesize of output 18 [2023-12-02 17:31:24,220 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 9 treesize of output 7 [2023-12-02 17:31:24,228 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 17:31:24,228 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 1 [2023-12-02 17:31:24,246 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-12-02 17:31:24,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [36572103] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:31:24,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1521202689] [2023-12-02 17:31:24,247 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) 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.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) 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) [2023-12-02 17:31:24,247 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:31:24,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 23 [2023-12-02 17:31:24,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048949396] [2023-12-02 17:31:24,247 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:31:24,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-02 17:31:24,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:31:24,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-02 17:31:24,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=418, Unknown=7, NotChecked=42, Total=552 [2023-12-02 17:31:24,249 INFO L87 Difference]: Start difference. First operand 170 states and 486 transitions. Second operand has 24 states, 24 states have (on average 1.75) internal successors, (42), 23 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-12-02 17:31:24,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:31:24,575 INFO L93 Difference]: Finished difference Result 187 states and 526 transitions. [2023-12-02 17:31:24,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-02 17:31:24,576 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.75) internal successors, (42), 23 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 18 [2023-12-02 17:31:24,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:31:24,578 INFO L225 Difference]: With dead ends: 187 [2023-12-02 17:31:24,578 INFO L226 Difference]: Without dead ends: 182 [2023-12-02 17:31:24,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=96, Invalid=501, Unknown=7, NotChecked=46, Total=650 [2023-12-02 17:31:24,579 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 35 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 47 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 17:31:24,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 46 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 320 Invalid, 0 Unknown, 47 Unchecked, 0.2s Time] [2023-12-02 17:31:24,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2023-12-02 17:31:24,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 172. [2023-12-02 17:31:24,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 171 states have (on average 2.8947368421052633) internal successors, (495), 171 states have internal predecessors, (495), 0 states have call successors, (0), 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-12-02 17:31:24,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 495 transitions. [2023-12-02 17:31:24,587 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 495 transitions. Word has length 18 [2023-12-02 17:31:24,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:31:24,587 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 495 transitions. [2023-12-02 17:31:24,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.75) internal successors, (42), 23 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-12-02 17:31:24,588 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 495 transitions. [2023-12-02 17:31:24,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-02 17:31:24,588 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:31:24,588 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:31:24,593 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-12-02 17:31:24,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-12-02 17:31:24,789 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-02 17:31:24,789 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:31:24,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1641007792, now seen corresponding path program 9 times [2023-12-02 17:31:24,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:31:24,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014328759] [2023-12-02 17:31:24,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:31:24,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:31:24,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:31:25,543 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:31:25,543 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:31:25,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014328759] [2023-12-02 17:31:25,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014328759] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:31:25,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1802877126] [2023-12-02 17:31:25,543 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-02 17:31:25,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:31:25,544 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:31:25,545 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:31:25,550 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-12-02 17:31:25,663 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-02 17:31:25,663 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 17:31:25,665 INFO L262 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 47 conjunts are in the unsatisfiable core [2023-12-02 17:31:25,668 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:31:25,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:31:25,681 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 10 treesize of output 8 [2023-12-02 17:31:25,716 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 15 treesize of output 1 [2023-12-02 17:31:25,757 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 8 treesize of output 1 [2023-12-02 17:31:25,897 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 16 treesize of output 11 [2023-12-02 17:31:26,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 87 treesize of output 59 [2023-12-02 17:31:26,062 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:31:26,062 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:31:27,046 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:31:27,046 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 33 [2023-12-02 17:31:27,050 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 118 treesize of output 102 [2023-12-02 17:31:27,056 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 32 treesize of output 28 [2023-12-02 17:31:27,060 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 14 treesize of output 12 [2023-12-02 17:31:27,076 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 17:31:27,077 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 1 [2023-12-02 17:31:27,104 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:31:27,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1802877126] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:31:27,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1657823712] [2023-12-02 17:31:27,105 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) 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.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) 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) [2023-12-02 17:31:27,105 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:31:27,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 23 [2023-12-02 17:31:27,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55647229] [2023-12-02 17:31:27,106 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:31:27,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-02 17:31:27,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:31:27,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-02 17:31:27,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=464, Unknown=1, NotChecked=0, Total=552 [2023-12-02 17:31:27,107 INFO L87 Difference]: Start difference. First operand 172 states and 495 transitions. Second operand has 24 states, 24 states have (on average 1.75) internal successors, (42), 23 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-12-02 17:31:28,878 WARN L854 $PredicateComparison]: unable to prove that (and (= c_~sum1~0 c_~sum2~0) (or (let ((.cse1 (+ c_~bag1~0 c_~sum1~0)) (.cse2 (+ c_~A~0.offset (* c_~j~0 4)))) (and (forall ((v_ArrVal_307 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_307) c_~A~0.base) .cse2))) (or (< (+ c_~bag2~0 .cse0 2147483648) 0) (= .cse1 (+ c_~bag2~0 .cse0 c_~sum2~0)) (< 2147483647 (+ c_~bag2~0 .cse0))))) (or (< (+ c_~bag2~0 c_~sum2~0 2147483648) 0) (< 2147483647 (+ c_~bag2~0 c_~sum2~0)) (forall ((v_ArrVal_307 (Array Int Int))) (= .cse1 (+ c_~bag2~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_307) c_~A~0.base) .cse2) c_~sum2~0)))))) (not (= c_~N~0 (+ c_~j~0 1))) (< c_~i~0 c_~N~0))) is different from false [2023-12-02 17:31:29,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:31:29,723 INFO L93 Difference]: Finished difference Result 305 states and 783 transitions. [2023-12-02 17:31:29,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-12-02 17:31:29,723 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.75) internal successors, (42), 23 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 18 [2023-12-02 17:31:29,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:31:29,725 INFO L225 Difference]: With dead ends: 305 [2023-12-02 17:31:29,725 INFO L226 Difference]: Without dead ends: 300 [2023-12-02 17:31:29,726 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 419 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=301, Invalid=1498, Unknown=11, NotChecked=82, Total=1892 [2023-12-02 17:31:29,727 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 176 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 61 mSolverCounterUnsat, 23 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 23 IncrementalHoareTripleChecker+Unknown, 113 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-02 17:31:29,727 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 62 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 420 Invalid, 23 Unknown, 113 Unchecked, 0.7s Time] [2023-12-02 17:31:29,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2023-12-02 17:31:29,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 180. [2023-12-02 17:31:29,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 179 states have (on average 2.8659217877094973) internal successors, (513), 179 states have internal predecessors, (513), 0 states have call successors, (0), 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-12-02 17:31:29,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 513 transitions. [2023-12-02 17:31:29,736 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 513 transitions. Word has length 18 [2023-12-02 17:31:29,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:31:29,736 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 513 transitions. [2023-12-02 17:31:29,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.75) internal successors, (42), 23 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-12-02 17:31:29,737 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 513 transitions. [2023-12-02 17:31:29,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-02 17:31:29,738 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:31:29,738 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:31:29,743 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-12-02 17:31:29,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-12-02 17:31:29,938 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-02 17:31:29,939 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:31:29,939 INFO L85 PathProgramCache]: Analyzing trace with hash 2034123906, now seen corresponding path program 10 times [2023-12-02 17:31:29,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:31:29,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725362177] [2023-12-02 17:31:29,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:31:29,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:31:29,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:31:30,666 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:31:30,666 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:31:30,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725362177] [2023-12-02 17:31:30,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725362177] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:31:30,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1465337014] [2023-12-02 17:31:30,666 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-02 17:31:30,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:31:30,667 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:31:30,667 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:31:30,668 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-12-02 17:31:30,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:31:30,772 INFO L262 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 39 conjunts are in the unsatisfiable core [2023-12-02 17:31:30,775 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:31:30,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:31:30,815 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 10 treesize of output 8 [2023-12-02 17:31:30,847 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 15 treesize of output 1 [2023-12-02 17:31:30,887 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 8 treesize of output 1 [2023-12-02 17:31:31,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:31:31,091 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 16 treesize of output 11 [2023-12-02 17:31:31,179 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 87 treesize of output 59 [2023-12-02 17:31:31,216 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:31:31,216 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:31:32,147 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:31:32,147 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 33 [2023-12-02 17:31:32,151 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 118 treesize of output 102 [2023-12-02 17:31:32,155 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 32 treesize of output 28 [2023-12-02 17:31:32,158 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 14 treesize of output 12 [2023-12-02 17:31:32,176 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 17:31:32,177 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 1 [2023-12-02 17:31:32,208 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:31:32,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1465337014] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:31:32,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2001343574] [2023-12-02 17:31:32,209 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) 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.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) 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) [2023-12-02 17:31:32,210 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:31:32,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 23 [2023-12-02 17:31:32,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846371284] [2023-12-02 17:31:32,210 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:31:32,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-02 17:31:32,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:31:32,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-02 17:31:32,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=463, Unknown=7, NotChecked=0, Total=552 [2023-12-02 17:31:32,212 INFO L87 Difference]: Start difference. First operand 180 states and 513 transitions. Second operand has 24 states, 24 states have (on average 1.75) internal successors, (42), 23 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-12-02 17:31:32,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:31:32,658 INFO L93 Difference]: Finished difference Result 225 states and 612 transitions. [2023-12-02 17:31:32,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-02 17:31:32,659 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.75) internal successors, (42), 23 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 18 [2023-12-02 17:31:32,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:31:32,661 INFO L225 Difference]: With dead ends: 225 [2023-12-02 17:31:32,661 INFO L226 Difference]: Without dead ends: 220 [2023-12-02 17:31:32,661 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=95, Invalid=548, Unknown=7, NotChecked=0, Total=650 [2023-12-02 17:31:32,662 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 33 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 17:31:32,662 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 62 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 17:31:32,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2023-12-02 17:31:32,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 181. [2023-12-02 17:31:32,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 180 states have (on average 2.8555555555555556) internal successors, (514), 180 states have internal predecessors, (514), 0 states have call successors, (0), 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-12-02 17:31:32,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 514 transitions. [2023-12-02 17:31:32,669 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 514 transitions. Word has length 18 [2023-12-02 17:31:32,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:31:32,669 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 514 transitions. [2023-12-02 17:31:32,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.75) internal successors, (42), 23 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-12-02 17:31:32,670 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 514 transitions. [2023-12-02 17:31:32,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-02 17:31:32,671 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:31:32,671 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:31:32,677 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-12-02 17:31:32,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-12-02 17:31:32,871 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-02 17:31:32,872 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:31:32,872 INFO L85 PathProgramCache]: Analyzing trace with hash -2028085579, now seen corresponding path program 11 times [2023-12-02 17:31:32,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:31:32,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705319708] [2023-12-02 17:31:32,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:31:32,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:31:32,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:31:32,990 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 17:31:32,990 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:31:32,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705319708] [2023-12-02 17:31:32,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705319708] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:31:32,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1202823699] [2023-12-02 17:31:32,990 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 17:31:32,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:31:32,991 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:31:32,992 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:31:32,994 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-12-02 17:31:33,111 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-02 17:31:33,112 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 17:31:33,113 INFO L262 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-02 17:31:33,114 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:31:33,185 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 17:31:33,185 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:31:33,243 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 17:31:33,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1202823699] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:31:33,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1049137277] [2023-12-02 17:31:33,244 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) 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.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) 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) [2023-12-02 17:31:33,245 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:31:33,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2023-12-02 17:31:33,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428272628] [2023-12-02 17:31:33,246 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:31:33,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-02 17:31:33,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:31:33,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-02 17:31:33,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2023-12-02 17:31:33,247 INFO L87 Difference]: Start difference. First operand 181 states and 514 transitions. Second operand has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 11 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-12-02 17:31:33,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:31:33,364 INFO L93 Difference]: Finished difference Result 223 states and 554 transitions. [2023-12-02 17:31:33,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 17:31:33,369 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-12-02 17:31:33,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:31:33,371 INFO L225 Difference]: With dead ends: 223 [2023-12-02 17:31:33,371 INFO L226 Difference]: Without dead ends: 209 [2023-12-02 17:31:33,371 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2023-12-02 17:31:33,372 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 22 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 17:31:33,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 32 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 17:31:33,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2023-12-02 17:31:33,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 186. [2023-12-02 17:31:33,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 185 states have (on average 2.502702702702703) internal successors, (463), 185 states have internal predecessors, (463), 0 states have call successors, (0), 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-12-02 17:31:33,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 463 transitions. [2023-12-02 17:31:33,378 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 463 transitions. Word has length 19 [2023-12-02 17:31:33,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:31:33,379 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 463 transitions. [2023-12-02 17:31:33,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 11 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-12-02 17:31:33,379 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 463 transitions. [2023-12-02 17:31:33,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-02 17:31:33,379 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:31:33,380 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:31:33,385 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-12-02 17:31:33,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-12-02 17:31:33,580 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-02 17:31:33,581 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:31:33,581 INFO L85 PathProgramCache]: Analyzing trace with hash -302656086, now seen corresponding path program 12 times [2023-12-02 17:31:33,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:31:33,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112951971] [2023-12-02 17:31:33,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:31:33,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:31:33,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:31:33,711 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:31:33,712 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:31:33,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112951971] [2023-12-02 17:31:33,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112951971] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:31:33,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1472869347] [2023-12-02 17:31:33,712 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-02 17:31:33,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:31:33,713 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:31:33,713 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:31:33,716 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-12-02 17:31:33,828 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-02 17:31:33,828 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 17:31:33,829 INFO L262 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-02 17:31:33,831 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:31:33,888 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:31:33,888 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:31:33,926 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:31:33,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1472869347] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:31:33,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1859677393] [2023-12-02 17:31:33,927 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) 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.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) 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) [2023-12-02 17:31:33,927 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:31:33,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2023-12-02 17:31:33,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548758375] [2023-12-02 17:31:33,928 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:31:33,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-02 17:31:33,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:31:33,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-02 17:31:33,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2023-12-02 17:31:33,929 INFO L87 Difference]: Start difference. First operand 186 states and 463 transitions. Second operand has 12 states, 12 states have (on average 2.75) internal successors, (33), 11 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-12-02 17:31:34,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:31:34,003 INFO L93 Difference]: Finished difference Result 131 states and 289 transitions. [2023-12-02 17:31:34,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 17:31:34,004 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 11 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 19 [2023-12-02 17:31:34,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:31:34,005 INFO L225 Difference]: With dead ends: 131 [2023-12-02 17:31:34,005 INFO L226 Difference]: Without dead ends: 95 [2023-12-02 17:31:34,005 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2023-12-02 17:31:34,006 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 30 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 17:31:34,006 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 19 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 17:31:34,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2023-12-02 17:31:34,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2023-12-02 17:31:34,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 94 states have (on average 2.382978723404255) internal successors, (224), 94 states have internal predecessors, (224), 0 states have call successors, (0), 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-12-02 17:31:34,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 224 transitions. [2023-12-02 17:31:34,009 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 224 transitions. Word has length 19 [2023-12-02 17:31:34,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:31:34,010 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 224 transitions. [2023-12-02 17:31:34,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 11 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-12-02 17:31:34,010 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 224 transitions. [2023-12-02 17:31:34,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-02 17:31:34,010 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:31:34,010 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:31:34,016 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2023-12-02 17:31:34,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-12-02 17:31:34,211 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-02 17:31:34,211 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:31:34,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1428474682, now seen corresponding path program 13 times [2023-12-02 17:31:34,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:31:34,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894497234] [2023-12-02 17:31:34,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:31:34,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:31:34,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:31:34,353 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 17:31:34,353 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:31:34,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894497234] [2023-12-02 17:31:34,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894497234] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:31:34,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1562309874] [2023-12-02 17:31:34,353 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-02 17:31:34,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:31:34,354 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:31:34,355 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:31:34,357 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-12-02 17:31:34,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:31:34,458 INFO L262 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-02 17:31:34,459 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:31:34,523 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 17:31:34,523 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:31:34,569 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 17:31:34,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1562309874] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:31:34,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019785839] [2023-12-02 17:31:34,569 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) 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.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) 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) [2023-12-02 17:31:34,570 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:31:34,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2023-12-02 17:31:34,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790692785] [2023-12-02 17:31:34,570 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:31:34,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-02 17:31:34,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:31:34,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-02 17:31:34,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2023-12-02 17:31:34,571 INFO L87 Difference]: Start difference. First operand 95 states and 224 transitions. Second operand has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:31:34,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:31:34,650 INFO L93 Difference]: Finished difference Result 91 states and 205 transitions. [2023-12-02 17:31:34,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 17:31:34,650 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-12-02 17:31:34,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:31:34,651 INFO L225 Difference]: With dead ends: 91 [2023-12-02 17:31:34,651 INFO L226 Difference]: Without dead ends: 91 [2023-12-02 17:31:34,652 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2023-12-02 17:31:34,652 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 49 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 17:31:34,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 17 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 17:31:34,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-12-02 17:31:34,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 66. [2023-12-02 17:31:34,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 65 states have (on average 2.230769230769231) internal successors, (145), 65 states have internal predecessors, (145), 0 states have call successors, (0), 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-12-02 17:31:34,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 145 transitions. [2023-12-02 17:31:34,656 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 145 transitions. Word has length 20 [2023-12-02 17:31:34,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:31:34,656 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 145 transitions. [2023-12-02 17:31:34,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:31:34,656 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 145 transitions. [2023-12-02 17:31:34,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-02 17:31:34,657 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:31:34,657 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:31:34,662 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-12-02 17:31:34,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:31:34,858 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-02 17:31:34,858 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:31:34,858 INFO L85 PathProgramCache]: Analyzing trace with hash -2011748723, now seen corresponding path program 14 times [2023-12-02 17:31:34,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:31:34,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050624030] [2023-12-02 17:31:34,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:31:34,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:31:34,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:31:34,998 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 17:31:34,998 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:31:34,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050624030] [2023-12-02 17:31:34,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050624030] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:31:34,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2092140278] [2023-12-02 17:31:34,998 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 17:31:34,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:31:34,999 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:31:34,999 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:31:35,000 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-12-02 17:31:35,106 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-02 17:31:35,106 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 17:31:35,108 INFO L262 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-02 17:31:35,109 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:31:35,184 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 17:31:35,185 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:31:35,242 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 17:31:35,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2092140278] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:31:35,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1340028907] [2023-12-02 17:31:35,243 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) 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.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) 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) [2023-12-02 17:31:35,243 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:31:35,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2023-12-02 17:31:35,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942003828] [2023-12-02 17:31:35,243 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:31:35,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-02 17:31:35,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:31:35,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-02 17:31:35,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2023-12-02 17:31:35,244 INFO L87 Difference]: Start difference. First operand 66 states and 145 transitions. Second operand has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 13 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-12-02 17:31:35,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:31:35,316 INFO L93 Difference]: Finished difference Result 78 states and 174 transitions. [2023-12-02 17:31:35,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 17:31:35,316 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 13 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 20 [2023-12-02 17:31:35,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:31:35,317 INFO L225 Difference]: With dead ends: 78 [2023-12-02 17:31:35,317 INFO L226 Difference]: Without dead ends: 78 [2023-12-02 17:31:35,317 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2023-12-02 17:31:35,318 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 42 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 17:31:35,318 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 15 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 17:31:35,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-12-02 17:31:35,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2023-12-02 17:31:35,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 77 states have (on average 2.25974025974026) internal successors, (174), 77 states have internal predecessors, (174), 0 states have call successors, (0), 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-12-02 17:31:35,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 174 transitions. [2023-12-02 17:31:35,321 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 174 transitions. Word has length 20 [2023-12-02 17:31:35,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:31:35,321 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 174 transitions. [2023-12-02 17:31:35,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 13 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-12-02 17:31:35,321 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 174 transitions. [2023-12-02 17:31:35,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-02 17:31:35,322 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:31:35,322 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:31:35,327 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2023-12-02 17:31:35,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:31:35,522 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-02 17:31:35,522 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:31:35,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1930553930, now seen corresponding path program 15 times [2023-12-02 17:31:35,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:31:35,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658611804] [2023-12-02 17:31:35,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:31:35,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:31:35,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:31:36,805 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:31:36,806 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:31:36,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658611804] [2023-12-02 17:31:36,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658611804] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:31:36,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [295152621] [2023-12-02 17:31:36,806 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-02 17:31:36,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:31:36,806 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:31:36,807 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:31:36,809 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-12-02 17:31:36,921 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-02 17:31:36,922 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 17:31:36,923 INFO L262 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 41 conjunts are in the unsatisfiable core [2023-12-02 17:31:36,927 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:31:37,741 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:31:37,741 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 202 treesize of output 138 [2023-12-02 17:31:37,906 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:31:37,906 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:31:39,950 INFO L349 Elim1Store]: treesize reduction 40, result has 18.4 percent of original size [2023-12-02 17:31:39,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 966 treesize of output 398 [2023-12-02 17:31:41,806 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 17:31:41,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [295152621] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:31:41,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1865241221] [2023-12-02 17:31:41,806 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) 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.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) 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) [2023-12-02 17:31:41,806 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:31:41,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 27 [2023-12-02 17:31:41,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416076449] [2023-12-02 17:31:41,807 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:31:41,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-12-02 17:31:41,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:31:41,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-12-02 17:31:41,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=592, Unknown=0, NotChecked=0, Total=702 [2023-12-02 17:31:41,808 INFO L87 Difference]: Start difference. First operand 78 states and 174 transitions. Second operand has 27 states, 27 states have (on average 1.8518518518518519) internal successors, (50), 27 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-12-02 17:31:49,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:31:49,497 INFO L93 Difference]: Finished difference Result 304 states and 684 transitions. [2023-12-02 17:31:49,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-12-02 17:31:49,498 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.8518518518518519) internal successors, (50), 27 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) Word has length 21 [2023-12-02 17:31:49,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:31:49,500 INFO L225 Difference]: With dead ends: 304 [2023-12-02 17:31:49,500 INFO L226 Difference]: Without dead ends: 294 [2023-12-02 17:31:49,501 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=330, Invalid=1740, Unknown=0, NotChecked=0, Total=2070 [2023-12-02 17:31:49,502 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 218 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 902 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 902 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-02 17:31:49,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 160 Invalid, 964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 902 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-12-02 17:31:49,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2023-12-02 17:31:49,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 178. [2023-12-02 17:31:49,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 177 states have (on average 2.4124293785310735) internal successors, (427), 177 states have internal predecessors, (427), 0 states have call successors, (0), 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-12-02 17:31:49,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 427 transitions. [2023-12-02 17:31:49,512 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 427 transitions. Word has length 21 [2023-12-02 17:31:49,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:31:49,512 INFO L495 AbstractCegarLoop]: Abstraction has 178 states and 427 transitions. [2023-12-02 17:31:49,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.8518518518518519) internal successors, (50), 27 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-12-02 17:31:49,513 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 427 transitions. [2023-12-02 17:31:49,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-02 17:31:49,514 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:31:49,514 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:31:49,519 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2023-12-02 17:31:49,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:31:49,715 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-02 17:31:49,715 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:31:49,715 INFO L85 PathProgramCache]: Analyzing trace with hash -450222662, now seen corresponding path program 16 times [2023-12-02 17:31:49,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:31:49,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882703747] [2023-12-02 17:31:49,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:31:49,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:31:49,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:31:50,882 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:31:50,883 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:31:50,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882703747] [2023-12-02 17:31:50,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882703747] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:31:50,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1028544153] [2023-12-02 17:31:50,883 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-02 17:31:50,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:31:50,883 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:31:50,884 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:31:50,885 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-12-02 17:31:50,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:31:50,994 INFO L262 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 33 conjunts are in the unsatisfiable core [2023-12-02 17:31:50,997 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:31:51,802 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:31:51,803 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 204 treesize of output 140 [2023-12-02 17:31:51,932 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:31:51,932 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:31:53,384 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:31:53,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 966 treesize of output 426 [2023-12-02 17:32:13,722 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 17:32:13,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1028544153] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:32:13,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [391934359] [2023-12-02 17:32:13,723 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) 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.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) 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) [2023-12-02 17:32:13,723 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:32:13,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 9] total 28 [2023-12-02 17:32:13,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704703600] [2023-12-02 17:32:13,724 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:32:13,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-02 17:32:13,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:32:13,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-02 17:32:13,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=662, Unknown=0, NotChecked=0, Total=756 [2023-12-02 17:32:13,725 INFO L87 Difference]: Start difference. First operand 178 states and 427 transitions. Second operand has 28 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 28 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-12-02 17:32:16,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:32:16,205 INFO L93 Difference]: Finished difference Result 330 states and 793 transitions. [2023-12-02 17:32:16,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-12-02 17:32:16,205 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 28 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) Word has length 21 [2023-12-02 17:32:16,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:32:16,208 INFO L225 Difference]: With dead ends: 330 [2023-12-02 17:32:16,209 INFO L226 Difference]: Without dead ends: 325 [2023-12-02 17:32:16,210 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 387 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=236, Invalid=1744, Unknown=0, NotChecked=0, Total=1980 [2023-12-02 17:32:16,210 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 172 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 956 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 956 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-02 17:32:16,211 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 120 Invalid, 999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 956 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-02 17:32:16,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2023-12-02 17:32:16,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 199. [2023-12-02 17:32:16,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 198 states have (on average 2.5353535353535355) internal successors, (502), 198 states have internal predecessors, (502), 0 states have call successors, (0), 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-12-02 17:32:16,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 502 transitions. [2023-12-02 17:32:16,218 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 502 transitions. Word has length 21 [2023-12-02 17:32:16,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:32:16,218 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 502 transitions. [2023-12-02 17:32:16,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 28 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-12-02 17:32:16,218 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 502 transitions. [2023-12-02 17:32:16,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-02 17:32:16,219 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:32:16,219 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:32:16,226 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2023-12-02 17:32:16,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-12-02 17:32:16,420 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-02 17:32:16,420 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:32:16,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1766379966, now seen corresponding path program 17 times [2023-12-02 17:32:16,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:32:16,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004353430] [2023-12-02 17:32:16,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:32:16,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:32:16,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:32:17,699 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:32:17,699 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:32:17,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004353430] [2023-12-02 17:32:17,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004353430] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:32:17,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [767549731] [2023-12-02 17:32:17,700 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 17:32:17,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:32:17,700 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:32:17,701 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:32:17,706 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-12-02 17:32:17,948 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-02 17:32:17,948 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 17:32:17,950 INFO L262 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 38 conjunts are in the unsatisfiable core [2023-12-02 17:32:17,953 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:32:18,788 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:32:18,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 263 treesize of output 179 [2023-12-02 17:32:20,099 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:32:20,100 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:32:21,803 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:32:21,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 966 treesize of output 438 [2023-12-02 17:33:02,004 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:33:02,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [767549731] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:33:02,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [735142583] [2023-12-02 17:33:02,005 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) 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.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) 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) [2023-12-02 17:33:02,005 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:33:02,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2023-12-02 17:33:02,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119227986] [2023-12-02 17:33:02,005 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:33:02,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-12-02 17:33:02,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:33:02,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-12-02 17:33:02,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=737, Unknown=0, NotChecked=0, Total=870 [2023-12-02 17:33:02,006 INFO L87 Difference]: Start difference. First operand 199 states and 502 transitions. Second operand has 30 states, 30 states have (on average 1.7) internal successors, (51), 29 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:33:07,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:33:07,284 INFO L93 Difference]: Finished difference Result 399 states and 998 transitions. [2023-12-02 17:33:07,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-12-02 17:33:07,285 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.7) internal successors, (51), 29 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-12-02 17:33:07,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:33:07,287 INFO L225 Difference]: With dead ends: 399 [2023-12-02 17:33:07,288 INFO L226 Difference]: Without dead ends: 394 [2023-12-02 17:33:07,289 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 836 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=636, Invalid=2904, Unknown=0, NotChecked=0, Total=3540 [2023-12-02 17:33:07,289 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 409 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 703 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 703 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-02 17:33:07,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 106 Invalid, 783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 703 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-02 17:33:07,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2023-12-02 17:33:07,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 233. [2023-12-02 17:33:07,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 232 states have (on average 2.586206896551724) internal successors, (600), 232 states have internal predecessors, (600), 0 states have call successors, (0), 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-12-02 17:33:07,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 600 transitions. [2023-12-02 17:33:07,297 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 600 transitions. Word has length 21 [2023-12-02 17:33:07,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:33:07,297 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 600 transitions. [2023-12-02 17:33:07,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.7) internal successors, (51), 29 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:33:07,297 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 600 transitions. [2023-12-02 17:33:07,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-02 17:33:07,298 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:33:07,298 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:33:07,304 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2023-12-02 17:33:07,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:33:07,499 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-02 17:33:07,499 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:33:07,499 INFO L85 PathProgramCache]: Analyzing trace with hash 799539996, now seen corresponding path program 18 times [2023-12-02 17:33:07,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:33:07,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177894753] [2023-12-02 17:33:07,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:33:07,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:33:07,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:33:09,129 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:33:09,129 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:33:09,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177894753] [2023-12-02 17:33:09,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177894753] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:33:09,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1427300619] [2023-12-02 17:33:09,130 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-02 17:33:09,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:33:09,130 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:33:09,131 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:33:09,131 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-12-02 17:33:09,241 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-02 17:33:09,241 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 17:33:09,243 INFO L262 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 37 conjunts are in the unsatisfiable core [2023-12-02 17:33:09,246 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:33:10,044 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:33:10,044 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 218 treesize of output 142 [2023-12-02 17:33:10,471 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 17:33:10,471 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:33:12,328 INFO L349 Elim1Store]: treesize reduction 25, result has 13.8 percent of original size [2023-12-02 17:33:12,329 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 806 treesize of output 378 [2023-12-02 17:33:14,281 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 17:33:14,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1427300619] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:33:14,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1640245933] [2023-12-02 17:33:14,282 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) 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.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) 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) [2023-12-02 17:33:14,282 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:33:14,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 9] total 27 [2023-12-02 17:33:14,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419709827] [2023-12-02 17:33:14,282 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:33:14,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-12-02 17:33:14,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:33:14,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-12-02 17:33:14,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=606, Unknown=0, NotChecked=0, Total=702 [2023-12-02 17:33:14,283 INFO L87 Difference]: Start difference. First operand 233 states and 600 transitions. Second operand has 27 states, 27 states have (on average 1.8518518518518519) internal successors, (50), 27 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-12-02 17:33:23,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:33:23,458 INFO L93 Difference]: Finished difference Result 452 states and 1147 transitions. [2023-12-02 17:33:23,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2023-12-02 17:33:23,458 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.8518518518518519) internal successors, (50), 27 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) Word has length 21 [2023-12-02 17:33:23,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:33:23,461 INFO L225 Difference]: With dead ends: 452 [2023-12-02 17:33:23,461 INFO L226 Difference]: Without dead ends: 447 [2023-12-02 17:33:23,462 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 832 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=573, Invalid=2967, Unknown=0, NotChecked=0, Total=3540 [2023-12-02 17:33:23,462 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 207 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 910 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 1001 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-02 17:33:23,462 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 120 Invalid, 1001 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 910 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-02 17:33:23,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2023-12-02 17:33:23,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 282. [2023-12-02 17:33:23,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 281 states have (on average 2.793594306049822) internal successors, (785), 281 states have internal predecessors, (785), 0 states have call successors, (0), 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-12-02 17:33:23,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 785 transitions. [2023-12-02 17:33:23,472 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 785 transitions. Word has length 21 [2023-12-02 17:33:23,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:33:23,473 INFO L495 AbstractCegarLoop]: Abstraction has 282 states and 785 transitions. [2023-12-02 17:33:23,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.8518518518518519) internal successors, (50), 27 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-12-02 17:33:23,473 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 785 transitions. [2023-12-02 17:33:23,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-02 17:33:23,473 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:33:23,474 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:33:23,479 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2023-12-02 17:33:23,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2023-12-02 17:33:23,674 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-02 17:33:23,674 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:33:23,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1142963480, now seen corresponding path program 19 times [2023-12-02 17:33:23,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:33:23,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107086194] [2023-12-02 17:33:23,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:33:23,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:33:23,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:33:25,037 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:33:25,037 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:33:25,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107086194] [2023-12-02 17:33:25,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107086194] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:33:25,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1636296047] [2023-12-02 17:33:25,037 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-02 17:33:25,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:33:25,038 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:33:25,038 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:33:25,040 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-12-02 17:33:25,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:33:25,164 INFO L262 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 28 conjunts are in the unsatisfiable core [2023-12-02 17:33:25,166 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:33:25,940 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:33:25,940 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 211 treesize of output 139 [2023-12-02 17:33:26,074 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 17:33:26,074 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:33:28,081 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:33:28,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 997 treesize of output 437 [2023-12-02 17:33:41,867 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 17:33:41,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1636296047] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:33:41,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [520654993] [2023-12-02 17:33:41,868 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) 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.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) 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) [2023-12-02 17:33:41,868 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:33:41,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9] total 25 [2023-12-02 17:33:41,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756544407] [2023-12-02 17:33:41,868 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:33:41,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-12-02 17:33:41,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:33:41,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-12-02 17:33:41,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=512, Unknown=0, NotChecked=0, Total=600 [2023-12-02 17:33:41,870 INFO L87 Difference]: Start difference. First operand 282 states and 785 transitions. Second operand has 25 states, 25 states have (on average 1.96) internal successors, (49), 25 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:33:42,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:33:42,866 INFO L93 Difference]: Finished difference Result 317 states and 874 transitions. [2023-12-02 17:33:42,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-02 17:33:42,866 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.96) internal successors, (49), 25 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-12-02 17:33:42,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:33:42,869 INFO L225 Difference]: With dead ends: 317 [2023-12-02 17:33:42,869 INFO L226 Difference]: Without dead ends: 312 [2023-12-02 17:33:42,870 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=114, Invalid=642, Unknown=0, NotChecked=0, Total=756 [2023-12-02 17:33:42,870 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 64 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-02 17:33:42,870 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 58 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 571 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-02 17:33:42,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2023-12-02 17:33:42,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 288. [2023-12-02 17:33:42,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 287 states have (on average 2.8292682926829267) internal successors, (812), 287 states have internal predecessors, (812), 0 states have call successors, (0), 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-12-02 17:33:42,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 812 transitions. [2023-12-02 17:33:42,879 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 812 transitions. Word has length 21 [2023-12-02 17:33:42,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:33:42,879 INFO L495 AbstractCegarLoop]: Abstraction has 288 states and 812 transitions. [2023-12-02 17:33:42,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.96) internal successors, (49), 25 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:33:42,879 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 812 transitions. [2023-12-02 17:33:42,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-02 17:33:42,880 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:33:42,880 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:33:42,886 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2023-12-02 17:33:43,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2023-12-02 17:33:43,081 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-02 17:33:43,081 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:33:43,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1921265206, now seen corresponding path program 20 times [2023-12-02 17:33:43,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:33:43,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89353908] [2023-12-02 17:33:43,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:33:43,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:33:43,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:33:44,121 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:33:44,121 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:33:44,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89353908] [2023-12-02 17:33:44,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89353908] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:33:44,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [975822703] [2023-12-02 17:33:44,122 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 17:33:44,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:33:44,122 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:33:44,123 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:33:44,123 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-12-02 17:33:44,386 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-02 17:33:44,386 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 17:33:44,388 INFO L262 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 40 conjunts are in the unsatisfiable core [2023-12-02 17:33:44,390 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:33:45,153 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:33:45,154 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 221 treesize of output 145 [2023-12-02 17:33:45,540 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:33:45,540 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:33:48,207 INFO L349 Elim1Store]: treesize reduction 36, result has 26.5 percent of original size [2023-12-02 17:33:48,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 959 treesize of output 421 [2023-12-02 17:33:50,162 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 17:33:50,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [975822703] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:33:50,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1541586730] [2023-12-02 17:33:50,163 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) 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.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) 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) [2023-12-02 17:33:50,164 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:33:50,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 9] total 27 [2023-12-02 17:33:50,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782081680] [2023-12-02 17:33:50,164 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:33:50,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-12-02 17:33:50,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:33:50,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-12-02 17:33:50,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=575, Unknown=0, NotChecked=0, Total=702 [2023-12-02 17:33:50,165 INFO L87 Difference]: Start difference. First operand 288 states and 812 transitions. Second operand has 27 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 27 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:34:01,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:34:01,298 INFO L93 Difference]: Finished difference Result 528 states and 1433 transitions. [2023-12-02 17:34:01,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-12-02 17:34:01,299 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 27 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-12-02 17:34:01,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:34:01,302 INFO L225 Difference]: With dead ends: 528 [2023-12-02 17:34:01,302 INFO L226 Difference]: Without dead ends: 523 [2023-12-02 17:34:01,303 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 879 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=585, Invalid=2607, Unknown=0, NotChecked=0, Total=3192 [2023-12-02 17:34:01,304 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 314 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 708 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-02 17:34:01,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 107 Invalid, 795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 708 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-02 17:34:01,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2023-12-02 17:34:01,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 348. [2023-12-02 17:34:01,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 347 states have (on average 3.043227665706052) internal successors, (1056), 347 states have internal predecessors, (1056), 0 states have call successors, (0), 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-12-02 17:34:01,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 1056 transitions. [2023-12-02 17:34:01,315 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 1056 transitions. Word has length 21 [2023-12-02 17:34:01,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:34:01,315 INFO L495 AbstractCegarLoop]: Abstraction has 348 states and 1056 transitions. [2023-12-02 17:34:01,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 27 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:34:01,316 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 1056 transitions. [2023-12-02 17:34:01,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-02 17:34:01,317 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:34:01,317 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:34:01,324 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2023-12-02 17:34:01,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-12-02 17:34:01,518 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-02 17:34:01,518 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:34:01,518 INFO L85 PathProgramCache]: Analyzing trace with hash 644654756, now seen corresponding path program 21 times [2023-12-02 17:34:01,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:34:01,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974307077] [2023-12-02 17:34:01,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:34:01,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:34:01,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:34:03,889 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:34:03,889 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:34:03,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974307077] [2023-12-02 17:34:03,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974307077] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:34:03,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1907946872] [2023-12-02 17:34:03,889 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-02 17:34:03,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:34:03,890 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:34:03,890 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:34:03,891 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-12-02 17:34:04,011 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-02 17:34:04,012 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 17:34:04,014 INFO L262 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 41 conjunts are in the unsatisfiable core [2023-12-02 17:34:04,016 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:34:04,847 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:34:04,848 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 213 treesize of output 145 [2023-12-02 17:34:05,128 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:34:05,128 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:34:07,567 INFO L349 Elim1Store]: treesize reduction 40, result has 18.4 percent of original size [2023-12-02 17:34:07,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 959 treesize of output 417 [2023-12-02 17:34:09,495 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 17:34:09,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1907946872] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:34:09,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [691177351] [2023-12-02 17:34:09,495 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) 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.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) 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) [2023-12-02 17:34:09,496 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:34:09,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 9] total 28 [2023-12-02 17:34:09,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471992443] [2023-12-02 17:34:09,496 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:34:09,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-02 17:34:09,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:34:09,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-02 17:34:09,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=647, Unknown=0, NotChecked=0, Total=756 [2023-12-02 17:34:09,498 INFO L87 Difference]: Start difference. First operand 348 states and 1056 transitions. Second operand has 28 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 28 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-12-02 17:34:20,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:34:20,917 INFO L93 Difference]: Finished difference Result 590 states and 1628 transitions. [2023-12-02 17:34:20,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2023-12-02 17:34:20,918 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 28 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) Word has length 21 [2023-12-02 17:34:20,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:34:20,923 INFO L225 Difference]: With dead ends: 590 [2023-12-02 17:34:20,923 INFO L226 Difference]: Without dead ends: 580 [2023-12-02 17:34:20,926 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1107 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=678, Invalid=3878, Unknown=0, NotChecked=0, Total=4556 [2023-12-02 17:34:20,926 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 302 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 966 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 1050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 966 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-12-02 17:34:20,926 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 155 Invalid, 1050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 966 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-12-02 17:34:20,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2023-12-02 17:34:20,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 398. [2023-12-02 17:34:20,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 397 states have (on average 3.1612090680100757) internal successors, (1255), 397 states have internal predecessors, (1255), 0 states have call successors, (0), 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-12-02 17:34:20,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 1255 transitions. [2023-12-02 17:34:20,944 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 1255 transitions. Word has length 21 [2023-12-02 17:34:20,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:34:20,944 INFO L495 AbstractCegarLoop]: Abstraction has 398 states and 1255 transitions. [2023-12-02 17:34:20,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 28 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-12-02 17:34:20,944 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 1255 transitions. [2023-12-02 17:34:20,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-02 17:34:20,946 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:34:20,946 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:34:20,951 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2023-12-02 17:34:21,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-12-02 17:34:21,147 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-02 17:34:21,147 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:34:21,147 INFO L85 PathProgramCache]: Analyzing trace with hash 2134059752, now seen corresponding path program 22 times [2023-12-02 17:34:21,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:34:21,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592593092] [2023-12-02 17:34:21,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:34:21,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:34:21,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:34:23,086 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:34:23,086 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:34:23,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592593092] [2023-12-02 17:34:23,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592593092] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:34:23,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694794112] [2023-12-02 17:34:23,087 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-02 17:34:23,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:34:23,087 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:34:23,088 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:34:23,097 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2023-12-02 17:34:23,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:34:23,217 INFO L262 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 28 conjunts are in the unsatisfiable core [2023-12-02 17:34:23,219 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:34:24,028 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:34:24,029 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 217 treesize of output 141 [2023-12-02 17:34:24,191 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 17:34:24,191 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:34:26,372 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:34:26,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 959 treesize of output 445 [2023-12-02 17:34:43,680 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 17:34:43,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [694794112] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:34:43,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2109216474] [2023-12-02 17:34:43,681 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) 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.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) 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) [2023-12-02 17:34:43,681 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:34:43,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 9] total 26 [2023-12-02 17:34:43,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921268549] [2023-12-02 17:34:43,682 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:34:43,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-02 17:34:43,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:34:43,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-02 17:34:43,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=576, Unknown=0, NotChecked=0, Total=650 [2023-12-02 17:34:43,683 INFO L87 Difference]: Start difference. First operand 398 states and 1255 transitions. Second operand has 26 states, 26 states have (on average 1.8846153846153846) internal successors, (49), 26 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:34:47,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:34:47,105 INFO L93 Difference]: Finished difference Result 531 states and 1545 transitions. [2023-12-02 17:34:47,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-12-02 17:34:47,105 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.8846153846153846) internal successors, (49), 26 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-12-02 17:34:47,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:34:47,110 INFO L225 Difference]: With dead ends: 531 [2023-12-02 17:34:47,110 INFO L226 Difference]: Without dead ends: 521 [2023-12-02 17:34:47,111 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 477 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=270, Invalid=2082, Unknown=0, NotChecked=0, Total=2352 [2023-12-02 17:34:47,111 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 147 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 1248 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 1300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-12-02 17:34:47,112 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 159 Invalid, 1300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1248 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-12-02 17:34:47,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2023-12-02 17:34:47,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 420. [2023-12-02 17:34:47,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 419 states have (on average 3.1837708830548928) internal successors, (1334), 419 states have internal predecessors, (1334), 0 states have call successors, (0), 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-12-02 17:34:47,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 1334 transitions. [2023-12-02 17:34:47,124 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 1334 transitions. Word has length 21 [2023-12-02 17:34:47,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:34:47,124 INFO L495 AbstractCegarLoop]: Abstraction has 420 states and 1334 transitions. [2023-12-02 17:34:47,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.8846153846153846) internal successors, (49), 26 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:34:47,124 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 1334 transitions. [2023-12-02 17:34:47,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-02 17:34:47,125 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:34:47,126 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:34:47,131 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2023-12-02 17:34:47,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-12-02 17:34:47,330 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-02 17:34:47,330 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:34:47,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1143092358, now seen corresponding path program 23 times [2023-12-02 17:34:47,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:34:47,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682184744] [2023-12-02 17:34:47,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:34:47,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:34:47,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:34:50,982 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:34:50,982 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:34:50,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682184744] [2023-12-02 17:34:50,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682184744] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:34:50,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2130930540] [2023-12-02 17:34:50,983 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 17:34:50,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:34:50,983 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:34:50,984 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:34:50,985 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2023-12-02 17:34:51,124 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-02 17:34:51,124 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 17:34:51,126 INFO L262 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 33 conjunts are in the unsatisfiable core [2023-12-02 17:34:51,128 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:34:51,966 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:34:51,967 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 211 treesize of output 139 [2023-12-02 17:34:52,103 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:34:52,103 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:34:53,615 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:34:53,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 940 treesize of output 442 [2023-12-02 17:35:11,422 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 17:35:11,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2130930540] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:35:11,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [23754982] [2023-12-02 17:35:11,422 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) 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.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) 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) [2023-12-02 17:35:11,423 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:35:11,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 9] total 27 [2023-12-02 17:35:11,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442147530] [2023-12-02 17:35:11,423 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:35:11,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-12-02 17:35:11,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:35:11,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-12-02 17:35:11,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=626, Unknown=0, NotChecked=0, Total=702 [2023-12-02 17:35:11,424 INFO L87 Difference]: Start difference. First operand 420 states and 1334 transitions. Second operand has 27 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 27 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:35:17,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:35:17,376 INFO L93 Difference]: Finished difference Result 667 states and 1995 transitions. [2023-12-02 17:35:17,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-12-02 17:35:17,377 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 27 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-12-02 17:35:17,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:35:17,380 INFO L225 Difference]: With dead ends: 667 [2023-12-02 17:35:17,380 INFO L226 Difference]: Without dead ends: 657 [2023-12-02 17:35:17,381 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 587 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=329, Invalid=2641, Unknown=0, NotChecked=0, Total=2970 [2023-12-02 17:35:17,382 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 163 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 1468 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 1525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-12-02 17:35:17,382 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 200 Invalid, 1525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1468 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-12-02 17:35:17,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2023-12-02 17:35:17,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 477. [2023-12-02 17:35:17,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 476 states have (on average 3.3004201680672267) internal successors, (1571), 476 states have internal predecessors, (1571), 0 states have call successors, (0), 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-12-02 17:35:17,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 1571 transitions. [2023-12-02 17:35:17,393 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 1571 transitions. Word has length 21 [2023-12-02 17:35:17,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:35:17,393 INFO L495 AbstractCegarLoop]: Abstraction has 477 states and 1571 transitions. [2023-12-02 17:35:17,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 27 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:35:17,393 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 1571 transitions. [2023-12-02 17:35:17,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-02 17:35:17,394 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:35:17,394 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:35:17,399 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2023-12-02 17:35:17,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-12-02 17:35:17,595 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-02 17:35:17,595 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:35:17,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1835717634, now seen corresponding path program 24 times [2023-12-02 17:35:17,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:35:17,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429569592] [2023-12-02 17:35:17,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:35:17,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:35:17,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:35:19,073 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:35:19,073 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:35:19,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429569592] [2023-12-02 17:35:19,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429569592] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:35:19,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1075046774] [2023-12-02 17:35:19,073 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-02 17:35:19,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:35:19,074 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:35:19,074 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:35:19,075 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2023-12-02 17:35:19,207 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-02 17:35:19,207 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 17:35:19,210 INFO L262 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 47 conjunts are in the unsatisfiable core [2023-12-02 17:35:19,213 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:35:19,294 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 1 [2023-12-02 17:35:19,355 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 8 treesize of output 1 [2023-12-02 17:35:19,425 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 8 treesize of output 1 [2023-12-02 17:35:20,069 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:35:20,069 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 233 treesize of output 161 [2023-12-02 17:35:20,375 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:35:20,375 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:35:30,252 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 17:35:30,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1075046774] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:35:30,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1942124175] [2023-12-02 17:35:30,252 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) 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.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) 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) [2023-12-02 17:35:30,253 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:35:30,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 10] total 28 [2023-12-02 17:35:30,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639523265] [2023-12-02 17:35:30,253 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:35:30,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-02 17:35:30,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:35:30,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-02 17:35:30,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=637, Unknown=1, NotChecked=0, Total=756 [2023-12-02 17:35:30,254 INFO L87 Difference]: Start difference. First operand 477 states and 1571 transitions. Second operand has 28 states, 28 states have (on average 1.75) internal successors, (49), 28 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:35:58,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:35:58,039 INFO L93 Difference]: Finished difference Result 604 states and 1903 transitions. [2023-12-02 17:35:58,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-12-02 17:35:58,039 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.75) internal successors, (49), 28 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-12-02 17:35:58,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:35:58,043 INFO L225 Difference]: With dead ends: 604 [2023-12-02 17:35:58,043 INFO L226 Difference]: Without dead ends: 599 [2023-12-02 17:35:58,044 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 626 ImplicationChecksByTransitivity, 26.9s TimeCoverageRelationStatistics Valid=385, Invalid=2370, Unknown=1, NotChecked=0, Total=2756 [2023-12-02 17:35:58,044 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 203 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 66 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2023-12-02 17:35:58,044 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 124 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 753 Invalid, 14 Unknown, 0 Unchecked, 3.1s Time] [2023-12-02 17:35:58,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2023-12-02 17:35:58,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 513. [2023-12-02 17:35:58,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 512 states have (on average 3.349609375) internal successors, (1715), 512 states have internal predecessors, (1715), 0 states have call successors, (0), 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-12-02 17:35:58,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 1715 transitions. [2023-12-02 17:35:58,057 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 1715 transitions. Word has length 21 [2023-12-02 17:35:58,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:35:58,057 INFO L495 AbstractCegarLoop]: Abstraction has 513 states and 1715 transitions. [2023-12-02 17:35:58,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.75) internal successors, (49), 28 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:35:58,057 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 1715 transitions. [2023-12-02 17:35:58,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-02 17:35:58,058 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:35:58,058 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:35:58,064 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2023-12-02 17:35:58,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-12-02 17:35:58,259 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-02 17:35:58,259 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:35:58,259 INFO L85 PathProgramCache]: Analyzing trace with hash 106670300, now seen corresponding path program 25 times [2023-12-02 17:35:58,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:35:58,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814707033] [2023-12-02 17:35:58,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:35:58,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:35:58,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:35:59,485 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:35:59,485 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:35:59,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814707033] [2023-12-02 17:35:59,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814707033] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:35:59,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1489594787] [2023-12-02 17:35:59,485 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-02 17:35:59,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:35:59,485 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:35:59,486 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:35:59,487 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2023-12-02 17:35:59,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:35:59,602 INFO L262 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 32 conjunts are in the unsatisfiable core [2023-12-02 17:35:59,604 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:36:00,373 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:36:00,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 263 treesize of output 179 [2023-12-02 17:36:01,522 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:36:01,522 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:36:03,091 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:36:03,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 916 treesize of output 450 [2023-12-02 17:36:42,995 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:36:42,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1489594787] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:36:42,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [14364373] [2023-12-02 17:36:42,995 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) 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.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) 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) [2023-12-02 17:36:42,996 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:36:42,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2023-12-02 17:36:42,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672549172] [2023-12-02 17:36:42,996 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:36:42,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-12-02 17:36:42,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:36:42,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-12-02 17:36:42,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=697, Unknown=0, NotChecked=0, Total=812 [2023-12-02 17:36:42,997 INFO L87 Difference]: Start difference. First operand 513 states and 1715 transitions. Second operand has 29 states, 29 states have (on average 1.7241379310344827) internal successors, (50), 28 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-12-02 17:36:45,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:36:45,718 INFO L93 Difference]: Finished difference Result 537 states and 1761 transitions. [2023-12-02 17:36:45,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-12-02 17:36:45,719 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.7241379310344827) internal successors, (50), 28 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) Word has length 21 [2023-12-02 17:36:45,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:36:45,723 INFO L225 Difference]: With dead ends: 537 [2023-12-02 17:36:45,723 INFO L226 Difference]: Without dead ends: 532 [2023-12-02 17:36:45,724 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=321, Invalid=1841, Unknown=0, NotChecked=0, Total=2162 [2023-12-02 17:36:45,724 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 168 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 704 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-02 17:36:45,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 105 Invalid, 717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 704 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-02 17:36:45,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2023-12-02 17:36:45,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 513. [2023-12-02 17:36:45,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 512 states have (on average 3.349609375) internal successors, (1715), 512 states have internal predecessors, (1715), 0 states have call successors, (0), 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-12-02 17:36:45,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 1715 transitions. [2023-12-02 17:36:45,737 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 1715 transitions. Word has length 21 [2023-12-02 17:36:45,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:36:45,737 INFO L495 AbstractCegarLoop]: Abstraction has 513 states and 1715 transitions. [2023-12-02 17:36:45,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.7241379310344827) internal successors, (50), 28 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-12-02 17:36:45,737 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 1715 transitions. [2023-12-02 17:36:45,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-02 17:36:45,739 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:36:45,739 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:36:45,745 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2023-12-02 17:36:45,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:36:45,939 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-02 17:36:45,940 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:36:45,940 INFO L85 PathProgramCache]: Analyzing trace with hash 2133930874, now seen corresponding path program 26 times [2023-12-02 17:36:45,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:36:45,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381087947] [2023-12-02 17:36:45,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:36:45,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:36:45,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:36:47,400 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:36:47,400 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:36:47,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381087947] [2023-12-02 17:36:47,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381087947] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:36:47,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [878302873] [2023-12-02 17:36:47,400 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 17:36:47,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:36:47,401 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:36:47,401 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:36:47,402 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2023-12-02 17:36:47,530 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-02 17:36:47,530 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 17:36:47,532 INFO L262 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 33 conjunts are in the unsatisfiable core [2023-12-02 17:36:47,535 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:36:48,578 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:36:48,579 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 217 treesize of output 141 [2023-12-02 17:36:48,795 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:36:48,796 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:36:50,626 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:36:50,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 978 treesize of output 434 [2023-12-02 17:37:09,185 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 17:37:09,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [878302873] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:37:09,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [376797198] [2023-12-02 17:37:09,186 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) 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.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) 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) [2023-12-02 17:37:09,186 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:37:09,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 9] total 28 [2023-12-02 17:37:09,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943071462] [2023-12-02 17:37:09,186 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:37:09,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-02 17:37:09,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:37:09,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-02 17:37:09,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=654, Unknown=0, NotChecked=0, Total=756 [2023-12-02 17:37:09,187 INFO L87 Difference]: Start difference. First operand 513 states and 1715 transitions. Second operand has 28 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 28 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-12-02 17:37:10,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:37:10,636 INFO L93 Difference]: Finished difference Result 562 states and 1847 transitions. [2023-12-02 17:37:10,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-02 17:37:10,636 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 28 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) Word has length 21 [2023-12-02 17:37:10,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:37:10,640 INFO L225 Difference]: With dead ends: 562 [2023-12-02 17:37:10,640 INFO L226 Difference]: Without dead ends: 557 [2023-12-02 17:37:10,640 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=192, Invalid=1214, Unknown=0, NotChecked=0, Total=1406 [2023-12-02 17:37:10,641 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 86 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-02 17:37:10,641 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 68 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-02 17:37:10,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2023-12-02 17:37:10,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 517. [2023-12-02 17:37:10,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 516 states have (on average 3.358527131782946) internal successors, (1733), 516 states have internal predecessors, (1733), 0 states have call successors, (0), 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-12-02 17:37:10,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 1733 transitions. [2023-12-02 17:37:10,651 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 1733 transitions. Word has length 21 [2023-12-02 17:37:10,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:37:10,651 INFO L495 AbstractCegarLoop]: Abstraction has 517 states and 1733 transitions. [2023-12-02 17:37:10,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 28 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-12-02 17:37:10,651 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 1733 transitions. [2023-12-02 17:37:10,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-02 17:37:10,652 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:37:10,653 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:37:10,657 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2023-12-02 17:37:10,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:37:10,853 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-02 17:37:10,853 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:37:10,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1867226946, now seen corresponding path program 27 times [2023-12-02 17:37:10,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:37:10,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714697897] [2023-12-02 17:37:10,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:37:10,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:37:10,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:37:11,664 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:37:11,664 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:37:11,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714697897] [2023-12-02 17:37:11,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714697897] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:37:11,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1388172041] [2023-12-02 17:37:11,665 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-02 17:37:11,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:37:11,665 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:37:11,666 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:37:11,667 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2023-12-02 17:37:11,796 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-02 17:37:11,796 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 17:37:11,798 INFO L262 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 41 conjunts are in the unsatisfiable core [2023-12-02 17:37:11,800 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:37:12,609 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:37:12,610 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 248 treesize of output 164 [2023-12-02 17:37:12,931 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:37:12,931 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:37:14,679 INFO L349 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2023-12-02 17:37:14,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 947 treesize of output 395 [2023-12-02 17:37:17,592 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 17:37:17,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1388172041] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:37:17,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [777127705] [2023-12-02 17:37:17,593 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) 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.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) 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) [2023-12-02 17:37:17,593 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:37:17,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 27 [2023-12-02 17:37:17,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785422661] [2023-12-02 17:37:17,594 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:37:17,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-12-02 17:37:17,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:37:17,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-12-02 17:37:17,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=587, Unknown=0, NotChecked=0, Total=702 [2023-12-02 17:37:17,595 INFO L87 Difference]: Start difference. First operand 517 states and 1733 transitions. Second operand has 27 states, 27 states have (on average 1.8518518518518519) internal successors, (50), 27 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-12-02 17:37:27,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:37:27,230 INFO L93 Difference]: Finished difference Result 701 states and 2178 transitions. [2023-12-02 17:37:27,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-12-02 17:37:27,231 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.8518518518518519) internal successors, (50), 27 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) Word has length 21 [2023-12-02 17:37:27,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:37:27,236 INFO L225 Difference]: With dead ends: 701 [2023-12-02 17:37:27,236 INFO L226 Difference]: Without dead ends: 696 [2023-12-02 17:37:27,237 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 911 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=543, Invalid=2649, Unknown=0, NotChecked=0, Total=3192 [2023-12-02 17:37:27,238 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 240 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-02 17:37:27,238 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 100 Invalid, 749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 689 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-02 17:37:27,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2023-12-02 17:37:27,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 559. [2023-12-02 17:37:27,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 558 states have (on average 3.4050179211469533) internal successors, (1900), 558 states have internal predecessors, (1900), 0 states have call successors, (0), 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-12-02 17:37:27,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 1900 transitions. [2023-12-02 17:37:27,257 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 1900 transitions. Word has length 21 [2023-12-02 17:37:27,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:37:27,257 INFO L495 AbstractCegarLoop]: Abstraction has 559 states and 1900 transitions. [2023-12-02 17:37:27,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.8518518518518519) internal successors, (50), 27 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-12-02 17:37:27,257 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 1900 transitions. [2023-12-02 17:37:27,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-02 17:37:27,259 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:37:27,259 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:37:27,265 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2023-12-02 17:37:27,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2023-12-02 17:37:27,460 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-02 17:37:27,460 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:37:27,460 INFO L85 PathProgramCache]: Analyzing trace with hash 138179612, now seen corresponding path program 28 times [2023-12-02 17:37:27,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:37:27,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633612221] [2023-12-02 17:37:27,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:37:27,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:37:27,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:37:28,434 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:37:28,434 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:37:28,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633612221] [2023-12-02 17:37:28,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633612221] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:37:28,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [432962971] [2023-12-02 17:37:28,435 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-02 17:37:28,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:37:28,435 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:37:28,436 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:37:28,436 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2023-12-02 17:37:28,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:37:28,547 INFO L262 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 33 conjunts are in the unsatisfiable core [2023-12-02 17:37:28,549 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:37:29,249 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:37:29,249 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 221 treesize of output 145 [2023-12-02 17:37:29,533 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:37:29,533 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:37:31,034 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:37:31,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 947 treesize of output 423 [2023-12-02 17:37:52,232 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 17:37:52,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [432962971] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:37:52,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1434478809] [2023-12-02 17:37:52,233 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) 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.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) 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) [2023-12-02 17:37:52,233 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:37:52,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 27 [2023-12-02 17:37:52,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113748749] [2023-12-02 17:37:52,234 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:37:52,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-12-02 17:37:52,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:37:52,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-12-02 17:37:52,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=606, Unknown=0, NotChecked=0, Total=702 [2023-12-02 17:37:52,235 INFO L87 Difference]: Start difference. First operand 559 states and 1900 transitions. Second operand has 27 states, 27 states have (on average 1.8518518518518519) internal successors, (50), 27 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-12-02 17:37:53,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:37:53,787 INFO L93 Difference]: Finished difference Result 606 states and 2027 transitions. [2023-12-02 17:37:53,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-12-02 17:37:53,788 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.8518518518518519) internal successors, (50), 27 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) Word has length 21 [2023-12-02 17:37:53,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:37:53,791 INFO L225 Difference]: With dead ends: 606 [2023-12-02 17:37:53,791 INFO L226 Difference]: Without dead ends: 601 [2023-12-02 17:37:53,792 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=206, Invalid=1276, Unknown=0, NotChecked=0, Total=1482 [2023-12-02 17:37:53,792 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 72 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 621 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-02 17:37:53,793 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 81 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 621 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-02 17:37:53,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2023-12-02 17:37:53,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 565. [2023-12-02 17:37:53,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 564 states have (on average 3.4131205673758864) internal successors, (1925), 564 states have internal predecessors, (1925), 0 states have call successors, (0), 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-12-02 17:37:53,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 1925 transitions. [2023-12-02 17:37:53,804 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 1925 transitions. Word has length 21 [2023-12-02 17:37:53,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:37:53,804 INFO L495 AbstractCegarLoop]: Abstraction has 565 states and 1925 transitions. [2023-12-02 17:37:53,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.8518518518518519) internal successors, (50), 27 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-12-02 17:37:53,804 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 1925 transitions. [2023-12-02 17:37:53,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-02 17:37:53,805 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:37:53,805 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:37:53,811 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2023-12-02 17:37:54,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2023-12-02 17:37:54,006 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-02 17:37:54,006 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:37:54,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1627584608, now seen corresponding path program 29 times [2023-12-02 17:37:54,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:37:54,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551699550] [2023-12-02 17:37:54,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:37:54,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:37:54,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:37:55,361 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:37:55,361 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:37:55,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551699550] [2023-12-02 17:37:55,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551699550] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:37:55,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [144358496] [2023-12-02 17:37:55,361 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 17:37:55,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:37:55,362 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:37:55,363 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:37:55,363 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2023-12-02 17:37:55,487 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-02 17:37:55,487 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 17:37:55,489 INFO L262 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 33 conjunts are in the unsatisfiable core [2023-12-02 17:37:55,491 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:37:56,427 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:37:56,427 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 217 treesize of output 141 [2023-12-02 17:37:56,644 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:37:56,645 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:37:58,525 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:37:58,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 947 treesize of output 423 [2023-12-02 17:38:17,696 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 17:38:17,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [144358496] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:38:17,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [312576674] [2023-12-02 17:38:17,697 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) 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.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) 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) [2023-12-02 17:38:17,697 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:38:17,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 27 [2023-12-02 17:38:17,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004992653] [2023-12-02 17:38:17,698 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:38:17,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-12-02 17:38:17,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:38:17,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-12-02 17:38:17,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=614, Unknown=0, NotChecked=0, Total=702 [2023-12-02 17:38:17,699 INFO L87 Difference]: Start difference. First operand 565 states and 1925 transitions. Second operand has 27 states, 27 states have (on average 1.8518518518518519) internal successors, (50), 27 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-12-02 17:38:19,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:38:19,464 INFO L93 Difference]: Finished difference Result 602 states and 2007 transitions. [2023-12-02 17:38:19,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-12-02 17:38:19,465 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.8518518518518519) internal successors, (50), 27 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) Word has length 21 [2023-12-02 17:38:19,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:38:19,470 INFO L225 Difference]: With dead ends: 602 [2023-12-02 17:38:19,471 INFO L226 Difference]: Without dead ends: 597 [2023-12-02 17:38:19,471 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=180, Invalid=1226, Unknown=0, NotChecked=0, Total=1406 [2023-12-02 17:38:19,472 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 79 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-02 17:38:19,472 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 82 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 625 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-02 17:38:19,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2023-12-02 17:38:19,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 565. [2023-12-02 17:38:19,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 564 states have (on average 3.4131205673758864) internal successors, (1925), 564 states have internal predecessors, (1925), 0 states have call successors, (0), 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-12-02 17:38:19,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 1925 transitions. [2023-12-02 17:38:19,490 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 1925 transitions. Word has length 21 [2023-12-02 17:38:19,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:38:19,490 INFO L495 AbstractCegarLoop]: Abstraction has 565 states and 1925 transitions. [2023-12-02 17:38:19,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.8518518518518519) internal successors, (50), 27 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-12-02 17:38:19,490 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 1925 transitions. [2023-12-02 17:38:19,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-02 17:38:19,492 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:38:19,492 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:38:19,498 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2023-12-02 17:38:19,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:38:19,693 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-02 17:38:19,693 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:38:19,693 INFO L85 PathProgramCache]: Analyzing trace with hash 554499228, now seen corresponding path program 30 times [2023-12-02 17:38:19,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:38:19,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137177668] [2023-12-02 17:38:19,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:38:19,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:38:19,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:38:20,857 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:38:20,858 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:38:20,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137177668] [2023-12-02 17:38:20,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137177668] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:38:20,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1615792666] [2023-12-02 17:38:20,858 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-02 17:38:20,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:38:20,858 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:38:20,859 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:38:20,860 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2023-12-02 17:38:20,988 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-02 17:38:20,988 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 17:38:20,990 INFO L262 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 41 conjunts are in the unsatisfiable core [2023-12-02 17:38:20,992 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:38:21,811 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:38:21,812 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 217 treesize of output 141 [2023-12-02 17:38:22,008 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:38:22,008 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:38:24,035 INFO L349 Elim1Store]: treesize reduction 40, result has 18.4 percent of original size [2023-12-02 17:38:24,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 947 treesize of output 395 [2023-12-02 17:38:26,580 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 17:38:26,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1615792666] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:38:26,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [856895894] [2023-12-02 17:38:26,580 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) 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.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) 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) [2023-12-02 17:38:26,581 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:38:26,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 26 [2023-12-02 17:38:26,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657838021] [2023-12-02 17:38:26,581 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:38:26,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-02 17:38:26,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:38:26,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-02 17:38:26,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=548, Unknown=0, NotChecked=0, Total=650 [2023-12-02 17:38:26,582 INFO L87 Difference]: Start difference. First operand 565 states and 1925 transitions. Second operand has 26 states, 26 states have (on average 1.8846153846153846) internal successors, (49), 26 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:38:34,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:38:34,392 INFO L93 Difference]: Finished difference Result 705 states and 2157 transitions. [2023-12-02 17:38:34,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-12-02 17:38:34,393 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.8846153846153846) internal successors, (49), 26 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-12-02 17:38:34,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:38:34,398 INFO L225 Difference]: With dead ends: 705 [2023-12-02 17:38:34,398 INFO L226 Difference]: Without dead ends: 695 [2023-12-02 17:38:34,399 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 458 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=308, Invalid=1584, Unknown=0, NotChecked=0, Total=1892 [2023-12-02 17:38:34,399 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 159 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-02 17:38:34,399 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 150 Invalid, 790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 740 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-02 17:38:34,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2023-12-02 17:38:34,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 577. [2023-12-02 17:38:34,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 576 states have (on average 3.373263888888889) internal successors, (1943), 576 states have internal predecessors, (1943), 0 states have call successors, (0), 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-12-02 17:38:34,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 1943 transitions. [2023-12-02 17:38:34,410 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 1943 transitions. Word has length 21 [2023-12-02 17:38:34,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:38:34,411 INFO L495 AbstractCegarLoop]: Abstraction has 577 states and 1943 transitions. [2023-12-02 17:38:34,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.8846153846153846) internal successors, (49), 26 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:38:34,411 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 1943 transitions. [2023-12-02 17:38:34,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-02 17:38:34,412 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:38:34,412 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:38:34,417 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2023-12-02 17:38:34,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:38:34,613 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-02 17:38:34,614 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:38:34,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1656831950, now seen corresponding path program 31 times [2023-12-02 17:38:34,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:38:34,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346125265] [2023-12-02 17:38:34,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:38:34,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:38:34,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:38:36,262 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:38:36,262 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:38:36,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346125265] [2023-12-02 17:38:36,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346125265] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:38:36,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1649164888] [2023-12-02 17:38:36,262 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-02 17:38:36,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:38:36,262 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:38:36,263 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:38:36,264 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2023-12-02 17:38:36,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:38:36,384 INFO L262 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 38 conjunts are in the unsatisfiable core [2023-12-02 17:38:36,386 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:38:36,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:38:36,699 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 55 treesize of output 42 [2023-12-02 17:38:37,406 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:38:37,407 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 211 treesize of output 139 [2023-12-02 17:38:37,577 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:38:37,578 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:38:40,367 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:38:40,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2484 treesize of output 1804 [2023-12-02 17:38:40,505 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:38:40,506 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 1664 treesize of output 1623 [2023-12-02 17:38:40,581 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:38:40,582 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 1604 treesize of output 1584 [2023-12-02 17:38:40,661 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:38:40,662 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 1565 treesize of output 1519 [2023-12-02 17:38:40,745 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:38:40,746 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 1500 treesize of output 1461 [2023-12-02 17:38:40,828 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:38:40,829 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 1442 treesize of output 1408 [2023-12-02 17:38:40,920 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:38:40,921 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 1389 treesize of output 1336 [2023-12-02 17:38:41,011 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:38:41,011 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 1317 treesize of output 1262 [2023-12-02 17:38:41,097 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:38:41,098 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 1243 treesize of output 1183 [2023-12-02 17:41:16,261 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 101 [2023-12-02 17:41:16,262 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2023-12-02 17:41:16,263 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") [2023-12-02 17:41:16,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1969628016] [2023-12-02 17:41:16,263 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) 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.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) 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) [2023-12-02 17:41:16,264 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-12-02 17:41:16,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2023-12-02 17:41:16,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439701809] [2023-12-02 17:41:16,264 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-12-02 17:41:16,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-02 17:41:16,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:41:16,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-02 17:41:16,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=714, Unknown=3, NotChecked=0, Total=812 [2023-12-02 17:41:16,265 INFO L87 Difference]: Start difference. First operand 577 states and 1943 transitions. Second operand has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 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-12-02 17:41:16,266 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=95, Invalid=714, Unknown=3, NotChecked=0, Total=812 [2023-12-02 17:41:16,266 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 17:41:16,267 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 17:41:16,272 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2023-12-02 17:41:16,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:41:16,467 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.convertIOException(Executor.java:337) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:177) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:139) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:117) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.pop(ManagedScript.java:138) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.unAssertCodeBlock(IncrementalHoareTripleChecker.java:436) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.clearAssertionStack(IncrementalHoareTripleChecker.java:278) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.releaseLock(IncrementalHoareTripleChecker.java:284) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ProtectedHtc.releaseLock(ChainingHoareTripleChecker.java:449) at java.base/java.util.ArrayList$ArrayListSpliterator.forEachRemaining(ArrayList.java:1655) at java.base/java.util.stream.ReferencePipeline$Head.forEach(ReferencePipeline.java:658) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker.releaseLock(ChainingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.releaseLock(CachingHoareTripleChecker.java:159) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.switchToReadonlyMode(AbstractInterpolantAutomaton.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.computeAutomataDifference(NwaCegarLoop.java:365) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.refineAbstraction(NwaCegarLoop.java:325) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) 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.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) 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: java.io.IOException: Stream closed at java.base/java.lang.ProcessBuilder$NullOutputStream.write(ProcessBuilder.java:442) at java.base/java.io.OutputStream.write(OutputStream.java:157) at java.base/java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:81) at java.base/java.io.BufferedOutputStream.flush(BufferedOutputStream.java:142) at java.base/sun.nio.cs.StreamEncoder.implFlush(StreamEncoder.java:318) at java.base/sun.nio.cs.StreamEncoder.flush(StreamEncoder.java:153) at java.base/java.io.OutputStreamWriter.flush(OutputStreamWriter.java:251) at java.base/java.io.BufferedWriter.flush(BufferedWriter.java:257) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:175) ... 36 more [2023-12-02 17:41:16,469 INFO L158 Benchmark]: Toolchain (without parser) took 619562.10ms. Allocated memory was 146.8MB in the beginning and 461.4MB in the end (delta: 314.6MB). Free memory was 102.9MB in the beginning and 120.9MB in the end (delta: -18.0MB). Peak memory consumption was 299.6MB. Max. memory is 16.1GB. [2023-12-02 17:41:16,469 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 100.7MB. Free memory is still 51.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 17:41:16,470 INFO L158 Benchmark]: CACSL2BoogieTranslator took 277.75ms. Allocated memory is still 146.8MB. Free memory was 102.5MB in the beginning and 90.4MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-12-02 17:41:16,470 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.76ms. Allocated memory is still 146.8MB. Free memory was 90.4MB in the beginning and 87.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 17:41:16,470 INFO L158 Benchmark]: Boogie Preprocessor took 41.94ms. Allocated memory is still 146.8MB. Free memory was 87.8MB in the beginning and 85.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 17:41:16,470 INFO L158 Benchmark]: RCFGBuilder took 1053.48ms. Allocated memory was 146.8MB in the beginning and 182.5MB in the end (delta: 35.7MB). Free memory was 85.7MB in the beginning and 136.7MB in the end (delta: -51.0MB). Peak memory consumption was 61.0MB. Max. memory is 16.1GB. [2023-12-02 17:41:16,470 INFO L158 Benchmark]: TraceAbstraction took 618130.45ms. Allocated memory was 182.5MB in the beginning and 461.4MB in the end (delta: 278.9MB). Free memory was 135.7MB in the beginning and 120.9MB in the end (delta: 14.8MB). Peak memory consumption was 295.8MB. Max. memory is 16.1GB. [2023-12-02 17:41:16,471 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 100.7MB. Free memory is still 51.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 277.75ms. Allocated memory is still 146.8MB. Free memory was 102.5MB in the beginning and 90.4MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.76ms. Allocated memory is still 146.8MB. Free memory was 90.4MB in the beginning and 87.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.94ms. Allocated memory is still 146.8MB. Free memory was 87.8MB in the beginning and 85.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1053.48ms. Allocated memory was 146.8MB in the beginning and 182.5MB in the end (delta: 35.7MB). Free memory was 85.7MB in the beginning and 136.7MB in the end (delta: -51.0MB). Peak memory consumption was 61.0MB. Max. memory is 16.1GB. * TraceAbstraction took 618130.45ms. Allocated memory was 182.5MB in the beginning and 461.4MB in the end (delta: 278.9MB). Free memory was 135.7MB in the beginning and 120.9MB in the end (delta: 14.8MB). Peak memory consumption was 295.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.convertIOException(Executor.java:337) RESULT: Ultimate could not prove your program: Toolchain returned no result. 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_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/config/TaipanReach.xml -i ../../sv-benchmarks/c/weaver/parallel-misc-1.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash faddac23864cc4e42f962ac43a8d0f59593853dbb1d55e3baabe0c76b2187dd4 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 17:41:18,232 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 17:41:18,311 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2023-12-02 17:41:18,318 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 17:41:18,318 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 17:41:18,347 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 17:41:18,348 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 17:41:18,349 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 17:41:18,350 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 17:41:18,351 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 17:41:18,351 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 17:41:18,352 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 17:41:18,352 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 17:41:18,353 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 17:41:18,354 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 17:41:18,354 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 17:41:18,355 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 17:41:18,356 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 17:41:18,356 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 17:41:18,357 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 17:41:18,357 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 17:41:18,358 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 17:41:18,358 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 17:41:18,359 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 17:41:18,359 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-02 17:41:18,360 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-02 17:41:18,360 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-02 17:41:18,361 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 17:41:18,362 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 17:41:18,362 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 17:41:18,363 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 17:41:18,363 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-02 17:41:18,363 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 17:41:18,364 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 17:41:18,364 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 17:41:18,364 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 17:41:18,364 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 17:41:18,365 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 17:41:18,365 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2023-12-02 17:41:18,365 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-02 17:41:18,365 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 17:41:18,366 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 17:41:18,366 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 17:41:18,366 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 17:41:18,367 INFO L153 SettingsManager]: * Logic for external solver=AUFBV 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_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/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_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh 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 -> Taipan 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 -> faddac23864cc4e42f962ac43a8d0f59593853dbb1d55e3baabe0c76b2187dd4 [2023-12-02 17:41:18,664 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 17:41:18,684 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 17:41:18,687 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 17:41:18,688 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 17:41:18,689 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 17:41:18,690 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/weaver/parallel-misc-1.wvr.c [2023-12-02 17:41:21,490 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 17:41:21,686 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 17:41:21,687 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/sv-benchmarks/c/weaver/parallel-misc-1.wvr.c [2023-12-02 17:41:21,694 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/data/b3f273966/007306ae905d4a3bb17f9c3f352adb58/FLAG09ba65dc6 [2023-12-02 17:41:21,706 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/data/b3f273966/007306ae905d4a3bb17f9c3f352adb58 [2023-12-02 17:41:21,708 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 17:41:21,709 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 17:41:21,711 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 17:41:21,711 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 17:41:21,715 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 17:41:21,716 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:41:21" (1/1) ... [2023-12-02 17:41:21,717 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b12a362 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:41:21, skipping insertion in model container [2023-12-02 17:41:21,718 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:41:21" (1/1) ... [2023-12-02 17:41:21,743 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 17:41:21,900 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_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/sv-benchmarks/c/weaver/parallel-misc-1.wvr.c[2781,2794] [2023-12-02 17:41:21,914 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 17:41:21,927 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-12-02 17:41:21,933 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 17:41:21,948 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_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/sv-benchmarks/c/weaver/parallel-misc-1.wvr.c[2781,2794] [2023-12-02 17:41:21,953 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 17:41:21,960 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 17:41:21,980 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_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/sv-benchmarks/c/weaver/parallel-misc-1.wvr.c[2781,2794] [2023-12-02 17:41:21,985 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 17:41:22,012 INFO L206 MainTranslator]: Completed translation [2023-12-02 17:41:22,013 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:41:22 WrapperNode [2023-12-02 17:41:22,013 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 17:41:22,015 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 17:41:22,015 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 17:41:22,015 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 17:41:22,023 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:41:22" (1/1) ... [2023-12-02 17:41:22,036 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:41:22" (1/1) ... [2023-12-02 17:41:22,096 INFO L138 Inliner]: procedures = 25, calls = 41, calls flagged for inlining = 17, calls inlined = 31, statements flattened = 271 [2023-12-02 17:41:22,098 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 17:41:22,099 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 17:41:22,100 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 17:41:22,100 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 17:41:22,109 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:41:22" (1/1) ... [2023-12-02 17:41:22,110 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:41:22" (1/1) ... [2023-12-02 17:41:22,127 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:41:22" (1/1) ... [2023-12-02 17:41:22,127 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:41:22" (1/1) ... [2023-12-02 17:41:22,140 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:41:22" (1/1) ... [2023-12-02 17:41:22,146 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:41:22" (1/1) ... [2023-12-02 17:41:22,149 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:41:22" (1/1) ... [2023-12-02 17:41:22,151 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:41:22" (1/1) ... [2023-12-02 17:41:22,156 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 17:41:22,157 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 17:41:22,157 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 17:41:22,157 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 17:41:22,158 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:41:22" (1/1) ... [2023-12-02 17:41:22,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 17:41:22,175 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:41:22,188 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 17:41:22,204 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 17:41:22,228 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 17:41:22,228 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-12-02 17:41:22,228 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-12-02 17:41:22,228 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-12-02 17:41:22,229 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-12-02 17:41:22,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-12-02 17:41:22,229 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-02 17:41:22,229 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-02 17:41:22,230 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-12-02 17:41:22,230 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 17:41:22,230 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 17:41:22,230 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 17:41:22,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-12-02 17:41:22,232 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-12-02 17:41:22,351 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 17:41:22,353 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 17:41:22,870 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 17:41:23,341 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 17:41:23,342 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-12-02 17:41:23,342 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:41:23 BoogieIcfgContainer [2023-12-02 17:41:23,342 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 17:41:23,345 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 17:41:23,345 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 17:41:23,348 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 17:41:23,349 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 05:41:21" (1/3) ... [2023-12-02 17:41:23,350 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a93e73d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 05:41:23, skipping insertion in model container [2023-12-02 17:41:23,350 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:41:22" (2/3) ... [2023-12-02 17:41:23,350 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a93e73d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 05:41:23, skipping insertion in model container [2023-12-02 17:41:23,351 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:41:23" (3/3) ... [2023-12-02 17:41:23,352 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-misc-1.wvr.c [2023-12-02 17:41:23,361 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-12-02 17:41:23,372 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 17:41:23,372 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-02 17:41:23,372 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-02 17:41:23,420 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-12-02 17:41:23,449 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 25 places, 21 transitions, 56 flow [2023-12-02 17:41:23,464 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 36 states, 35 states have (on average 2.1714285714285713) internal successors, (76), 35 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-12-02 17:41:23,483 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 17:41:23,489 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=FINITE_AUTOMATA, 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;@461fbc5e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 17:41:23,490 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-02 17:41:23,492 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 35 states have (on average 2.1714285714285713) internal successors, (76), 35 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-12-02 17:41:23,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-02 17:41:23,499 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:41:23,499 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:41:23,499 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-02 17:41:23,504 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:41:23,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1331850632, now seen corresponding path program 1 times [2023-12-02 17:41:23,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 17:41:23,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1893612219] [2023-12-02 17:41:23,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:41:23,519 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-12-02 17:41:23,519 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 17:41:23,522 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/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-12-02 17:41:23,534 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/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-12-02 17:41:23,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:41:23,717 INFO L262 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 17:41:23,723 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:41:23,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:41:23,942 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 17:41:23,943 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 17:41:23,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1893612219] [2023-12-02 17:41:23,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1893612219] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:41:23,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:41:23,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 17:41:23,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555327300] [2023-12-02 17:41:23,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:41:23,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 17:41:23,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 17:41:23,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 17:41:23,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-02 17:41:23,981 INFO L87 Difference]: Start difference. First operand has 36 states, 35 states have (on average 2.1714285714285713) internal successors, (76), 35 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) Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 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-12-02 17:41:24,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:41:24,280 INFO L93 Difference]: Finished difference Result 79 states and 191 transitions. [2023-12-02 17:41:24,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 17:41:24,283 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-12-02 17:41:24,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:41:24,292 INFO L225 Difference]: With dead ends: 79 [2023-12-02 17:41:24,293 INFO L226 Difference]: Without dead ends: 74 [2023-12-02 17:41:24,294 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-02 17:41:24,311 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 9 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 17:41:24,312 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 9 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 17:41:24,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2023-12-02 17:41:24,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 58. [2023-12-02 17:41:24,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 2.2280701754385963) internal successors, (127), 57 states have internal predecessors, (127), 0 states have call successors, (0), 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-12-02 17:41:24,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 127 transitions. [2023-12-02 17:41:24,350 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 127 transitions. Word has length 15 [2023-12-02 17:41:24,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:41:24,351 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 127 transitions. [2023-12-02 17:41:24,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 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-12-02 17:41:24,351 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 127 transitions. [2023-12-02 17:41:24,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-12-02 17:41:24,353 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:41:24,353 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:41:24,358 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/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-12-02 17:41:24,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/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-12-02 17:41:24,554 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-02 17:41:24,555 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:41:24,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1792048501, now seen corresponding path program 1 times [2023-12-02 17:41:24,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 17:41:24,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1186211600] [2023-12-02 17:41:24,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:41:24,556 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-12-02 17:41:24,556 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 17:41:24,557 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/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-12-02 17:41:24,558 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/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-12-02 17:41:24,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:41:24,696 INFO L262 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 17:41:24,698 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:41:24,796 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:41:24,796 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 17:41:24,796 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 17:41:24,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1186211600] [2023-12-02 17:41:24,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1186211600] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:41:24,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:41:24,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 17:41:24,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453835382] [2023-12-02 17:41:24,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:41:24,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 17:41:24,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 17:41:24,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 17:41:24,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 17:41:24,801 INFO L87 Difference]: Start difference. First operand 58 states and 127 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:41:25,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:41:25,062 INFO L93 Difference]: Finished difference Result 58 states and 121 transitions. [2023-12-02 17:41:25,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 17:41:25,063 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-12-02 17:41:25,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:41:25,064 INFO L225 Difference]: With dead ends: 58 [2023-12-02 17:41:25,064 INFO L226 Difference]: Without dead ends: 44 [2023-12-02 17:41:25,065 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-12-02 17:41:25,066 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 36 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 17:41:25,067 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 11 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 17:41:25,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-12-02 17:41:25,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2023-12-02 17:41:25,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 2.2093023255813953) internal successors, (95), 43 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:41:25,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 95 transitions. [2023-12-02 17:41:25,075 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 95 transitions. Word has length 16 [2023-12-02 17:41:25,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:41:25,075 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 95 transitions. [2023-12-02 17:41:25,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:41:25,076 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 95 transitions. [2023-12-02 17:41:25,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-12-02 17:41:25,077 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:41:25,077 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:41:25,082 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/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)] Forceful destruction successful, exit code 0 [2023-12-02 17:41:25,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/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-12-02 17:41:25,282 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-02 17:41:25,282 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:41:25,282 INFO L85 PathProgramCache]: Analyzing trace with hash -442211714, now seen corresponding path program 1 times [2023-12-02 17:41:25,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 17:41:25,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [371727844] [2023-12-02 17:41:25,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:41:25,283 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-12-02 17:41:25,283 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 17:41:25,284 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/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-12-02 17:41:25,285 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/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-12-02 17:41:25,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:41:25,469 INFO L262 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-02 17:41:25,471 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:41:25,544 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:41:25,544 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 17:41:25,545 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 17:41:25,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [371727844] [2023-12-02 17:41:25,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [371727844] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:41:25,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:41:25,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 17:41:25,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585983338] [2023-12-02 17:41:25,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:41:25,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 17:41:25,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 17:41:25,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 17:41:25,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 17:41:25,548 INFO L87 Difference]: Start difference. First operand 44 states and 95 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:41:25,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:41:25,766 INFO L93 Difference]: Finished difference Result 77 states and 157 transitions. [2023-12-02 17:41:25,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 17:41:25,766 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-12-02 17:41:25,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:41:25,768 INFO L225 Difference]: With dead ends: 77 [2023-12-02 17:41:25,768 INFO L226 Difference]: Without dead ends: 77 [2023-12-02 17:41:25,768 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 17:41:25,770 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 12 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 17:41:25,770 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 9 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 17:41:25,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-12-02 17:41:25,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 66. [2023-12-02 17:41:25,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 65 states have (on average 2.1538461538461537) internal successors, (140), 65 states have internal predecessors, (140), 0 states have call successors, (0), 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-12-02 17:41:25,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 140 transitions. [2023-12-02 17:41:25,780 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 140 transitions. Word has length 16 [2023-12-02 17:41:25,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:41:25,781 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 140 transitions. [2023-12-02 17:41:25,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:41:25,781 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 140 transitions. [2023-12-02 17:41:25,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-12-02 17:41:25,782 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:41:25,782 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:41:25,787 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/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)] Forceful destruction successful, exit code 0 [2023-12-02 17:41:25,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/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-12-02 17:41:25,983 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-02 17:41:25,984 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:41:25,984 INFO L85 PathProgramCache]: Analyzing trace with hash 637974307, now seen corresponding path program 2 times [2023-12-02 17:41:25,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 17:41:25,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1479241466] [2023-12-02 17:41:25,984 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 17:41:25,984 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-12-02 17:41:25,984 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 17:41:25,985 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/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-12-02 17:41:25,986 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/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-12-02 17:41:26,171 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 17:41:26,171 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 17:41:26,180 INFO L262 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-02 17:41:26,182 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:41:26,267 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:41:26,267 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 17:41:26,268 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 17:41:26,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1479241466] [2023-12-02 17:41:26,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1479241466] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:41:26,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:41:26,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 17:41:26,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233986120] [2023-12-02 17:41:26,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:41:26,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 17:41:26,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 17:41:26,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 17:41:26,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 17:41:26,271 INFO L87 Difference]: Start difference. First operand 66 states and 140 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:41:26,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:41:26,458 INFO L93 Difference]: Finished difference Result 58 states and 116 transitions. [2023-12-02 17:41:26,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 17:41:26,458 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-12-02 17:41:26,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:41:26,459 INFO L225 Difference]: With dead ends: 58 [2023-12-02 17:41:26,459 INFO L226 Difference]: Without dead ends: 45 [2023-12-02 17:41:26,460 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 17:41:26,461 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 1 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 17:41:26,462 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 9 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 17:41:26,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-12-02 17:41:26,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2023-12-02 17:41:26,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 2.1818181818181817) internal successors, (96), 44 states have internal predecessors, (96), 0 states have call successors, (0), 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-12-02 17:41:26,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 96 transitions. [2023-12-02 17:41:26,468 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 96 transitions. Word has length 16 [2023-12-02 17:41:26,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:41:26,468 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 96 transitions. [2023-12-02 17:41:26,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:41:26,469 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 96 transitions. [2023-12-02 17:41:26,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-02 17:41:26,470 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:41:26,470 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:41:26,475 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/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-12-02 17:41:26,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/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-12-02 17:41:26,671 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-02 17:41:26,671 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:41:26,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1448340491, now seen corresponding path program 1 times [2023-12-02 17:41:26,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 17:41:26,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [311874231] [2023-12-02 17:41:26,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:41:26,672 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-12-02 17:41:26,672 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 17:41:26,673 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/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-12-02 17:41:26,675 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/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-12-02 17:41:26,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:41:26,839 INFO L262 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-02 17:41:26,841 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:41:26,964 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 17:41:26,964 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:41:27,079 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 17:41:27,079 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 17:41:27,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [311874231] [2023-12-02 17:41:27,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [311874231] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:41:27,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1477575073] [2023-12-02 17:41:27,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:41:27,080 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 17:41:27,080 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 17:41:27,082 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 17:41:27,083 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2023-12-02 17:41:27,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:41:27,265 INFO L262 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-02 17:41:27,266 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:41:27,362 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 17:41:27,362 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:41:27,410 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 17:41:27,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1477575073] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:41:27,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [735581631] [2023-12-02 17:41:27,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:41:27,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:41:27,412 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:41:27,417 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:41:27,426 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-02 17:41:27,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:41:27,551 INFO L262 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-02 17:41:27,553 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:41:27,699 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 17:41:27,699 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:41:27,764 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 17:41:27,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [735581631] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-02 17:41:27,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 5 imperfect interpolant sequences. [2023-12-02 17:41:27,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4, 4, 4, 4] total 14 [2023-12-02 17:41:27,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655356572] [2023-12-02 17:41:27,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:41:27,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 17:41:27,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 17:41:27,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 17:41:27,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2023-12-02 17:41:27,766 INFO L87 Difference]: Start difference. First operand 45 states and 96 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:41:28,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:41:28,022 INFO L93 Difference]: Finished difference Result 62 states and 127 transitions. [2023-12-02 17:41:28,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 17:41:28,023 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-12-02 17:41:28,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:41:28,024 INFO L225 Difference]: With dead ends: 62 [2023-12-02 17:41:28,024 INFO L226 Difference]: Without dead ends: 62 [2023-12-02 17:41:28,025 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2023-12-02 17:41:28,026 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 15 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 17:41:28,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 9 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 17:41:28,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-12-02 17:41:28,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 51. [2023-12-02 17:41:28,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 2.2) internal successors, (110), 50 states have internal predecessors, (110), 0 states have call successors, (0), 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-12-02 17:41:28,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 110 transitions. [2023-12-02 17:41:28,033 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 110 transitions. Word has length 17 [2023-12-02 17:41:28,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:41:28,033 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 110 transitions. [2023-12-02 17:41:28,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:41:28,034 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 110 transitions. [2023-12-02 17:41:28,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-02 17:41:28,035 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:41:28,035 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:41:28,042 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-12-02 17:41:28,237 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (7)] Ended with exit code 0 [2023-12-02 17:41:28,439 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/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-12-02 17:41:28,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/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-12-02 17:41:28,636 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-02 17:41:28,636 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:41:28,636 INFO L85 PathProgramCache]: Analyzing trace with hash -368154470, now seen corresponding path program 1 times [2023-12-02 17:41:28,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 17:41:28,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1888559293] [2023-12-02 17:41:28,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:41:28,637 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-12-02 17:41:28,637 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 17:41:28,638 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/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-12-02 17:41:28,639 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/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-12-02 17:41:28,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:41:28,801 INFO L262 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-02 17:41:28,803 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:41:28,894 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:41:28,894 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:41:28,995 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:41:28,996 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 17:41:28,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1888559293] [2023-12-02 17:41:28,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1888559293] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:41:28,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [130128756] [2023-12-02 17:41:28,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:41:28,996 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 17:41:28,996 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 17:41:28,997 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 17:41:28,998 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2023-12-02 17:41:29,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:41:29,201 INFO L262 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-02 17:41:29,203 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:41:29,296 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:41:29,296 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:41:29,349 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:41:29,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [130128756] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:41:29,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1197997284] [2023-12-02 17:41:29,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:41:29,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:41:29,350 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:41:29,351 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:41:29,353 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-12-02 17:41:29,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:41:29,478 INFO L262 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-02 17:41:29,480 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:41:29,599 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 17:41:29,599 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 17:41:29,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1197997284] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:41:29,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 4 imperfect interpolant sequences. [2023-12-02 17:41:29,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4, 4, 4] total 12 [2023-12-02 17:41:29,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772379778] [2023-12-02 17:41:29,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:41:29,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 17:41:29,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 17:41:29,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 17:41:29,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2023-12-02 17:41:29,601 INFO L87 Difference]: Start difference. First operand 51 states and 110 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:41:29,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:41:29,813 INFO L93 Difference]: Finished difference Result 55 states and 120 transitions. [2023-12-02 17:41:29,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 17:41:29,814 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-12-02 17:41:29,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:41:29,815 INFO L225 Difference]: With dead ends: 55 [2023-12-02 17:41:29,815 INFO L226 Difference]: Without dead ends: 55 [2023-12-02 17:41:29,815 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2023-12-02 17:41:29,816 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 19 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 17:41:29,817 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 10 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 17:41:29,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-12-02 17:41:29,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2023-12-02 17:41:29,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 2.2222222222222223) internal successors, (120), 54 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:41:29,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 120 transitions. [2023-12-02 17:41:29,823 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 120 transitions. Word has length 17 [2023-12-02 17:41:29,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:41:29,824 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 120 transitions. [2023-12-02 17:41:29,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:41:29,825 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 120 transitions. [2023-12-02 17:41:29,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-02 17:41:29,826 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:41:29,826 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:41:29,835 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-12-02 17:41:30,029 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (10)] Ended with exit code 0 [2023-12-02 17:41:30,230 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/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-12-02 17:41:30,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/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-12-02 17:41:30,427 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-02 17:41:30,427 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:41:30,428 INFO L85 PathProgramCache]: Analyzing trace with hash -2078627394, now seen corresponding path program 1 times [2023-12-02 17:41:30,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 17:41:30,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1628734323] [2023-12-02 17:41:30,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:41:30,428 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-12-02 17:41:30,428 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 17:41:30,429 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/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-12-02 17:41:30,430 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/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 (12)] Waiting until timeout for monitored process [2023-12-02 17:41:30,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:41:30,839 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-02 17:41:30,842 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:41:30,872 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 26 treesize of output 24 [2023-12-02 17:41:30,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 8 treesize of output 1 [2023-12-02 17:41:31,216 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 34 treesize of output 23 [2023-12-02 17:41:31,358 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:41:31,359 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 304 treesize of output 128 [2023-12-02 17:41:31,701 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 17:41:31,701 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:41:35,129 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse10 (bvmul (_ bv4 32) c_~j~0))) (let ((.cse5 ((_ sign_extend 32) c_~bag2~0)) (.cse1 (bvadd (_ bv3 32) c_~A~0.offset .cse10)) (.cse2 (bvadd (_ bv2 32) c_~A~0.offset .cse10)) (.cse3 (bvadd c_~A~0.offset (_ bv1 32) .cse10)) (.cse4 (bvadd c_~A~0.offset .cse10))) (and (or (forall ((v_ArrVal_215 (Array (_ BitVec 32) (_ BitVec 8)))) (= (bvadd (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_215) c_~A~0.base))) (concat (concat (concat (select .cse0 .cse1) (select .cse0 .cse2)) (select .cse0 .cse3)) (select .cse0 .cse4))) c_~bag2~0 c_~sum2~0) c_~sum1~0)) (not (bvsge ((_ sign_extend 32) c_~sum2~0) (bvadd (_ bv18446744071562067968 64) (bvneg .cse5)))) (and (not (bvsle c_~sum2~0 (bvadd (bvneg c_~bag2~0) (_ bv2147483647 32)))) (not (bvsle c_~bag2~0 (_ bv0 32))))) (forall ((v_ArrVal_215 (Array (_ BitVec 32) (_ BitVec 8)))) (let ((.cse6 (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_215) c_~A~0.base))) (concat (concat (concat (select .cse7 .cse1) (select .cse7 .cse2)) (select .cse7 .cse3)) (select .cse7 .cse4))))) (or (not (bvsge .cse5 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse6))))) (= (_ bv2147483647 32) (bvadd .cse6 c_~bag2~0)) (= (bvadd .cse6 c_~bag2~0 c_~sum2~0) c_~sum1~0) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse6))))))) (forall ((v_ArrVal_215 (Array (_ BitVec 32) (_ BitVec 8)))) (let ((.cse8 (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_215) c_~A~0.base))) (concat (concat (concat (select .cse9 .cse1) (select .cse9 .cse2)) (select .cse9 .cse3)) (select .cse9 .cse4))))) (or (not (bvsle .cse8 (_ bv0 32))) (not (bvsge .cse5 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse8))))) (= (_ bv2147483647 32) (bvadd .cse8 c_~bag2~0)) (= (bvadd .cse8 c_~bag2~0 c_~sum2~0) c_~sum1~0))))))) is different from false [2023-12-02 17:41:35,387 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse11 (bvmul (_ bv4 32) c_~j~0))) (let ((.cse1 ((_ sign_extend 32) c_~bag2~0)) (.cse2 (bvadd c_~bag1~0 c_~sum1~0)) (.cse4 (bvadd (_ bv3 32) c_~A~0.offset .cse11)) (.cse5 (bvadd (_ bv2 32) c_~A~0.offset .cse11)) (.cse6 (bvadd c_~A~0.offset (_ bv1 32) .cse11)) (.cse7 (bvadd c_~A~0.offset .cse11))) (and (forall ((v_ArrVal_215 (Array (_ BitVec 32) (_ BitVec 8)))) (let ((.cse0 (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_215) c_~A~0.base))) (concat (concat (concat (select .cse3 .cse4) (select .cse3 .cse5)) (select .cse3 .cse6)) (select .cse3 .cse7))))) (or (not (bvsle .cse0 (_ bv0 32))) (not (bvsge .cse1 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse0))))) (= (_ bv2147483647 32) (bvadd .cse0 c_~bag2~0)) (= .cse2 (bvadd .cse0 c_~bag2~0 c_~sum2~0))))) (or (not (bvsge ((_ sign_extend 32) c_~sum2~0) (bvadd (_ bv18446744071562067968 64) (bvneg .cse1)))) (and (not (bvsle c_~sum2~0 (bvadd (bvneg c_~bag2~0) (_ bv2147483647 32)))) (not (bvsle c_~bag2~0 (_ bv0 32)))) (forall ((v_ArrVal_215 (Array (_ BitVec 32) (_ BitVec 8)))) (= .cse2 (bvadd (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_215) c_~A~0.base))) (concat (concat (concat (select .cse8 .cse4) (select .cse8 .cse5)) (select .cse8 .cse6)) (select .cse8 .cse7))) c_~bag2~0 c_~sum2~0)))) (forall ((v_ArrVal_215 (Array (_ BitVec 32) (_ BitVec 8)))) (let ((.cse9 (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_215) c_~A~0.base))) (concat (concat (concat (select .cse10 .cse4) (select .cse10 .cse5)) (select .cse10 .cse6)) (select .cse10 .cse7))))) (or (not (bvsge .cse1 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse9))))) (= (_ bv2147483647 32) (bvadd .cse9 c_~bag2~0)) (= .cse2 (bvadd .cse9 c_~bag2~0 c_~sum2~0)) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse9)))))))))) is different from false [2023-12-02 17:41:38,793 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:41:38,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 4219 treesize of output 3339 [2023-12-02 17:41:38,842 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:41:38,843 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 1175 treesize of output 993 [2023-12-02 17:41:38,891 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:41:38,891 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 874 treesize of output 762 [2023-12-02 17:41:38,937 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:41:38,939 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 762 treesize of output 650 [2023-12-02 17:41:39,009 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:41:39,010 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 650 treesize of output 622 [2023-12-02 17:41:39,530 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 17:41:39,541 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:41:39,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 341 treesize of output 1 [2023-12-02 17:41:39,545 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 17:41:39,550 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:41:39,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 130 treesize of output 1 [2023-12-02 17:41:39,555 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 17:41:39,563 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:41:39,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 335 treesize of output 1 [2023-12-02 17:41:39,623 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2023-12-02 17:41:39,623 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 17:41:39,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1628734323] [2023-12-02 17:41:39,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1628734323] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:41:39,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1175454888] [2023-12-02 17:41:39,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:41:39,623 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 17:41:39,624 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 17:41:39,624 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 17:41:39,625 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (13)] Waiting until timeout for monitored process [2023-12-02 17:41:40,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:41:40,098 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-02 17:41:40,101 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:41:40,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 8 [2023-12-02 17:41:40,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:41:40,770 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 17 treesize of output 12 [2023-12-02 17:41:41,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:41:41,205 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 42 treesize of output 29 [2023-12-02 17:41:41,401 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 0 case distinctions, treesize of input 312 treesize of output 132 [2023-12-02 17:41:42,820 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:41:42,820 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:41:43,870 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse10 (bvmul (_ bv4 32) c_~j~0))) (let ((.cse5 ((_ sign_extend 32) c_~bag2~0)) (.cse1 (bvadd (_ bv3 32) c_~A~0.offset .cse10)) (.cse2 (bvadd (_ bv2 32) c_~A~0.offset .cse10)) (.cse3 (bvadd c_~A~0.offset (_ bv1 32) .cse10)) (.cse4 (bvadd c_~A~0.offset .cse10))) (and (or (forall ((v_ArrVal_242 (Array (_ BitVec 32) (_ BitVec 8)))) (= (bvadd c_~bag2~0 (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_242) c_~A~0.base))) (concat (concat (concat (select .cse0 .cse1) (select .cse0 .cse2)) (select .cse0 .cse3)) (select .cse0 .cse4))) c_~sum2~0) c_~sum1~0)) (not (bvsge ((_ sign_extend 32) c_~sum2~0) (bvadd (_ bv18446744071562067968 64) (bvneg .cse5)))) (and (not (bvsle c_~sum2~0 (bvadd (bvneg c_~bag2~0) (_ bv2147483647 32)))) (not (bvsle c_~bag2~0 (_ bv0 32))))) (forall ((v_ArrVal_242 (Array (_ BitVec 32) (_ BitVec 8)))) (let ((.cse6 (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_242) c_~A~0.base))) (concat (concat (concat (select .cse7 .cse1) (select .cse7 .cse2)) (select .cse7 .cse3)) (select .cse7 .cse4))))) (or (= (bvadd c_~bag2~0 .cse6 c_~sum2~0) c_~sum1~0) (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse6)) (not (bvsge .cse5 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse6))))) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse6))))))) (forall ((v_ArrVal_242 (Array (_ BitVec 32) (_ BitVec 8)))) (let ((.cse8 (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_242) c_~A~0.base))) (concat (concat (concat (select .cse9 .cse1) (select .cse9 .cse2)) (select .cse9 .cse3)) (select .cse9 .cse4))))) (or (= (bvadd c_~bag2~0 .cse8 c_~sum2~0) c_~sum1~0) (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse8)) (not (bvsge .cse5 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse8))))) (not (bvsle .cse8 (_ bv0 32))))))))) is different from false [2023-12-02 17:41:44,098 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse11 (bvmul (_ bv4 32) c_~j~0))) (let ((.cse1 ((_ sign_extend 32) c_~bag2~0)) (.cse4 (bvadd (_ bv3 32) c_~A~0.offset .cse11)) (.cse5 (bvadd (_ bv2 32) c_~A~0.offset .cse11)) (.cse6 (bvadd c_~A~0.offset (_ bv1 32) .cse11)) (.cse7 (bvadd c_~A~0.offset .cse11)) (.cse2 (bvadd c_~bag1~0 c_~sum1~0))) (and (forall ((v_ArrVal_242 (Array (_ BitVec 32) (_ BitVec 8)))) (let ((.cse0 (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_242) c_~A~0.base))) (concat (concat (concat (select .cse3 .cse4) (select .cse3 .cse5)) (select .cse3 .cse6)) (select .cse3 .cse7))))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse0)) (not (bvsge .cse1 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse0))))) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse0)))) (= (bvadd c_~bag2~0 .cse0 c_~sum2~0) .cse2)))) (forall ((v_ArrVal_242 (Array (_ BitVec 32) (_ BitVec 8)))) (let ((.cse8 (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_242) c_~A~0.base))) (concat (concat (concat (select .cse9 .cse4) (select .cse9 .cse5)) (select .cse9 .cse6)) (select .cse9 .cse7))))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse8)) (not (bvsge .cse1 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse8))))) (= (bvadd c_~bag2~0 .cse8 c_~sum2~0) .cse2) (not (bvsle .cse8 (_ bv0 32)))))) (or (not (bvsge ((_ sign_extend 32) c_~sum2~0) (bvadd (_ bv18446744071562067968 64) (bvneg .cse1)))) (forall ((v_ArrVal_242 (Array (_ BitVec 32) (_ BitVec 8)))) (= (bvadd c_~bag2~0 (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_242) c_~A~0.base))) (concat (concat (concat (select .cse10 .cse4) (select .cse10 .cse5)) (select .cse10 .cse6)) (select .cse10 .cse7))) c_~sum2~0) .cse2)) (and (not (bvsle c_~sum2~0 (bvadd (bvneg c_~bag2~0) (_ bv2147483647 32)))) (not (bvsle c_~bag2~0 (_ bv0 32)))))))) is different from false [2023-12-02 17:41:47,338 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv3 32))) (.cse2 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv2 32))) (.cse3 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv1 32)))) (and (forall ((v_ArrVal_241 (Array (_ BitVec 32) (_ BitVec 8))) (v_ArrVal_215 (Array (_ BitVec 32) (_ BitVec 8)))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_241))) (= (let ((.cse0 (select (store .cse4 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_215) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (concat (concat (concat (select .cse0 .cse1) (select .cse0 .cse2)) (select .cse0 .cse3)) (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (concat (concat (concat (select .cse5 .cse1) (select .cse5 .cse2)) (select .cse5 .cse3)) (select .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (forall ((v_ArrVal_241 (Array (_ BitVec 32) (_ BitVec 8))) (v_ArrVal_215 (Array (_ BitVec 32) (_ BitVec 8)))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_241))) (let ((.cse6 (let ((.cse9 (select (store .cse8 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_215) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (concat (concat (concat (select .cse9 .cse1) (select .cse9 .cse2)) (select .cse9 .cse3)) (select .cse9 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) (or (not (bvsle .cse6 (_ bv0 32))) (= .cse6 (let ((.cse7 (select .cse8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (concat (concat (concat (select .cse7 .cse1) (select .cse7 .cse2)) (select .cse7 .cse3)) (select .cse7 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))))) (forall ((v_ArrVal_241 (Array (_ BitVec 32) (_ BitVec 8))) (v_ArrVal_215 (Array (_ BitVec 32) (_ BitVec 8)))) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_241))) (let ((.cse11 (let ((.cse14 (select (store .cse13 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_215) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (concat (concat (concat (select .cse14 .cse1) (select .cse14 .cse2)) (select .cse14 .cse3)) (select .cse14 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (.cse10 (let ((.cse12 (select .cse13 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (concat (concat (concat (select .cse12 .cse1) (select .cse12 .cse2)) (select .cse12 .cse3)) (select .cse12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) (or (not (bvsle (_ bv0 32) (bvadd (bvneg .cse10) (_ bv2147483647 32)))) (not (bvsle .cse11 (_ bv0 32))) (= .cse11 .cse10) (= (_ bv2147483647 32) .cse10))))) (forall ((v_ArrVal_241 (Array (_ BitVec 32) (_ BitVec 8))) (v_ArrVal_215 (Array (_ BitVec 32) (_ BitVec 8)))) (let ((.cse18 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_241))) (let ((.cse15 (let ((.cse19 (select (store .cse18 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_215) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (concat (concat (concat (select .cse19 .cse1) (select .cse19 .cse2)) (select .cse19 .cse3)) (select .cse19 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (.cse16 (let ((.cse17 (select .cse18 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (concat (concat (concat (select .cse17 .cse1) (select .cse17 .cse2)) (select .cse17 .cse3)) (select .cse17 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) (or (not (bvsle .cse15 (_ bv0 32))) (= .cse15 .cse16) (not (bvsle .cse16 (_ bv0 32))))))) (forall ((v_ArrVal_241 (Array (_ BitVec 32) (_ BitVec 8))) (v_ArrVal_215 (Array (_ BitVec 32) (_ BitVec 8)))) (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_241))) (let ((.cse20 (let ((.cse23 (select (store .cse22 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_215) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (concat (concat (concat (select .cse23 .cse1) (select .cse23 .cse2)) (select .cse23 .cse3)) (select .cse23 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) (or (= .cse20 (_ bv2147483647 32)) (not (bvsle (_ bv0 32) (bvadd (_ bv2147483647 32) (bvneg .cse20)))) (= .cse20 (let ((.cse21 (select .cse22 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (concat (concat (concat (select .cse21 .cse1) (select .cse21 .cse2)) (select .cse21 .cse3)) (select .cse21 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))))) (forall ((v_ArrVal_241 (Array (_ BitVec 32) (_ BitVec 8))) (v_ArrVal_215 (Array (_ BitVec 32) (_ BitVec 8)))) (let ((.cse27 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_241))) (let ((.cse25 (let ((.cse28 (select (store .cse27 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_215) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (concat (concat (concat (select .cse28 .cse1) (select .cse28 .cse2)) (select .cse28 .cse3)) (select .cse28 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (.cse24 (let ((.cse26 (select .cse27 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (concat (concat (concat (select .cse26 .cse1) (select .cse26 .cse2)) (select .cse26 .cse3)) (select .cse26 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) (or (not (bvsle (_ bv0 32) (bvadd (bvneg .cse24) (_ bv2147483647 32)))) (= .cse25 (_ bv2147483647 32)) (not (bvsle (_ bv0 32) (bvadd (_ bv2147483647 32) (bvneg .cse25)))) (= .cse25 .cse24) (= (_ bv2147483647 32) .cse24))))) (forall ((v_ArrVal_241 (Array (_ BitVec 32) (_ BitVec 8))) (v_ArrVal_215 (Array (_ BitVec 32) (_ BitVec 8)))) (let ((.cse30 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_241))) (let ((.cse31 (let ((.cse32 (select .cse30 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (concat (concat (concat (select .cse32 .cse1) (select .cse32 .cse2)) (select .cse32 .cse3)) (select .cse32 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) (or (= (let ((.cse29 (select (store .cse30 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_215) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (concat (concat (concat (select .cse29 .cse1) (select .cse29 .cse2)) (select .cse29 .cse3)) (select .cse29 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) .cse31) (not (bvsle .cse31 (_ bv0 32))))))) (forall ((v_ArrVal_241 (Array (_ BitVec 32) (_ BitVec 8))) (v_ArrVal_215 (Array (_ BitVec 32) (_ BitVec 8)))) (let ((.cse36 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_241))) (let ((.cse33 (let ((.cse37 (select (store .cse36 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_215) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (concat (concat (concat (select .cse37 .cse1) (select .cse37 .cse2)) (select .cse37 .cse3)) (select .cse37 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (.cse34 (let ((.cse35 (select .cse36 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (concat (concat (concat (select .cse35 .cse1) (select .cse35 .cse2)) (select .cse35 .cse3)) (select .cse35 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) (or (= .cse33 (_ bv2147483647 32)) (not (bvsle (_ bv0 32) (bvadd (_ bv2147483647 32) (bvneg .cse33)))) (= .cse33 .cse34) (not (bvsle .cse34 (_ bv0 32))))))) (forall ((v_ArrVal_241 (Array (_ BitVec 32) (_ BitVec 8))) (v_ArrVal_215 (Array (_ BitVec 32) (_ BitVec 8)))) (let ((.cse40 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_241))) (let ((.cse38 (let ((.cse41 (select .cse40 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (concat (concat (concat (select .cse41 .cse1) (select .cse41 .cse2)) (select .cse41 .cse3)) (select .cse41 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) (or (not (bvsle (_ bv0 32) (bvadd (bvneg .cse38) (_ bv2147483647 32)))) (= (let ((.cse39 (select (store .cse40 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_215) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (concat (concat (concat (select .cse39 .cse1) (select .cse39 .cse2)) (select .cse39 .cse3)) (select .cse39 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) .cse38) (= (_ bv2147483647 32) .cse38))))))) is different from false [2023-12-02 17:41:47,985 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:41:47,985 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 584 treesize of output 192 [2023-12-02 17:41:48,027 INFO L349 Elim1Store]: treesize reduction 33, result has 23.3 percent of original size [2023-12-02 17:41:48,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 806 treesize of output 609 [2023-12-02 17:41:48,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 64 [2023-12-02 17:41:48,055 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:41:48,055 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 83 treesize of output 55 [2023-12-02 17:41:48,153 INFO L349 Elim1Store]: treesize reduction 52, result has 1.9 percent of original size [2023-12-02 17:41:48,154 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 788 treesize of output 1 [2023-12-02 17:41:48,175 INFO L349 Elim1Store]: treesize reduction 52, result has 1.9 percent of original size [2023-12-02 17:41:48,176 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 1188 treesize of output 1 [2023-12-02 17:41:48,194 INFO L349 Elim1Store]: treesize reduction 52, result has 1.9 percent of original size [2023-12-02 17:41:48,194 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 778 treesize of output 1 [2023-12-02 17:41:48,210 INFO L349 Elim1Store]: treesize reduction 52, result has 1.9 percent of original size [2023-12-02 17:41:48,211 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 391 treesize of output 1 [2023-12-02 17:41:48,226 INFO L349 Elim1Store]: treesize reduction 52, result has 1.9 percent of original size [2023-12-02 17:41:48,226 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 596 treesize of output 1 [2023-12-02 17:41:48,243 INFO L349 Elim1Store]: treesize reduction 52, result has 1.9 percent of original size [2023-12-02 17:41:48,243 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 802 treesize of output 1 [2023-12-02 17:41:48,263 INFO L349 Elim1Store]: treesize reduction 52, result has 1.9 percent of original size [2023-12-02 17:41:48,263 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 982 treesize of output 1 [2023-12-02 17:41:48,281 INFO L349 Elim1Store]: treesize reduction 52, result has 1.9 percent of original size [2023-12-02 17:41:48,281 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 994 treesize of output 1 [2023-12-02 17:41:48,282 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-12-02 17:41:48,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1175454888] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:41:48,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1755265176] [2023-12-02 17:41:48,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:41:48,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:41:48,283 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:41:48,284 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:41:48,287 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_542fb2f7-f2b7-48cd-b4f4-fe375ed1e544/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-12-02 17:42:50,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:42:50,396 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-02 17:42:50,399 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:42:50,404 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 26 treesize of output 24 [2023-12-02 17:42:50,589 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 34 treesize of output 23 [2023-12-02 17:42:50,659 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:42:50,659 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 304 treesize of output 128 [2023-12-02 17:42:50,838 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 17:42:50,838 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:42:51,867 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse10 (bvmul (_ bv4 32) c_~j~0))) (let ((.cse1 ((_ sign_extend 32) c_~bag2~0)) (.cse3 (bvadd (_ bv3 32) c_~A~0.offset .cse10)) (.cse4 (bvadd (_ bv2 32) c_~A~0.offset .cse10)) (.cse5 (bvadd c_~A~0.offset (_ bv1 32) .cse10)) (.cse6 (bvadd c_~A~0.offset .cse10))) (and (forall ((v_ArrVal_266 (Array (_ BitVec 32) (_ BitVec 8)))) (let ((.cse0 (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_266) c_~A~0.base))) (concat (concat (concat (select .cse2 .cse3) (select .cse2 .cse4)) (select .cse2 .cse5)) (select .cse2 .cse6))))) (or (= (bvadd .cse0 c_~bag2~0 c_~sum2~0) c_~sum1~0) (= (_ bv2147483647 32) (bvadd .cse0 c_~bag2~0)) (not (bvsge .cse1 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse0))))) (not (bvsle .cse0 (_ bv0 32)))))) (forall ((v_ArrVal_266 (Array (_ BitVec 32) (_ BitVec 8)))) (let ((.cse7 (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_266) c_~A~0.base))) (concat (concat (concat (select .cse8 .cse3) (select .cse8 .cse4)) (select .cse8 .cse5)) (select .cse8 .cse6))))) (or (= (bvadd .cse7 c_~bag2~0 c_~sum2~0) c_~sum1~0) (= (_ bv2147483647 32) (bvadd .cse7 c_~bag2~0)) (not (bvsge .cse1 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse7))))) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse7))))))) (or (not (bvsge ((_ sign_extend 32) c_~sum2~0) (bvadd (_ bv18446744071562067968 64) (bvneg .cse1)))) (forall ((v_ArrVal_266 (Array (_ BitVec 32) (_ BitVec 8)))) (= (bvadd (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_266) c_~A~0.base))) (concat (concat (concat (select .cse9 .cse3) (select .cse9 .cse4)) (select .cse9 .cse5)) (select .cse9 .cse6))) c_~bag2~0 c_~sum2~0) c_~sum1~0)) (and (not (bvsle c_~sum2~0 (bvadd (bvneg c_~bag2~0) (_ bv2147483647 32)))) (not (bvsle c_~bag2~0 (_ bv0 32)))))))) is different from false [2023-12-02 17:42:52,109 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse11 (bvmul (_ bv4 32) c_~j~0))) (let ((.cse1 ((_ sign_extend 32) c_~bag2~0)) (.cse2 (bvadd c_~bag1~0 c_~sum1~0)) (.cse4 (bvadd (_ bv3 32) c_~A~0.offset .cse11)) (.cse5 (bvadd (_ bv2 32) c_~A~0.offset .cse11)) (.cse6 (bvadd c_~A~0.offset (_ bv1 32) .cse11)) (.cse7 (bvadd c_~A~0.offset .cse11))) (and (forall ((v_ArrVal_266 (Array (_ BitVec 32) (_ BitVec 8)))) (let ((.cse0 (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_266) c_~A~0.base))) (concat (concat (concat (select .cse3 .cse4) (select .cse3 .cse5)) (select .cse3 .cse6)) (select .cse3 .cse7))))) (or (= (_ bv2147483647 32) (bvadd .cse0 c_~bag2~0)) (not (bvsge .cse1 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse0))))) (= .cse2 (bvadd .cse0 c_~bag2~0 c_~sum2~0)) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse0))))))) (or (forall ((v_ArrVal_266 (Array (_ BitVec 32) (_ BitVec 8)))) (= .cse2 (bvadd (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_266) c_~A~0.base))) (concat (concat (concat (select .cse8 .cse4) (select .cse8 .cse5)) (select .cse8 .cse6)) (select .cse8 .cse7))) c_~bag2~0 c_~sum2~0))) (not (bvsge ((_ sign_extend 32) c_~sum2~0) (bvadd (_ bv18446744071562067968 64) (bvneg .cse1)))) (and (not (bvsle c_~sum2~0 (bvadd (bvneg c_~bag2~0) (_ bv2147483647 32)))) (not (bvsle c_~bag2~0 (_ bv0 32))))) (forall ((v_ArrVal_266 (Array (_ BitVec 32) (_ BitVec 8)))) (let ((.cse9 (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_266) c_~A~0.base))) (concat (concat (concat (select .cse10 .cse4) (select .cse10 .cse5)) (select .cse10 .cse6)) (select .cse10 .cse7))))) (or (= (_ bv2147483647 32) (bvadd .cse9 c_~bag2~0)) (not (bvsge .cse1 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse9))))) (= .cse2 (bvadd .cse9 c_~bag2~0 c_~sum2~0)) (not (bvsle .cse9 (_ bv0 32))))))))) is different from false [2023-12-02 17:42:52,713 INFO L349 Elim1Store]: treesize reduction 168, result has 22.6 percent of original size [2023-12-02 17:42:52,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 1201 treesize of output 794 [2023-12-02 17:42:52,809 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:42:52,810 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 587 treesize of output 560 [2023-12-02 17:42:52,897 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:42:52,897 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 560 treesize of output 452 [2023-12-02 17:42:52,982 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:42:52,983 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 452 treesize of output 344 [2023-12-02 17:44:15,630 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse23 ((_ sign_extend 32) c_~bag2~0)) (.cse10 (= c_~A~0.base |c_ULTIMATE.start_main_~#t2~0#1.base|)) (.cse2 ((_ sign_extend 32) c_~bag1~0))) (let ((.cse35 (and (not (bvsle c_~bag1~0 (_ bv0 32))) (not (bvsle c_~sum1~0 (bvadd (_ bv2147483647 32) (bvneg c_~bag1~0)))))) (.cse36 (not (bvsge ((_ sign_extend 32) c_~sum1~0) (bvadd (_ bv18446744071562067968 64) (bvneg .cse2))))) (.cse74 (= (bvmul (_ bv4 32) c_~i~0) (bvmul (_ bv4 32) c_~j~0))) (.cse6 (not .cse10)) (.cse11 (not (bvsge ((_ sign_extend 32) c_~sum2~0) (bvadd (_ bv18446744071562067968 64) (bvneg .cse23))))) (.cse12 (and (not (bvsle c_~sum2~0 (bvadd (bvneg c_~bag2~0) (_ bv2147483647 32)))) (not (bvsle c_~bag2~0 (_ bv0 32))))) (.cse80 (= (bvadd c_~bag2~0 c_~sum2~0) (bvadd c_~bag1~0 c_~sum1~0)))) (and (or (and (or (and (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse1 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (let ((.cse0 (bvadd c_~bag1~0 .cse1 c_~sum1~0))) (or (= .cse0 (bvadd c_~bag2~0 (concat (concat (concat v_arrayElimCell_72 v_arrayElimCell_73) v_arrayElimCell_74) v_arrayElimCell_75) c_~sum2~0)) (not (bvsle c_~bag1~0 (bvadd (_ bv2147483647 32) (bvneg .cse1)))) (= (_ bv2147483647 32) (bvadd c_~bag1~0 .cse1)) (= .cse0 (bvadd c_~bag2~0 c_~sum2~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse1))))))))) (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse4 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (let ((.cse3 (bvadd c_~bag1~0 .cse4 c_~sum1~0))) (or (= .cse3 (bvadd c_~bag2~0 (concat (concat (concat v_arrayElimCell_72 v_arrayElimCell_73) v_arrayElimCell_74) v_arrayElimCell_75) c_~sum2~0)) (= (_ bv2147483647 32) (bvadd c_~bag1~0 .cse4)) (not (bvsle .cse4 (_ bv0 32))) (= .cse3 (bvadd c_~bag2~0 c_~sum2~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse4))))))))) (or (forall ((v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse5 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (or (= (bvadd c_~bag1~0 .cse5 c_~sum1~0) (bvadd c_~bag2~0 (concat (concat (concat v_arrayElimCell_72 v_arrayElimCell_73) v_arrayElimCell_74) v_arrayElimCell_75) c_~sum2~0)) (= (_ bv2147483647 32) (bvadd c_~bag1~0 .cse5)) (not (bvsle .cse5 (_ bv0 32))) (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse5)))))))) .cse6) (or (forall ((v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse7 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (or (= (bvadd c_~bag1~0 .cse7 c_~sum1~0) (bvadd c_~bag2~0 (concat (concat (concat v_arrayElimCell_72 v_arrayElimCell_73) v_arrayElimCell_74) v_arrayElimCell_75) c_~sum2~0)) (not (bvsle c_~bag1~0 (bvadd (_ bv2147483647 32) (bvneg .cse7)))) (= (_ bv2147483647 32) (bvadd c_~bag1~0 .cse7)) (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse7)))))))) .cse6) (or (and (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8))) (let ((.cse8 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (or (not (bvsle c_~bag1~0 (bvadd (_ bv2147483647 32) (bvneg .cse8)))) (= (_ bv2147483647 32) (bvadd c_~bag1~0 .cse8)) (= (bvadd c_~bag1~0 .cse8 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse8)))))))) (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8))) (let ((.cse9 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (or (= (_ bv2147483647 32) (bvadd c_~bag1~0 .cse9)) (not (bvsle .cse9 (_ bv0 32))) (= (bvadd c_~bag1~0 .cse9 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse9))))))))) .cse10)) .cse11 .cse12) (or .cse11 .cse12 (and (or .cse10 (and (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8))) (let ((.cse13 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_66) v_arrayElimCell_64) v_arrayElimCell_70))) (or (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse13))))) (= (_ bv2147483647 32) (bvadd .cse13 c_~bag1~0)) (= (bvadd c_~bag2~0 c_~sum2~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70)) (bvadd .cse13 c_~bag1~0 c_~sum1~0)) (not (bvsle .cse13 (_ bv0 32)))))) (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8))) (let ((.cse14 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_66) v_arrayElimCell_64) v_arrayElimCell_70))) (or (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse14))))) (= (_ bv2147483647 32) (bvadd .cse14 c_~bag1~0)) (= (bvadd c_~bag2~0 c_~sum2~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70)) (bvadd .cse14 c_~bag1~0 c_~sum1~0)) (not (bvsle c_~bag1~0 (bvadd (bvneg .cse14) (_ bv2147483647 32))))))))) (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse15 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_66) v_arrayElimCell_64) v_arrayElimCell_70))) (let ((.cse16 (bvadd .cse15 c_~bag1~0 c_~sum1~0))) (or (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse15))))) (= (bvadd c_~bag2~0 (concat (concat (concat v_arrayElimCell_72 v_arrayElimCell_73) v_arrayElimCell_74) v_arrayElimCell_75) c_~sum2~0) .cse16) (= (_ bv2147483647 32) (bvadd .cse15 c_~bag1~0)) (= (bvadd c_~bag2~0 c_~sum2~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70)) .cse16) (not (bvsle .cse15 (_ bv0 32))))))) (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse17 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_66) v_arrayElimCell_64) v_arrayElimCell_70))) (let ((.cse18 (bvadd .cse17 c_~bag1~0 c_~sum1~0))) (or (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse17))))) (= (bvadd c_~bag2~0 (concat (concat (concat v_arrayElimCell_72 v_arrayElimCell_73) v_arrayElimCell_74) v_arrayElimCell_75) c_~sum2~0) .cse18) (= (_ bv2147483647 32) (bvadd .cse17 c_~bag1~0)) (= (bvadd c_~bag2~0 c_~sum2~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70)) .cse18) (not (bvsle c_~bag1~0 (bvadd (bvneg .cse17) (_ bv2147483647 32)))))))) (or (and (forall ((v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse19 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_66) v_arrayElimCell_64) v_arrayElimCell_70))) (or (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse19))))) (= (bvadd c_~bag2~0 (concat (concat (concat v_arrayElimCell_72 v_arrayElimCell_73) v_arrayElimCell_74) v_arrayElimCell_75) c_~sum2~0) (bvadd .cse19 c_~bag1~0 c_~sum1~0)) (= (_ bv2147483647 32) (bvadd .cse19 c_~bag1~0)) (not (bvsle .cse19 (_ bv0 32)))))) (forall ((v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse20 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_66) v_arrayElimCell_64) v_arrayElimCell_70))) (or (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse20))))) (= (bvadd c_~bag2~0 (concat (concat (concat v_arrayElimCell_72 v_arrayElimCell_73) v_arrayElimCell_74) v_arrayElimCell_75) c_~sum2~0) (bvadd .cse20 c_~bag1~0 c_~sum1~0)) (= (_ bv2147483647 32) (bvadd .cse20 c_~bag1~0)) (not (bvsle c_~bag1~0 (bvadd (bvneg .cse20) (_ bv2147483647 32)))))))) .cse6))) (or (and (forall ((v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_83 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8))) (let ((.cse21 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_81) v_arrayElimCell_82) v_arrayElimCell_83))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse21)) (forall ((v_arrayElimCell_69 (_ BitVec 8))) (let ((.cse22 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (or (not (bvsle c_~bag1~0 (bvadd (_ bv2147483647 32) (bvneg .cse22)))) (= (_ bv2147483647 32) (bvadd c_~bag1~0 .cse22)) (= (bvadd c_~bag1~0 .cse22 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse21)) (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse22)))))))) (not (bvsle .cse21 (_ bv0 32))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse21)))))))) (forall ((v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_83 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8))) (let ((.cse24 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_81) v_arrayElimCell_82) v_arrayElimCell_83))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse24)) (forall ((v_arrayElimCell_69 (_ BitVec 8))) (let ((.cse25 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (or (= (_ bv2147483647 32) (bvadd c_~bag1~0 .cse25)) (= (bvadd c_~bag1~0 .cse25 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse24)) (not (bvsle .cse25 (_ bv0 32))) (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse25)))))))) (not (bvsle .cse24 (_ bv0 32))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse24))))))))) .cse6) (or .cse6 (and (forall ((v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8))) (let ((.cse27 (concat (concat (concat v_arrayElimCell_76 v_arrayElimCell_77) v_arrayElimCell_78) v_arrayElimCell_79))) (or (forall ((v_arrayElimCell_64 (_ BitVec 8))) (let ((.cse26 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_66) v_arrayElimCell_64) v_arrayElimCell_70))) (or (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse26))))) (= (_ bv2147483647 32) (bvadd .cse26 c_~bag1~0)) (= (bvadd .cse27 c_~bag2~0 c_~sum2~0) (bvadd .cse26 c_~bag1~0 c_~sum1~0)) (not (bvsle .cse26 (_ bv0 32)))))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse27))))) (= (_ bv2147483647 32) (bvadd .cse27 c_~bag2~0)) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse27))))))) (forall ((v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8))) (let ((.cse29 (concat (concat (concat v_arrayElimCell_76 v_arrayElimCell_77) v_arrayElimCell_78) v_arrayElimCell_79))) (or (forall ((v_arrayElimCell_64 (_ BitVec 8))) (let ((.cse28 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_66) v_arrayElimCell_64) v_arrayElimCell_70))) (or (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse28))))) (= (_ bv2147483647 32) (bvadd .cse28 c_~bag1~0)) (= (bvadd .cse29 c_~bag2~0 c_~sum2~0) (bvadd .cse28 c_~bag1~0 c_~sum1~0)) (not (bvsle c_~bag1~0 (bvadd (bvneg .cse28) (_ bv2147483647 32))))))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse29))))) (= (_ bv2147483647 32) (bvadd .cse29 c_~bag2~0)) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse29))))))))) (or (and (or (and (or (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8))) (= (bvadd c_~bag1~0 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70) c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70)))) .cse10) (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse30 (bvadd c_~bag1~0 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70) c_~sum1~0))) (or (= .cse30 (bvadd c_~bag2~0 (concat (concat (concat v_arrayElimCell_72 v_arrayElimCell_73) v_arrayElimCell_74) v_arrayElimCell_75) c_~sum2~0)) (= .cse30 (bvadd c_~bag2~0 c_~sum2~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70)))))) (or (forall ((v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (= (bvadd c_~bag1~0 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70) c_~sum1~0) (bvadd c_~bag2~0 (concat (concat (concat v_arrayElimCell_72 v_arrayElimCell_73) v_arrayElimCell_74) v_arrayElimCell_75) c_~sum2~0))) .cse6)) .cse11 .cse12) (or (forall ((v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_83 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8))) (let ((.cse31 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_81) v_arrayElimCell_82) v_arrayElimCell_83))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse31)) (not (bvsle .cse31 (_ bv0 32))) (= (bvadd c_~bag1~0 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70) c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse31)) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse31)))))))) .cse6) (or (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8))) (let ((.cse32 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse32)) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse32))))) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse32)))) (= (bvadd c_~bag1~0 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70) c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse32))))) .cse10) (or (forall ((v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8))) (let ((.cse33 (concat (concat (concat v_arrayElimCell_76 v_arrayElimCell_77) v_arrayElimCell_78) v_arrayElimCell_79))) (or (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse33))))) (= (bvadd c_~bag1~0 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70) c_~sum1~0) (bvadd .cse33 c_~bag2~0 c_~sum2~0)) (= (_ bv2147483647 32) (bvadd .cse33 c_~bag2~0)) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse33))))))) .cse6) (or .cse10 (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8))) (let ((.cse34 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse34)) (not (bvsle .cse34 (_ bv0 32))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse34))))) (= (bvadd c_~bag1~0 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70) c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse34))))))) .cse35 .cse36) (or .cse10 (and (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8))) (let ((.cse37 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse37)) (not (bvsle .cse37 (_ bv0 32))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse37))))) (forall ((v_arrayElimCell_64 (_ BitVec 8))) (let ((.cse38 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_66) v_arrayElimCell_64) v_arrayElimCell_70))) (or (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse38))))) (= (_ bv2147483647 32) (bvadd .cse38 c_~bag1~0)) (= (bvadd c_~bag2~0 c_~sum2~0 .cse37) (bvadd .cse38 c_~bag1~0 c_~sum1~0)) (not (bvsle c_~bag1~0 (bvadd (bvneg .cse38) (_ bv2147483647 32)))))))))) (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8))) (let ((.cse39 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse39)) (not (bvsle .cse39 (_ bv0 32))) (forall ((v_arrayElimCell_64 (_ BitVec 8))) (let ((.cse40 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_66) v_arrayElimCell_64) v_arrayElimCell_70))) (or (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse40))))) (= (_ bv2147483647 32) (bvadd .cse40 c_~bag1~0)) (= (bvadd c_~bag2~0 c_~sum2~0 .cse39) (bvadd .cse40 c_~bag1~0 c_~sum1~0)) (not (bvsle .cse40 (_ bv0 32)))))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse39)))))))))) (or (and (forall ((v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_83 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8))) (let ((.cse41 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_81) v_arrayElimCell_82) v_arrayElimCell_83))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse41)) (forall ((v_arrayElimCell_64 (_ BitVec 8))) (let ((.cse42 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_66) v_arrayElimCell_64) v_arrayElimCell_70))) (or (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse42))))) (= (_ bv2147483647 32) (bvadd .cse42 c_~bag1~0)) (= (bvadd c_~bag2~0 c_~sum2~0 .cse41) (bvadd .cse42 c_~bag1~0 c_~sum1~0)) (not (bvsle .cse42 (_ bv0 32)))))) (not (bvsle .cse41 (_ bv0 32))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse41)))))))) (forall ((v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_83 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8))) (let ((.cse43 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_81) v_arrayElimCell_82) v_arrayElimCell_83))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse43)) (forall ((v_arrayElimCell_64 (_ BitVec 8))) (let ((.cse44 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_66) v_arrayElimCell_64) v_arrayElimCell_70))) (or (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse44))))) (= (_ bv2147483647 32) (bvadd .cse44 c_~bag1~0)) (= (bvadd c_~bag2~0 c_~sum2~0 .cse43) (bvadd .cse44 c_~bag1~0 c_~sum1~0)) (not (bvsle c_~bag1~0 (bvadd (bvneg .cse44) (_ bv2147483647 32))))))) (not (bvsle .cse43 (_ bv0 32))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse43))))))))) .cse6) (or .cse35 .cse36 (and (or .cse6 (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_83 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8))) (let ((.cse46 (bvadd (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_66) v_arrayElimCell_64) v_arrayElimCell_70) c_~bag1~0 c_~sum1~0)) (.cse45 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_81) v_arrayElimCell_82) v_arrayElimCell_83))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse45)) (= (bvadd c_~bag2~0 c_~sum2~0 .cse45) .cse46) (= (bvadd c_~bag2~0 c_~sum2~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70)) .cse46) (not (bvsle .cse45 (_ bv0 32))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse45))))))))) (or .cse11 .cse12 (and (or (forall ((v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (= (bvadd c_~bag2~0 (concat (concat (concat v_arrayElimCell_72 v_arrayElimCell_73) v_arrayElimCell_74) v_arrayElimCell_75) c_~sum2~0) (bvadd (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_66) v_arrayElimCell_64) v_arrayElimCell_70) c_~bag1~0 c_~sum1~0))) .cse6) (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse47 (bvadd (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_66) v_arrayElimCell_64) v_arrayElimCell_70) c_~bag1~0 c_~sum1~0))) (or (= (bvadd c_~bag2~0 (concat (concat (concat v_arrayElimCell_72 v_arrayElimCell_73) v_arrayElimCell_74) v_arrayElimCell_75) c_~sum2~0) .cse47) (forall ((v_arrayElimCell_69 (_ BitVec 8))) (= (bvadd c_~bag2~0 c_~sum2~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70)) .cse47))))) (or (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8))) (= (bvadd c_~bag2~0 c_~sum2~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70)) (bvadd (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_66) v_arrayElimCell_64) v_arrayElimCell_70) c_~bag1~0 c_~sum1~0))) .cse10))) (or .cse6 (forall ((v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8))) (let ((.cse48 (concat (concat (concat v_arrayElimCell_76 v_arrayElimCell_77) v_arrayElimCell_78) v_arrayElimCell_79))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (= (bvadd .cse48 c_~bag2~0 c_~sum2~0) (bvadd (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_66) v_arrayElimCell_64) v_arrayElimCell_70) c_~bag1~0 c_~sum1~0)) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse48))))) (= (_ bv2147483647 32) (bvadd .cse48 c_~bag2~0)) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse48)))))))) (or (forall ((v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_83 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8))) (let ((.cse49 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_81) v_arrayElimCell_82) v_arrayElimCell_83))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse49)) (= (bvadd c_~bag2~0 c_~sum2~0 .cse49) (bvadd (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_66) v_arrayElimCell_64) v_arrayElimCell_70) c_~bag1~0 c_~sum1~0)) (not (bvsle .cse49 (_ bv0 32))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse49)))))))) .cse6) (or (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8))) (let ((.cse50 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse50)) (not (bvsle .cse50 (_ bv0 32))) (= (bvadd c_~bag2~0 c_~sum2~0 .cse50) (bvadd (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_66) v_arrayElimCell_64) v_arrayElimCell_70) c_~bag1~0 c_~sum1~0)) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse50)))))))) .cse10) (or (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8))) (let ((.cse51 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse51)) (= (bvadd c_~bag2~0 c_~sum2~0 .cse51) (bvadd (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_66) v_arrayElimCell_64) v_arrayElimCell_70) c_~bag1~0 c_~sum1~0)) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse51))))) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse51))))))) .cse10) (or .cse6 (and (forall ((v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8))) (let ((.cse52 (concat (concat (concat v_arrayElimCell_76 v_arrayElimCell_77) v_arrayElimCell_78) v_arrayElimCell_79))) (or (= (bvadd .cse52 c_~bag2~0 c_~sum2~0) (bvadd (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_66) v_arrayElimCell_64) v_arrayElimCell_70) c_~bag1~0 c_~sum1~0)) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse52))))) (= (_ bv2147483647 32) (bvadd .cse52 c_~bag2~0)) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse52))))))) (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8))) (let ((.cse53 (bvadd (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_66) v_arrayElimCell_64) v_arrayElimCell_70) c_~bag1~0 c_~sum1~0)) (.cse54 (concat (concat (concat v_arrayElimCell_76 v_arrayElimCell_77) v_arrayElimCell_78) v_arrayElimCell_79))) (or (= (bvadd c_~bag2~0 c_~sum2~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70)) .cse53) (= (bvadd .cse54 c_~bag2~0 c_~sum2~0) .cse53) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse54))))) (= (_ bv2147483647 32) (bvadd .cse54 c_~bag2~0)) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse54))))))))) (or (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8))) (let ((.cse55 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70)) (.cse56 (bvadd (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_66) v_arrayElimCell_64) v_arrayElimCell_70) c_~bag1~0 c_~sum1~0)) (.cse57 (concat (concat (concat v_arrayElimCell_76 v_arrayElimCell_77) v_arrayElimCell_78) v_arrayElimCell_79))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse55)) (= (bvadd c_~bag2~0 c_~sum2~0 .cse55) .cse56) (= (bvadd .cse57 c_~bag2~0 c_~sum2~0) .cse56) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse57))))) (= (_ bv2147483647 32) (bvadd .cse57 c_~bag2~0)) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse57))))))) .cse6))) (or (and (forall ((v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8))) (let ((.cse59 (concat (concat (concat v_arrayElimCell_76 v_arrayElimCell_77) v_arrayElimCell_78) v_arrayElimCell_79))) (or (forall ((v_arrayElimCell_69 (_ BitVec 8))) (let ((.cse58 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (or (= (_ bv2147483647 32) (bvadd c_~bag1~0 .cse58)) (not (bvsle .cse58 (_ bv0 32))) (= (bvadd c_~bag1~0 .cse58 c_~sum1~0) (bvadd .cse59 c_~bag2~0 c_~sum2~0)) (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse58)))))))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse59))))) (= (_ bv2147483647 32) (bvadd .cse59 c_~bag2~0)) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse59))))))) (forall ((v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8))) (let ((.cse61 (concat (concat (concat v_arrayElimCell_76 v_arrayElimCell_77) v_arrayElimCell_78) v_arrayElimCell_79))) (or (forall ((v_arrayElimCell_69 (_ BitVec 8))) (let ((.cse60 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (or (not (bvsle c_~bag1~0 (bvadd (_ bv2147483647 32) (bvneg .cse60)))) (= (_ bv2147483647 32) (bvadd c_~bag1~0 .cse60)) (= (bvadd c_~bag1~0 .cse60 c_~sum1~0) (bvadd .cse61 c_~bag2~0 c_~sum2~0)) (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse60)))))))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse61))))) (= (_ bv2147483647 32) (bvadd .cse61 c_~bag2~0)) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse61)))))))) .cse6) (or (and (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8))) (let ((.cse62 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70)) (.cse63 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse62)) (not (bvsle .cse62 (_ bv0 32))) (= (_ bv2147483647 32) (bvadd c_~bag1~0 .cse63)) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse62))))) (not (bvsle .cse63 (_ bv0 32))) (= (bvadd c_~bag1~0 .cse63 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse62)) (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse63)))))))) (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8))) (let ((.cse64 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70)) (.cse65 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse64)) (not (bvsle c_~bag1~0 (bvadd (_ bv2147483647 32) (bvneg .cse65)))) (not (bvsle .cse64 (_ bv0 32))) (= (_ bv2147483647 32) (bvadd c_~bag1~0 .cse65)) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse64))))) (= (bvadd c_~bag1~0 .cse65 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse64)) (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse65))))))))) .cse10) (or (and (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8))) (let ((.cse66 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse66)) (forall ((v_arrayElimCell_64 (_ BitVec 8))) (let ((.cse67 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_66) v_arrayElimCell_64) v_arrayElimCell_70))) (or (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse67))))) (= (_ bv2147483647 32) (bvadd .cse67 c_~bag1~0)) (= (bvadd c_~bag2~0 c_~sum2~0 .cse66) (bvadd .cse67 c_~bag1~0 c_~sum1~0)) (not (bvsle .cse67 (_ bv0 32)))))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse66))))) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse66))))))) (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8))) (let ((.cse68 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse68)) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse68))))) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse68)))) (forall ((v_arrayElimCell_64 (_ BitVec 8))) (let ((.cse69 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_66) v_arrayElimCell_64) v_arrayElimCell_70))) (or (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse69))))) (= (_ bv2147483647 32) (bvadd .cse69 c_~bag1~0)) (= (bvadd c_~bag2~0 c_~sum2~0 .cse68) (bvadd .cse69 c_~bag1~0 c_~sum1~0)) (not (bvsle c_~bag1~0 (bvadd (bvneg .cse69) (_ bv2147483647 32))))))))))) .cse10) (or (and (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8))) (let ((.cse70 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70)) (.cse71 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse70)) (= (_ bv2147483647 32) (bvadd c_~bag1~0 .cse71)) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse70))))) (not (bvsle .cse71 (_ bv0 32))) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse70)))) (= (bvadd c_~bag1~0 .cse71 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse70)) (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse71)))))))) (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8))) (let ((.cse72 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70)) (.cse73 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse72)) (not (bvsle c_~bag1~0 (bvadd (_ bv2147483647 32) (bvneg .cse73)))) (= (_ bv2147483647 32) (bvadd c_~bag1~0 .cse73)) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse72))))) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse72)))) (= (bvadd c_~bag1~0 .cse73 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse72)) (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse73))))))))) .cse10)) .cse74) (or .cse6 (and (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_83 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8))) (let ((.cse75 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_81) v_arrayElimCell_82) v_arrayElimCell_83))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse75)) (not (bvsle .cse75 (_ bv0 32))) (forall ((v_arrayElimCell_69 (_ BitVec 8))) (let ((.cse76 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (or (= (bvadd c_~bag2~0 c_~sum2~0 .cse75) (bvadd c_~bag1~0 .cse76 c_~sum1~0)) (not (bvsle .cse76 (_ bv0 32))) (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse76))))) (= (_ bv2147483647 32) (bvadd c_~bag1~0 .cse76))))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse75)))))))) (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_83 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8))) (let ((.cse77 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_81) v_arrayElimCell_82) v_arrayElimCell_83))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse77)) (forall ((v_arrayElimCell_69 (_ BitVec 8))) (let ((.cse78 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (or (= (bvadd c_~bag2~0 c_~sum2~0 .cse77) (bvadd c_~bag1~0 .cse78 c_~sum1~0)) (not (bvsle c_~bag1~0 (bvadd (_ bv2147483647 32) (bvneg .cse78)))) (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse78))))) (= (_ bv2147483647 32) (bvadd c_~bag1~0 .cse78))))) (not (bvsle .cse77 (_ bv0 32))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse77)))))))))) (or (and (or (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8))) (let ((.cse79 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse79)) (not (bvsle .cse79 (_ bv0 32))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse79))))) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse79)))) (= (_ bv2147483647 32) (bvadd c_~bag1~0 .cse79))))) .cse80) (or (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8))) (let ((.cse81 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (let ((.cse82 (bvadd (_ bv2147483647 32) (bvneg .cse81)))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse81)) (not (bvsle c_~bag1~0 .cse82)) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse81))))) (not (bvsle c_~bag2~0 .cse82)) (= (_ bv2147483647 32) (bvadd c_~bag1~0 .cse81)))))) .cse80)) .cse10) (or .cse74 (and (or (and (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (let ((.cse83 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse83)) (not (bvsle .cse83 (_ bv0 32))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse83))))) (forall ((v_arrayElimCell_64 (_ BitVec 8))) (let ((.cse84 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_71) v_arrayElimCell_64) v_arrayElimCell_70))) (or (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse84))))) (= (_ bv2147483647 32) (bvadd .cse84 c_~bag1~0)) (= (bvadd .cse84 c_~bag1~0 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse83)) (not (bvsle .cse84 (_ bv0 32))))))))) (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (let ((.cse85 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse85)) (not (bvsle .cse85 (_ bv0 32))) (forall ((v_arrayElimCell_64 (_ BitVec 8))) (let ((.cse86 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_71) v_arrayElimCell_64) v_arrayElimCell_70))) (or (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse86))))) (not (bvsle c_~bag1~0 (bvadd (_ bv2147483647 32) (bvneg .cse86)))) (= (_ bv2147483647 32) (bvadd .cse86 c_~bag1~0)) (= (bvadd .cse86 c_~bag1~0 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse85))))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse85))))))))) .cse10) (or (and (forall ((v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (let ((.cse87 (concat (concat (concat v_arrayElimCell_76 v_arrayElimCell_77) v_arrayElimCell_78) v_arrayElimCell_79))) (or (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse87))))) (forall ((v_arrayElimCell_64 (_ BitVec 8))) (let ((.cse88 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_71) v_arrayElimCell_64) v_arrayElimCell_70))) (or (not (bvsle c_~bag1~0 (bvadd (_ bv2147483647 32) (bvneg .cse88)))) (= (_ bv2147483647 32) (bvadd c_~bag1~0 .cse88)) (not (bvsge .cse2 (bvadd (bvneg ((_ sign_extend 32) .cse88)) (_ bv18446744071562067968 64)))) (= (bvadd c_~bag1~0 .cse88 c_~sum1~0) (bvadd .cse87 c_~bag2~0 c_~sum2~0))))) (= (_ bv2147483647 32) (bvadd .cse87 c_~bag2~0)) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse87))))))) (forall ((v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (let ((.cse90 (concat (concat (concat v_arrayElimCell_76 v_arrayElimCell_77) v_arrayElimCell_78) v_arrayElimCell_79))) (or (forall ((v_arrayElimCell_64 (_ BitVec 8))) (let ((.cse89 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_71) v_arrayElimCell_64) v_arrayElimCell_70))) (or (= (_ bv2147483647 32) (bvadd c_~bag1~0 .cse89)) (not (bvsle .cse89 (_ bv0 32))) (not (bvsge .cse2 (bvadd (bvneg ((_ sign_extend 32) .cse89)) (_ bv18446744071562067968 64)))) (= (bvadd c_~bag1~0 .cse89 c_~sum1~0) (bvadd .cse90 c_~bag2~0 c_~sum2~0))))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse90))))) (= (_ bv2147483647 32) (bvadd .cse90 c_~bag2~0)) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse90)))))))) .cse6) (or (and (or (and (forall ((v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (let ((.cse91 (concat (concat (concat v_arrayElimCell_76 v_arrayElimCell_77) v_arrayElimCell_78) v_arrayElimCell_79))) (or (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse91))))) (= (_ bv2147483647 32) (bvadd .cse91 c_~bag2~0)) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse91)))) (= (bvadd c_~bag1~0 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_71) v_arrayElimCell_64) v_arrayElimCell_70) c_~sum1~0) (bvadd .cse91 c_~bag2~0 c_~sum2~0))))) (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (let ((.cse92 (bvadd c_~bag1~0 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_71) v_arrayElimCell_64) v_arrayElimCell_70) c_~sum1~0)) (.cse93 (concat (concat (concat v_arrayElimCell_76 v_arrayElimCell_77) v_arrayElimCell_78) v_arrayElimCell_79))) (or (= .cse92 (bvadd c_~bag2~0 c_~sum2~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse93))))) (= (_ bv2147483647 32) (bvadd .cse93 c_~bag2~0)) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse93)))) (= .cse92 (bvadd .cse93 c_~bag2~0 c_~sum2~0)))))) .cse6) (or (and (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse94 (bvadd c_~bag1~0 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_71) v_arrayElimCell_64) v_arrayElimCell_70) c_~sum1~0))) (or (= .cse94 (bvadd c_~bag2~0 (concat (concat (concat v_arrayElimCell_72 v_arrayElimCell_73) v_arrayElimCell_74) v_arrayElimCell_75) c_~sum2~0)) (forall ((v_arrayElimCell_69 (_ BitVec 8))) (= .cse94 (bvadd c_~bag2~0 c_~sum2~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))))))) (or (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (= (bvadd c_~bag1~0 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_71) v_arrayElimCell_64) v_arrayElimCell_70) c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70)))) .cse10) (or .cse6 (forall ((v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (= (bvadd c_~bag1~0 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_71) v_arrayElimCell_64) v_arrayElimCell_70) c_~sum1~0) (bvadd c_~bag2~0 (concat (concat (concat v_arrayElimCell_72 v_arrayElimCell_73) v_arrayElimCell_74) v_arrayElimCell_75) c_~sum2~0))))) .cse11 .cse12) (or .cse10 (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (let ((.cse95 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse95)) (= (bvadd c_~bag1~0 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_71) v_arrayElimCell_64) v_arrayElimCell_70) c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse95)) (not (bvsle .cse95 (_ bv0 32))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse95))))))))) (or .cse6 (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (let ((.cse96 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70)) (.cse97 (bvadd c_~bag1~0 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_71) v_arrayElimCell_64) v_arrayElimCell_70) c_~sum1~0)) (.cse98 (concat (concat (concat v_arrayElimCell_76 v_arrayElimCell_77) v_arrayElimCell_78) v_arrayElimCell_79))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse96)) (= .cse97 (bvadd c_~bag2~0 c_~sum2~0 .cse96)) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse98))))) (= (_ bv2147483647 32) (bvadd .cse98 c_~bag2~0)) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse98)))) (= .cse97 (bvadd .cse98 c_~bag2~0 c_~sum2~0)))))) (or (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (let ((.cse99 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse99)) (= (bvadd c_~bag1~0 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_71) v_arrayElimCell_64) v_arrayElimCell_70) c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse99)) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse99))))) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse99))))))) .cse10) (or (forall ((v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_83 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (let ((.cse100 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_81) v_arrayElimCell_82) v_arrayElimCell_83))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse100)) (not (bvsle .cse100 (_ bv0 32))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse100))))) (= (bvadd c_~bag1~0 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_71) v_arrayElimCell_64) v_arrayElimCell_70) c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse100))))) .cse6) (or (forall ((v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (let ((.cse101 (concat (concat (concat v_arrayElimCell_76 v_arrayElimCell_77) v_arrayElimCell_78) v_arrayElimCell_79))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse101))))) (= (_ bv2147483647 32) (bvadd .cse101 c_~bag2~0)) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse101)))) (= (bvadd c_~bag1~0 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_71) v_arrayElimCell_64) v_arrayElimCell_70) c_~sum1~0) (bvadd .cse101 c_~bag2~0 c_~sum2~0))))) .cse6) (or (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_83 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (let ((.cse103 (bvadd c_~bag1~0 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_71) v_arrayElimCell_64) v_arrayElimCell_70) c_~sum1~0)) (.cse102 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_81) v_arrayElimCell_82) v_arrayElimCell_83))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse102)) (= .cse103 (bvadd c_~bag2~0 c_~sum2~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (not (bvsle .cse102 (_ bv0 32))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse102))))) (= .cse103 (bvadd c_~bag2~0 c_~sum2~0 .cse102))))) .cse6)) .cse35 .cse36) (or (and (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (let ((.cse105 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_71) v_arrayElimCell_69) v_arrayElimCell_70)) (.cse104 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse104)) (= (_ bv2147483647 32) (bvadd c_~bag1~0 .cse105)) (not (bvsle c_~bag1~0 (bvadd (_ bv2147483647 32) (bvneg .cse105)))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse104))))) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse104)))) (= (bvadd c_~bag1~0 c_~sum1~0 .cse105) (bvadd c_~bag2~0 c_~sum2~0 .cse104))))) (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (let ((.cse107 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_71) v_arrayElimCell_69) v_arrayElimCell_70)) (.cse106 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse106)) (= (_ bv2147483647 32) (bvadd c_~bag1~0 .cse107)) (not (bvsle .cse107 (_ bv0 32))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse106))))) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse106)))) (= (bvadd c_~bag1~0 c_~sum1~0 .cse107) (bvadd c_~bag2~0 c_~sum2~0 .cse106)))))) .cse10) (or (and (or (and (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (let ((.cse108 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_71) v_arrayElimCell_64) v_arrayElimCell_70))) (or (= (bvadd c_~bag1~0 .cse108 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (= (_ bv2147483647 32) (bvadd c_~bag1~0 .cse108)) (not (bvsle .cse108 (_ bv0 32))) (not (bvsge .cse2 (bvadd (bvneg ((_ sign_extend 32) .cse108)) (_ bv18446744071562067968 64))))))) (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (let ((.cse109 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_71) v_arrayElimCell_64) v_arrayElimCell_70))) (or (not (bvsle c_~bag1~0 (bvadd (_ bv2147483647 32) (bvneg .cse109)))) (= (bvadd c_~bag1~0 .cse109 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (= (_ bv2147483647 32) (bvadd c_~bag1~0 .cse109)) (not (bvsge .cse2 (bvadd (bvneg ((_ sign_extend 32) .cse109)) (_ bv18446744071562067968 64)))))))) .cse10) (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse111 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_71) v_arrayElimCell_64) v_arrayElimCell_70))) (let ((.cse110 (bvadd c_~bag1~0 .cse111 c_~sum1~0))) (or (= .cse110 (bvadd c_~bag2~0 c_~sum2~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (= (_ bv2147483647 32) (bvadd c_~bag1~0 .cse111)) (not (bvsle .cse111 (_ bv0 32))) (not (bvsge .cse2 (bvadd (bvneg ((_ sign_extend 32) .cse111)) (_ bv18446744071562067968 64)))) (= .cse110 (bvadd c_~bag2~0 (concat (concat (concat v_arrayElimCell_72 v_arrayElimCell_73) v_arrayElimCell_74) v_arrayElimCell_75) c_~sum2~0)))))) (or (and (forall ((v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse112 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_71) v_arrayElimCell_64) v_arrayElimCell_70))) (or (not (bvsle c_~bag1~0 (bvadd (_ bv2147483647 32) (bvneg .cse112)))) (= (_ bv2147483647 32) (bvadd c_~bag1~0 .cse112)) (not (bvsge .cse2 (bvadd (bvneg ((_ sign_extend 32) .cse112)) (_ bv18446744071562067968 64)))) (= (bvadd c_~bag1~0 .cse112 c_~sum1~0) (bvadd c_~bag2~0 (concat (concat (concat v_arrayElimCell_72 v_arrayElimCell_73) v_arrayElimCell_74) v_arrayElimCell_75) c_~sum2~0))))) (forall ((v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse113 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_71) v_arrayElimCell_64) v_arrayElimCell_70))) (or (= (_ bv2147483647 32) (bvadd c_~bag1~0 .cse113)) (not (bvsle .cse113 (_ bv0 32))) (not (bvsge .cse2 (bvadd (bvneg ((_ sign_extend 32) .cse113)) (_ bv18446744071562067968 64)))) (= (bvadd c_~bag1~0 .cse113 c_~sum1~0) (bvadd c_~bag2~0 (concat (concat (concat v_arrayElimCell_72 v_arrayElimCell_73) v_arrayElimCell_74) v_arrayElimCell_75) c_~sum2~0)))))) .cse6) (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse114 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_71) v_arrayElimCell_64) v_arrayElimCell_70))) (let ((.cse115 (bvadd c_~bag1~0 .cse114 c_~sum1~0))) (or (not (bvsle c_~bag1~0 (bvadd (_ bv2147483647 32) (bvneg .cse114)))) (= .cse115 (bvadd c_~bag2~0 c_~sum2~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (= (_ bv2147483647 32) (bvadd c_~bag1~0 .cse114)) (not (bvsge .cse2 (bvadd (bvneg ((_ sign_extend 32) .cse114)) (_ bv18446744071562067968 64)))) (= .cse115 (bvadd c_~bag2~0 (concat (concat (concat v_arrayElimCell_72 v_arrayElimCell_73) v_arrayElimCell_74) v_arrayElimCell_75) c_~sum2~0))))))) .cse11 .cse12) (or (and (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (let ((.cse116 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse116)) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse116))))) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse116)))) (forall ((v_arrayElimCell_64 (_ BitVec 8))) (let ((.cse117 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_71) v_arrayElimCell_64) v_arrayElimCell_70))) (or (not (bvsle c_~bag1~0 (bvadd (_ bv2147483647 32) (bvneg .cse117)))) (= (bvadd c_~bag1~0 .cse117 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse116)) (= (_ bv2147483647 32) (bvadd c_~bag1~0 .cse117)) (not (bvsge .cse2 (bvadd (bvneg ((_ sign_extend 32) .cse117)) (_ bv18446744071562067968 64)))))))))) (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (let ((.cse118 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse118)) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse118))))) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse118)))) (forall ((v_arrayElimCell_64 (_ BitVec 8))) (let ((.cse119 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_71) v_arrayElimCell_64) v_arrayElimCell_70))) (or (= (bvadd c_~bag1~0 .cse119 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse118)) (= (_ bv2147483647 32) (bvadd c_~bag1~0 .cse119)) (not (bvsle .cse119 (_ bv0 32))) (not (bvsge .cse2 (bvadd (bvneg ((_ sign_extend 32) .cse119)) (_ bv18446744071562067968 64))))))))))) .cse10) (or .cse10 (and (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (let ((.cse121 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_71) v_arrayElimCell_69) v_arrayElimCell_70)) (.cse120 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse120)) (not (bvsle .cse120 (_ bv0 32))) (= (_ bv2147483647 32) (bvadd c_~bag1~0 .cse121)) (not (bvsle c_~bag1~0 (bvadd (_ bv2147483647 32) (bvneg .cse121)))) (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse121))))) (= (bvadd c_~bag1~0 c_~sum1~0 .cse121) (bvadd c_~bag2~0 c_~sum2~0 .cse120))))) (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (let ((.cse123 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_71) v_arrayElimCell_69) v_arrayElimCell_70)) (.cse122 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse122)) (not (bvsle .cse122 (_ bv0 32))) (= (_ bv2147483647 32) (bvadd c_~bag1~0 .cse123)) (not (bvsle .cse123 (_ bv0 32))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse122))))) (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse123))))) (= (bvadd c_~bag1~0 c_~sum1~0 .cse123) (bvadd c_~bag2~0 c_~sum2~0 .cse122))))))) (or (and (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (let ((.cse125 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70)) (.cse124 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_71) v_arrayElimCell_69) v_arrayElimCell_70))) (or (= (_ bv2147483647 32) (bvadd c_~bag1~0 .cse124)) (not (bvsle c_~bag1~0 (bvadd (_ bv2147483647 32) (bvneg .cse124)))) (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse125)) (not (bvsle .cse125 (_ bv0 32))) (= (bvadd c_~bag1~0 .cse124 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse125)) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse125))))) (not (bvsge .cse2 (bvadd (bvneg ((_ sign_extend 32) .cse124)) (_ bv18446744071562067968 64))))))) (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (let ((.cse127 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70)) (.cse126 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_71) v_arrayElimCell_69) v_arrayElimCell_70))) (or (= (_ bv2147483647 32) (bvadd c_~bag1~0 .cse126)) (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse127)) (not (bvsle .cse126 (_ bv0 32))) (not (bvsle .cse127 (_ bv0 32))) (= (bvadd c_~bag1~0 .cse126 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse127)) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse127))))) (not (bvsge .cse2 (bvadd (bvneg ((_ sign_extend 32) .cse126)) (_ bv18446744071562067968 64)))))))) .cse10) (or (and (forall ((v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (let ((.cse129 (concat (concat (concat v_arrayElimCell_76 v_arrayElimCell_77) v_arrayElimCell_78) v_arrayElimCell_79))) (or (forall ((v_arrayElimCell_69 (_ BitVec 8))) (let ((.cse128 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_71) v_arrayElimCell_69) v_arrayElimCell_70))) (or (= (_ bv2147483647 32) (bvadd c_~bag1~0 .cse128)) (not (bvsle c_~bag1~0 (bvadd (_ bv2147483647 32) (bvneg .cse128)))) (= (bvadd .cse129 c_~bag2~0 c_~sum2~0) (bvadd c_~bag1~0 .cse128 c_~sum1~0)) (not (bvsge .cse2 (bvadd (bvneg ((_ sign_extend 32) .cse128)) (_ bv18446744071562067968 64))))))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse129))))) (= (_ bv2147483647 32) (bvadd .cse129 c_~bag2~0)) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse129))))))) (forall ((v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (let ((.cse131 (concat (concat (concat v_arrayElimCell_76 v_arrayElimCell_77) v_arrayElimCell_78) v_arrayElimCell_79))) (or (forall ((v_arrayElimCell_69 (_ BitVec 8))) (let ((.cse130 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_71) v_arrayElimCell_69) v_arrayElimCell_70))) (or (= (_ bv2147483647 32) (bvadd c_~bag1~0 .cse130)) (not (bvsle .cse130 (_ bv0 32))) (= (bvadd .cse131 c_~bag2~0 c_~sum2~0) (bvadd c_~bag1~0 .cse130 c_~sum1~0)) (not (bvsge .cse2 (bvadd (bvneg ((_ sign_extend 32) .cse130)) (_ bv18446744071562067968 64))))))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse131))))) (= (_ bv2147483647 32) (bvadd .cse131 c_~bag2~0)) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse131)))))))) .cse6) (or (and (or (forall ((v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (let ((.cse132 (concat (concat (concat v_arrayElimCell_76 v_arrayElimCell_77) v_arrayElimCell_78) v_arrayElimCell_79))) (or (= (bvadd .cse132 c_~bag2~0 c_~sum2~0) (bvadd c_~bag1~0 c_~sum1~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_71) v_arrayElimCell_69) v_arrayElimCell_70))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse132))))) (= (_ bv2147483647 32) (bvadd .cse132 c_~bag2~0)) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse132))))))) .cse6) (or (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (let ((.cse133 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse133)) (not (bvsle .cse133 (_ bv0 32))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse133))))) (= (bvadd c_~bag1~0 c_~sum1~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_71) v_arrayElimCell_69) v_arrayElimCell_70)) (bvadd c_~bag2~0 c_~sum2~0 .cse133))))) .cse10) (or (and (or (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (= (bvadd c_~bag2~0 (concat (concat (concat v_arrayElimCell_72 v_arrayElimCell_73) v_arrayElimCell_74) v_arrayElimCell_75) c_~sum2~0) (bvadd c_~bag1~0 c_~sum1~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_71) v_arrayElimCell_69) v_arrayElimCell_70)))) .cse6) (or (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (= (bvadd c_~bag1~0 c_~sum1~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_71) v_arrayElimCell_69) v_arrayElimCell_70)) (bvadd c_~bag2~0 c_~sum2~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70)))) .cse10) (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse134 (bvadd c_~bag1~0 c_~sum1~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_71) v_arrayElimCell_69) v_arrayElimCell_70)))) (or (= (bvadd c_~bag2~0 (concat (concat (concat v_arrayElimCell_72 v_arrayElimCell_73) v_arrayElimCell_74) v_arrayElimCell_75) c_~sum2~0) .cse134) (= .cse134 (bvadd c_~bag2~0 c_~sum2~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))))))) .cse11 .cse12) (or .cse6 (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_83 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8))) (let ((.cse135 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_81) v_arrayElimCell_82) v_arrayElimCell_83))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse135)) (not (bvsle .cse135 (_ bv0 32))) (= (bvadd c_~bag2~0 c_~sum2~0 .cse135) (bvadd c_~bag1~0 c_~sum1~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_71) v_arrayElimCell_69) v_arrayElimCell_70))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse135))))))))) (or (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (let ((.cse136 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse136)) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse136))))) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse136)))) (= (bvadd c_~bag1~0 c_~sum1~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_71) v_arrayElimCell_69) v_arrayElimCell_70)) (bvadd c_~bag2~0 c_~sum2~0 .cse136))))) .cse10)) .cse35 .cse36) (or (and (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (let ((.cse138 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70)) (.cse137 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_71) v_arrayElimCell_69) v_arrayElimCell_70))) (or (= (_ bv2147483647 32) (bvadd c_~bag1~0 .cse137)) (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse138)) (not (bvsle .cse137 (_ bv0 32))) (= (bvadd c_~bag1~0 .cse137 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse138)) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse138))))) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse138)))) (not (bvsge .cse2 (bvadd (bvneg ((_ sign_extend 32) .cse137)) (_ bv18446744071562067968 64))))))) (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (let ((.cse140 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70)) (.cse139 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_71) v_arrayElimCell_69) v_arrayElimCell_70))) (or (= (_ bv2147483647 32) (bvadd c_~bag1~0 .cse139)) (not (bvsle c_~bag1~0 (bvadd (_ bv2147483647 32) (bvneg .cse139)))) (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse140)) (= (bvadd c_~bag1~0 .cse139 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse140)) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse140))))) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse140)))) (not (bvsge .cse2 (bvadd (bvneg ((_ sign_extend 32) .cse139)) (_ bv18446744071562067968 64)))))))) .cse10) (or (and (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (let ((.cse141 (concat (concat (concat v_arrayElimCell_76 v_arrayElimCell_77) v_arrayElimCell_78) v_arrayElimCell_79))) (or (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse141))))) (forall ((v_arrayElimCell_64 (_ BitVec 8))) (let ((.cse142 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_71) v_arrayElimCell_64) v_arrayElimCell_70))) (or (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse142))))) (= (bvadd .cse142 c_~bag1~0 c_~sum1~0) (bvadd .cse141 c_~bag2~0 c_~sum2~0)) (= (_ bv2147483647 32) (bvadd .cse142 c_~bag1~0)) (not (bvsle .cse142 (_ bv0 32)))))) (= (_ bv2147483647 32) (bvadd .cse141 c_~bag2~0)) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse141))))))) (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (let ((.cse144 (concat (concat (concat v_arrayElimCell_76 v_arrayElimCell_77) v_arrayElimCell_78) v_arrayElimCell_79))) (or (forall ((v_arrayElimCell_64 (_ BitVec 8))) (let ((.cse143 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_71) v_arrayElimCell_64) v_arrayElimCell_70))) (or (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse143))))) (= (bvadd .cse143 c_~bag1~0 c_~sum1~0) (bvadd .cse144 c_~bag2~0 c_~sum2~0)) (not (bvsle c_~bag1~0 (bvadd (_ bv2147483647 32) (bvneg .cse143)))) (= (_ bv2147483647 32) (bvadd .cse143 c_~bag1~0))))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse144))))) (= (_ bv2147483647 32) (bvadd .cse144 c_~bag2~0)) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse144)))))))) .cse6) (or (and (or .cse6 (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_83 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (let ((.cse146 (bvadd (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_71) v_arrayElimCell_64) v_arrayElimCell_70) c_~bag1~0 c_~sum1~0)) (.cse145 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_81) v_arrayElimCell_82) v_arrayElimCell_83))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse145)) (= .cse146 (bvadd c_~bag2~0 c_~sum2~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (not (bvsle .cse145 (_ bv0 32))) (= .cse146 (bvadd c_~bag2~0 c_~sum2~0 .cse145)) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse145))))))))) (or (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_83 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (let ((.cse147 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_81) v_arrayElimCell_82) v_arrayElimCell_83))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse147)) (not (bvsle .cse147 (_ bv0 32))) (= (bvadd (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_71) v_arrayElimCell_64) v_arrayElimCell_70) c_~bag1~0 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse147)) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse147)))))))) .cse6) (or (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (let ((.cse149 (bvadd (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_71) v_arrayElimCell_64) v_arrayElimCell_70) c_~bag1~0 c_~sum1~0)) (.cse148 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70)) (.cse150 (concat (concat (concat v_arrayElimCell_76 v_arrayElimCell_77) v_arrayElimCell_78) v_arrayElimCell_79))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse148)) (= .cse149 (bvadd .cse150 c_~bag2~0 c_~sum2~0)) (= .cse149 (bvadd c_~bag2~0 c_~sum2~0 .cse148)) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse150))))) (= (_ bv2147483647 32) (bvadd .cse150 c_~bag2~0)) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse150))))))) .cse6) (or (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (let ((.cse151 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse151)) (not (bvsle .cse151 (_ bv0 32))) (= (bvadd (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_71) v_arrayElimCell_64) v_arrayElimCell_70) c_~bag1~0 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse151)) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse151)))))))) .cse10) (or .cse11 .cse12 (and (or (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_71) v_arrayElimCell_64) v_arrayElimCell_70) c_~bag1~0 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70)))) .cse10) (or .cse6 (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_71) v_arrayElimCell_64) v_arrayElimCell_70) c_~bag1~0 c_~sum1~0) (bvadd c_~bag2~0 (concat (concat (concat v_arrayElimCell_72 v_arrayElimCell_73) v_arrayElimCell_74) v_arrayElimCell_75) c_~sum2~0)))) (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse152 (bvadd (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_71) v_arrayElimCell_64) v_arrayElimCell_70) c_~bag1~0 c_~sum1~0))) (or (forall ((v_arrayElimCell_69 (_ BitVec 8))) (= .cse152 (bvadd c_~bag2~0 c_~sum2~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70)))) (= .cse152 (bvadd c_~bag2~0 (concat (concat (concat v_arrayElimCell_72 v_arrayElimCell_73) v_arrayElimCell_74) v_arrayElimCell_75) c_~sum2~0))))))) (or (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (let ((.cse153 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse153)) (= (bvadd (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_71) v_arrayElimCell_64) v_arrayElimCell_70) c_~bag1~0 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse153)) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse153))))) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse153))))))) .cse10) (or (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (let ((.cse154 (concat (concat (concat v_arrayElimCell_76 v_arrayElimCell_77) v_arrayElimCell_78) v_arrayElimCell_79))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (= (bvadd (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_71) v_arrayElimCell_64) v_arrayElimCell_70) c_~bag1~0 c_~sum1~0) (bvadd .cse154 c_~bag2~0 c_~sum2~0)) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse154))))) (= (_ bv2147483647 32) (bvadd .cse154 c_~bag2~0)) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse154))))))) .cse6) (or (and (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (let ((.cse155 (concat (concat (concat v_arrayElimCell_76 v_arrayElimCell_77) v_arrayElimCell_78) v_arrayElimCell_79))) (or (= (bvadd (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_71) v_arrayElimCell_64) v_arrayElimCell_70) c_~bag1~0 c_~sum1~0) (bvadd .cse155 c_~bag2~0 c_~sum2~0)) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse155))))) (= (_ bv2147483647 32) (bvadd .cse155 c_~bag2~0)) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse155))))))) (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (let ((.cse156 (bvadd (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_71) v_arrayElimCell_64) v_arrayElimCell_70) c_~bag1~0 c_~sum1~0)) (.cse157 (concat (concat (concat v_arrayElimCell_76 v_arrayElimCell_77) v_arrayElimCell_78) v_arrayElimCell_79))) (or (= .cse156 (bvadd .cse157 c_~bag2~0 c_~sum2~0)) (= .cse156 (bvadd c_~bag2~0 c_~sum2~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse157))))) (= (_ bv2147483647 32) (bvadd .cse157 c_~bag2~0)) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse157)))))))) .cse6)) .cse35 .cse36) (or (and (or (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (let ((.cse158 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse158)) (not (bvsle .cse158 (_ bv0 32))) (= (bvadd c_~bag1~0 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_71) v_arrayElimCell_69) v_arrayElimCell_70) c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse158)) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse158)))))))) .cse10) (or (forall ((v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_83 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (let ((.cse159 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_81) v_arrayElimCell_82) v_arrayElimCell_83))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse159)) (= (bvadd c_~bag2~0 c_~sum2~0 .cse159) (bvadd c_~bag1~0 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_71) v_arrayElimCell_69) v_arrayElimCell_70) c_~sum1~0)) (not (bvsle .cse159 (_ bv0 32))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse159)))))))) .cse6) (or (and (or (forall ((v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (= (bvadd c_~bag2~0 (concat (concat (concat v_arrayElimCell_72 v_arrayElimCell_73) v_arrayElimCell_74) v_arrayElimCell_75) c_~sum2~0) (bvadd c_~bag1~0 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_71) v_arrayElimCell_69) v_arrayElimCell_70) c_~sum1~0))) .cse6) (or (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (= (bvadd c_~bag1~0 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_71) v_arrayElimCell_69) v_arrayElimCell_70) c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70)))) .cse10) (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse160 (bvadd c_~bag1~0 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_71) v_arrayElimCell_69) v_arrayElimCell_70) c_~sum1~0))) (or (= .cse160 (bvadd c_~bag2~0 c_~sum2~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (= (bvadd c_~bag2~0 (concat (concat (concat v_arrayElimCell_72 v_arrayElimCell_73) v_arrayElimCell_74) v_arrayElimCell_75) c_~sum2~0) .cse160))))) .cse11 .cse12) (or (forall ((v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (let ((.cse161 (concat (concat (concat v_arrayElimCell_76 v_arrayElimCell_77) v_arrayElimCell_78) v_arrayElimCell_79))) (or (= (bvadd .cse161 c_~bag2~0 c_~sum2~0) (bvadd c_~bag1~0 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_71) v_arrayElimCell_69) v_arrayElimCell_70) c_~sum1~0)) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse161))))) (= (_ bv2147483647 32) (bvadd .cse161 c_~bag2~0)) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse161))))))) .cse6) (or (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (let ((.cse162 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse162)) (= (bvadd c_~bag1~0 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_71) v_arrayElimCell_69) v_arrayElimCell_70) c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse162)) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse162))))) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse162))))))) .cse10)) .cse35 .cse36) (or .cse10 (and (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (let ((.cse163 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse163)) (not (bvsle .cse163 (_ bv0 32))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse163))))) (forall ((v_arrayElimCell_64 (_ BitVec 8))) (let ((.cse164 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_71) v_arrayElimCell_64) v_arrayElimCell_70))) (or (= (bvadd c_~bag1~0 .cse164 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse163)) (= (_ bv2147483647 32) (bvadd c_~bag1~0 .cse164)) (not (bvsle .cse164 (_ bv0 32))) (not (bvsge .cse2 (bvadd (bvneg ((_ sign_extend 32) .cse164)) (_ bv18446744071562067968 64)))))))))) (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (let ((.cse165 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse165)) (not (bvsle .cse165 (_ bv0 32))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse165))))) (forall ((v_arrayElimCell_64 (_ BitVec 8))) (let ((.cse166 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_71) v_arrayElimCell_64) v_arrayElimCell_70))) (or (not (bvsle c_~bag1~0 (bvadd (_ bv2147483647 32) (bvneg .cse166)))) (= (bvadd c_~bag1~0 .cse166 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse165)) (= (_ bv2147483647 32) (bvadd c_~bag1~0 .cse166)) (not (bvsge .cse2 (bvadd (bvneg ((_ sign_extend 32) .cse166)) (_ bv18446744071562067968 64)))))))))))) (or .cse6 (and (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_83 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8))) (let ((.cse167 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_81) v_arrayElimCell_82) v_arrayElimCell_83))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse167)) (not (bvsle .cse167 (_ bv0 32))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse167))))) (forall ((v_arrayElimCell_69 (_ BitVec 8))) (let ((.cse168 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_71) v_arrayElimCell_69) v_arrayElimCell_70))) (or (= (_ bv2147483647 32) (bvadd c_~bag1~0 .cse168)) (not (bvsle c_~bag1~0 (bvadd (_ bv2147483647 32) (bvneg .cse168)))) (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse168))))) (= (bvadd c_~bag2~0 c_~sum2~0 .cse167) (bvadd c_~bag1~0 c_~sum1~0 .cse168)))))))) (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_83 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8))) (let ((.cse169 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_81) v_arrayElimCell_82) v_arrayElimCell_83))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse169)) (forall ((v_arrayElimCell_69 (_ BitVec 8))) (let ((.cse170 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_71) v_arrayElimCell_69) v_arrayElimCell_70))) (or (= (_ bv2147483647 32) (bvadd c_~bag1~0 .cse170)) (not (bvsle .cse170 (_ bv0 32))) (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse170))))) (= (bvadd c_~bag2~0 c_~sum2~0 .cse169) (bvadd c_~bag1~0 c_~sum1~0 .cse170))))) (not (bvsle .cse169 (_ bv0 32))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse169)))))))))) (or (and (forall ((v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_83 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8))) (let ((.cse171 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_81) v_arrayElimCell_82) v_arrayElimCell_83))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse171)) (not (bvsle .cse171 (_ bv0 32))) (forall ((v_arrayElimCell_64 (_ BitVec 8))) (let ((.cse172 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_71) v_arrayElimCell_64) v_arrayElimCell_70))) (or (not (bvsle c_~bag1~0 (bvadd (_ bv2147483647 32) (bvneg .cse172)))) (= (_ bv2147483647 32) (bvadd c_~bag1~0 .cse172)) (not (bvsge .cse2 (bvadd (bvneg ((_ sign_extend 32) .cse172)) (_ bv18446744071562067968 64)))) (= (bvadd c_~bag1~0 .cse172 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse171))))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse171)))))))) (forall ((v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_83 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8))) (let ((.cse173 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_81) v_arrayElimCell_82) v_arrayElimCell_83))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse173)) (not (bvsle .cse173 (_ bv0 32))) (forall ((v_arrayElimCell_64 (_ BitVec 8))) (let ((.cse174 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_71) v_arrayElimCell_64) v_arrayElimCell_70))) (or (= (_ bv2147483647 32) (bvadd c_~bag1~0 .cse174)) (not (bvsle .cse174 (_ bv0 32))) (not (bvsge .cse2 (bvadd (bvneg ((_ sign_extend 32) .cse174)) (_ bv18446744071562067968 64)))) (= (bvadd c_~bag1~0 .cse174 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse173))))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse173))))))))) .cse6) (or .cse6 (and (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_83 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8))) (let ((.cse176 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_81) v_arrayElimCell_82) v_arrayElimCell_83))) (or (forall ((v_arrayElimCell_64 (_ BitVec 8))) (let ((.cse175 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_71) v_arrayElimCell_64) v_arrayElimCell_70))) (or (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse175))))) (not (bvsle c_~bag1~0 (bvadd (_ bv2147483647 32) (bvneg .cse175)))) (= (_ bv2147483647 32) (bvadd .cse175 c_~bag1~0)) (= (bvadd .cse175 c_~bag1~0 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse176))))) (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse176)) (not (bvsle .cse176 (_ bv0 32))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse176)))))))) (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_83 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8))) (let ((.cse177 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_81) v_arrayElimCell_82) v_arrayElimCell_83))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse177)) (forall ((v_arrayElimCell_64 (_ BitVec 8))) (let ((.cse178 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_71) v_arrayElimCell_64) v_arrayElimCell_70))) (or (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse178))))) (= (_ bv2147483647 32) (bvadd .cse178 c_~bag1~0)) (not (bvsle .cse178 (_ bv0 32))) (= (bvadd .cse178 c_~bag1~0 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse177))))) (not (bvsle .cse177 (_ bv0 32))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse177)))))))))) (or (and (or (forall ((v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse179 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_71) v_arrayElimCell_69) v_arrayElimCell_70))) (or (= (_ bv2147483647 32) (bvadd c_~bag1~0 .cse179)) (not (bvsle .cse179 (_ bv0 32))) (= (bvadd c_~bag2~0 (concat (concat (concat v_arrayElimCell_72 v_arrayElimCell_73) v_arrayElimCell_74) v_arrayElimCell_75) c_~sum2~0) (bvadd c_~bag1~0 .cse179 c_~sum1~0)) (not (bvsge .cse2 (bvadd (bvneg ((_ sign_extend 32) .cse179)) (_ bv18446744071562067968 64))))))) .cse6) (or (forall ((v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse180 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_71) v_arrayElimCell_69) v_arrayElimCell_70))) (or (= (_ bv2147483647 32) (bvadd c_~bag1~0 .cse180)) (not (bvsle c_~bag1~0 (bvadd (_ bv2147483647 32) (bvneg .cse180)))) (= (bvadd c_~bag2~0 (concat (concat (concat v_arrayElimCell_72 v_arrayElimCell_73) v_arrayElimCell_74) v_arrayElimCell_75) c_~sum2~0) (bvadd c_~bag1~0 .cse180 c_~sum1~0)) (not (bvsge .cse2 (bvadd (bvneg ((_ sign_extend 32) .cse180)) (_ bv18446744071562067968 64))))))) .cse6) (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse181 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_71) v_arrayElimCell_69) v_arrayElimCell_70))) (let ((.cse182 (bvadd c_~bag1~0 .cse181 c_~sum1~0))) (or (= (_ bv2147483647 32) (bvadd c_~bag1~0 .cse181)) (not (bvsle .cse181 (_ bv0 32))) (= .cse182 (bvadd c_~bag2~0 c_~sum2~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (= (bvadd c_~bag2~0 (concat (concat (concat v_arrayElimCell_72 v_arrayElimCell_73) v_arrayElimCell_74) v_arrayElimCell_75) c_~sum2~0) .cse182) (not (bvsge .cse2 (bvadd (bvneg ((_ sign_extend 32) .cse181)) (_ bv18446744071562067968 64)))))))) (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse183 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_71) v_arrayElimCell_69) v_arrayElimCell_70))) (let ((.cse184 (bvadd c_~bag1~0 .cse183 c_~sum1~0))) (or (= (_ bv2147483647 32) (bvadd c_~bag1~0 .cse183)) (not (bvsle c_~bag1~0 (bvadd (_ bv2147483647 32) (bvneg .cse183)))) (= .cse184 (bvadd c_~bag2~0 c_~sum2~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (= (bvadd c_~bag2~0 (concat (concat (concat v_arrayElimCell_72 v_arrayElimCell_73) v_arrayElimCell_74) v_arrayElimCell_75) c_~sum2~0) .cse184) (not (bvsge .cse2 (bvadd (bvneg ((_ sign_extend 32) .cse183)) (_ bv18446744071562067968 64)))))))) (or (and (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (let ((.cse185 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_71) v_arrayElimCell_69) v_arrayElimCell_70))) (or (= (_ bv2147483647 32) (bvadd c_~bag1~0 .cse185)) (not (bvsle .cse185 (_ bv0 32))) (= (bvadd c_~bag1~0 .cse185 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (not (bvsge .cse2 (bvadd (bvneg ((_ sign_extend 32) .cse185)) (_ bv18446744071562067968 64))))))) (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (let ((.cse186 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_71) v_arrayElimCell_69) v_arrayElimCell_70))) (or (= (_ bv2147483647 32) (bvadd c_~bag1~0 .cse186)) (not (bvsle c_~bag1~0 (bvadd (_ bv2147483647 32) (bvneg .cse186)))) (= (bvadd c_~bag1~0 .cse186 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (not (bvsge .cse2 (bvadd (bvneg ((_ sign_extend 32) .cse186)) (_ bv18446744071562067968 64)))))))) .cse10)) .cse11 .cse12) (or (and (forall ((v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_83 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8))) (let ((.cse187 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_81) v_arrayElimCell_82) v_arrayElimCell_83))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse187)) (not (bvsle .cse187 (_ bv0 32))) (forall ((v_arrayElimCell_69 (_ BitVec 8))) (let ((.cse188 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_71) v_arrayElimCell_69) v_arrayElimCell_70))) (or (= (_ bv2147483647 32) (bvadd c_~bag1~0 .cse188)) (not (bvsle .cse188 (_ bv0 32))) (= (bvadd c_~bag2~0 c_~sum2~0 .cse187) (bvadd c_~bag1~0 .cse188 c_~sum1~0)) (not (bvsge .cse2 (bvadd (bvneg ((_ sign_extend 32) .cse188)) (_ bv18446744071562067968 64))))))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse187)))))))) (forall ((v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_83 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8))) (let ((.cse189 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_81) v_arrayElimCell_82) v_arrayElimCell_83))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse189)) (not (bvsle .cse189 (_ bv0 32))) (forall ((v_arrayElimCell_69 (_ BitVec 8))) (let ((.cse190 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_71) v_arrayElimCell_69) v_arrayElimCell_70))) (or (= (_ bv2147483647 32) (bvadd c_~bag1~0 .cse190)) (not (bvsle c_~bag1~0 (bvadd (_ bv2147483647 32) (bvneg .cse190)))) (= (bvadd c_~bag2~0 c_~sum2~0 .cse189) (bvadd c_~bag1~0 .cse190 c_~sum1~0)) (not (bvsge .cse2 (bvadd (bvneg ((_ sign_extend 32) .cse190)) (_ bv18446744071562067968 64))))))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse189))))))))) .cse6) (or .cse11 (and (or (and (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse191 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_71) v_arrayElimCell_64) v_arrayElimCell_70))) (or (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse191))))) (not (bvsle c_~bag1~0 (bvadd (_ bv2147483647 32) (bvneg .cse191)))) (= (_ bv2147483647 32) (bvadd .cse191 c_~bag1~0)) (= (bvadd .cse191 c_~bag1~0 c_~sum1~0) (bvadd c_~bag2~0 (concat (concat (concat v_arrayElimCell_72 v_arrayElimCell_73) v_arrayElimCell_74) v_arrayElimCell_75) c_~sum2~0))))) (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse192 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_71) v_arrayElimCell_64) v_arrayElimCell_70))) (or (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse192))))) (= (_ bv2147483647 32) (bvadd .cse192 c_~bag1~0)) (not (bvsle .cse192 (_ bv0 32))) (= (bvadd .cse192 c_~bag1~0 c_~sum1~0) (bvadd c_~bag2~0 (concat (concat (concat v_arrayElimCell_72 v_arrayElimCell_73) v_arrayElimCell_74) v_arrayElimCell_75) c_~sum2~0)))))) .cse6) (or .cse10 (and (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (let ((.cse193 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_71) v_arrayElimCell_64) v_arrayElimCell_70))) (or (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse193))))) (not (bvsle c_~bag1~0 (bvadd (_ bv2147483647 32) (bvneg .cse193)))) (= (_ bv2147483647 32) (bvadd .cse193 c_~bag1~0)) (= (bvadd .cse193 c_~bag1~0 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70)))))) (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (let ((.cse194 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_71) v_arrayElimCell_64) v_arrayElimCell_70))) (or (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse194))))) (= (_ bv2147483647 32) (bvadd .cse194 c_~bag1~0)) (= (bvadd .cse194 c_~bag1~0 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (not (bvsle .cse194 (_ bv0 32)))))))) (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse195 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_71) v_arrayElimCell_64) v_arrayElimCell_70))) (let ((.cse196 (bvadd .cse195 c_~bag1~0 c_~sum1~0))) (or (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse195))))) (not (bvsle c_~bag1~0 (bvadd (_ bv2147483647 32) (bvneg .cse195)))) (= (_ bv2147483647 32) (bvadd .cse195 c_~bag1~0)) (= .cse196 (bvadd c_~bag2~0 c_~sum2~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (= .cse196 (bvadd c_~bag2~0 (concat (concat (concat v_arrayElimCell_72 v_arrayElimCell_73) v_arrayElimCell_74) v_arrayElimCell_75) c_~sum2~0)))))) (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse197 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_71) v_arrayElimCell_64) v_arrayElimCell_70))) (let ((.cse198 (bvadd .cse197 c_~bag1~0 c_~sum1~0))) (or (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse197))))) (= (_ bv2147483647 32) (bvadd .cse197 c_~bag1~0)) (= .cse198 (bvadd c_~bag2~0 c_~sum2~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (not (bvsle .cse197 (_ bv0 32))) (= .cse198 (bvadd c_~bag2~0 (concat (concat (concat v_arrayElimCell_72 v_arrayElimCell_73) v_arrayElimCell_74) v_arrayElimCell_75) c_~sum2~0))))))) .cse12) (or (and (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (let ((.cse199 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse199)) (forall ((v_arrayElimCell_64 (_ BitVec 8))) (let ((.cse200 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_71) v_arrayElimCell_64) v_arrayElimCell_70))) (or (= (_ bv2147483647 32) (bvadd .cse200 c_~bag1~0)) (= (bvadd .cse200 c_~bag1~0 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse199)) (not (bvsle .cse200 (_ bv0 32)))))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse199))))) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse199))))))) (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (let ((.cse201 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse201)) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse201))))) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse201)))) (forall ((v_arrayElimCell_64 (_ BitVec 8))) (let ((.cse202 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_71) v_arrayElimCell_64) v_arrayElimCell_70))) (or (not (bvsle c_~bag1~0 (bvadd (_ bv2147483647 32) (bvneg .cse202)))) (= (_ bv2147483647 32) (bvadd .cse202 c_~bag1~0)) (= (bvadd .cse202 c_~bag1~0 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse201))))))))) .cse10) (or (and (or (and (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (let ((.cse203 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_71) v_arrayElimCell_69) v_arrayElimCell_70))) (or (= (_ bv2147483647 32) (bvadd c_~bag1~0 .cse203)) (not (bvsle .cse203 (_ bv0 32))) (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse203))))) (= (bvadd c_~bag1~0 c_~sum1~0 .cse203) (bvadd c_~bag2~0 c_~sum2~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70)))))) (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (let ((.cse204 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_71) v_arrayElimCell_69) v_arrayElimCell_70))) (or (= (_ bv2147483647 32) (bvadd c_~bag1~0 .cse204)) (not (bvsle c_~bag1~0 (bvadd (_ bv2147483647 32) (bvneg .cse204)))) (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse204))))) (= (bvadd c_~bag1~0 c_~sum1~0 .cse204) (bvadd c_~bag2~0 c_~sum2~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))))))) .cse10) (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse206 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_71) v_arrayElimCell_69) v_arrayElimCell_70))) (let ((.cse205 (bvadd c_~bag1~0 c_~sum1~0 .cse206))) (or (= (bvadd c_~bag2~0 (concat (concat (concat v_arrayElimCell_72 v_arrayElimCell_73) v_arrayElimCell_74) v_arrayElimCell_75) c_~sum2~0) .cse205) (= (_ bv2147483647 32) (bvadd c_~bag1~0 .cse206)) (not (bvsle .cse206 (_ bv0 32))) (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse206))))) (= .cse205 (bvadd c_~bag2~0 c_~sum2~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))))))) (or .cse6 (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse207 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_71) v_arrayElimCell_69) v_arrayElimCell_70))) (or (= (bvadd c_~bag2~0 (concat (concat (concat v_arrayElimCell_72 v_arrayElimCell_73) v_arrayElimCell_74) v_arrayElimCell_75) c_~sum2~0) (bvadd c_~bag1~0 c_~sum1~0 .cse207)) (= (_ bv2147483647 32) (bvadd c_~bag1~0 .cse207)) (not (bvsle .cse207 (_ bv0 32))) (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse207))))))))) (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse209 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_71) v_arrayElimCell_69) v_arrayElimCell_70))) (let ((.cse208 (bvadd c_~bag1~0 c_~sum1~0 .cse209))) (or (= (bvadd c_~bag2~0 (concat (concat (concat v_arrayElimCell_72 v_arrayElimCell_73) v_arrayElimCell_74) v_arrayElimCell_75) c_~sum2~0) .cse208) (= (_ bv2147483647 32) (bvadd c_~bag1~0 .cse209)) (not (bvsle c_~bag1~0 (bvadd (_ bv2147483647 32) (bvneg .cse209)))) (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse209))))) (= .cse208 (bvadd c_~bag2~0 c_~sum2~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))))))) (or .cse6 (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse210 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_71) v_arrayElimCell_69) v_arrayElimCell_70))) (or (= (bvadd c_~bag2~0 (concat (concat (concat v_arrayElimCell_72 v_arrayElimCell_73) v_arrayElimCell_74) v_arrayElimCell_75) c_~sum2~0) (bvadd c_~bag1~0 c_~sum1~0 .cse210)) (= (_ bv2147483647 32) (bvadd c_~bag1~0 .cse210)) (not (bvsle c_~bag1~0 (bvadd (_ bv2147483647 32) (bvneg .cse210)))) (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse210)))))))))) .cse11 .cse12) (or .cse6 (and (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (let ((.cse211 (concat (concat (concat v_arrayElimCell_76 v_arrayElimCell_77) v_arrayElimCell_78) v_arrayElimCell_79))) (or (forall ((v_arrayElimCell_69 (_ BitVec 8))) (let ((.cse212 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_71) v_arrayElimCell_69) v_arrayElimCell_70))) (or (= (bvadd .cse211 c_~bag2~0 c_~sum2~0) (bvadd c_~bag1~0 c_~sum1~0 .cse212)) (= (_ bv2147483647 32) (bvadd c_~bag1~0 .cse212)) (not (bvsle .cse212 (_ bv0 32))) (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse212)))))))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse211))))) (= (_ bv2147483647 32) (bvadd .cse211 c_~bag2~0)) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse211))))))) (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (let ((.cse213 (concat (concat (concat v_arrayElimCell_76 v_arrayElimCell_77) v_arrayElimCell_78) v_arrayElimCell_79))) (or (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse213))))) (forall ((v_arrayElimCell_69 (_ BitVec 8))) (let ((.cse214 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_71) v_arrayElimCell_69) v_arrayElimCell_70))) (or (= (bvadd .cse213 c_~bag2~0 c_~sum2~0) (bvadd c_~bag1~0 c_~sum1~0 .cse214)) (= (_ bv2147483647 32) (bvadd c_~bag1~0 .cse214)) (not (bvsle c_~bag1~0 (bvadd (_ bv2147483647 32) (bvneg .cse214)))) (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse214)))))))) (= (_ bv2147483647 32) (bvadd .cse213 c_~bag2~0)) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse213))))))))))) (or (and (or (and (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_83 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8))) (let ((.cse215 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_81) v_arrayElimCell_82) v_arrayElimCell_83))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse215)) (forall ((v_arrayElimCell_64 (_ BitVec 8))) (let ((.cse216 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_64) v_arrayElimCell_70))) (or (= (_ bv2147483647 32) (bvadd .cse216 c_~bag1~0)) (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse216))))) (= (bvadd .cse216 c_~bag1~0 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse215)) (not (bvsle .cse216 (_ bv0 32)))))) (not (bvsle .cse215 (_ bv0 32))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse215)))))))) (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_83 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8))) (let ((.cse218 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_81) v_arrayElimCell_82) v_arrayElimCell_83))) (or (forall ((v_arrayElimCell_64 (_ BitVec 8))) (let ((.cse217 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_64) v_arrayElimCell_70))) (or (= (_ bv2147483647 32) (bvadd .cse217 c_~bag1~0)) (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse217))))) (= (bvadd .cse217 c_~bag1~0 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse218)) (not (bvsle c_~bag1~0 (bvadd (_ bv2147483647 32) (bvneg .cse217))))))) (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse218)) (not (bvsle .cse218 (_ bv0 32))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse218))))))))) .cse6) (or .cse10 (and (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8))) (let ((.cse221 (concat v_arrayElimCell_65 v_arrayElimCell_66))) (let ((.cse219 (concat (concat .cse221 v_arrayElimCell_69) v_arrayElimCell_70))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse219)) (not (bvsle .cse219 (_ bv0 32))) (forall ((v_arrayElimCell_64 (_ BitVec 8))) (let ((.cse220 (concat (concat .cse221 v_arrayElimCell_64) v_arrayElimCell_70))) (or (= (_ bv2147483647 32) (bvadd .cse220 c_~bag1~0)) (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse220))))) (= (bvadd .cse220 c_~bag1~0 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse219)) (not (bvsle .cse220 (_ bv0 32)))))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse219))))))))) (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8))) (let ((.cse224 (concat v_arrayElimCell_65 v_arrayElimCell_66))) (let ((.cse222 (concat (concat .cse224 v_arrayElimCell_69) v_arrayElimCell_70))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse222)) (forall ((v_arrayElimCell_64 (_ BitVec 8))) (let ((.cse223 (concat (concat .cse224 v_arrayElimCell_64) v_arrayElimCell_70))) (or (= (_ bv2147483647 32) (bvadd .cse223 c_~bag1~0)) (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse223))))) (= (bvadd .cse223 c_~bag1~0 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse222)) (not (bvsle c_~bag1~0 (bvadd (_ bv2147483647 32) (bvneg .cse223))))))) (not (bvsle .cse222 (_ bv0 32))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse222))))))))))) (or .cse6 (and (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8))) (let ((.cse226 (concat (concat (concat v_arrayElimCell_76 v_arrayElimCell_77) v_arrayElimCell_78) v_arrayElimCell_79))) (or (forall ((v_arrayElimCell_64 (_ BitVec 8))) (let ((.cse225 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_64) v_arrayElimCell_70))) (or (= (_ bv2147483647 32) (bvadd .cse225 c_~bag1~0)) (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse225))))) (= (bvadd .cse225 c_~bag1~0 c_~sum1~0) (bvadd .cse226 c_~bag2~0 c_~sum2~0)) (not (bvsle c_~bag1~0 (bvadd (_ bv2147483647 32) (bvneg .cse225))))))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse226))))) (= (_ bv2147483647 32) (bvadd .cse226 c_~bag2~0)) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse226))))))) (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8))) (let ((.cse227 (concat (concat (concat v_arrayElimCell_76 v_arrayElimCell_77) v_arrayElimCell_78) v_arrayElimCell_79))) (or (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse227))))) (forall ((v_arrayElimCell_64 (_ BitVec 8))) (let ((.cse228 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_64) v_arrayElimCell_70))) (or (= (_ bv2147483647 32) (bvadd .cse228 c_~bag1~0)) (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse228))))) (= (bvadd .cse228 c_~bag1~0 c_~sum1~0) (bvadd .cse227 c_~bag2~0 c_~sum2~0)) (not (bvsle .cse228 (_ bv0 32)))))) (= (_ bv2147483647 32) (bvadd .cse227 c_~bag2~0)) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse227))))))))) (or .cse35 .cse36 (and (or (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8))) (let ((.cse230 (concat v_arrayElimCell_65 v_arrayElimCell_66))) (let ((.cse229 (concat (concat .cse230 v_arrayElimCell_69) v_arrayElimCell_70))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse229)) (= (bvadd (concat (concat .cse230 v_arrayElimCell_64) v_arrayElimCell_70) c_~bag1~0 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse229)) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse229))))) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse229)))))))) .cse10) (or (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8))) (let ((.cse232 (concat v_arrayElimCell_65 v_arrayElimCell_66))) (let ((.cse231 (concat (concat .cse232 v_arrayElimCell_69) v_arrayElimCell_70))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse231)) (= (bvadd (concat (concat .cse232 v_arrayElimCell_64) v_arrayElimCell_70) c_~bag1~0 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse231)) (not (bvsle .cse231 (_ bv0 32))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse231))))))))) .cse10) (or .cse6 (forall ((v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8))) (let ((.cse233 (concat v_arrayElimCell_65 v_arrayElimCell_66)) (.cse234 (concat (concat (concat v_arrayElimCell_76 v_arrayElimCell_77) v_arrayElimCell_78) v_arrayElimCell_79))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 (concat (concat .cse233 v_arrayElimCell_69) v_arrayElimCell_70))) (= (bvadd (concat (concat .cse233 v_arrayElimCell_64) v_arrayElimCell_70) c_~bag1~0 c_~sum1~0) (bvadd .cse234 c_~bag2~0 c_~sum2~0)) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse234))))) (= (_ bv2147483647 32) (bvadd .cse234 c_~bag2~0)) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse234)))))))) (or (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_83 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8))) (let ((.cse235 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_81) v_arrayElimCell_82) v_arrayElimCell_83))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse235)) (= (bvadd (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_64) v_arrayElimCell_70) c_~bag1~0 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse235)) (not (bvsle .cse235 (_ bv0 32))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse235)))))))) .cse6) (or (and (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse237 (concat v_arrayElimCell_65 v_arrayElimCell_66))) (let ((.cse236 (bvadd (concat (concat .cse237 v_arrayElimCell_64) v_arrayElimCell_70) c_~bag1~0 c_~sum1~0))) (or (= .cse236 (bvadd c_~bag2~0 (concat (concat (concat v_arrayElimCell_72 v_arrayElimCell_73) v_arrayElimCell_74) v_arrayElimCell_75) c_~sum2~0)) (forall ((v_arrayElimCell_69 (_ BitVec 8))) (= .cse236 (bvadd c_~bag2~0 c_~sum2~0 (concat (concat .cse237 v_arrayElimCell_69) v_arrayElimCell_70)))))))) (or .cse6 (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_64) v_arrayElimCell_70) c_~bag1~0 c_~sum1~0) (bvadd c_~bag2~0 (concat (concat (concat v_arrayElimCell_72 v_arrayElimCell_73) v_arrayElimCell_74) v_arrayElimCell_75) c_~sum2~0)))) (or (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8))) (let ((.cse238 (concat v_arrayElimCell_65 v_arrayElimCell_66))) (= (bvadd (concat (concat .cse238 v_arrayElimCell_64) v_arrayElimCell_70) c_~bag1~0 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 (concat (concat .cse238 v_arrayElimCell_69) v_arrayElimCell_70))))) .cse10)) .cse11 .cse12) (or (forall ((v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8))) (let ((.cse242 (concat v_arrayElimCell_65 v_arrayElimCell_66))) (let ((.cse239 (concat (concat .cse242 v_arrayElimCell_69) v_arrayElimCell_70)) (.cse240 (bvadd (concat (concat .cse242 v_arrayElimCell_64) v_arrayElimCell_70) c_~bag1~0 c_~sum1~0)) (.cse241 (concat (concat (concat v_arrayElimCell_76 v_arrayElimCell_77) v_arrayElimCell_78) v_arrayElimCell_79))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse239)) (= .cse240 (bvadd c_~bag2~0 c_~sum2~0 .cse239)) (= .cse240 (bvadd .cse241 c_~bag2~0 c_~sum2~0)) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse241))))) (= (_ bv2147483647 32) (bvadd .cse241 c_~bag2~0)) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse241)))))))) .cse6) (or (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_83 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8))) (let ((.cse245 (concat v_arrayElimCell_65 v_arrayElimCell_66))) (let ((.cse244 (bvadd (concat (concat .cse245 v_arrayElimCell_64) v_arrayElimCell_70) c_~bag1~0 c_~sum1~0)) (.cse243 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_81) v_arrayElimCell_82) v_arrayElimCell_83))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse243)) (= .cse244 (bvadd c_~bag2~0 c_~sum2~0 (concat (concat .cse245 v_arrayElimCell_69) v_arrayElimCell_70))) (= .cse244 (bvadd c_~bag2~0 c_~sum2~0 .cse243)) (not (bvsle .cse243 (_ bv0 32))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse243))))))))) .cse6) (or (and (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8))) (let ((.cse246 (concat (concat (concat v_arrayElimCell_76 v_arrayElimCell_77) v_arrayElimCell_78) v_arrayElimCell_79))) (or (= (bvadd (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_64) v_arrayElimCell_70) c_~bag1~0 c_~sum1~0) (bvadd .cse246 c_~bag2~0 c_~sum2~0)) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse246))))) (= (_ bv2147483647 32) (bvadd .cse246 c_~bag2~0)) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse246))))))) (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8))) (let ((.cse248 (concat v_arrayElimCell_65 v_arrayElimCell_66))) (let ((.cse247 (bvadd (concat (concat .cse248 v_arrayElimCell_64) v_arrayElimCell_70) c_~bag1~0 c_~sum1~0)) (.cse249 (concat (concat (concat v_arrayElimCell_76 v_arrayElimCell_77) v_arrayElimCell_78) v_arrayElimCell_79))) (or (= .cse247 (bvadd c_~bag2~0 c_~sum2~0 (concat (concat .cse248 v_arrayElimCell_69) v_arrayElimCell_70))) (= .cse247 (bvadd .cse249 c_~bag2~0 c_~sum2~0)) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse249))))) (= (_ bv2147483647 32) (bvadd .cse249 c_~bag2~0)) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse249))))))))) .cse6))) (or (and (or (and (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse250 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_64) v_arrayElimCell_70))) (or (= (_ bv2147483647 32) (bvadd .cse250 c_~bag1~0)) (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse250))))) (not (bvsle c_~bag1~0 (bvadd (_ bv2147483647 32) (bvneg .cse250)))) (= (bvadd .cse250 c_~bag1~0 c_~sum1~0) (bvadd c_~bag2~0 (concat (concat (concat v_arrayElimCell_72 v_arrayElimCell_73) v_arrayElimCell_74) v_arrayElimCell_75) c_~sum2~0))))) (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse251 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_64) v_arrayElimCell_70))) (or (= (_ bv2147483647 32) (bvadd .cse251 c_~bag1~0)) (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse251))))) (not (bvsle .cse251 (_ bv0 32))) (= (bvadd .cse251 c_~bag1~0 c_~sum1~0) (bvadd c_~bag2~0 (concat (concat (concat v_arrayElimCell_72 v_arrayElimCell_73) v_arrayElimCell_74) v_arrayElimCell_75) c_~sum2~0)))))) .cse6) (or .cse10 (and (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8))) (let ((.cse253 (concat v_arrayElimCell_65 v_arrayElimCell_66))) (let ((.cse252 (concat (concat .cse253 v_arrayElimCell_64) v_arrayElimCell_70))) (or (= (_ bv2147483647 32) (bvadd .cse252 c_~bag1~0)) (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse252))))) (= (bvadd .cse252 c_~bag1~0 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 (concat (concat .cse253 v_arrayElimCell_69) v_arrayElimCell_70))) (not (bvsle c_~bag1~0 (bvadd (_ bv2147483647 32) (bvneg .cse252)))))))) (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8))) (let ((.cse255 (concat v_arrayElimCell_65 v_arrayElimCell_66))) (let ((.cse254 (concat (concat .cse255 v_arrayElimCell_64) v_arrayElimCell_70))) (or (= (_ bv2147483647 32) (bvadd .cse254 c_~bag1~0)) (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse254))))) (= (bvadd .cse254 c_~bag1~0 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 (concat (concat .cse255 v_arrayElimCell_69) v_arrayElimCell_70))) (not (bvsle .cse254 (_ bv0 32))))))))) (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse258 (concat v_arrayElimCell_65 v_arrayElimCell_66))) (let ((.cse256 (concat (concat .cse258 v_arrayElimCell_64) v_arrayElimCell_70))) (let ((.cse257 (bvadd .cse256 c_~bag1~0 c_~sum1~0))) (or (= (_ bv2147483647 32) (bvadd .cse256 c_~bag1~0)) (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse256))))) (= .cse257 (bvadd c_~bag2~0 c_~sum2~0 (concat (concat .cse258 v_arrayElimCell_69) v_arrayElimCell_70))) (not (bvsle c_~bag1~0 (bvadd (_ bv2147483647 32) (bvneg .cse256)))) (= .cse257 (bvadd c_~bag2~0 (concat (concat (concat v_arrayElimCell_72 v_arrayElimCell_73) v_arrayElimCell_74) v_arrayElimCell_75) c_~sum2~0))))))) (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse261 (concat v_arrayElimCell_65 v_arrayElimCell_66))) (let ((.cse259 (concat (concat .cse261 v_arrayElimCell_64) v_arrayElimCell_70))) (let ((.cse260 (bvadd .cse259 c_~bag1~0 c_~sum1~0))) (or (= (_ bv2147483647 32) (bvadd .cse259 c_~bag1~0)) (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse259))))) (= .cse260 (bvadd c_~bag2~0 c_~sum2~0 (concat (concat .cse261 v_arrayElimCell_69) v_arrayElimCell_70))) (not (bvsle .cse259 (_ bv0 32))) (= .cse260 (bvadd c_~bag2~0 (concat (concat (concat v_arrayElimCell_72 v_arrayElimCell_73) v_arrayElimCell_74) v_arrayElimCell_75) c_~sum2~0)))))))) .cse11 .cse12) (or (and (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8))) (let ((.cse264 (concat v_arrayElimCell_65 v_arrayElimCell_66))) (let ((.cse263 (concat (concat .cse264 v_arrayElimCell_69) v_arrayElimCell_70))) (or (forall ((v_arrayElimCell_64 (_ BitVec 8))) (let ((.cse262 (concat (concat .cse264 v_arrayElimCell_64) v_arrayElimCell_70))) (or (= (_ bv2147483647 32) (bvadd .cse262 c_~bag1~0)) (= (bvadd .cse262 c_~bag1~0 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse263)) (not (bvsle .cse262 (_ bv0 32)))))) (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse263)) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse263))))) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse263)))))))) (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8))) (let ((.cse267 (concat v_arrayElimCell_65 v_arrayElimCell_66))) (let ((.cse265 (concat (concat .cse267 v_arrayElimCell_69) v_arrayElimCell_70))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse265)) (forall ((v_arrayElimCell_64 (_ BitVec 8))) (let ((.cse266 (concat (concat .cse267 v_arrayElimCell_64) v_arrayElimCell_70))) (or (= (_ bv2147483647 32) (bvadd .cse266 c_~bag1~0)) (= (bvadd .cse266 c_~bag1~0 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse265)) (not (bvsle c_~bag1~0 (bvadd (_ bv2147483647 32) (bvneg .cse266))))))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse265))))) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse265))))))))) .cse10)) .cse74) (or .cse6 (and (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8))) (let ((.cse268 (concat (concat (concat v_arrayElimCell_76 v_arrayElimCell_77) v_arrayElimCell_78) v_arrayElimCell_79))) (or (forall ((v_arrayElimCell_69 (_ BitVec 8))) (let ((.cse269 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (or (= (bvadd .cse268 c_~bag2~0 c_~sum2~0) (bvadd c_~bag1~0 .cse269 c_~sum1~0)) (not (bvsle c_~bag1~0 (bvadd (_ bv2147483647 32) (bvneg .cse269)))) (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse269))))) (= (_ bv2147483647 32) (bvadd c_~bag1~0 .cse269))))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse268))))) (= (_ bv2147483647 32) (bvadd .cse268 c_~bag2~0)) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse268))))))) (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8))) (let ((.cse270 (concat (concat (concat v_arrayElimCell_76 v_arrayElimCell_77) v_arrayElimCell_78) v_arrayElimCell_79))) (or (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse270))))) (forall ((v_arrayElimCell_69 (_ BitVec 8))) (let ((.cse271 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (or (not (bvsle .cse271 (_ bv0 32))) (= (bvadd .cse270 c_~bag2~0 c_~sum2~0) (bvadd c_~bag1~0 .cse271 c_~sum1~0)) (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse271))))) (= (_ bv2147483647 32) (bvadd c_~bag1~0 .cse271))))) (= (_ bv2147483647 32) (bvadd .cse270 c_~bag2~0)) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse270))))))))) (or (and (or (forall ((v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8))) (let ((.cse272 (concat (concat (concat v_arrayElimCell_76 v_arrayElimCell_77) v_arrayElimCell_78) v_arrayElimCell_79))) (or (= (bvadd .cse272 c_~bag2~0 c_~sum2~0) (bvadd c_~bag1~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70) c_~sum1~0)) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse272))))) (= (_ bv2147483647 32) (bvadd .cse272 c_~bag2~0)) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse272))))))) .cse6) (or (let ((.cse273 (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (= (bvadd c_~bag2~0 (concat (concat (concat v_arrayElimCell_72 v_arrayElimCell_73) v_arrayElimCell_74) v_arrayElimCell_75) c_~sum2~0) (bvadd c_~bag1~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70) c_~sum1~0))))) (and (or .cse80 .cse273) (or .cse273 .cse6) (or .cse80 .cse10))) .cse11 .cse12) (or .cse80 (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8))) (let ((.cse274 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse274)) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse274))))) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse274))))))) .cse10) (or (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8))) (let ((.cse275 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse275)) (not (bvsle .cse275 (_ bv0 32))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse275)))))))) .cse80 .cse10) (or (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_83 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8))) (let ((.cse276 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_81) v_arrayElimCell_82) v_arrayElimCell_83))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse276)) (= (bvadd c_~bag2~0 c_~sum2~0 .cse276) (bvadd c_~bag1~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70) c_~sum1~0)) (not (bvsle .cse276 (_ bv0 32))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse276)))))))) .cse6)) .cse35 .cse36) (or (and (or (and (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_83 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8))) (let ((.cse277 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_81) v_arrayElimCell_82) v_arrayElimCell_83))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse277)) (not (bvsle .cse277 (_ bv0 32))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse277))))) (forall ((v_arrayElimCell_69 (_ BitVec 8))) (let ((.cse278 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_71) v_arrayElimCell_69) v_arrayElimCell_68))) (or (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse278))))) (= (_ bv2147483647 32) (bvadd .cse278 c_~bag1~0)) (= (bvadd .cse278 c_~bag1~0 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse277)) (not (bvsle .cse278 (_ bv0 32))))))))) (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_83 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8))) (let ((.cse279 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_81) v_arrayElimCell_82) v_arrayElimCell_83))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse279)) (forall ((v_arrayElimCell_69 (_ BitVec 8))) (let ((.cse280 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_71) v_arrayElimCell_69) v_arrayElimCell_68))) (or (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse280))))) (= (_ bv2147483647 32) (bvadd .cse280 c_~bag1~0)) (not (bvsle c_~bag1~0 (bvadd (_ bv2147483647 32) (bvneg .cse280)))) (= (bvadd .cse280 c_~bag1~0 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse279))))) (not (bvsle .cse279 (_ bv0 32))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse279))))))))) .cse6) (or (and (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (let ((.cse282 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_71) v_arrayElimCell_69) v_arrayElimCell_68)) (.cse281 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse281)) (= (_ bv2147483647 32) (bvadd .cse282 c_~bag1~0)) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse281))))) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse281)))) (not (bvsle .cse282 (_ bv0 32))) (= (bvadd .cse282 c_~bag1~0 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse281))))) (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (let ((.cse284 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_71) v_arrayElimCell_69) v_arrayElimCell_68)) (.cse283 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse283)) (= (_ bv2147483647 32) (bvadd .cse284 c_~bag1~0)) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse283))))) (not (bvsle c_~bag1~0 (bvadd (_ bv2147483647 32) (bvneg .cse284)))) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse283)))) (= (bvadd .cse284 c_~bag1~0 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse283)))))) .cse10) (or (and (forall ((v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (let ((.cse286 (concat (concat (concat v_arrayElimCell_76 v_arrayElimCell_77) v_arrayElimCell_78) v_arrayElimCell_79))) (or (forall ((v_arrayElimCell_64 (_ BitVec 8))) (let ((.cse285 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_71) v_arrayElimCell_64) v_arrayElimCell_68))) (or (not (bvsle c_~bag1~0 (bvadd (_ bv2147483647 32) (bvneg .cse285)))) (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse285))))) (= (bvadd .cse285 c_~bag1~0 c_~sum1~0) (bvadd .cse286 c_~bag2~0 c_~sum2~0)) (= (_ bv2147483647 32) (bvadd .cse285 c_~bag1~0))))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse286))))) (= (_ bv2147483647 32) (bvadd .cse286 c_~bag2~0)) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse286))))))) (forall ((v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (let ((.cse288 (concat (concat (concat v_arrayElimCell_76 v_arrayElimCell_77) v_arrayElimCell_78) v_arrayElimCell_79))) (or (forall ((v_arrayElimCell_64 (_ BitVec 8))) (let ((.cse287 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_71) v_arrayElimCell_64) v_arrayElimCell_68))) (or (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse287))))) (not (bvsle .cse287 (_ bv0 32))) (= (bvadd .cse287 c_~bag1~0 c_~sum1~0) (bvadd .cse288 c_~bag2~0 c_~sum2~0)) (= (_ bv2147483647 32) (bvadd .cse287 c_~bag1~0))))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse288))))) (= (_ bv2147483647 32) (bvadd .cse288 c_~bag2~0)) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse288)))))))) .cse6) (or .cse35 .cse36 (and (or (and (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse289 (bvadd (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_71) v_arrayElimCell_69) v_arrayElimCell_68) c_~bag1~0 c_~sum1~0))) (or (= .cse289 (bvadd c_~bag2~0 c_~sum2~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (= .cse289 (bvadd c_~bag2~0 (concat (concat (concat v_arrayElimCell_72 v_arrayElimCell_73) v_arrayElimCell_74) v_arrayElimCell_75) c_~sum2~0))))) (or (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_71) v_arrayElimCell_69) v_arrayElimCell_68) c_~bag1~0 c_~sum1~0) (bvadd c_~bag2~0 (concat (concat (concat v_arrayElimCell_72 v_arrayElimCell_73) v_arrayElimCell_74) v_arrayElimCell_75) c_~sum2~0))) .cse6) (or (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_71) v_arrayElimCell_69) v_arrayElimCell_68) c_~bag1~0 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70)))) .cse10)) .cse11 .cse12) (or (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (let ((.cse290 (concat (concat (concat v_arrayElimCell_76 v_arrayElimCell_77) v_arrayElimCell_78) v_arrayElimCell_79))) (or (= (bvadd (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_71) v_arrayElimCell_69) v_arrayElimCell_68) c_~bag1~0 c_~sum1~0) (bvadd .cse290 c_~bag2~0 c_~sum2~0)) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse290))))) (= (_ bv2147483647 32) (bvadd .cse290 c_~bag2~0)) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse290))))))) .cse6) (or (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (let ((.cse291 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse291)) (not (bvsle .cse291 (_ bv0 32))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse291))))) (= (bvadd (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_71) v_arrayElimCell_69) v_arrayElimCell_68) c_~bag1~0 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse291))))) .cse10) (or (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (let ((.cse292 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse292)) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse292))))) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse292)))) (= (bvadd (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_71) v_arrayElimCell_69) v_arrayElimCell_68) c_~bag1~0 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse292))))) .cse10) (or (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_83 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8))) (let ((.cse293 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_81) v_arrayElimCell_82) v_arrayElimCell_83))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse293)) (not (bvsle .cse293 (_ bv0 32))) (= (bvadd (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_71) v_arrayElimCell_69) v_arrayElimCell_68) c_~bag1~0 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse293)) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse293)))))))) .cse6))) (or (and (or (and (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8))) (let ((.cse295 (concat v_arrayElimCell_65 v_arrayElimCell_66))) (let ((.cse294 (concat (concat .cse295 v_arrayElimCell_64) v_arrayElimCell_68))) (or (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse294))))) (not (bvsle c_~bag1~0 (bvadd (_ bv2147483647 32) (bvneg .cse294)))) (= (bvadd c_~bag1~0 .cse294 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 (concat (concat .cse295 v_arrayElimCell_69) v_arrayElimCell_70))) (= (_ bv2147483647 32) (bvadd c_~bag1~0 .cse294)))))) (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8))) (let ((.cse297 (concat v_arrayElimCell_65 v_arrayElimCell_66))) (let ((.cse296 (concat (concat .cse297 v_arrayElimCell_64) v_arrayElimCell_68))) (or (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse296))))) (not (bvsle .cse296 (_ bv0 32))) (= (bvadd c_~bag1~0 .cse296 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 (concat (concat .cse297 v_arrayElimCell_69) v_arrayElimCell_70))) (= (_ bv2147483647 32) (bvadd c_~bag1~0 .cse296))))))) .cse10) (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse300 (concat v_arrayElimCell_65 v_arrayElimCell_66))) (let ((.cse299 (concat (concat .cse300 v_arrayElimCell_64) v_arrayElimCell_68))) (let ((.cse298 (bvadd c_~bag1~0 .cse299 c_~sum1~0))) (or (= .cse298 (bvadd c_~bag2~0 (concat (concat (concat v_arrayElimCell_72 v_arrayElimCell_73) v_arrayElimCell_74) v_arrayElimCell_75) c_~sum2~0)) (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse299))))) (not (bvsle c_~bag1~0 (bvadd (_ bv2147483647 32) (bvneg .cse299)))) (= .cse298 (bvadd c_~bag2~0 c_~sum2~0 (concat (concat .cse300 v_arrayElimCell_69) v_arrayElimCell_70))) (= (_ bv2147483647 32) (bvadd c_~bag1~0 .cse299))))))) (or .cse6 (and (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse301 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_64) v_arrayElimCell_68))) (or (= (bvadd c_~bag1~0 .cse301 c_~sum1~0) (bvadd c_~bag2~0 (concat (concat (concat v_arrayElimCell_72 v_arrayElimCell_73) v_arrayElimCell_74) v_arrayElimCell_75) c_~sum2~0)) (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse301))))) (not (bvsle c_~bag1~0 (bvadd (_ bv2147483647 32) (bvneg .cse301)))) (= (_ bv2147483647 32) (bvadd c_~bag1~0 .cse301))))) (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse302 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_64) v_arrayElimCell_68))) (or (= (bvadd c_~bag1~0 .cse302 c_~sum1~0) (bvadd c_~bag2~0 (concat (concat (concat v_arrayElimCell_72 v_arrayElimCell_73) v_arrayElimCell_74) v_arrayElimCell_75) c_~sum2~0)) (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse302))))) (not (bvsle .cse302 (_ bv0 32))) (= (_ bv2147483647 32) (bvadd c_~bag1~0 .cse302))))))) (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse305 (concat v_arrayElimCell_65 v_arrayElimCell_66))) (let ((.cse304 (concat (concat .cse305 v_arrayElimCell_64) v_arrayElimCell_68))) (let ((.cse303 (bvadd c_~bag1~0 .cse304 c_~sum1~0))) (or (= .cse303 (bvadd c_~bag2~0 (concat (concat (concat v_arrayElimCell_72 v_arrayElimCell_73) v_arrayElimCell_74) v_arrayElimCell_75) c_~sum2~0)) (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse304))))) (not (bvsle .cse304 (_ bv0 32))) (= .cse303 (bvadd c_~bag2~0 c_~sum2~0 (concat (concat .cse305 v_arrayElimCell_69) v_arrayElimCell_70))) (= (_ bv2147483647 32) (bvadd c_~bag1~0 .cse304)))))))) .cse11 .cse12) (or .cse35 .cse36 (and (or (forall ((v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_83 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8))) (let ((.cse306 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_81) v_arrayElimCell_82) v_arrayElimCell_83))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse306)) (= (bvadd c_~bag1~0 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_68) c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse306)) (not (bvsle .cse306 (_ bv0 32))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse306)))))))) .cse6) (or (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8))) (let ((.cse307 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse307)) (= (bvadd c_~bag1~0 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_68) c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse307)) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse307))))) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse307))))))) .cse10) (or (and (or (forall ((v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (= (bvadd c_~bag1~0 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_68) c_~sum1~0) (bvadd c_~bag2~0 (concat (concat (concat v_arrayElimCell_72 v_arrayElimCell_73) v_arrayElimCell_74) v_arrayElimCell_75) c_~sum2~0))) .cse6) (or .cse10 (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8))) (= (bvadd c_~bag1~0 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_68) c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))))) (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse308 (bvadd c_~bag1~0 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_68) c_~sum1~0))) (or (= .cse308 (bvadd c_~bag2~0 (concat (concat (concat v_arrayElimCell_72 v_arrayElimCell_73) v_arrayElimCell_74) v_arrayElimCell_75) c_~sum2~0)) (= .cse308 (bvadd c_~bag2~0 c_~sum2~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))))))) .cse11 .cse12) (or (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8))) (let ((.cse309 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse309)) (not (bvsle .cse309 (_ bv0 32))) (= (bvadd c_~bag1~0 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_68) c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse309)) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse309)))))))) .cse10) (or (forall ((v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8))) (let ((.cse310 (concat (concat (concat v_arrayElimCell_76 v_arrayElimCell_77) v_arrayElimCell_78) v_arrayElimCell_79))) (or (= (bvadd c_~bag1~0 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_68) c_~sum1~0) (bvadd .cse310 c_~bag2~0 c_~sum2~0)) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse310))))) (= (_ bv2147483647 32) (bvadd .cse310 c_~bag2~0)) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse310))))))) .cse6))) (or (and (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8))) (let ((.cse311 (concat (concat (concat v_arrayElimCell_76 v_arrayElimCell_77) v_arrayElimCell_78) v_arrayElimCell_79))) (or (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse311))))) (forall ((v_arrayElimCell_69 (_ BitVec 8))) (let ((.cse312 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_68))) (or (not (bvsge .cse2 (bvadd (bvneg ((_ sign_extend 32) .cse312)) (_ bv18446744071562067968 64)))) (not (bvsle .cse312 (_ bv0 32))) (= (bvadd .cse312 c_~bag1~0 c_~sum1~0) (bvadd .cse311 c_~bag2~0 c_~sum2~0)) (= (_ bv2147483647 32) (bvadd .cse312 c_~bag1~0))))) (= (_ bv2147483647 32) (bvadd .cse311 c_~bag2~0)) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse311))))))) (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8))) (let ((.cse314 (concat (concat (concat v_arrayElimCell_76 v_arrayElimCell_77) v_arrayElimCell_78) v_arrayElimCell_79))) (or (forall ((v_arrayElimCell_69 (_ BitVec 8))) (let ((.cse313 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_68))) (or (not (bvsge .cse2 (bvadd (bvneg ((_ sign_extend 32) .cse313)) (_ bv18446744071562067968 64)))) (= (bvadd .cse313 c_~bag1~0 c_~sum1~0) (bvadd .cse314 c_~bag2~0 c_~sum2~0)) (= (_ bv2147483647 32) (bvadd .cse313 c_~bag1~0)) (not (bvsle c_~bag1~0 (bvadd (_ bv2147483647 32) (bvneg .cse313))))))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse314))))) (= (_ bv2147483647 32) (bvadd .cse314 c_~bag2~0)) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse314)))))))) .cse6) (or (and (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8))) (let ((.cse316 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_68)) (.cse315 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse315)) (= (bvadd c_~bag1~0 .cse316 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse315)) (not (bvsle c_~bag1~0 (bvadd (bvneg .cse316) (_ bv2147483647 32)))) (= (bvadd c_~bag1~0 .cse316) (_ bv2147483647 32)) (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse316))))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse315))))) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse315))))))) (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8))) (let ((.cse317 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70)) (.cse318 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_68))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse317)) (= (bvadd c_~bag1~0 .cse318 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse317)) (= (bvadd c_~bag1~0 .cse318) (_ bv2147483647 32)) (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse318))))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse317))))) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse317)))) (not (bvsle .cse318 (_ bv0 32))))))) .cse10) (or (and (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (let ((.cse320 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_71) v_arrayElimCell_69) v_arrayElimCell_68)) (.cse319 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse319)) (not (bvsle .cse319 (_ bv0 32))) (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse320))))) (= (_ bv2147483647 32) (bvadd .cse320 c_~bag1~0)) (not (bvsle c_~bag1~0 (bvadd (_ bv2147483647 32) (bvneg .cse320)))) (= (bvadd .cse320 c_~bag1~0 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse319))))) (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (let ((.cse322 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_71) v_arrayElimCell_69) v_arrayElimCell_68)) (.cse321 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse321)) (not (bvsle .cse321 (_ bv0 32))) (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse322))))) (= (_ bv2147483647 32) (bvadd .cse322 c_~bag1~0)) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse321))))) (not (bvsle .cse322 (_ bv0 32))) (= (bvadd .cse322 c_~bag1~0 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse321)))))) .cse10) (or .cse35 (and (or (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8))) (let ((.cse324 (concat v_arrayElimCell_65 v_arrayElimCell_66))) (let ((.cse323 (concat (concat .cse324 v_arrayElimCell_69) v_arrayElimCell_70))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse323)) (not (bvsle .cse323 (_ bv0 32))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse323))))) (= (bvadd c_~bag1~0 (concat (concat .cse324 v_arrayElimCell_64) v_arrayElimCell_68) c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse323)))))) .cse10) (or (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_83 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8))) (let ((.cse327 (concat v_arrayElimCell_65 v_arrayElimCell_66))) (let ((.cse326 (bvadd c_~bag1~0 (concat (concat .cse327 v_arrayElimCell_64) v_arrayElimCell_68) c_~sum1~0)) (.cse325 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_81) v_arrayElimCell_82) v_arrayElimCell_83))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse325)) (= .cse326 (bvadd c_~bag2~0 c_~sum2~0 .cse325)) (not (bvsle .cse325 (_ bv0 32))) (= .cse326 (bvadd c_~bag2~0 c_~sum2~0 (concat (concat .cse327 v_arrayElimCell_69) v_arrayElimCell_70))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse325))))))))) .cse6) (or (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8))) (let ((.cse331 (concat v_arrayElimCell_65 v_arrayElimCell_66))) (let ((.cse329 (bvadd c_~bag1~0 (concat (concat .cse331 v_arrayElimCell_64) v_arrayElimCell_68) c_~sum1~0)) (.cse328 (concat (concat .cse331 v_arrayElimCell_69) v_arrayElimCell_70)) (.cse330 (concat (concat (concat v_arrayElimCell_76 v_arrayElimCell_77) v_arrayElimCell_78) v_arrayElimCell_79))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse328)) (= .cse329 (bvadd .cse330 c_~bag2~0 c_~sum2~0)) (= .cse329 (bvadd c_~bag2~0 c_~sum2~0 .cse328)) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse330))))) (= (_ bv2147483647 32) (bvadd .cse330 c_~bag2~0)) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse330)))))))) .cse6) (or .cse6 (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8))) (let ((.cse332 (concat v_arrayElimCell_65 v_arrayElimCell_66)) (.cse333 (concat (concat (concat v_arrayElimCell_76 v_arrayElimCell_77) v_arrayElimCell_78) v_arrayElimCell_79))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 (concat (concat .cse332 v_arrayElimCell_69) v_arrayElimCell_70))) (= (bvadd c_~bag1~0 (concat (concat .cse332 v_arrayElimCell_64) v_arrayElimCell_68) c_~sum1~0) (bvadd .cse333 c_~bag2~0 c_~sum2~0)) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse333))))) (= (_ bv2147483647 32) (bvadd .cse333 c_~bag2~0)) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse333)))))))) (or (and (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8))) (let ((.cse336 (concat v_arrayElimCell_65 v_arrayElimCell_66))) (let ((.cse334 (bvadd c_~bag1~0 (concat (concat .cse336 v_arrayElimCell_64) v_arrayElimCell_68) c_~sum1~0)) (.cse335 (concat (concat (concat v_arrayElimCell_76 v_arrayElimCell_77) v_arrayElimCell_78) v_arrayElimCell_79))) (or (= .cse334 (bvadd .cse335 c_~bag2~0 c_~sum2~0)) (= .cse334 (bvadd c_~bag2~0 c_~sum2~0 (concat (concat .cse336 v_arrayElimCell_69) v_arrayElimCell_70))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse335))))) (= (_ bv2147483647 32) (bvadd .cse335 c_~bag2~0)) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse335)))))))) (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8))) (let ((.cse337 (concat (concat (concat v_arrayElimCell_76 v_arrayElimCell_77) v_arrayElimCell_78) v_arrayElimCell_79))) (or (= (bvadd c_~bag1~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_64) v_arrayElimCell_68) c_~sum1~0) (bvadd .cse337 c_~bag2~0 c_~sum2~0)) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse337))))) (= (_ bv2147483647 32) (bvadd .cse337 c_~bag2~0)) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse337)))))))) .cse6) (or (and (or .cse6 (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (= (bvadd c_~bag1~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_64) v_arrayElimCell_68) c_~sum1~0) (bvadd c_~bag2~0 (concat (concat (concat v_arrayElimCell_72 v_arrayElimCell_73) v_arrayElimCell_74) v_arrayElimCell_75) c_~sum2~0)))) (or (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8))) (let ((.cse338 (concat v_arrayElimCell_65 v_arrayElimCell_66))) (= (bvadd c_~bag1~0 (concat (concat .cse338 v_arrayElimCell_64) v_arrayElimCell_68) c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 (concat (concat .cse338 v_arrayElimCell_69) v_arrayElimCell_70))))) .cse10) (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse340 (concat v_arrayElimCell_65 v_arrayElimCell_66))) (let ((.cse339 (bvadd c_~bag1~0 (concat (concat .cse340 v_arrayElimCell_64) v_arrayElimCell_68) c_~sum1~0))) (or (= .cse339 (bvadd c_~bag2~0 (concat (concat (concat v_arrayElimCell_72 v_arrayElimCell_73) v_arrayElimCell_74) v_arrayElimCell_75) c_~sum2~0)) (forall ((v_arrayElimCell_69 (_ BitVec 8))) (= .cse339 (bvadd c_~bag2~0 c_~sum2~0 (concat (concat .cse340 v_arrayElimCell_69) v_arrayElimCell_70))))))))) .cse11 .cse12) (or .cse10 (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8))) (let ((.cse342 (concat v_arrayElimCell_65 v_arrayElimCell_66))) (let ((.cse341 (concat (concat .cse342 v_arrayElimCell_69) v_arrayElimCell_70))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse341)) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse341))))) (= (bvadd c_~bag1~0 (concat (concat .cse342 v_arrayElimCell_64) v_arrayElimCell_68) c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse341)) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse341))))))))) (or (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_83 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8))) (let ((.cse343 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_81) v_arrayElimCell_82) v_arrayElimCell_83))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse343)) (= (bvadd c_~bag1~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_64) v_arrayElimCell_68) c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse343)) (not (bvsle .cse343 (_ bv0 32))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse343)))))))) .cse6)) .cse36) (or (and (forall ((v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_83 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8))) (let ((.cse344 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_81) v_arrayElimCell_82) v_arrayElimCell_83))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse344)) (not (bvsle .cse344 (_ bv0 32))) (forall ((v_arrayElimCell_69 (_ BitVec 8))) (let ((.cse345 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_71) v_arrayElimCell_69) v_arrayElimCell_68))) (or (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse345))))) (= (bvadd .cse345 c_~bag1~0 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse344)) (= (_ bv2147483647 32) (bvadd .cse345 c_~bag1~0)) (not (bvsle .cse345 (_ bv0 32)))))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse344)))))))) (forall ((v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_83 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8))) (let ((.cse346 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_81) v_arrayElimCell_82) v_arrayElimCell_83))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse346)) (not (bvsle .cse346 (_ bv0 32))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse346))))) (forall ((v_arrayElimCell_69 (_ BitVec 8))) (let ((.cse347 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_71) v_arrayElimCell_69) v_arrayElimCell_68))) (or (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse347))))) (not (bvsle c_~bag1~0 (bvadd (_ bv2147483647 32) (bvneg .cse347)))) (= (bvadd .cse347 c_~bag1~0 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse346)) (= (_ bv2147483647 32) (bvadd .cse347 c_~bag1~0))))))))) .cse6) (or (and (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (let ((.cse349 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70)) (.cse348 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_71) v_arrayElimCell_69) v_arrayElimCell_68))) (or (= (bvadd .cse348 c_~bag1~0 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse349)) (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse349)) (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse348))))) (not (bvsle .cse349 (_ bv0 32))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse349))))) (= (_ bv2147483647 32) (bvadd .cse348 c_~bag1~0)) (not (bvsle .cse348 (_ bv0 32)))))) (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (let ((.cse351 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70)) (.cse350 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_71) v_arrayElimCell_69) v_arrayElimCell_68))) (or (= (bvadd .cse350 c_~bag1~0 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse351)) (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse351)) (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse350))))) (not (bvsle .cse351 (_ bv0 32))) (not (bvsle c_~bag1~0 (bvadd (_ bv2147483647 32) (bvneg .cse350)))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse351))))) (= (_ bv2147483647 32) (bvadd .cse350 c_~bag1~0)))))) .cse10) (or (and (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse353 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_71) v_arrayElimCell_69) v_arrayElimCell_68))) (let ((.cse352 (bvadd .cse353 c_~bag1~0 c_~sum1~0))) (or (= .cse352 (bvadd c_~bag2~0 c_~sum2~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse353))))) (not (bvsle c_~bag1~0 (bvadd (_ bv2147483647 32) (bvneg .cse353)))) (= (_ bv2147483647 32) (bvadd .cse353 c_~bag1~0)) (= .cse352 (bvadd c_~bag2~0 (concat (concat (concat v_arrayElimCell_72 v_arrayElimCell_73) v_arrayElimCell_74) v_arrayElimCell_75) c_~sum2~0)))))) (or (forall ((v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse354 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_71) v_arrayElimCell_69) v_arrayElimCell_68))) (or (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse354))))) (= (_ bv2147483647 32) (bvadd .cse354 c_~bag1~0)) (not (bvsle .cse354 (_ bv0 32))) (= (bvadd .cse354 c_~bag1~0 c_~sum1~0) (bvadd c_~bag2~0 (concat (concat (concat v_arrayElimCell_72 v_arrayElimCell_73) v_arrayElimCell_74) v_arrayElimCell_75) c_~sum2~0))))) .cse6) (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse356 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_71) v_arrayElimCell_69) v_arrayElimCell_68))) (let ((.cse355 (bvadd .cse356 c_~bag1~0 c_~sum1~0))) (or (= .cse355 (bvadd c_~bag2~0 c_~sum2~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse356))))) (= (_ bv2147483647 32) (bvadd .cse356 c_~bag1~0)) (not (bvsle .cse356 (_ bv0 32))) (= .cse355 (bvadd c_~bag2~0 (concat (concat (concat v_arrayElimCell_72 v_arrayElimCell_73) v_arrayElimCell_74) v_arrayElimCell_75) c_~sum2~0)))))) (or (and (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (let ((.cse357 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_71) v_arrayElimCell_69) v_arrayElimCell_68))) (or (= (bvadd .cse357 c_~bag1~0 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse357))))) (= (_ bv2147483647 32) (bvadd .cse357 c_~bag1~0)) (not (bvsle .cse357 (_ bv0 32)))))) (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (let ((.cse358 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_71) v_arrayElimCell_69) v_arrayElimCell_68))) (or (= (bvadd .cse358 c_~bag1~0 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse358))))) (not (bvsle c_~bag1~0 (bvadd (_ bv2147483647 32) (bvneg .cse358)))) (= (_ bv2147483647 32) (bvadd .cse358 c_~bag1~0)))))) .cse10) (or (forall ((v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse359 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_71) v_arrayElimCell_69) v_arrayElimCell_68))) (or (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse359))))) (not (bvsle c_~bag1~0 (bvadd (_ bv2147483647 32) (bvneg .cse359)))) (= (_ bv2147483647 32) (bvadd .cse359 c_~bag1~0)) (= (bvadd .cse359 c_~bag1~0 c_~sum1~0) (bvadd c_~bag2~0 (concat (concat (concat v_arrayElimCell_72 v_arrayElimCell_73) v_arrayElimCell_74) v_arrayElimCell_75) c_~sum2~0))))) .cse6)) .cse11 .cse12) (or (let ((.cse360 (forall ((v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (let ((.cse372 (concat (concat (concat v_arrayElimCell_76 v_arrayElimCell_77) v_arrayElimCell_78) v_arrayElimCell_79))) (or (= (bvadd (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_71) v_arrayElimCell_64) v_arrayElimCell_68) c_~bag1~0 c_~sum1~0) (bvadd .cse372 c_~bag2~0 c_~sum2~0)) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse372))))) (= (_ bv2147483647 32) (bvadd .cse372 c_~bag2~0)) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse372))))))))) (and (or (and .cse360 (forall ((v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8))) (let ((.cse361 (bvadd (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_71) v_arrayElimCell_64) v_arrayElimCell_68) c_~bag1~0 c_~sum1~0)) (.cse362 (concat (concat (concat v_arrayElimCell_76 v_arrayElimCell_77) v_arrayElimCell_78) v_arrayElimCell_79))) (or (= .cse361 (bvadd c_~bag2~0 c_~sum2~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (= .cse361 (bvadd .cse362 c_~bag2~0 c_~sum2~0)) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse362))))) (= (_ bv2147483647 32) (bvadd .cse362 c_~bag2~0)) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse362)))))))) .cse6) (or (and (or .cse10 (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_71) v_arrayElimCell_64) v_arrayElimCell_68) c_~bag1~0 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))))) (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse363 (bvadd (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_71) v_arrayElimCell_64) v_arrayElimCell_68) c_~bag1~0 c_~sum1~0))) (or (= .cse363 (bvadd c_~bag2~0 (concat (concat (concat v_arrayElimCell_72 v_arrayElimCell_73) v_arrayElimCell_74) v_arrayElimCell_75) c_~sum2~0)) (forall ((v_arrayElimCell_69 (_ BitVec 8))) (= .cse363 (bvadd c_~bag2~0 c_~sum2~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))))))) (or .cse6 (forall ((v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_71) v_arrayElimCell_64) v_arrayElimCell_68) c_~bag1~0 c_~sum1~0) (bvadd c_~bag2~0 (concat (concat (concat v_arrayElimCell_72 v_arrayElimCell_73) v_arrayElimCell_74) v_arrayElimCell_75) c_~sum2~0))))) .cse11 .cse12) (or (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (let ((.cse364 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse364)) (= (bvadd (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_71) v_arrayElimCell_64) v_arrayElimCell_68) c_~bag1~0 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse364)) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse364))))) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse364))))))) .cse10) (or (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (let ((.cse365 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse365)) (= (bvadd (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_71) v_arrayElimCell_64) v_arrayElimCell_68) c_~bag1~0 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse365)) (not (bvsle .cse365 (_ bv0 32))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse365)))))))) .cse10) (or (forall ((v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_83 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8))) (let ((.cse367 (bvadd (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_71) v_arrayElimCell_64) v_arrayElimCell_68) c_~bag1~0 c_~sum1~0)) (.cse366 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_81) v_arrayElimCell_82) v_arrayElimCell_83))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse366)) (= .cse367 (bvadd c_~bag2~0 c_~sum2~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (not (bvsle .cse366 (_ bv0 32))) (= .cse367 (bvadd c_~bag2~0 c_~sum2~0 .cse366)) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse366)))))))) .cse6) (or .cse6 (forall ((v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8))) (let ((.cse368 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70)) (.cse369 (bvadd (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_71) v_arrayElimCell_64) v_arrayElimCell_68) c_~bag1~0 c_~sum1~0)) (.cse370 (concat (concat (concat v_arrayElimCell_76 v_arrayElimCell_77) v_arrayElimCell_78) v_arrayElimCell_79))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse368)) (= .cse369 (bvadd c_~bag2~0 c_~sum2~0 .cse368)) (= .cse369 (bvadd .cse370 c_~bag2~0 c_~sum2~0)) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse370))))) (= (_ bv2147483647 32) (bvadd .cse370 c_~bag2~0)) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse370)))))))) (or .cse360 (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8))) (= (_ bv2147483647 32) (bvadd c_~bag2~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70)))) .cse6) (or (forall ((v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_83 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (let ((.cse371 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_81) v_arrayElimCell_82) v_arrayElimCell_83))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse371)) (not (bvsle .cse371 (_ bv0 32))) (= (bvadd (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_71) v_arrayElimCell_64) v_arrayElimCell_68) c_~bag1~0 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse371)) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse371)))))))) .cse6))) .cse35 .cse36) (or (and (forall ((v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (let ((.cse373 (concat (concat (concat v_arrayElimCell_76 v_arrayElimCell_77) v_arrayElimCell_78) v_arrayElimCell_79))) (or (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse373))))) (forall ((v_arrayElimCell_69 (_ BitVec 8))) (let ((.cse374 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_71) v_arrayElimCell_69) v_arrayElimCell_68))) (or (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse374))))) (not (bvsle c_~bag1~0 (bvadd (_ bv2147483647 32) (bvneg .cse374)))) (= (bvadd .cse374 c_~bag1~0 c_~sum1~0) (bvadd .cse373 c_~bag2~0 c_~sum2~0)) (= (_ bv2147483647 32) (bvadd .cse374 c_~bag1~0))))) (= (_ bv2147483647 32) (bvadd .cse373 c_~bag2~0)) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse373))))))) (forall ((v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (let ((.cse376 (concat (concat (concat v_arrayElimCell_76 v_arrayElimCell_77) v_arrayElimCell_78) v_arrayElimCell_79))) (or (forall ((v_arrayElimCell_69 (_ BitVec 8))) (let ((.cse375 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_71) v_arrayElimCell_69) v_arrayElimCell_68))) (or (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse375))))) (= (bvadd .cse375 c_~bag1~0 c_~sum1~0) (bvadd .cse376 c_~bag2~0 c_~sum2~0)) (= (_ bv2147483647 32) (bvadd .cse375 c_~bag1~0)) (not (bvsle .cse375 (_ bv0 32)))))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse376))))) (= (_ bv2147483647 32) (bvadd .cse376 c_~bag2~0)) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse376)))))))) .cse6) (or .cse11 (and (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse377 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_66) v_arrayElimCell_64) v_arrayElimCell_68))) (let ((.cse378 (bvadd .cse377 c_~bag1~0 c_~sum1~0))) (or (= (_ bv2147483647 32) (bvadd .cse377 c_~bag1~0)) (= .cse378 (bvadd c_~bag2~0 (concat (concat (concat v_arrayElimCell_72 v_arrayElimCell_73) v_arrayElimCell_74) v_arrayElimCell_75) c_~sum2~0)) (not (bvsle c_~bag1~0 (bvadd (bvneg .cse377) (_ bv2147483647 32)))) (= .cse378 (bvadd c_~bag2~0 c_~sum2~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse377))))))))) (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse379 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_66) v_arrayElimCell_64) v_arrayElimCell_68))) (let ((.cse380 (bvadd .cse379 c_~bag1~0 c_~sum1~0))) (or (= (_ bv2147483647 32) (bvadd .cse379 c_~bag1~0)) (= .cse380 (bvadd c_~bag2~0 (concat (concat (concat v_arrayElimCell_72 v_arrayElimCell_73) v_arrayElimCell_74) v_arrayElimCell_75) c_~sum2~0)) (= .cse380 (bvadd c_~bag2~0 c_~sum2~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (not (bvsle .cse379 (_ bv0 32))) (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse379))))))))) (or .cse6 (and (forall ((v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse381 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_66) v_arrayElimCell_64) v_arrayElimCell_68))) (or (= (_ bv2147483647 32) (bvadd .cse381 c_~bag1~0)) (= (bvadd .cse381 c_~bag1~0 c_~sum1~0) (bvadd c_~bag2~0 (concat (concat (concat v_arrayElimCell_72 v_arrayElimCell_73) v_arrayElimCell_74) v_arrayElimCell_75) c_~sum2~0)) (not (bvsle .cse381 (_ bv0 32))) (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse381)))))))) (forall ((v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse382 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_66) v_arrayElimCell_64) v_arrayElimCell_68))) (or (= (_ bv2147483647 32) (bvadd .cse382 c_~bag1~0)) (= (bvadd .cse382 c_~bag1~0 c_~sum1~0) (bvadd c_~bag2~0 (concat (concat (concat v_arrayElimCell_72 v_arrayElimCell_73) v_arrayElimCell_74) v_arrayElimCell_75) c_~sum2~0)) (not (bvsle c_~bag1~0 (bvadd (bvneg .cse382) (_ bv2147483647 32)))) (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse382)))))))))) (or (and (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8))) (let ((.cse383 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_66) v_arrayElimCell_64) v_arrayElimCell_68))) (or (= (_ bv2147483647 32) (bvadd .cse383 c_~bag1~0)) (= (bvadd .cse383 c_~bag1~0 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (not (bvsle .cse383 (_ bv0 32))) (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse383)))))))) (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8))) (let ((.cse384 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_66) v_arrayElimCell_64) v_arrayElimCell_68))) (or (= (_ bv2147483647 32) (bvadd .cse384 c_~bag1~0)) (not (bvsle c_~bag1~0 (bvadd (bvneg .cse384) (_ bv2147483647 32)))) (= (bvadd .cse384 c_~bag1~0 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse384))))))))) .cse10)) .cse12) (or (and (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (let ((.cse386 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (or (forall ((v_arrayElimCell_64 (_ BitVec 8))) (let ((.cse385 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_71) v_arrayElimCell_64) v_arrayElimCell_68))) (or (not (bvsle c_~bag1~0 (bvadd (_ bv2147483647 32) (bvneg .cse385)))) (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse385))))) (= (bvadd .cse385 c_~bag1~0 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse386)) (= (_ bv2147483647 32) (bvadd .cse385 c_~bag1~0))))) (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse386)) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse386))))) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse386))))))) (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (let ((.cse387 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse387)) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse387))))) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse387)))) (forall ((v_arrayElimCell_64 (_ BitVec 8))) (let ((.cse388 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_71) v_arrayElimCell_64) v_arrayElimCell_68))) (or (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse388))))) (= (bvadd .cse388 c_~bag1~0 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse387)) (not (bvsle .cse388 (_ bv0 32))) (= (_ bv2147483647 32) (bvadd .cse388 c_~bag1~0))))))))) .cse10) (or (and (forall ((v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_83 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8))) (let ((.cse389 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_81) v_arrayElimCell_82) v_arrayElimCell_83))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse389)) (forall ((v_arrayElimCell_64 (_ BitVec 8))) (let ((.cse390 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_66) v_arrayElimCell_64) v_arrayElimCell_68))) (or (= (_ bv2147483647 32) (bvadd .cse390 c_~bag1~0)) (not (bvsle .cse390 (_ bv0 32))) (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse390))))) (= (bvadd .cse390 c_~bag1~0 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse389))))) (not (bvsle .cse389 (_ bv0 32))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse389)))))))) (forall ((v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_83 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8))) (let ((.cse391 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_81) v_arrayElimCell_82) v_arrayElimCell_83))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse391)) (not (bvsle .cse391 (_ bv0 32))) (forall ((v_arrayElimCell_64 (_ BitVec 8))) (let ((.cse392 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_66) v_arrayElimCell_64) v_arrayElimCell_68))) (or (= (_ bv2147483647 32) (bvadd .cse392 c_~bag1~0)) (not (bvsle c_~bag1~0 (bvadd (bvneg .cse392) (_ bv2147483647 32)))) (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse392))))) (= (bvadd .cse392 c_~bag1~0 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse391))))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse391))))))))) .cse6) (or (and (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8))) (let ((.cse393 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70)) (.cse394 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_68))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse393)) (not (bvsle .cse393 (_ bv0 32))) (= (bvadd c_~bag1~0 .cse394 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse393)) (= (bvadd c_~bag1~0 .cse394) (_ bv2147483647 32)) (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse394))))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse393))))) (not (bvsle .cse394 (_ bv0 32)))))) (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8))) (let ((.cse396 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_68)) (.cse395 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse395)) (not (bvsle .cse395 (_ bv0 32))) (= (bvadd c_~bag1~0 .cse396 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse395)) (not (bvsle c_~bag1~0 (bvadd (bvneg .cse396) (_ bv2147483647 32)))) (= (bvadd c_~bag1~0 .cse396) (_ bv2147483647 32)) (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse396))))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse395))))))))) .cse10) (or (and (or (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8))) (let ((.cse397 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse397)) (= (bvadd (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_66) v_arrayElimCell_64) v_arrayElimCell_68) c_~bag1~0 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse397)) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse397))))) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse397))))))) .cse10) (or (and (or .cse6 (forall ((v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_66) v_arrayElimCell_64) v_arrayElimCell_68) c_~bag1~0 c_~sum1~0) (bvadd c_~bag2~0 (concat (concat (concat v_arrayElimCell_72 v_arrayElimCell_73) v_arrayElimCell_74) v_arrayElimCell_75) c_~sum2~0)))) (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse398 (bvadd (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_66) v_arrayElimCell_64) v_arrayElimCell_68) c_~bag1~0 c_~sum1~0))) (or (= .cse398 (bvadd c_~bag2~0 (concat (concat (concat v_arrayElimCell_72 v_arrayElimCell_73) v_arrayElimCell_74) v_arrayElimCell_75) c_~sum2~0)) (forall ((v_arrayElimCell_69 (_ BitVec 8))) (= .cse398 (bvadd c_~bag2~0 c_~sum2~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))))))) (or (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_66) v_arrayElimCell_64) v_arrayElimCell_68) c_~bag1~0 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70)))) .cse10)) .cse11 .cse12) (or (forall ((v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8))) (let ((.cse399 (concat (concat (concat v_arrayElimCell_76 v_arrayElimCell_77) v_arrayElimCell_78) v_arrayElimCell_79))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (= (bvadd (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_66) v_arrayElimCell_64) v_arrayElimCell_68) c_~bag1~0 c_~sum1~0) (bvadd .cse399 c_~bag2~0 c_~sum2~0)) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse399))))) (= (_ bv2147483647 32) (bvadd .cse399 c_~bag2~0)) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse399))))))) .cse6) (or (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8))) (let ((.cse400 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse400)) (not (bvsle .cse400 (_ bv0 32))) (= (bvadd (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_66) v_arrayElimCell_64) v_arrayElimCell_68) c_~bag1~0 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse400)) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse400)))))))) .cse10) (or (and (forall ((v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8))) (let ((.cse401 (concat (concat (concat v_arrayElimCell_76 v_arrayElimCell_77) v_arrayElimCell_78) v_arrayElimCell_79))) (or (= (bvadd (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_66) v_arrayElimCell_64) v_arrayElimCell_68) c_~bag1~0 c_~sum1~0) (bvadd .cse401 c_~bag2~0 c_~sum2~0)) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse401))))) (= (_ bv2147483647 32) (bvadd .cse401 c_~bag2~0)) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse401))))))) (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8))) (let ((.cse402 (bvadd (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_66) v_arrayElimCell_64) v_arrayElimCell_68) c_~bag1~0 c_~sum1~0)) (.cse403 (concat (concat (concat v_arrayElimCell_76 v_arrayElimCell_77) v_arrayElimCell_78) v_arrayElimCell_79))) (or (= .cse402 (bvadd c_~bag2~0 c_~sum2~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (= .cse402 (bvadd .cse403 c_~bag2~0 c_~sum2~0)) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse403))))) (= (_ bv2147483647 32) (bvadd .cse403 c_~bag2~0)) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse403)))))))) .cse6) (or (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_83 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8))) (let ((.cse405 (bvadd (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_66) v_arrayElimCell_64) v_arrayElimCell_68) c_~bag1~0 c_~sum1~0)) (.cse404 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_81) v_arrayElimCell_82) v_arrayElimCell_83))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse404)) (= .cse405 (bvadd c_~bag2~0 c_~sum2~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (not (bvsle .cse404 (_ bv0 32))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse404))))) (= .cse405 (bvadd c_~bag2~0 c_~sum2~0 .cse404))))) .cse6) (or (forall ((v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_83 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8))) (let ((.cse406 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_81) v_arrayElimCell_82) v_arrayElimCell_83))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse406)) (not (bvsle .cse406 (_ bv0 32))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse406))))) (= (bvadd (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_66) v_arrayElimCell_64) v_arrayElimCell_68) c_~bag1~0 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse406))))) .cse6) (or .cse6 (forall ((v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8))) (let ((.cse407 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70)) (.cse408 (bvadd (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_66) v_arrayElimCell_64) v_arrayElimCell_68) c_~bag1~0 c_~sum1~0)) (.cse409 (concat (concat (concat v_arrayElimCell_76 v_arrayElimCell_77) v_arrayElimCell_78) v_arrayElimCell_79))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse407)) (= .cse408 (bvadd c_~bag2~0 c_~sum2~0 .cse407)) (= .cse408 (bvadd .cse409 c_~bag2~0 c_~sum2~0)) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse409))))) (= (_ bv2147483647 32) (bvadd .cse409 c_~bag2~0)) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse409))))))))) .cse35 .cse36) (or (and (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_83 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8))) (let ((.cse410 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_81) v_arrayElimCell_82) v_arrayElimCell_83))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse410)) (forall ((v_arrayElimCell_69 (_ BitVec 8))) (let ((.cse411 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_68))) (or (not (bvsge .cse2 (bvadd (bvneg ((_ sign_extend 32) .cse411)) (_ bv18446744071562067968 64)))) (= (bvadd .cse411 c_~bag1~0 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse410)) (= (_ bv2147483647 32) (bvadd .cse411 c_~bag1~0)) (not (bvsle c_~bag1~0 (bvadd (_ bv2147483647 32) (bvneg .cse411))))))) (not (bvsle .cse410 (_ bv0 32))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse410)))))))) (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_83 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8))) (let ((.cse412 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_81) v_arrayElimCell_82) v_arrayElimCell_83))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse412)) (forall ((v_arrayElimCell_69 (_ BitVec 8))) (let ((.cse413 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_68))) (or (not (bvsge .cse2 (bvadd (bvneg ((_ sign_extend 32) .cse413)) (_ bv18446744071562067968 64)))) (not (bvsle .cse413 (_ bv0 32))) (= (bvadd .cse413 c_~bag1~0 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse412)) (= (_ bv2147483647 32) (bvadd .cse413 c_~bag1~0))))) (not (bvsle .cse412 (_ bv0 32))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse412))))))))) .cse6) (or (and (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_83 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8))) (let ((.cse414 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_81) v_arrayElimCell_82) v_arrayElimCell_83))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse414)) (forall ((v_arrayElimCell_64 (_ BitVec 8))) (let ((.cse415 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_71) v_arrayElimCell_64) v_arrayElimCell_68))) (or (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse415))))) (= (_ bv2147483647 32) (bvadd c_~bag1~0 .cse415)) (= (bvadd c_~bag1~0 .cse415 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse414)) (not (bvsle c_~bag1~0 (bvadd (_ bv2147483647 32) (bvneg .cse415))))))) (not (bvsle .cse414 (_ bv0 32))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse414)))))))) (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_83 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8))) (let ((.cse417 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_81) v_arrayElimCell_82) v_arrayElimCell_83))) (or (forall ((v_arrayElimCell_64 (_ BitVec 8))) (let ((.cse416 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_71) v_arrayElimCell_64) v_arrayElimCell_68))) (or (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse416))))) (= (_ bv2147483647 32) (bvadd c_~bag1~0 .cse416)) (= (bvadd c_~bag1~0 .cse416 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse417)) (not (bvsle .cse416 (_ bv0 32)))))) (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse417)) (not (bvsle .cse417 (_ bv0 32))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse417))))))))) .cse6) (or (and (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (let ((.cse418 (concat (concat (concat v_arrayElimCell_76 v_arrayElimCell_77) v_arrayElimCell_78) v_arrayElimCell_79))) (or (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse418))))) (forall ((v_arrayElimCell_64 (_ BitVec 8))) (let ((.cse419 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_71) v_arrayElimCell_64) v_arrayElimCell_68))) (or (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse419))))) (= (_ bv2147483647 32) (bvadd c_~bag1~0 .cse419)) (not (bvsle c_~bag1~0 (bvadd (_ bv2147483647 32) (bvneg .cse419)))) (= (bvadd c_~bag1~0 .cse419 c_~sum1~0) (bvadd .cse418 c_~bag2~0 c_~sum2~0))))) (= (_ bv2147483647 32) (bvadd .cse418 c_~bag2~0)) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse418))))))) (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (let ((.cse421 (concat (concat (concat v_arrayElimCell_76 v_arrayElimCell_77) v_arrayElimCell_78) v_arrayElimCell_79))) (or (forall ((v_arrayElimCell_64 (_ BitVec 8))) (let ((.cse420 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_71) v_arrayElimCell_64) v_arrayElimCell_68))) (or (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse420))))) (= (_ bv2147483647 32) (bvadd c_~bag1~0 .cse420)) (not (bvsle .cse420 (_ bv0 32))) (= (bvadd c_~bag1~0 .cse420 c_~sum1~0) (bvadd .cse421 c_~bag2~0 c_~sum2~0))))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse421))))) (= (_ bv2147483647 32) (bvadd .cse421 c_~bag2~0)) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse421)))))))) .cse6) (or (and (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (let ((.cse422 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse422)) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse422))))) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse422)))) (forall ((v_arrayElimCell_64 (_ BitVec 8))) (let ((.cse423 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_71) v_arrayElimCell_64) v_arrayElimCell_68))) (or (= (_ bv2147483647 32) (bvadd c_~bag1~0 .cse423)) (not (bvsle c_~bag1~0 (bvadd (_ bv2147483647 32) (bvneg .cse423)))) (= (bvadd c_~bag1~0 .cse423 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse422)))))))) (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (let ((.cse424 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse424)) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse424))))) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse424)))) (forall ((v_arrayElimCell_64 (_ BitVec 8))) (let ((.cse425 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_71) v_arrayElimCell_64) v_arrayElimCell_68))) (or (= (_ bv2147483647 32) (bvadd c_~bag1~0 .cse425)) (= (bvadd c_~bag1~0 .cse425 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse424)) (not (bvsle .cse425 (_ bv0 32)))))))))) .cse10) (or (and (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8))) (let ((.cse426 (concat (concat (concat v_arrayElimCell_76 v_arrayElimCell_77) v_arrayElimCell_78) v_arrayElimCell_79))) (or (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse426))))) (forall ((v_arrayElimCell_64 (_ BitVec 8))) (let ((.cse427 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_64) v_arrayElimCell_68))) (or (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse427))))) (= (bvadd c_~bag1~0 .cse427 c_~sum1~0) (bvadd .cse426 c_~bag2~0 c_~sum2~0)) (not (bvsle c_~bag1~0 (bvadd (_ bv2147483647 32) (bvneg .cse427)))) (= (_ bv2147483647 32) (bvadd c_~bag1~0 .cse427))))) (= (_ bv2147483647 32) (bvadd .cse426 c_~bag2~0)) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse426))))))) (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8))) (let ((.cse429 (concat (concat (concat v_arrayElimCell_76 v_arrayElimCell_77) v_arrayElimCell_78) v_arrayElimCell_79))) (or (forall ((v_arrayElimCell_64 (_ BitVec 8))) (let ((.cse428 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_64) v_arrayElimCell_68))) (or (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse428))))) (= (bvadd c_~bag1~0 .cse428 c_~sum1~0) (bvadd .cse429 c_~bag2~0 c_~sum2~0)) (not (bvsle .cse428 (_ bv0 32))) (= (_ bv2147483647 32) (bvadd c_~bag1~0 .cse428))))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse429))))) (= (_ bv2147483647 32) (bvadd .cse429 c_~bag2~0)) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse429)))))))) .cse6) (or (and (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8))) (let ((.cse430 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse430)) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse430))))) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse430)))) (forall ((v_arrayElimCell_64 (_ BitVec 8))) (let ((.cse431 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_66) v_arrayElimCell_64) v_arrayElimCell_68))) (or (= (_ bv2147483647 32) (bvadd .cse431 c_~bag1~0)) (not (bvsle c_~bag1~0 (bvadd (bvneg .cse431) (_ bv2147483647 32)))) (= (bvadd .cse431 c_~bag1~0 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse430)) (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse431))))))))))) (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8))) (let ((.cse432 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse432)) (forall ((v_arrayElimCell_64 (_ BitVec 8))) (let ((.cse433 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_66) v_arrayElimCell_64) v_arrayElimCell_68))) (or (= (_ bv2147483647 32) (bvadd .cse433 c_~bag1~0)) (= (bvadd .cse433 c_~bag1~0 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse432)) (not (bvsle .cse433 (_ bv0 32))) (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse433)))))))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse432))))) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse432)))))))) .cse10) (or (and (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (let ((.cse434 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse434)) (not (bvsle .cse434 (_ bv0 32))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse434))))) (forall ((v_arrayElimCell_64 (_ BitVec 8))) (let ((.cse435 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_71) v_arrayElimCell_64) v_arrayElimCell_68))) (or (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse435))))) (= (bvadd .cse435 c_~bag1~0 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse434)) (not (bvsle .cse435 (_ bv0 32))) (= (_ bv2147483647 32) (bvadd .cse435 c_~bag1~0)))))))) (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (let ((.cse437 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (or (forall ((v_arrayElimCell_64 (_ BitVec 8))) (let ((.cse436 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_71) v_arrayElimCell_64) v_arrayElimCell_68))) (or (not (bvsle c_~bag1~0 (bvadd (_ bv2147483647 32) (bvneg .cse436)))) (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse436))))) (= (bvadd .cse436 c_~bag1~0 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse437)) (= (_ bv2147483647 32) (bvadd .cse436 c_~bag1~0))))) (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse437)) (not (bvsle .cse437 (_ bv0 32))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse437))))))))) .cse10) (or (and (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8))) (let ((.cse440 (concat v_arrayElimCell_65 v_arrayElimCell_66))) (let ((.cse438 (concat (concat .cse440 v_arrayElimCell_69) v_arrayElimCell_70))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse438)) (forall ((v_arrayElimCell_64 (_ BitVec 8))) (let ((.cse439 (concat (concat .cse440 v_arrayElimCell_64) v_arrayElimCell_68))) (or (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse439))))) (not (bvsle .cse439 (_ bv0 32))) (= (bvadd c_~bag1~0 .cse439 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse438)) (= (_ bv2147483647 32) (bvadd c_~bag1~0 .cse439))))) (not (bvsle .cse438 (_ bv0 32))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse438))))))))) (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8))) (let ((.cse443 (concat v_arrayElimCell_65 v_arrayElimCell_66))) (let ((.cse441 (concat (concat .cse443 v_arrayElimCell_69) v_arrayElimCell_70))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse441)) (not (bvsle .cse441 (_ bv0 32))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse441))))) (forall ((v_arrayElimCell_64 (_ BitVec 8))) (let ((.cse442 (concat (concat .cse443 v_arrayElimCell_64) v_arrayElimCell_68))) (or (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse442))))) (not (bvsle c_~bag1~0 (bvadd (_ bv2147483647 32) (bvneg .cse442)))) (= (bvadd c_~bag1~0 .cse442 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse441)) (= (_ bv2147483647 32) (bvadd c_~bag1~0 .cse442)))))))))) .cse10) (or (and (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_83 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8))) (let ((.cse444 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_81) v_arrayElimCell_82) v_arrayElimCell_83))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse444)) (forall ((v_arrayElimCell_64 (_ BitVec 8))) (let ((.cse445 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_64) v_arrayElimCell_68))) (or (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse445))))) (= (bvadd c_~bag1~0 .cse445 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse444)) (not (bvsle .cse445 (_ bv0 32))) (= (_ bv2147483647 32) (bvadd c_~bag1~0 .cse445))))) (not (bvsle .cse444 (_ bv0 32))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse444)))))))) (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_83 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8))) (let ((.cse446 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_81) v_arrayElimCell_82) v_arrayElimCell_83))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse446)) (forall ((v_arrayElimCell_64 (_ BitVec 8))) (let ((.cse447 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_64) v_arrayElimCell_68))) (or (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse447))))) (= (bvadd c_~bag1~0 .cse447 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse446)) (not (bvsle c_~bag1~0 (bvadd (_ bv2147483647 32) (bvneg .cse447)))) (= (_ bv2147483647 32) (bvadd c_~bag1~0 .cse447))))) (not (bvsle .cse446 (_ bv0 32))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse446))))))))) .cse6) (or .cse6 (and (forall ((v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8))) (let ((.cse449 (concat (concat (concat v_arrayElimCell_76 v_arrayElimCell_77) v_arrayElimCell_78) v_arrayElimCell_79))) (or (forall ((v_arrayElimCell_69 (_ BitVec 8))) (let ((.cse448 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_68))) (or (= (bvadd c_~bag1~0 .cse448 c_~sum1~0) (bvadd .cse449 c_~bag2~0 c_~sum2~0)) (= (bvadd c_~bag1~0 .cse448) (_ bv2147483647 32)) (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse448))))) (not (bvsle .cse448 (_ bv0 32)))))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse449))))) (= (_ bv2147483647 32) (bvadd .cse449 c_~bag2~0)) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse449))))))) (forall ((v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8))) (let ((.cse450 (concat (concat (concat v_arrayElimCell_76 v_arrayElimCell_77) v_arrayElimCell_78) v_arrayElimCell_79))) (or (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse450))))) (forall ((v_arrayElimCell_69 (_ BitVec 8))) (let ((.cse451 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_68))) (or (= (bvadd c_~bag1~0 .cse451 c_~sum1~0) (bvadd .cse450 c_~bag2~0 c_~sum2~0)) (not (bvsle c_~bag1~0 (bvadd (bvneg .cse451) (_ bv2147483647 32)))) (= (bvadd c_~bag1~0 .cse451) (_ bv2147483647 32)) (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse451)))))))) (= (_ bv2147483647 32) (bvadd .cse450 c_~bag2~0)) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse450))))))))) (or (and (forall ((v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_83 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8))) (let ((.cse452 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_81) v_arrayElimCell_82) v_arrayElimCell_83))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse452)) (not (bvsle .cse452 (_ bv0 32))) (forall ((v_arrayElimCell_64 (_ BitVec 8))) (let ((.cse453 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_71) v_arrayElimCell_64) v_arrayElimCell_68))) (or (not (bvsle c_~bag1~0 (bvadd (_ bv2147483647 32) (bvneg .cse453)))) (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse453))))) (= (_ bv2147483647 32) (bvadd .cse453 c_~bag1~0)) (= (bvadd .cse453 c_~bag1~0 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse452))))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse452)))))))) (forall ((v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_83 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8))) (let ((.cse454 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_81) v_arrayElimCell_82) v_arrayElimCell_83))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse454)) (forall ((v_arrayElimCell_64 (_ BitVec 8))) (let ((.cse455 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_71) v_arrayElimCell_64) v_arrayElimCell_68))) (or (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse455))))) (not (bvsle .cse455 (_ bv0 32))) (= (_ bv2147483647 32) (bvadd .cse455 c_~bag1~0)) (= (bvadd .cse455 c_~bag1~0 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse454))))) (not (bvsle .cse454 (_ bv0 32))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse454))))))))) .cse6) (or (and (or .cse6 (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse456 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_68))) (or (not (bvsge .cse2 (bvadd (bvneg ((_ sign_extend 32) .cse456)) (_ bv18446744071562067968 64)))) (not (bvsle .cse456 (_ bv0 32))) (= (bvadd .cse456 c_~bag1~0 c_~sum1~0) (bvadd c_~bag2~0 (concat (concat (concat v_arrayElimCell_72 v_arrayElimCell_73) v_arrayElimCell_74) v_arrayElimCell_75) c_~sum2~0)) (= (_ bv2147483647 32) (bvadd .cse456 c_~bag1~0)))))) (or (and (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8))) (let ((.cse458 (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69))) (let ((.cse457 (concat .cse458 v_arrayElimCell_68))) (or (not (bvsge .cse2 (bvadd (bvneg ((_ sign_extend 32) .cse457)) (_ bv18446744071562067968 64)))) (not (bvsle .cse457 (_ bv0 32))) (= (bvadd .cse457 c_~bag1~0 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 (concat .cse458 v_arrayElimCell_70))) (= (_ bv2147483647 32) (bvadd .cse457 c_~bag1~0)))))) (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8))) (let ((.cse460 (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69))) (let ((.cse459 (concat .cse460 v_arrayElimCell_68))) (or (not (bvsge .cse2 (bvadd (bvneg ((_ sign_extend 32) .cse459)) (_ bv18446744071562067968 64)))) (= (bvadd .cse459 c_~bag1~0 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 (concat .cse460 v_arrayElimCell_70))) (= (_ bv2147483647 32) (bvadd .cse459 c_~bag1~0)) (not (bvsle c_~bag1~0 (bvadd (_ bv2147483647 32) (bvneg .cse459))))))))) .cse10) (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse463 (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69))) (let ((.cse461 (concat .cse463 v_arrayElimCell_68))) (let ((.cse462 (bvadd .cse461 c_~bag1~0 c_~sum1~0))) (or (not (bvsge .cse2 (bvadd (bvneg ((_ sign_extend 32) .cse461)) (_ bv18446744071562067968 64)))) (= .cse462 (bvadd c_~bag2~0 c_~sum2~0 (concat .cse463 v_arrayElimCell_70))) (= .cse462 (bvadd c_~bag2~0 (concat (concat (concat v_arrayElimCell_72 v_arrayElimCell_73) v_arrayElimCell_74) v_arrayElimCell_75) c_~sum2~0)) (= (_ bv2147483647 32) (bvadd .cse461 c_~bag1~0)) (not (bvsle c_~bag1~0 (bvadd (_ bv2147483647 32) (bvneg .cse461))))))))) (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse466 (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69))) (let ((.cse464 (concat .cse466 v_arrayElimCell_68))) (let ((.cse465 (bvadd .cse464 c_~bag1~0 c_~sum1~0))) (or (not (bvsge .cse2 (bvadd (bvneg ((_ sign_extend 32) .cse464)) (_ bv18446744071562067968 64)))) (not (bvsle .cse464 (_ bv0 32))) (= .cse465 (bvadd c_~bag2~0 c_~sum2~0 (concat .cse466 v_arrayElimCell_70))) (= .cse465 (bvadd c_~bag2~0 (concat (concat (concat v_arrayElimCell_72 v_arrayElimCell_73) v_arrayElimCell_74) v_arrayElimCell_75) c_~sum2~0)) (= (_ bv2147483647 32) (bvadd .cse464 c_~bag1~0))))))) (or .cse6 (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse467 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_68))) (or (not (bvsge .cse2 (bvadd (bvneg ((_ sign_extend 32) .cse467)) (_ bv18446744071562067968 64)))) (= (bvadd .cse467 c_~bag1~0 c_~sum1~0) (bvadd c_~bag2~0 (concat (concat (concat v_arrayElimCell_72 v_arrayElimCell_73) v_arrayElimCell_74) v_arrayElimCell_75) c_~sum2~0)) (= (_ bv2147483647 32) (bvadd .cse467 c_~bag1~0)) (not (bvsle c_~bag1~0 (bvadd (_ bv2147483647 32) (bvneg .cse467))))))))) .cse11 .cse12) (or (and (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (let ((.cse468 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_71) v_arrayElimCell_69) v_arrayElimCell_68)) (.cse469 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (or (= (bvadd .cse468 c_~bag1~0 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse469)) (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse469)) (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse468))))) (not (bvsle c_~bag1~0 (bvadd (_ bv2147483647 32) (bvneg .cse468)))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse469))))) (= (_ bv2147483647 32) (bvadd .cse468 c_~bag1~0)) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse469))))))) (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (let ((.cse471 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70)) (.cse470 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_71) v_arrayElimCell_69) v_arrayElimCell_68))) (or (= (bvadd .cse470 c_~bag1~0 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse471)) (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse471)) (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse470))))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse471))))) (= (_ bv2147483647 32) (bvadd .cse470 c_~bag1~0)) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse471)))) (not (bvsle .cse470 (_ bv0 32))))))) .cse10) (or (and (or (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse472 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_71) v_arrayElimCell_69) v_arrayElimCell_68))) (or (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse472))))) (= (_ bv2147483647 32) (bvadd .cse472 c_~bag1~0)) (not (bvsle c_~bag1~0 (bvadd (_ bv2147483647 32) (bvneg .cse472)))) (= (bvadd .cse472 c_~bag1~0 c_~sum1~0) (bvadd c_~bag2~0 (concat (concat (concat v_arrayElimCell_72 v_arrayElimCell_73) v_arrayElimCell_74) v_arrayElimCell_75) c_~sum2~0))))) .cse6) (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse473 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_71) v_arrayElimCell_69) v_arrayElimCell_68))) (let ((.cse474 (bvadd .cse473 c_~bag1~0 c_~sum1~0))) (or (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse473))))) (= (_ bv2147483647 32) (bvadd .cse473 c_~bag1~0)) (not (bvsle c_~bag1~0 (bvadd (_ bv2147483647 32) (bvneg .cse473)))) (= .cse474 (bvadd c_~bag2~0 c_~sum2~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (= .cse474 (bvadd c_~bag2~0 (concat (concat (concat v_arrayElimCell_72 v_arrayElimCell_73) v_arrayElimCell_74) v_arrayElimCell_75) c_~sum2~0)))))) (or .cse10 (and (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (let ((.cse475 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_71) v_arrayElimCell_69) v_arrayElimCell_68))) (or (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse475))))) (= (_ bv2147483647 32) (bvadd .cse475 c_~bag1~0)) (not (bvsle .cse475 (_ bv0 32))) (= (bvadd .cse475 c_~bag1~0 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70)))))) (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (let ((.cse476 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_71) v_arrayElimCell_69) v_arrayElimCell_68))) (or (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse476))))) (= (_ bv2147483647 32) (bvadd .cse476 c_~bag1~0)) (not (bvsle c_~bag1~0 (bvadd (_ bv2147483647 32) (bvneg .cse476)))) (= (bvadd .cse476 c_~bag1~0 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70)))))))) (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse477 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_71) v_arrayElimCell_69) v_arrayElimCell_68))) (let ((.cse478 (bvadd .cse477 c_~bag1~0 c_~sum1~0))) (or (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse477))))) (= (_ bv2147483647 32) (bvadd .cse477 c_~bag1~0)) (not (bvsle .cse477 (_ bv0 32))) (= .cse478 (bvadd c_~bag2~0 c_~sum2~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (= .cse478 (bvadd c_~bag2~0 (concat (concat (concat v_arrayElimCell_72 v_arrayElimCell_73) v_arrayElimCell_74) v_arrayElimCell_75) c_~sum2~0)))))) (or .cse6 (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse479 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_71) v_arrayElimCell_69) v_arrayElimCell_68))) (or (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse479))))) (= (_ bv2147483647 32) (bvadd .cse479 c_~bag1~0)) (not (bvsle .cse479 (_ bv0 32))) (= (bvadd .cse479 c_~bag1~0 c_~sum1~0) (bvadd c_~bag2~0 (concat (concat (concat v_arrayElimCell_72 v_arrayElimCell_73) v_arrayElimCell_74) v_arrayElimCell_75) c_~sum2~0))))))) .cse11 .cse12) (or (and (or (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (let ((.cse480 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (or (= (bvadd (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_71) v_arrayElimCell_69) v_arrayElimCell_68) c_~bag1~0 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse480)) (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse480)) (not (bvsle .cse480 (_ bv0 32))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse480)))))))) .cse10) (or .cse11 .cse12 (and (or (forall ((v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_71) v_arrayElimCell_69) v_arrayElimCell_68) c_~bag1~0 c_~sum1~0) (bvadd c_~bag2~0 (concat (concat (concat v_arrayElimCell_72 v_arrayElimCell_73) v_arrayElimCell_74) v_arrayElimCell_75) c_~sum2~0))) .cse6) (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse481 (bvadd (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_71) v_arrayElimCell_69) v_arrayElimCell_68) c_~bag1~0 c_~sum1~0))) (or (= .cse481 (bvadd c_~bag2~0 c_~sum2~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (= .cse481 (bvadd c_~bag2~0 (concat (concat (concat v_arrayElimCell_72 v_arrayElimCell_73) v_arrayElimCell_74) v_arrayElimCell_75) c_~sum2~0))))) (or (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_71) v_arrayElimCell_69) v_arrayElimCell_68) c_~bag1~0 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70)))) .cse10))) (or (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (let ((.cse482 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (or (= (bvadd (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_71) v_arrayElimCell_69) v_arrayElimCell_68) c_~bag1~0 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse482)) (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse482)) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse482))))) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse482))))))) .cse10) (or .cse6 (forall ((v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (let ((.cse483 (concat (concat (concat v_arrayElimCell_76 v_arrayElimCell_77) v_arrayElimCell_78) v_arrayElimCell_79))) (or (= (bvadd (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_71) v_arrayElimCell_69) v_arrayElimCell_68) c_~bag1~0 c_~sum1~0) (bvadd .cse483 c_~bag2~0 c_~sum2~0)) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse483))))) (= (_ bv2147483647 32) (bvadd .cse483 c_~bag2~0)) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse483)))))))) (or (forall ((v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_83 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (let ((.cse484 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_81) v_arrayElimCell_82) v_arrayElimCell_83))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse484)) (= (bvadd (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_71) v_arrayElimCell_69) v_arrayElimCell_68) c_~bag1~0 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse484)) (not (bvsle .cse484 (_ bv0 32))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse484)))))))) .cse6)) .cse35 .cse36) (or (and (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (let ((.cse485 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse485)) (not (bvsle .cse485 (_ bv0 32))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse485))))) (forall ((v_arrayElimCell_64 (_ BitVec 8))) (let ((.cse486 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_71) v_arrayElimCell_64) v_arrayElimCell_68))) (or (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse486))))) (= (_ bv2147483647 32) (bvadd c_~bag1~0 .cse486)) (= (bvadd c_~bag1~0 .cse486 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse485)) (not (bvsle .cse486 (_ bv0 32))))))))) (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (let ((.cse487 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse487)) (not (bvsle .cse487 (_ bv0 32))) (forall ((v_arrayElimCell_64 (_ BitVec 8))) (let ((.cse488 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_71) v_arrayElimCell_64) v_arrayElimCell_68))) (or (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse488))))) (= (_ bv2147483647 32) (bvadd c_~bag1~0 .cse488)) (not (bvsle c_~bag1~0 (bvadd (_ bv2147483647 32) (bvneg .cse488)))) (= (bvadd c_~bag1~0 .cse488 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse487))))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse487))))))))) .cse10) (or (and (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (let ((.cse490 (concat (concat (concat v_arrayElimCell_76 v_arrayElimCell_77) v_arrayElimCell_78) v_arrayElimCell_79))) (or (forall ((v_arrayElimCell_69 (_ BitVec 8))) (let ((.cse489 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_71) v_arrayElimCell_69) v_arrayElimCell_68))) (or (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse489))))) (= (_ bv2147483647 32) (bvadd .cse489 c_~bag1~0)) (not (bvsle c_~bag1~0 (bvadd (_ bv2147483647 32) (bvneg .cse489)))) (= (bvadd .cse489 c_~bag1~0 c_~sum1~0) (bvadd .cse490 c_~bag2~0 c_~sum2~0))))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse490))))) (= (_ bv2147483647 32) (bvadd .cse490 c_~bag2~0)) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse490))))))) (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (let ((.cse492 (concat (concat (concat v_arrayElimCell_76 v_arrayElimCell_77) v_arrayElimCell_78) v_arrayElimCell_79))) (or (forall ((v_arrayElimCell_69 (_ BitVec 8))) (let ((.cse491 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_71) v_arrayElimCell_69) v_arrayElimCell_68))) (or (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse491))))) (= (_ bv2147483647 32) (bvadd .cse491 c_~bag1~0)) (= (bvadd .cse491 c_~bag1~0 c_~sum1~0) (bvadd .cse492 c_~bag2~0 c_~sum2~0)) (not (bvsle .cse491 (_ bv0 32)))))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse492))))) (= (_ bv2147483647 32) (bvadd .cse492 c_~bag2~0)) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse492)))))))) .cse6) (or (and (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse494 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_68))) (let ((.cse493 (bvadd c_~bag1~0 .cse494 c_~sum1~0))) (or (= .cse493 (bvadd c_~bag2~0 (concat (concat (concat v_arrayElimCell_72 v_arrayElimCell_73) v_arrayElimCell_74) v_arrayElimCell_75) c_~sum2~0)) (= .cse493 (bvadd c_~bag2~0 c_~sum2~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (not (bvsle c_~bag1~0 (bvadd (bvneg .cse494) (_ bv2147483647 32)))) (= (bvadd c_~bag1~0 .cse494) (_ bv2147483647 32)) (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse494))))))))) (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse496 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_68))) (let ((.cse495 (bvadd c_~bag1~0 .cse496 c_~sum1~0))) (or (= .cse495 (bvadd c_~bag2~0 (concat (concat (concat v_arrayElimCell_72 v_arrayElimCell_73) v_arrayElimCell_74) v_arrayElimCell_75) c_~sum2~0)) (= .cse495 (bvadd c_~bag2~0 c_~sum2~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (= (bvadd c_~bag1~0 .cse496) (_ bv2147483647 32)) (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse496))))) (not (bvsle .cse496 (_ bv0 32))))))) (or (forall ((v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse497 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_68))) (or (= (bvadd c_~bag1~0 .cse497 c_~sum1~0) (bvadd c_~bag2~0 (concat (concat (concat v_arrayElimCell_72 v_arrayElimCell_73) v_arrayElimCell_74) v_arrayElimCell_75) c_~sum2~0)) (not (bvsle c_~bag1~0 (bvadd (bvneg .cse497) (_ bv2147483647 32)))) (= (bvadd c_~bag1~0 .cse497) (_ bv2147483647 32)) (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse497)))))))) .cse6) (or (forall ((v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse498 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_68))) (or (= (bvadd c_~bag1~0 .cse498 c_~sum1~0) (bvadd c_~bag2~0 (concat (concat (concat v_arrayElimCell_72 v_arrayElimCell_73) v_arrayElimCell_74) v_arrayElimCell_75) c_~sum2~0)) (= (bvadd c_~bag1~0 .cse498) (_ bv2147483647 32)) (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse498))))) (not (bvsle .cse498 (_ bv0 32)))))) .cse6) (or (and (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8))) (let ((.cse499 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_68))) (or (= (bvadd c_~bag1~0 .cse499 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (not (bvsle c_~bag1~0 (bvadd (bvneg .cse499) (_ bv2147483647 32)))) (= (bvadd c_~bag1~0 .cse499) (_ bv2147483647 32)) (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse499)))))))) (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8))) (let ((.cse500 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_68))) (or (= (bvadd c_~bag1~0 .cse500 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (= (bvadd c_~bag1~0 .cse500) (_ bv2147483647 32)) (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse500))))) (not (bvsle .cse500 (_ bv0 32))))))) .cse10)) .cse11 .cse12) (or (and (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8))) (let ((.cse501 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse501)) (forall ((v_arrayElimCell_64 (_ BitVec 8))) (let ((.cse502 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_66) v_arrayElimCell_64) v_arrayElimCell_68))) (or (= (_ bv2147483647 32) (bvadd .cse502 c_~bag1~0)) (= (bvadd .cse502 c_~bag1~0 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse501)) (not (bvsle .cse502 (_ bv0 32))) (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse502)))))))) (not (bvsle .cse501 (_ bv0 32))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse501)))))))) (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8))) (let ((.cse503 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse503)) (not (bvsle .cse503 (_ bv0 32))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse503))))) (forall ((v_arrayElimCell_64 (_ BitVec 8))) (let ((.cse504 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_66) v_arrayElimCell_64) v_arrayElimCell_68))) (or (= (_ bv2147483647 32) (bvadd .cse504 c_~bag1~0)) (not (bvsle c_~bag1~0 (bvadd (bvneg .cse504) (_ bv2147483647 32)))) (= (bvadd .cse504 c_~bag1~0 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse503)) (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse504)))))))))))) .cse10) (or (and (forall ((v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8))) (let ((.cse506 (concat (concat (concat v_arrayElimCell_76 v_arrayElimCell_77) v_arrayElimCell_78) v_arrayElimCell_79))) (or (forall ((v_arrayElimCell_64 (_ BitVec 8))) (let ((.cse505 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_66) v_arrayElimCell_64) v_arrayElimCell_68))) (or (= (_ bv2147483647 32) (bvadd .cse505 c_~bag1~0)) (= (bvadd .cse505 c_~bag1~0 c_~sum1~0) (bvadd .cse506 c_~bag2~0 c_~sum2~0)) (not (bvsle .cse505 (_ bv0 32))) (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse505)))))))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse506))))) (= (_ bv2147483647 32) (bvadd .cse506 c_~bag2~0)) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse506))))))) (forall ((v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8))) (let ((.cse507 (concat (concat (concat v_arrayElimCell_76 v_arrayElimCell_77) v_arrayElimCell_78) v_arrayElimCell_79))) (or (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse507))))) (forall ((v_arrayElimCell_64 (_ BitVec 8))) (let ((.cse508 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_66) v_arrayElimCell_64) v_arrayElimCell_68))) (or (= (_ bv2147483647 32) (bvadd .cse508 c_~bag1~0)) (not (bvsle c_~bag1~0 (bvadd (bvneg .cse508) (_ bv2147483647 32)))) (= (bvadd .cse508 c_~bag1~0 c_~sum1~0) (bvadd .cse507 c_~bag2~0 c_~sum2~0)) (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse508)))))))) (= (_ bv2147483647 32) (bvadd .cse507 c_~bag2~0)) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse507)))))))) .cse6) (or (and (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8))) (let ((.cse511 (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69))) (let ((.cse509 (concat .cse511 v_arrayElimCell_70)) (.cse510 (concat .cse511 v_arrayElimCell_68))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse509)) (= (bvadd .cse510 c_~bag1~0 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse509)) (= (_ bv2147483647 32) (bvadd .cse510 c_~bag1~0)) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse509))))) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse509)))) (not (bvsle c_~bag1~0 (bvadd (_ bv2147483647 32) (bvneg .cse510)))))))) (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8))) (let ((.cse514 (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69))) (let ((.cse513 (concat .cse514 v_arrayElimCell_68)) (.cse512 (concat .cse514 v_arrayElimCell_70))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse512)) (not (bvsle .cse513 (_ bv0 32))) (= (bvadd .cse513 c_~bag1~0 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse512)) (= (_ bv2147483647 32) (bvadd .cse513 c_~bag1~0)) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse512))))) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse512))))))))) .cse10) (or .cse35 .cse36 (and (or (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_83 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8))) (let ((.cse515 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_81) v_arrayElimCell_82) v_arrayElimCell_83))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse515)) (= (bvadd (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_68) c_~bag1~0 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse515)) (not (bvsle .cse515 (_ bv0 32))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse515)))))))) .cse6) (or (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8))) (let ((.cse517 (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69))) (let ((.cse516 (concat .cse517 v_arrayElimCell_70))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse516)) (= (bvadd (concat .cse517 v_arrayElimCell_68) c_~bag1~0 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse516)) (not (bvsle .cse516 (_ bv0 32))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse516))))))))) .cse10) (or (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8))) (let ((.cse519 (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69))) (let ((.cse518 (concat .cse519 v_arrayElimCell_70))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse518)) (= (bvadd (concat .cse519 v_arrayElimCell_68) c_~bag1~0 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse518)) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse518))))) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse518)))))))) .cse10) (or (and (or .cse6 (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_68) c_~bag1~0 c_~sum1~0) (bvadd c_~bag2~0 (concat (concat (concat v_arrayElimCell_72 v_arrayElimCell_73) v_arrayElimCell_74) v_arrayElimCell_75) c_~sum2~0)))) (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse521 (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69))) (let ((.cse520 (bvadd (concat .cse521 v_arrayElimCell_68) c_~bag1~0 c_~sum1~0))) (or (= .cse520 (bvadd c_~bag2~0 c_~sum2~0 (concat .cse521 v_arrayElimCell_70))) (= .cse520 (bvadd c_~bag2~0 (concat (concat (concat v_arrayElimCell_72 v_arrayElimCell_73) v_arrayElimCell_74) v_arrayElimCell_75) c_~sum2~0)))))) (or .cse10 (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8))) (let ((.cse522 (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69))) (= (bvadd (concat .cse522 v_arrayElimCell_68) c_~bag1~0 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 (concat .cse522 v_arrayElimCell_70))))))) .cse11 .cse12) (or .cse6 (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8))) (let ((.cse523 (concat (concat (concat v_arrayElimCell_76 v_arrayElimCell_77) v_arrayElimCell_78) v_arrayElimCell_79))) (or (= (bvadd (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_68) c_~bag1~0 c_~sum1~0) (bvadd .cse523 c_~bag2~0 c_~sum2~0)) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse523))))) (= (_ bv2147483647 32) (bvadd .cse523 c_~bag2~0)) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse523)))))))))) (or (and (or (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (let ((.cse524 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse524)) (= (bvadd c_~bag1~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_71) v_arrayElimCell_64) v_arrayElimCell_68) c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse524)) (not (bvsle .cse524 (_ bv0 32))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse524)))))))) .cse10) (or (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (let ((.cse525 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse525)) (= (bvadd c_~bag1~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_71) v_arrayElimCell_64) v_arrayElimCell_68) c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse525)) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse525))))) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse525))))))) .cse10) (or .cse6 (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (let ((.cse526 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70)) (.cse527 (bvadd c_~bag1~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_71) v_arrayElimCell_64) v_arrayElimCell_68) c_~sum1~0)) (.cse528 (concat (concat (concat v_arrayElimCell_76 v_arrayElimCell_77) v_arrayElimCell_78) v_arrayElimCell_79))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse526)) (= .cse527 (bvadd c_~bag2~0 c_~sum2~0 .cse526)) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse528))))) (= .cse527 (bvadd .cse528 c_~bag2~0 c_~sum2~0)) (= (_ bv2147483647 32) (bvadd .cse528 c_~bag2~0)) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse528)))))))) (or .cse11 .cse12 (and (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse529 (bvadd c_~bag1~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_71) v_arrayElimCell_64) v_arrayElimCell_68) c_~sum1~0))) (or (forall ((v_arrayElimCell_69 (_ BitVec 8))) (= .cse529 (bvadd c_~bag2~0 c_~sum2~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70)))) (= .cse529 (bvadd c_~bag2~0 (concat (concat (concat v_arrayElimCell_72 v_arrayElimCell_73) v_arrayElimCell_74) v_arrayElimCell_75) c_~sum2~0))))) (or .cse6 (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (= (bvadd c_~bag1~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_71) v_arrayElimCell_64) v_arrayElimCell_68) c_~sum1~0) (bvadd c_~bag2~0 (concat (concat (concat v_arrayElimCell_72 v_arrayElimCell_73) v_arrayElimCell_74) v_arrayElimCell_75) c_~sum2~0)))) (or (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (= (bvadd c_~bag1~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_71) v_arrayElimCell_64) v_arrayElimCell_68) c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70)))) .cse10))) (or .cse6 (and (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (let ((.cse530 (concat (concat (concat v_arrayElimCell_76 v_arrayElimCell_77) v_arrayElimCell_78) v_arrayElimCell_79))) (or (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse530))))) (= (bvadd c_~bag1~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_71) v_arrayElimCell_64) v_arrayElimCell_68) c_~sum1~0) (bvadd .cse530 c_~bag2~0 c_~sum2~0)) (= (_ bv2147483647 32) (bvadd .cse530 c_~bag2~0)) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse530))))))) (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (let ((.cse531 (bvadd c_~bag1~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_71) v_arrayElimCell_64) v_arrayElimCell_68) c_~sum1~0)) (.cse532 (concat (concat (concat v_arrayElimCell_76 v_arrayElimCell_77) v_arrayElimCell_78) v_arrayElimCell_79))) (or (= .cse531 (bvadd c_~bag2~0 c_~sum2~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse532))))) (= .cse531 (bvadd .cse532 c_~bag2~0 c_~sum2~0)) (= (_ bv2147483647 32) (bvadd .cse532 c_~bag2~0)) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse532))))))))) (or .cse6 (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_83 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (let ((.cse533 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_81) v_arrayElimCell_82) v_arrayElimCell_83))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse533)) (= (bvadd c_~bag1~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_71) v_arrayElimCell_64) v_arrayElimCell_68) c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse533)) (not (bvsle .cse533 (_ bv0 32))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse533))))))))) (or .cse6 (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_83 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (let ((.cse535 (bvadd c_~bag1~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_71) v_arrayElimCell_64) v_arrayElimCell_68) c_~sum1~0)) (.cse534 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_81) v_arrayElimCell_82) v_arrayElimCell_83))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse534)) (= .cse535 (bvadd c_~bag2~0 c_~sum2~0 .cse534)) (= .cse535 (bvadd c_~bag2~0 c_~sum2~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (not (bvsle .cse534 (_ bv0 32))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse534))))))))) (or (forall ((v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (let ((.cse536 (concat (concat (concat v_arrayElimCell_76 v_arrayElimCell_77) v_arrayElimCell_78) v_arrayElimCell_79))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse536))))) (= (bvadd c_~bag1~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_71) v_arrayElimCell_64) v_arrayElimCell_68) c_~sum1~0) (bvadd .cse536 c_~bag2~0 c_~sum2~0)) (= (_ bv2147483647 32) (bvadd .cse536 c_~bag2~0)) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse536))))))) .cse6)) .cse35 .cse36) (or .cse11 .cse12 (and (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse537 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_71) v_arrayElimCell_64) v_arrayElimCell_68))) (let ((.cse538 (bvadd c_~bag1~0 .cse537 c_~sum1~0))) (or (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse537))))) (= (_ bv2147483647 32) (bvadd c_~bag1~0 .cse537)) (= .cse538 (bvadd c_~bag2~0 c_~sum2~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (not (bvsle .cse537 (_ bv0 32))) (= .cse538 (bvadd c_~bag2~0 (concat (concat (concat v_arrayElimCell_72 v_arrayElimCell_73) v_arrayElimCell_74) v_arrayElimCell_75) c_~sum2~0)))))) (or .cse6 (and (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse539 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_71) v_arrayElimCell_64) v_arrayElimCell_68))) (or (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse539))))) (= (_ bv2147483647 32) (bvadd c_~bag1~0 .cse539)) (not (bvsle c_~bag1~0 (bvadd (_ bv2147483647 32) (bvneg .cse539)))) (= (bvadd c_~bag1~0 .cse539 c_~sum1~0) (bvadd c_~bag2~0 (concat (concat (concat v_arrayElimCell_72 v_arrayElimCell_73) v_arrayElimCell_74) v_arrayElimCell_75) c_~sum2~0))))) (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse540 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_71) v_arrayElimCell_64) v_arrayElimCell_68))) (or (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse540))))) (= (_ bv2147483647 32) (bvadd c_~bag1~0 .cse540)) (not (bvsle .cse540 (_ bv0 32))) (= (bvadd c_~bag1~0 .cse540 c_~sum1~0) (bvadd c_~bag2~0 (concat (concat (concat v_arrayElimCell_72 v_arrayElimCell_73) v_arrayElimCell_74) v_arrayElimCell_75) c_~sum2~0))))))) (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse541 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_71) v_arrayElimCell_64) v_arrayElimCell_68))) (let ((.cse542 (bvadd c_~bag1~0 .cse541 c_~sum1~0))) (or (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse541))))) (= (_ bv2147483647 32) (bvadd c_~bag1~0 .cse541)) (not (bvsle c_~bag1~0 (bvadd (_ bv2147483647 32) (bvneg .cse541)))) (= .cse542 (bvadd c_~bag2~0 c_~sum2~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (= .cse542 (bvadd c_~bag2~0 (concat (concat (concat v_arrayElimCell_72 v_arrayElimCell_73) v_arrayElimCell_74) v_arrayElimCell_75) c_~sum2~0)))))) (or (and (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (let ((.cse543 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_71) v_arrayElimCell_64) v_arrayElimCell_68))) (or (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse543))))) (= (_ bv2147483647 32) (bvadd c_~bag1~0 .cse543)) (= (bvadd c_~bag1~0 .cse543 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (not (bvsle .cse543 (_ bv0 32)))))) (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (let ((.cse544 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_71) v_arrayElimCell_64) v_arrayElimCell_68))) (or (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse544))))) (= (_ bv2147483647 32) (bvadd c_~bag1~0 .cse544)) (not (bvsle c_~bag1~0 (bvadd (_ bv2147483647 32) (bvneg .cse544)))) (= (bvadd c_~bag1~0 .cse544 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))))))) .cse10))) (or .cse6 (and (forall ((v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_83 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8))) (let ((.cse545 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_81) v_arrayElimCell_82) v_arrayElimCell_83))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse545)) (forall ((v_arrayElimCell_69 (_ BitVec 8))) (let ((.cse546 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_68))) (or (= (bvadd c_~bag1~0 .cse546 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse545)) (= (bvadd c_~bag1~0 .cse546) (_ bv2147483647 32)) (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse546))))) (not (bvsle .cse546 (_ bv0 32)))))) (not (bvsle .cse545 (_ bv0 32))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse545)))))))) (forall ((v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_83 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8))) (let ((.cse548 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_81) v_arrayElimCell_82) v_arrayElimCell_83))) (or (forall ((v_arrayElimCell_69 (_ BitVec 8))) (let ((.cse547 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_68))) (or (not (bvsle c_~bag1~0 (bvadd (bvneg .cse547) (_ bv2147483647 32)))) (= (bvadd c_~bag1~0 .cse547 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse548)) (= (bvadd c_~bag1~0 .cse547) (_ bv2147483647 32)) (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse547)))))))) (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse548)) (not (bvsle .cse548 (_ bv0 32))) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse548)))))))))) (or .cse11 (and (or (and (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (let ((.cse549 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_71) v_arrayElimCell_64) v_arrayElimCell_68))) (or (not (bvsle c_~bag1~0 (bvadd (_ bv2147483647 32) (bvneg .cse549)))) (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse549))))) (= (bvadd .cse549 c_~bag1~0 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (= (_ bv2147483647 32) (bvadd .cse549 c_~bag1~0))))) (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8))) (let ((.cse550 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_71) v_arrayElimCell_64) v_arrayElimCell_68))) (or (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse550))))) (= (bvadd .cse550 c_~bag1~0 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (not (bvsle .cse550 (_ bv0 32))) (= (_ bv2147483647 32) (bvadd .cse550 c_~bag1~0)))))) .cse10) (forall ((v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8)) (v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8))) (let ((.cse551 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_71) v_arrayElimCell_64) v_arrayElimCell_68))) (let ((.cse552 (bvadd .cse551 c_~bag1~0 c_~sum1~0))) (or (not (bvsle c_~bag1~0 (bvadd (_ bv2147483647 32) (bvneg .cse551)))) (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse551))))) (= .cse552 (bvadd c_~bag2~0 c_~sum2~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (= .cse552 (bvadd c_~bag2~0 (concat (concat (concat v_arrayElimCell_72 v_arrayElimCell_73) v_arrayElimCell_74) v_arrayElimCell_75) c_~sum2~0)) (= (_ bv2147483647 32) (bvadd .cse551 c_~bag1~0)))))) (forall ((v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8)) (v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8))) (let ((.cse553 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_71) v_arrayElimCell_64) v_arrayElimCell_68))) (let ((.cse554 (bvadd .cse553 c_~bag1~0 c_~sum1~0))) (or (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse553))))) (= .cse554 (bvadd c_~bag2~0 c_~sum2~0 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (not (bvsle .cse553 (_ bv0 32))) (= .cse554 (bvadd c_~bag2~0 (concat (concat (concat v_arrayElimCell_72 v_arrayElimCell_73) v_arrayElimCell_74) v_arrayElimCell_75) c_~sum2~0)) (= (_ bv2147483647 32) (bvadd .cse553 c_~bag1~0)))))) (or .cse6 (and (forall ((v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse555 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_71) v_arrayElimCell_64) v_arrayElimCell_68))) (or (not (bvsle c_~bag1~0 (bvadd (_ bv2147483647 32) (bvneg .cse555)))) (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse555))))) (= (bvadd .cse555 c_~bag1~0 c_~sum1~0) (bvadd c_~bag2~0 (concat (concat (concat v_arrayElimCell_72 v_arrayElimCell_73) v_arrayElimCell_74) v_arrayElimCell_75) c_~sum2~0)) (= (_ bv2147483647 32) (bvadd .cse555 c_~bag1~0))))) (forall ((v_arrayElimCell_64 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_67 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse556 (concat (concat (concat v_arrayElimCell_67 v_arrayElimCell_71) v_arrayElimCell_64) v_arrayElimCell_68))) (or (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse556))))) (not (bvsle .cse556 (_ bv0 32))) (= (bvadd .cse556 c_~bag1~0 c_~sum1~0) (bvadd c_~bag2~0 (concat (concat (concat v_arrayElimCell_72 v_arrayElimCell_73) v_arrayElimCell_74) v_arrayElimCell_75) c_~sum2~0)) (= (_ bv2147483647 32) (bvadd .cse556 c_~bag1~0)))))))) .cse12) (or (and (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8))) (let ((.cse559 (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69))) (let ((.cse558 (concat .cse559 v_arrayElimCell_70)) (.cse557 (concat .cse559 v_arrayElimCell_68))) (or (not (bvsge .cse2 (bvadd (bvneg ((_ sign_extend 32) .cse557)) (_ bv18446744071562067968 64)))) (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse558)) (= (bvadd .cse557 c_~bag1~0 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse558)) (not (bvsle .cse558 (_ bv0 32))) (= (_ bv2147483647 32) (bvadd .cse557 c_~bag1~0)) (not (bvsle c_~bag1~0 (bvadd (_ bv2147483647 32) (bvneg .cse557)))))))) (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8))) (let ((.cse562 (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69))) (let ((.cse560 (concat .cse562 v_arrayElimCell_68)) (.cse561 (concat .cse562 v_arrayElimCell_70))) (or (not (bvsge .cse2 (bvadd (bvneg ((_ sign_extend 32) .cse560)) (_ bv18446744071562067968 64)))) (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse561)) (not (bvsle .cse560 (_ bv0 32))) (= (bvadd .cse560 c_~bag1~0 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse561)) (not (bvsle .cse561 (_ bv0 32))) (= (_ bv2147483647 32) (bvadd .cse560 c_~bag1~0)) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse561)))))))))) .cse10) (or (and (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8))) (let ((.cse565 (concat v_arrayElimCell_65 v_arrayElimCell_66))) (let ((.cse563 (concat (concat .cse565 v_arrayElimCell_69) v_arrayElimCell_70))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse563)) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse563))))) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse563)))) (forall ((v_arrayElimCell_64 (_ BitVec 8))) (let ((.cse564 (concat (concat .cse565 v_arrayElimCell_64) v_arrayElimCell_68))) (or (not (bvsle .cse564 (_ bv0 32))) (= (bvadd c_~bag1~0 .cse564 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse563)) (= (_ bv2147483647 32) (bvadd c_~bag1~0 .cse564))))))))) (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_68 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8))) (let ((.cse568 (concat v_arrayElimCell_65 v_arrayElimCell_66))) (let ((.cse566 (concat (concat .cse568 v_arrayElimCell_69) v_arrayElimCell_70))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse566)) (not (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse566))))) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse566)))) (forall ((v_arrayElimCell_64 (_ BitVec 8))) (let ((.cse567 (concat (concat .cse568 v_arrayElimCell_64) v_arrayElimCell_68))) (or (not (bvsle c_~bag1~0 (bvadd (_ bv2147483647 32) (bvneg .cse567)))) (= (bvadd c_~bag1~0 .cse567 c_~sum1~0) (bvadd c_~bag2~0 c_~sum2~0 .cse566)) (= (_ bv2147483647 32) (bvadd c_~bag1~0 .cse567)))))))))) .cse10)) .cse74) (or (let ((.cse569 (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse574 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (or (not (bvsle c_~bag1~0 (bvadd (_ bv2147483647 32) (bvneg .cse574)))) (= (bvadd c_~bag2~0 (concat (concat (concat v_arrayElimCell_72 v_arrayElimCell_73) v_arrayElimCell_74) v_arrayElimCell_75) c_~sum2~0) (bvadd c_~bag1~0 .cse574 c_~sum1~0)) (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse574))))) (= (_ bv2147483647 32) (bvadd c_~bag1~0 .cse574)))))) (.cse572 (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse573 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (or (not (bvsle .cse573 (_ bv0 32))) (= (bvadd c_~bag2~0 (concat (concat (concat v_arrayElimCell_72 v_arrayElimCell_73) v_arrayElimCell_74) v_arrayElimCell_75) c_~sum2~0) (bvadd c_~bag1~0 .cse573 c_~sum1~0)) (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse573))))) (= (_ bv2147483647 32) (bvadd c_~bag1~0 .cse573))))))) (and (or .cse569 .cse80) (or .cse10 (and (or .cse80 (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8))) (let ((.cse570 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (or (not (bvsle .cse570 (_ bv0 32))) (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse570))))) (= (_ bv2147483647 32) (bvadd c_~bag1~0 .cse570)))))) (or (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8))) (let ((.cse571 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (or (not (bvsle c_~bag1~0 (bvadd (_ bv2147483647 32) (bvneg .cse571)))) (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse571))))) (= (_ bv2147483647 32) (bvadd c_~bag1~0 .cse571))))) .cse80))) (or .cse572 .cse80) (or .cse569 .cse6) (or .cse572 .cse6))) .cse11 .cse12) (or (and (or .cse80 (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8))) (let ((.cse575 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (let ((.cse576 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse575))))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse575)) (not (bvsle .cse575 (_ bv0 32))) (not (bvsge .cse23 .cse576)) (not (bvsge .cse2 .cse576)) (= (_ bv2147483647 32) (bvadd c_~bag1~0 .cse575))))))) (or .cse80 (forall ((v_arrayElimCell_65 (_ BitVec 8)) (v_arrayElimCell_66 (_ BitVec 8)) (v_arrayElimCell_69 (_ BitVec 8)) (v_arrayElimCell_70 (_ BitVec 8))) (let ((.cse577 (concat (concat (concat v_arrayElimCell_65 v_arrayElimCell_66) v_arrayElimCell_69) v_arrayElimCell_70))) (or (= (_ bv2147483647 32) (bvadd c_~bag2~0 .cse577)) (not (bvsle .cse577 (_ bv0 32))) (not (bvsle c_~bag1~0 (bvadd (_ bv2147483647 32) (bvneg .cse577)))) (not (bvsge .cse2 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse577))))) (= (_ bv2147483647 32) (bvadd c_~bag1~0 .cse577))))))) .cse10)))) is different from true