./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/termination-memory-alloca/b.06-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f560ba7-7e18-48f1-8345-1c79b88c9b28/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f560ba7-7e18-48f1-8345-1c79b88c9b28/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_6f560ba7-7e18-48f1-8345-1c79b88c9b28/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f560ba7-7e18-48f1-8345-1c79b88c9b28/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/termination-memory-alloca/b.06-alloca.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f560ba7-7e18-48f1-8345-1c79b88c9b28/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f560ba7-7e18-48f1-8345-1c79b88c9b28/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 ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 21a06ce5e98962e93aa29e180f0bc8e543a622b520b6d7eef2d0a57c9849b220 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 23:06:45,237 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 23:06:45,308 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f560ba7-7e18-48f1-8345-1c79b88c9b28/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Overflow-64bit-Automizer_Default.epf [2023-11-06 23:06:45,321 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 23:06:45,324 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 23:06:45,366 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 23:06:45,376 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 23:06:45,377 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 23:06:45,378 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 23:06:45,386 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 23:06:45,386 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 23:06:45,387 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 23:06:45,387 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 23:06:45,388 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 23:06:45,388 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 23:06:45,389 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 23:06:45,389 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 23:06:45,390 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 23:06:45,390 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 23:06:45,391 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 23:06:45,391 INFO L153 SettingsManager]: * Check absence of signed integer overflows=true [2023-11-06 23:06:45,392 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 23:06:45,392 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 23:06:45,393 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 23:06:45,393 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 23:06:45,394 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 23:06:45,394 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 23:06:45,394 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:06:45,395 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 23:06:45,395 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 23:06:45,396 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 23:06:45,396 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 23:06:45,397 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 23:06:45,397 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 23:06:45,398 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 23:06:45,398 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 23:06:45,399 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 23:06:45,399 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 23:06:45,399 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_6f560ba7-7e18-48f1-8345-1c79b88c9b28/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_6f560ba7-7e18-48f1-8345-1c79b88c9b28/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 ! overflow) ) 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 21a06ce5e98962e93aa29e180f0bc8e543a622b520b6d7eef2d0a57c9849b220 [2023-11-06 23:06:45,726 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 23:06:45,759 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 23:06:45,762 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 23:06:45,763 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 23:06:45,764 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 23:06:45,766 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f560ba7-7e18-48f1-8345-1c79b88c9b28/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/termination-memory-alloca/b.06-alloca.i [2023-11-06 23:06:48,940 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 23:06:49,221 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 23:06:49,222 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f560ba7-7e18-48f1-8345-1c79b88c9b28/sv-benchmarks/c/termination-memory-alloca/b.06-alloca.i [2023-11-06 23:06:49,237 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f560ba7-7e18-48f1-8345-1c79b88c9b28/bin/uautomizer-verify-WvqO1wxjHP/data/9a1ba51c2/981899d206144fac81c4abef58e152c8/FLAGcb0373da3 [2023-11-06 23:06:49,252 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f560ba7-7e18-48f1-8345-1c79b88c9b28/bin/uautomizer-verify-WvqO1wxjHP/data/9a1ba51c2/981899d206144fac81c4abef58e152c8 [2023-11-06 23:06:49,255 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 23:06:49,256 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 23:06:49,258 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 23:06:49,258 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 23:06:49,264 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 23:06:49,265 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:06:49" (1/1) ... [2023-11-06 23:06:49,266 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34ba2785 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:06:49, skipping insertion in model container [2023-11-06 23:06:49,266 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:06:49" (1/1) ... [2023-11-06 23:06:49,307 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 23:06:49,625 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:06:49,636 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 23:06:49,684 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:06:49,713 INFO L206 MainTranslator]: Completed translation [2023-11-06 23:06:49,714 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:06:49 WrapperNode [2023-11-06 23:06:49,714 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 23:06:49,715 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 23:06:49,715 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 23:06:49,715 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 23:06:49,723 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:06:49" (1/1) ... [2023-11-06 23:06:49,750 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:06:49" (1/1) ... [2023-11-06 23:06:49,773 INFO L138 Inliner]: procedures = 111, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 72 [2023-11-06 23:06:49,773 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 23:06:49,774 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 23:06:49,774 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 23:06:49,774 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 23:06:49,783 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:06:49" (1/1) ... [2023-11-06 23:06:49,783 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:06:49" (1/1) ... [2023-11-06 23:06:49,786 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:06:49" (1/1) ... [2023-11-06 23:06:49,787 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:06:49" (1/1) ... [2023-11-06 23:06:49,791 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:06:49" (1/1) ... [2023-11-06 23:06:49,794 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:06:49" (1/1) ... [2023-11-06 23:06:49,796 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:06:49" (1/1) ... [2023-11-06 23:06:49,797 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:06:49" (1/1) ... [2023-11-06 23:06:49,799 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 23:06:49,800 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 23:06:49,801 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 23:06:49,801 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 23:06:49,802 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:06:49" (1/1) ... [2023-11-06 23:06:49,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:06:49,823 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f560ba7-7e18-48f1-8345-1c79b88c9b28/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:06:49,836 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f560ba7-7e18-48f1-8345-1c79b88c9b28/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 23:06:49,871 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f560ba7-7e18-48f1-8345-1c79b88c9b28/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 23:06:49,887 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 23:06:49,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 23:06:49,888 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 23:06:49,888 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 23:06:49,889 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 23:06:49,889 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 23:06:49,999 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 23:06:50,000 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 23:06:50,155 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 23:06:50,166 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 23:06:50,168 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 23:06:50,170 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:06:50 BoogieIcfgContainer [2023-11-06 23:06:50,171 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 23:06:50,175 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 23:06:50,175 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 23:06:50,178 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 23:06:50,179 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 11:06:49" (1/3) ... [2023-11-06 23:06:50,180 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b427573 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:06:50, skipping insertion in model container [2023-11-06 23:06:50,180 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:06:49" (2/3) ... [2023-11-06 23:06:50,182 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b427573 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:06:50, skipping insertion in model container [2023-11-06 23:06:50,183 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:06:50" (3/3) ... [2023-11-06 23:06:50,184 INFO L112 eAbstractionObserver]: Analyzing ICFG b.06-alloca.i [2023-11-06 23:06:50,207 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 23:06:50,207 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2023-11-06 23:06:50,273 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 23:06:50,280 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;@4a69468a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 23:06:50,281 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-06 23:06:50,285 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 15 states have (on average 1.6) internal successors, (24), 21 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:06:50,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-06 23:06:50,292 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:06:50,293 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-06 23:06:50,294 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-06 23:06:50,304 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:06:50,305 INFO L85 PathProgramCache]: Analyzing trace with hash 889569447, now seen corresponding path program 1 times [2023-11-06 23:06:50,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:06:50,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029684970] [2023-11-06 23:06:50,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:06:50,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:06:50,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:50,813 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 23:06:50,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:06:50,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029684970] [2023-11-06 23:06:50,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029684970] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:06:50,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:06:50,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:06:50,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893461688] [2023-11-06 23:06:50,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:06:50,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:06:50,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:06:50,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:06:50,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:06:50,879 INFO L87 Difference]: Start difference. First operand has 22 states, 15 states have (on average 1.6) internal successors, (24), 21 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 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 23:06:50,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:06:50,948 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2023-11-06 23:06:50,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:06:50,951 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2023-11-06 23:06:50,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:06:50,959 INFO L225 Difference]: With dead ends: 30 [2023-11-06 23:06:50,959 INFO L226 Difference]: Without dead ends: 17 [2023-11-06 23:06:50,964 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:06:50,971 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 13 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 23:06:50,973 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 37 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 23:06:50,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2023-11-06 23:06:51,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2023-11-06 23:06:51,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 15 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:06:51,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2023-11-06 23:06:51,013 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 6 [2023-11-06 23:06:51,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:06:51,013 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2023-11-06 23:06:51,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 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 23:06:51,014 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2023-11-06 23:06:51,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-06 23:06:51,014 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:06:51,014 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:06:51,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 23:06:51,015 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-06 23:06:51,016 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:06:51,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1806849133, now seen corresponding path program 1 times [2023-11-06 23:06:51,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:06:51,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288252876] [2023-11-06 23:06:51,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:06:51,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:06:51,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:51,703 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 23:06:51,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:06:51,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288252876] [2023-11-06 23:06:51,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288252876] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:06:51,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:06:51,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:06:51,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817853643] [2023-11-06 23:06:51,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:06:51,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:06:51,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:06:51,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:06:51,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:06:51,708 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 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 23:06:51,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:06:51,765 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2023-11-06 23:06:51,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 23:06:51,765 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2023-11-06 23:06:51,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:06:51,766 INFO L225 Difference]: With dead ends: 16 [2023-11-06 23:06:51,766 INFO L226 Difference]: Without dead ends: 15 [2023-11-06 23:06:51,771 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:06:51,773 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 19 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 23:06:51,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 18 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 23:06:51,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2023-11-06 23:06:51,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2023-11-06 23:06:51,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:06:51,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2023-11-06 23:06:51,785 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 7 [2023-11-06 23:06:51,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:06:51,786 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2023-11-06 23:06:51,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 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 23:06:51,786 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2023-11-06 23:06:51,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-06 23:06:51,787 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:06:51,787 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:06:51,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 23:06:51,788 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-06 23:06:51,788 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:06:51,788 INFO L85 PathProgramCache]: Analyzing trace with hash 177748329, now seen corresponding path program 1 times [2023-11-06 23:06:51,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:06:51,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145117264] [2023-11-06 23:06:51,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:06:51,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:06:51,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:51,939 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 23:06:51,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:06:51,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145117264] [2023-11-06 23:06:51,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145117264] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:06:51,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:06:51,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 23:06:51,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219781616] [2023-11-06 23:06:51,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:06:51,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 23:06:51,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:06:51,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 23:06:51,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:06:51,942 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 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 23:06:51,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:06:51,992 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2023-11-06 23:06:51,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 23:06:51,993 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2023-11-06 23:06:51,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:06:51,993 INFO L225 Difference]: With dead ends: 15 [2023-11-06 23:06:51,994 INFO L226 Difference]: Without dead ends: 14 [2023-11-06 23:06:51,994 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-06 23:06:51,995 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 11 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 23:06:51,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 21 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 23:06:51,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2023-11-06 23:06:51,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2023-11-06 23:06:51,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 13 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 23:06:52,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2023-11-06 23:06:52,000 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 8 [2023-11-06 23:06:52,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:06:52,000 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2023-11-06 23:06:52,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 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 23:06:52,001 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2023-11-06 23:06:52,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-06 23:06:52,001 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:06:52,001 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:06:52,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 23:06:52,002 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-06 23:06:52,002 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:06:52,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1215230959, now seen corresponding path program 1 times [2023-11-06 23:06:52,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:06:52,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226664463] [2023-11-06 23:06:52,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:06:52,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:06:52,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:52,250 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 23:06:52,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:06:52,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226664463] [2023-11-06 23:06:52,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226664463] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:06:52,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:06:52,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:06:52,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031166971] [2023-11-06 23:06:52,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:06:52,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:06:52,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:06:52,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:06:52,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:06:52,253 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 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 23:06:52,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:06:52,284 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2023-11-06 23:06:52,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 23:06:52,285 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2023-11-06 23:06:52,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:06:52,286 INFO L225 Difference]: With dead ends: 14 [2023-11-06 23:06:52,286 INFO L226 Difference]: Without dead ends: 13 [2023-11-06 23:06:52,286 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:06:52,288 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 5 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 23:06:52,288 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 14 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 23:06:52,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2023-11-06 23:06:52,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2023-11-06 23:06:52,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 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 23:06:52,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2023-11-06 23:06:52,292 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 9 [2023-11-06 23:06:52,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:06:52,292 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2023-11-06 23:06:52,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 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 23:06:52,293 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2023-11-06 23:06:52,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-06 23:06:52,293 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:06:52,293 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:06:52,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 23:06:52,294 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-06 23:06:52,294 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:06:52,295 INFO L85 PathProgramCache]: Analyzing trace with hash -982545877, now seen corresponding path program 1 times [2023-11-06 23:06:52,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:06:52,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327261293] [2023-11-06 23:06:52,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:06:52,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:06:52,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:52,573 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 23:06:52,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:06:52,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327261293] [2023-11-06 23:06:52,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327261293] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:06:52,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:06:52,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 23:06:52,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661012884] [2023-11-06 23:06:52,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:06:52,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 23:06:52,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:06:52,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 23:06:52,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-06 23:06:52,577 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 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 23:06:52,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:06:52,644 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2023-11-06 23:06:52,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 23:06:52,645 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2023-11-06 23:06:52,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:06:52,645 INFO L225 Difference]: With dead ends: 24 [2023-11-06 23:06:52,646 INFO L226 Difference]: Without dead ends: 22 [2023-11-06 23:06:52,646 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-06 23:06:52,647 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 12 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 23:06:52,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 31 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 23:06:52,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-11-06 23:06:52,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-11-06 23:06:52,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:06:52,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2023-11-06 23:06:52,662 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 10 [2023-11-06 23:06:52,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:06:52,663 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2023-11-06 23:06:52,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 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 23:06:52,664 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2023-11-06 23:06:52,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-06 23:06:52,665 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:06:52,665 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2023-11-06 23:06:52,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 23:06:52,666 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-06 23:06:52,666 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:06:52,667 INFO L85 PathProgramCache]: Analyzing trace with hash -485350694, now seen corresponding path program 1 times [2023-11-06 23:06:52,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:06:52,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794623964] [2023-11-06 23:06:52,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:06:52,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:06:52,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:53,157 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:06:53,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:06:53,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794623964] [2023-11-06 23:06:53,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794623964] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:06:53,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [375410073] [2023-11-06 23:06:53,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:06:53,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:06:53,159 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f560ba7-7e18-48f1-8345-1c79b88c9b28/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:06:53,162 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f560ba7-7e18-48f1-8345-1c79b88c9b28/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:06:53,171 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f560ba7-7e18-48f1-8345-1c79b88c9b28/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 23:06:53,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:53,277 INFO L262 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 29 conjunts are in the unsatisfiable core [2023-11-06 23:06:53,287 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:06:53,384 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2023-11-06 23:06:53,401 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:06:53,403 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 49 [2023-11-06 23:06:53,435 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 1 [2023-11-06 23:06:53,466 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 45 [2023-11-06 23:06:53,499 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 1 [2023-11-06 23:06:53,544 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 40 [2023-11-06 23:06:53,566 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-06 23:06:53,592 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 45 [2023-11-06 23:06:53,615 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 54 [2023-11-06 23:06:53,632 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 0 case distinctions, treesize of input 57 treesize of output 29 [2023-11-06 23:06:53,638 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2023-11-06 23:06:53,667 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2023-11-06 23:06:53,680 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:06:53,683 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 49 [2023-11-06 23:06:53,703 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 1 [2023-11-06 23:06:53,736 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 45 [2023-11-06 23:06:53,755 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 1 [2023-11-06 23:06:54,734 INFO L322 Elim1Store]: treesize reduction 4, result has 84.0 percent of original size [2023-11-06 23:06:54,735 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1886 treesize of output 1598 [2023-11-06 23:06:54,770 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 101 [2023-11-06 23:06:54,785 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 91 [2023-11-06 23:06:54,888 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 7 treesize of output 5 [2023-11-06 23:06:54,909 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 7 treesize of output 5 [2023-11-06 23:06:54,943 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 29 treesize of output 23 [2023-11-06 23:06:55,147 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 23:06:55,255 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-06 23:06:55,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:06:55,330 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-11-06 23:06:55,369 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:06:55,369 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 23:06:55,418 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_120 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_120) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483650))) is different from false [2023-11-06 23:06:55,721 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:06:55,722 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2023-11-06 23:06:55,726 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 61 [2023-11-06 23:06:55,733 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 56 treesize of output 52 [2023-11-06 23:06:55,739 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 26 treesize of output 24 [2023-11-06 23:06:56,100 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 5 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-06 23:06:56,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [375410073] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 23:06:56,101 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 23:06:56,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 24 [2023-11-06 23:06:56,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901115331] [2023-11-06 23:06:56,101 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 23:06:56,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-11-06 23:06:56,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:06:56,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-06 23:06:56,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=435, Unknown=15, NotChecked=44, Total=600 [2023-11-06 23:06:56,104 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 25 states, 24 states have (on average 2.2916666666666665) internal successors, (55), 25 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:06:56,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:06:56,621 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2023-11-06 23:06:56,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 23:06:56,621 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.2916666666666665) internal successors, (55), 25 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-11-06 23:06:56,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:06:56,622 INFO L225 Difference]: With dead ends: 23 [2023-11-06 23:06:56,622 INFO L226 Difference]: Without dead ends: 22 [2023-11-06 23:06:56,623 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=205, Invalid=652, Unknown=17, NotChecked=56, Total=930 [2023-11-06 23:06:56,624 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 44 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 21 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 19 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 23:06:56,624 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 50 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 125 Invalid, 3 Unknown, 19 Unchecked, 0.2s Time] [2023-11-06 23:06:56,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-11-06 23:06:56,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2023-11-06 23:06:56,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.15) internal successors, (23), 20 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 23:06:56,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2023-11-06 23:06:56,630 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 19 [2023-11-06 23:06:56,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:06:56,630 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2023-11-06 23:06:56,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.2916666666666665) internal successors, (55), 25 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:06:56,631 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2023-11-06 23:06:56,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-06 23:06:56,632 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:06:56,632 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2023-11-06 23:06:56,644 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f560ba7-7e18-48f1-8345-1c79b88c9b28/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-06 23:06:56,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f560ba7-7e18-48f1-8345-1c79b88c9b28/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-06 23:06:56,833 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-06 23:06:56,833 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:06:56,833 INFO L85 PathProgramCache]: Analyzing trace with hash 2133997730, now seen corresponding path program 1 times [2023-11-06 23:06:56,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:06:56,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471829997] [2023-11-06 23:06:56,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:06:56,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:06:56,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:57,321 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:06:57,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:06:57,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471829997] [2023-11-06 23:06:57,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471829997] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:06:57,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [629747465] [2023-11-06 23:06:57,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:06:57,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:06:57,323 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f560ba7-7e18-48f1-8345-1c79b88c9b28/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:06:57,324 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f560ba7-7e18-48f1-8345-1c79b88c9b28/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:06:57,343 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f560ba7-7e18-48f1-8345-1c79b88c9b28/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 23:06:57,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:57,413 INFO L262 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 31 conjunts are in the unsatisfiable core [2023-11-06 23:06:57,417 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:06:57,450 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 40 [2023-11-06 23:06:57,463 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2023-11-06 23:06:57,476 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 1 [2023-11-06 23:06:57,484 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 1 [2023-11-06 23:06:57,505 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 45 [2023-11-06 23:06:57,525 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 54 [2023-11-06 23:06:57,544 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 0 case distinctions, treesize of input 57 treesize of output 29 [2023-11-06 23:06:57,549 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2023-11-06 23:06:57,565 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2023-11-06 23:06:57,581 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 1 [2023-11-06 23:06:57,597 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 45 [2023-11-06 23:06:57,605 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:06:57,606 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 54 [2023-11-06 23:06:57,613 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:06:57,614 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 57 treesize of output 29 [2023-11-06 23:06:57,622 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2023-11-06 23:06:57,636 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2023-11-06 23:06:57,667 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 1 [2023-11-06 23:06:57,687 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 45 [2023-11-06 23:06:57,696 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:06:57,699 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 49 [2023-11-06 23:06:57,706 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:06:57,710 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 45 treesize of output 21 [2023-11-06 23:06:57,717 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2023-11-06 23:06:58,331 INFO L322 Elim1Store]: treesize reduction 40, result has 40.3 percent of original size [2023-11-06 23:06:58,332 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 30 treesize of output 42 [2023-11-06 23:06:58,444 INFO L322 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-06 23:06:58,445 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 2 case distinctions, treesize of input 27 treesize of output 24 [2023-11-06 23:06:58,508 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2023-11-06 23:06:58,594 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-06 23:06:58,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:06:58,641 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2023-11-06 23:06:58,645 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:06:58,646 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 23:07:01,476 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 5 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:07:01,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [629747465] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 23:07:01,476 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 23:07:01,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 25 [2023-11-06 23:07:01,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333152068] [2023-11-06 23:07:01,477 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 23:07:01,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-06 23:07:01,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:07:01,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-06 23:07:01,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=474, Unknown=43, NotChecked=0, Total=650 [2023-11-06 23:07:01,480 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 26 states, 25 states have (on average 2.24) internal successors, (56), 26 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:07:02,024 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (forall ((v_ArrVal_170 (Array Int Int)) (v_ArrVal_173 (Array Int Int)) (v_ArrVal_174 (Array Int Int)) (v_ArrVal_171 Int) (v_ArrVal_169 (Array Int Int))) (let ((.cse2 (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_169) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_170) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_171)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_173) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_174) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_171)))))) (and (forall ((v_ArrVal_173 (Array Int Int)) (v_ArrVal_174 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_173) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_174) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647)) (forall ((v_ArrVal_170 (Array Int Int)) (v_ArrVal_173 (Array Int Int)) (v_ArrVal_174 (Array Int Int)) (v_ArrVal_171 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_170) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_171)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_173) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_174) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_171)))) .cse1 (or (< (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 1) .cse1 (< (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1)) (forall ((v_ArrVal_174 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_174) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647)) (or .cse1 (not |c_ULTIMATE.start_test_fun_#t~short7#1|)))) is different from false [2023-11-06 23:07:02,138 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_173 (Array Int Int)) (v_ArrVal_174 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_173) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_174) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647)) (or (forall ((v_ArrVal_170 (Array Int Int)) (v_ArrVal_173 (Array Int Int)) (v_ArrVal_174 (Array Int Int)) (v_ArrVal_171 Int) (v_ArrVal_169 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_169) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_170) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_171)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_173) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_174) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_171)))) (not |c_ULTIMATE.start_test_fun_#t~short7#1|))) is different from false [2023-11-06 23:07:02,163 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_173 (Array Int Int)) (v_ArrVal_174 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_173) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_174) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647)) (forall ((v_ArrVal_170 (Array Int Int)) (v_ArrVal_173 (Array Int Int)) (v_ArrVal_174 (Array Int Int)) (v_ArrVal_171 Int) (v_ArrVal_169 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_169) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_170) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_171)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_173) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_174) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_171))))) is different from false [2023-11-06 23:07:02,169 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_170 (Array Int Int)) (v_ArrVal_173 (Array Int Int)) (v_ArrVal_174 (Array Int Int)) (v_ArrVal_171 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_170) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_171)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_173) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_174) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_171)))) (forall ((v_ArrVal_174 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_174) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))) is different from false [2023-11-06 23:07:02,506 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_170 (Array Int Int)) (v_ArrVal_173 (Array Int Int)) (v_ArrVal_174 (Array Int Int)) (v_ArrVal_171 Int) (v_ArrVal_169 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_169) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_170) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_171)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_173) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_174) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_171)))))) (and .cse0 (or (< (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 1) .cse0 (< (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1)) (or .cse0 (not |c_ULTIMATE.start_test_fun_#t~short7#1|)))) is different from false [2023-11-06 23:07:02,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:07:02,631 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2023-11-06 23:07:02,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-06 23:07:02,632 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.24) internal successors, (56), 26 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-11-06 23:07:02,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:07:02,633 INFO L225 Difference]: With dead ends: 61 [2023-11-06 23:07:02,633 INFO L226 Difference]: Without dead ends: 60 [2023-11-06 23:07:02,634 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=310, Invalid=835, Unknown=65, NotChecked=350, Total=1560 [2023-11-06 23:07:02,635 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 45 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 44 mSolverCounterUnsat, 68 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 68 IncrementalHoareTripleChecker+Unknown, 162 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-06 23:07:02,635 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 68 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 158 Invalid, 68 Unknown, 162 Unchecked, 0.6s Time] [2023-11-06 23:07:02,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-11-06 23:07:02,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 48. [2023-11-06 23:07:02,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.127659574468085) internal successors, (53), 47 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:07:02,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2023-11-06 23:07:02,644 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 20 [2023-11-06 23:07:02,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:07:02,644 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2023-11-06 23:07:02,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.24) internal successors, (56), 26 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:07:02,645 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2023-11-06 23:07:02,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-11-06 23:07:02,646 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:07:02,646 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1] [2023-11-06 23:07:02,660 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f560ba7-7e18-48f1-8345-1c79b88c9b28/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-06 23:07:02,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f560ba7-7e18-48f1-8345-1c79b88c9b28/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-11-06 23:07:02,853 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-06 23:07:02,854 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:07:02,854 INFO L85 PathProgramCache]: Analyzing trace with hash -893337167, now seen corresponding path program 2 times [2023-11-06 23:07:02,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:07:02,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642416579] [2023-11-06 23:07:02,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:07:02,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:07:02,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:04,182 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:07:04,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:07:04,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642416579] [2023-11-06 23:07:04,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642416579] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:07:04,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1054849275] [2023-11-06 23:07:04,183 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 23:07:04,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:07:04,184 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f560ba7-7e18-48f1-8345-1c79b88c9b28/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:07:04,185 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f560ba7-7e18-48f1-8345-1c79b88c9b28/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:07:04,219 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f560ba7-7e18-48f1-8345-1c79b88c9b28/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-06 23:07:04,320 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 23:07:04,320 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 23:07:04,322 INFO L262 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 49 conjunts are in the unsatisfiable core [2023-11-06 23:07:04,330 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:07:04,353 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 45 [2023-11-06 23:07:04,369 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 1 [2023-11-06 23:07:04,389 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2023-11-06 23:07:04,409 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 1 [2023-11-06 23:07:04,428 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 45 [2023-11-06 23:07:04,441 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 1 [2023-11-06 23:07:04,471 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2023-11-06 23:07:04,484 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 1 [2023-11-06 23:07:04,511 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 40 [2023-11-06 23:07:04,525 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-06 23:07:04,540 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 45 [2023-11-06 23:07:04,558 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-06 23:07:05,923 INFO L322 Elim1Store]: treesize reduction 40, result has 40.3 percent of original size [2023-11-06 23:07:05,924 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 1609 treesize of output 1347 [2023-11-06 23:07:05,964 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-11-06 23:07:05,968 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2023-11-06 23:07:05,977 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 37 [2023-11-06 23:07:05,990 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-11-06 23:07:06,105 INFO L322 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-06 23:07:06,105 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 2 case distinctions, treesize of input 27 treesize of output 24 [2023-11-06 23:07:06,213 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2023-11-06 23:07:06,323 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-06 23:07:06,349 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-06 23:07:06,447 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2023-11-06 23:07:06,569 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-06 23:07:06,598 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-06 23:07:06,691 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2023-11-06 23:07:06,796 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-06 23:07:06,836 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-06 23:07:06,928 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2023-11-06 23:07:07,038 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-06 23:07:07,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:07:07,118 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2023-11-06 23:07:07,124 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 88 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:07:07,124 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 23:07:07,261 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_276 (Array Int Int)) (v_ArrVal_275 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_276) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647)) is different from false [2023-11-06 23:07:07,404 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_272 (Array Int Int)) (v_ArrVal_274 Int) (v_ArrVal_276 (Array Int Int)) (v_ArrVal_275 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_272) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_274)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_276) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_274)))) is different from false [2023-11-06 23:07:07,800 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_269 Int) (v_ArrVal_272 (Array Int Int)) (v_ArrVal_274 Int) (v_ArrVal_271 (Array Int Int)) (v_ArrVal_276 (Array Int Int)) (v_ArrVal_275 (Array Int Int)) (v_ArrVal_268 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_268) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_269)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_271) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_272) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_274) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_274)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_276) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_269))))) is different from false [2023-11-06 23:07:10,225 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_269 Int) (v_ArrVal_266 Int) (v_ArrVal_272 (Array Int Int)) (v_ArrVal_274 Int) (v_ArrVal_271 (Array Int Int)) (v_ArrVal_276 (Array Int Int)) (v_ArrVal_275 (Array Int Int)) (v_ArrVal_267 (Array Int Int)) (v_ArrVal_268 (Array Int Int))) (let ((.cse1 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_266)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_267) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_268) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_269)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_271) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_272) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_274) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_274)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_276) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ |c_ULTIMATE.start_test_fun_#t~mem10#1| 1) v_ArrVal_266) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_269))))) is different from false [2023-11-06 23:07:10,858 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_272 (Array Int Int)) (v_ArrVal_271 (Array Int Int)) (v_ArrVal_263 (Array Int Int)) (v_ArrVal_276 (Array Int Int)) (v_ArrVal_264 (Array Int Int)) (v_ArrVal_275 (Array Int Int)) (v_ArrVal_267 (Array Int Int)) (v_ArrVal_268 (Array Int Int)) (v_ArrVal_269 Int) (v_ArrVal_266 Int) (v_ArrVal_274 Int) (v_ArrVal_261 Int)) (let ((.cse2 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_261)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_263) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_264) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse1 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_266)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_267) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_268) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_269)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_271) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_272) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_274) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_274)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_276) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_269) (< (+ |c_ULTIMATE.start_test_fun_#t~mem10#1| 1) v_ArrVal_261) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_266)))))) is different from false [2023-11-06 23:07:14,353 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 8 refuted. 34 times theorem prover too weak. 0 trivial. 48 not checked. [2023-11-06 23:07:14,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1054849275] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 23:07:14,354 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 23:07:14,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 19] total 46 [2023-11-06 23:07:14,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425989685] [2023-11-06 23:07:14,354 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 23:07:14,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2023-11-06 23:07:14,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:07:14,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2023-11-06 23:07:14,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=404, Invalid=1214, Unknown=124, NotChecked=420, Total=2162 [2023-11-06 23:07:14,358 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand has 47 states, 46 states have (on average 2.9782608695652173) internal successors, (137), 47 states have internal predecessors, (137), 0 states have call successors, (0), 0 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 23:07:14,398 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|)) (.cse7 (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| |c_ULTIMATE.start_test_fun_~c~0#1.base|)) (.cse8 (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse1 (not .cse8)) (.cse2 (not .cse7)) (.cse3 (select .cse4 0))) (and (= |c_ULTIMATE.start_test_fun_~c~0#1.offset| 0) (let ((.cse0 (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (.cse5 (<= .cse3 0))) (or (and (not .cse0) .cse1 (or (and .cse2 (exists ((v_DerPreprocessor_40 (Array Int Int)) (v_DerPreprocessor_41 (Array Int Int)) (|ULTIMATE.start_test_fun_~y#1| Int) (v_DerPreprocessor_39 (Array Int Int))) (= (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_40) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_41) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_39) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_40) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_41) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) 0 |ULTIMATE.start_test_fun_~y#1|)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) 0 .cse3) .cse4)) .cse5) (and (exists ((|ULTIMATE.start_test_fun_~y#1| Int) (v_DerPreprocessor_37 (Array Int Int)) (v_DerPreprocessor_38 (Array Int Int))) (= (store (select (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_37) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_38))) (store .cse6 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store (select .cse6 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) 0 |ULTIMATE.start_test_fun_~y#1|))) |c_ULTIMATE.start_test_fun_~c~0#1.base|) 0 .cse3) .cse4)) .cse7 .cse5))) (and .cse8 (or (and .cse7 (exists ((v_DerPreprocessor_30 (Array Int Int)) (v_DerPreprocessor_31 (Array Int Int)) (|ULTIMATE.start_test_fun_~y#1| Int)) (let ((.cse9 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_30) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_31))) (and (= (store (select (store .cse9 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store (select .cse9 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) 0 |ULTIMATE.start_test_fun_~y#1|)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) 0 .cse3) .cse4) (= v_DerPreprocessor_30 (select .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.base|))))) .cse5) (and (exists ((|ULTIMATE.start_test_fun_~y#1| Int) (v_DerPreprocessor_27 (Array Int Int)) (v_DerPreprocessor_28 (Array Int Int)) (v_DerPreprocessor_29 (Array Int Int))) (let ((.cse10 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_27) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_28) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_29))) (and (= .cse4 (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_28) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_29) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store (select .cse10 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) 0 |ULTIMATE.start_test_fun_~y#1|)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) 0 .cse3)) (= (select .cse10 |c_ULTIMATE.start_test_fun_~c~0#1.base|) v_DerPreprocessor_28)))) .cse2 .cse5))) (and .cse0 (or (and (exists ((v_DerPreprocessor_32 (Array Int Int)) (|ULTIMATE.start_test_fun_~y#1| Int) (v_DerPreprocessor_33 (Array Int Int)) (v_DerPreprocessor_34 (Array Int Int))) (let ((.cse11 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_33) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_34) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (and (= (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_33) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_34) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse11 0 |ULTIMATE.start_test_fun_~y#1|)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) 0 .cse3) .cse4) (= .cse11 v_DerPreprocessor_32)))) .cse2 .cse5) (and (exists ((|ULTIMATE.start_test_fun_~y#1| Int) (v_DerPreprocessor_35 (Array Int Int)) (v_DerPreprocessor_36 (Array Int Int))) (let ((.cse12 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_35) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_36))) (and (= v_DerPreprocessor_35 (select .cse12 |c_ULTIMATE.start_test_fun_~c~0#1.base|)) (= .cse4 (store (select (store .cse12 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store (select .cse12 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) 0 |ULTIMATE.start_test_fun_~y#1|)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) 0 .cse3))))) .cse7 .cse5))))) (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) .cse1 .cse2 (= (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 0) (<= .cse3 1) (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)))) is different from true [2023-11-06 23:07:23,466 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_272 (Array Int Int)) (v_ArrVal_260 (Array Int Int)) (v_ArrVal_271 (Array Int Int)) (v_ArrVal_263 (Array Int Int)) (v_ArrVal_276 (Array Int Int)) (v_ArrVal_264 (Array Int Int)) (v_ArrVal_275 (Array Int Int)) (v_ArrVal_267 (Array Int Int)) (v_ArrVal_268 (Array Int Int)) (v_ArrVal_269 Int) (v_ArrVal_259 (Array Int Int)) (v_ArrVal_266 Int) (v_ArrVal_274 Int) (v_ArrVal_261 Int)) (let ((.cse16 (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_259) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_260) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse17 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse16 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_261)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_263) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_264) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse15 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse17 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_266)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_267) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_268) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse14 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse15 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_269)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_271) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_272) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse14 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_274)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_276) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse15 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_269) (< (+ (select .cse16 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_261) (< (+ (select .cse17 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_266) (< (+ (select .cse14 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_274))))))))) (and .cse0 (forall ((v_ArrVal_272 (Array Int Int)) (v_ArrVal_274 Int) (v_ArrVal_271 (Array Int Int)) (v_ArrVal_276 (Array Int Int)) (v_ArrVal_275 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_271) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_272) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_274)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_276) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_274)))) (or .cse0 (not |c_ULTIMATE.start_test_fun_#t~short7#1|)) (forall ((v_ArrVal_272 (Array Int Int)) (v_ArrVal_260 (Array Int Int)) (v_ArrVal_271 (Array Int Int)) (v_ArrVal_263 (Array Int Int)) (v_ArrVal_276 (Array Int Int)) (v_ArrVal_264 (Array Int Int)) (v_ArrVal_275 (Array Int Int)) (v_ArrVal_267 (Array Int Int)) (v_ArrVal_268 (Array Int Int)) (v_ArrVal_269 Int) (v_ArrVal_266 Int) (v_ArrVal_274 Int) (v_ArrVal_261 Int)) (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_260) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse5 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_261)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_263) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_264) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse3 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_266)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_267) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_268) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse2 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_269)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_271) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_272) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_274)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_276) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_269) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_274) (< (+ (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_261) (< (+ (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_266))))))) (forall ((v_ArrVal_269 Int) (v_ArrVal_266 Int) (v_ArrVal_272 (Array Int Int)) (v_ArrVal_274 Int) (v_ArrVal_271 (Array Int Int)) (v_ArrVal_276 (Array Int Int)) (v_ArrVal_264 (Array Int Int)) (v_ArrVal_275 (Array Int Int)) (v_ArrVal_267 (Array Int Int)) (v_ArrVal_268 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_264) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse6 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_266)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_267) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_268) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse8 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_269)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_271) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_272) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_269) (< (+ (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_266) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_274)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_276) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_274)))))) (forall ((v_ArrVal_269 Int) (v_ArrVal_272 (Array Int Int)) (v_ArrVal_274 Int) (v_ArrVal_271 (Array Int Int)) (v_ArrVal_276 (Array Int Int)) (v_ArrVal_275 (Array Int Int)) (v_ArrVal_267 (Array Int Int)) (v_ArrVal_268 (Array Int Int))) (let ((.cse10 (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_267) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_268) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse9 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse10 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_269)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_271) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_272) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_274)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_276) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse10 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_269) (< (+ (select .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_274))))) (forall ((v_ArrVal_276 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_276) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647)) (or .cse0 (< (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 1) (< (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1)) (forall ((v_ArrVal_269 Int) (v_ArrVal_266 Int) (v_ArrVal_272 (Array Int Int)) (v_ArrVal_274 Int) (v_ArrVal_271 (Array Int Int)) (v_ArrVal_263 (Array Int Int)) (v_ArrVal_276 (Array Int Int)) (v_ArrVal_264 (Array Int Int)) (v_ArrVal_275 (Array Int Int)) (v_ArrVal_267 (Array Int Int)) (v_ArrVal_268 (Array Int Int))) (let ((.cse12 (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_263) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_264) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse13 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse12 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_266)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_267) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_268) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse11 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse13 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_269)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_271) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_272) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse11 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_274) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse11 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_274)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_276) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse12 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_266) (< (+ (select .cse13 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_269)))))))) is different from false [2023-11-06 23:07:24,110 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_272 (Array Int Int)) (v_ArrVal_260 (Array Int Int)) (v_ArrVal_271 (Array Int Int)) (v_ArrVal_263 (Array Int Int)) (v_ArrVal_276 (Array Int Int)) (v_ArrVal_264 (Array Int Int)) (v_ArrVal_275 (Array Int Int)) (v_ArrVal_267 (Array Int Int)) (v_ArrVal_268 (Array Int Int)) (v_ArrVal_269 Int) (v_ArrVal_259 (Array Int Int)) (v_ArrVal_266 Int) (v_ArrVal_274 Int) (v_ArrVal_261 Int)) (let ((.cse9 (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_259) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_260) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse10 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_261)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_263) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_264) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse8 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse10 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_266)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_267) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_268) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse7 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_269)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_271) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_272) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_274)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_276) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_269) (< (+ (select .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_261) (< (+ (select .cse10 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_266) (< (+ (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_274))))))))) (and .cse0 (forall ((v_ArrVal_272 (Array Int Int)) (v_ArrVal_274 Int) (v_ArrVal_271 (Array Int Int)) (v_ArrVal_276 (Array Int Int)) (v_ArrVal_275 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_271) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_272) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_274)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_276) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_274)))) (or .cse0 (not |c_ULTIMATE.start_test_fun_#t~short7#1|)) (forall ((v_ArrVal_269 Int) (v_ArrVal_272 (Array Int Int)) (v_ArrVal_274 Int) (v_ArrVal_271 (Array Int Int)) (v_ArrVal_276 (Array Int Int)) (v_ArrVal_275 (Array Int Int)) (v_ArrVal_267 (Array Int Int)) (v_ArrVal_268 (Array Int Int))) (let ((.cse3 (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_267) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_268) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse2 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_269)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_271) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_272) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_274)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_276) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_269) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_274))))) (or .cse0 (< (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 1) (< (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1)) (forall ((v_ArrVal_269 Int) (v_ArrVal_266 Int) (v_ArrVal_272 (Array Int Int)) (v_ArrVal_274 Int) (v_ArrVal_271 (Array Int Int)) (v_ArrVal_263 (Array Int Int)) (v_ArrVal_276 (Array Int Int)) (v_ArrVal_264 (Array Int Int)) (v_ArrVal_275 (Array Int Int)) (v_ArrVal_267 (Array Int Int)) (v_ArrVal_268 (Array Int Int))) (let ((.cse5 (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_263) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_264) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse6 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_266)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_267) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_268) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse4 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_269)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_271) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_272) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_274) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_274)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_276) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_266) (< (+ (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_269)))))))) is different from false [2023-11-06 23:07:36,874 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_test_fun_#t~mem10#1| 1)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (and (forall ((v_ArrVal_269 Int) (v_ArrVal_272 (Array Int Int)) (v_ArrVal_274 Int) (v_ArrVal_271 (Array Int Int)) (v_ArrVal_276 (Array Int Int)) (v_ArrVal_275 (Array Int Int))) (let ((.cse1 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_269)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_271) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_272) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< .cse0 v_ArrVal_269) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_274) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_274)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_276) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647)))) (<= |c_ULTIMATE.start_test_fun_#t~mem10#1| 2147483646) (forall ((v_ArrVal_276 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_276) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647)) (forall ((v_ArrVal_274 Int) (v_ArrVal_276 (Array Int Int)) (v_ArrVal_275 (Array Int Int))) (or (< .cse0 v_ArrVal_274) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_274)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_276) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))) (forall ((v_ArrVal_269 Int) (v_ArrVal_266 Int) (v_ArrVal_272 (Array Int Int)) (v_ArrVal_274 Int) (v_ArrVal_271 (Array Int Int)) (v_ArrVal_276 (Array Int Int)) (v_ArrVal_275 (Array Int Int)) (v_ArrVal_267 (Array Int Int)) (v_ArrVal_268 (Array Int Int))) (let ((.cse4 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_266)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_267) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_268) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse3 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_269)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_271) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_272) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_274) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_274)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_276) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< .cse0 v_ArrVal_266) (< (+ (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_269))))) (forall ((v_ArrVal_272 (Array Int Int)) (v_ArrVal_271 (Array Int Int)) (v_ArrVal_263 (Array Int Int)) (v_ArrVal_276 (Array Int Int)) (v_ArrVal_264 (Array Int Int)) (v_ArrVal_275 (Array Int Int)) (v_ArrVal_267 (Array Int Int)) (v_ArrVal_268 (Array Int Int)) (v_ArrVal_269 Int) (v_ArrVal_266 Int) (v_ArrVal_274 Int) (v_ArrVal_261 Int)) (let ((.cse7 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_261)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_263) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_264) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse6 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_266)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_267) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_268) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse5 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_269)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_271) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_272) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_274) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_274)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_276) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_269) (< .cse0 v_ArrVal_261) (< (+ (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_266)))))))) is different from false [2023-11-06 23:07:36,982 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_test_fun_#t~mem10#1| 1)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (and (forall ((v_ArrVal_269 Int) (v_ArrVal_272 (Array Int Int)) (v_ArrVal_274 Int) (v_ArrVal_271 (Array Int Int)) (v_ArrVal_276 (Array Int Int)) (v_ArrVal_275 (Array Int Int))) (let ((.cse1 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_269)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_271) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_272) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< .cse0 v_ArrVal_269) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_274) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_274)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_276) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647)))) (forall ((v_ArrVal_274 Int) (v_ArrVal_276 (Array Int Int)) (v_ArrVal_275 (Array Int Int))) (or (< .cse0 v_ArrVal_274) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_274)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_276) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))) (forall ((v_ArrVal_269 Int) (v_ArrVal_266 Int) (v_ArrVal_272 (Array Int Int)) (v_ArrVal_274 Int) (v_ArrVal_271 (Array Int Int)) (v_ArrVal_276 (Array Int Int)) (v_ArrVal_275 (Array Int Int)) (v_ArrVal_267 (Array Int Int)) (v_ArrVal_268 (Array Int Int))) (let ((.cse4 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_266)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_267) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_268) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse3 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_269)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_271) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_272) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_274) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_274)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_276) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< .cse0 v_ArrVal_266) (< (+ (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_269))))) (forall ((v_ArrVal_272 (Array Int Int)) (v_ArrVal_271 (Array Int Int)) (v_ArrVal_263 (Array Int Int)) (v_ArrVal_276 (Array Int Int)) (v_ArrVal_264 (Array Int Int)) (v_ArrVal_275 (Array Int Int)) (v_ArrVal_267 (Array Int Int)) (v_ArrVal_268 (Array Int Int)) (v_ArrVal_269 Int) (v_ArrVal_266 Int) (v_ArrVal_274 Int) (v_ArrVal_261 Int)) (let ((.cse7 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_261)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_263) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_264) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse6 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_266)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_267) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_268) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse5 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_269)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_271) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_272) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_274) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_274)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_276) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_269) (< .cse0 v_ArrVal_261) (< (+ (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_266)))))))) is different from false [2023-11-06 23:07:36,995 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_test_fun_#t~mem10#1| 1)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (and (forall ((v_ArrVal_269 Int) (v_ArrVal_272 (Array Int Int)) (v_ArrVal_274 Int) (v_ArrVal_271 (Array Int Int)) (v_ArrVal_276 (Array Int Int)) (v_ArrVal_275 (Array Int Int))) (let ((.cse1 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_269)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_271) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_272) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< .cse0 v_ArrVal_269) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_274) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_274)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_276) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647)))) (<= |c_ULTIMATE.start_test_fun_#t~mem10#1| 2147483646) (forall ((v_ArrVal_274 Int) (v_ArrVal_276 (Array Int Int)) (v_ArrVal_275 (Array Int Int))) (or (< .cse0 v_ArrVal_274) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_274)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_276) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))) (forall ((v_ArrVal_269 Int) (v_ArrVal_266 Int) (v_ArrVal_272 (Array Int Int)) (v_ArrVal_274 Int) (v_ArrVal_271 (Array Int Int)) (v_ArrVal_276 (Array Int Int)) (v_ArrVal_275 (Array Int Int)) (v_ArrVal_267 (Array Int Int)) (v_ArrVal_268 (Array Int Int))) (let ((.cse4 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_266)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_267) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_268) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse3 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_269)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_271) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_272) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_274) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_274)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_276) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< .cse0 v_ArrVal_266) (< (+ (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_269))))) (forall ((v_ArrVal_272 (Array Int Int)) (v_ArrVal_271 (Array Int Int)) (v_ArrVal_263 (Array Int Int)) (v_ArrVal_276 (Array Int Int)) (v_ArrVal_264 (Array Int Int)) (v_ArrVal_275 (Array Int Int)) (v_ArrVal_267 (Array Int Int)) (v_ArrVal_268 (Array Int Int)) (v_ArrVal_269 Int) (v_ArrVal_266 Int) (v_ArrVal_274 Int) (v_ArrVal_261 Int)) (let ((.cse7 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_261)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_263) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_264) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse6 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_266)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_267) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_268) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse5 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_269)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_271) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_272) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_274) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_274)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_276) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_269) (< .cse0 v_ArrVal_261) (< (+ (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_266)))))))) is different from false [2023-11-06 23:07:49,371 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 23:07:51,375 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 23:07:53,472 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 23:07:55,431 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 23:07:57,175 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 23:07:59,178 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 23:07:59,379 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_272 (Array Int Int)) (v_ArrVal_260 (Array Int Int)) (v_ArrVal_271 (Array Int Int)) (v_ArrVal_263 (Array Int Int)) (v_ArrVal_276 (Array Int Int)) (v_ArrVal_264 (Array Int Int)) (v_ArrVal_275 (Array Int Int)) (v_ArrVal_267 (Array Int Int)) (v_ArrVal_268 (Array Int Int)) (v_ArrVal_269 Int) (v_ArrVal_259 (Array Int Int)) (v_ArrVal_266 Int) (v_ArrVal_274 Int) (v_ArrVal_261 Int)) (let ((.cse9 (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_259) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_260) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse10 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_261)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_263) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_264) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse8 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse10 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_266)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_267) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_268) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse7 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_269)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_271) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_272) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_274)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_276) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_269) (< (+ (select .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_261) (< (+ (select .cse10 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_266) (< (+ (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_274))))))))) (and .cse0 (forall ((v_ArrVal_272 (Array Int Int)) (v_ArrVal_274 Int) (v_ArrVal_271 (Array Int Int)) (v_ArrVal_276 (Array Int Int)) (v_ArrVal_275 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_271) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_272) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_274)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_276) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_274)))) (or .cse0 (not |c_ULTIMATE.start_test_fun_#t~short7#1|)) (forall ((v_ArrVal_269 Int) (v_ArrVal_272 (Array Int Int)) (v_ArrVal_274 Int) (v_ArrVal_271 (Array Int Int)) (v_ArrVal_276 (Array Int Int)) (v_ArrVal_275 (Array Int Int)) (v_ArrVal_267 (Array Int Int)) (v_ArrVal_268 (Array Int Int))) (let ((.cse3 (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_267) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_268) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse2 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_269)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_271) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_272) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_274)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_276) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_269) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_274))))) (forall ((v_ArrVal_276 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_276) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647)) (or .cse0 (< (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 1) (< (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1)) (forall ((v_ArrVal_269 Int) (v_ArrVal_266 Int) (v_ArrVal_272 (Array Int Int)) (v_ArrVal_274 Int) (v_ArrVal_271 (Array Int Int)) (v_ArrVal_263 (Array Int Int)) (v_ArrVal_276 (Array Int Int)) (v_ArrVal_264 (Array Int Int)) (v_ArrVal_275 (Array Int Int)) (v_ArrVal_267 (Array Int Int)) (v_ArrVal_268 (Array Int Int))) (let ((.cse5 (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_263) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_264) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse6 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_266)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_267) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_268) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse4 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_269)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_271) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_272) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_274) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_274)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_276) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_266) (< (+ (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_269)))))))) is different from false [2023-11-06 23:08:01,388 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 23:08:03,962 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.57s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 23:08:06,411 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.45s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 23:08:07,725 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 23:08:09,737 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 23:08:09,751 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_276 (Array Int Int)) (v_ArrVal_275 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_276) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647)) (forall ((v_ArrVal_272 (Array Int Int)) (v_ArrVal_274 Int) (v_ArrVal_271 (Array Int Int)) (v_ArrVal_276 (Array Int Int)) (v_ArrVal_275 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_271) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_272) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_274)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_276) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_274)))) (forall ((v_ArrVal_269 Int) (v_ArrVal_272 (Array Int Int)) (v_ArrVal_274 Int) (v_ArrVal_271 (Array Int Int)) (v_ArrVal_276 (Array Int Int)) (v_ArrVal_275 (Array Int Int)) (v_ArrVal_267 (Array Int Int)) (v_ArrVal_268 (Array Int Int))) (let ((.cse2 (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_267) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_268) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse1 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_269)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_271) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_272) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_274)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_276) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_269) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_274))))) (forall ((v_ArrVal_276 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_276) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647)) (forall ((v_ArrVal_269 Int) (v_ArrVal_266 Int) (v_ArrVal_272 (Array Int Int)) (v_ArrVal_274 Int) (v_ArrVal_271 (Array Int Int)) (v_ArrVal_263 (Array Int Int)) (v_ArrVal_276 (Array Int Int)) (v_ArrVal_264 (Array Int Int)) (v_ArrVal_275 (Array Int Int)) (v_ArrVal_267 (Array Int Int)) (v_ArrVal_268 (Array Int Int))) (let ((.cse4 (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_263) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_264) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse5 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_266)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_267) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_268) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse3 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_269)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_271) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_272) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_274) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_274)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_276) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_266) (< (+ (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_269))))))) is different from false [2023-11-06 23:08:13,007 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_test_fun_#t~mem10#1| 1)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (and (forall ((v_ArrVal_269 Int) (v_ArrVal_272 (Array Int Int)) (v_ArrVal_274 Int) (v_ArrVal_271 (Array Int Int)) (v_ArrVal_276 (Array Int Int)) (v_ArrVal_275 (Array Int Int))) (let ((.cse1 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_269)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_271) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_272) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< .cse0 v_ArrVal_269) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_274) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_274)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_276) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647)))) (<= |c_ULTIMATE.start_test_fun_#t~mem10#1| 2147483646) (forall ((v_ArrVal_274 Int) (v_ArrVal_276 (Array Int Int)) (v_ArrVal_275 (Array Int Int))) (or (< .cse0 v_ArrVal_274) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_274)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_276) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))) (forall ((v_ArrVal_269 Int) (v_ArrVal_266 Int) (v_ArrVal_272 (Array Int Int)) (v_ArrVal_274 Int) (v_ArrVal_271 (Array Int Int)) (v_ArrVal_276 (Array Int Int)) (v_ArrVal_275 (Array Int Int)) (v_ArrVal_267 (Array Int Int)) (v_ArrVal_268 (Array Int Int))) (let ((.cse4 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_266)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_267) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_268) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse3 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_269)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_271) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_272) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_274) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_274)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_276) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< .cse0 v_ArrVal_266) (< (+ (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_269))))))) is different from false [2023-11-06 23:08:25,740 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 23:08:28,136 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 23:08:30,139 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 23:08:33,419 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 23:08:33,651 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_276 (Array Int Int)) (v_ArrVal_275 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_276) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647)) (forall ((v_ArrVal_272 (Array Int Int)) (v_ArrVal_274 Int) (v_ArrVal_271 (Array Int Int)) (v_ArrVal_276 (Array Int Int)) (v_ArrVal_275 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_271) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_272) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_274)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_276) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_274)))) (forall ((v_ArrVal_269 Int) (v_ArrVal_272 (Array Int Int)) (v_ArrVal_274 Int) (v_ArrVal_271 (Array Int Int)) (v_ArrVal_276 (Array Int Int)) (v_ArrVal_275 (Array Int Int)) (v_ArrVal_267 (Array Int Int)) (v_ArrVal_268 (Array Int Int))) (let ((.cse2 (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_267) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_268) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse1 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_269)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_271) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_272) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_274)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_276) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_269) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_274))))) (forall ((v_ArrVal_276 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_276) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))) is different from false [2023-11-06 23:08:39,107 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_276 (Array Int Int)) (v_ArrVal_275 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_276) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647)) (forall ((v_ArrVal_272 (Array Int Int)) (v_ArrVal_274 Int) (v_ArrVal_271 (Array Int Int)) (v_ArrVal_276 (Array Int Int)) (v_ArrVal_275 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_271) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_272) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_274)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_276) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_274))))) is different from false [2023-11-06 23:08:39,281 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_272 (Array Int Int)) (v_ArrVal_260 (Array Int Int)) (v_ArrVal_271 (Array Int Int)) (v_ArrVal_263 (Array Int Int)) (v_ArrVal_276 (Array Int Int)) (v_ArrVal_264 (Array Int Int)) (v_ArrVal_275 (Array Int Int)) (v_ArrVal_267 (Array Int Int)) (v_ArrVal_268 (Array Int Int)) (v_ArrVal_269 Int) (v_ArrVal_259 (Array Int Int)) (v_ArrVal_266 Int) (v_ArrVal_274 Int) (v_ArrVal_261 Int)) (let ((.cse3 (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_259) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_260) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse4 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_261)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_263) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_264) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse2 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_266)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_267) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_268) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse1 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_269)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_271) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_272) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_274)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_276) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_269) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_261) (< (+ (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_266) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_274))))))))) (and .cse0 (or .cse0 (< (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1) (not |c_ULTIMATE.start_test_fun_#t~short7#1|)))) is different from false [2023-11-06 23:08:39,290 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_276 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_276) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647)) (forall ((v_ArrVal_272 (Array Int Int)) (v_ArrVal_274 Int) (v_ArrVal_276 (Array Int Int)) (v_ArrVal_275 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_272) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_274)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_276) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_274))))) is different from false [2023-11-06 23:08:39,347 WARN L839 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_test_fun_#t~mem10#1| 2147483646) (forall ((v_ArrVal_274 Int) (v_ArrVal_276 (Array Int Int)) (v_ArrVal_275 (Array Int Int))) (or (< (+ |c_ULTIMATE.start_test_fun_#t~mem10#1| 1) v_ArrVal_274) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_274)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_276) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647)))) is different from false [2023-11-06 23:08:39,596 WARN L839 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_272 (Array Int Int)) (v_ArrVal_260 (Array Int Int)) (v_ArrVal_271 (Array Int Int)) (v_ArrVal_263 (Array Int Int)) (v_ArrVal_276 (Array Int Int)) (v_ArrVal_264 (Array Int Int)) (v_ArrVal_275 (Array Int Int)) (v_ArrVal_267 (Array Int Int)) (v_ArrVal_268 (Array Int Int)) (v_ArrVal_269 Int) (v_ArrVal_259 (Array Int Int)) (v_ArrVal_266 Int) (v_ArrVal_274 Int) (v_ArrVal_261 Int)) (let ((.cse2 (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_259) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_260) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse3 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_261)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_263) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_264) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse1 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_266)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_267) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_268) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_269)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_271) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_272) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_274)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_276) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_269) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_261) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_266) (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_274))))))) (not |c_ULTIMATE.start_test_fun_#t~short7#1|)) (forall ((v_ArrVal_269 Int) (v_ArrVal_266 Int) (v_ArrVal_272 (Array Int Int)) (v_ArrVal_274 Int) (v_ArrVal_271 (Array Int Int)) (v_ArrVal_263 (Array Int Int)) (v_ArrVal_276 (Array Int Int)) (v_ArrVal_264 (Array Int Int)) (v_ArrVal_275 (Array Int Int)) (v_ArrVal_267 (Array Int Int)) (v_ArrVal_268 (Array Int Int))) (let ((.cse5 (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_263) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_264) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse6 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_266)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_267) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_268) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse4 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_269)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_271) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_272) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_274) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_274)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_276) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_266) (< (+ (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_269))))))) is different from false [2023-11-06 23:08:49,433 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 23:08:51,517 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 23:08:54,002 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 23:08:56,111 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 23:08:58,610 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.50s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 23:08:59,996 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 23:09:01,998 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 23:09:04,491 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.49s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 23:09:04,525 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_272 (Array Int Int)) (v_ArrVal_260 (Array Int Int)) (v_ArrVal_271 (Array Int Int)) (v_ArrVal_263 (Array Int Int)) (v_ArrVal_276 (Array Int Int)) (v_ArrVal_264 (Array Int Int)) (v_ArrVal_275 (Array Int Int)) (v_ArrVal_267 (Array Int Int)) (v_ArrVal_268 (Array Int Int)) (v_ArrVal_269 Int) (v_ArrVal_266 Int) (v_ArrVal_274 Int) (v_ArrVal_261 Int)) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_260) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse3 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_261)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_263) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_264) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse1 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_266)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_267) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_268) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_269)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_271) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_272) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_274)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_276) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_269) (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_274) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_261) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_266))))))) (forall ((v_ArrVal_269 Int) (v_ArrVal_266 Int) (v_ArrVal_272 (Array Int Int)) (v_ArrVal_274 Int) (v_ArrVal_271 (Array Int Int)) (v_ArrVal_276 (Array Int Int)) (v_ArrVal_264 (Array Int Int)) (v_ArrVal_275 (Array Int Int)) (v_ArrVal_267 (Array Int Int)) (v_ArrVal_268 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_264) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse4 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_266)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_267) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_268) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse6 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_269)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_271) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_272) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_269) (< (+ (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_266) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_274)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_276) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_274)))))) (forall ((v_ArrVal_276 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_276) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))) is different from false [2023-11-06 23:09:23,049 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 23:09:24,554 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 23:09:26,556 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 23:09:29,749 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 23:09:29,798 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_272 (Array Int Int)) (v_ArrVal_274 Int) (v_ArrVal_271 (Array Int Int)) (v_ArrVal_276 (Array Int Int)) (v_ArrVal_275 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_271) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_272) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_274)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_276) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_274)))) (forall ((v_ArrVal_269 Int) (v_ArrVal_272 (Array Int Int)) (v_ArrVal_274 Int) (v_ArrVal_271 (Array Int Int)) (v_ArrVal_276 (Array Int Int)) (v_ArrVal_275 (Array Int Int)) (v_ArrVal_267 (Array Int Int)) (v_ArrVal_268 (Array Int Int))) (let ((.cse2 (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_267) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_268) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse1 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_269)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_271) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_272) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_274)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_276) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_269) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_274)))))) is different from false [2023-11-06 23:09:31,824 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 23:09:40,838 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_272 (Array Int Int)) (v_ArrVal_274 Int) (v_ArrVal_271 (Array Int Int)) (v_ArrVal_276 (Array Int Int)) (v_ArrVal_275 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_271) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_272) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_274)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_276) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_274)))) (forall ((v_ArrVal_269 Int) (v_ArrVal_272 (Array Int Int)) (v_ArrVal_274 Int) (v_ArrVal_271 (Array Int Int)) (v_ArrVal_276 (Array Int Int)) (v_ArrVal_275 (Array Int Int)) (v_ArrVal_267 (Array Int Int)) (v_ArrVal_268 (Array Int Int))) (let ((.cse2 (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_267) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_268) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse1 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_269)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_271) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_272) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_274)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_276) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_269) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_274))))) (forall ((v_ArrVal_276 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_276) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647)) (forall ((v_ArrVal_269 Int) (v_ArrVal_266 Int) (v_ArrVal_272 (Array Int Int)) (v_ArrVal_274 Int) (v_ArrVal_271 (Array Int Int)) (v_ArrVal_263 (Array Int Int)) (v_ArrVal_276 (Array Int Int)) (v_ArrVal_264 (Array Int Int)) (v_ArrVal_275 (Array Int Int)) (v_ArrVal_267 (Array Int Int)) (v_ArrVal_268 (Array Int Int))) (let ((.cse4 (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_263) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_264) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse5 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_266)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_267) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_268) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse3 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_269)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_271) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_272) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_274) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_274)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_276) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_266) (< (+ (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_269))))))) is different from false [2023-11-06 23:10:03,107 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_272 (Array Int Int)) (v_ArrVal_260 (Array Int Int)) (v_ArrVal_271 (Array Int Int)) (v_ArrVal_263 (Array Int Int)) (v_ArrVal_276 (Array Int Int)) (v_ArrVal_264 (Array Int Int)) (v_ArrVal_275 (Array Int Int)) (v_ArrVal_267 (Array Int Int)) (v_ArrVal_268 (Array Int Int)) (v_ArrVal_269 Int) (v_ArrVal_259 (Array Int Int)) (v_ArrVal_266 Int) (v_ArrVal_274 Int) (v_ArrVal_261 Int)) (let ((.cse8 (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_259) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_260) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse9 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_261)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_263) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_264) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse7 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_266)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_267) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_268) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse6 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_269)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_271) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_272) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_274)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_276) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_269) (< (+ (select .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_261) (< (+ (select .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_266) (< (+ (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_274))))))))) (and .cse0 (or .cse0 (not |c_ULTIMATE.start_test_fun_#t~short7#1|)) (forall ((v_ArrVal_269 Int) (v_ArrVal_272 (Array Int Int)) (v_ArrVal_274 Int) (v_ArrVal_271 (Array Int Int)) (v_ArrVal_276 (Array Int Int)) (v_ArrVal_275 (Array Int Int)) (v_ArrVal_267 (Array Int Int)) (v_ArrVal_268 (Array Int Int))) (let ((.cse2 (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_267) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_268) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse1 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_269)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_271) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_272) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_274)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_276) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_269) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_274))))) (forall ((v_ArrVal_276 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_276) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647)) (or .cse0 (< (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 1) (< (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1)) (forall ((v_ArrVal_269 Int) (v_ArrVal_266 Int) (v_ArrVal_272 (Array Int Int)) (v_ArrVal_274 Int) (v_ArrVal_271 (Array Int Int)) (v_ArrVal_263 (Array Int Int)) (v_ArrVal_276 (Array Int Int)) (v_ArrVal_264 (Array Int Int)) (v_ArrVal_275 (Array Int Int)) (v_ArrVal_267 (Array Int Int)) (v_ArrVal_268 (Array Int Int))) (let ((.cse4 (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_263) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_264) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse5 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_266)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_267) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_268) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse3 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_269)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_271) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_272) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_274) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_274)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_276) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_266) (< (+ (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_269)))))))) is different from false [2023-11-06 23:10:48,162 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_272 (Array Int Int)) (v_ArrVal_260 (Array Int Int)) (v_ArrVal_271 (Array Int Int)) (v_ArrVal_263 (Array Int Int)) (v_ArrVal_276 (Array Int Int)) (v_ArrVal_264 (Array Int Int)) (v_ArrVal_275 (Array Int Int)) (v_ArrVal_267 (Array Int Int)) (v_ArrVal_268 (Array Int Int)) (v_ArrVal_269 Int) (v_ArrVal_266 Int) (v_ArrVal_274 Int) (v_ArrVal_261 Int)) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_260) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse3 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_261)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_263) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_264) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse1 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_266)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_267) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_268) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_269)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_271) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_272) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_274)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_276) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_269) (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_274) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_261) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_266))))))) (forall ((v_ArrVal_269 Int) (v_ArrVal_272 (Array Int Int)) (v_ArrVal_274 Int) (v_ArrVal_271 (Array Int Int)) (v_ArrVal_276 (Array Int Int)) (v_ArrVal_275 (Array Int Int)) (v_ArrVal_268 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_268) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse4 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_269)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_271) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_272) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_274) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_274)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_276) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_269)))))) is different from false [2023-11-06 23:10:48,253 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_269 Int) (v_ArrVal_272 (Array Int Int)) (v_ArrVal_274 Int) (v_ArrVal_271 (Array Int Int)) (v_ArrVal_276 (Array Int Int)) (v_ArrVal_275 (Array Int Int)) (v_ArrVal_268 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_268) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_269)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_271) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_272) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_274) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_274)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_276) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_269))))) (forall ((v_ArrVal_269 Int) (v_ArrVal_266 Int) (v_ArrVal_272 (Array Int Int)) (v_ArrVal_274 Int) (v_ArrVal_271 (Array Int Int)) (v_ArrVal_276 (Array Int Int)) (v_ArrVal_264 (Array Int Int)) (v_ArrVal_275 (Array Int Int)) (v_ArrVal_267 (Array Int Int)) (v_ArrVal_268 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_264) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse2 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_266)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_267) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_268) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse4 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_269)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_271) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_272) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_269) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_266) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_274)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_276) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_274)))))) (forall ((v_ArrVal_272 (Array Int Int)) (v_ArrVal_274 Int) (v_ArrVal_276 (Array Int Int)) (v_ArrVal_275 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_272) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_274)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_276) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_274))))) is different from false [2023-11-06 23:10:48,478 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_test_fun_#t~mem10#1| 1)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (and (forall ((v_ArrVal_269 Int) (v_ArrVal_272 (Array Int Int)) (v_ArrVal_274 Int) (v_ArrVal_271 (Array Int Int)) (v_ArrVal_276 (Array Int Int)) (v_ArrVal_275 (Array Int Int))) (let ((.cse1 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_269)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_271) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_272) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< .cse0 v_ArrVal_269) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_274) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_274)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_276) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647)))) (forall ((v_ArrVal_274 Int) (v_ArrVal_276 (Array Int Int)) (v_ArrVal_275 (Array Int Int))) (or (< .cse0 v_ArrVal_274) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_274)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_276) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))))) is different from false [2023-11-06 23:10:48,486 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_test_fun_#t~mem10#1| 1)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (and (forall ((v_ArrVal_269 Int) (v_ArrVal_272 (Array Int Int)) (v_ArrVal_274 Int) (v_ArrVal_271 (Array Int Int)) (v_ArrVal_276 (Array Int Int)) (v_ArrVal_275 (Array Int Int))) (let ((.cse1 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_269)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_271) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_272) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< .cse0 v_ArrVal_269) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_274) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_274)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_276) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647)))) (forall ((v_ArrVal_272 (Array Int Int)) (v_ArrVal_271 (Array Int Int)) (v_ArrVal_263 (Array Int Int)) (v_ArrVal_276 (Array Int Int)) (v_ArrVal_264 (Array Int Int)) (v_ArrVal_275 (Array Int Int)) (v_ArrVal_267 (Array Int Int)) (v_ArrVal_268 (Array Int Int)) (v_ArrVal_269 Int) (v_ArrVal_266 Int) (v_ArrVal_274 Int) (v_ArrVal_261 Int)) (let ((.cse5 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_261)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_263) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_264) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse4 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_266)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_267) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_268) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse3 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_269)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_271) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_272) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_274) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_274)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_276) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_269) (< .cse0 v_ArrVal_261) (< (+ (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_266)))))))) is different from false [2023-11-06 23:10:51,833 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_272 (Array Int Int)) (v_ArrVal_274 Int) (v_ArrVal_271 (Array Int Int)) (v_ArrVal_276 (Array Int Int)) (v_ArrVal_275 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_271) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_272) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_274)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_276) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_274)))) (forall ((v_ArrVal_269 Int) (v_ArrVal_266 Int) (v_ArrVal_272 (Array Int Int)) (v_ArrVal_274 Int) (v_ArrVal_271 (Array Int Int)) (v_ArrVal_263 (Array Int Int)) (v_ArrVal_276 (Array Int Int)) (v_ArrVal_264 (Array Int Int)) (v_ArrVal_275 (Array Int Int)) (v_ArrVal_267 (Array Int Int)) (v_ArrVal_268 (Array Int Int))) (let ((.cse2 (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_263) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_264) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse3 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_266)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_267) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_268) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse1 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_269)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_271) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_272) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_274) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_274)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_276) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_266) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_269))))))) is different from false [2023-11-06 23:10:51,907 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_269 Int) (v_ArrVal_266 Int) (v_ArrVal_272 (Array Int Int)) (v_ArrVal_274 Int) (v_ArrVal_271 (Array Int Int)) (v_ArrVal_276 (Array Int Int)) (v_ArrVal_264 (Array Int Int)) (v_ArrVal_275 (Array Int Int)) (v_ArrVal_267 (Array Int Int)) (v_ArrVal_268 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_264) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_266)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_267) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_268) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse2 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_269)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_271) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_272) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_269) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_266) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_274)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_276) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_274)))))) (forall ((v_ArrVal_272 (Array Int Int)) (v_ArrVal_274 Int) (v_ArrVal_276 (Array Int Int)) (v_ArrVal_275 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_272) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_274)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_276) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_274))))) is different from false [2023-11-06 23:11:13,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:11:13,739 INFO L93 Difference]: Finished difference Result 237 states and 263 transitions. [2023-11-06 23:11:13,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2023-11-06 23:11:13,740 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 2.9782608695652173) internal successors, (137), 47 states have internal predecessors, (137), 0 states have call successors, (0), 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 47 [2023-11-06 23:11:13,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:11:13,743 INFO L225 Difference]: With dead ends: 237 [2023-11-06 23:11:13,743 INFO L226 Difference]: Without dead ends: 236 [2023-11-06 23:11:13,749 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 65 SyntacticMatches, 12 SemanticMatches, 103 ConstructedPredicates, 30 IntricatePredicates, 0 DeprecatedPredicates, 2063 ImplicationChecksByTransitivity, 183.2s TimeCoverageRelationStatistics Valid=1350, Invalid=3339, Unknown=981, NotChecked=5250, Total=10920 [2023-11-06 23:11:13,750 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 80 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 47 mSolverCounterUnsat, 482 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 59.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 4026 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 482 IncrementalHoareTripleChecker+Unknown, 3157 IncrementalHoareTripleChecker+Unchecked, 63.5s IncrementalHoareTripleChecker+Time [2023-11-06 23:11:13,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 162 Invalid, 4026 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 340 Invalid, 482 Unknown, 3157 Unchecked, 63.5s Time] [2023-11-06 23:11:13,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2023-11-06 23:11:13,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 145. [2023-11-06 23:11:13,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 1.1180555555555556) internal successors, (161), 144 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:11:13,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 161 transitions. [2023-11-06 23:11:13,774 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 161 transitions. Word has length 47 [2023-11-06 23:11:13,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:11:13,775 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 161 transitions. [2023-11-06 23:11:13,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 2.9782608695652173) internal successors, (137), 47 states have internal predecessors, (137), 0 states have call successors, (0), 0 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 23:11:13,775 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 161 transitions. [2023-11-06 23:11:13,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-11-06 23:11:13,779 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:11:13,779 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 1, 1, 1, 1] [2023-11-06 23:11:13,790 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f560ba7-7e18-48f1-8345-1c79b88c9b28/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-06 23:11:13,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f560ba7-7e18-48f1-8345-1c79b88c9b28/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:11:13,991 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-06 23:11:13,991 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:11:13,991 INFO L85 PathProgramCache]: Analyzing trace with hash -438369696, now seen corresponding path program 1 times [2023-11-06 23:11:13,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:11:13,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966431395] [2023-11-06 23:11:13,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:11:13,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:11:14,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:11:14,097 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2023-11-06 23:11:14,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:11:14,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966431395] [2023-11-06 23:11:14,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966431395] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:11:14,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:11:14,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:11:14,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258009841] [2023-11-06 23:11:14,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:11:14,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:11:14,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:11:14,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:11:14,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:11:14,101 INFO L87 Difference]: Start difference. First operand 145 states and 161 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 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 23:11:14,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:11:14,118 INFO L93 Difference]: Finished difference Result 250 states and 276 transitions. [2023-11-06 23:11:14,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:11:14,119 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 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) Word has length 92 [2023-11-06 23:11:14,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:11:14,125 INFO L225 Difference]: With dead ends: 250 [2023-11-06 23:11:14,126 INFO L226 Difference]: Without dead ends: 102 [2023-11-06 23:11:14,127 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:11:14,129 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 23:11:14,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 21 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 23:11:14,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-11-06 23:11:14,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2023-11-06 23:11:14,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 101 states have (on average 1.00990099009901) internal successors, (102), 101 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:11:14,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2023-11-06 23:11:14,160 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 92 [2023-11-06 23:11:14,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:11:14,163 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2023-11-06 23:11:14,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 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 23:11:14,163 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2023-11-06 23:11:14,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-11-06 23:11:14,169 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:11:14,169 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 10, 1, 1, 1] [2023-11-06 23:11:14,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 23:11:14,170 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-06 23:11:14,170 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:11:14,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1841115375, now seen corresponding path program 3 times [2023-11-06 23:11:14,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:11:14,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899788868] [2023-11-06 23:11:14,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:11:14,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:11:14,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat