./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/array-fpi/res1o.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b 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_e257710e-1649-4730-bf23-c8b867799573/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e257710e-1649-4730-bf23-c8b867799573/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e257710e-1649-4730-bf23-c8b867799573/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e257710e-1649-4730-bf23-c8b867799573/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/array-fpi/res1o.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e257710e-1649-4730-bf23-c8b867799573/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e257710e-1649-4730-bf23-c8b867799573/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 64693615f2d98484fbf4ccec390e9fe8d95f9d4648b0c6cc4a2e86f0656bfacf --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:12:15,505 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:12:15,602 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e257710e-1649-4730-bf23-c8b867799573/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 22:12:15,608 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:12:15,609 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:12:15,647 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:12:15,647 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:12:15,648 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:12:15,649 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:12:15,649 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:12:15,650 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:12:15,651 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:12:15,651 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:12:15,655 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:12:15,657 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:12:15,657 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:12:15,658 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:12:15,658 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:12:15,658 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:12:15,659 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:12:15,659 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:12:15,660 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:12:15,660 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:12:15,661 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:12:15,661 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:12:15,662 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:12:15,662 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:12:15,663 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:12:15,664 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:12:15,664 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:12:15,665 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:12:15,666 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:12:15,666 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:12:15,666 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:12:15,667 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:12:15,674 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:12:15,675 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:12:15,675 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:12:15,675 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:12:15,675 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e257710e-1649-4730-bf23-c8b867799573/bin/uautomizer-verify-WvqO1wxjHP/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_e257710e-1649-4730-bf23-c8b867799573/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 64693615f2d98484fbf4ccec390e9fe8d95f9d4648b0c6cc4a2e86f0656bfacf [2023-11-06 22:12:16,051 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:12:16,078 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:12:16,080 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:12:16,081 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:12:16,081 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:12:16,082 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e257710e-1649-4730-bf23-c8b867799573/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/array-fpi/res1o.c [2023-11-06 22:12:19,145 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:12:19,397 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:12:19,398 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e257710e-1649-4730-bf23-c8b867799573/sv-benchmarks/c/array-fpi/res1o.c [2023-11-06 22:12:19,416 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e257710e-1649-4730-bf23-c8b867799573/bin/uautomizer-verify-WvqO1wxjHP/data/82e9b8db8/acc83c5edaa0474f9672ef08b7670505/FLAG4656bb9f5 [2023-11-06 22:12:19,430 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e257710e-1649-4730-bf23-c8b867799573/bin/uautomizer-verify-WvqO1wxjHP/data/82e9b8db8/acc83c5edaa0474f9672ef08b7670505 [2023-11-06 22:12:19,432 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:12:19,434 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:12:19,435 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:12:19,436 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:12:19,441 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:12:19,441 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:12:19" (1/1) ... [2023-11-06 22:12:19,442 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74077061 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:12:19, skipping insertion in model container [2023-11-06 22:12:19,443 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:12:19" (1/1) ... [2023-11-06 22:12:19,464 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:12:19,626 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_e257710e-1649-4730-bf23-c8b867799573/sv-benchmarks/c/array-fpi/res1o.c[588,601] [2023-11-06 22:12:19,647 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:12:19,657 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:12:19,671 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_e257710e-1649-4730-bf23-c8b867799573/sv-benchmarks/c/array-fpi/res1o.c[588,601] [2023-11-06 22:12:19,679 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:12:19,693 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:12:19,694 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:12:19 WrapperNode [2023-11-06 22:12:19,694 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:12:19,695 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:12:19,695 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:12:19,695 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:12:19,702 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:12:19" (1/1) ... [2023-11-06 22:12:19,710 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:12:19" (1/1) ... [2023-11-06 22:12:19,733 INFO L138 Inliner]: procedures = 17, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 96 [2023-11-06 22:12:19,734 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:12:19,735 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:12:19,735 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:12:19,735 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:12:19,743 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:12:19" (1/1) ... [2023-11-06 22:12:19,743 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:12:19" (1/1) ... [2023-11-06 22:12:19,746 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:12:19" (1/1) ... [2023-11-06 22:12:19,746 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:12:19" (1/1) ... [2023-11-06 22:12:19,753 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:12:19" (1/1) ... [2023-11-06 22:12:19,757 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:12:19" (1/1) ... [2023-11-06 22:12:19,758 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:12:19" (1/1) ... [2023-11-06 22:12:19,759 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:12:19" (1/1) ... [2023-11-06 22:12:19,762 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:12:19,763 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:12:19,763 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:12:19,763 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:12:19,764 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:12:19" (1/1) ... [2023-11-06 22:12:19,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:12:19,787 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e257710e-1649-4730-bf23-c8b867799573/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:12:19,802 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e257710e-1649-4730-bf23-c8b867799573/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:12:19,806 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e257710e-1649-4730-bf23-c8b867799573/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:12:19,836 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:12:19,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:12:19,836 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:12:19,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:12:19,837 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-06 22:12:19,837 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:12:19,837 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:12:19,837 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 22:12:19,837 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:12:19,910 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:12:19,912 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:12:20,170 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:12:20,177 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:12:20,177 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-06 22:12:20,180 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:12:20 BoogieIcfgContainer [2023-11-06 22:12:20,180 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:12:20,182 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:12:20,183 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:12:20,186 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:12:20,186 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:12:19" (1/3) ... [2023-11-06 22:12:20,187 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@239fd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:12:20, skipping insertion in model container [2023-11-06 22:12:20,187 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:12:19" (2/3) ... [2023-11-06 22:12:20,188 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@239fd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:12:20, skipping insertion in model container [2023-11-06 22:12:20,188 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:12:20" (3/3) ... [2023-11-06 22:12:20,189 INFO L112 eAbstractionObserver]: Analyzing ICFG res1o.c [2023-11-06 22:12:20,209 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:12:20,209 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:12:20,251 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:12:20,257 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7bfdf19e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:12:20,258 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:12:20,262 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:12:20,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-06 22:12:20,269 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:12:20,269 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:12:20,270 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:12:20,275 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:12:20,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1202110748, now seen corresponding path program 1 times [2023-11-06 22:12:20,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:12:20,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393839164] [2023-11-06 22:12:20,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:12:20,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:12:20,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:20,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:12:20,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:12:20,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393839164] [2023-11-06 22:12:20,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393839164] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:12:20,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:12:20,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:12:20,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217134171] [2023-11-06 22:12:20,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:12:20,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:12:20,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:12:20,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:12:20,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:12:20,588 INFO L87 Difference]: Start difference. First operand has 24 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 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) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 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-11-06 22:12:20,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:12:20,610 INFO L93 Difference]: Finished difference Result 44 states and 62 transitions. [2023-11-06 22:12:20,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:12:20,612 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 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-11-06 22:12:20,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:12:20,621 INFO L225 Difference]: With dead ends: 44 [2023-11-06 22:12:20,621 INFO L226 Difference]: Without dead ends: 20 [2023-11-06 22:12:20,624 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:12:20,629 INFO L413 NwaCegarLoop]: 28 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, 28 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:12:20,630 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:12:20,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-11-06 22:12:20,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2023-11-06 22:12:20,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:12:20,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2023-11-06 22:12:20,668 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 15 [2023-11-06 22:12:20,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:12:20,669 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2023-11-06 22:12:20,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 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-11-06 22:12:20,670 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2023-11-06 22:12:20,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-06 22:12:20,671 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:12:20,671 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:12:20,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:12:20,673 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:12:20,674 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:12:20,674 INFO L85 PathProgramCache]: Analyzing trace with hash -944124056, now seen corresponding path program 1 times [2023-11-06 22:12:20,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:12:20,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281993510] [2023-11-06 22:12:20,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:12:20,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:12:20,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:20,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:12:20,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:12:20,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281993510] [2023-11-06 22:12:20,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281993510] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:12:20,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:12:20,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:12:20,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875630588] [2023-11-06 22:12:20,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:12:20,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:12:20,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:12:20,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:12:20,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:12:20,928 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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-11-06 22:12:21,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:12:21,003 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2023-11-06 22:12:21,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:12:21,004 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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-11-06 22:12:21,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:12:21,005 INFO L225 Difference]: With dead ends: 41 [2023-11-06 22:12:21,005 INFO L226 Difference]: Without dead ends: 28 [2023-11-06 22:12:21,006 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:12:21,007 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 23 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:12:21,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 12 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:12:21,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-11-06 22:12:21,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2023-11-06 22:12:21,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:12:21,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2023-11-06 22:12:21,021 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 15 [2023-11-06 22:12:21,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:12:21,022 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2023-11-06 22:12:21,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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-11-06 22:12:21,022 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2023-11-06 22:12:21,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-06 22:12:21,025 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:12:21,025 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:12:21,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:12:21,026 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:12:21,028 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:12:21,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1401448688, now seen corresponding path program 1 times [2023-11-06 22:12:21,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:12:21,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602455164] [2023-11-06 22:12:21,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:12:21,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:12:21,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:22,575 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:12:22,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:12:22,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602455164] [2023-11-06 22:12:22,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602455164] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:12:22,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [396861648] [2023-11-06 22:12:22,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:12:22,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:12:22,577 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e257710e-1649-4730-bf23-c8b867799573/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:12:22,581 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e257710e-1649-4730-bf23-c8b867799573/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:12:22,603 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e257710e-1649-4730-bf23-c8b867799573/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 22:12:22,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:22,677 INFO L262 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 43 conjunts are in the unsatisfiable core [2023-11-06 22:12:22,685 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:12:22,859 INFO L351 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-11-06 22:12:22,878 INFO L351 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-11-06 22:12:22,973 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-06 22:12:23,239 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2023-11-06 22:12:23,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:12:23,490 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-06 22:12:23,491 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2023-11-06 22:12:23,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:12:23,766 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-06 22:12:23,767 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 33 [2023-11-06 22:12:23,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:12:23,934 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-06 22:12:23,935 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 13 [2023-11-06 22:12:23,975 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:12:23,975 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:12:24,390 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:12:24,392 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:12:24,400 INFO L351 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-11-06 22:12:24,440 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:12:24,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [396861648] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:12:24,441 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:12:24,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 32 [2023-11-06 22:12:24,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764590218] [2023-11-06 22:12:24,442 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:12:24,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-11-06 22:12:24,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:12:24,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-11-06 22:12:24,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=795, Unknown=0, NotChecked=0, Total=992 [2023-11-06 22:12:24,446 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 32 states, 32 states have (on average 1.875) internal successors, (60), 32 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:12:25,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:12:25,201 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2023-11-06 22:12:25,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-06 22:12:25,203 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.875) internal successors, (60), 32 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-11-06 22:12:25,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:12:25,204 INFO L225 Difference]: With dead ends: 40 [2023-11-06 22:12:25,204 INFO L226 Difference]: Without dead ends: 36 [2023-11-06 22:12:25,205 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=304, Invalid=1256, Unknown=0, NotChecked=0, Total=1560 [2023-11-06 22:12:25,206 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 51 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:12:25,207 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 81 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 22:12:25,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2023-11-06 22:12:25,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2023-11-06 22:12:25,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.1875) internal successors, (38), 32 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:12:25,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2023-11-06 22:12:25,224 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 23 [2023-11-06 22:12:25,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:12:25,225 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2023-11-06 22:12:25,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.875) internal successors, (60), 32 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:12:25,226 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2023-11-06 22:12:25,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-06 22:12:25,227 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:12:25,227 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:12:25,239 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e257710e-1649-4730-bf23-c8b867799573/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-06 22:12:25,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e257710e-1649-4730-bf23-c8b867799573/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:12:25,433 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:12:25,434 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:12:25,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1774307726, now seen corresponding path program 2 times [2023-11-06 22:12:25,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:12:25,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245360757] [2023-11-06 22:12:25,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:12:25,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:12:25,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:25,560 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-06 22:12:25,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:12:25,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245360757] [2023-11-06 22:12:25,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245360757] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:12:25,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [17124168] [2023-11-06 22:12:25,562 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:12:25,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:12:25,562 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e257710e-1649-4730-bf23-c8b867799573/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:12:25,564 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e257710e-1649-4730-bf23-c8b867799573/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:12:25,591 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e257710e-1649-4730-bf23-c8b867799573/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 22:12:25,658 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 22:12:25,658 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:12:25,659 INFO L262 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 22:12:25,661 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:12:25,715 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-06 22:12:25,716 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:12:25,765 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-06 22:12:25,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [17124168] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:12:25,765 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:12:25,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2023-11-06 22:12:25,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236161146] [2023-11-06 22:12:25,766 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:12:25,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 22:12:25,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:12:25,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 22:12:25,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:12:25,768 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:12:25,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:12:25,937 INFO L93 Difference]: Finished difference Result 80 states and 91 transitions. [2023-11-06 22:12:25,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:12:25,938 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-11-06 22:12:25,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:12:25,940 INFO L225 Difference]: With dead ends: 80 [2023-11-06 22:12:25,941 INFO L226 Difference]: Without dead ends: 48 [2023-11-06 22:12:25,941 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2023-11-06 22:12:25,947 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 49 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:12:25,949 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 37 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:12:25,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-11-06 22:12:25,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 34. [2023-11-06 22:12:25,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:12:25,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2023-11-06 22:12:25,969 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 25 [2023-11-06 22:12:25,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:12:25,969 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2023-11-06 22:12:25,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:12:25,970 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2023-11-06 22:12:25,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-06 22:12:25,972 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:12:25,972 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:12:25,983 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e257710e-1649-4730-bf23-c8b867799573/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-06 22:12:26,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e257710e-1649-4730-bf23-c8b867799573/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:12:26,183 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:12:26,183 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:12:26,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1964080588, now seen corresponding path program 3 times [2023-11-06 22:12:26,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:12:26,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314623869] [2023-11-06 22:12:26,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:12:26,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:12:26,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:26,289 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-06 22:12:26,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:12:26,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314623869] [2023-11-06 22:12:26,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314623869] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:12:26,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [391662562] [2023-11-06 22:12:26,290 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 22:12:26,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:12:26,292 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e257710e-1649-4730-bf23-c8b867799573/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:12:26,293 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e257710e-1649-4730-bf23-c8b867799573/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:12:26,319 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e257710e-1649-4730-bf23-c8b867799573/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-06 22:12:26,400 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-06 22:12:26,400 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:12:26,401 INFO L262 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 22:12:26,403 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:12:26,461 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-06 22:12:26,461 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:12:26,516 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-06 22:12:26,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [391662562] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:12:26,520 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:12:26,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2023-11-06 22:12:26,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081440139] [2023-11-06 22:12:26,522 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:12:26,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 22:12:26,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:12:26,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 22:12:26,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:12:26,524 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:12:26,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:12:26,654 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2023-11-06 22:12:26,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:12:26,655 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-11-06 22:12:26,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:12:26,656 INFO L225 Difference]: With dead ends: 43 [2023-11-06 22:12:26,656 INFO L226 Difference]: Without dead ends: 35 [2023-11-06 22:12:26,656 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 46 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2023-11-06 22:12:26,657 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 53 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:12:26,658 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 22 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:12:26,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-11-06 22:12:26,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2023-11-06 22:12:26,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:12:26,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2023-11-06 22:12:26,665 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 27 [2023-11-06 22:12:26,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:12:26,666 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2023-11-06 22:12:26,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:12:26,666 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2023-11-06 22:12:26,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-06 22:12:26,667 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:12:26,668 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:12:26,683 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e257710e-1649-4730-bf23-c8b867799573/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-06 22:12:26,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e257710e-1649-4730-bf23-c8b867799573/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:12:26,884 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:12:26,884 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:12:26,885 INFO L85 PathProgramCache]: Analyzing trace with hash 666081912, now seen corresponding path program 4 times [2023-11-06 22:12:26,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:12:26,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173114975] [2023-11-06 22:12:26,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:12:26,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:12:26,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:28,954 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:12:28,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:12:28,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173114975] [2023-11-06 22:12:28,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173114975] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:12:28,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1488133086] [2023-11-06 22:12:28,955 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-06 22:12:28,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:12:28,955 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e257710e-1649-4730-bf23-c8b867799573/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:12:28,956 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e257710e-1649-4730-bf23-c8b867799573/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:12:28,990 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e257710e-1649-4730-bf23-c8b867799573/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-06 22:12:29,067 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-06 22:12:29,067 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:12:29,069 INFO L262 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 59 conjunts are in the unsatisfiable core [2023-11-06 22:12:29,074 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:12:29,093 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-06 22:12:29,094 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2023-11-06 22:12:29,108 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-06 22:12:29,162 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-06 22:12:29,320 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2023-11-06 22:12:29,696 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:12:29,696 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 35 [2023-11-06 22:12:29,891 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:12:29,892 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 35 [2023-11-06 22:12:30,292 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:12:30,293 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 40 [2023-11-06 22:12:30,519 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:12:30,519 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 50 [2023-11-06 22:12:30,884 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:12:30,884 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 55 [2023-11-06 22:12:31,116 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:12:31,117 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 55 [2023-11-06 22:12:31,352 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:12:31,353 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 19 [2023-11-06 22:12:31,391 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:12:31,392 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:12:36,144 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:12:36,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1488133086] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:12:36,145 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:12:36,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23, 23] total 62 [2023-11-06 22:12:36,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222470261] [2023-11-06 22:12:36,145 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:12:36,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2023-11-06 22:12:36,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:12:36,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2023-11-06 22:12:36,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=531, Invalid=3250, Unknown=1, NotChecked=0, Total=3782 [2023-11-06 22:12:36,150 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 62 states, 62 states have (on average 1.2741935483870968) internal successors, (79), 62 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:12:40,026 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:12:52,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:12:52,955 INFO L93 Difference]: Finished difference Result 88 states and 101 transitions. [2023-11-06 22:12:52,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2023-11-06 22:12:52,956 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 1.2741935483870968) internal successors, (79), 62 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-11-06 22:12:52,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:12:52,958 INFO L225 Difference]: With dead ends: 88 [2023-11-06 22:12:52,958 INFO L226 Difference]: Without dead ends: 82 [2023-11-06 22:12:52,964 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3781 ImplicationChecksByTransitivity, 17.0s TimeCoverageRelationStatistics Valid=1492, Invalid=9637, Unknown=1, NotChecked=0, Total=11130 [2023-11-06 22:12:52,965 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 57 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 846 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 846 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2023-11-06 22:12:52,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 111 Invalid, 985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 846 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2023-11-06 22:12:52,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-11-06 22:12:52,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 69. [2023-11-06 22:12:52,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 68 states have (on average 1.1911764705882353) internal successors, (81), 68 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:12:52,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 81 transitions. [2023-11-06 22:12:52,992 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 81 transitions. Word has length 31 [2023-11-06 22:12:52,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:12:52,992 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 81 transitions. [2023-11-06 22:12:52,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 1.2741935483870968) internal successors, (79), 62 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:12:52,993 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 81 transitions. [2023-11-06 22:12:52,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-06 22:12:52,994 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:12:52,994 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:12:53,004 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e257710e-1649-4730-bf23-c8b867799573/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-06 22:12:53,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e257710e-1649-4730-bf23-c8b867799573/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-06 22:12:53,200 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:12:53,200 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:12:53,201 INFO L85 PathProgramCache]: Analyzing trace with hash 207824378, now seen corresponding path program 5 times [2023-11-06 22:12:53,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:12:53,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129251203] [2023-11-06 22:12:53,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:12:53,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:12:53,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:53,335 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-06 22:12:53,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:12:53,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129251203] [2023-11-06 22:12:53,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129251203] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:12:53,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [736666618] [2023-11-06 22:12:53,336 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-06 22:12:53,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:12:53,337 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e257710e-1649-4730-bf23-c8b867799573/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:12:53,338 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e257710e-1649-4730-bf23-c8b867799573/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:12:53,363 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e257710e-1649-4730-bf23-c8b867799573/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-06 22:12:53,448 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2023-11-06 22:12:53,448 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:12:53,449 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-06 22:12:53,451 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:12:53,541 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-06 22:12:53,541 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:12:53,617 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-06 22:12:53,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [736666618] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:12:53,617 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:12:53,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2023-11-06 22:12:53,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402525807] [2023-11-06 22:12:53,618 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:12:53,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-06 22:12:53,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:12:53,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-06 22:12:53,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2023-11-06 22:12:53,619 INFO L87 Difference]: Start difference. First operand 69 states and 81 transitions. Second operand has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 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-11-06 22:12:53,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:12:53,848 INFO L93 Difference]: Finished difference Result 133 states and 153 transitions. [2023-11-06 22:12:53,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 22:12:53,848 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 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 33 [2023-11-06 22:12:53,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:12:53,849 INFO L225 Difference]: With dead ends: 133 [2023-11-06 22:12:53,849 INFO L226 Difference]: Without dead ends: 76 [2023-11-06 22:12:53,850 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 56 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2023-11-06 22:12:53,851 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 80 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:12:53,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 38 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:12:53,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2023-11-06 22:12:53,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 62. [2023-11-06 22:12:53,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.1475409836065573) internal successors, (70), 61 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:12:53,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 70 transitions. [2023-11-06 22:12:53,881 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 70 transitions. Word has length 33 [2023-11-06 22:12:53,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:12:53,882 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 70 transitions. [2023-11-06 22:12:53,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 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-11-06 22:12:53,882 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2023-11-06 22:12:53,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-11-06 22:12:53,887 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:12:53,888 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:12:53,900 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e257710e-1649-4730-bf23-c8b867799573/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-06 22:12:54,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e257710e-1649-4730-bf23-c8b867799573/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-11-06 22:12:54,094 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:12:54,094 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:12:54,094 INFO L85 PathProgramCache]: Analyzing trace with hash 236928956, now seen corresponding path program 6 times [2023-11-06 22:12:54,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:12:54,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296011468] [2023-11-06 22:12:54,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:12:54,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:12:54,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:54,245 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-06 22:12:54,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:12:54,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296011468] [2023-11-06 22:12:54,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296011468] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:12:54,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1248896667] [2023-11-06 22:12:54,246 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-06 22:12:54,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:12:54,246 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e257710e-1649-4730-bf23-c8b867799573/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:12:54,248 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e257710e-1649-4730-bf23-c8b867799573/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:12:54,263 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e257710e-1649-4730-bf23-c8b867799573/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-06 22:12:54,385 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2023-11-06 22:12:54,385 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:12:54,387 INFO L262 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-06 22:12:54,389 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:12:54,484 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-06 22:12:54,485 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:12:54,567 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-06 22:12:54,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1248896667] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:12:54,567 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:12:54,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2023-11-06 22:12:54,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136961599] [2023-11-06 22:12:54,568 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:12:54,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-06 22:12:54,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:12:54,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-06 22:12:54,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2023-11-06 22:12:54,569 INFO L87 Difference]: Start difference. First operand 62 states and 70 transitions. Second operand has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 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-11-06 22:12:54,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:12:54,775 INFO L93 Difference]: Finished difference Result 71 states and 79 transitions. [2023-11-06 22:12:54,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-06 22:12:54,776 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 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 35 [2023-11-06 22:12:54,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:12:54,777 INFO L225 Difference]: With dead ends: 71 [2023-11-06 22:12:54,777 INFO L226 Difference]: Without dead ends: 55 [2023-11-06 22:12:54,777 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 59 SyntacticMatches, 6 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2023-11-06 22:12:54,778 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 48 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:12:54,778 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 30 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:12:54,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-11-06 22:12:54,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 40. [2023-11-06 22:12:54,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 39 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:12:54,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2023-11-06 22:12:54,792 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 35 [2023-11-06 22:12:54,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:12:54,793 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2023-11-06 22:12:54,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 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-11-06 22:12:54,793 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2023-11-06 22:12:54,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-11-06 22:12:54,794 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:12:54,794 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:12:54,805 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e257710e-1649-4730-bf23-c8b867799573/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-06 22:12:55,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e257710e-1649-4730-bf23-c8b867799573/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-11-06 22:12:55,000 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:12:55,001 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:12:55,001 INFO L85 PathProgramCache]: Analyzing trace with hash 315843584, now seen corresponding path program 7 times [2023-11-06 22:12:55,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:12:55,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705285651] [2023-11-06 22:12:55,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:12:55,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:12:55,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:58,897 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:12:58,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:12:58,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705285651] [2023-11-06 22:12:58,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705285651] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:12:58,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1366401207] [2023-11-06 22:12:58,897 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-06 22:12:58,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:12:58,898 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e257710e-1649-4730-bf23-c8b867799573/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:12:58,900 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e257710e-1649-4730-bf23-c8b867799573/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:12:58,927 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e257710e-1649-4730-bf23-c8b867799573/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-06 22:12:59,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:59,015 INFO L262 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 78 conjunts are in the unsatisfiable core [2023-11-06 22:12:59,021 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:12:59,157 INFO L351 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-11-06 22:12:59,165 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-06 22:12:59,165 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2023-11-06 22:12:59,255 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-06 22:12:59,465 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-11-06 22:12:59,682 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2023-11-06 22:13:00,036 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 43 [2023-11-06 22:13:00,322 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 43 [2023-11-06 22:13:00,596 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 43 [2023-11-06 22:13:00,953 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 48 [2023-11-06 22:13:01,274 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 58 [2023-11-06 22:13:01,627 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 68 [2023-11-06 22:13:02,116 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 6 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 73 [2023-11-06 22:13:02,465 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 6 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 73 [2023-11-06 22:13:02,832 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 6 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 73 [2023-11-06 22:13:03,212 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 6 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 25 [2023-11-06 22:13:03,285 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:13:03,286 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:13:21,701 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:21,702 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:21,704 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:21,712 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:13:21,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1366401207] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:13:21,713 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:13:21,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 29, 27] total 81 [2023-11-06 22:13:21,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265684959] [2023-11-06 22:13:21,714 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:13:21,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 81 states [2023-11-06 22:13:21,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:13:21,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2023-11-06 22:13:21,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=535, Invalid=5945, Unknown=0, NotChecked=0, Total=6480 [2023-11-06 22:13:21,718 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand has 81 states, 81 states have (on average 1.3209876543209877) internal successors, (107), 81 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:13:42,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:13:42,422 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2023-11-06 22:13:42,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-11-06 22:13:42,423 INFO L78 Accepts]: Start accepts. Automaton has has 81 states, 81 states have (on average 1.3209876543209877) internal successors, (107), 81 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2023-11-06 22:13:42,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:13:42,424 INFO L225 Difference]: With dead ends: 64 [2023-11-06 22:13:42,424 INFO L226 Difference]: Without dead ends: 60 [2023-11-06 22:13:42,427 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3406 ImplicationChecksByTransitivity, 34.4s TimeCoverageRelationStatistics Valid=848, Invalid=9052, Unknown=0, NotChecked=0, Total=9900 [2023-11-06 22:13:42,428 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 46 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 1376 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 1429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:13:42,428 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 121 Invalid, 1429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1376 Invalid, 0 Unknown, 0 Unchecked, 7.2s Time] [2023-11-06 22:13:42,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-11-06 22:13:42,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 53. [2023-11-06 22:13:42,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 52 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:13:42,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2023-11-06 22:13:42,449 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 39 [2023-11-06 22:13:42,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:13:42,449 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2023-11-06 22:13:42,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 81 states, 81 states have (on average 1.3209876543209877) internal successors, (107), 81 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:13:42,450 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2023-11-06 22:13:42,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-11-06 22:13:42,450 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:13:42,451 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:13:42,468 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e257710e-1649-4730-bf23-c8b867799573/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-06 22:13:42,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e257710e-1649-4730-bf23-c8b867799573/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:13:42,668 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:13:42,668 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:13:42,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1363759742, now seen corresponding path program 8 times [2023-11-06 22:13:42,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:13:42,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473757269] [2023-11-06 22:13:42,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:13:42,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:13:42,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:42,848 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-06 22:13:42,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:13:42,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473757269] [2023-11-06 22:13:42,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473757269] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:13:42,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119578956] [2023-11-06 22:13:42,849 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:13:42,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:13:42,850 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e257710e-1649-4730-bf23-c8b867799573/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:13:42,852 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e257710e-1649-4730-bf23-c8b867799573/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:13:42,876 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e257710e-1649-4730-bf23-c8b867799573/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-06 22:13:42,968 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 22:13:42,968 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:13:42,970 INFO L262 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-06 22:13:42,972 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:13:43,119 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-06 22:13:43,120 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:13:43,232 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-06 22:13:43,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2119578956] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:13:43,232 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:13:43,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2023-11-06 22:13:43,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926497714] [2023-11-06 22:13:43,232 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:13:43,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-06 22:13:43,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:13:43,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-06 22:13:43,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2023-11-06 22:13:43,234 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:13:43,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:13:43,545 INFO L93 Difference]: Finished difference Result 120 states and 131 transitions. [2023-11-06 22:13:43,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-06 22:13:43,546 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2023-11-06 22:13:43,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:13:43,546 INFO L225 Difference]: With dead ends: 120 [2023-11-06 22:13:43,547 INFO L226 Difference]: Without dead ends: 68 [2023-11-06 22:13:43,547 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 69 SyntacticMatches, 7 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2023-11-06 22:13:43,548 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 88 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:13:43,548 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 40 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:13:43,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2023-11-06 22:13:43,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 54. [2023-11-06 22:13:43,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.0943396226415094) internal successors, (58), 53 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:13:43,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2023-11-06 22:13:43,575 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 41 [2023-11-06 22:13:43,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:13:43,575 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2023-11-06 22:13:43,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:13:43,576 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2023-11-06 22:13:43,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-11-06 22:13:43,576 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:13:43,577 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:13:43,585 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e257710e-1649-4730-bf23-c8b867799573/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-06 22:13:43,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e257710e-1649-4730-bf23-c8b867799573/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:13:43,783 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:13:43,783 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:13:43,783 INFO L85 PathProgramCache]: Analyzing trace with hash -554920636, now seen corresponding path program 9 times [2023-11-06 22:13:43,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:13:43,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247068610] [2023-11-06 22:13:43,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:13:43,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:13:43,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:43,960 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-06 22:13:43,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:13:43,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247068610] [2023-11-06 22:13:43,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247068610] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:13:43,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1378599721] [2023-11-06 22:13:43,961 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 22:13:43,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:13:43,961 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e257710e-1649-4730-bf23-c8b867799573/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:13:43,964 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e257710e-1649-4730-bf23-c8b867799573/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:13:43,978 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e257710e-1649-4730-bf23-c8b867799573/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-06 22:13:44,213 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-11-06 22:13:44,213 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:13:44,215 INFO L262 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-06 22:13:44,217 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:13:44,340 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-06 22:13:44,340 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:13:44,450 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-06 22:13:44,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1378599721] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:13:44,450 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:13:44,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2023-11-06 22:13:44,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903468503] [2023-11-06 22:13:44,451 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:13:44,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-06 22:13:44,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:13:44,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-06 22:13:44,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2023-11-06 22:13:44,452 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand has 17 states, 17 states have (on average 3.823529411764706) internal successors, (65), 17 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:13:44,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:13:44,714 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2023-11-06 22:13:44,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-06 22:13:44,715 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.823529411764706) internal successors, (65), 17 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2023-11-06 22:13:44,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:13:44,717 INFO L225 Difference]: With dead ends: 63 [2023-11-06 22:13:44,717 INFO L226 Difference]: Without dead ends: 51 [2023-11-06 22:13:44,717 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 74 SyntacticMatches, 8 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2023-11-06 22:13:44,719 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 70 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:13:44,720 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 31 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:13:44,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-11-06 22:13:44,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2023-11-06 22:13:44,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.0851063829787233) internal successors, (51), 47 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-11-06 22:13:44,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2023-11-06 22:13:44,747 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 43 [2023-11-06 22:13:44,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:13:44,747 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2023-11-06 22:13:44,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.823529411764706) internal successors, (65), 17 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:13:44,747 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2023-11-06 22:13:44,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-11-06 22:13:44,748 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:13:44,748 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:13:44,753 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e257710e-1649-4730-bf23-c8b867799573/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-11-06 22:13:44,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e257710e-1649-4730-bf23-c8b867799573/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:13:44,949 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:13:44,949 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:13:44,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1719679608, now seen corresponding path program 10 times [2023-11-06 22:13:44,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:13:44,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123192376] [2023-11-06 22:13:44,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:13:44,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:13:45,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:49,892 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:13:49,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:13:49,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123192376] [2023-11-06 22:13:49,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123192376] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:13:49,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [469599587] [2023-11-06 22:13:49,893 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-06 22:13:49,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:13:49,894 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e257710e-1649-4730-bf23-c8b867799573/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:13:49,896 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e257710e-1649-4730-bf23-c8b867799573/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:13:49,903 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e257710e-1649-4730-bf23-c8b867799573/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-06 22:13:50,145 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-06 22:13:50,145 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:13:50,148 INFO L262 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 96 conjunts are in the unsatisfiable core [2023-11-06 22:13:50,160 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:13:50,182 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-06 22:13:50,193 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-06 22:13:50,193 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2023-11-06 22:13:50,280 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-06 22:13:50,458 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-11-06 22:13:50,636 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2023-11-06 22:13:50,854 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 48 [2023-11-06 22:13:51,363 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 51 [2023-11-06 22:13:51,602 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 51 [2023-11-06 22:13:51,863 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 51 [2023-11-06 22:13:52,127 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 51 [2023-11-06 22:13:52,720 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 58 [2023-11-06 22:13:52,999 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 68 [2023-11-06 22:13:53,322 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 9 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 78 [2023-11-06 22:13:53,643 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 9 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 88 [2023-11-06 22:13:54,107 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 9 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 84 [2023-11-06 22:13:54,483 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 9 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 93 [2023-11-06 22:13:54,857 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 9 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 93 [2023-11-06 22:13:55,228 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 9 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 93 [2023-11-06 22:13:55,596 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 9 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 31 [2023-11-06 22:13:55,661 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:13:55,661 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:14:35,824 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:14:35,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [469599587] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:14:35,825 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:14:35,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 39, 39] total 112 [2023-11-06 22:14:35,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571445023] [2023-11-06 22:14:35,825 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:14:35,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 112 states [2023-11-06 22:14:35,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:14:35,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2023-11-06 22:14:35,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1586, Invalid=10846, Unknown=0, NotChecked=0, Total=12432 [2023-11-06 22:14:35,832 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand has 112 states, 112 states have (on average 1.1339285714285714) internal successors, (127), 112 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-11-06 22:14:48,202 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse41 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse98 (* |c_ULTIMATE.start_main_~i~0#1| 4)) (.cse9 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse12 (select .cse41 (+ .cse98 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse29 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse12))))) (let ((.cse50 (select .cse29 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse99 (+ .cse98 |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse24 (select .cse41 .cse99)) (.cse88 (* c_~N~0 4)) (.cse6 (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse5 (+ 8 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse3 (+ 12 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse63 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse78 (select .cse41 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse64 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse62 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse11 (select .cse50 .cse99))) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse11 .cse12)))) (.cse14 (+ .cse98 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse0 (not (= (+ 3 |c_ULTIMATE.start_main_~i~0#1|) c_~N~0))) (.cse25 (forall ((v_ArrVal_627 Int) (v_ArrVal_625 Int) (v_ArrVal_622 Int)) (let ((.cse93 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse41 .cse62 1)))) (let ((.cse91 (store .cse93 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse94 (select .cse93 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse94 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse97 (select .cse94 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse95 (select (select (store .cse93 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse94 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse97 .cse78))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse64))) (let ((.cse96 (select (select (store .cse93 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse94 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse95 .cse97 .cse78))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse63))) (+ (select (select (store .cse93 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse94 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse95 .cse96 .cse97 .cse78))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse62) .cse95 .cse96 .cse97 .cse78))))))))) (let ((.cse92 (store (store (store (store (select .cse91 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) .cse6 1) .cse5 1) .cse3 1))) (let ((.cse90 (store .cse93 |c_ULTIMATE.start_main_~b~0#1.base| .cse92)) (.cse89 (select (store .cse91 |c_ULTIMATE.start_main_~b~0#1.base| .cse92) |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ (select .cse89 |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1) v_ArrVal_622) (< (+ v_ArrVal_622 (select (select (store .cse90 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse89 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_622)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse6)) v_ArrVal_625) (< (+ v_ArrVal_625 (select (select (store .cse90 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse89 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_625)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse5)) v_ArrVal_627) (< (+ v_ArrVal_627 (select (select (store .cse90 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse89 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_627)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse3)) 9)))))))) (.cse39 (+ .cse88 (- 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse40 (+ .cse88 |c_ULTIMATE.start_main_~a~0#1.offset| (- 8))) (.cse42 (+ .cse88 (- 12) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse43 (not (= c_~N~0 (+ |c_ULTIMATE.start_main_~i~0#1| 4)))) (.cse51 (forall ((v_ArrVal_627 Int) (v_ArrVal_625 Int) (v_ArrVal_622 Int)) (let ((.cse83 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse41 .cse63 1) .cse62 1)))) (let ((.cse81 (store .cse83 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse84 (select .cse83 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse84 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse85 (select .cse84 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse86 (select (select (store .cse83 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse84 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse85 .cse78))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse64))) (let ((.cse87 (select (select (store .cse83 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse84 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse85 .cse86 .cse78))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse63))) (+ .cse85 .cse86 (select (select (store .cse83 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse84 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse85 .cse86 .cse78 .cse87))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse62) .cse78 .cse87))))))))) (let ((.cse82 (store (store (store (store (select .cse81 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) .cse6 1) .cse5 1) .cse3 1))) (let ((.cse80 (store .cse83 |c_ULTIMATE.start_main_~b~0#1.base| .cse82)) (.cse79 (select (store .cse81 |c_ULTIMATE.start_main_~b~0#1.base| .cse82) |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ (select .cse79 |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1) v_ArrVal_622) (< (+ v_ArrVal_625 (select (select (store .cse80 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse79 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_625)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse5)) v_ArrVal_627) (< (+ v_ArrVal_627 (select (select (store .cse80 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse79 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_627)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse3)) 9) (< (+ v_ArrVal_622 (select (select (store .cse80 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse79 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_622)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse6)) v_ArrVal_625)))))))) (.cse26 (not (= 2 |c_ULTIMATE.start_main_~i~0#1|))) (.cse31 (forall ((v_ArrVal_627 Int) (v_ArrVal_625 Int) (v_ArrVal_622 Int)) (let ((.cse73 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store .cse41 .cse64 1) .cse63 1) .cse62 1)))) (let ((.cse71 (store .cse73 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse74 (select .cse73 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse74 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse75 (select .cse74 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse76 (select (select (store .cse73 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse74 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse75 .cse78))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse64))) (let ((.cse77 (select (select (store .cse73 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse74 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse75 .cse76 .cse78))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse63))) (+ .cse75 .cse76 .cse77 (select (select (store .cse73 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse74 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse75 .cse76 .cse77 .cse78))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse62) .cse78))))))))) (let ((.cse72 (store (store (store (store (select .cse71 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) .cse6 1) .cse5 1) .cse3 1))) (let ((.cse69 (store .cse73 |c_ULTIMATE.start_main_~b~0#1.base| .cse72)) (.cse70 (select (store .cse71 |c_ULTIMATE.start_main_~b~0#1.base| .cse72) |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ v_ArrVal_625 (select (select (store .cse69 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse70 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_625)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse5)) v_ArrVal_627) (< (+ v_ArrVal_622 (select (select (store .cse69 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse70 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_622)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse6)) v_ArrVal_625) (< (+ v_ArrVal_627 (select (select (store .cse69 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse70 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_627)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse3)) 9) (< (+ (select .cse70 |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1) v_ArrVal_622)))))))) (.cse52 (not (= |c_ULTIMATE.start_main_~i~0#1| 1))) (.cse32 (not (= |c_ULTIMATE.start_main_~i~0#1| 0))) (.cse4 (+ (* c_~N~0 2) 1)) (.cse23 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse24)))) (.cse18 (not (= c_~N~0 (+ 2 |c_ULTIMATE.start_main_~i~0#1|))))) (and (or .cse0 (forall ((v_ArrVal_627 Int) (v_ArrVal_625 Int) (v_ArrVal_622 Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse11 .cse12 (select (select .cse13 |c_ULTIMATE.start_main_~a~0#1.base|) .cse14)))))) (let ((.cse8 (store (store (store (store (select .cse7 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) .cse6 1) .cse5 1) .cse3 1))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse8)) (.cse2 (select (store .cse7 |c_ULTIMATE.start_main_~b~0#1.base| .cse8) |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ v_ArrVal_627 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_627)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse3)) .cse4) (< (+ v_ArrVal_625 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_625)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse5)) v_ArrVal_627) (< (+ v_ArrVal_622 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_622)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse6)) v_ArrVal_625) (< (+ (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1) v_ArrVal_622))))))) (or (forall ((v_ArrVal_627 Int) (v_ArrVal_625 Int) (v_ArrVal_622 Int)) (let ((.cse17 (store (store (store (store (select .cse13 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) .cse6 1) .cse5 1) .cse3 1))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse17)) (.cse16 (select (store .cse13 |c_ULTIMATE.start_main_~b~0#1.base| .cse17) |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ v_ArrVal_622 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_622)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse6)) v_ArrVal_625) (< (+ (select .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1) v_ArrVal_622) (< (+ v_ArrVal_627 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_627)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse3)) .cse4) (< (+ v_ArrVal_625 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_625)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse5)) v_ArrVal_627))))) .cse18) (or (forall ((v_ArrVal_627 Int) (v_ArrVal_625 Int) (v_ArrVal_622 Int)) (let ((.cse21 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select (select .cse23 |c_ULTIMATE.start_main_~a~0#1.base|) .cse14) .cse10 .cse24))))) (let ((.cse22 (store (store (store (store (select .cse21 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) .cse6 1) .cse5 1) .cse3 1))) (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse22)) (.cse20 (select (store .cse21 |c_ULTIMATE.start_main_~b~0#1.base| .cse22) |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ v_ArrVal_627 (select (select (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_627)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse3)) .cse4) (< (+ v_ArrVal_622 (select (select (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_622)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse6)) v_ArrVal_625) (< (+ v_ArrVal_625 (select (select (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_625)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse5)) v_ArrVal_627) (< (+ (select .cse20 |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1) v_ArrVal_622)))))) .cse0) (or .cse25 (not (= 3 |c_ULTIMATE.start_main_~i~0#1|))) (or .cse25 .cse26) (or (not (= (+ |c_ULTIMATE.start_main_~i~0#1| 1) c_~N~0)) (forall ((v_ArrVal_627 Int) (v_ArrVal_625 Int) (v_ArrVal_622 Int)) (let ((.cse30 (store (store (store (store (select .cse29 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) .cse6 1) .cse5 1) .cse3 1))) (let ((.cse28 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse30)) (.cse27 (select (store .cse29 |c_ULTIMATE.start_main_~b~0#1.base| .cse30) |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ (select .cse27 |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1) v_ArrVal_622) (< (+ v_ArrVal_625 (select (select (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse27 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_625)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse5)) v_ArrVal_627) (< (+ v_ArrVal_627 (select (select (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse27 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_627)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse3)) .cse4) (< (+ (select (select (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse27 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_622)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse6) v_ArrVal_622) v_ArrVal_625)))))) (or .cse31 .cse32) (or (forall ((v_ArrVal_627 Int) (v_ArrVal_625 Int) (v_ArrVal_622 Int)) (let ((.cse35 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse38 (select .cse41 .cse42))) (let ((.cse37 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse38))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse40))) (+ .cse10 .cse37 .cse38 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse37 .cse38))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse39)))))))) (let ((.cse36 (store (store (store (store (select .cse35 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) .cse6 1) .cse5 1) .cse3 1))) (let ((.cse33 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse36)) (.cse34 (select (store .cse35 |c_ULTIMATE.start_main_~b~0#1.base| .cse36) |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ v_ArrVal_622 (select (select (store .cse33 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse34 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_622)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse6)) v_ArrVal_625) (< (+ (select .cse34 |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1) v_ArrVal_622) (< (+ v_ArrVal_625 (select (select (store .cse33 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse34 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_625)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse5)) v_ArrVal_627) (< (+ v_ArrVal_627 (select (select (store .cse33 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse34 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_627)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse3)) .cse4)))))) .cse43) (or (forall ((v_ArrVal_627 Int) (v_ArrVal_625 Int) (v_ArrVal_622 Int)) (let ((.cse46 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse49 (select .cse50 .cse42))) (let ((.cse48 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse12 .cse49))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse40))) (+ .cse10 .cse48 .cse12 .cse49 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse48 .cse12 .cse49))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse39)))))))) (let ((.cse47 (store (store (store (store (select .cse46 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) .cse6 1) .cse5 1) .cse3 1))) (let ((.cse44 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse47)) (.cse45 (select (store .cse46 |c_ULTIMATE.start_main_~b~0#1.base| .cse47) |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ v_ArrVal_627 (select (select (store .cse44 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse45 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_627)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse3)) .cse4) (< (+ (select .cse45 |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1) v_ArrVal_622) (< (+ v_ArrVal_625 (select (select (store .cse44 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse45 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_625)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse5)) v_ArrVal_627) (< (+ v_ArrVal_622 (select (select (store .cse44 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse45 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_622)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse6)) v_ArrVal_625)))))) .cse43) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (= c_~N~0 4) (or .cse51 .cse52) (or .cse51 .cse26) (or .cse31 .cse52) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (<= |c_ULTIMATE.start_main_~i~0#1| 4) (= .cse10 4) (or (forall ((v_ArrVal_627 Int) (v_ArrVal_625 Int) (v_ArrVal_622 Int)) (let ((.cse57 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store (store .cse41 |c_ULTIMATE.start_main_~a~0#1.offset| 1) .cse64 1) .cse63 1) .cse62 1)))) (let ((.cse55 (store .cse57 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse58 (select .cse57 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse58 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse60 (select .cse58 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse59 (select (select (store .cse57 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse58 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse60 1))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse64))) (let ((.cse61 (select (select (store .cse57 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse58 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse59 .cse60 1))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse63))) (+ .cse59 .cse60 (select (select (store .cse57 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse58 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse59 .cse60 .cse61 1))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse62) .cse61 1))))))))) (let ((.cse56 (store (store (store (store (select .cse55 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) .cse6 1) .cse5 1) .cse3 1))) (let ((.cse53 (store .cse57 |c_ULTIMATE.start_main_~b~0#1.base| .cse56)) (.cse54 (select (store .cse55 |c_ULTIMATE.start_main_~b~0#1.base| .cse56) |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ v_ArrVal_625 (select (select (store .cse53 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse54 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_625)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse5)) v_ArrVal_627) (< (+ v_ArrVal_627 (select (select (store .cse53 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse54 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_627)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse3)) 9) (< (+ (select .cse54 |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1) v_ArrVal_622) (< (+ v_ArrVal_622 (select (select (store .cse53 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse54 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_622)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse6)) v_ArrVal_625))))))) .cse32) (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (let ((.cse65 (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|))) (and (not (= |c_ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (= (select .cse65 4) 1) (= (select .cse65 0) 1) (= (select .cse65 8) 1) (= (select .cse65 12) 1) (not (= |ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|))))) (or (forall ((v_ArrVal_627 Int) (v_ArrVal_625 Int) (v_ArrVal_622 Int)) (let ((.cse68 (store (store (store (store (select .cse23 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) .cse6 1) .cse5 1) .cse3 1))) (let ((.cse66 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse68)) (.cse67 (select (store .cse23 |c_ULTIMATE.start_main_~b~0#1.base| .cse68) |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ v_ArrVal_625 (select (select (store .cse66 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse67 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_625)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse5)) v_ArrVal_627) (< (+ v_ArrVal_622 (select (select (store .cse66 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse67 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_622)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse6)) v_ArrVal_625) (< (+ v_ArrVal_627 (select (select (store .cse66 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse67 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_627)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse3)) .cse4) (< (+ (select .cse67 |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1) v_ArrVal_622))))) .cse18)))))))) is different from true [2023-11-06 22:14:58,651 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:15:01,694 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:15:04,684 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse39 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse53 (* |c_ULTIMATE.start_main_~i~0#1| 4)) (.cse11 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse12 (select .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse14 (select .cse39 (+ .cse53 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse29 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse14))))) (let ((.cse48 (select .cse29 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse54 (+ .cse53 |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse26 (select .cse39 .cse54)) (.cse52 (* c_~N~0 4)) (.cse13 (select .cse48 .cse54))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse13 .cse14)))) (.cse16 (+ .cse53 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse6 (not (= (+ 3 |c_ULTIMATE.start_main_~i~0#1|) c_~N~0))) (.cse37 (+ .cse52 (- 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse38 (+ .cse52 |c_ULTIMATE.start_main_~a~0#1.offset| (- 8))) (.cse40 (+ .cse52 (- 12) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse41 (not (= c_~N~0 (+ |c_ULTIMATE.start_main_~i~0#1| 4)))) (.cse4 (+ (* c_~N~0 2) 1)) (.cse25 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse26)))) (.cse5 (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse2 (+ 8 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse3 (+ 12 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse20 (not (= c_~N~0 (+ 2 |c_ULTIMATE.start_main_~i~0#1|))))) (and (forall ((v_ArrVal_627 Int) (v_ArrVal_625 Int) (v_ArrVal_622 Int)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) .cse5 1) .cse2 1) .cse3 1)))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1) v_ArrVal_622) (< (+ v_ArrVal_625 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_625)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse2)) v_ArrVal_627) (< (+ v_ArrVal_627 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_627)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse3)) .cse4) (< (+ v_ArrVal_622 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_622)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse5)) v_ArrVal_625))))) (or .cse6 (forall ((v_ArrVal_627 Int) (v_ArrVal_625 Int) (v_ArrVal_622 Int)) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse13 .cse14 (select (select .cse15 |c_ULTIMATE.start_main_~a~0#1.base|) .cse16)))))) (let ((.cse10 (store (store (store (store (select .cse9 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) .cse5 1) .cse2 1) .cse3 1))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse10)) (.cse8 (select (store .cse9 |c_ULTIMATE.start_main_~b~0#1.base| .cse10) |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ v_ArrVal_627 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_627)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse3)) .cse4) (< (+ v_ArrVal_625 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_625)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse2)) v_ArrVal_627) (< (+ v_ArrVal_622 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_622)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse5)) v_ArrVal_625) (< (+ (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1) v_ArrVal_622))))))) (or (forall ((v_ArrVal_627 Int) (v_ArrVal_625 Int) (v_ArrVal_622 Int)) (let ((.cse19 (store (store (store (store (select .cse15 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) .cse5 1) .cse2 1) .cse3 1))) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse19)) (.cse18 (select (store .cse15 |c_ULTIMATE.start_main_~b~0#1.base| .cse19) |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ v_ArrVal_622 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_622)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse5)) v_ArrVal_625) (< (+ (select .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1) v_ArrVal_622) (< (+ v_ArrVal_627 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_627)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse3)) .cse4) (< (+ v_ArrVal_625 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_625)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse2)) v_ArrVal_627))))) .cse20) (or (forall ((v_ArrVal_627 Int) (v_ArrVal_625 Int) (v_ArrVal_622 Int)) (let ((.cse23 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select (select .cse25 |c_ULTIMATE.start_main_~a~0#1.base|) .cse16) .cse12 .cse26))))) (let ((.cse24 (store (store (store (store (select .cse23 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) .cse5 1) .cse2 1) .cse3 1))) (let ((.cse21 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse24)) (.cse22 (select (store .cse23 |c_ULTIMATE.start_main_~b~0#1.base| .cse24) |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ v_ArrVal_627 (select (select (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse22 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_627)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse3)) .cse4) (< (+ v_ArrVal_622 (select (select (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse22 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_622)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse5)) v_ArrVal_625) (< (+ v_ArrVal_625 (select (select (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse22 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_625)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse2)) v_ArrVal_627) (< (+ (select .cse22 |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1) v_ArrVal_622)))))) .cse6) (or (not (= (+ |c_ULTIMATE.start_main_~i~0#1| 1) c_~N~0)) (forall ((v_ArrVal_627 Int) (v_ArrVal_625 Int) (v_ArrVal_622 Int)) (let ((.cse30 (store (store (store (store (select .cse29 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) .cse5 1) .cse2 1) .cse3 1))) (let ((.cse28 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse30)) (.cse27 (select (store .cse29 |c_ULTIMATE.start_main_~b~0#1.base| .cse30) |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ (select .cse27 |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1) v_ArrVal_622) (< (+ v_ArrVal_625 (select (select (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse27 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_625)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse2)) v_ArrVal_627) (< (+ v_ArrVal_627 (select (select (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse27 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_627)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse3)) .cse4) (< (+ (select (select (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse27 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_622)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse5) v_ArrVal_622) v_ArrVal_625)))))) (or (forall ((v_ArrVal_627 Int) (v_ArrVal_625 Int) (v_ArrVal_622 Int)) (let ((.cse33 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse36 (select .cse39 .cse40))) (let ((.cse35 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse36))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse38))) (+ .cse12 .cse35 .cse36 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse35 .cse36))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse37)))))))) (let ((.cse34 (store (store (store (store (select .cse33 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) .cse5 1) .cse2 1) .cse3 1))) (let ((.cse31 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse34)) (.cse32 (select (store .cse33 |c_ULTIMATE.start_main_~b~0#1.base| .cse34) |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ v_ArrVal_622 (select (select (store .cse31 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse32 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_622)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse5)) v_ArrVal_625) (< (+ (select .cse32 |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1) v_ArrVal_622) (< (+ v_ArrVal_625 (select (select (store .cse31 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse32 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_625)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse2)) v_ArrVal_627) (< (+ v_ArrVal_627 (select (select (store .cse31 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse32 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_627)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse3)) .cse4)))))) .cse41) (or (forall ((v_ArrVal_627 Int) (v_ArrVal_625 Int) (v_ArrVal_622 Int)) (let ((.cse44 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse47 (select .cse48 .cse40))) (let ((.cse46 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse14 .cse47))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse38))) (+ .cse12 .cse46 .cse14 .cse47 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse46 .cse14 .cse47))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse37)))))))) (let ((.cse45 (store (store (store (store (select .cse44 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) .cse5 1) .cse2 1) .cse3 1))) (let ((.cse42 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse45)) (.cse43 (select (store .cse44 |c_ULTIMATE.start_main_~b~0#1.base| .cse45) |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ v_ArrVal_627 (select (select (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse43 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_627)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse3)) .cse4) (< (+ (select .cse43 |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1) v_ArrVal_622) (< (+ v_ArrVal_625 (select (select (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse43 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_625)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse2)) v_ArrVal_627) (< (+ v_ArrVal_622 (select (select (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse43 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_622)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse5)) v_ArrVal_625)))))) .cse41) (or (forall ((v_ArrVal_627 Int) (v_ArrVal_625 Int) (v_ArrVal_622 Int)) (let ((.cse51 (store (store (store (store (select .cse25 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) .cse5 1) .cse2 1) .cse3 1))) (let ((.cse49 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse51)) (.cse50 (select (store .cse25 |c_ULTIMATE.start_main_~b~0#1.base| .cse51) |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ v_ArrVal_625 (select (select (store .cse49 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse50 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_625)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse2)) v_ArrVal_627) (< (+ v_ArrVal_622 (select (select (store .cse49 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse50 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_622)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse5)) v_ArrVal_625) (< (+ v_ArrVal_627 (select (select (store .cse49 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse50 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_627)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse3)) .cse4) (< (+ (select .cse50 |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1) v_ArrVal_622))))) .cse20)))))))) is different from true [2023-11-06 22:15:10,571 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse41 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse98 (* |c_ULTIMATE.start_main_~i~0#1| 4)) (.cse9 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse12 (select .cse41 (+ .cse98 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse29 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse12))))) (let ((.cse50 (select .cse29 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse99 (+ .cse98 |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse24 (select .cse41 .cse99)) (.cse53 (* c_~N~0 2)) (.cse88 (* c_~N~0 4)) (.cse6 (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse5 (+ 8 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse3 (+ 12 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse64 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse78 (select .cse41 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse65 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse63 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse11 (select .cse50 .cse99))) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse11 .cse12)))) (.cse14 (+ .cse98 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse0 (not (= (+ 3 |c_ULTIMATE.start_main_~i~0#1|) c_~N~0))) (.cse25 (forall ((v_ArrVal_627 Int) (v_ArrVal_625 Int) (v_ArrVal_622 Int)) (let ((.cse93 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse41 .cse63 1)))) (let ((.cse91 (store .cse93 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse94 (select .cse93 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse94 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse97 (select .cse94 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse95 (select (select (store .cse93 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse94 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse97 .cse78))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse65))) (let ((.cse96 (select (select (store .cse93 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse94 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse95 .cse97 .cse78))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse64))) (+ (select (select (store .cse93 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse94 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse95 .cse96 .cse97 .cse78))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse63) .cse95 .cse96 .cse97 .cse78))))))))) (let ((.cse92 (store (store (store (store (select .cse91 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) .cse6 1) .cse5 1) .cse3 1))) (let ((.cse90 (store .cse93 |c_ULTIMATE.start_main_~b~0#1.base| .cse92)) (.cse89 (select (store .cse91 |c_ULTIMATE.start_main_~b~0#1.base| .cse92) |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ (select .cse89 |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1) v_ArrVal_622) (< (+ v_ArrVal_622 (select (select (store .cse90 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse89 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_622)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse6)) v_ArrVal_625) (< (+ v_ArrVal_625 (select (select (store .cse90 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse89 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_625)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse5)) v_ArrVal_627) (< (+ v_ArrVal_627 (select (select (store .cse90 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse89 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_627)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse3)) 9)))))))) (.cse39 (+ .cse88 (- 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse40 (+ .cse88 |c_ULTIMATE.start_main_~a~0#1.offset| (- 8))) (.cse42 (+ .cse88 (- 12) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse43 (not (= c_~N~0 (+ |c_ULTIMATE.start_main_~i~0#1| 4)))) (.cse51 (forall ((v_ArrVal_627 Int) (v_ArrVal_625 Int) (v_ArrVal_622 Int)) (let ((.cse83 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse41 .cse64 1) .cse63 1)))) (let ((.cse81 (store .cse83 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse84 (select .cse83 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse84 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse85 (select .cse84 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse86 (select (select (store .cse83 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse84 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse85 .cse78))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse65))) (let ((.cse87 (select (select (store .cse83 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse84 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse85 .cse86 .cse78))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse64))) (+ .cse85 .cse86 (select (select (store .cse83 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse84 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse85 .cse86 .cse78 .cse87))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse63) .cse78 .cse87))))))))) (let ((.cse82 (store (store (store (store (select .cse81 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) .cse6 1) .cse5 1) .cse3 1))) (let ((.cse80 (store .cse83 |c_ULTIMATE.start_main_~b~0#1.base| .cse82)) (.cse79 (select (store .cse81 |c_ULTIMATE.start_main_~b~0#1.base| .cse82) |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ (select .cse79 |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1) v_ArrVal_622) (< (+ v_ArrVal_625 (select (select (store .cse80 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse79 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_625)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse5)) v_ArrVal_627) (< (+ v_ArrVal_627 (select (select (store .cse80 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse79 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_627)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse3)) 9) (< (+ v_ArrVal_622 (select (select (store .cse80 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse79 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_622)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse6)) v_ArrVal_625)))))))) (.cse26 (not (= 2 |c_ULTIMATE.start_main_~i~0#1|))) (.cse31 (forall ((v_ArrVal_627 Int) (v_ArrVal_625 Int) (v_ArrVal_622 Int)) (let ((.cse73 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store .cse41 .cse65 1) .cse64 1) .cse63 1)))) (let ((.cse71 (store .cse73 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse74 (select .cse73 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse74 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse75 (select .cse74 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse76 (select (select (store .cse73 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse74 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse75 .cse78))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse65))) (let ((.cse77 (select (select (store .cse73 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse74 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse75 .cse76 .cse78))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse64))) (+ .cse75 .cse76 .cse77 (select (select (store .cse73 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse74 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse75 .cse76 .cse77 .cse78))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse63) .cse78))))))))) (let ((.cse72 (store (store (store (store (select .cse71 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) .cse6 1) .cse5 1) .cse3 1))) (let ((.cse69 (store .cse73 |c_ULTIMATE.start_main_~b~0#1.base| .cse72)) (.cse70 (select (store .cse71 |c_ULTIMATE.start_main_~b~0#1.base| .cse72) |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ v_ArrVal_625 (select (select (store .cse69 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse70 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_625)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse5)) v_ArrVal_627) (< (+ v_ArrVal_622 (select (select (store .cse69 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse70 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_622)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse6)) v_ArrVal_625) (< (+ v_ArrVal_627 (select (select (store .cse69 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse70 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_627)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse3)) 9) (< (+ (select .cse70 |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1) v_ArrVal_622)))))))) (.cse52 (not (= |c_ULTIMATE.start_main_~i~0#1| 1))) (.cse32 (not (= |c_ULTIMATE.start_main_~i~0#1| 0))) (.cse4 (+ .cse53 1)) (.cse23 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse24)))) (.cse18 (not (= c_~N~0 (+ 2 |c_ULTIMATE.start_main_~i~0#1|))))) (and (or .cse0 (forall ((v_ArrVal_627 Int) (v_ArrVal_625 Int) (v_ArrVal_622 Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse11 .cse12 (select (select .cse13 |c_ULTIMATE.start_main_~a~0#1.base|) .cse14)))))) (let ((.cse8 (store (store (store (store (select .cse7 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) .cse6 1) .cse5 1) .cse3 1))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse8)) (.cse2 (select (store .cse7 |c_ULTIMATE.start_main_~b~0#1.base| .cse8) |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ v_ArrVal_627 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_627)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse3)) .cse4) (< (+ v_ArrVal_625 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_625)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse5)) v_ArrVal_627) (< (+ v_ArrVal_622 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_622)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse6)) v_ArrVal_625) (< (+ (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1) v_ArrVal_622))))))) (or (forall ((v_ArrVal_627 Int) (v_ArrVal_625 Int) (v_ArrVal_622 Int)) (let ((.cse17 (store (store (store (store (select .cse13 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) .cse6 1) .cse5 1) .cse3 1))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse17)) (.cse16 (select (store .cse13 |c_ULTIMATE.start_main_~b~0#1.base| .cse17) |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ v_ArrVal_622 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_622)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse6)) v_ArrVal_625) (< (+ (select .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1) v_ArrVal_622) (< (+ v_ArrVal_627 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_627)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse3)) .cse4) (< (+ v_ArrVal_625 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_625)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse5)) v_ArrVal_627))))) .cse18) (or (forall ((v_ArrVal_627 Int) (v_ArrVal_625 Int) (v_ArrVal_622 Int)) (let ((.cse21 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select (select .cse23 |c_ULTIMATE.start_main_~a~0#1.base|) .cse14) .cse10 .cse24))))) (let ((.cse22 (store (store (store (store (select .cse21 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) .cse6 1) .cse5 1) .cse3 1))) (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse22)) (.cse20 (select (store .cse21 |c_ULTIMATE.start_main_~b~0#1.base| .cse22) |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ v_ArrVal_627 (select (select (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_627)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse3)) .cse4) (< (+ v_ArrVal_622 (select (select (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_622)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse6)) v_ArrVal_625) (< (+ v_ArrVal_625 (select (select (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_625)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse5)) v_ArrVal_627) (< (+ (select .cse20 |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1) v_ArrVal_622)))))) .cse0) (or .cse25 (not (= 3 |c_ULTIMATE.start_main_~i~0#1|))) (or .cse25 .cse26) (or (not (= (+ |c_ULTIMATE.start_main_~i~0#1| 1) c_~N~0)) (forall ((v_ArrVal_627 Int) (v_ArrVal_625 Int) (v_ArrVal_622 Int)) (let ((.cse30 (store (store (store (store (select .cse29 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) .cse6 1) .cse5 1) .cse3 1))) (let ((.cse28 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse30)) (.cse27 (select (store .cse29 |c_ULTIMATE.start_main_~b~0#1.base| .cse30) |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ (select .cse27 |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1) v_ArrVal_622) (< (+ v_ArrVal_625 (select (select (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse27 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_625)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse5)) v_ArrVal_627) (< (+ v_ArrVal_627 (select (select (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse27 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_627)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse3)) .cse4) (< (+ (select (select (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse27 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_622)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse6) v_ArrVal_622) v_ArrVal_625)))))) (or .cse31 .cse32) (or (forall ((v_ArrVal_627 Int) (v_ArrVal_625 Int) (v_ArrVal_622 Int)) (let ((.cse35 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse38 (select .cse41 .cse42))) (let ((.cse37 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse38))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse40))) (+ .cse10 .cse37 .cse38 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse37 .cse38))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse39)))))))) (let ((.cse36 (store (store (store (store (select .cse35 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) .cse6 1) .cse5 1) .cse3 1))) (let ((.cse33 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse36)) (.cse34 (select (store .cse35 |c_ULTIMATE.start_main_~b~0#1.base| .cse36) |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ v_ArrVal_622 (select (select (store .cse33 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse34 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_622)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse6)) v_ArrVal_625) (< (+ (select .cse34 |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1) v_ArrVal_622) (< (+ v_ArrVal_625 (select (select (store .cse33 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse34 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_625)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse5)) v_ArrVal_627) (< (+ v_ArrVal_627 (select (select (store .cse33 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse34 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_627)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse3)) .cse4)))))) .cse43) (or (forall ((v_ArrVal_627 Int) (v_ArrVal_625 Int) (v_ArrVal_622 Int)) (let ((.cse46 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse49 (select .cse50 .cse42))) (let ((.cse48 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse12 .cse49))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse40))) (+ .cse10 .cse48 .cse12 .cse49 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse48 .cse12 .cse49))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse39)))))))) (let ((.cse47 (store (store (store (store (select .cse46 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) .cse6 1) .cse5 1) .cse3 1))) (let ((.cse44 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse47)) (.cse45 (select (store .cse46 |c_ULTIMATE.start_main_~b~0#1.base| .cse47) |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ v_ArrVal_627 (select (select (store .cse44 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse45 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_627)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse3)) .cse4) (< (+ (select .cse45 |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1) v_ArrVal_622) (< (+ v_ArrVal_625 (select (select (store .cse44 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse45 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_625)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse5)) v_ArrVal_627) (< (+ v_ArrVal_622 (select (select (store .cse44 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse45 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_622)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse6)) v_ArrVal_625)))))) .cse43) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (or .cse51 .cse52) (or .cse51 .cse26) (or .cse31 .cse52) (<= (+ .cse10 4) .cse53) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (or (forall ((v_ArrVal_627 Int) (v_ArrVal_625 Int) (v_ArrVal_622 Int)) (let ((.cse58 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store (store .cse41 |c_ULTIMATE.start_main_~a~0#1.offset| 1) .cse65 1) .cse64 1) .cse63 1)))) (let ((.cse56 (store .cse58 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse59 (select .cse58 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse59 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse61 (select .cse59 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse60 (select (select (store .cse58 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse59 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse61 1))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse65))) (let ((.cse62 (select (select (store .cse58 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse59 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse60 .cse61 1))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse64))) (+ .cse60 .cse61 (select (select (store .cse58 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse59 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse60 .cse61 .cse62 1))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse63) .cse62 1))))))))) (let ((.cse57 (store (store (store (store (select .cse56 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) .cse6 1) .cse5 1) .cse3 1))) (let ((.cse54 (store .cse58 |c_ULTIMATE.start_main_~b~0#1.base| .cse57)) (.cse55 (select (store .cse56 |c_ULTIMATE.start_main_~b~0#1.base| .cse57) |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ v_ArrVal_625 (select (select (store .cse54 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse55 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_625)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse5)) v_ArrVal_627) (< (+ v_ArrVal_627 (select (select (store .cse54 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse55 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_627)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse3)) 9) (< (+ (select .cse55 |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1) v_ArrVal_622) (< (+ v_ArrVal_622 (select (select (store .cse54 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse55 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_622)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse6)) v_ArrVal_625))))))) .cse32) (<= 4 c_~N~0) (or (forall ((v_ArrVal_627 Int) (v_ArrVal_625 Int) (v_ArrVal_622 Int)) (let ((.cse68 (store (store (store (store (select .cse23 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) .cse6 1) .cse5 1) .cse3 1))) (let ((.cse66 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse68)) (.cse67 (select (store .cse23 |c_ULTIMATE.start_main_~b~0#1.base| .cse68) |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ v_ArrVal_625 (select (select (store .cse66 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse67 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_625)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse5)) v_ArrVal_627) (< (+ v_ArrVal_622 (select (select (store .cse66 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse67 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_622)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse6)) v_ArrVal_625) (< (+ v_ArrVal_627 (select (select (store .cse66 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse67 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_627)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse3)) .cse4) (< (+ (select .cse67 |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1) v_ArrVal_622))))) .cse18)))))))) is different from true [2023-11-06 22:15:32,708 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse37 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse51 (* |c_ULTIMATE.start_main_~i~0#1| 4)) (.cse9 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse12 (select .cse37 (+ .cse51 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse27 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse12))))) (let ((.cse46 (select .cse27 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse52 (+ .cse51 |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse24 (select .cse37 .cse52)) (.cse50 (* c_~N~0 4)) (.cse11 (select .cse46 .cse52))) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse11 .cse12)))) (.cse14 (+ .cse51 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse0 (not (= (+ 3 |c_ULTIMATE.start_main_~i~0#1|) c_~N~0))) (.cse35 (+ .cse50 (- 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse36 (+ .cse50 |c_ULTIMATE.start_main_~a~0#1.offset| (- 8))) (.cse38 (+ .cse50 (- 12) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse39 (not (= c_~N~0 (+ |c_ULTIMATE.start_main_~i~0#1| 4)))) (.cse4 (+ (* c_~N~0 2) 1)) (.cse23 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse24)))) (.cse6 (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse5 (+ 8 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse3 (+ 12 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse18 (not (= c_~N~0 (+ 2 |c_ULTIMATE.start_main_~i~0#1|))))) (and (or .cse0 (forall ((v_ArrVal_627 Int) (v_ArrVal_625 Int) (v_ArrVal_622 Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse11 .cse12 (select (select .cse13 |c_ULTIMATE.start_main_~a~0#1.base|) .cse14)))))) (let ((.cse8 (store (store (store (store (select .cse7 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) .cse6 1) .cse5 1) .cse3 1))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse8)) (.cse2 (select (store .cse7 |c_ULTIMATE.start_main_~b~0#1.base| .cse8) |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ v_ArrVal_627 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_627)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse3)) .cse4) (< (+ v_ArrVal_625 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_625)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse5)) v_ArrVal_627) (< (+ v_ArrVal_622 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_622)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse6)) v_ArrVal_625) (< (+ (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1) v_ArrVal_622))))))) (or (forall ((v_ArrVal_627 Int) (v_ArrVal_625 Int) (v_ArrVal_622 Int)) (let ((.cse17 (store (store (store (store (select .cse13 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) .cse6 1) .cse5 1) .cse3 1))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse17)) (.cse16 (select (store .cse13 |c_ULTIMATE.start_main_~b~0#1.base| .cse17) |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ v_ArrVal_622 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_622)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse6)) v_ArrVal_625) (< (+ (select .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1) v_ArrVal_622) (< (+ v_ArrVal_627 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_627)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse3)) .cse4) (< (+ v_ArrVal_625 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_625)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse5)) v_ArrVal_627))))) .cse18) (or (forall ((v_ArrVal_627 Int) (v_ArrVal_625 Int) (v_ArrVal_622 Int)) (let ((.cse21 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select (select .cse23 |c_ULTIMATE.start_main_~a~0#1.base|) .cse14) .cse10 .cse24))))) (let ((.cse22 (store (store (store (store (select .cse21 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) .cse6 1) .cse5 1) .cse3 1))) (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse22)) (.cse20 (select (store .cse21 |c_ULTIMATE.start_main_~b~0#1.base| .cse22) |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ v_ArrVal_627 (select (select (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_627)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse3)) .cse4) (< (+ v_ArrVal_622 (select (select (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_622)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse6)) v_ArrVal_625) (< (+ v_ArrVal_625 (select (select (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_625)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse5)) v_ArrVal_627) (< (+ (select .cse20 |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1) v_ArrVal_622)))))) .cse0) (or (not (= (+ |c_ULTIMATE.start_main_~i~0#1| 1) c_~N~0)) (forall ((v_ArrVal_627 Int) (v_ArrVal_625 Int) (v_ArrVal_622 Int)) (let ((.cse28 (store (store (store (store (select .cse27 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) .cse6 1) .cse5 1) .cse3 1))) (let ((.cse26 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse28)) (.cse25 (select (store .cse27 |c_ULTIMATE.start_main_~b~0#1.base| .cse28) |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ (select .cse25 |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1) v_ArrVal_622) (< (+ v_ArrVal_625 (select (select (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_625)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse5)) v_ArrVal_627) (< (+ v_ArrVal_627 (select (select (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_627)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse3)) .cse4) (< (+ (select (select (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_622)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse6) v_ArrVal_622) v_ArrVal_625)))))) (or (forall ((v_ArrVal_627 Int) (v_ArrVal_625 Int) (v_ArrVal_622 Int)) (let ((.cse31 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse34 (select .cse37 .cse38))) (let ((.cse33 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse34))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse36))) (+ .cse10 .cse33 .cse34 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse33 .cse34))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse35)))))))) (let ((.cse32 (store (store (store (store (select .cse31 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) .cse6 1) .cse5 1) .cse3 1))) (let ((.cse29 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse32)) (.cse30 (select (store .cse31 |c_ULTIMATE.start_main_~b~0#1.base| .cse32) |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ v_ArrVal_622 (select (select (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_622)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse6)) v_ArrVal_625) (< (+ (select .cse30 |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1) v_ArrVal_622) (< (+ v_ArrVal_625 (select (select (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_625)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse5)) v_ArrVal_627) (< (+ v_ArrVal_627 (select (select (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_627)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse3)) .cse4)))))) .cse39) (or (forall ((v_ArrVal_627 Int) (v_ArrVal_625 Int) (v_ArrVal_622 Int)) (let ((.cse42 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse45 (select .cse46 .cse38))) (let ((.cse44 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse12 .cse45))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse36))) (+ .cse10 .cse44 .cse12 .cse45 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse44 .cse12 .cse45))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse35)))))))) (let ((.cse43 (store (store (store (store (select .cse42 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) .cse6 1) .cse5 1) .cse3 1))) (let ((.cse40 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse43)) (.cse41 (select (store .cse42 |c_ULTIMATE.start_main_~b~0#1.base| .cse43) |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ v_ArrVal_627 (select (select (store .cse40 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_627)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse3)) .cse4) (< (+ (select .cse41 |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1) v_ArrVal_622) (< (+ v_ArrVal_625 (select (select (store .cse40 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_625)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse5)) v_ArrVal_627) (< (+ v_ArrVal_622 (select (select (store .cse40 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_622)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse6)) v_ArrVal_625)))))) .cse39) (or (forall ((v_ArrVal_627 Int) (v_ArrVal_625 Int) (v_ArrVal_622 Int)) (let ((.cse49 (store (store (store (store (select .cse23 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) .cse6 1) .cse5 1) .cse3 1))) (let ((.cse47 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse49)) (.cse48 (select (store .cse23 |c_ULTIMATE.start_main_~b~0#1.base| .cse49) |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ v_ArrVal_625 (select (select (store .cse47 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse48 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_625)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse5)) v_ArrVal_627) (< (+ v_ArrVal_622 (select (select (store .cse47 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse48 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_622)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse6)) v_ArrVal_625) (< (+ v_ArrVal_627 (select (select (store .cse47 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse48 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_627)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse3)) .cse4) (< (+ (select .cse48 |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1) v_ArrVal_622))))) .cse18)))))))) is different from true [2023-11-06 22:15:37,187 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:15:41,691 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse34 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse24 (* |c_ULTIMATE.start_main_~i~0#1| 4)) (.cse37 (* c_~N~0 2))) (let ((.cse16 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse15 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse14 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse13 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse17 (not (= |c_ULTIMATE.start_main_~i~0#1| 0))) (.cse18 (<= (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 4) .cse37)) (.cse3 (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse4 (+ 12 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse22 (+ .cse37 1)) (.cse2 (+ 8 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse23 (store (store (store .cse34 (+ .cse24 |c_ULTIMATE.start_main_~b~0#1.offset|) 1) (+ .cse24 4 |c_ULTIMATE.start_main_~b~0#1.offset|) 1) (+ .cse24 8 |c_ULTIMATE.start_main_~b~0#1.offset|) 1))) (and (or (forall ((v_ArrVal_627 Int) (v_ArrVal_625 Int) (v_ArrVal_622 Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store .cse16 .cse15 1) .cse14 1) .cse13 1)))) (let ((.cse5 (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse12 (select .cse16 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse10 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse12))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse15))) (let ((.cse11 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse10 .cse12))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse14))) (+ .cse9 .cse10 .cse11 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse10 .cse11 .cse12))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13) .cse12))))))))) (let ((.cse6 (store (store (store (store (select .cse5 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) .cse3 1) .cse2 1) .cse4 1))) (let ((.cse0 (store .cse7 |c_ULTIMATE.start_main_~b~0#1.base| .cse6)) (.cse1 (select (store .cse5 |c_ULTIMATE.start_main_~b~0#1.base| .cse6) |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ v_ArrVal_625 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_625)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse2)) v_ArrVal_627) (< (+ v_ArrVal_622 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_622)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse3)) v_ArrVal_625) (< (+ v_ArrVal_627 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_627)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse4)) 9) (< (+ (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1) v_ArrVal_622))))))) .cse17) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) .cse18 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (forall ((v_ArrVal_627 Int) (v_ArrVal_625 Int) (v_ArrVal_622 Int)) (let ((.cse21 (store .cse23 (+ .cse24 12 |c_ULTIMATE.start_main_~b~0#1.offset|) 1))) (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse21))) (let ((.cse20 (select .cse19 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ v_ArrVal_622 (select (select (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_622)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse3)) v_ArrVal_625) (< (+ (select .cse21 |c_ULTIMATE.start_main_~b~0#1.offset|) (select .cse20 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) v_ArrVal_622) (< (+ v_ArrVal_625 (select (select (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_625)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse2)) v_ArrVal_627) (< (+ v_ArrVal_627 (select (select (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_627)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse4)) .cse22)))))) (or (forall ((v_ArrVal_627 Int) (v_ArrVal_625 Int) (v_ArrVal_622 Int)) (let ((.cse29 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store (store .cse16 |c_ULTIMATE.start_main_~a~0#1.offset| 1) .cse15 1) .cse14 1) .cse13 1)))) (let ((.cse27 (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse30 (select .cse29 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse32 (select .cse30 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse31 (select (select (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse32 1))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse15))) (let ((.cse33 (select (select (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse31 .cse32 1))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse14))) (+ .cse31 .cse32 (select (select (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse31 .cse32 .cse33 1))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13) .cse33 1))))))))) (let ((.cse28 (store (store (store (store (select .cse27 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) .cse3 1) .cse2 1) .cse4 1))) (let ((.cse25 (store .cse29 |c_ULTIMATE.start_main_~b~0#1.base| .cse28)) (.cse26 (select (store .cse27 |c_ULTIMATE.start_main_~b~0#1.base| .cse28) |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ v_ArrVal_625 (select (select (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_625)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse2)) v_ArrVal_627) (< (+ v_ArrVal_627 (select (select (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_627)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse4)) 9) (< (+ (select .cse26 |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1) v_ArrVal_622) (< (+ v_ArrVal_622 (select (select (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_622)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse3)) v_ArrVal_625))))))) .cse17) (<= 4 c_~N~0) (or (and .cse18 (= (select .cse34 0) 1)) (not (= |c_ULTIMATE.start_main_~i~0#1| 1))) (forall ((v_ArrVal_627 Int) (v_ArrVal_625 Int) (v_ArrVal_622 Int)) (let ((.cse36 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse23))) (let ((.cse35 (select .cse36 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ (select .cse35 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse23 |c_ULTIMATE.start_main_~b~0#1.offset|)) v_ArrVal_622) (< (+ v_ArrVal_622 (select (select (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse35 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_622)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse3)) v_ArrVal_625) (< (+ v_ArrVal_627 (select (select (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse35 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_627)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse4)) .cse22) (< (+ v_ArrVal_625 (select (select (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse35 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_625)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse2)) v_ArrVal_627))))) (<= |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from true [2023-11-06 22:15:59,880 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:16:29,719 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse41 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse99 (* |c_ULTIMATE.start_main_~i~0#1| 4)) (.cse9 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse12 (select .cse41 (+ .cse99 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse29 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse12))))) (let ((.cse50 (select .cse29 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse100 (+ .cse99 |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse24 (select .cse41 .cse100)) (.cse89 (* c_~N~0 4)) (.cse6 (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse5 (+ 8 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse3 (+ 12 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse64 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse79 (select .cse41 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse65 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse63 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse11 (select .cse50 .cse100))) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse11 .cse12)))) (.cse14 (+ .cse99 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse0 (not (= (+ 3 |c_ULTIMATE.start_main_~i~0#1|) c_~N~0))) (.cse25 (forall ((v_ArrVal_627 Int) (v_ArrVal_625 Int) (v_ArrVal_622 Int)) (let ((.cse94 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse41 .cse63 1)))) (let ((.cse92 (store .cse94 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse95 (select .cse94 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse95 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse98 (select .cse95 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse96 (select (select (store .cse94 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse95 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse98 .cse79))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse65))) (let ((.cse97 (select (select (store .cse94 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse95 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse96 .cse98 .cse79))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse64))) (+ (select (select (store .cse94 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse95 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse96 .cse97 .cse98 .cse79))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse63) .cse96 .cse97 .cse98 .cse79))))))))) (let ((.cse93 (store (store (store (store (select .cse92 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) .cse6 1) .cse5 1) .cse3 1))) (let ((.cse91 (store .cse94 |c_ULTIMATE.start_main_~b~0#1.base| .cse93)) (.cse90 (select (store .cse92 |c_ULTIMATE.start_main_~b~0#1.base| .cse93) |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ (select .cse90 |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1) v_ArrVal_622) (< (+ v_ArrVal_622 (select (select (store .cse91 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse90 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_622)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse6)) v_ArrVal_625) (< (+ v_ArrVal_625 (select (select (store .cse91 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse90 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_625)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse5)) v_ArrVal_627) (< (+ v_ArrVal_627 (select (select (store .cse91 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse90 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_627)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse3)) 9)))))))) (.cse39 (+ .cse89 (- 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse40 (+ .cse89 |c_ULTIMATE.start_main_~a~0#1.offset| (- 8))) (.cse42 (+ .cse89 (- 12) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse43 (not (= c_~N~0 (+ |c_ULTIMATE.start_main_~i~0#1| 4)))) (.cse51 (forall ((v_ArrVal_627 Int) (v_ArrVal_625 Int) (v_ArrVal_622 Int)) (let ((.cse84 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse41 .cse64 1) .cse63 1)))) (let ((.cse82 (store .cse84 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse85 (select .cse84 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse85 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse86 (select .cse85 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse87 (select (select (store .cse84 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse85 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse86 .cse79))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse65))) (let ((.cse88 (select (select (store .cse84 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse85 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse86 .cse87 .cse79))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse64))) (+ .cse86 .cse87 (select (select (store .cse84 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse85 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse86 .cse87 .cse79 .cse88))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse63) .cse79 .cse88))))))))) (let ((.cse83 (store (store (store (store (select .cse82 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) .cse6 1) .cse5 1) .cse3 1))) (let ((.cse81 (store .cse84 |c_ULTIMATE.start_main_~b~0#1.base| .cse83)) (.cse80 (select (store .cse82 |c_ULTIMATE.start_main_~b~0#1.base| .cse83) |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ (select .cse80 |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1) v_ArrVal_622) (< (+ v_ArrVal_625 (select (select (store .cse81 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse80 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_625)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse5)) v_ArrVal_627) (< (+ v_ArrVal_627 (select (select (store .cse81 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse80 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_627)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse3)) 9) (< (+ v_ArrVal_622 (select (select (store .cse81 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse80 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_622)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse6)) v_ArrVal_625)))))))) (.cse26 (not (= 2 |c_ULTIMATE.start_main_~i~0#1|))) (.cse31 (forall ((v_ArrVal_627 Int) (v_ArrVal_625 Int) (v_ArrVal_622 Int)) (let ((.cse74 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store .cse41 .cse65 1) .cse64 1) .cse63 1)))) (let ((.cse72 (store .cse74 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse75 (select .cse74 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse75 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse76 (select .cse75 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse77 (select (select (store .cse74 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse75 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse76 .cse79))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse65))) (let ((.cse78 (select (select (store .cse74 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse75 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse76 .cse77 .cse79))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse64))) (+ .cse76 .cse77 .cse78 (select (select (store .cse74 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse75 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse76 .cse77 .cse78 .cse79))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse63) .cse79))))))))) (let ((.cse73 (store (store (store (store (select .cse72 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) .cse6 1) .cse5 1) .cse3 1))) (let ((.cse70 (store .cse74 |c_ULTIMATE.start_main_~b~0#1.base| .cse73)) (.cse71 (select (store .cse72 |c_ULTIMATE.start_main_~b~0#1.base| .cse73) |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ v_ArrVal_625 (select (select (store .cse70 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse71 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_625)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse5)) v_ArrVal_627) (< (+ v_ArrVal_622 (select (select (store .cse70 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse71 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_622)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse6)) v_ArrVal_625) (< (+ v_ArrVal_627 (select (select (store .cse70 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse71 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_627)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse3)) 9) (< (+ (select .cse71 |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1) v_ArrVal_622)))))))) (.cse52 (not (= |c_ULTIMATE.start_main_~i~0#1| 1))) (.cse53 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse32 (not (= |c_ULTIMATE.start_main_~i~0#1| 0))) (.cse4 (+ (* c_~N~0 2) 1)) (.cse23 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse24)))) (.cse18 (not (= c_~N~0 (+ 2 |c_ULTIMATE.start_main_~i~0#1|))))) (and (or .cse0 (forall ((v_ArrVal_627 Int) (v_ArrVal_625 Int) (v_ArrVal_622 Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse11 .cse12 (select (select .cse13 |c_ULTIMATE.start_main_~a~0#1.base|) .cse14)))))) (let ((.cse8 (store (store (store (store (select .cse7 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) .cse6 1) .cse5 1) .cse3 1))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse8)) (.cse2 (select (store .cse7 |c_ULTIMATE.start_main_~b~0#1.base| .cse8) |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ v_ArrVal_627 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_627)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse3)) .cse4) (< (+ v_ArrVal_625 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_625)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse5)) v_ArrVal_627) (< (+ v_ArrVal_622 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_622)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse6)) v_ArrVal_625) (< (+ (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1) v_ArrVal_622))))))) (or (forall ((v_ArrVal_627 Int) (v_ArrVal_625 Int) (v_ArrVal_622 Int)) (let ((.cse17 (store (store (store (store (select .cse13 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) .cse6 1) .cse5 1) .cse3 1))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse17)) (.cse16 (select (store .cse13 |c_ULTIMATE.start_main_~b~0#1.base| .cse17) |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ v_ArrVal_622 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_622)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse6)) v_ArrVal_625) (< (+ (select .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1) v_ArrVal_622) (< (+ v_ArrVal_627 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_627)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse3)) .cse4) (< (+ v_ArrVal_625 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_625)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse5)) v_ArrVal_627))))) .cse18) (or (forall ((v_ArrVal_627 Int) (v_ArrVal_625 Int) (v_ArrVal_622 Int)) (let ((.cse21 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select (select .cse23 |c_ULTIMATE.start_main_~a~0#1.base|) .cse14) .cse10 .cse24))))) (let ((.cse22 (store (store (store (store (select .cse21 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) .cse6 1) .cse5 1) .cse3 1))) (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse22)) (.cse20 (select (store .cse21 |c_ULTIMATE.start_main_~b~0#1.base| .cse22) |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ v_ArrVal_627 (select (select (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_627)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse3)) .cse4) (< (+ v_ArrVal_622 (select (select (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_622)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse6)) v_ArrVal_625) (< (+ v_ArrVal_625 (select (select (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_625)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse5)) v_ArrVal_627) (< (+ (select .cse20 |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1) v_ArrVal_622)))))) .cse0) (or .cse25 (not (= 3 |c_ULTIMATE.start_main_~i~0#1|))) (or .cse25 .cse26) (or (not (= (+ |c_ULTIMATE.start_main_~i~0#1| 1) c_~N~0)) (forall ((v_ArrVal_627 Int) (v_ArrVal_625 Int) (v_ArrVal_622 Int)) (let ((.cse30 (store (store (store (store (select .cse29 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) .cse6 1) .cse5 1) .cse3 1))) (let ((.cse28 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse30)) (.cse27 (select (store .cse29 |c_ULTIMATE.start_main_~b~0#1.base| .cse30) |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ (select .cse27 |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1) v_ArrVal_622) (< (+ v_ArrVal_625 (select (select (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse27 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_625)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse5)) v_ArrVal_627) (< (+ v_ArrVal_627 (select (select (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse27 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_627)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse3)) .cse4) (< (+ (select (select (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse27 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_622)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse6) v_ArrVal_622) v_ArrVal_625)))))) (or .cse31 .cse32) (or (forall ((v_ArrVal_627 Int) (v_ArrVal_625 Int) (v_ArrVal_622 Int)) (let ((.cse35 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse38 (select .cse41 .cse42))) (let ((.cse37 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse38))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse40))) (+ .cse10 .cse37 .cse38 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse37 .cse38))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse39)))))))) (let ((.cse36 (store (store (store (store (select .cse35 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) .cse6 1) .cse5 1) .cse3 1))) (let ((.cse33 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse36)) (.cse34 (select (store .cse35 |c_ULTIMATE.start_main_~b~0#1.base| .cse36) |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ v_ArrVal_622 (select (select (store .cse33 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse34 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_622)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse6)) v_ArrVal_625) (< (+ (select .cse34 |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1) v_ArrVal_622) (< (+ v_ArrVal_625 (select (select (store .cse33 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse34 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_625)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse5)) v_ArrVal_627) (< (+ v_ArrVal_627 (select (select (store .cse33 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse34 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_627)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse3)) .cse4)))))) .cse43) (or (forall ((v_ArrVal_627 Int) (v_ArrVal_625 Int) (v_ArrVal_622 Int)) (let ((.cse46 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse49 (select .cse50 .cse42))) (let ((.cse48 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse12 .cse49))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse40))) (+ .cse10 .cse48 .cse12 .cse49 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse48 .cse12 .cse49))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse39)))))))) (let ((.cse47 (store (store (store (store (select .cse46 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) .cse6 1) .cse5 1) .cse3 1))) (let ((.cse44 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse47)) (.cse45 (select (store .cse46 |c_ULTIMATE.start_main_~b~0#1.base| .cse47) |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ v_ArrVal_627 (select (select (store .cse44 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse45 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_627)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse3)) .cse4) (< (+ (select .cse45 |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1) v_ArrVal_622) (< (+ v_ArrVal_625 (select (select (store .cse44 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse45 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_625)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse5)) v_ArrVal_627) (< (+ v_ArrVal_622 (select (select (store .cse44 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse45 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_622)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse6)) v_ArrVal_625)))))) .cse43) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (= c_~N~0 4) (or .cse51 .cse52) (= (select .cse53 4) 1) (or .cse51 .cse26) (= (select .cse53 8) 1) (or .cse31 .cse52) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (<= |c_ULTIMATE.start_main_~i~0#1| 4) (= (select .cse53 0) 1) (= .cse10 4) (= (select .cse53 12) 1) (or (forall ((v_ArrVal_627 Int) (v_ArrVal_625 Int) (v_ArrVal_622 Int)) (let ((.cse58 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store (store .cse41 |c_ULTIMATE.start_main_~a~0#1.offset| 1) .cse65 1) .cse64 1) .cse63 1)))) (let ((.cse56 (store .cse58 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse59 (select .cse58 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse59 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse61 (select .cse59 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse60 (select (select (store .cse58 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse59 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse61 1))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse65))) (let ((.cse62 (select (select (store .cse58 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse59 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse60 .cse61 1))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse64))) (+ .cse60 .cse61 (select (select (store .cse58 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse59 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse60 .cse61 .cse62 1))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse63) .cse62 1))))))))) (let ((.cse57 (store (store (store (store (select .cse56 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) .cse6 1) .cse5 1) .cse3 1))) (let ((.cse54 (store .cse58 |c_ULTIMATE.start_main_~b~0#1.base| .cse57)) (.cse55 (select (store .cse56 |c_ULTIMATE.start_main_~b~0#1.base| .cse57) |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ v_ArrVal_625 (select (select (store .cse54 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse55 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_625)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse5)) v_ArrVal_627) (< (+ v_ArrVal_627 (select (select (store .cse54 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse55 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_627)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse3)) 9) (< (+ (select .cse55 |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1) v_ArrVal_622) (< (+ v_ArrVal_622 (select (select (store .cse54 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse55 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_622)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse6)) v_ArrVal_625))))))) .cse32) (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (let ((.cse66 (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|))) (and (not (= |c_ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (= (select .cse66 4) 1) (= (select .cse66 0) 1) (= (select .cse66 8) 1) (= (select .cse66 12) 1) (not (= |ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|))))) (or (forall ((v_ArrVal_627 Int) (v_ArrVal_625 Int) (v_ArrVal_622 Int)) (let ((.cse69 (store (store (store (store (select .cse23 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) .cse6 1) .cse5 1) .cse3 1))) (let ((.cse67 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse69)) (.cse68 (select (store .cse23 |c_ULTIMATE.start_main_~b~0#1.base| .cse69) |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ v_ArrVal_625 (select (select (store .cse67 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse68 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_625)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse5)) v_ArrVal_627) (< (+ v_ArrVal_622 (select (select (store .cse67 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse68 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_622)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse6)) v_ArrVal_625) (< (+ v_ArrVal_627 (select (select (store .cse67 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse68 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_627)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse3)) .cse4) (< (+ (select .cse68 |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1) v_ArrVal_622))))) .cse18)))))))) is different from true