/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/reducercommutativity/avg20-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-d966a43 [2022-01-31 18:27:10,001 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-31 18:27:10,002 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-31 18:27:10,066 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-31 18:27:10,067 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-31 18:27:10,068 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-31 18:27:10,069 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-31 18:27:10,070 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-31 18:27:10,071 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-31 18:27:10,072 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-31 18:27:10,073 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-31 18:27:10,073 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-31 18:27:10,074 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-31 18:27:10,074 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-31 18:27:10,078 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-31 18:27:10,080 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-31 18:27:10,081 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-31 18:27:10,084 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-31 18:27:10,089 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-31 18:27:10,094 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-31 18:27:10,095 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-31 18:27:10,098 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-31 18:27:10,098 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-31 18:27:10,099 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-31 18:27:10,100 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-31 18:27:10,100 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-31 18:27:10,101 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-31 18:27:10,101 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-31 18:27:10,101 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-31 18:27:10,102 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-31 18:27:10,102 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-31 18:27:10,102 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-31 18:27:10,103 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-31 18:27:10,103 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-31 18:27:10,104 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-31 18:27:10,104 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-31 18:27:10,105 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-31 18:27:10,105 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-31 18:27:10,105 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-31 18:27:10,106 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-31 18:27:10,106 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-31 18:27:10,111 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-01-31 18:27:10,121 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-31 18:27:10,121 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-31 18:27:10,122 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-31 18:27:10,122 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-31 18:27:10,122 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-31 18:27:10,122 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-31 18:27:10,123 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-31 18:27:10,123 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-31 18:27:10,123 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-31 18:27:10,123 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-31 18:27:10,123 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-31 18:27:10,123 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-31 18:27:10,124 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-31 18:27:10,124 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-31 18:27:10,124 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-31 18:27:10,124 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-31 18:27:10,124 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-31 18:27:10,124 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-31 18:27:10,124 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 18:27:10,124 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-31 18:27:10,124 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2022-01-31 18:27:10,124 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-31 18:27:10,124 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-01-31 18:27:10,125 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-31 18:27:10,323 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-31 18:27:10,342 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-31 18:27:10,344 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-31 18:27:10,345 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-31 18:27:10,345 INFO L275 PluginConnector]: CDTParser initialized [2022-01-31 18:27:10,346 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/reducercommutativity/avg20-2.i [2022-01-31 18:27:10,395 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d28167c8/4d746196eb6c455b9a5dca4ab1b175a4/FLAG8a5a3b6b1 [2022-01-31 18:27:10,761 INFO L306 CDTParser]: Found 1 translation units. [2022-01-31 18:27:10,761 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/reducercommutativity/avg20-2.i [2022-01-31 18:27:10,765 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d28167c8/4d746196eb6c455b9a5dca4ab1b175a4/FLAG8a5a3b6b1 [2022-01-31 18:27:10,773 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d28167c8/4d746196eb6c455b9a5dca4ab1b175a4 [2022-01-31 18:27:10,784 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-31 18:27:10,784 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-01-31 18:27:10,788 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-31 18:27:10,788 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-31 18:27:10,791 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-31 18:27:10,791 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 06:27:10" (1/1) ... [2022-01-31 18:27:10,792 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18cd9206 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 06:27:10, skipping insertion in model container [2022-01-31 18:27:10,792 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 06:27:10" (1/1) ... [2022-01-31 18:27:10,798 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-31 18:27:10,807 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-31 18:27:10,986 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/reducercommutativity/avg20-2.i[1282,1295] [2022-01-31 18:27:10,989 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 18:27:11,009 INFO L203 MainTranslator]: Completed pre-run [2022-01-31 18:27:11,026 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/reducercommutativity/avg20-2.i[1282,1295] [2022-01-31 18:27:11,027 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 18:27:11,036 INFO L208 MainTranslator]: Completed translation [2022-01-31 18:27:11,037 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 06:27:11 WrapperNode [2022-01-31 18:27:11,037 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-31 18:27:11,038 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-31 18:27:11,038 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-31 18:27:11,038 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-31 18:27:11,045 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 06:27:11" (1/1) ... [2022-01-31 18:27:11,045 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 06:27:11" (1/1) ... [2022-01-31 18:27:11,050 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 06:27:11" (1/1) ... [2022-01-31 18:27:11,050 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 06:27:11" (1/1) ... [2022-01-31 18:27:11,055 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 06:27:11" (1/1) ... [2022-01-31 18:27:11,057 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 06:27:11" (1/1) ... [2022-01-31 18:27:11,058 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 06:27:11" (1/1) ... [2022-01-31 18:27:11,059 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-31 18:27:11,060 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-31 18:27:11,060 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-31 18:27:11,060 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-31 18:27:11,061 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 06:27:11" (1/1) ... [2022-01-31 18:27:11,065 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 18:27:11,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 18:27:11,081 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-31 18:27:11,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-31 18:27:11,114 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-31 18:27:11,114 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-31 18:27:11,114 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-31 18:27:11,114 INFO L138 BoogieDeclarations]: Found implementation of procedure avg [2022-01-31 18:27:11,115 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-31 18:27:11,115 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-31 18:27:11,115 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-31 18:27:11,115 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-01-31 18:27:11,116 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-01-31 18:27:11,116 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-31 18:27:11,116 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-31 18:27:11,116 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-01-31 18:27:11,116 INFO L130 BoogieDeclarations]: Found specification of procedure avg [2022-01-31 18:27:11,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-31 18:27:11,117 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-31 18:27:11,118 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-31 18:27:11,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-31 18:27:11,118 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-31 18:27:11,118 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-31 18:27:11,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-31 18:27:11,118 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-31 18:27:11,183 INFO L234 CfgBuilder]: Building ICFG [2022-01-31 18:27:11,184 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-31 18:27:11,316 INFO L275 CfgBuilder]: Performing block encoding [2022-01-31 18:27:11,320 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-31 18:27:11,320 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-01-31 18:27:11,321 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 06:27:11 BoogieIcfgContainer [2022-01-31 18:27:11,335 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-31 18:27:11,336 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-31 18:27:11,336 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-31 18:27:11,338 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-31 18:27:11,338 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 06:27:10" (1/3) ... [2022-01-31 18:27:11,339 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55cd02a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 06:27:11, skipping insertion in model container [2022-01-31 18:27:11,339 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 06:27:11" (2/3) ... [2022-01-31 18:27:11,339 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55cd02a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 06:27:11, skipping insertion in model container [2022-01-31 18:27:11,339 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 06:27:11" (3/3) ... [2022-01-31 18:27:11,340 INFO L111 eAbstractionObserver]: Analyzing ICFG avg20-2.i [2022-01-31 18:27:11,343 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-01-31 18:27:11,343 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-31 18:27:11,399 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-31 18:27:11,404 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=AcceleratedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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, mLoopAccelerationTechnique=JORDAN [2022-01-31 18:27:11,404 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-31 18:27:11,419 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 21 states have (on average 1.380952380952381) internal successors, (29), 22 states have internal predecessors, (29), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-01-31 18:27:11,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-01-31 18:27:11,425 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:27:11,425 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 18:27:11,426 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:27:11,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:27:11,433 INFO L85 PathProgramCache]: Analyzing trace with hash -56143050, now seen corresponding path program 1 times [2022-01-31 18:27:11,439 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:27:11,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [601097485] [2022-01-31 18:27:11,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:27:11,450 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:27:11,491 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:27:11,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:11,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:27:11,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:11,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 18:27:11,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:11,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-01-31 18:27:11,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:11,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 18:27:11,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:11,649 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-01-31 18:27:11,650 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:27:11,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [601097485] [2022-01-31 18:27:11,651 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [601097485] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:27:11,651 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:27:11,651 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-31 18:27:11,652 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170097232] [2022-01-31 18:27:11,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:27:11,655 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-31 18:27:11,656 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:27:11,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-31 18:27:11,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-31 18:27:11,677 INFO L87 Difference]: Start difference. First operand has 31 states, 21 states have (on average 1.380952380952381) internal successors, (29), 22 states have internal predecessors, (29), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:11,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:27:11,719 INFO L93 Difference]: Finished difference Result 54 states and 71 transitions. [2022-01-31 18:27:11,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-31 18:27:11,736 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 32 [2022-01-31 18:27:11,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:27:11,741 INFO L225 Difference]: With dead ends: 54 [2022-01-31 18:27:11,741 INFO L226 Difference]: Without dead ends: 26 [2022-01-31 18:27:11,742 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-31 18:27:11,753 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 22 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 18:27:11,753 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 35 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 18:27:11,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-01-31 18:27:11,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-01-31 18:27:11,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 18:27:11,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2022-01-31 18:27:11,777 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 32 [2022-01-31 18:27:11,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:27:11,777 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2022-01-31 18:27:11,777 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:11,778 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-01-31 18:27:11,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-01-31 18:27:11,779 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:27:11,779 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 18:27:11,779 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-31 18:27:11,779 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:27:11,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:27:11,780 INFO L85 PathProgramCache]: Analyzing trace with hash 809042352, now seen corresponding path program 1 times [2022-01-31 18:27:11,780 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:27:11,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1457971646] [2022-01-31 18:27:11,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:27:11,781 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:27:11,782 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:27:11,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:11,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:27:11,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:11,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 18:27:11,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:11,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-01-31 18:27:11,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:11,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 18:27:11,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:11,850 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-01-31 18:27:11,851 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:27:11,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1457971646] [2022-01-31 18:27:11,851 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1457971646] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:27:11,851 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:27:11,851 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 18:27:11,851 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76309292] [2022-01-31 18:27:11,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:27:11,852 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 18:27:11,852 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:27:11,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 18:27:11,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 18:27:11,853 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:11,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:27:11,914 INFO L93 Difference]: Finished difference Result 48 states and 60 transitions. [2022-01-31 18:27:11,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 18:27:11,914 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 32 [2022-01-31 18:27:11,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:27:11,915 INFO L225 Difference]: With dead ends: 48 [2022-01-31 18:27:11,915 INFO L226 Difference]: Without dead ends: 30 [2022-01-31 18:27:11,916 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-01-31 18:27:11,916 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 23 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 18:27:11,917 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 35 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 18:27:11,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-01-31 18:27:11,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2022-01-31 18:27:11,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 18:27:11,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-01-31 18:27:11,933 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 32 [2022-01-31 18:27:11,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:27:11,933 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-01-31 18:27:11,933 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:11,933 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-01-31 18:27:11,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-01-31 18:27:11,934 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:27:11,934 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 18:27:11,934 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-31 18:27:11,935 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:27:11,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:27:11,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1356290064, now seen corresponding path program 1 times [2022-01-31 18:27:11,935 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:27:11,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1304612736] [2022-01-31 18:27:11,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:27:11,945 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 18:27:11,946 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:27:11,946 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:27:11,947 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:27:11,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:11,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:27:11,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:11,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 18:27:11,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:11,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 18:27:11,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:12,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-01-31 18:27:12,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:12,008 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-01-31 18:27:12,008 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:27:12,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1304612736] [2022-01-31 18:27:12,008 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1304612736] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:27:12,008 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:27:12,009 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 18:27:12,009 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528521694] [2022-01-31 18:27:12,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:27:12,009 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 18:27:12,009 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:27:12,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 18:27:12,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-31 18:27:12,010 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:12,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:27:12,113 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2022-01-31 18:27:12,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 18:27:12,113 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 40 [2022-01-31 18:27:12,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:27:12,114 INFO L225 Difference]: With dead ends: 50 [2022-01-31 18:27:12,114 INFO L226 Difference]: Without dead ends: 31 [2022-01-31 18:27:12,114 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-01-31 18:27:12,115 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 23 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 18:27:12,116 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 37 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 18:27:12,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-01-31 18:27:12,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2022-01-31 18:27:12,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 18:27:12,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2022-01-31 18:27:12,120 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 40 [2022-01-31 18:27:12,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:27:12,120 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2022-01-31 18:27:12,121 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:12,121 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-01-31 18:27:12,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-01-31 18:27:12,121 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:27:12,121 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 18:27:12,122 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-31 18:27:12,122 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:27:12,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:27:12,122 INFO L85 PathProgramCache]: Analyzing trace with hash 232330066, now seen corresponding path program 2 times [2022-01-31 18:27:12,122 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:27:12,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [342110060] [2022-01-31 18:27:12,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:27:12,124 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 18:27:12,125 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:27:12,125 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:27:12,126 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:27:12,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:12,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:27:12,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:12,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-31 18:27:12,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:12,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-31 18:27:12,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:12,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-01-31 18:27:12,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:12,260 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-31 18:27:12,260 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:27:12,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [342110060] [2022-01-31 18:27:12,261 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [342110060] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:27:12,261 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:27:12,261 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 18:27:12,261 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080224095] [2022-01-31 18:27:12,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:27:12,263 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 18:27:12,263 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:27:12,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 18:27:12,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-31 18:27:12,264 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:12,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:27:12,338 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2022-01-31 18:27:12,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 18:27:12,339 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 42 [2022-01-31 18:27:12,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:27:12,341 INFO L225 Difference]: With dead ends: 51 [2022-01-31 18:27:12,341 INFO L226 Difference]: Without dead ends: 33 [2022-01-31 18:27:12,342 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-01-31 18:27:12,350 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 23 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 18:27:12,351 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 37 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 18:27:12,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-01-31 18:27:12,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2022-01-31 18:27:12,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 18:27:12,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2022-01-31 18:27:12,359 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 42 [2022-01-31 18:27:12,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:27:12,360 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2022-01-31 18:27:12,360 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:12,360 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-01-31 18:27:12,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-01-31 18:27:12,364 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:27:12,365 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 18:27:12,365 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-31 18:27:12,365 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:27:12,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:27:12,365 INFO L85 PathProgramCache]: Analyzing trace with hash 541580336, now seen corresponding path program 3 times [2022-01-31 18:27:12,365 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:27:12,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [749853337] [2022-01-31 18:27:12,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:27:12,373 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 18:27:12,373 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:27:12,373 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:27:12,374 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:27:12,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:12,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:27:12,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:12,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-31 18:27:12,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:12,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-01-31 18:27:12,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:12,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-31 18:27:12,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:12,483 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-01-31 18:27:12,483 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:27:12,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [749853337] [2022-01-31 18:27:12,483 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [749853337] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:27:12,483 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:27:12,484 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-31 18:27:12,484 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135346200] [2022-01-31 18:27:12,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:27:12,484 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-31 18:27:12,484 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:27:12,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-31 18:27:12,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-31 18:27:12,485 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:12,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:27:12,536 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2022-01-31 18:27:12,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-31 18:27:12,536 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 48 [2022-01-31 18:27:12,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:27:12,539 INFO L225 Difference]: With dead ends: 49 [2022-01-31 18:27:12,539 INFO L226 Difference]: Without dead ends: 34 [2022-01-31 18:27:12,539 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-31 18:27:12,543 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 21 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 18:27:12,544 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 32 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 18:27:12,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-01-31 18:27:12,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2022-01-31 18:27:12,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 18:27:12,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2022-01-31 18:27:12,580 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 48 [2022-01-31 18:27:12,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:27:12,582 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2022-01-31 18:27:12,582 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:12,582 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2022-01-31 18:27:12,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-01-31 18:27:12,586 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:27:12,586 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 18:27:12,586 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-31 18:27:12,586 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:27:12,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:27:12,587 INFO L85 PathProgramCache]: Analyzing trace with hash 831812782, now seen corresponding path program 1 times [2022-01-31 18:27:12,587 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:27:12,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [39323379] [2022-01-31 18:27:12,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:27:12,589 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 18:27:12,589 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:27:12,589 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:27:12,590 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:27:12,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:12,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:27:12,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:12,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-31 18:27:12,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:12,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-01-31 18:27:12,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:12,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-01-31 18:27:12,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:12,683 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-01-31 18:27:12,683 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:27:12,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [39323379] [2022-01-31 18:27:12,684 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [39323379] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:27:12,684 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:27:12,684 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 18:27:12,684 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601998011] [2022-01-31 18:27:12,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:27:12,684 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 18:27:12,684 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:27:12,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 18:27:12,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-31 18:27:12,685 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:12,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:27:12,728 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2022-01-31 18:27:12,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 18:27:12,729 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 50 [2022-01-31 18:27:12,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:27:12,729 INFO L225 Difference]: With dead ends: 51 [2022-01-31 18:27:12,729 INFO L226 Difference]: Without dead ends: 36 [2022-01-31 18:27:12,730 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-01-31 18:27:12,730 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 23 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 18:27:12,730 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 32 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 18:27:12,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-01-31 18:27:12,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2022-01-31 18:27:12,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 18:27:12,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2022-01-31 18:27:12,735 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 50 [2022-01-31 18:27:12,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:27:12,735 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2022-01-31 18:27:12,735 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:12,735 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-01-31 18:27:12,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-01-31 18:27:12,736 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:27:12,736 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 18:27:12,736 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-31 18:27:12,736 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:27:12,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:27:12,737 INFO L85 PathProgramCache]: Analyzing trace with hash 572319148, now seen corresponding path program 2 times [2022-01-31 18:27:12,737 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:27:12,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [102366613] [2022-01-31 18:27:12,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:27:12,738 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 18:27:12,739 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:27:12,739 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:27:12,740 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:27:12,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:12,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:27:12,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:12,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-31 18:27:12,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:12,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-01-31 18:27:12,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:12,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-31 18:27:12,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:12,791 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-01-31 18:27:12,792 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:27:12,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [102366613] [2022-01-31 18:27:12,792 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [102366613] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:27:12,792 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:27:12,792 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 18:27:12,792 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120225469] [2022-01-31 18:27:12,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:27:12,793 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 18:27:12,793 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:27:12,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 18:27:12,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-31 18:27:12,793 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:12,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:27:12,845 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2022-01-31 18:27:12,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 18:27:12,846 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 52 [2022-01-31 18:27:12,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:27:12,846 INFO L225 Difference]: With dead ends: 62 [2022-01-31 18:27:12,846 INFO L226 Difference]: Without dead ends: 38 [2022-01-31 18:27:12,846 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-01-31 18:27:12,847 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 25 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 18:27:12,847 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 32 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 18:27:12,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-01-31 18:27:12,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2022-01-31 18:27:12,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 18:27:12,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2022-01-31 18:27:12,851 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 52 [2022-01-31 18:27:12,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:27:12,851 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2022-01-31 18:27:12,852 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:12,852 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2022-01-31 18:27:12,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-01-31 18:27:12,852 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:27:12,852 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 18:27:12,852 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-31 18:27:12,853 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:27:12,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:27:12,853 INFO L85 PathProgramCache]: Analyzing trace with hash 179129870, now seen corresponding path program 3 times [2022-01-31 18:27:12,853 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:27:12,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [205302835] [2022-01-31 18:27:12,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:27:12,855 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 18:27:12,855 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:27:12,855 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:27:12,856 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:27:12,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:12,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:27:12,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:12,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 18:27:12,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:12,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-01-31 18:27:12,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:12,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-01-31 18:27:12,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:12,911 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-01-31 18:27:12,911 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:27:12,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [205302835] [2022-01-31 18:27:12,911 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [205302835] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:27:12,911 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:27:12,911 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-31 18:27:12,911 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346274403] [2022-01-31 18:27:12,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:27:12,912 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 18:27:12,912 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:27:12,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 18:27:12,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-31 18:27:12,912 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:12,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:27:12,987 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2022-01-31 18:27:12,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-31 18:27:12,988 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 54 [2022-01-31 18:27:12,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:27:12,988 INFO L225 Difference]: With dead ends: 64 [2022-01-31 18:27:12,988 INFO L226 Difference]: Without dead ends: 40 [2022-01-31 18:27:12,989 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2022-01-31 18:27:12,989 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 27 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 18:27:12,989 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 42 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 18:27:12,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-01-31 18:27:12,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2022-01-31 18:27:12,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 31 states have (on average 1.096774193548387) internal successors, (34), 31 states have internal predecessors, (34), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 18:27:12,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2022-01-31 18:27:12,993 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 54 [2022-01-31 18:27:12,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:27:12,993 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2022-01-31 18:27:12,994 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:12,994 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-01-31 18:27:12,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-01-31 18:27:12,994 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:27:12,994 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 18:27:12,994 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-31 18:27:12,994 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:27:12,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:27:12,995 INFO L85 PathProgramCache]: Analyzing trace with hash 281355760, now seen corresponding path program 4 times [2022-01-31 18:27:12,995 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:27:12,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [334211583] [2022-01-31 18:27:12,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:27:12,996 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 18:27:12,996 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:27:12,997 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:27:12,997 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:27:13,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:13,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:27:13,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:13,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-31 18:27:13,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:13,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-01-31 18:27:13,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:13,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-31 18:27:13,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:13,061 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-01-31 18:27:13,062 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:27:13,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [334211583] [2022-01-31 18:27:13,062 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [334211583] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:27:13,062 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:27:13,062 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 18:27:13,062 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83284756] [2022-01-31 18:27:13,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:27:13,062 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 18:27:13,062 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:27:13,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 18:27:13,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-01-31 18:27:13,063 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:13,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:27:13,137 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2022-01-31 18:27:13,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 18:27:13,138 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 56 [2022-01-31 18:27:13,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:27:13,138 INFO L225 Difference]: With dead ends: 66 [2022-01-31 18:27:13,138 INFO L226 Difference]: Without dead ends: 42 [2022-01-31 18:27:13,139 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2022-01-31 18:27:13,139 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 29 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 18:27:13,139 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 37 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 18:27:13,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-01-31 18:27:13,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2022-01-31 18:27:13,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 33 states have internal predecessors, (36), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 18:27:13,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2022-01-31 18:27:13,143 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 56 [2022-01-31 18:27:13,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:27:13,144 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2022-01-31 18:27:13,144 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:13,144 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2022-01-31 18:27:13,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-01-31 18:27:13,144 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:27:13,144 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 18:27:13,144 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-31 18:27:13,145 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:27:13,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:27:13,145 INFO L85 PathProgramCache]: Analyzing trace with hash -263811758, now seen corresponding path program 5 times [2022-01-31 18:27:13,145 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:27:13,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2128847144] [2022-01-31 18:27:13,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:27:13,146 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 18:27:13,147 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:27:13,147 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:27:13,147 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:27:13,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:13,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:27:13,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:13,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-31 18:27:13,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:13,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-01-31 18:27:13,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:13,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-01-31 18:27:13,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:13,219 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-01-31 18:27:13,219 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:27:13,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2128847144] [2022-01-31 18:27:13,220 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [2128847144] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:27:13,220 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:27:13,220 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-31 18:27:13,220 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365268823] [2022-01-31 18:27:13,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:27:13,220 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-31 18:27:13,220 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:27:13,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-31 18:27:13,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-01-31 18:27:13,221 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:13,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:27:13,296 INFO L93 Difference]: Finished difference Result 68 states and 76 transitions. [2022-01-31 18:27:13,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 18:27:13,296 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 58 [2022-01-31 18:27:13,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:27:13,297 INFO L225 Difference]: With dead ends: 68 [2022-01-31 18:27:13,297 INFO L226 Difference]: Without dead ends: 44 [2022-01-31 18:27:13,297 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2022-01-31 18:27:13,298 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 31 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 18:27:13,298 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 32 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 18:27:13,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-01-31 18:27:13,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2022-01-31 18:27:13,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 35 states have internal predecessors, (38), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 18:27:13,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2022-01-31 18:27:13,302 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 58 [2022-01-31 18:27:13,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:27:13,302 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2022-01-31 18:27:13,302 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:13,302 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-01-31 18:27:13,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-01-31 18:27:13,302 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:27:13,302 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 18:27:13,303 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-31 18:27:13,303 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:27:13,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:27:13,303 INFO L85 PathProgramCache]: Analyzing trace with hash -183786444, now seen corresponding path program 6 times [2022-01-31 18:27:13,303 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:27:13,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [511467757] [2022-01-31 18:27:13,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:27:13,304 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 18:27:13,304 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:27:13,305 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:27:13,305 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:27:13,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:13,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:27:13,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:13,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 18:27:13,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:13,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-01-31 18:27:13,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:13,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-31 18:27:13,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:13,372 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-01-31 18:27:13,372 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:27:13,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [511467757] [2022-01-31 18:27:13,372 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [511467757] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:27:13,372 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:27:13,373 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-31 18:27:13,373 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441531135] [2022-01-31 18:27:13,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:27:13,373 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 18:27:13,373 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:27:13,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 18:27:13,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-01-31 18:27:13,373 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:13,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:27:13,488 INFO L93 Difference]: Finished difference Result 70 states and 78 transitions. [2022-01-31 18:27:13,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 18:27:13,488 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 60 [2022-01-31 18:27:13,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:27:13,489 INFO L225 Difference]: With dead ends: 70 [2022-01-31 18:27:13,489 INFO L226 Difference]: Without dead ends: 46 [2022-01-31 18:27:13,491 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=164, Unknown=0, NotChecked=0, Total=272 [2022-01-31 18:27:13,491 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 33 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 18:27:13,491 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 42 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 18:27:13,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-01-31 18:27:13,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2022-01-31 18:27:13,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 37 states have internal predecessors, (40), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 18:27:13,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2022-01-31 18:27:13,505 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 60 [2022-01-31 18:27:13,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:27:13,506 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2022-01-31 18:27:13,506 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:13,506 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2022-01-31 18:27:13,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-01-31 18:27:13,506 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:27:13,506 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 18:27:13,507 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-31 18:27:13,507 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:27:13,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:27:13,507 INFO L85 PathProgramCache]: Analyzing trace with hash -588871018, now seen corresponding path program 7 times [2022-01-31 18:27:13,507 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:27:13,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [702121067] [2022-01-31 18:27:13,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:27:13,509 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 18:27:13,509 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:27:13,509 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:27:13,511 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:27:13,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:13,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:27:13,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:13,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-31 18:27:13,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:13,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-01-31 18:27:13,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:13,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-01-31 18:27:13,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:13,608 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-01-31 18:27:13,609 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:27:13,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [702121067] [2022-01-31 18:27:13,609 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [702121067] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:27:13,609 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:27:13,609 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-31 18:27:13,609 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569333405] [2022-01-31 18:27:13,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:27:13,610 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-31 18:27:13,610 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:27:13,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-31 18:27:13,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2022-01-31 18:27:13,610 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand has 11 states, 11 states have (on average 3.0) internal successors, (33), 10 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:13,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:27:13,745 INFO L93 Difference]: Finished difference Result 72 states and 80 transitions. [2022-01-31 18:27:13,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 18:27:13,745 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 10 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 62 [2022-01-31 18:27:13,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:27:13,746 INFO L225 Difference]: With dead ends: 72 [2022-01-31 18:27:13,746 INFO L226 Difference]: Without dead ends: 48 [2022-01-31 18:27:13,747 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=135, Invalid=207, Unknown=0, NotChecked=0, Total=342 [2022-01-31 18:27:13,747 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 35 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 18:27:13,747 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 52 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 18:27:13,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-01-31 18:27:13,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2022-01-31 18:27:13,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 39 states have internal predecessors, (42), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 18:27:13,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2022-01-31 18:27:13,751 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 62 [2022-01-31 18:27:13,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:27:13,751 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2022-01-31 18:27:13,751 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 10 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:13,751 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-01-31 18:27:13,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-01-31 18:27:13,752 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:27:13,752 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 6, 6, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 18:27:13,752 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-31 18:27:13,752 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:27:13,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:27:13,752 INFO L85 PathProgramCache]: Analyzing trace with hash 966877304, now seen corresponding path program 8 times [2022-01-31 18:27:13,752 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:27:13,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [779051658] [2022-01-31 18:27:13,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:27:13,754 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 18:27:13,754 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:27:13,754 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:27:13,754 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:27:13,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:13,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:27:13,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:13,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 18:27:13,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:13,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-01-31 18:27:13,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:13,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-31 18:27:13,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:13,842 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-01-31 18:27:13,843 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:27:13,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [779051658] [2022-01-31 18:27:13,843 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [779051658] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:27:13,843 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:27:13,843 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 18:27:13,843 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781736269] [2022-01-31 18:27:13,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:27:13,843 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 18:27:13,843 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:27:13,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 18:27:13,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2022-01-31 18:27:13,844 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:13,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:27:13,965 INFO L93 Difference]: Finished difference Result 74 states and 82 transitions. [2022-01-31 18:27:13,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 18:27:13,965 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 64 [2022-01-31 18:27:13,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:27:13,965 INFO L225 Difference]: With dead ends: 74 [2022-01-31 18:27:13,965 INFO L226 Difference]: Without dead ends: 50 [2022-01-31 18:27:13,966 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=165, Invalid=255, Unknown=0, NotChecked=0, Total=420 [2022-01-31 18:27:13,966 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 37 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 18:27:13,966 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 37 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 18:27:13,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-01-31 18:27:13,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2022-01-31 18:27:13,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 41 states have internal predecessors, (44), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 18:27:13,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2022-01-31 18:27:13,970 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 64 [2022-01-31 18:27:13,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:27:13,971 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2022-01-31 18:27:13,971 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:13,971 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2022-01-31 18:27:13,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-31 18:27:13,971 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:27:13,971 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 6, 6, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 18:27:13,971 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-31 18:27:13,971 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:27:13,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:27:13,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1392395738, now seen corresponding path program 9 times [2022-01-31 18:27:13,972 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:27:13,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [796004973] [2022-01-31 18:27:13,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:27:13,973 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 18:27:13,973 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:27:13,973 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:27:13,974 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:27:13,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:14,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:27:14,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:14,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-01-31 18:27:14,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:14,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-01-31 18:27:14,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:14,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-01-31 18:27:14,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:14,063 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-01-31 18:27:14,063 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:27:14,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [796004973] [2022-01-31 18:27:14,064 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [796004973] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:27:14,064 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:27:14,064 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-31 18:27:14,064 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369821639] [2022-01-31 18:27:14,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:27:14,064 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-31 18:27:14,064 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:27:14,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-31 18:27:14,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2022-01-31 18:27:14,065 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 12 states have internal predecessors, (37), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:14,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:27:14,205 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2022-01-31 18:27:14,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 18:27:14,205 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 12 states have internal predecessors, (37), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 66 [2022-01-31 18:27:14,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:27:14,206 INFO L225 Difference]: With dead ends: 76 [2022-01-31 18:27:14,206 INFO L226 Difference]: Without dead ends: 52 [2022-01-31 18:27:14,206 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=198, Invalid=308, Unknown=0, NotChecked=0, Total=506 [2022-01-31 18:27:14,207 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 39 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 18:27:14,207 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 42 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 18:27:14,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-01-31 18:27:14,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2022-01-31 18:27:14,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 43 states have (on average 1.069767441860465) internal successors, (46), 43 states have internal predecessors, (46), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 18:27:14,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2022-01-31 18:27:14,210 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 66 [2022-01-31 18:27:14,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:27:14,211 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2022-01-31 18:27:14,211 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 12 states have internal predecessors, (37), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:14,211 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2022-01-31 18:27:14,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-01-31 18:27:14,211 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:27:14,211 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 6, 6, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 18:27:14,211 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-31 18:27:14,211 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:27:14,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:27:14,212 INFO L85 PathProgramCache]: Analyzing trace with hash -2001249604, now seen corresponding path program 10 times [2022-01-31 18:27:14,212 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:27:14,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [306780387] [2022-01-31 18:27:14,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:27:14,213 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 18:27:14,213 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:27:14,213 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:27:14,214 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:27:14,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:14,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:27:14,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:14,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 18:27:14,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:14,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-01-31 18:27:14,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:14,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-01-31 18:27:14,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:14,312 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-01-31 18:27:14,312 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:27:14,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [306780387] [2022-01-31 18:27:14,312 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [306780387] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:27:14,313 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:27:14,313 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-01-31 18:27:14,313 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018062024] [2022-01-31 18:27:14,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:27:14,313 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-31 18:27:14,313 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:27:14,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-31 18:27:14,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2022-01-31 18:27:14,314 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 13 states have internal predecessors, (39), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:14,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:27:14,495 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2022-01-31 18:27:14,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-31 18:27:14,496 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 13 states have internal predecessors, (39), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 68 [2022-01-31 18:27:14,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:27:14,496 INFO L225 Difference]: With dead ends: 78 [2022-01-31 18:27:14,496 INFO L226 Difference]: Without dead ends: 54 [2022-01-31 18:27:14,497 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=234, Invalid=366, Unknown=0, NotChecked=0, Total=600 [2022-01-31 18:27:14,497 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 41 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 18:27:14,497 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 52 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 18:27:14,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-01-31 18:27:14,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2022-01-31 18:27:14,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 45 states have internal predecessors, (48), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 18:27:14,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2022-01-31 18:27:14,501 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 68 [2022-01-31 18:27:14,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:27:14,501 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2022-01-31 18:27:14,501 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 13 states have internal predecessors, (39), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:14,501 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2022-01-31 18:27:14,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-01-31 18:27:14,502 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:27:14,502 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 6, 6, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 18:27:14,502 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-31 18:27:14,502 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:27:14,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:27:14,502 INFO L85 PathProgramCache]: Analyzing trace with hash 880721694, now seen corresponding path program 11 times [2022-01-31 18:27:14,502 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:27:14,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1534154254] [2022-01-31 18:27:14,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:27:14,504 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 18:27:14,504 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:27:14,504 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:27:14,505 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:27:14,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:14,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:27:14,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:14,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-01-31 18:27:14,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:14,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-01-31 18:27:14,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:14,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-01-31 18:27:14,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:14,612 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-01-31 18:27:14,612 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:27:14,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1534154254] [2022-01-31 18:27:14,613 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1534154254] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:27:14,613 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:27:14,613 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-01-31 18:27:14,613 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475046725] [2022-01-31 18:27:14,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:27:14,613 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 18:27:14,613 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:27:14,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 18:27:14,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2022-01-31 18:27:14,614 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 14 states have internal predecessors, (41), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:14,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:27:14,726 INFO L93 Difference]: Finished difference Result 80 states and 88 transitions. [2022-01-31 18:27:14,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-31 18:27:14,726 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 14 states have internal predecessors, (41), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 70 [2022-01-31 18:27:14,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:27:14,726 INFO L225 Difference]: With dead ends: 80 [2022-01-31 18:27:14,727 INFO L226 Difference]: Without dead ends: 56 [2022-01-31 18:27:14,727 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=273, Invalid=429, Unknown=0, NotChecked=0, Total=702 [2022-01-31 18:27:14,727 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 43 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 18:27:14,727 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 42 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 18:27:14,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-01-31 18:27:14,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2022-01-31 18:27:14,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 47 states have (on average 1.0638297872340425) internal successors, (50), 47 states have internal predecessors, (50), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 18:27:14,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2022-01-31 18:27:14,732 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 70 [2022-01-31 18:27:14,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:27:14,732 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2022-01-31 18:27:14,732 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 14 states have internal predecessors, (41), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:14,732 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2022-01-31 18:27:14,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-01-31 18:27:14,732 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:27:14,732 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 6, 6, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 18:27:14,732 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-31 18:27:14,732 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:27:14,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:27:14,733 INFO L85 PathProgramCache]: Analyzing trace with hash 201233152, now seen corresponding path program 12 times [2022-01-31 18:27:14,733 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:27:14,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [944020689] [2022-01-31 18:27:14,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:27:14,734 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 18:27:14,734 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:27:14,734 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:27:14,735 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:27:14,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:14,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:27:14,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:14,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-01-31 18:27:14,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:14,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-01-31 18:27:14,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:14,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-01-31 18:27:14,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:14,871 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-01-31 18:27:14,871 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:27:14,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [944020689] [2022-01-31 18:27:14,871 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [944020689] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:27:14,871 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:27:14,871 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-01-31 18:27:14,871 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262239216] [2022-01-31 18:27:14,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:27:14,872 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-31 18:27:14,872 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:27:14,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-31 18:27:14,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=133, Unknown=0, NotChecked=0, Total=240 [2022-01-31 18:27:14,872 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand has 16 states, 16 states have (on average 2.6875) internal successors, (43), 15 states have internal predecessors, (43), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:15,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:27:15,014 INFO L93 Difference]: Finished difference Result 82 states and 90 transitions. [2022-01-31 18:27:15,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-31 18:27:15,014 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 15 states have internal predecessors, (43), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 72 [2022-01-31 18:27:15,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:27:15,015 INFO L225 Difference]: With dead ends: 82 [2022-01-31 18:27:15,015 INFO L226 Difference]: Without dead ends: 58 [2022-01-31 18:27:15,015 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=315, Invalid=497, Unknown=0, NotChecked=0, Total=812 [2022-01-31 18:27:15,015 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 45 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 18:27:15,016 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 37 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 18:27:15,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-01-31 18:27:15,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2022-01-31 18:27:15,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 49 states have (on average 1.0612244897959184) internal successors, (52), 49 states have internal predecessors, (52), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 18:27:15,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2022-01-31 18:27:15,022 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 72 [2022-01-31 18:27:15,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:27:15,023 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2022-01-31 18:27:15,023 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 15 states have internal predecessors, (43), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:15,023 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2022-01-31 18:27:15,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-01-31 18:27:15,024 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:27:15,024 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 6, 6, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 18:27:15,024 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-31 18:27:15,024 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:27:15,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:27:15,024 INFO L85 PathProgramCache]: Analyzing trace with hash 47773282, now seen corresponding path program 13 times [2022-01-31 18:27:15,024 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:27:15,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [858844638] [2022-01-31 18:27:15,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:27:15,027 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 18:27:15,027 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:27:15,027 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:27:15,028 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:27:15,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:15,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:27:15,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:15,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-01-31 18:27:15,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:15,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-01-31 18:27:15,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:15,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-01-31 18:27:15,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:15,155 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-01-31 18:27:15,155 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:27:15,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [858844638] [2022-01-31 18:27:15,155 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [858844638] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:27:15,155 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:27:15,155 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-01-31 18:27:15,155 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589371059] [2022-01-31 18:27:15,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:27:15,156 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-01-31 18:27:15,156 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:27:15,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-01-31 18:27:15,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=150, Unknown=0, NotChecked=0, Total=272 [2022-01-31 18:27:15,156 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 16 states have internal predecessors, (45), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:15,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:27:15,324 INFO L93 Difference]: Finished difference Result 84 states and 92 transitions. [2022-01-31 18:27:15,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-31 18:27:15,324 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 16 states have internal predecessors, (45), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 74 [2022-01-31 18:27:15,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:27:15,326 INFO L225 Difference]: With dead ends: 84 [2022-01-31 18:27:15,326 INFO L226 Difference]: Without dead ends: 60 [2022-01-31 18:27:15,326 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=360, Invalid=570, Unknown=0, NotChecked=0, Total=930 [2022-01-31 18:27:15,327 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 47 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 18:27:15,327 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 37 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 18:27:15,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-01-31 18:27:15,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2022-01-31 18:27:15,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 51 states have internal predecessors, (54), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 18:27:15,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2022-01-31 18:27:15,333 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 74 [2022-01-31 18:27:15,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:27:15,333 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2022-01-31 18:27:15,333 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 16 states have internal predecessors, (45), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:15,333 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2022-01-31 18:27:15,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-01-31 18:27:15,333 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:27:15,333 INFO L514 BasicCegarLoop]: trace histogram [14, 14, 6, 6, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 18:27:15,333 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-31 18:27:15,333 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:27:15,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:27:15,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1398273724, now seen corresponding path program 14 times [2022-01-31 18:27:15,334 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:27:15,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1305823058] [2022-01-31 18:27:15,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:27:15,352 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 18:27:15,352 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:27:15,352 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:27:15,353 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:27:15,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:15,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:27:15,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:15,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-31 18:27:15,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:15,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-01-31 18:27:15,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:15,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-01-31 18:27:15,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:15,497 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-01-31 18:27:15,497 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:27:15,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1305823058] [2022-01-31 18:27:15,497 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1305823058] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:27:15,497 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:27:15,497 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-01-31 18:27:15,497 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387640869] [2022-01-31 18:27:15,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:27:15,497 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-31 18:27:15,497 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:27:15,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-31 18:27:15,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=168, Unknown=0, NotChecked=0, Total=306 [2022-01-31 18:27:15,498 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand has 18 states, 18 states have (on average 2.611111111111111) internal successors, (47), 17 states have internal predecessors, (47), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:15,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:27:15,691 INFO L93 Difference]: Finished difference Result 86 states and 94 transitions. [2022-01-31 18:27:15,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-31 18:27:15,691 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.611111111111111) internal successors, (47), 17 states have internal predecessors, (47), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 76 [2022-01-31 18:27:15,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:27:15,692 INFO L225 Difference]: With dead ends: 86 [2022-01-31 18:27:15,692 INFO L226 Difference]: Without dead ends: 62 [2022-01-31 18:27:15,692 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=408, Invalid=648, Unknown=0, NotChecked=0, Total=1056 [2022-01-31 18:27:15,693 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 49 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 18:27:15,693 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 47 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 18:27:15,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-01-31 18:27:15,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2022-01-31 18:27:15,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 53 states have (on average 1.0566037735849056) internal successors, (56), 53 states have internal predecessors, (56), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 18:27:15,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2022-01-31 18:27:15,699 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 76 [2022-01-31 18:27:15,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:27:15,699 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2022-01-31 18:27:15,699 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.611111111111111) internal successors, (47), 17 states have internal predecessors, (47), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:15,699 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2022-01-31 18:27:15,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-01-31 18:27:15,701 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:27:15,701 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 6, 6, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 18:27:15,701 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-31 18:27:15,701 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:27:15,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:27:15,701 INFO L85 PathProgramCache]: Analyzing trace with hash 519957414, now seen corresponding path program 15 times [2022-01-31 18:27:15,702 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:27:15,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [695953325] [2022-01-31 18:27:15,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:27:15,704 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 18:27:15,704 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:27:15,704 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:27:15,705 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:27:15,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:15,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:27:15,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:15,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-01-31 18:27:15,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:15,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-01-31 18:27:15,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:15,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-01-31 18:27:15,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:15,852 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-01-31 18:27:15,853 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:27:15,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [695953325] [2022-01-31 18:27:15,853 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [695953325] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:27:15,853 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:27:15,853 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-01-31 18:27:15,853 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726710442] [2022-01-31 18:27:15,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:27:15,853 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-31 18:27:15,854 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:27:15,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-31 18:27:15,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=187, Unknown=0, NotChecked=0, Total=342 [2022-01-31 18:27:15,854 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand has 19 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 18 states have internal predecessors, (49), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:16,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:27:16,056 INFO L93 Difference]: Finished difference Result 88 states and 96 transitions. [2022-01-31 18:27:16,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-31 18:27:16,056 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 18 states have internal predecessors, (49), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 78 [2022-01-31 18:27:16,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:27:16,057 INFO L225 Difference]: With dead ends: 88 [2022-01-31 18:27:16,057 INFO L226 Difference]: Without dead ends: 64 [2022-01-31 18:27:16,057 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=459, Invalid=731, Unknown=0, NotChecked=0, Total=1190 [2022-01-31 18:27:16,058 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 51 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 18:27:16,058 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 47 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 18:27:16,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-01-31 18:27:16,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2022-01-31 18:27:16,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 55 states have (on average 1.0545454545454545) internal successors, (58), 55 states have internal predecessors, (58), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 18:27:16,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2022-01-31 18:27:16,075 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 78 [2022-01-31 18:27:16,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:27:16,075 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2022-01-31 18:27:16,075 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 18 states have internal predecessors, (49), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:16,075 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2022-01-31 18:27:16,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-01-31 18:27:16,077 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:27:16,077 INFO L514 BasicCegarLoop]: trace histogram [16, 16, 6, 6, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 18:27:16,077 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-31 18:27:16,077 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:27:16,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:27:16,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1399111048, now seen corresponding path program 16 times [2022-01-31 18:27:16,077 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:27:16,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [401275990] [2022-01-31 18:27:16,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:27:16,080 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 18:27:16,080 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:27:16,080 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:27:16,086 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:27:16,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:16,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:27:16,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:16,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-31 18:27:16,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:16,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-01-31 18:27:16,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:16,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-31 18:27:16,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:16,244 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-01-31 18:27:16,244 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:27:16,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [401275990] [2022-01-31 18:27:16,244 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [401275990] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:27:16,244 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:27:16,244 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-01-31 18:27:16,244 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128120136] [2022-01-31 18:27:16,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:27:16,244 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-01-31 18:27:16,244 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:27:16,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-01-31 18:27:16,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=207, Unknown=0, NotChecked=0, Total=380 [2022-01-31 18:27:16,245 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand has 20 states, 20 states have (on average 2.55) internal successors, (51), 19 states have internal predecessors, (51), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:16,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:27:16,508 INFO L93 Difference]: Finished difference Result 90 states and 98 transitions. [2022-01-31 18:27:16,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-31 18:27:16,509 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.55) internal successors, (51), 19 states have internal predecessors, (51), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 80 [2022-01-31 18:27:16,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:27:16,509 INFO L225 Difference]: With dead ends: 90 [2022-01-31 18:27:16,509 INFO L226 Difference]: Without dead ends: 66 [2022-01-31 18:27:16,510 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=513, Invalid=819, Unknown=0, NotChecked=0, Total=1332 [2022-01-31 18:27:16,510 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 53 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 18:27:16,511 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 62 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 18:27:16,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-01-31 18:27:16,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2022-01-31 18:27:16,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 57 states have (on average 1.0526315789473684) internal successors, (60), 57 states have internal predecessors, (60), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 18:27:16,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2022-01-31 18:27:16,517 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 80 [2022-01-31 18:27:16,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:27:16,517 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2022-01-31 18:27:16,517 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.55) internal successors, (51), 19 states have internal predecessors, (51), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:16,517 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2022-01-31 18:27:16,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-01-31 18:27:16,518 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:27:16,518 INFO L514 BasicCegarLoop]: trace histogram [17, 17, 6, 6, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 18:27:16,518 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-31 18:27:16,518 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:27:16,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:27:16,518 INFO L85 PathProgramCache]: Analyzing trace with hash 157196010, now seen corresponding path program 17 times [2022-01-31 18:27:16,518 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:27:16,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2044051969] [2022-01-31 18:27:16,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:27:16,520 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 18:27:16,520 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:27:16,520 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:27:16,521 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:27:16,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:16,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:27:16,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:16,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-01-31 18:27:16,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:16,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-01-31 18:27:16,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:16,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-01-31 18:27:16,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:16,727 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-01-31 18:27:16,728 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:27:16,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2044051969] [2022-01-31 18:27:16,728 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [2044051969] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:27:16,728 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:27:16,728 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-01-31 18:27:16,728 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789258447] [2022-01-31 18:27:16,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:27:16,728 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-01-31 18:27:16,728 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:27:16,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-01-31 18:27:16,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=228, Unknown=0, NotChecked=0, Total=420 [2022-01-31 18:27:16,729 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand has 21 states, 21 states have (on average 2.5238095238095237) internal successors, (53), 20 states have internal predecessors, (53), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:16,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:27:16,990 INFO L93 Difference]: Finished difference Result 92 states and 100 transitions. [2022-01-31 18:27:16,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-01-31 18:27:16,991 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.5238095238095237) internal successors, (53), 20 states have internal predecessors, (53), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 82 [2022-01-31 18:27:16,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:27:16,991 INFO L225 Difference]: With dead ends: 92 [2022-01-31 18:27:16,991 INFO L226 Difference]: Without dead ends: 68 [2022-01-31 18:27:16,992 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=570, Invalid=912, Unknown=0, NotChecked=0, Total=1482 [2022-01-31 18:27:16,992 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 55 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 18:27:16,992 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 47 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 18:27:16,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-01-31 18:27:16,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2022-01-31 18:27:16,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 59 states have (on average 1.0508474576271187) internal successors, (62), 59 states have internal predecessors, (62), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 18:27:16,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2022-01-31 18:27:16,998 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 82 [2022-01-31 18:27:16,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:27:16,998 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2022-01-31 18:27:16,998 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.5238095238095237) internal successors, (53), 20 states have internal predecessors, (53), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:16,998 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2022-01-31 18:27:16,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-01-31 18:27:16,998 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:27:16,999 INFO L514 BasicCegarLoop]: trace histogram [18, 18, 6, 6, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 18:27:16,999 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-31 18:27:16,999 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:27:16,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:27:16,999 INFO L85 PathProgramCache]: Analyzing trace with hash 677752780, now seen corresponding path program 18 times [2022-01-31 18:27:16,999 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:27:16,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1030146285] [2022-01-31 18:27:16,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:27:17,000 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 18:27:17,000 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:27:17,001 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:27:17,002 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:27:17,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:17,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:27:17,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:17,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-31 18:27:17,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:17,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-01-31 18:27:17,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:17,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-01-31 18:27:17,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:17,216 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-01-31 18:27:17,216 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:27:17,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1030146285] [2022-01-31 18:27:17,216 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1030146285] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:27:17,216 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:27:17,216 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-01-31 18:27:17,216 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822436334] [2022-01-31 18:27:17,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:27:17,216 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-01-31 18:27:17,216 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:27:17,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-01-31 18:27:17,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=250, Unknown=0, NotChecked=0, Total=462 [2022-01-31 18:27:17,217 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand has 22 states, 22 states have (on average 2.5) internal successors, (55), 21 states have internal predecessors, (55), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:17,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:27:17,449 INFO L93 Difference]: Finished difference Result 94 states and 102 transitions. [2022-01-31 18:27:17,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-01-31 18:27:17,450 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.5) internal successors, (55), 21 states have internal predecessors, (55), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 84 [2022-01-31 18:27:17,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:27:17,450 INFO L225 Difference]: With dead ends: 94 [2022-01-31 18:27:17,450 INFO L226 Difference]: Without dead ends: 70 [2022-01-31 18:27:17,451 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=630, Invalid=1010, Unknown=0, NotChecked=0, Total=1640 [2022-01-31 18:27:17,451 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 57 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 18:27:17,452 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 47 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 18:27:17,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-01-31 18:27:17,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2022-01-31 18:27:17,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 61 states have (on average 1.0491803278688525) internal successors, (64), 61 states have internal predecessors, (64), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 18:27:17,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2022-01-31 18:27:17,457 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 84 [2022-01-31 18:27:17,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:27:17,457 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2022-01-31 18:27:17,457 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.5) internal successors, (55), 21 states have internal predecessors, (55), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:17,457 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2022-01-31 18:27:17,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-01-31 18:27:17,458 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:27:17,458 INFO L514 BasicCegarLoop]: trace histogram [19, 19, 6, 6, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 18:27:17,458 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-31 18:27:17,458 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:27:17,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:27:17,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1578364882, now seen corresponding path program 19 times [2022-01-31 18:27:17,458 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:27:17,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1310401047] [2022-01-31 18:27:17,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:27:17,460 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 18:27:17,460 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:27:17,460 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:27:17,461 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:27:17,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:17,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:27:17,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:17,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-01-31 18:27:17,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:17,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-01-31 18:27:17,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:17,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-01-31 18:27:17,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:17,690 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-01-31 18:27:17,690 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:27:17,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1310401047] [2022-01-31 18:27:17,690 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1310401047] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:27:17,690 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:27:17,690 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-01-31 18:27:17,690 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364249172] [2022-01-31 18:27:17,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:27:17,691 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-01-31 18:27:17,692 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:27:17,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-01-31 18:27:17,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=273, Unknown=0, NotChecked=0, Total=506 [2022-01-31 18:27:17,693 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand has 23 states, 23 states have (on average 2.4782608695652173) internal successors, (57), 22 states have internal predecessors, (57), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:17,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:27:17,952 INFO L93 Difference]: Finished difference Result 95 states and 103 transitions. [2022-01-31 18:27:17,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-01-31 18:27:17,952 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.4782608695652173) internal successors, (57), 22 states have internal predecessors, (57), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 86 [2022-01-31 18:27:17,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:27:17,953 INFO L225 Difference]: With dead ends: 95 [2022-01-31 18:27:17,954 INFO L226 Difference]: Without dead ends: 71 [2022-01-31 18:27:17,954 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=693, Invalid=1113, Unknown=0, NotChecked=0, Total=1806 [2022-01-31 18:27:17,955 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 58 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 18:27:17,955 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 42 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 18:27:17,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-01-31 18:27:17,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-01-31 18:27:17,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 63 states have (on average 1.0476190476190477) internal successors, (66), 63 states have internal predecessors, (66), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 18:27:17,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2022-01-31 18:27:17,960 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 86 [2022-01-31 18:27:17,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:27:17,960 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2022-01-31 18:27:17,960 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.4782608695652173) internal successors, (57), 22 states have internal predecessors, (57), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:17,961 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2022-01-31 18:27:17,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-01-31 18:27:17,961 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:27:17,961 INFO L514 BasicCegarLoop]: trace histogram [20, 20, 6, 6, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 18:27:17,961 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-31 18:27:17,961 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:27:17,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:27:17,961 INFO L85 PathProgramCache]: Analyzing trace with hash -748953584, now seen corresponding path program 20 times [2022-01-31 18:27:17,962 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:27:17,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [599138263] [2022-01-31 18:27:17,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:27:17,963 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 18:27:17,963 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:27:17,963 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:27:17,965 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:27:17,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:17,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:27:17,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:17,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-31 18:27:17,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:18,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-01-31 18:27:18,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:18,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-01-31 18:27:18,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:18,016 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-01-31 18:27:18,016 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:27:18,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [599138263] [2022-01-31 18:27:18,016 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [599138263] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:27:18,016 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:27:18,016 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 18:27:18,016 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397413794] [2022-01-31 18:27:18,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:27:18,017 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 18:27:18,017 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:27:18,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 18:27:18,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-31 18:27:18,018 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:18,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:27:18,068 INFO L93 Difference]: Finished difference Result 97 states and 107 transitions. [2022-01-31 18:27:18,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 18:27:18,071 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 88 [2022-01-31 18:27:18,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:27:18,071 INFO L225 Difference]: With dead ends: 97 [2022-01-31 18:27:18,071 INFO L226 Difference]: Without dead ends: 74 [2022-01-31 18:27:18,072 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-01-31 18:27:18,072 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 25 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 18:27:18,075 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 37 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 18:27:18,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-01-31 18:27:18,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2022-01-31 18:27:18,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 65 states have (on average 1.0461538461538462) internal successors, (68), 65 states have internal predecessors, (68), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 18:27:18,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2022-01-31 18:27:18,081 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 88 [2022-01-31 18:27:18,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:27:18,081 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2022-01-31 18:27:18,081 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:18,081 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2022-01-31 18:27:18,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-01-31 18:27:18,082 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:27:18,082 INFO L514 BasicCegarLoop]: trace histogram [20, 20, 9, 9, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 18:27:18,082 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-31 18:27:18,082 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:27:18,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:27:18,082 INFO L85 PathProgramCache]: Analyzing trace with hash 118087790, now seen corresponding path program 21 times [2022-01-31 18:27:18,082 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:27:18,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1169038102] [2022-01-31 18:27:18,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:27:18,084 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 18:27:18,084 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:27:18,084 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:27:18,086 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:27:18,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:18,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:27:18,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:18,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-31 18:27:18,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:18,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-01-31 18:27:18,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:18,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-01-31 18:27:18,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:18,142 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-31 18:27:18,142 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:27:18,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1169038102] [2022-01-31 18:27:18,142 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1169038102] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:27:18,142 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:27:18,142 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-31 18:27:18,142 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382888093] [2022-01-31 18:27:18,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:27:18,142 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 18:27:18,142 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:27:18,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 18:27:18,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-31 18:27:18,143 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:18,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:27:18,204 INFO L93 Difference]: Finished difference Result 101 states and 111 transitions. [2022-01-31 18:27:18,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-31 18:27:18,205 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 94 [2022-01-31 18:27:18,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:27:18,205 INFO L225 Difference]: With dead ends: 101 [2022-01-31 18:27:18,205 INFO L226 Difference]: Without dead ends: 76 [2022-01-31 18:27:18,205 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2022-01-31 18:27:18,206 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 27 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 18:27:18,207 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 42 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 18:27:18,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-01-31 18:27:18,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2022-01-31 18:27:18,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 67 states have (on average 1.044776119402985) internal successors, (70), 67 states have internal predecessors, (70), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 18:27:18,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2022-01-31 18:27:18,212 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 94 [2022-01-31 18:27:18,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:27:18,213 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2022-01-31 18:27:18,213 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:18,213 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2022-01-31 18:27:18,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-01-31 18:27:18,214 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:27:18,214 INFO L514 BasicCegarLoop]: trace histogram [20, 20, 12, 12, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 18:27:18,214 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-01-31 18:27:18,214 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:27:18,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:27:18,214 INFO L85 PathProgramCache]: Analyzing trace with hash -130096564, now seen corresponding path program 22 times [2022-01-31 18:27:18,214 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:27:18,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [225028441] [2022-01-31 18:27:18,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:27:18,215 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 18:27:18,216 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:27:18,216 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:27:18,217 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:27:18,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:18,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:27:18,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:18,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-31 18:27:18,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:18,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-01-31 18:27:18,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:18,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-01-31 18:27:18,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:18,276 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-01-31 18:27:18,276 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:27:18,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [225028441] [2022-01-31 18:27:18,276 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [225028441] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:27:18,276 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:27:18,277 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 18:27:18,277 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998707584] [2022-01-31 18:27:18,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:27:18,278 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 18:27:18,278 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:27:18,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 18:27:18,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-01-31 18:27:18,278 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:18,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:27:18,341 INFO L93 Difference]: Finished difference Result 105 states and 115 transitions. [2022-01-31 18:27:18,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 18:27:18,342 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 100 [2022-01-31 18:27:18,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:27:18,342 INFO L225 Difference]: With dead ends: 105 [2022-01-31 18:27:18,342 INFO L226 Difference]: Without dead ends: 78 [2022-01-31 18:27:18,343 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2022-01-31 18:27:18,343 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 29 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 18:27:18,343 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 37 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 18:27:18,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-01-31 18:27:18,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2022-01-31 18:27:18,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 69 states have (on average 1.0434782608695652) internal successors, (72), 69 states have internal predecessors, (72), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 18:27:18,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2022-01-31 18:27:18,349 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 100 [2022-01-31 18:27:18,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:27:18,350 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2022-01-31 18:27:18,350 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:18,350 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2022-01-31 18:27:18,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-01-31 18:27:18,351 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:27:18,351 INFO L514 BasicCegarLoop]: trace histogram [20, 20, 15, 15, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 18:27:18,351 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-01-31 18:27:18,351 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:27:18,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:27:18,352 INFO L85 PathProgramCache]: Analyzing trace with hash -604813910, now seen corresponding path program 23 times [2022-01-31 18:27:18,352 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:27:18,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [396627553] [2022-01-31 18:27:18,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:27:18,353 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 18:27:18,353 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:27:18,353 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:27:18,355 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:27:18,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:18,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:27:18,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:18,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-31 18:27:18,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:18,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-01-31 18:27:18,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:18,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-01-31 18:27:18,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:18,442 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-01-31 18:27:18,442 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:27:18,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [396627553] [2022-01-31 18:27:18,442 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [396627553] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:27:18,443 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:27:18,443 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-31 18:27:18,443 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656082904] [2022-01-31 18:27:18,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:27:18,443 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-31 18:27:18,443 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:27:18,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-31 18:27:18,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-01-31 18:27:18,443 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:18,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:27:18,518 INFO L93 Difference]: Finished difference Result 109 states and 119 transitions. [2022-01-31 18:27:18,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 18:27:18,519 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 106 [2022-01-31 18:27:18,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:27:18,519 INFO L225 Difference]: With dead ends: 109 [2022-01-31 18:27:18,519 INFO L226 Difference]: Without dead ends: 80 [2022-01-31 18:27:18,519 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2022-01-31 18:27:18,520 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 31 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 18:27:18,520 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 42 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 18:27:18,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-01-31 18:27:18,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2022-01-31 18:27:18,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 71 states have (on average 1.0422535211267605) internal successors, (74), 71 states have internal predecessors, (74), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 18:27:18,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2022-01-31 18:27:18,526 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 106 [2022-01-31 18:27:18,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:27:18,526 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2022-01-31 18:27:18,526 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:18,526 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2022-01-31 18:27:18,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-01-31 18:27:18,527 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:27:18,527 INFO L514 BasicCegarLoop]: trace histogram [20, 20, 18, 18, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 18:27:18,527 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-01-31 18:27:18,527 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:27:18,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:27:18,528 INFO L85 PathProgramCache]: Analyzing trace with hash -977835384, now seen corresponding path program 24 times [2022-01-31 18:27:18,528 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:27:18,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1893273315] [2022-01-31 18:27:18,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:27:18,531 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 18:27:18,531 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:27:18,531 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:27:18,532 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:27:18,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:18,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:27:18,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:18,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-31 18:27:18,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:18,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-01-31 18:27:18,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:18,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-01-31 18:27:18,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:18,607 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-01-31 18:27:18,607 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:27:18,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1893273315] [2022-01-31 18:27:18,607 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1893273315] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:27:18,607 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:27:18,607 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-31 18:27:18,607 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193619397] [2022-01-31 18:27:18,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:27:18,607 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 18:27:18,607 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:27:18,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 18:27:18,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-01-31 18:27:18,608 INFO L87 Difference]: Start difference. First operand 79 states and 83 transitions. Second operand has 10 states, 10 states have (on average 3.7) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:18,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:27:18,682 INFO L93 Difference]: Finished difference Result 113 states and 123 transitions. [2022-01-31 18:27:18,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 18:27:18,682 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 112 [2022-01-31 18:27:18,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:27:18,682 INFO L225 Difference]: With dead ends: 113 [2022-01-31 18:27:18,682 INFO L226 Difference]: Without dead ends: 82 [2022-01-31 18:27:18,683 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=164, Unknown=0, NotChecked=0, Total=272 [2022-01-31 18:27:18,683 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 33 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 18:27:18,684 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 32 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 18:27:18,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-01-31 18:27:18,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2022-01-31 18:27:18,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 73 states have (on average 1.0410958904109588) internal successors, (76), 73 states have internal predecessors, (76), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 18:27:18,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2022-01-31 18:27:18,689 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 112 [2022-01-31 18:27:18,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:27:18,690 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2022-01-31 18:27:18,690 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:18,690 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2022-01-31 18:27:18,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-01-31 18:27:18,690 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:27:18,690 INFO L514 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 18:27:18,690 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-01-31 18:27:18,690 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:27:18,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:27:18,691 INFO L85 PathProgramCache]: Analyzing trace with hash 498315494, now seen corresponding path program 25 times [2022-01-31 18:27:18,691 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:27:18,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1719036862] [2022-01-31 18:27:18,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:27:18,692 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 18:27:18,692 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:27:18,692 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:27:18,693 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:27:18,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:18,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:27:18,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:18,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-31 18:27:18,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:18,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-01-31 18:27:18,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:18,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-01-31 18:27:18,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:18,788 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-01-31 18:27:18,789 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:27:18,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1719036862] [2022-01-31 18:27:18,789 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1719036862] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:27:18,789 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:27:18,789 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-31 18:27:18,789 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369465600] [2022-01-31 18:27:18,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:27:18,789 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-31 18:27:18,789 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:27:18,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-31 18:27:18,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2022-01-31 18:27:18,790 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 10 states have internal predecessors, (39), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:18,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:27:18,890 INFO L93 Difference]: Finished difference Result 117 states and 127 transitions. [2022-01-31 18:27:18,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 18:27:18,890 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 10 states have internal predecessors, (39), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 118 [2022-01-31 18:27:18,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:27:18,891 INFO L225 Difference]: With dead ends: 117 [2022-01-31 18:27:18,891 INFO L226 Difference]: Without dead ends: 84 [2022-01-31 18:27:18,891 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=135, Invalid=207, Unknown=0, NotChecked=0, Total=342 [2022-01-31 18:27:18,892 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 35 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 18:27:18,892 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 42 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 18:27:18,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-01-31 18:27:18,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2022-01-31 18:27:18,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 75 states have (on average 1.04) internal successors, (78), 75 states have internal predecessors, (78), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 18:27:18,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2022-01-31 18:27:18,898 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 118 [2022-01-31 18:27:18,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:27:18,898 INFO L470 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2022-01-31 18:27:18,898 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 10 states have internal predecessors, (39), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:18,899 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2022-01-31 18:27:18,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-01-31 18:27:18,899 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:27:18,899 INFO L514 BasicCegarLoop]: trace histogram [24, 24, 20, 20, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 18:27:18,899 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-01-31 18:27:18,899 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:27:18,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:27:18,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1767343932, now seen corresponding path program 26 times [2022-01-31 18:27:18,900 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:27:18,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1764017255] [2022-01-31 18:27:18,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:27:18,901 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 18:27:18,901 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:27:18,901 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:27:18,903 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:27:18,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:18,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:27:18,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:18,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-31 18:27:18,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:18,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-01-31 18:27:18,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:18,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-01-31 18:27:18,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:18,996 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-01-31 18:27:18,997 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:27:18,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1764017255] [2022-01-31 18:27:18,997 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1764017255] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:27:18,997 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:27:18,997 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 18:27:18,997 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146006341] [2022-01-31 18:27:18,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:27:18,997 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 18:27:18,997 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:27:18,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 18:27:18,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2022-01-31 18:27:18,998 INFO L87 Difference]: Start difference. First operand 83 states and 87 transitions. Second operand has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 11 states have internal predecessors, (41), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:19,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:27:19,101 INFO L93 Difference]: Finished difference Result 121 states and 131 transitions. [2022-01-31 18:27:19,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 18:27:19,102 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 11 states have internal predecessors, (41), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 124 [2022-01-31 18:27:19,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:27:19,102 INFO L225 Difference]: With dead ends: 121 [2022-01-31 18:27:19,102 INFO L226 Difference]: Without dead ends: 86 [2022-01-31 18:27:19,102 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=165, Invalid=255, Unknown=0, NotChecked=0, Total=420 [2022-01-31 18:27:19,103 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 37 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 18:27:19,103 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 32 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 18:27:19,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-01-31 18:27:19,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2022-01-31 18:27:19,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 77 states have (on average 1.0389610389610389) internal successors, (80), 77 states have internal predecessors, (80), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 18:27:19,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2022-01-31 18:27:19,130 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 124 [2022-01-31 18:27:19,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:27:19,130 INFO L470 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2022-01-31 18:27:19,130 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 11 states have internal predecessors, (41), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:19,130 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2022-01-31 18:27:19,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-01-31 18:27:19,130 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:27:19,131 INFO L514 BasicCegarLoop]: trace histogram [27, 27, 20, 20, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 18:27:19,131 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-01-31 18:27:19,131 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:27:19,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:27:19,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1544674782, now seen corresponding path program 27 times [2022-01-31 18:27:19,131 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:27:19,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1182229530] [2022-01-31 18:27:19,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:27:19,133 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 18:27:19,133 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:27:19,133 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:27:19,135 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:27:19,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:19,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:27:19,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:19,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-31 18:27:19,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:19,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-01-31 18:27:19,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:19,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-01-31 18:27:19,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:19,255 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-01-31 18:27:19,256 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:27:19,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1182229530] [2022-01-31 18:27:19,256 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1182229530] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:27:19,256 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:27:19,256 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-31 18:27:19,256 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828126038] [2022-01-31 18:27:19,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:27:19,256 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-31 18:27:19,256 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:27:19,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-31 18:27:19,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2022-01-31 18:27:19,257 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 12 states have internal predecessors, (43), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:19,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:27:19,376 INFO L93 Difference]: Finished difference Result 125 states and 135 transitions. [2022-01-31 18:27:19,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 18:27:19,376 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 12 states have internal predecessors, (43), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 130 [2022-01-31 18:27:19,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:27:19,377 INFO L225 Difference]: With dead ends: 125 [2022-01-31 18:27:19,377 INFO L226 Difference]: Without dead ends: 88 [2022-01-31 18:27:19,377 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=198, Invalid=308, Unknown=0, NotChecked=0, Total=506 [2022-01-31 18:27:19,378 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 39 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 18:27:19,378 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 32 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 18:27:19,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-01-31 18:27:19,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2022-01-31 18:27:19,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 79 states have (on average 1.0379746835443038) internal successors, (82), 79 states have internal predecessors, (82), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 18:27:19,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2022-01-31 18:27:19,384 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 130 [2022-01-31 18:27:19,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:27:19,384 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 91 transitions. [2022-01-31 18:27:19,384 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 12 states have internal predecessors, (43), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:19,384 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2022-01-31 18:27:19,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-01-31 18:27:19,385 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:27:19,385 INFO L514 BasicCegarLoop]: trace histogram [30, 30, 20, 20, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 18:27:19,385 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-01-31 18:27:19,385 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:27:19,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:27:19,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1869942016, now seen corresponding path program 28 times [2022-01-31 18:27:19,386 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:27:19,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [149882838] [2022-01-31 18:27:19,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:27:19,387 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 18:27:19,387 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:27:19,387 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:27:19,388 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:27:19,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:19,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:27:19,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:19,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-31 18:27:19,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:19,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-01-31 18:27:19,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:19,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-01-31 18:27:19,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:19,501 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-01-31 18:27:19,501 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:27:19,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [149882838] [2022-01-31 18:27:19,502 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [149882838] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:27:19,502 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:27:19,502 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-01-31 18:27:19,502 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488842579] [2022-01-31 18:27:19,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:27:19,502 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-31 18:27:19,502 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:27:19,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-31 18:27:19,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2022-01-31 18:27:19,503 INFO L87 Difference]: Start difference. First operand 87 states and 91 transitions. Second operand has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 states have internal predecessors, (45), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:19,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:27:19,641 INFO L93 Difference]: Finished difference Result 129 states and 139 transitions. [2022-01-31 18:27:19,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-31 18:27:19,641 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 states have internal predecessors, (45), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 136 [2022-01-31 18:27:19,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:27:19,642 INFO L225 Difference]: With dead ends: 129 [2022-01-31 18:27:19,642 INFO L226 Difference]: Without dead ends: 90 [2022-01-31 18:27:19,642 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=234, Invalid=366, Unknown=0, NotChecked=0, Total=600 [2022-01-31 18:27:19,643 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 41 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 18:27:19,643 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 42 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 18:27:19,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-01-31 18:27:19,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2022-01-31 18:27:19,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 81 states have (on average 1.037037037037037) internal successors, (84), 81 states have internal predecessors, (84), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 18:27:19,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2022-01-31 18:27:19,649 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 136 [2022-01-31 18:27:19,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:27:19,649 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2022-01-31 18:27:19,649 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 states have internal predecessors, (45), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:19,649 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2022-01-31 18:27:19,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-01-31 18:27:19,650 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:27:19,650 INFO L514 BasicCegarLoop]: trace histogram [33, 33, 20, 20, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 18:27:19,650 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-01-31 18:27:19,650 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:27:19,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:27:19,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1338349918, now seen corresponding path program 29 times [2022-01-31 18:27:19,651 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:27:19,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1415006595] [2022-01-31 18:27:19,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:27:19,652 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 18:27:19,652 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:27:19,652 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:27:19,653 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:27:19,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:19,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:27:19,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:19,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-31 18:27:19,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:19,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-01-31 18:27:19,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:19,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-01-31 18:27:19,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:19,761 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-01-31 18:27:19,761 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:27:19,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1415006595] [2022-01-31 18:27:19,761 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1415006595] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:27:19,762 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:27:19,762 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-01-31 18:27:19,762 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870963648] [2022-01-31 18:27:19,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:27:19,762 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 18:27:19,762 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:27:19,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 18:27:19,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2022-01-31 18:27:19,762 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. Second operand has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 14 states have internal predecessors, (47), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:19,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:27:19,908 INFO L93 Difference]: Finished difference Result 133 states and 143 transitions. [2022-01-31 18:27:19,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-31 18:27:19,908 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 14 states have internal predecessors, (47), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 142 [2022-01-31 18:27:19,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:27:19,909 INFO L225 Difference]: With dead ends: 133 [2022-01-31 18:27:19,909 INFO L226 Difference]: Without dead ends: 92 [2022-01-31 18:27:19,909 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=273, Invalid=429, Unknown=0, NotChecked=0, Total=702 [2022-01-31 18:27:19,909 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 43 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 18:27:19,910 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 42 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 18:27:19,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-01-31 18:27:19,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2022-01-31 18:27:19,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 83 states have (on average 1.036144578313253) internal successors, (86), 83 states have internal predecessors, (86), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 18:27:19,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 95 transitions. [2022-01-31 18:27:19,938 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 95 transitions. Word has length 142 [2022-01-31 18:27:19,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:27:19,939 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 95 transitions. [2022-01-31 18:27:19,939 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 14 states have internal predecessors, (47), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:19,939 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2022-01-31 18:27:19,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-01-31 18:27:19,940 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:27:19,940 INFO L514 BasicCegarLoop]: trace histogram [36, 36, 20, 20, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 18:27:19,940 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-01-31 18:27:19,940 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:27:19,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:27:19,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1107286212, now seen corresponding path program 30 times [2022-01-31 18:27:19,940 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:27:19,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2040105444] [2022-01-31 18:27:19,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:27:19,942 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 18:27:19,942 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:27:19,942 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:27:19,944 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:27:19,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:19,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:27:19,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:19,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-31 18:27:19,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:20,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-01-31 18:27:20,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:20,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-01-31 18:27:20,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:20,081 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-01-31 18:27:20,081 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:27:20,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2040105444] [2022-01-31 18:27:20,081 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [2040105444] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:27:20,081 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:27:20,081 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-01-31 18:27:20,081 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541269844] [2022-01-31 18:27:20,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:27:20,082 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-31 18:27:20,082 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:27:20,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-31 18:27:20,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=133, Unknown=0, NotChecked=0, Total=240 [2022-01-31 18:27:20,082 INFO L87 Difference]: Start difference. First operand 91 states and 95 transitions. Second operand has 16 states, 16 states have (on average 3.0625) internal successors, (49), 15 states have internal predecessors, (49), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:20,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:27:20,264 INFO L93 Difference]: Finished difference Result 137 states and 147 transitions. [2022-01-31 18:27:20,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-31 18:27:20,265 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.0625) internal successors, (49), 15 states have internal predecessors, (49), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 148 [2022-01-31 18:27:20,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:27:20,265 INFO L225 Difference]: With dead ends: 137 [2022-01-31 18:27:20,265 INFO L226 Difference]: Without dead ends: 94 [2022-01-31 18:27:20,266 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=315, Invalid=497, Unknown=0, NotChecked=0, Total=812 [2022-01-31 18:27:20,266 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 45 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 18:27:20,266 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 42 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 18:27:20,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-01-31 18:27:20,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2022-01-31 18:27:20,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 85 states have (on average 1.035294117647059) internal successors, (88), 85 states have internal predecessors, (88), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 18:27:20,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 97 transitions. [2022-01-31 18:27:20,273 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 97 transitions. Word has length 148 [2022-01-31 18:27:20,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:27:20,274 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 97 transitions. [2022-01-31 18:27:20,274 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.0625) internal successors, (49), 15 states have internal predecessors, (49), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:20,274 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2022-01-31 18:27:20,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-01-31 18:27:20,274 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:27:20,274 INFO L514 BasicCegarLoop]: trace histogram [39, 39, 20, 20, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 18:27:20,275 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-01-31 18:27:20,275 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:27:20,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:27:20,275 INFO L85 PathProgramCache]: Analyzing trace with hash -874703206, now seen corresponding path program 31 times [2022-01-31 18:27:20,275 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:27:20,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1517364818] [2022-01-31 18:27:20,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:27:20,276 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 18:27:20,276 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:27:20,276 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:27:20,278 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:27:20,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:20,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:27:20,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:20,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-31 18:27:20,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:20,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-01-31 18:27:20,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:20,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-01-31 18:27:20,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:20,449 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-01-31 18:27:20,449 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:27:20,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1517364818] [2022-01-31 18:27:20,450 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1517364818] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:27:20,450 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:27:20,450 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-01-31 18:27:20,450 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204171373] [2022-01-31 18:27:20,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:27:20,450 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-01-31 18:27:20,450 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:27:20,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-01-31 18:27:20,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=150, Unknown=0, NotChecked=0, Total=272 [2022-01-31 18:27:20,451 INFO L87 Difference]: Start difference. First operand 93 states and 97 transitions. Second operand has 17 states, 17 states have (on average 3.0) internal successors, (51), 16 states have internal predecessors, (51), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:20,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:27:20,633 INFO L93 Difference]: Finished difference Result 141 states and 151 transitions. [2022-01-31 18:27:20,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-31 18:27:20,633 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.0) internal successors, (51), 16 states have internal predecessors, (51), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 154 [2022-01-31 18:27:20,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:27:20,634 INFO L225 Difference]: With dead ends: 141 [2022-01-31 18:27:20,634 INFO L226 Difference]: Without dead ends: 96 [2022-01-31 18:27:20,635 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=360, Invalid=570, Unknown=0, NotChecked=0, Total=930 [2022-01-31 18:27:20,635 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 47 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 18:27:20,635 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 42 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 18:27:20,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-01-31 18:27:20,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2022-01-31 18:27:20,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 87 states have (on average 1.0344827586206897) internal successors, (90), 87 states have internal predecessors, (90), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 18:27:20,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions. [2022-01-31 18:27:20,644 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 99 transitions. Word has length 154 [2022-01-31 18:27:20,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:27:20,645 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 99 transitions. [2022-01-31 18:27:20,645 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.0) internal successors, (51), 16 states have internal predecessors, (51), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:20,645 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2022-01-31 18:27:20,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-01-31 18:27:20,646 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:27:20,646 INFO L514 BasicCegarLoop]: trace histogram [42, 42, 20, 20, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 18:27:20,646 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-01-31 18:27:20,646 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:27:20,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:27:20,646 INFO L85 PathProgramCache]: Analyzing trace with hash 430753656, now seen corresponding path program 32 times [2022-01-31 18:27:20,646 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:27:20,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [851552397] [2022-01-31 18:27:20,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:27:20,648 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 18:27:20,648 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:27:20,648 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:27:20,649 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:27:20,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:20,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:27:20,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:20,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-31 18:27:20,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:20,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-01-31 18:27:20,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:20,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-01-31 18:27:20,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:20,812 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-01-31 18:27:20,812 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:27:20,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [851552397] [2022-01-31 18:27:20,812 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [851552397] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:27:20,812 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:27:20,812 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-01-31 18:27:20,812 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881806606] [2022-01-31 18:27:20,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:27:20,813 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-31 18:27:20,813 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:27:20,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-31 18:27:20,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=168, Unknown=0, NotChecked=0, Total=306 [2022-01-31 18:27:20,813 INFO L87 Difference]: Start difference. First operand 95 states and 99 transitions. Second operand has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 17 states have internal predecessors, (53), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:21,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:27:21,010 INFO L93 Difference]: Finished difference Result 145 states and 155 transitions. [2022-01-31 18:27:21,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-31 18:27:21,011 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 17 states have internal predecessors, (53), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 160 [2022-01-31 18:27:21,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:27:21,011 INFO L225 Difference]: With dead ends: 145 [2022-01-31 18:27:21,011 INFO L226 Difference]: Without dead ends: 98 [2022-01-31 18:27:21,012 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=408, Invalid=648, Unknown=0, NotChecked=0, Total=1056 [2022-01-31 18:27:21,012 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 49 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 18:27:21,012 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 37 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 18:27:21,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-01-31 18:27:21,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2022-01-31 18:27:21,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 89 states have (on average 1.0337078651685394) internal successors, (92), 89 states have internal predecessors, (92), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 18:27:21,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 101 transitions. [2022-01-31 18:27:21,044 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 101 transitions. Word has length 160 [2022-01-31 18:27:21,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:27:21,044 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 101 transitions. [2022-01-31 18:27:21,044 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 17 states have internal predecessors, (53), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:21,044 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 101 transitions. [2022-01-31 18:27:21,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2022-01-31 18:27:21,045 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:27:21,045 INFO L514 BasicCegarLoop]: trace histogram [45, 45, 20, 20, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 18:27:21,045 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-01-31 18:27:21,045 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:27:21,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:27:21,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1280809430, now seen corresponding path program 33 times [2022-01-31 18:27:21,046 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:27:21,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [769407887] [2022-01-31 18:27:21,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:27:21,048 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 18:27:21,048 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:27:21,048 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:27:21,049 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:27:21,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:21,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:27:21,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:21,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-31 18:27:21,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:21,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-01-31 18:27:21,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:21,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-01-31 18:27:21,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:21,224 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-01-31 18:27:21,225 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:27:21,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [769407887] [2022-01-31 18:27:21,225 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [769407887] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:27:21,225 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:27:21,225 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-01-31 18:27:21,225 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592640604] [2022-01-31 18:27:21,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:27:21,225 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-31 18:27:21,225 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:27:21,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-31 18:27:21,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=187, Unknown=0, NotChecked=0, Total=342 [2022-01-31 18:27:21,226 INFO L87 Difference]: Start difference. First operand 97 states and 101 transitions. Second operand has 19 states, 19 states have (on average 2.8947368421052633) internal successors, (55), 18 states have internal predecessors, (55), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:21,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:27:21,446 INFO L93 Difference]: Finished difference Result 149 states and 159 transitions. [2022-01-31 18:27:21,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-31 18:27:21,446 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.8947368421052633) internal successors, (55), 18 states have internal predecessors, (55), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 166 [2022-01-31 18:27:21,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:27:21,447 INFO L225 Difference]: With dead ends: 149 [2022-01-31 18:27:21,447 INFO L226 Difference]: Without dead ends: 100 [2022-01-31 18:27:21,448 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=459, Invalid=731, Unknown=0, NotChecked=0, Total=1190 [2022-01-31 18:27:21,448 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 51 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 18:27:21,448 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 52 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 18:27:21,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-01-31 18:27:21,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2022-01-31 18:27:21,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 91 states have (on average 1.032967032967033) internal successors, (94), 91 states have internal predecessors, (94), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 18:27:21,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 103 transitions. [2022-01-31 18:27:21,455 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 103 transitions. Word has length 166 [2022-01-31 18:27:21,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:27:21,456 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 103 transitions. [2022-01-31 18:27:21,456 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.8947368421052633) internal successors, (55), 18 states have internal predecessors, (55), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:21,456 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 103 transitions. [2022-01-31 18:27:21,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-01-31 18:27:21,456 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:27:21,456 INFO L514 BasicCegarLoop]: trace histogram [48, 48, 20, 20, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 18:27:21,456 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-01-31 18:27:21,456 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:27:21,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:27:21,457 INFO L85 PathProgramCache]: Analyzing trace with hash 56487348, now seen corresponding path program 34 times [2022-01-31 18:27:21,457 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:27:21,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [334101904] [2022-01-31 18:27:21,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:27:21,458 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 18:27:21,458 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:27:21,458 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:27:21,460 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:27:21,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:21,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:27:21,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:21,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-31 18:27:21,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:21,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-01-31 18:27:21,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:21,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-01-31 18:27:21,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:21,655 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-01-31 18:27:21,655 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:27:21,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [334101904] [2022-01-31 18:27:21,655 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [334101904] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:27:21,655 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:27:21,655 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-01-31 18:27:21,655 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399188921] [2022-01-31 18:27:21,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:27:21,655 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-01-31 18:27:21,655 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:27:21,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-01-31 18:27:21,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=207, Unknown=0, NotChecked=0, Total=380 [2022-01-31 18:27:21,656 INFO L87 Difference]: Start difference. First operand 99 states and 103 transitions. Second operand has 20 states, 20 states have (on average 2.85) internal successors, (57), 19 states have internal predecessors, (57), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:21,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:27:21,877 INFO L93 Difference]: Finished difference Result 153 states and 163 transitions. [2022-01-31 18:27:21,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-31 18:27:21,877 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.85) internal successors, (57), 19 states have internal predecessors, (57), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 172 [2022-01-31 18:27:21,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:27:21,878 INFO L225 Difference]: With dead ends: 153 [2022-01-31 18:27:21,878 INFO L226 Difference]: Without dead ends: 102 [2022-01-31 18:27:21,878 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=513, Invalid=819, Unknown=0, NotChecked=0, Total=1332 [2022-01-31 18:27:21,879 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 53 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 18:27:21,879 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 32 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 18:27:21,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-01-31 18:27:21,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2022-01-31 18:27:21,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 93 states have (on average 1.032258064516129) internal successors, (96), 93 states have internal predecessors, (96), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 18:27:21,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 105 transitions. [2022-01-31 18:27:21,886 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 105 transitions. Word has length 172 [2022-01-31 18:27:21,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:27:21,886 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 105 transitions. [2022-01-31 18:27:21,886 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.85) internal successors, (57), 19 states have internal predecessors, (57), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:21,886 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2022-01-31 18:27:21,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-01-31 18:27:21,887 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:27:21,887 INFO L514 BasicCegarLoop]: trace histogram [51, 51, 20, 20, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 18:27:21,887 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-01-31 18:27:21,887 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:27:21,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:27:21,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1322787602, now seen corresponding path program 35 times [2022-01-31 18:27:21,887 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:27:21,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1559525729] [2022-01-31 18:27:21,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:27:21,889 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 18:27:21,889 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:27:21,889 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:27:21,890 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:27:21,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:21,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:27:21,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:21,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-31 18:27:21,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:22,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-01-31 18:27:22,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:22,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-01-31 18:27:22,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:22,125 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-01-31 18:27:22,125 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:27:22,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1559525729] [2022-01-31 18:27:22,126 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1559525729] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:27:22,126 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:27:22,126 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-01-31 18:27:22,126 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496833185] [2022-01-31 18:27:22,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:27:22,126 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-01-31 18:27:22,126 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:27:22,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-01-31 18:27:22,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=228, Unknown=0, NotChecked=0, Total=420 [2022-01-31 18:27:22,127 INFO L87 Difference]: Start difference. First operand 101 states and 105 transitions. Second operand has 21 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 20 states have internal predecessors, (59), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:22,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:27:22,378 INFO L93 Difference]: Finished difference Result 157 states and 167 transitions. [2022-01-31 18:27:22,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-01-31 18:27:22,379 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 20 states have internal predecessors, (59), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 178 [2022-01-31 18:27:22,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:27:22,379 INFO L225 Difference]: With dead ends: 157 [2022-01-31 18:27:22,379 INFO L226 Difference]: Without dead ends: 104 [2022-01-31 18:27:22,380 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=570, Invalid=912, Unknown=0, NotChecked=0, Total=1482 [2022-01-31 18:27:22,380 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 55 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 18:27:22,380 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 42 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 18:27:22,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-01-31 18:27:22,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2022-01-31 18:27:22,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 95 states have (on average 1.0315789473684212) internal successors, (98), 95 states have internal predecessors, (98), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 18:27:22,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 107 transitions. [2022-01-31 18:27:22,388 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 107 transitions. Word has length 178 [2022-01-31 18:27:22,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:27:22,388 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 107 transitions. [2022-01-31 18:27:22,388 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 20 states have internal predecessors, (59), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:22,388 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 107 transitions. [2022-01-31 18:27:22,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2022-01-31 18:27:22,389 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:27:22,389 INFO L514 BasicCegarLoop]: trace histogram [54, 54, 20, 20, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 18:27:22,389 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-01-31 18:27:22,389 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:27:22,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:27:22,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1518954000, now seen corresponding path program 36 times [2022-01-31 18:27:22,389 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:27:22,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1596096563] [2022-01-31 18:27:22,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:27:22,391 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 18:27:22,391 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:27:22,391 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:27:22,392 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:27:22,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:22,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:27:22,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:22,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-31 18:27:22,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:22,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-01-31 18:27:22,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:22,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-01-31 18:27:22,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:22,605 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-01-31 18:27:22,605 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:27:22,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1596096563] [2022-01-31 18:27:22,605 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1596096563] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:27:22,605 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:27:22,605 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-01-31 18:27:22,605 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058219951] [2022-01-31 18:27:22,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:27:22,605 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-01-31 18:27:22,606 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:27:22,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-01-31 18:27:22,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=250, Unknown=0, NotChecked=0, Total=462 [2022-01-31 18:27:22,606 INFO L87 Difference]: Start difference. First operand 103 states and 107 transitions. Second operand has 22 states, 22 states have (on average 2.772727272727273) internal successors, (61), 21 states have internal predecessors, (61), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:22,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:27:22,853 INFO L93 Difference]: Finished difference Result 161 states and 171 transitions. [2022-01-31 18:27:22,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-01-31 18:27:22,853 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.772727272727273) internal successors, (61), 21 states have internal predecessors, (61), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 184 [2022-01-31 18:27:22,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:27:22,854 INFO L225 Difference]: With dead ends: 161 [2022-01-31 18:27:22,854 INFO L226 Difference]: Without dead ends: 106 [2022-01-31 18:27:22,855 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=630, Invalid=1010, Unknown=0, NotChecked=0, Total=1640 [2022-01-31 18:27:22,855 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 57 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 18:27:22,855 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 32 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 18:27:22,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-01-31 18:27:22,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2022-01-31 18:27:22,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 97 states have (on average 1.0309278350515463) internal successors, (100), 97 states have internal predecessors, (100), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 18:27:22,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 109 transitions. [2022-01-31 18:27:22,863 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 109 transitions. Word has length 184 [2022-01-31 18:27:22,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:27:22,863 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 109 transitions. [2022-01-31 18:27:22,863 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.772727272727273) internal successors, (61), 21 states have internal predecessors, (61), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:22,863 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 109 transitions. [2022-01-31 18:27:22,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2022-01-31 18:27:22,864 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:27:22,864 INFO L514 BasicCegarLoop]: trace histogram [57, 57, 20, 20, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 18:27:22,864 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-01-31 18:27:22,864 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:27:22,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:27:22,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1518449230, now seen corresponding path program 37 times [2022-01-31 18:27:22,864 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:27:22,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1474819261] [2022-01-31 18:27:22,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:27:22,866 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 18:27:22,866 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:27:22,866 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:27:22,871 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:27:22,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:22,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:27:22,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:22,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-31 18:27:22,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:23,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-01-31 18:27:23,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:23,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-01-31 18:27:23,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:23,128 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-01-31 18:27:23,128 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:27:23,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1474819261] [2022-01-31 18:27:23,128 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1474819261] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:27:23,128 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:27:23,128 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-01-31 18:27:23,128 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552529253] [2022-01-31 18:27:23,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:27:23,128 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-01-31 18:27:23,129 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:27:23,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-01-31 18:27:23,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=273, Unknown=0, NotChecked=0, Total=506 [2022-01-31 18:27:23,129 INFO L87 Difference]: Start difference. First operand 105 states and 109 transitions. Second operand has 23 states, 23 states have (on average 2.739130434782609) internal successors, (63), 22 states have internal predecessors, (63), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:23,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:27:23,428 INFO L93 Difference]: Finished difference Result 164 states and 174 transitions. [2022-01-31 18:27:23,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-01-31 18:27:23,428 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.739130434782609) internal successors, (63), 22 states have internal predecessors, (63), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 190 [2022-01-31 18:27:23,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:27:23,428 INFO L225 Difference]: With dead ends: 164 [2022-01-31 18:27:23,429 INFO L226 Difference]: Without dead ends: 107 [2022-01-31 18:27:23,429 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=693, Invalid=1113, Unknown=0, NotChecked=0, Total=1806 [2022-01-31 18:27:23,429 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 58 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 18:27:23,430 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 47 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 18:27:23,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-01-31 18:27:23,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2022-01-31 18:27:23,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 99 states have (on average 1.0303030303030303) internal successors, (102), 99 states have internal predecessors, (102), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 18:27:23,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 111 transitions. [2022-01-31 18:27:23,438 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 111 transitions. Word has length 190 [2022-01-31 18:27:23,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:27:23,438 INFO L470 AbstractCegarLoop]: Abstraction has 107 states and 111 transitions. [2022-01-31 18:27:23,438 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.739130434782609) internal successors, (63), 22 states have internal predecessors, (63), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:23,438 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 111 transitions. [2022-01-31 18:27:23,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2022-01-31 18:27:23,439 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:27:23,439 INFO L514 BasicCegarLoop]: trace histogram [60, 60, 20, 20, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 18:27:23,439 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-01-31 18:27:23,439 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:27:23,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:27:23,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1814442964, now seen corresponding path program 38 times [2022-01-31 18:27:23,439 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:27:23,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1895367908] [2022-01-31 18:27:23,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:27:23,441 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 18:27:23,441 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:27:23,441 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:27:23,442 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:27:23,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:23,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:27:23,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:23,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-31 18:27:23,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:23,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-01-31 18:27:23,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:23,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-01-31 18:27:23,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:23,504 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2022-01-31 18:27:23,504 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:27:23,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1895367908] [2022-01-31 18:27:23,504 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1895367908] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:27:23,505 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:27:23,505 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 18:27:23,505 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733063330] [2022-01-31 18:27:23,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:27:23,505 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 18:27:23,505 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:27:23,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 18:27:23,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-31 18:27:23,505 INFO L87 Difference]: Start difference. First operand 107 states and 111 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:23,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:27:23,554 INFO L93 Difference]: Finished difference Result 161 states and 166 transitions. [2022-01-31 18:27:23,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 18:27:23,555 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 196 [2022-01-31 18:27:23,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:27:23,555 INFO L225 Difference]: With dead ends: 161 [2022-01-31 18:27:23,555 INFO L226 Difference]: Without dead ends: 110 [2022-01-31 18:27:23,555 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-01-31 18:27:23,556 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 25 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 18:27:23,556 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 32 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 18:27:23,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-01-31 18:27:23,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2022-01-31 18:27:23,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 101 states have (on average 1.0297029702970297) internal successors, (104), 101 states have internal predecessors, (104), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 18:27:23,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 113 transitions. [2022-01-31 18:27:23,564 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 113 transitions. Word has length 196 [2022-01-31 18:27:23,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:27:23,564 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 113 transitions. [2022-01-31 18:27:23,564 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:23,564 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 113 transitions. [2022-01-31 18:27:23,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2022-01-31 18:27:23,565 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:27:23,565 INFO L514 BasicCegarLoop]: trace histogram [60, 60, 20, 20, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 18:27:23,565 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-01-31 18:27:23,565 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:27:23,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:27:23,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1884661162, now seen corresponding path program 39 times [2022-01-31 18:27:23,566 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:27:23,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1957497864] [2022-01-31 18:27:23,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:27:23,567 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 18:27:23,567 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:27:23,567 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:27:23,569 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:27:23,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:23,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:27:23,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:23,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-31 18:27:23,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:23,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-01-31 18:27:23,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:23,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-01-31 18:27:23,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:23,635 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2022-01-31 18:27:23,635 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:27:23,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1957497864] [2022-01-31 18:27:23,636 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1957497864] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:27:23,636 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:27:23,636 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-31 18:27:23,636 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907651722] [2022-01-31 18:27:23,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:27:23,636 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 18:27:23,636 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:27:23,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 18:27:23,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-31 18:27:23,637 INFO L87 Difference]: Start difference. First operand 109 states and 113 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:23,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:27:23,693 INFO L93 Difference]: Finished difference Result 163 states and 168 transitions. [2022-01-31 18:27:23,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-31 18:27:23,693 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 198 [2022-01-31 18:27:23,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:27:23,694 INFO L225 Difference]: With dead ends: 163 [2022-01-31 18:27:23,694 INFO L226 Difference]: Without dead ends: 112 [2022-01-31 18:27:23,694 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2022-01-31 18:27:23,695 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 27 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 18:27:23,695 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 32 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 18:27:23,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-01-31 18:27:23,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2022-01-31 18:27:23,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 103 states have (on average 1.029126213592233) internal successors, (106), 103 states have internal predecessors, (106), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 18:27:23,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 115 transitions. [2022-01-31 18:27:23,703 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 115 transitions. Word has length 198 [2022-01-31 18:27:23,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:27:23,703 INFO L470 AbstractCegarLoop]: Abstraction has 111 states and 115 transitions. [2022-01-31 18:27:23,703 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:23,703 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 115 transitions. [2022-01-31 18:27:23,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2022-01-31 18:27:23,704 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:27:23,704 INFO L514 BasicCegarLoop]: trace histogram [60, 60, 20, 20, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 18:27:23,704 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-01-31 18:27:23,704 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:27:23,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:27:23,705 INFO L85 PathProgramCache]: Analyzing trace with hash 490805160, now seen corresponding path program 40 times [2022-01-31 18:27:23,705 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:27:23,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [386404028] [2022-01-31 18:27:23,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:27:23,706 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 18:27:23,706 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:27:23,706 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:27:23,708 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:27:23,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:23,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:27:23,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:23,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-31 18:27:23,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:23,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-01-31 18:27:23,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:23,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-01-31 18:27:23,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:23,782 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2022-01-31 18:27:23,782 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:27:23,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [386404028] [2022-01-31 18:27:23,783 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [386404028] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:27:23,783 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:27:23,783 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 18:27:23,783 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831318224] [2022-01-31 18:27:23,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:27:23,783 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 18:27:23,783 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:27:23,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 18:27:23,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-01-31 18:27:23,784 INFO L87 Difference]: Start difference. First operand 111 states and 115 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:23,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:27:23,854 INFO L93 Difference]: Finished difference Result 165 states and 170 transitions. [2022-01-31 18:27:23,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 18:27:23,854 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 200 [2022-01-31 18:27:23,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:27:23,855 INFO L225 Difference]: With dead ends: 165 [2022-01-31 18:27:23,855 INFO L226 Difference]: Without dead ends: 114 [2022-01-31 18:27:23,855 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2022-01-31 18:27:23,855 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 29 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 18:27:23,855 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 32 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 18:27:23,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-01-31 18:27:23,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2022-01-31 18:27:23,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 105 states have (on average 1.0285714285714285) internal successors, (108), 105 states have internal predecessors, (108), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 18:27:23,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 117 transitions. [2022-01-31 18:27:23,888 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 117 transitions. Word has length 200 [2022-01-31 18:27:23,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:27:23,888 INFO L470 AbstractCegarLoop]: Abstraction has 113 states and 117 transitions. [2022-01-31 18:27:23,888 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:23,888 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 117 transitions. [2022-01-31 18:27:23,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2022-01-31 18:27:23,889 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:27:23,889 INFO L514 BasicCegarLoop]: trace histogram [60, 60, 20, 20, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 18:27:23,889 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-01-31 18:27:23,889 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:27:23,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:27:23,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1024983590, now seen corresponding path program 41 times [2022-01-31 18:27:23,890 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:27:23,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1686055559] [2022-01-31 18:27:23,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:27:23,892 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 18:27:23,892 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:27:23,892 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:27:23,894 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:27:23,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:23,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:27:23,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:23,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-31 18:27:23,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:23,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-01-31 18:27:23,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:23,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-01-31 18:27:23,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:23,984 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2022-01-31 18:27:23,984 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:27:23,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1686055559] [2022-01-31 18:27:23,984 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1686055559] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:27:23,984 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:27:23,984 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-31 18:27:23,984 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125484874] [2022-01-31 18:27:23,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:27:23,985 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-31 18:27:23,985 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:27:23,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-31 18:27:23,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-01-31 18:27:23,985 INFO L87 Difference]: Start difference. First operand 113 states and 117 transitions. Second operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:24,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:27:24,066 INFO L93 Difference]: Finished difference Result 167 states and 172 transitions. [2022-01-31 18:27:24,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 18:27:24,066 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 202 [2022-01-31 18:27:24,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:27:24,067 INFO L225 Difference]: With dead ends: 167 [2022-01-31 18:27:24,067 INFO L226 Difference]: Without dead ends: 116 [2022-01-31 18:27:24,067 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2022-01-31 18:27:24,067 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 31 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 18:27:24,068 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 32 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 18:27:24,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-01-31 18:27:24,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2022-01-31 18:27:24,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 107 states have (on average 1.02803738317757) internal successors, (110), 107 states have internal predecessors, (110), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 18:27:24,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 119 transitions. [2022-01-31 18:27:24,079 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 119 transitions. Word has length 202 [2022-01-31 18:27:24,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:27:24,079 INFO L470 AbstractCegarLoop]: Abstraction has 115 states and 119 transitions. [2022-01-31 18:27:24,079 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:24,080 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 119 transitions. [2022-01-31 18:27:24,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2022-01-31 18:27:24,080 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:27:24,080 INFO L514 BasicCegarLoop]: trace histogram [60, 60, 20, 20, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 18:27:24,081 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-01-31 18:27:24,081 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:27:24,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:27:24,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1025620700, now seen corresponding path program 42 times [2022-01-31 18:27:24,081 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:27:24,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [657221978] [2022-01-31 18:27:24,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:27:24,082 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 18:27:24,082 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:27:24,083 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:27:24,084 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:27:24,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:24,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:27:24,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:24,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-31 18:27:24,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:24,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-01-31 18:27:24,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:24,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-01-31 18:27:24,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:24,171 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2022-01-31 18:27:24,171 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:27:24,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [657221978] [2022-01-31 18:27:24,171 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [657221978] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:27:24,171 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:27:24,171 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-31 18:27:24,171 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981254970] [2022-01-31 18:27:24,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:27:24,171 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 18:27:24,171 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:27:24,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 18:27:24,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-01-31 18:27:24,172 INFO L87 Difference]: Start difference. First operand 115 states and 119 transitions. Second operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:24,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:27:24,282 INFO L93 Difference]: Finished difference Result 169 states and 174 transitions. [2022-01-31 18:27:24,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 18:27:24,282 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 204 [2022-01-31 18:27:24,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:27:24,283 INFO L225 Difference]: With dead ends: 169 [2022-01-31 18:27:24,283 INFO L226 Difference]: Without dead ends: 118 [2022-01-31 18:27:24,283 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=164, Unknown=0, NotChecked=0, Total=272 [2022-01-31 18:27:24,283 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 33 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 18:27:24,283 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 52 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 18:27:24,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-01-31 18:27:24,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2022-01-31 18:27:24,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 109 states have (on average 1.0275229357798166) internal successors, (112), 109 states have internal predecessors, (112), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 18:27:24,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 121 transitions. [2022-01-31 18:27:24,292 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 121 transitions. Word has length 204 [2022-01-31 18:27:24,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:27:24,292 INFO L470 AbstractCegarLoop]: Abstraction has 117 states and 121 transitions. [2022-01-31 18:27:24,292 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:24,292 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 121 transitions. [2022-01-31 18:27:24,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2022-01-31 18:27:24,293 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:27:24,293 INFO L514 BasicCegarLoop]: trace histogram [60, 60, 20, 20, 7, 7, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 18:27:24,293 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-01-31 18:27:24,293 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:27:24,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:27:24,293 INFO L85 PathProgramCache]: Analyzing trace with hash -266354526, now seen corresponding path program 43 times [2022-01-31 18:27:24,294 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:27:24,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1144002155] [2022-01-31 18:27:24,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:27:24,295 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 18:27:24,295 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:27:24,295 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:27:24,296 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:27:24,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:24,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:27:24,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:24,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-31 18:27:24,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:24,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-01-31 18:27:24,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:24,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-01-31 18:27:24,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:24,392 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2022-01-31 18:27:24,392 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:27:24,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1144002155] [2022-01-31 18:27:24,392 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1144002155] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:27:24,393 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:27:24,393 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-31 18:27:24,393 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918631399] [2022-01-31 18:27:24,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:27:24,393 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-31 18:27:24,393 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:27:24,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-31 18:27:24,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2022-01-31 18:27:24,393 INFO L87 Difference]: Start difference. First operand 117 states and 121 transitions. Second operand has 11 states, 11 states have (on average 3.0) internal successors, (33), 10 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:24,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:27:24,507 INFO L93 Difference]: Finished difference Result 171 states and 176 transitions. [2022-01-31 18:27:24,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 18:27:24,507 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 10 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 206 [2022-01-31 18:27:24,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:27:24,508 INFO L225 Difference]: With dead ends: 171 [2022-01-31 18:27:24,508 INFO L226 Difference]: Without dead ends: 120 [2022-01-31 18:27:24,508 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=135, Invalid=207, Unknown=0, NotChecked=0, Total=342 [2022-01-31 18:27:24,509 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 35 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 18:27:24,509 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 47 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 18:27:24,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-01-31 18:27:24,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2022-01-31 18:27:24,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 111 states have (on average 1.027027027027027) internal successors, (114), 111 states have internal predecessors, (114), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 18:27:24,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 123 transitions. [2022-01-31 18:27:24,517 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 123 transitions. Word has length 206 [2022-01-31 18:27:24,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:27:24,518 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 123 transitions. [2022-01-31 18:27:24,518 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 10 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:24,518 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 123 transitions. [2022-01-31 18:27:24,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2022-01-31 18:27:24,518 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:27:24,518 INFO L514 BasicCegarLoop]: trace histogram [60, 60, 20, 20, 8, 8, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 18:27:24,519 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-01-31 18:27:24,519 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:27:24,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:27:24,519 INFO L85 PathProgramCache]: Analyzing trace with hash -756001632, now seen corresponding path program 44 times [2022-01-31 18:27:24,519 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:27:24,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1625391113] [2022-01-31 18:27:24,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:27:24,520 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 18:27:24,520 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:27:24,520 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:27:24,522 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:27:24,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:24,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:27:24,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:24,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-31 18:27:24,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:24,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-01-31 18:27:24,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:24,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-01-31 18:27:24,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:24,667 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2022-01-31 18:27:24,667 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:27:24,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1625391113] [2022-01-31 18:27:24,667 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1625391113] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:27:24,667 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:27:24,667 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 18:27:24,667 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792147922] [2022-01-31 18:27:24,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:27:24,668 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 18:27:24,668 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:27:24,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 18:27:24,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2022-01-31 18:27:24,668 INFO L87 Difference]: Start difference. First operand 119 states and 123 transitions. Second operand has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:24,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:27:24,787 INFO L93 Difference]: Finished difference Result 173 states and 178 transitions. [2022-01-31 18:27:24,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 18:27:24,787 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 208 [2022-01-31 18:27:24,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:27:24,788 INFO L225 Difference]: With dead ends: 173 [2022-01-31 18:27:24,788 INFO L226 Difference]: Without dead ends: 122 [2022-01-31 18:27:24,789 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=165, Invalid=255, Unknown=0, NotChecked=0, Total=420 [2022-01-31 18:27:24,789 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 37 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 18:27:24,789 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 42 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 18:27:24,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-01-31 18:27:24,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2022-01-31 18:27:24,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 113 states have (on average 1.0265486725663717) internal successors, (116), 113 states have internal predecessors, (116), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 18:27:24,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 125 transitions. [2022-01-31 18:27:24,798 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 125 transitions. Word has length 208 [2022-01-31 18:27:24,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:27:24,798 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 125 transitions. [2022-01-31 18:27:24,798 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:24,798 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 125 transitions. [2022-01-31 18:27:24,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2022-01-31 18:27:24,799 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:27:24,799 INFO L514 BasicCegarLoop]: trace histogram [60, 60, 20, 20, 9, 9, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 18:27:24,799 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-01-31 18:27:24,799 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:27:24,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:27:24,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1139532062, now seen corresponding path program 45 times [2022-01-31 18:27:24,799 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:27:24,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [531267381] [2022-01-31 18:27:24,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:27:24,801 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 18:27:24,801 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:27:24,801 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:27:24,802 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:27:24,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:24,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:27:24,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:24,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-31 18:27:24,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:24,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-01-31 18:27:24,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:24,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-01-31 18:27:24,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:24,941 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2022-01-31 18:27:24,942 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:27:24,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [531267381] [2022-01-31 18:27:24,942 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [531267381] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:27:24,942 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:27:24,942 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-31 18:27:24,942 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42981911] [2022-01-31 18:27:24,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:27:24,942 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-31 18:27:24,942 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:27:24,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-31 18:27:24,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2022-01-31 18:27:24,943 INFO L87 Difference]: Start difference. First operand 121 states and 125 transitions. Second operand has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 12 states have internal predecessors, (37), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:25,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:27:25,068 INFO L93 Difference]: Finished difference Result 175 states and 180 transitions. [2022-01-31 18:27:25,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 18:27:25,069 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 12 states have internal predecessors, (37), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 210 [2022-01-31 18:27:25,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:27:25,069 INFO L225 Difference]: With dead ends: 175 [2022-01-31 18:27:25,069 INFO L226 Difference]: Without dead ends: 124 [2022-01-31 18:27:25,070 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=198, Invalid=308, Unknown=0, NotChecked=0, Total=506 [2022-01-31 18:27:25,070 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 39 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 18:27:25,070 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 37 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 18:27:25,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-01-31 18:27:25,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2022-01-31 18:27:25,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 115 states have (on average 1.0260869565217392) internal successors, (118), 115 states have internal predecessors, (118), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 18:27:25,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 127 transitions. [2022-01-31 18:27:25,080 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 127 transitions. Word has length 210 [2022-01-31 18:27:25,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:27:25,080 INFO L470 AbstractCegarLoop]: Abstraction has 123 states and 127 transitions. [2022-01-31 18:27:25,080 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 12 states have internal predecessors, (37), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:25,080 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 127 transitions. [2022-01-31 18:27:25,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2022-01-31 18:27:25,081 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:27:25,081 INFO L514 BasicCegarLoop]: trace histogram [60, 60, 20, 20, 10, 10, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 18:27:25,081 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-01-31 18:27:25,081 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:27:25,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:27:25,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1681278492, now seen corresponding path program 46 times [2022-01-31 18:27:25,082 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:27:25,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [90671766] [2022-01-31 18:27:25,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:27:25,083 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 18:27:25,083 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:27:25,084 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:27:25,086 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:27:25,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:25,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:27:25,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:25,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-31 18:27:25,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:25,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-01-31 18:27:25,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:25,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-01-31 18:27:25,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:25,212 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2022-01-31 18:27:25,212 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:27:25,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [90671766] [2022-01-31 18:27:25,213 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [90671766] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:27:25,213 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:27:25,213 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-01-31 18:27:25,213 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364049708] [2022-01-31 18:27:25,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:27:25,213 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-31 18:27:25,213 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:27:25,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-31 18:27:25,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2022-01-31 18:27:25,214 INFO L87 Difference]: Start difference. First operand 123 states and 127 transitions. Second operand has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 13 states have internal predecessors, (39), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:25,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:27:25,367 INFO L93 Difference]: Finished difference Result 177 states and 182 transitions. [2022-01-31 18:27:25,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-31 18:27:25,367 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 13 states have internal predecessors, (39), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 212 [2022-01-31 18:27:25,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:27:25,368 INFO L225 Difference]: With dead ends: 177 [2022-01-31 18:27:25,368 INFO L226 Difference]: Without dead ends: 126 [2022-01-31 18:27:25,368 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=234, Invalid=366, Unknown=0, NotChecked=0, Total=600 [2022-01-31 18:27:25,368 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 41 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 18:27:25,368 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 47 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 18:27:25,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-01-31 18:27:25,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2022-01-31 18:27:25,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 117 states have (on average 1.0256410256410255) internal successors, (120), 117 states have internal predecessors, (120), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 18:27:25,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 129 transitions. [2022-01-31 18:27:25,377 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 129 transitions. Word has length 212 [2022-01-31 18:27:25,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:27:25,377 INFO L470 AbstractCegarLoop]: Abstraction has 125 states and 129 transitions. [2022-01-31 18:27:25,377 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 13 states have internal predecessors, (39), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:25,378 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 129 transitions. [2022-01-31 18:27:25,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2022-01-31 18:27:25,378 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:27:25,378 INFO L514 BasicCegarLoop]: trace histogram [60, 60, 20, 20, 11, 11, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 18:27:25,378 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-01-31 18:27:25,378 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:27:25,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:27:25,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1686412390, now seen corresponding path program 47 times [2022-01-31 18:27:25,379 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:27:25,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2032883605] [2022-01-31 18:27:25,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:27:25,380 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 18:27:25,380 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:27:25,380 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:27:25,382 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:27:25,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:25,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:27:25,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:25,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-31 18:27:25,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:25,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-01-31 18:27:25,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:25,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-01-31 18:27:25,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:25,513 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2022-01-31 18:27:25,513 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:27:25,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2032883605] [2022-01-31 18:27:25,514 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [2032883605] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:27:25,514 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:27:25,514 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-01-31 18:27:25,514 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561194254] [2022-01-31 18:27:25,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:27:25,514 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 18:27:25,514 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:27:25,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 18:27:25,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2022-01-31 18:27:25,515 INFO L87 Difference]: Start difference. First operand 125 states and 129 transitions. Second operand has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 14 states have internal predecessors, (41), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:25,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:27:25,685 INFO L93 Difference]: Finished difference Result 179 states and 184 transitions. [2022-01-31 18:27:25,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-31 18:27:25,685 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 14 states have internal predecessors, (41), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 214 [2022-01-31 18:27:25,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:27:25,686 INFO L225 Difference]: With dead ends: 179 [2022-01-31 18:27:25,686 INFO L226 Difference]: Without dead ends: 128 [2022-01-31 18:27:25,686 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=273, Invalid=429, Unknown=0, NotChecked=0, Total=702 [2022-01-31 18:27:25,687 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 43 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 18:27:25,687 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 42 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 18:27:25,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-01-31 18:27:25,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2022-01-31 18:27:25,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 119 states have (on average 1.0252100840336134) internal successors, (122), 119 states have internal predecessors, (122), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 18:27:25,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 131 transitions. [2022-01-31 18:27:25,696 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 131 transitions. Word has length 214 [2022-01-31 18:27:25,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:27:25,696 INFO L470 AbstractCegarLoop]: Abstraction has 127 states and 131 transitions. [2022-01-31 18:27:25,696 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 14 states have internal predecessors, (41), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:25,696 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 131 transitions. [2022-01-31 18:27:25,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2022-01-31 18:27:25,697 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:27:25,697 INFO L514 BasicCegarLoop]: trace histogram [60, 60, 20, 20, 12, 12, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 18:27:25,697 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-01-31 18:27:25,697 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:27:25,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:27:25,697 INFO L85 PathProgramCache]: Analyzing trace with hash 367991192, now seen corresponding path program 48 times [2022-01-31 18:27:25,697 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:27:25,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1716613239] [2022-01-31 18:27:25,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:27:25,699 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 18:27:25,699 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:27:25,699 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:27:25,701 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:27:25,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:25,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:27:25,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:25,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-31 18:27:25,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:25,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-01-31 18:27:25,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:25,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-01-31 18:27:25,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:25,839 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2022-01-31 18:27:25,839 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:27:25,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1716613239] [2022-01-31 18:27:25,840 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1716613239] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:27:25,840 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:27:25,840 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-01-31 18:27:25,840 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476247663] [2022-01-31 18:27:25,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:27:25,840 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-31 18:27:25,840 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:27:25,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-31 18:27:25,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=133, Unknown=0, NotChecked=0, Total=240 [2022-01-31 18:27:25,841 INFO L87 Difference]: Start difference. First operand 127 states and 131 transitions. Second operand has 16 states, 16 states have (on average 2.6875) internal successors, (43), 15 states have internal predecessors, (43), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:26,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:27:26,025 INFO L93 Difference]: Finished difference Result 181 states and 186 transitions. [2022-01-31 18:27:26,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-31 18:27:26,025 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 15 states have internal predecessors, (43), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 216 [2022-01-31 18:27:26,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:27:26,026 INFO L225 Difference]: With dead ends: 181 [2022-01-31 18:27:26,026 INFO L226 Difference]: Without dead ends: 130 [2022-01-31 18:27:26,026 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=315, Invalid=497, Unknown=0, NotChecked=0, Total=812 [2022-01-31 18:27:26,026 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 45 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 18:27:26,027 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 52 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 18:27:26,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-01-31 18:27:26,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2022-01-31 18:27:26,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 121 states have (on average 1.024793388429752) internal successors, (124), 121 states have internal predecessors, (124), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 18:27:26,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 133 transitions. [2022-01-31 18:27:26,037 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 133 transitions. Word has length 216 [2022-01-31 18:27:26,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:27:26,037 INFO L470 AbstractCegarLoop]: Abstraction has 129 states and 133 transitions. [2022-01-31 18:27:26,037 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 15 states have internal predecessors, (43), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:26,038 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 133 transitions. [2022-01-31 18:27:26,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2022-01-31 18:27:26,038 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:27:26,038 INFO L514 BasicCegarLoop]: trace histogram [60, 60, 20, 20, 13, 13, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 18:27:26,038 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-01-31 18:27:26,038 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:27:26,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:27:26,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1035122666, now seen corresponding path program 49 times [2022-01-31 18:27:26,039 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:27:26,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1462528192] [2022-01-31 18:27:26,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:27:26,040 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 18:27:26,040 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:27:26,040 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:27:26,042 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:27:26,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:26,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:27:26,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:26,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-31 18:27:26,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:26,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-01-31 18:27:26,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:26,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-01-31 18:27:26,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:26,197 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2022-01-31 18:27:26,197 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:27:26,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1462528192] [2022-01-31 18:27:26,197 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1462528192] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:27:26,197 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:27:26,197 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-01-31 18:27:26,197 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991093976] [2022-01-31 18:27:26,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:27:26,197 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-01-31 18:27:26,197 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:27:26,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-01-31 18:27:26,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=150, Unknown=0, NotChecked=0, Total=272 [2022-01-31 18:27:26,198 INFO L87 Difference]: Start difference. First operand 129 states and 133 transitions. Second operand has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 16 states have internal predecessors, (45), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:26,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:27:26,380 INFO L93 Difference]: Finished difference Result 183 states and 188 transitions. [2022-01-31 18:27:26,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-31 18:27:26,380 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 16 states have internal predecessors, (45), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 218 [2022-01-31 18:27:26,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:27:26,381 INFO L225 Difference]: With dead ends: 183 [2022-01-31 18:27:26,381 INFO L226 Difference]: Without dead ends: 132 [2022-01-31 18:27:26,381 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=360, Invalid=570, Unknown=0, NotChecked=0, Total=930 [2022-01-31 18:27:26,381 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 47 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 18:27:26,381 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 42 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 18:27:26,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-01-31 18:27:26,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 131. [2022-01-31 18:27:26,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 123 states have (on average 1.024390243902439) internal successors, (126), 123 states have internal predecessors, (126), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 18:27:26,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 135 transitions. [2022-01-31 18:27:26,395 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 135 transitions. Word has length 218 [2022-01-31 18:27:26,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:27:26,395 INFO L470 AbstractCegarLoop]: Abstraction has 131 states and 135 transitions. [2022-01-31 18:27:26,395 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 16 states have internal predecessors, (45), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:26,395 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 135 transitions. [2022-01-31 18:27:26,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2022-01-31 18:27:26,396 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:27:26,396 INFO L514 BasicCegarLoop]: trace histogram [60, 60, 20, 20, 14, 14, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 18:27:26,396 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-01-31 18:27:26,396 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:27:26,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:27:26,396 INFO L85 PathProgramCache]: Analyzing trace with hash -807809260, now seen corresponding path program 50 times [2022-01-31 18:27:26,396 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:27:26,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [312809298] [2022-01-31 18:27:26,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:27:26,398 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 18:27:26,398 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:27:26,398 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:27:26,400 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:27:26,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:26,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:27:26,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:26,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-31 18:27:26,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:26,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-01-31 18:27:26,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:26,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-01-31 18:27:26,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:26,576 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2022-01-31 18:27:26,576 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:27:26,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [312809298] [2022-01-31 18:27:26,576 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [312809298] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:27:26,576 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:27:26,576 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-01-31 18:27:26,577 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339171826] [2022-01-31 18:27:26,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:27:26,577 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-31 18:27:26,577 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:27:26,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-31 18:27:26,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=168, Unknown=0, NotChecked=0, Total=306 [2022-01-31 18:27:26,577 INFO L87 Difference]: Start difference. First operand 131 states and 135 transitions. Second operand has 18 states, 18 states have (on average 2.611111111111111) internal successors, (47), 17 states have internal predecessors, (47), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:26,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:27:26,785 INFO L93 Difference]: Finished difference Result 185 states and 190 transitions. [2022-01-31 18:27:26,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-31 18:27:26,786 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.611111111111111) internal successors, (47), 17 states have internal predecessors, (47), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 220 [2022-01-31 18:27:26,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:27:26,786 INFO L225 Difference]: With dead ends: 185 [2022-01-31 18:27:26,786 INFO L226 Difference]: Without dead ends: 134 [2022-01-31 18:27:26,787 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=408, Invalid=648, Unknown=0, NotChecked=0, Total=1056 [2022-01-31 18:27:26,787 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 49 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 18:27:26,787 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 37 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 18:27:26,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-01-31 18:27:26,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2022-01-31 18:27:26,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 125 states have (on average 1.024) internal successors, (128), 125 states have internal predecessors, (128), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 18:27:26,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 137 transitions. [2022-01-31 18:27:26,797 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 137 transitions. Word has length 220 [2022-01-31 18:27:26,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:27:26,797 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 137 transitions. [2022-01-31 18:27:26,797 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.611111111111111) internal successors, (47), 17 states have internal predecessors, (47), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:26,797 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 137 transitions. [2022-01-31 18:27:26,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2022-01-31 18:27:26,798 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:27:26,798 INFO L514 BasicCegarLoop]: trace histogram [60, 60, 20, 20, 15, 15, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 18:27:26,798 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2022-01-31 18:27:26,798 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:27:26,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:27:26,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1402958190, now seen corresponding path program 51 times [2022-01-31 18:27:26,799 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:27:26,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1948293466] [2022-01-31 18:27:26,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:27:26,800 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 18:27:26,800 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:27:26,800 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:27:26,802 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:27:26,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:26,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:27:26,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:26,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-31 18:27:26,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:26,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-01-31 18:27:26,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:26,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-01-31 18:27:26,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:26,971 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2022-01-31 18:27:26,971 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:27:26,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1948293466] [2022-01-31 18:27:26,971 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1948293466] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:27:26,971 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:27:26,971 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-01-31 18:27:26,971 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767491029] [2022-01-31 18:27:26,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:27:26,971 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-31 18:27:26,971 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:27:26,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-31 18:27:26,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=187, Unknown=0, NotChecked=0, Total=342 [2022-01-31 18:27:26,972 INFO L87 Difference]: Start difference. First operand 133 states and 137 transitions. Second operand has 19 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 18 states have internal predecessors, (49), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:27,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:27:27,178 INFO L93 Difference]: Finished difference Result 187 states and 192 transitions. [2022-01-31 18:27:27,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-31 18:27:27,179 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 18 states have internal predecessors, (49), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 222 [2022-01-31 18:27:27,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:27:27,179 INFO L225 Difference]: With dead ends: 187 [2022-01-31 18:27:27,179 INFO L226 Difference]: Without dead ends: 136 [2022-01-31 18:27:27,180 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=459, Invalid=731, Unknown=0, NotChecked=0, Total=1190 [2022-01-31 18:27:27,180 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 51 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 18:27:27,180 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 37 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 18:27:27,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-01-31 18:27:27,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 135. [2022-01-31 18:27:27,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 127 states have (on average 1.0236220472440944) internal successors, (130), 127 states have internal predecessors, (130), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 18:27:27,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 139 transitions. [2022-01-31 18:27:27,194 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 139 transitions. Word has length 222 [2022-01-31 18:27:27,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:27:27,194 INFO L470 AbstractCegarLoop]: Abstraction has 135 states and 139 transitions. [2022-01-31 18:27:27,194 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 18 states have internal predecessors, (49), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:27,194 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 139 transitions. [2022-01-31 18:27:27,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2022-01-31 18:27:27,195 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:27:27,195 INFO L514 BasicCegarLoop]: trace histogram [60, 60, 20, 20, 16, 16, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 18:27:27,195 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2022-01-31 18:27:27,195 INFO L402 AbstractCegarLoop]: === Iteration 57 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:27:27,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:27:27,195 INFO L85 PathProgramCache]: Analyzing trace with hash -2110429552, now seen corresponding path program 52 times [2022-01-31 18:27:27,196 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:27:27,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2066084616] [2022-01-31 18:27:27,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:27:27,197 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 18:27:27,197 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:27:27,197 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:27:27,199 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:27:27,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:27,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:27:27,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:27,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-31 18:27:27,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:27,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-01-31 18:27:27,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:27,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-01-31 18:27:27,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:27,400 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2022-01-31 18:27:27,400 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:27:27,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2066084616] [2022-01-31 18:27:27,400 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [2066084616] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:27:27,400 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:27:27,400 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-01-31 18:27:27,400 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642425324] [2022-01-31 18:27:27,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:27:27,401 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-01-31 18:27:27,401 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:27:27,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-01-31 18:27:27,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=207, Unknown=0, NotChecked=0, Total=380 [2022-01-31 18:27:27,402 INFO L87 Difference]: Start difference. First operand 135 states and 139 transitions. Second operand has 20 states, 20 states have (on average 2.55) internal successors, (51), 19 states have internal predecessors, (51), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:27,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:27:27,647 INFO L93 Difference]: Finished difference Result 189 states and 194 transitions. [2022-01-31 18:27:27,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-31 18:27:27,648 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.55) internal successors, (51), 19 states have internal predecessors, (51), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 224 [2022-01-31 18:27:27,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:27:27,648 INFO L225 Difference]: With dead ends: 189 [2022-01-31 18:27:27,648 INFO L226 Difference]: Without dead ends: 138 [2022-01-31 18:27:27,649 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=513, Invalid=819, Unknown=0, NotChecked=0, Total=1332 [2022-01-31 18:27:27,649 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 53 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 18:27:27,649 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 62 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 18:27:27,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-01-31 18:27:27,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 137. [2022-01-31 18:27:27,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 129 states have (on average 1.0232558139534884) internal successors, (132), 129 states have internal predecessors, (132), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 18:27:27,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 141 transitions. [2022-01-31 18:27:27,660 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 141 transitions. Word has length 224 [2022-01-31 18:27:27,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:27:27,660 INFO L470 AbstractCegarLoop]: Abstraction has 137 states and 141 transitions. [2022-01-31 18:27:27,660 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.55) internal successors, (51), 19 states have internal predecessors, (51), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:27,661 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 141 transitions. [2022-01-31 18:27:27,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2022-01-31 18:27:27,661 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:27:27,661 INFO L514 BasicCegarLoop]: trace histogram [60, 60, 20, 20, 17, 17, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 18:27:27,661 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2022-01-31 18:27:27,661 INFO L402 AbstractCegarLoop]: === Iteration 58 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:27:27,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:27:27,662 INFO L85 PathProgramCache]: Analyzing trace with hash 909391630, now seen corresponding path program 53 times [2022-01-31 18:27:27,662 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:27:27,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2002218261] [2022-01-31 18:27:27,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:27:27,663 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 18:27:27,663 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:27:27,663 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:27:27,665 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:27:27,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:27,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:27:27,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:27,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-31 18:27:27,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:27,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-01-31 18:27:27,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:27,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-01-31 18:27:27,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:27,919 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2022-01-31 18:27:27,919 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:27:27,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2002218261] [2022-01-31 18:27:27,920 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [2002218261] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:27:27,920 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:27:27,920 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-01-31 18:27:27,920 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982192494] [2022-01-31 18:27:27,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:27:27,920 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-01-31 18:27:27,920 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:27:27,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-01-31 18:27:27,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=228, Unknown=0, NotChecked=0, Total=420 [2022-01-31 18:27:27,921 INFO L87 Difference]: Start difference. First operand 137 states and 141 transitions. Second operand has 21 states, 21 states have (on average 2.5238095238095237) internal successors, (53), 20 states have internal predecessors, (53), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:28,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:27:28,180 INFO L93 Difference]: Finished difference Result 191 states and 196 transitions. [2022-01-31 18:27:28,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-01-31 18:27:28,180 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.5238095238095237) internal successors, (53), 20 states have internal predecessors, (53), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 226 [2022-01-31 18:27:28,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:27:28,181 INFO L225 Difference]: With dead ends: 191 [2022-01-31 18:27:28,181 INFO L226 Difference]: Without dead ends: 140 [2022-01-31 18:27:28,181 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=570, Invalid=912, Unknown=0, NotChecked=0, Total=1482 [2022-01-31 18:27:28,182 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 55 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 18:27:28,182 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 32 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 18:27:28,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-01-31 18:27:28,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 139. [2022-01-31 18:27:28,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 131 states have (on average 1.0229007633587786) internal successors, (134), 131 states have internal predecessors, (134), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 18:27:28,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 143 transitions. [2022-01-31 18:27:28,196 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 143 transitions. Word has length 226 [2022-01-31 18:27:28,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:27:28,197 INFO L470 AbstractCegarLoop]: Abstraction has 139 states and 143 transitions. [2022-01-31 18:27:28,197 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.5238095238095237) internal successors, (53), 20 states have internal predecessors, (53), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:28,197 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 143 transitions. [2022-01-31 18:27:28,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2022-01-31 18:27:28,198 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:27:28,198 INFO L514 BasicCegarLoop]: trace histogram [60, 60, 20, 20, 18, 18, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 18:27:28,198 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2022-01-31 18:27:28,198 INFO L402 AbstractCegarLoop]: === Iteration 59 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:27:28,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:27:28,198 INFO L85 PathProgramCache]: Analyzing trace with hash -440344564, now seen corresponding path program 54 times [2022-01-31 18:27:28,198 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:27:28,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [14623422] [2022-01-31 18:27:28,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:27:28,200 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 18:27:28,200 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:27:28,200 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:27:28,202 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:27:28,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:28,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:27:28,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:28,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-31 18:27:28,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:28,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-01-31 18:27:28,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:28,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-01-31 18:27:28,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:28,411 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2022-01-31 18:27:28,411 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:27:28,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [14623422] [2022-01-31 18:27:28,411 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [14623422] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:27:28,411 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:27:28,411 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-01-31 18:27:28,411 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122646877] [2022-01-31 18:27:28,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:27:28,412 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-01-31 18:27:28,412 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:27:28,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-01-31 18:27:28,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=250, Unknown=0, NotChecked=0, Total=462 [2022-01-31 18:27:28,412 INFO L87 Difference]: Start difference. First operand 139 states and 143 transitions. Second operand has 22 states, 22 states have (on average 2.5) internal successors, (55), 21 states have internal predecessors, (55), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:28,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:27:28,701 INFO L93 Difference]: Finished difference Result 192 states and 197 transitions. [2022-01-31 18:27:28,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-01-31 18:27:28,702 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.5) internal successors, (55), 21 states have internal predecessors, (55), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 228 [2022-01-31 18:27:28,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:27:28,702 INFO L225 Difference]: With dead ends: 192 [2022-01-31 18:27:28,702 INFO L226 Difference]: Without dead ends: 141 [2022-01-31 18:27:28,703 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=630, Invalid=1010, Unknown=0, NotChecked=0, Total=1640 [2022-01-31 18:27:28,703 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 56 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 18:27:28,703 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 42 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 18:27:28,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-01-31 18:27:28,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2022-01-31 18:27:28,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 133 states have (on average 1.0225563909774436) internal successors, (136), 133 states have internal predecessors, (136), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 18:27:28,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 145 transitions. [2022-01-31 18:27:28,715 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 145 transitions. Word has length 228 [2022-01-31 18:27:28,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:27:28,716 INFO L470 AbstractCegarLoop]: Abstraction has 141 states and 145 transitions. [2022-01-31 18:27:28,716 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.5) internal successors, (55), 21 states have internal predecessors, (55), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:27:28,716 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 145 transitions. [2022-01-31 18:27:28,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2022-01-31 18:27:28,716 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:27:28,716 INFO L514 BasicCegarLoop]: trace histogram [60, 60, 20, 20, 19, 19, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 18:27:28,717 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2022-01-31 18:27:28,717 INFO L402 AbstractCegarLoop]: === Iteration 60 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:27:28,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:27:28,717 INFO L85 PathProgramCache]: Analyzing trace with hash -456703606, now seen corresponding path program 55 times [2022-01-31 18:27:28,717 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:27:28,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1208324293] [2022-01-31 18:27:28,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:27:28,718 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 18:27:28,718 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:27:28,718 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:27:28,720 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:27:32,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:28:30,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:28:30,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:28:30,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-31 18:28:30,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:28:43,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-01-31 18:28:44,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:28:58,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-01-31 18:28:58,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:29:12,812 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 26 proven. 54 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-01-31 18:29:12,812 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:29:12,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1208324293] [2022-01-31 18:29:12,812 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1208324293] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:29:12,812 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:29:12,812 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [169] imperfect sequences [] total 169 [2022-01-31 18:29:12,812 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538668131] [2022-01-31 18:29:12,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:29:12,813 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 169 states [2022-01-31 18:29:12,813 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:29:12,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 169 interpolants. [2022-01-31 18:29:12,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=382, Invalid=28010, Unknown=0, NotChecked=0, Total=28392 [2022-01-31 18:29:12,815 INFO L87 Difference]: Start difference. First operand 141 states and 145 transitions. Second operand has 169 states, 167 states have (on average 1.0538922155688624) internal successors, (176), 165 states have internal predecessors, (176), 4 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 18:30:28,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:30:28,848 INFO L93 Difference]: Finished difference Result 207 states and 222 transitions. [2022-01-31 18:30:28,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2022-01-31 18:30:28,849 INFO L78 Accepts]: Start accepts. Automaton has has 169 states, 167 states have (on average 1.0538922155688624) internal successors, (176), 165 states have internal predecessors, (176), 4 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 230 [2022-01-31 18:30:28,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:30:28,851 INFO L225 Difference]: With dead ends: 207 [2022-01-31 18:30:28,851 INFO L226 Difference]: Without dead ends: 203 [2022-01-31 18:30:28,856 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 9 SyntacticMatches, 43 SemanticMatches, 294 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12751 ImplicationChecksByTransitivity, 100.4s TimeCoverageRelationStatistics Valid=1047, Invalid=86273, Unknown=0, NotChecked=0, Total=87320 [2022-01-31 18:30:28,856 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 37 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 21684 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 21843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 21684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30.8s IncrementalHoareTripleChecker+Time [2022-01-31 18:30:28,856 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 596 Invalid, 21843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 21684 Invalid, 0 Unknown, 0 Unchecked, 30.8s Time] [2022-01-31 18:30:28,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-01-31 18:30:28,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 193. [2022-01-31 18:30:28,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 181 states have (on average 1.0331491712707181) internal successors, (187), 183 states have internal predecessors, (187), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (12), 6 states have call predecessors, (12), 7 states have call successors, (12) [2022-01-31 18:30:28,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 207 transitions. [2022-01-31 18:30:28,930 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 207 transitions. Word has length 230 [2022-01-31 18:30:28,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:30:28,930 INFO L470 AbstractCegarLoop]: Abstraction has 193 states and 207 transitions. [2022-01-31 18:30:28,930 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 169 states, 167 states have (on average 1.0538922155688624) internal successors, (176), 165 states have internal predecessors, (176), 4 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 18:30:28,930 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 207 transitions. [2022-01-31 18:30:28,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2022-01-31 18:30:28,931 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:30:28,931 INFO L514 BasicCegarLoop]: trace histogram [60, 60, 20, 20, 20, 20, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 18:30:28,931 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2022-01-31 18:30:28,932 INFO L402 AbstractCegarLoop]: === Iteration 61 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:30:28,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:30:28,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1002126216, now seen corresponding path program 56 times [2022-01-31 18:30:28,932 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:30:28,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1543898554] [2022-01-31 18:30:28,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:30:28,933 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 18:30:28,933 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:30:28,933 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:30:28,935 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:30:28,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:30:29,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:30:29,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:30:29,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-31 18:30:29,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:30:29,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-01-31 18:30:29,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:30:29,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-01-31 18:30:29,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:30:29,169 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2022-01-31 18:30:29,170 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:30:29,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1543898554] [2022-01-31 18:30:29,170 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1543898554] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:30:29,170 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:30:29,170 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-01-31 18:30:29,170 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357161263] [2022-01-31 18:30:29,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:30:29,171 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-01-31 18:30:29,171 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:30:29,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-01-31 18:30:29,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=292, Unknown=0, NotChecked=0, Total=506 [2022-01-31 18:30:29,171 INFO L87 Difference]: Start difference. First operand 193 states and 207 transitions. Second operand has 23 states, 23 states have (on average 2.5652173913043477) internal successors, (59), 22 states have internal predecessors, (59), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:30:29,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:30:29,493 INFO L93 Difference]: Finished difference Result 251 states and 267 transitions. [2022-01-31 18:30:29,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-01-31 18:30:29,493 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.5652173913043477) internal successors, (59), 22 states have internal predecessors, (59), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 232 [2022-01-31 18:30:29,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:30:29,494 INFO L225 Difference]: With dead ends: 251 [2022-01-31 18:30:29,494 INFO L226 Difference]: Without dead ends: 193 [2022-01-31 18:30:29,495 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=636, Invalid=1170, Unknown=0, NotChecked=0, Total=1806 [2022-01-31 18:30:29,495 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 39 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 18:30:29,495 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 46 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 18:30:29,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-01-31 18:30:29,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2022-01-31 18:30:29,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 181 states have (on average 1.022099447513812) internal successors, (185), 183 states have internal predecessors, (185), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (12), 6 states have call predecessors, (12), 7 states have call successors, (12) [2022-01-31 18:30:29,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 205 transitions. [2022-01-31 18:30:29,563 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 205 transitions. Word has length 232 [2022-01-31 18:30:29,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:30:29,563 INFO L470 AbstractCegarLoop]: Abstraction has 193 states and 205 transitions. [2022-01-31 18:30:29,563 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.5652173913043477) internal successors, (59), 22 states have internal predecessors, (59), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:30:29,563 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 205 transitions. [2022-01-31 18:30:29,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2022-01-31 18:30:29,564 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:30:29,564 INFO L514 BasicCegarLoop]: trace histogram [61, 61, 20, 20, 19, 19, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 18:30:29,564 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2022-01-31 18:30:29,565 INFO L402 AbstractCegarLoop]: === Iteration 62 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:30:29,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:30:29,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1836229416, now seen corresponding path program 57 times [2022-01-31 18:30:29,565 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:30:29,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1593560101] [2022-01-31 18:30:29,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:30:29,566 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 18:30:29,566 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:30:29,566 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:30:29,568 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:30:29,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:30:29,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:30:29,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:30:29,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-31 18:30:29,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:30:29,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-01-31 18:30:29,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:30:29,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-01-31 18:30:29,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:30:29,815 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-01-31 18:30:29,816 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:30:29,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1593560101] [2022-01-31 18:30:29,816 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1593560101] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:30:29,816 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:30:29,816 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-01-31 18:30:29,816 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147469416] [2022-01-31 18:30:29,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:30:29,816 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-01-31 18:30:29,816 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:30:29,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-01-31 18:30:29,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=297, Unknown=0, NotChecked=0, Total=552 [2022-01-31 18:30:29,817 INFO L87 Difference]: Start difference. First operand 193 states and 205 transitions. Second operand has 24 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 23 states have internal predecessors, (67), 1 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-01-31 18:30:30,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:30:30,131 INFO L93 Difference]: Finished difference Result 286 states and 301 transitions. [2022-01-31 18:30:30,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-01-31 18:30:30,131 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 23 states have internal predecessors, (67), 1 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 232 [2022-01-31 18:30:30,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:30:30,132 INFO L225 Difference]: With dead ends: 286 [2022-01-31 18:30:30,132 INFO L226 Difference]: Without dead ends: 143 [2022-01-31 18:30:30,133 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=759, Invalid=1221, Unknown=0, NotChecked=0, Total=1980 [2022-01-31 18:30:30,133 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 21 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 18:30:30,133 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 41 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 18:30:30,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-01-31 18:30:30,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2022-01-31 18:30:30,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 135 states have (on average 1.0074074074074073) internal successors, (136), 135 states have internal predecessors, (136), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 18:30:30,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 145 transitions. [2022-01-31 18:30:30,163 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 145 transitions. Word has length 232 [2022-01-31 18:30:30,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:30:30,163 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 145 transitions. [2022-01-31 18:30:30,163 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 23 states have internal predecessors, (67), 1 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-01-31 18:30:30,164 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 145 transitions. [2022-01-31 18:30:30,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2022-01-31 18:30:30,164 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:30:30,164 INFO L514 BasicCegarLoop]: trace histogram [60, 60, 21, 21, 19, 19, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 18:30:30,164 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2022-01-31 18:30:30,165 INFO L402 AbstractCegarLoop]: === Iteration 63 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:30:30,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:30:30,165 INFO L85 PathProgramCache]: Analyzing trace with hash -275845780, now seen corresponding path program 58 times [2022-01-31 18:30:30,165 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:30:30,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [433289128] [2022-01-31 18:30:30,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:30:30,166 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 18:30:30,166 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:30:30,166 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:30:30,169 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:30:30,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:30:30,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:30:30,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:30:30,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-01-31 18:30:30,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:30:30,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-01-31 18:30:30,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:30:30,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-01-31 18:30:30,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:30:30,408 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2022-01-31 18:30:30,408 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:30:30,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [433289128] [2022-01-31 18:30:30,408 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [433289128] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:30:30,408 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:30:30,408 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-01-31 18:30:30,408 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236967401] [2022-01-31 18:30:30,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:30:30,409 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-01-31 18:30:30,409 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:30:30,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-01-31 18:30:30,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=317, Unknown=0, NotChecked=0, Total=552 [2022-01-31 18:30:30,409 INFO L87 Difference]: Start difference. First operand 143 states and 145 transitions. Second operand has 24 states, 24 states have (on average 2.5416666666666665) internal successors, (61), 23 states have internal predecessors, (61), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:30:30,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:30:30,648 INFO L93 Difference]: Finished difference Result 143 states and 145 transitions. [2022-01-31 18:30:30,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-01-31 18:30:30,648 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.5416666666666665) internal successors, (61), 23 states have internal predecessors, (61), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 232 [2022-01-31 18:30:30,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:30:30,648 INFO L225 Difference]: With dead ends: 143 [2022-01-31 18:30:30,648 INFO L226 Difference]: Without dead ends: 0 [2022-01-31 18:30:30,649 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=699, Invalid=1281, Unknown=0, NotChecked=0, Total=1980 [2022-01-31 18:30:30,649 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 3 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 18:30:30,649 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 28 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 18:30:30,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-31 18:30:30,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-31 18:30:30,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-31 18:30:30,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-31 18:30:30,650 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 232 [2022-01-31 18:30:30,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:30:30,650 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-31 18:30:30,650 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.5416666666666665) internal successors, (61), 23 states have internal predecessors, (61), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:30:30,650 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-31 18:30:30,650 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-31 18:30:30,652 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-31 18:30:30,655 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2022-01-31 18:30:30,657 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-31 18:31:54,734 WARN L228 SmtUtils]: Spent 1.40m on a formula simplification that was a NOOP. DAG size: 327 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-01-31 18:33:18,638 WARN L228 SmtUtils]: Spent 1.40m on a formula simplification that was a NOOP. DAG size: 327 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-01-31 18:34:39,137 WARN L228 SmtUtils]: Spent 1.34m on a formula simplification that was a NOOP. DAG size: 327 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-01-31 18:35:59,196 WARN L228 SmtUtils]: Spent 1.33m on a formula simplification that was a NOOP. DAG size: 407 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-01-31 18:36:39,373 WARN L228 SmtUtils]: Spent 40.15s on a formula simplification that was a NOOP. DAG size: 1156 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-01-31 18:36:58,209 WARN L228 SmtUtils]: Spent 15.06s on a formula simplification. DAG size of input: 733 DAG size of output: 710 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-01-31 18:37:51,865 WARN L228 SmtUtils]: Spent 53.58s on a formula simplification. DAG size of input: 1096 DAG size of output: 1073 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-01-31 18:37:51,885 INFO L858 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2022-01-31 18:37:51,886 INFO L858 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2022-01-31 18:37:51,886 INFO L858 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-01-31 18:37:51,886 INFO L861 garLoopResultBuilder]: At program point mainEXIT(lines 26 53) the Hoare annotation is: true [2022-01-31 18:37:51,886 INFO L854 garLoopResultBuilder]: At program point L50(line 50) the Hoare annotation is: false [2022-01-31 18:37:51,886 INFO L861 garLoopResultBuilder]: At program point mainFINAL(lines 26 53) the Hoare annotation is: true [2022-01-31 18:37:51,887 INFO L854 garLoopResultBuilder]: At program point L38(line 38) the Hoare annotation is: (and (= |main_~#x~0.offset| 0) (let ((.cse26 (select |#memory_int| |main_~#x~0.base|))) (let ((.cse0 (select .cse26 48)) (.cse1 (select .cse26 (+ |main_~#x~0.offset| 4))) (.cse2 (select .cse26 (+ |main_~#x~0.offset| 76))) (.cse3 (select .cse26 (+ |main_~#x~0.offset| 16))) (.cse4 (select .cse26 (+ |main_~#x~0.offset| 64))) (.cse5 (select .cse26 (+ |main_~#x~0.offset| 32))) (.cse6 (select .cse26 (+ |main_~#x~0.offset| 20))) (.cse7 (select .cse26 (+ |main_~#x~0.offset| 68))) (.cse8 (select .cse26 (+ |main_~#x~0.offset| 72))) (.cse9 (select .cse26 (+ |main_~#x~0.offset| 28))) (.cse10 (select .cse26 (+ |main_~#x~0.offset| 8))) (.cse11 (select .cse26 (+ 56 |main_~#x~0.offset|))) (.cse12 (select .cse26 (+ |main_~#x~0.offset| 12))) (.cse13 (select .cse26 (+ |main_~#x~0.offset| 24))) (.cse14 (select .cse26 (+ |main_~#x~0.offset| 60))) (.cse15 (select .cse26 (+ |main_~#x~0.offset| 40))) (.cse16 (select .cse26 |main_~#x~0.offset|)) (.cse17 (select .cse26 (+ |main_~#x~0.offset| 36))) (.cse18 (select .cse26 (+ |main_~#x~0.offset| 44))) (.cse19 (select .cse26 (+ |main_~#x~0.offset| 52)))) (let ((.cse20 (+ .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19))) (let ((.cse21 (<= 0 (+ .cse0 .cse1 .cse2 42949672960 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19))) (.cse25 (<= .cse20 42949672940)) (.cse23 (+ .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 20 .cse15 .cse16 .cse17 .cse18 .cse19)) (.cse24 (<= 0 .cse20)) (.cse22 (= (div .cse20 20) |main_#t~ret5|))) (or (and (<= (* (div (+ .cse0 .cse1 .cse2 19 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) 20) 20) .cse20) (or (and .cse21 (or (<= (+ 42949672980 (* |main_#t~ret5| 20)) 0) .cse22) (<= .cse23 0)) (and .cse24 .cse25 .cse22))) (and .cse21 .cse25 (<= .cse20 (+ 19 (* (div (+ (- 1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) 20) 20))) (or (and (= (div .cse23 20) |main_#t~ret5|) (<= (+ .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 1) 0)) (and .cse24 .cse22))))))))) [2022-01-31 18:37:51,888 INFO L854 garLoopResultBuilder]: At program point L34-2(lines 34 36) the Hoare annotation is: (let ((.cse23 (+ |main_~#x~0.offset| (* main_~i~1 4))) (.cse21 (select |#memory_int| |main_~#x~0.base|))) (let ((.cse3 (select .cse21 (+ |main_~#x~0.offset| 64))) (.cse6 (select .cse21 (+ |main_~#x~0.offset| 68))) (.cse13 (select .cse21 (+ |main_~#x~0.offset| 60))) (.cse0 (select .cse21 48)) (.cse2 (select .cse21 (+ |main_~#x~0.offset| 16))) (.cse4 (select .cse21 (+ |main_~#x~0.offset| 32))) (.cse5 (select .cse21 (+ |main_~#x~0.offset| 20))) (.cse8 (select .cse21 (+ |main_~#x~0.offset| 28))) (.cse10 (select .cse21 (+ 56 |main_~#x~0.offset|))) (.cse12 (select .cse21 (+ |main_~#x~0.offset| 24))) (.cse14 (select .cse21 (+ |main_~#x~0.offset| 40))) (.cse16 (select .cse21 (+ |main_~#x~0.offset| 36))) (.cse17 (select .cse21 (+ |main_~#x~0.offset| 44))) (.cse18 (select .cse21 (+ |main_~#x~0.offset| 52))) (.cse22 (div (+ 48 (* (- 1) |main_~#x~0.offset|)) 4)) (.cse20 (= |main_~#x~0.offset| 0)) (.cse19 (select .cse21 .cse23)) (.cse1 (select .cse21 (+ |main_~#x~0.offset| 4))) (.cse9 (select .cse21 (+ |main_~#x~0.offset| 8))) (.cse11 (select .cse21 (+ |main_~#x~0.offset| 12))) (.cse15 (select .cse21 |main_~#x~0.offset|))) (or (let ((.cse7 (select .cse21 (+ |main_~#x~0.offset| 72)))) (and (<= 19 main_~i~1) (<= 0 (+ .cse0 .cse1 40802189312 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18)) (<= main_~i~1 19) (<= (+ .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) 40802189293) (<= 0 (+ .cse0 .cse1 42949672960 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19)) (<= (+ .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) 42949672940) .cse20)) (and (<= 0 (+ .cse1 .cse9 .cse15 6442450944)) (<= (+ .cse1 .cse9 .cse15 .cse19) 8589934588) (<= main_~i~1 3) (<= (+ .cse1 .cse9 .cse15) 6442450941) .cse20 (<= 3 main_~i~1) (<= 0 (+ .cse1 8589934592 .cse9 .cse15 .cse19))) (and (<= 0 (+ .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 38654705664 .cse17 .cse18 .cse19)) (<= main_~i~1 17) (<= (+ .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) 36507221999) .cse20 (<= (+ .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) 38654705646) (<= 0 (+ .cse0 36507222016 .cse1 .cse2 .cse3 .cse4 .cse5 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18)) (<= 17 main_~i~1)) (and (<= 10 main_~i~1) (<= 0 (+ .cse1 .cse2 .cse4 .cse5 .cse8 .cse9 .cse11 .cse12 .cse15 21474836480 .cse16)) (<= 0 (+ .cse1 .cse2 .cse4 .cse5 .cse8 .cse9 23622320128 .cse11 .cse12 .cse15 .cse16 .cse19)) (<= (+ .cse1 .cse2 .cse4 .cse5 .cse8 .cse9 .cse11 .cse12 .cse15 .cse16 .cse19) 23622320117) .cse20 (<= main_~i~1 10) (<= (+ .cse1 .cse2 .cse4 .cse5 .cse8 .cse9 .cse11 .cse12 .cse15 .cse16) 21474836470)) (and (<= 0 (+ 17179869184 .cse1 .cse2 .cse5 .cse9 .cse11 .cse12 .cse15 .cse19)) (<= main_~i~1 7) (<= (+ .cse1 .cse2 .cse5 .cse9 .cse11 .cse12 .cse15 .cse19) 17179869176) (<= 7 main_~i~1) (<= 0 (+ .cse1 .cse2 15032385536 .cse5 .cse9 .cse11 .cse12 .cse15)) (<= (+ .cse1 .cse2 .cse5 .cse9 .cse11 .cse12 .cse15) 15032385529) .cse20) (and (<= main_~i~1 5) (<= 5 main_~i~1) (<= (+ .cse1 .cse2 .cse9 .cse11 .cse15 .cse19) 12884901882) (<= (+ .cse1 .cse2 .cse9 .cse11 .cse15) 10737418235) .cse20 (<= 0 (+ .cse1 .cse2 10737418240 .cse9 .cse11 .cse15)) (<= 0 (+ .cse1 .cse2 .cse9 .cse11 12884901888 .cse15 .cse19))) (and (<= main_~i~1 13) (<= (+ .cse22 1) main_~i~1) (<= (+ .cse0 .cse1 .cse2 .cse4 .cse5 .cse8 .cse9 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse19) 30064771058) (<= 0 (+ .cse0 .cse1 30064771072 .cse2 .cse4 .cse5 .cse8 .cse9 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse19)) .cse20 (<= 0 (+ .cse0 .cse1 .cse2 .cse4 .cse5 .cse8 .cse9 .cse11 .cse12 .cse14 .cse15 .cse16 27917287424 .cse17)) (<= (+ .cse0 .cse1 .cse2 .cse4 .cse5 .cse8 .cse9 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17) 27917287411)) (and (<= (+ .cse1 .cse15) 4294967294) (<= main_~i~1 2) .cse20 (<= 2 main_~i~1) (<= 0 (+ .cse1 4294967296 .cse15)) (<= (+ .cse1 .cse15 .cse19) 6442450941) (<= 0 (+ .cse1 .cse15 6442450944 .cse19))) (and (<= (+ .cse0 .cse1 .cse2 .cse4 .cse5 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) 34359738352) (<= 0 (+ .cse0 36507222016 .cse1 .cse2 .cse4 .cse5 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19)) (<= main_~i~1 16) (<= 16 main_~i~1) .cse20 (<= (+ .cse0 .cse1 .cse2 .cse4 .cse5 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) 36507221999) (<= 0 (+ .cse0 .cse1 .cse2 .cse4 .cse5 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 34359738368 .cse15 .cse16 .cse17 .cse18))) (and (<= 0 (+ .cse15 2147483648)) (<= 1 main_~i~1) (<= 0 (+ 4294967296 .cse15 .cse19)) (<= (+ .cse15 .cse19) 4294967294) (<= .cse15 2147483647) (<= main_~i~1 1) .cse20) (and (<= 0 (+ .cse1 .cse2 .cse4 25769803776 .cse5 .cse8 .cse9 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17)) (<= (+ .cse1 .cse2 .cse4 .cse5 .cse8 .cse9 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17) 25769803764) (<= 0 (+ .cse1 .cse2 .cse4 .cse5 .cse8 .cse9 .cse11 .cse12 .cse14 .cse15 .cse16 27917287424 .cse17 .cse19)) (<= (+ .cse1 .cse2 .cse4 .cse5 .cse8 .cse9 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse19) 27917287411) (<= .cse23 48) .cse20 (<= 12 main_~i~1)) (and (<= (+ .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) 40802189293) (<= 0 (+ .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 38654705664 .cse17 .cse18)) (<= (+ .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) 38654705646) .cse20 (<= main_~i~1 18) (<= 0 (+ .cse0 .cse1 40802189312 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19)) (<= (+ .cse22 6) main_~i~1)) (and (<= .cse19 2147483647) (<= 0 (+ 2147483648 .cse19)) .cse20 (= main_~i~1 0)) (and (<= (+ .cse1 .cse2 .cse4 .cse5 .cse8 .cse9 .cse11 .cse12 .cse14 .cse15 .cse16 .cse19) 25769803764) (<= (+ .cse1 .cse2 .cse4 .cse5 .cse8 .cse9 .cse11 .cse12 .cse14 .cse15 .cse16) 23622320117) (<= 11 main_~i~1) .cse20 (<= 0 (+ .cse1 .cse2 .cse4 25769803776 .cse5 .cse8 .cse9 .cse11 .cse12 .cse14 .cse15 .cse16 .cse19)) (<= 0 (+ .cse1 .cse2 .cse4 .cse5 .cse8 .cse9 23622320128 .cse11 .cse12 .cse14 .cse15 .cse16)) (<= main_~i~1 11)) (and (<= 0 (+ .cse1 .cse2 .cse4 .cse5 .cse8 .cse9 19327352832 .cse11 .cse12 .cse15)) (<= 0 (+ .cse1 .cse2 .cse4 .cse5 .cse8 .cse9 .cse11 .cse12 .cse15 21474836480 .cse19)) (<= (+ .cse1 .cse2 .cse4 .cse5 .cse8 .cse9 .cse11 .cse12 .cse15) 19327352823) (<= (+ .cse1 .cse2 .cse4 .cse5 .cse8 .cse9 .cse11 .cse12 .cse15 .cse19) 21474836470) (<= main_~i~1 9) (<= 9 main_~i~1) .cse20) (and (<= 6 main_~i~1) (<= 0 (+ .cse1 .cse2 15032385536 .cse5 .cse9 .cse11 .cse15 .cse19)) .cse20 (<= main_~i~1 6) (<= (+ .cse1 .cse2 .cse5 .cse9 .cse11 .cse15 .cse19) 15032385529) (<= (+ .cse1 .cse2 .cse5 .cse9 .cse11 .cse15) 12884901882) (<= 0 (+ .cse1 .cse2 .cse5 .cse9 .cse11 12884901888 .cse15))) (and (<= 0 (+ .cse0 .cse1 .cse2 .cse4 .cse5 .cse8 .cse9 32212254720 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19)) (<= (+ .cse0 .cse1 .cse2 .cse4 .cse5 .cse8 .cse9 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) 32212254705) (<= 0 (+ .cse0 .cse1 30064771072 .cse2 .cse4 .cse5 .cse8 .cse9 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18)) (<= 14 main_~i~1) (<= (+ .cse0 .cse1 .cse2 .cse4 .cse5 .cse8 .cse9 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18) 30064771058) .cse20 (<= main_~i~1 14)) (and (<= (+ .cse1 .cse2 .cse5 .cse8 .cse9 .cse11 .cse12 .cse15 .cse19) 19327352823) (<= main_~i~1 8) (<= 0 (+ .cse1 .cse2 .cse5 .cse8 .cse9 19327352832 .cse11 .cse12 .cse15 .cse19)) (<= 8 main_~i~1) (<= 0 (+ 17179869184 .cse1 .cse2 .cse5 .cse8 .cse9 .cse11 .cse12 .cse15)) .cse20 (<= (+ .cse1 .cse2 .cse5 .cse8 .cse9 .cse11 .cse12 .cse15) 17179869176)) (and (<= (+ .cse0 .cse1 .cse2 .cse4 .cse5 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) 34359738352) (<= (+ .cse0 .cse1 .cse2 .cse4 .cse5 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18) 32212254705) (<= main_~i~1 15) (<= 0 (+ .cse0 .cse1 .cse2 .cse4 .cse5 .cse8 .cse9 32212254720 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18)) (<= 0 (+ .cse0 .cse1 .cse2 .cse4 .cse5 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 34359738368 .cse15 .cse16 .cse17 .cse18 .cse19)) (<= (+ .cse22 3) main_~i~1) .cse20) (and (<= (+ .cse1 .cse9 .cse11 .cse15 .cse19) 10737418235) (<= 4 main_~i~1) .cse20 (<= (+ .cse1 .cse9 .cse11 .cse15) 8589934588) (<= 0 (+ .cse1 10737418240 .cse9 .cse11 .cse15 .cse19)) (<= 0 (+ .cse1 8589934592 .cse9 .cse11 .cse15)) (<= main_~i~1 4))))) [2022-01-31 18:37:51,888 INFO L854 garLoopResultBuilder]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 50) the Hoare annotation is: false [2022-01-31 18:37:51,888 INFO L854 garLoopResultBuilder]: At program point L34-3(lines 34 36) the Hoare annotation is: (let ((.cse21 (select |#memory_int| |main_~#x~0.base|))) (let ((.cse15 (select .cse21 (+ |main_~#x~0.offset| 68))) (.cse16 (select .cse21 (+ |main_~#x~0.offset| 72))) (.cse22 (div (+ 48 (* (- 1) |main_~#x~0.offset|)) 4)) (.cse0 (= |main_~#x~0.offset| 0)) (.cse12 (select .cse21 48)) (.cse1 (select .cse21 (+ |main_~#x~0.offset| 4))) (.cse5 (select .cse21 (+ |main_~#x~0.offset| 16))) (.cse14 (select .cse21 (+ |main_~#x~0.offset| 64))) (.cse6 (select .cse21 (+ |main_~#x~0.offset| 32))) (.cse7 (select .cse21 (+ |main_~#x~0.offset| 20))) (.cse8 (select .cse21 (+ |main_~#x~0.offset| 28))) (.cse2 (select .cse21 (+ |main_~#x~0.offset| 8))) (.cse17 (select .cse21 (+ 56 |main_~#x~0.offset|))) (.cse3 (select .cse21 (+ |main_~#x~0.offset| 12))) (.cse9 (select .cse21 (+ |main_~#x~0.offset| 24))) (.cse18 (select .cse21 (+ |main_~#x~0.offset| 60))) (.cse10 (select .cse21 (+ |main_~#x~0.offset| 40))) (.cse4 (select .cse21 |main_~#x~0.offset|)) (.cse11 (select .cse21 (+ |main_~#x~0.offset| 36))) (.cse19 (select .cse21 (+ |main_~#x~0.offset| 44))) (.cse20 (select .cse21 (+ |main_~#x~0.offset| 52)))) (or (and (<= 4 main_~i~1) .cse0 (<= (+ .cse1 .cse2 .cse3 .cse4) 8589934588) (<= 0 (+ .cse1 8589934592 .cse2 .cse3 .cse4)) (<= main_~i~1 4)) (and (<= (+ .cse1 .cse5 .cse6 .cse7 .cse8 .cse2 .cse3 .cse9 .cse10 .cse4 .cse11) 23622320117) (<= 11 main_~i~1) .cse0 (<= 0 (+ .cse1 .cse5 .cse6 .cse7 .cse8 .cse2 23622320128 .cse3 .cse9 .cse10 .cse4 .cse11)) (<= main_~i~1 11)) (and (<= main_~i~1 7) (<= 7 main_~i~1) (<= 0 (+ .cse1 .cse5 15032385536 .cse7 .cse2 .cse3 .cse9 .cse4)) (<= (+ .cse1 .cse5 .cse7 .cse2 .cse3 .cse9 .cse4) 15032385529) .cse0) (let ((.cse13 (select .cse21 (+ |main_~#x~0.offset| 76)))) (and (<= 20 main_~i~1) (<= 0 (+ .cse12 .cse1 .cse13 42949672960 .cse5 .cse14 .cse6 .cse7 .cse15 .cse16 .cse8 .cse2 .cse17 .cse3 .cse9 .cse18 .cse10 .cse4 .cse11 .cse19 .cse20)) (<= (+ .cse12 .cse1 .cse13 .cse5 .cse14 .cse6 .cse7 .cse15 .cse16 .cse8 .cse2 .cse17 .cse3 .cse9 .cse18 .cse10 .cse4 .cse11 .cse19 .cse20) 42949672940) .cse0)) (and (<= (+ .cse1 .cse4) 4294967294) (<= main_~i~1 2) .cse0 (<= 2 main_~i~1) (<= 0 (+ .cse1 4294967296 .cse4))) (and (<= 0 (+ .cse12 .cse1 .cse5 .cse14 .cse6 .cse7 .cse15 .cse8 .cse2 .cse17 .cse3 .cse9 .cse18 .cse10 .cse4 .cse11 38654705664 .cse19 .cse20)) (<= (+ .cse12 .cse1 .cse5 .cse14 .cse6 .cse7 .cse15 .cse8 .cse2 .cse17 .cse3 .cse9 .cse18 .cse10 .cse4 .cse11 .cse19 .cse20) 38654705646) .cse0 (<= main_~i~1 18) (<= (+ .cse22 6) main_~i~1)) (and (<= 0 (+ .cse1 .cse5 .cse6 25769803776 .cse7 .cse8 .cse2 .cse3 .cse9 .cse10 .cse4 .cse11 .cse19)) (<= (+ .cse1 .cse5 .cse6 .cse7 .cse8 .cse2 .cse3 .cse9 .cse10 .cse4 .cse11 .cse19) 25769803764) (<= (+ |main_~#x~0.offset| (* main_~i~1 4)) 48) .cse0 (<= 12 main_~i~1)) (and .cse0 (= main_~i~1 0)) (and (<= 0 (+ .cse12 .cse1 30064771072 .cse5 .cse6 .cse7 .cse8 .cse2 .cse3 .cse9 .cse10 .cse4 .cse11 .cse19 .cse20)) (<= 14 main_~i~1) (<= (+ .cse12 .cse1 .cse5 .cse6 .cse7 .cse8 .cse2 .cse3 .cse9 .cse10 .cse4 .cse11 .cse19 .cse20) 30064771058) .cse0 (<= main_~i~1 14)) (and (<= 0 (+ .cse1 .cse2 .cse4 6442450944)) (<= main_~i~1 3) (<= (+ .cse1 .cse2 .cse4) 6442450941) .cse0 (<= 3 main_~i~1)) (and (<= main_~i~1 5) (<= 5 main_~i~1) (<= (+ .cse1 .cse5 .cse2 .cse3 .cse4) 10737418235) .cse0 (<= 0 (+ .cse1 .cse5 10737418240 .cse2 .cse3 .cse4))) (and (<= main_~i~1 8) (<= 8 main_~i~1) (<= 0 (+ 17179869184 .cse1 .cse5 .cse7 .cse8 .cse2 .cse3 .cse9 .cse4)) .cse0 (<= (+ .cse1 .cse5 .cse7 .cse8 .cse2 .cse3 .cse9 .cse4) 17179869176)) (and (<= (+ .cse12 .cse1 .cse5 .cse6 .cse7 .cse8 .cse2 .cse17 .cse3 .cse9 .cse18 .cse10 .cse4 .cse11 .cse19 .cse20) 34359738352) (<= main_~i~1 16) (<= 16 main_~i~1) .cse0 (<= 0 (+ .cse12 .cse1 .cse5 .cse6 .cse7 .cse8 .cse2 .cse17 .cse3 .cse9 .cse18 .cse10 34359738368 .cse4 .cse11 .cse19 .cse20))) (and (<= 6 main_~i~1) .cse0 (<= main_~i~1 6) (<= (+ .cse1 .cse5 .cse7 .cse2 .cse3 .cse4) 12884901882) (<= 0 (+ .cse1 .cse5 .cse7 .cse2 .cse3 12884901888 .cse4))) (and (<= 0 (+ .cse1 .cse5 .cse6 .cse7 .cse8 .cse2 19327352832 .cse3 .cse9 .cse4)) (<= (+ .cse1 .cse5 .cse6 .cse7 .cse8 .cse2 .cse3 .cse9 .cse4) 19327352823) (<= main_~i~1 9) (<= 9 main_~i~1) .cse0) (and (<= main_~i~1 13) (<= (+ .cse22 1) main_~i~1) .cse0 (<= 0 (+ .cse12 .cse1 .cse5 .cse6 .cse7 .cse8 .cse2 .cse3 .cse9 .cse10 .cse4 .cse11 27917287424 .cse19)) (<= (+ .cse12 .cse1 .cse5 .cse6 .cse7 .cse8 .cse2 .cse3 .cse9 .cse10 .cse4 .cse11 .cse19) 27917287411)) (and (<= 19 main_~i~1) (<= 0 (+ .cse12 .cse1 40802189312 .cse5 .cse14 .cse6 .cse7 .cse15 .cse16 .cse8 .cse2 .cse17 .cse3 .cse9 .cse18 .cse10 .cse4 .cse11 .cse19 .cse20)) (<= main_~i~1 19) (<= (+ .cse12 .cse1 .cse5 .cse14 .cse6 .cse7 .cse15 .cse16 .cse8 .cse2 .cse17 .cse3 .cse9 .cse18 .cse10 .cse4 .cse11 .cse19 .cse20) 40802189293) .cse0) (and (<= 0 (+ .cse4 2147483648)) (<= 1 main_~i~1) (<= .cse4 2147483647) (<= main_~i~1 1) .cse0) (and (<= 10 main_~i~1) (<= 0 (+ .cse1 .cse5 .cse6 .cse7 .cse8 .cse2 .cse3 .cse9 .cse4 21474836480 .cse11)) .cse0 (<= main_~i~1 10) (<= (+ .cse1 .cse5 .cse6 .cse7 .cse8 .cse2 .cse3 .cse9 .cse4 .cse11) 21474836470)) (and (<= (+ .cse12 .cse1 .cse5 .cse6 .cse7 .cse8 .cse2 .cse17 .cse3 .cse9 .cse10 .cse4 .cse11 .cse19 .cse20) 32212254705) (<= main_~i~1 15) (<= 0 (+ .cse12 .cse1 .cse5 .cse6 .cse7 .cse8 .cse2 32212254720 .cse17 .cse3 .cse9 .cse10 .cse4 .cse11 .cse19 .cse20)) (<= (+ .cse22 3) main_~i~1) .cse0) (and (<= main_~i~1 17) (<= (+ .cse12 .cse1 .cse5 .cse14 .cse6 .cse7 .cse8 .cse2 .cse17 .cse3 .cse9 .cse18 .cse10 .cse4 .cse11 .cse19 .cse20) 36507221999) .cse0 (<= 0 (+ .cse12 36507222016 .cse1 .cse5 .cse14 .cse6 .cse7 .cse8 .cse2 .cse17 .cse3 .cse9 .cse18 .cse10 .cse4 .cse11 .cse19 .cse20)) (<= 17 main_~i~1))))) [2022-01-31 18:37:51,888 INFO L854 garLoopResultBuilder]: At program point L34-4(lines 34 36) the Hoare annotation is: (let ((.cse20 (select |#memory_int| |main_~#x~0.base|))) (let ((.cse0 (select .cse20 48)) (.cse1 (select .cse20 (+ |main_~#x~0.offset| 4))) (.cse2 (select .cse20 (+ |main_~#x~0.offset| 76))) (.cse3 (select .cse20 (+ |main_~#x~0.offset| 16))) (.cse4 (select .cse20 (+ |main_~#x~0.offset| 64))) (.cse5 (select .cse20 (+ |main_~#x~0.offset| 32))) (.cse6 (select .cse20 (+ |main_~#x~0.offset| 20))) (.cse7 (select .cse20 (+ |main_~#x~0.offset| 68))) (.cse8 (select .cse20 (+ |main_~#x~0.offset| 72))) (.cse9 (select .cse20 (+ |main_~#x~0.offset| 28))) (.cse10 (select .cse20 (+ |main_~#x~0.offset| 8))) (.cse11 (select .cse20 (+ 56 |main_~#x~0.offset|))) (.cse12 (select .cse20 (+ |main_~#x~0.offset| 12))) (.cse13 (select .cse20 (+ |main_~#x~0.offset| 24))) (.cse14 (select .cse20 (+ |main_~#x~0.offset| 60))) (.cse15 (select .cse20 (+ |main_~#x~0.offset| 40))) (.cse16 (select .cse20 |main_~#x~0.offset|)) (.cse17 (select .cse20 (+ |main_~#x~0.offset| 36))) (.cse18 (select .cse20 (+ |main_~#x~0.offset| 44))) (.cse19 (select .cse20 (+ |main_~#x~0.offset| 52)))) (and (<= 0 (+ .cse0 .cse1 .cse2 42949672960 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19)) (<= (+ .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) 42949672940) (= |main_~#x~0.offset| 0)))) [2022-01-31 18:37:51,888 INFO L861 garLoopResultBuilder]: At program point mainENTRY(lines 26 53) the Hoare annotation is: true [2022-01-31 18:37:51,889 INFO L854 garLoopResultBuilder]: At program point L49(lines 49 51) the Hoare annotation is: (let ((.cse27 (select |#memory_int| |main_~#x~0.base|))) (let ((.cse3 (select .cse27 48)) (.cse4 (select .cse27 (+ |main_~#x~0.offset| 16))) (.cse5 (select .cse27 (+ |main_~#x~0.offset| 64))) (.cse6 (select .cse27 (+ |main_~#x~0.offset| 32))) (.cse7 (select .cse27 (+ |main_~#x~0.offset| 20))) (.cse8 (select .cse27 (+ |main_~#x~0.offset| 68))) (.cse9 (select .cse27 (+ |main_~#x~0.offset| 72))) (.cse10 (select .cse27 (+ |main_~#x~0.offset| 28))) (.cse11 (select .cse27 4)) (.cse12 (select .cse27 (+ |main_~#x~0.offset| 8))) (.cse13 (select .cse27 (+ 56 |main_~#x~0.offset|))) (.cse14 (select .cse27 (+ |main_~#x~0.offset| 12))) (.cse15 (select .cse27 (+ |main_~#x~0.offset| 24))) (.cse16 (select .cse27 (+ |main_~#x~0.offset| 60))) (.cse17 (select .cse27 (+ |main_~#x~0.offset| 40))) (.cse18 (select .cse27 0)) (.cse19 (select .cse27 (+ |main_~#x~0.offset| 36))) (.cse20 (select .cse27 (+ |main_~#x~0.offset| 44))) (.cse21 (select .cse27 (+ |main_~#x~0.offset| 52)))) (and (let ((.cse0 (+ .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 main_~temp~0 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21))) (let ((.cse22 (div .cse0 20))) (let ((.cse1 (= main_~ret~1 .cse22)) (.cse2 (<= 0 (+ .cse3 42949672960 .cse4 .cse5 .cse6 .cse7 .cse8 main_~temp~0 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21)))) (or (and (<= 0 .cse0) (<= .cse0 42949672940) .cse1) (and .cse2 (<= (div (+ .cse3 19 .cse4 .cse5 .cse6 .cse7 .cse8 main_~temp~0 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) 20) .cse22) (<= (+ .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 main_~temp~0 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 20 .cse17 .cse18 .cse19 .cse20 .cse21) 0) .cse1) (and (<= (+ .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 main_~temp~0 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 1) 0) (<= .cse0 (+ 19 (* (div (+ (- 1) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 main_~temp~0 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) 20) 20))) .cse2 (= (+ .cse22 1) main_~ret~1)))))) (let ((.cse23 (select .cse27 (+ |main_~#x~0.offset| 76)))) (let ((.cse24 (+ .cse3 .cse23 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21))) (let ((.cse25 (div .cse24 20))) (let ((.cse26 (= main_~ret~1 .cse25))) (or (and (<= (+ .cse3 .cse23 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 1) 0) (<= .cse24 (+ 19 (* (div (+ (- 1) .cse3 .cse23 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) 20) 20))) (<= 0 (+ .cse3 .cse23 42949672960 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21)) (= (+ .cse25 1) main_~ret~1)) (and (<= (div (+ .cse3 .cse23 19 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) 20) .cse25) .cse26) (and (<= 0 .cse24) (<= .cse24 42949672940) .cse26)))))) (= |main_~#x~0.offset| 0) (= main_~ret~1 main_~ret5~0) (= main_~ret~1 main_~ret2~0)))) [2022-01-31 18:37:51,889 INFO L854 garLoopResultBuilder]: At program point L47(line 47) the Hoare annotation is: (let ((.cse23 (select |#memory_int| |main_~#x~0.base|))) (let ((.cse0 (select .cse23 48)) (.cse2 (select .cse23 (+ |main_~#x~0.offset| 16))) (.cse3 (select .cse23 (+ |main_~#x~0.offset| 64))) (.cse4 (select .cse23 (+ |main_~#x~0.offset| 32))) (.cse5 (select .cse23 (+ |main_~#x~0.offset| 20))) (.cse6 (select .cse23 (+ |main_~#x~0.offset| 68))) (.cse7 (select .cse23 (+ |main_~#x~0.offset| 72))) (.cse8 (select .cse23 (+ |main_~#x~0.offset| 28))) (.cse9 (select .cse23 4)) (.cse10 (select .cse23 (+ |main_~#x~0.offset| 8))) (.cse11 (select .cse23 (+ 56 |main_~#x~0.offset|))) (.cse12 (select .cse23 (+ |main_~#x~0.offset| 12))) (.cse13 (select .cse23 (+ |main_~#x~0.offset| 24))) (.cse14 (select .cse23 (+ |main_~#x~0.offset| 60))) (.cse15 (select .cse23 (+ |main_~#x~0.offset| 40))) (.cse16 (select .cse23 0)) (.cse17 (select .cse23 (+ |main_~#x~0.offset| 36))) (.cse18 (select .cse23 (+ |main_~#x~0.offset| 44))) (.cse19 (select .cse23 (+ |main_~#x~0.offset| 52)))) (and (<= 19 main_~i~2) (let ((.cse1 (select .cse23 (+ |main_~#x~0.offset| 76)))) (let ((.cse20 (+ .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19))) (let ((.cse21 (div .cse20 20))) (let ((.cse22 (= main_~ret~1 .cse21))) (or (and (<= (+ .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 1) 0) (<= .cse20 (+ 19 (* (div (+ (- 1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) 20) 20))) (<= 0 (+ .cse0 .cse1 42949672960 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19)) (= (+ .cse21 1) main_~ret~1)) (and (<= (div (+ .cse0 .cse1 19 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) 20) .cse21) .cse22) (and (<= 0 .cse20) (<= .cse20 42949672940) .cse22)))))) (= |main_~#x~0.offset| 0) (let ((.cse24 (+ .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 main_~temp~0 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19))) (let ((.cse26 (div .cse24 20))) (let ((.cse25 (<= 0 (+ .cse0 42949672960 .cse2 .cse3 .cse4 .cse5 .cse6 main_~temp~0 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19))) (.cse28 (= main_~ret~1 .cse26)) (.cse27 (= main_~ret~1 main_~ret2~0))) (or (and (<= (+ .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 main_~temp~0 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 1) 0) (<= .cse24 (+ 19 (* (div (+ (- 1) .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 main_~temp~0 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) 20) 20))) .cse25 (= (+ .cse26 1) main_~ret~1) .cse27) (and .cse25 (<= (div (+ .cse0 19 .cse2 .cse3 .cse4 .cse5 .cse6 main_~temp~0 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) 20) .cse26) (<= (+ .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 main_~temp~0 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 20 .cse15 .cse16 .cse17 .cse18 .cse19) 0) .cse28 .cse27) (and (<= 0 .cse24) (<= .cse24 42949672940) .cse28 .cse27)))))))) [2022-01-31 18:37:51,889 INFO L861 garLoopResultBuilder]: At program point L49-2(lines 49 51) the Hoare annotation is: true [2022-01-31 18:37:51,889 INFO L854 garLoopResultBuilder]: At program point L47-1(line 47) the Hoare annotation is: (let ((.cse23 (select |#memory_int| |main_~#x~0.base|))) (let ((.cse0 (select .cse23 48)) (.cse2 (select .cse23 (+ |main_~#x~0.offset| 16))) (.cse3 (select .cse23 (+ |main_~#x~0.offset| 64))) (.cse4 (select .cse23 (+ |main_~#x~0.offset| 32))) (.cse5 (select .cse23 (+ |main_~#x~0.offset| 20))) (.cse6 (select .cse23 (+ |main_~#x~0.offset| 68))) (.cse7 (select .cse23 (+ |main_~#x~0.offset| 72))) (.cse8 (select .cse23 (+ |main_~#x~0.offset| 28))) (.cse9 (select .cse23 4)) (.cse10 (select .cse23 (+ |main_~#x~0.offset| 8))) (.cse11 (select .cse23 (+ 56 |main_~#x~0.offset|))) (.cse12 (select .cse23 (+ |main_~#x~0.offset| 12))) (.cse13 (select .cse23 (+ |main_~#x~0.offset| 24))) (.cse14 (select .cse23 (+ |main_~#x~0.offset| 60))) (.cse15 (select .cse23 (+ |main_~#x~0.offset| 40))) (.cse16 (select .cse23 0)) (.cse17 (select .cse23 (+ |main_~#x~0.offset| 36))) (.cse18 (select .cse23 (+ |main_~#x~0.offset| 44))) (.cse19 (select .cse23 (+ |main_~#x~0.offset| 52)))) (and (let ((.cse1 (select .cse23 (+ |main_~#x~0.offset| 76)))) (let ((.cse20 (+ .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19))) (let ((.cse21 (div .cse20 20))) (let ((.cse22 (= main_~ret~1 .cse21))) (or (and (<= (+ .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 1) 0) (<= .cse20 (+ 19 (* (div (+ (- 1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) 20) 20))) (<= 0 (+ .cse0 .cse1 42949672960 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19)) (= (+ .cse21 1) main_~ret~1)) (and (<= (div (+ .cse0 .cse1 19 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) 20) .cse21) .cse22) (and (<= 0 .cse20) (<= .cse20 42949672940) .cse22)))))) (= |main_~#x~0.offset| 0) (or (<= 2147483648 |main_#t~ret12|) (<= (+ |main_#t~ret12| 2147483649) 0) (= |main_#t~ret12| main_~ret~1)) (let ((.cse24 (+ .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 main_~temp~0 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19))) (let ((.cse26 (div .cse24 20))) (let ((.cse25 (<= 0 (+ .cse0 42949672960 .cse2 .cse3 .cse4 .cse5 .cse6 main_~temp~0 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19))) (.cse28 (= main_~ret~1 .cse26)) (.cse27 (= main_~ret~1 main_~ret2~0))) (or (and (<= (+ .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 main_~temp~0 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 1) 0) (<= .cse24 (+ 19 (* (div (+ (- 1) .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 main_~temp~0 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) 20) 20))) .cse25 (= (+ .cse26 1) main_~ret~1) .cse27) (and .cse25 (<= (div (+ .cse0 19 .cse2 .cse3 .cse4 .cse5 .cse6 main_~temp~0 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) 20) .cse26) (<= (+ .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 main_~temp~0 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 20 .cse15 .cse16 .cse17 .cse18 .cse19) 0) .cse28 .cse27) (and (<= 0 .cse24) (<= .cse24 42949672940) .cse28 .cse27)))))))) [2022-01-31 18:37:51,889 INFO L854 garLoopResultBuilder]: At program point L41(line 41) the Hoare annotation is: (and (= |main_~#x~0.offset| 0) (let ((.cse24 (select |#memory_int| |main_~#x~0.base|))) (let ((.cse2 (select .cse24 48)) (.cse3 (select .cse24 (+ |main_~#x~0.offset| 4))) (.cse4 (select .cse24 (+ |main_~#x~0.offset| 76))) (.cse5 (select .cse24 (+ |main_~#x~0.offset| 16))) (.cse6 (select .cse24 (+ |main_~#x~0.offset| 64))) (.cse7 (select .cse24 (+ |main_~#x~0.offset| 32))) (.cse8 (select .cse24 (+ |main_~#x~0.offset| 20))) (.cse9 (select .cse24 (+ |main_~#x~0.offset| 68))) (.cse10 (select .cse24 (+ |main_~#x~0.offset| 72))) (.cse11 (select .cse24 (+ |main_~#x~0.offset| 28))) (.cse12 (select .cse24 (+ |main_~#x~0.offset| 8))) (.cse13 (select .cse24 (+ 56 |main_~#x~0.offset|))) (.cse14 (select .cse24 (+ |main_~#x~0.offset| 12))) (.cse15 (select .cse24 (+ |main_~#x~0.offset| 24))) (.cse16 (select .cse24 (+ |main_~#x~0.offset| 60))) (.cse17 (select .cse24 (+ |main_~#x~0.offset| 40))) (.cse18 (select .cse24 |main_~#x~0.offset|)) (.cse19 (select .cse24 (+ |main_~#x~0.offset| 36))) (.cse20 (select .cse24 (+ |main_~#x~0.offset| 44))) (.cse21 (select .cse24 (+ |main_~#x~0.offset| 52)))) (let ((.cse0 (+ .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21))) (let ((.cse23 (div .cse0 20))) (let ((.cse22 (+ .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 20 .cse17 .cse18 .cse19 .cse20 .cse21)) (.cse1 (= main_~ret~1 .cse23))) (or (and (<= 0 .cse0) (<= .cse0 42949672940) .cse1) (and (<= 0 (+ .cse2 .cse3 .cse4 42949672960 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21)) (<= (+ .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 1) 0) (<= .cse0 (+ 19 (* (div (+ (- 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) 20) 20))) (= main_~ret~1 (div .cse22 20))) (and (<= .cse22 0) .cse1 (<= (div (+ .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (- 85899345901) .cse17 .cse18 .cse19 .cse20 .cse21 (* (div (+ .cse2 .cse3 .cse4 .cse5 (- 42949672960) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) 85899345920) (- 85899345920))) 20) .cse23))))))))) [2022-01-31 18:37:51,891 INFO L854 garLoopResultBuilder]: At program point L43-2(lines 43 45) the Hoare annotation is: (let ((.cse29 (* main_~i~2 4))) (let ((.cse142 (+ |main_~#x~0.offset| 60)) (.cse52 (+ |main_~#x~0.offset| .cse29)) (.cse28 (select |#memory_int| |main_~#x~0.base|))) (let ((.cse4 (select .cse28 (+ |main_~#x~0.offset| .cse29 32))) (.cse15 (select .cse28 (+ |main_~#x~0.offset| 40 .cse29))) (.cse46 (select .cse28 (+ |main_~#x~0.offset| 40))) (.cse55 (select .cse28 (+ |main_~#x~0.offset| .cse29 68))) (.cse3 (select .cse28 (+ |main_~#x~0.offset| .cse29 20))) (.cse5 (select .cse28 (+ |main_~#x~0.offset| .cse29 16))) (.cse30 (select .cse28 (+ |main_~#x~0.offset| .cse29 36))) (.cse6 (select .cse28 (+ 56 |main_~#x~0.offset| .cse29))) (.cse9 (select .cse28 (+ |main_~#x~0.offset| .cse29 44))) (.cse10 (select .cse28 (+ |main_~#x~0.offset| .cse29 48))) (.cse11 (select .cse28 (+ |main_~#x~0.offset| .cse29 24))) (.cse12 (select .cse28 (+ |main_~#x~0.offset| .cse29 12))) (.cse13 (select .cse28 4)) (.cse16 (select .cse28 (+ |main_~#x~0.offset| .cse29 60))) (.cse32 (select .cse28 (+ |main_~#x~0.offset| .cse29 28))) (.cse17 (select .cse28 (+ |main_~#x~0.offset| .cse29 64))) (.cse18 (select .cse28 (+ |main_~#x~0.offset| .cse29 8))) (.cse19 (select .cse28 (+ |main_~#x~0.offset| .cse29 52))) (.cse20 (select .cse28 0)) (.cse7 (select .cse28 (+ |main_~#x~0.offset| .cse29 4))) (.cse27 (= |main_~#x~0.offset| 0)) (.cse24 (= main_~ret~1 main_~ret2~0)) (.cse2 (select .cse28 48)) (.cse25 (select .cse28 .cse52)) (.cse41 (select .cse28 (+ |main_~#x~0.offset| 16))) (.cse66 (select .cse28 (+ |main_~#x~0.offset| 64))) (.cse42 (select .cse28 (+ |main_~#x~0.offset| 32))) (.cse43 (select .cse28 (+ |main_~#x~0.offset| 20))) (.cse91 (select .cse28 (+ |main_~#x~0.offset| 68))) (.cse44 (select .cse28 (+ |main_~#x~0.offset| 28))) (.cse14 (select .cse28 (+ |main_~#x~0.offset| 8))) (.cse67 (select .cse28 (+ 56 |main_~#x~0.offset|))) (.cse33 (select .cse28 (+ |main_~#x~0.offset| 12))) (.cse45 (select .cse28 (+ |main_~#x~0.offset| 24))) (.cse68 (select .cse28 .cse142)) (.cse47 (select .cse28 (+ |main_~#x~0.offset| 36))) (.cse69 (select .cse28 (+ |main_~#x~0.offset| 44))) (.cse70 (select .cse28 (+ |main_~#x~0.offset| 52)))) (or (let ((.cse8 (select .cse28 (+ .cse29 28)))) (let ((.cse0 (+ .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 main_~temp~0 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20))) (let ((.cse21 (div .cse0 20))) (let ((.cse1 (= main_~ret~1 .cse21))) (and (<= .cse0 42949672940) (or .cse1 (<= .cse0 (+ (* (div (+ (- 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 main_~temp~0 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) 20) 20) 19))) (or (and (= main_~ret~1 (+ .cse21 1)) (<= (+ .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 main_~temp~0 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 1) 0)) (<= (div (+ .cse2 19 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 main_~temp~0 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) 20) .cse21) (and .cse1 (<= 0 .cse0))) (<= 0 (+ .cse2 42949672960 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 main_~temp~0 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20)) (<= 3 main_~i~2) (let ((.cse22 (+ .cse2 .cse25 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 main_~temp~0 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20))) (let ((.cse26 (div .cse22 20))) (let ((.cse23 (= main_~ret~1 .cse26))) (or (and (<= .cse22 42949672940) (<= 0 .cse22) .cse23 .cse24) (and (<= (div (+ .cse2 .cse25 19 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 main_~temp~0 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) 20) .cse26) .cse23 .cse24) (and (<= 0 (+ .cse2 .cse25 42949672960 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 main_~temp~0 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20)) (= main_~ret~1 (+ .cse26 1)) (<= (+ .cse2 .cse25 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 main_~temp~0 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 1) 0) (<= .cse22 (+ 19 (* (div (+ (- 1) .cse2 .cse25 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 main_~temp~0 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) 20) 20))) .cse24))))) .cse27 (<= main_~i~2 3)))))) (let ((.cse31 (select .cse28 (+ .cse29 24)))) (let ((.cse36 (+ .cse2 .cse3 .cse5 .cse30 .cse6 .cse7 .cse9 .cse10 main_~temp~0 .cse31 .cse12 .cse13 .cse14 .cse15 .cse16 .cse32 .cse33 .cse18 .cse19 .cse20)) (.cse34 (+ .cse2 .cse25 .cse3 .cse5 .cse30 .cse6 .cse9 .cse10 main_~temp~0 .cse31 .cse12 .cse13 .cse14 .cse15 .cse16 .cse32 .cse33 .cse18 .cse19 .cse20))) (let ((.cse39 (div .cse34 20)) (.cse38 (div .cse36 20))) (let ((.cse37 (= main_~ret~1 .cse38)) (.cse35 (= .cse39 main_~ret~1))) (and (<= main_~i~2 4) (<= 0 (+ .cse2 42949672960 .cse3 .cse5 .cse30 .cse6 .cse7 .cse9 .cse10 main_~temp~0 .cse31 .cse12 .cse13 .cse14 .cse15 .cse16 .cse32 .cse33 .cse18 .cse19 .cse20)) (<= .cse34 42949672940) (<= 4 main_~i~2) (or .cse35 (<= .cse34 (+ (* (div (+ (- 1) .cse2 .cse25 .cse3 .cse5 .cse30 .cse6 .cse9 .cse10 main_~temp~0 .cse31 .cse12 .cse13 .cse14 .cse15 .cse16 .cse32 .cse33 .cse18 .cse19 .cse20) 20) 20) 19))) (or (<= .cse36 (+ (* (div (+ (- 1) .cse2 .cse3 .cse5 .cse30 .cse6 .cse7 .cse9 .cse10 main_~temp~0 .cse31 .cse12 .cse13 .cse14 .cse15 .cse16 .cse32 .cse33 .cse18 .cse19 .cse20) 20) 20) 19)) .cse37) (or (and .cse37 (<= 0 .cse36)) (<= (div (+ .cse2 19 .cse3 .cse5 .cse30 .cse6 .cse7 .cse9 .cse10 main_~temp~0 .cse31 .cse12 .cse13 .cse14 .cse15 .cse16 .cse32 .cse33 .cse18 .cse19 .cse20) 20) .cse38) (and (<= (+ .cse2 .cse3 .cse5 .cse30 .cse6 .cse7 .cse9 .cse10 main_~temp~0 .cse31 .cse12 .cse13 .cse14 .cse15 .cse16 .cse32 .cse33 .cse18 .cse19 .cse20 1) 0) (= main_~ret~1 (+ .cse38 1)))) (<= 0 (+ .cse2 .cse25 42949672960 .cse3 .cse5 .cse30 .cse6 .cse9 .cse10 main_~temp~0 .cse31 .cse12 .cse13 .cse14 .cse15 .cse16 .cse32 .cse33 .cse18 .cse19 .cse20)) .cse27 (<= .cse36 42949672940) (or (and (<= (div (+ .cse2 .cse25 19 .cse3 .cse5 .cse30 .cse6 .cse9 .cse10 main_~temp~0 .cse31 .cse12 .cse13 .cse14 .cse15 .cse16 .cse32 .cse33 .cse18 .cse19 .cse20) 20) .cse39) .cse24) (and (<= (+ .cse2 .cse25 .cse3 .cse5 .cse30 .cse6 .cse9 .cse10 main_~temp~0 .cse31 .cse12 .cse13 .cse14 .cse15 .cse16 .cse32 .cse33 .cse18 .cse19 .cse20 1) 0) (= main_~ret~1 (+ .cse39 1)) .cse24) (and (<= 0 .cse34) .cse35 .cse24))))))) (let ((.cse49 (+ .cse25 .cse3 .cse41 .cse4 .cse42 .cse5 .cse43 main_~temp~0 .cse44 .cse11 .cse12 .cse13 .cse14 .cse32 .cse33 .cse45 .cse18 .cse46 .cse20 .cse47)) (.cse40 (+ .cse3 .cse41 .cse4 .cse42 .cse5 .cse43 .cse7 main_~temp~0 .cse44 .cse11 .cse12 .cse13 .cse14 .cse32 .cse33 .cse45 .cse18 .cse46 .cse20 .cse47))) (let ((.cse53 (div .cse40 20)) (.cse50 (div .cse49 20))) (let ((.cse51 (= main_~ret~1 .cse50)) (.cse48 (= main_~ret~1 .cse53))) (and (or (<= .cse40 (+ 19 (* 20 (div (+ (- 1) .cse3 .cse41 .cse4 .cse42 .cse5 .cse43 .cse7 main_~temp~0 .cse44 .cse11 .cse12 .cse13 .cse14 .cse32 .cse33 .cse45 .cse18 .cse46 .cse20 .cse47) 20)))) .cse48) (<= .cse49 42949672940) (or (<= (div (+ .cse25 19 .cse3 .cse41 .cse4 .cse42 .cse5 .cse43 main_~temp~0 .cse44 .cse11 .cse12 .cse13 .cse14 .cse32 .cse33 .cse45 .cse18 .cse46 .cse20 .cse47) 20) .cse50) (and (<= (+ .cse25 .cse3 .cse41 .cse4 .cse42 .cse5 .cse43 main_~temp~0 .cse44 .cse11 .cse12 .cse13 .cse14 .cse32 .cse33 .cse45 .cse18 .cse46 .cse20 .cse47 1) 0) (= main_~ret~1 (+ .cse50 1))) (and (<= 0 .cse49) .cse51)) (or (<= .cse49 (+ 19 (* (div (+ (- 1) .cse25 .cse3 .cse41 .cse4 .cse42 .cse5 .cse43 main_~temp~0 .cse44 .cse11 .cse12 .cse13 .cse14 .cse32 .cse33 .cse45 .cse18 .cse46 .cse20 .cse47) 20) 20))) .cse51) .cse27 (= 44 .cse52) (or (and (<= (+ .cse3 .cse41 .cse4 .cse42 .cse5 .cse43 .cse7 main_~temp~0 .cse44 .cse11 .cse12 .cse13 .cse14 .cse32 .cse33 .cse45 .cse18 .cse46 .cse20 .cse47 1) 0) (= main_~ret~1 (+ .cse53 1)) .cse24) (and .cse48 (<= 0 .cse40) .cse24) (and (<= (div (+ 19 .cse3 .cse41 .cse4 .cse42 .cse5 .cse43 .cse7 main_~temp~0 .cse44 .cse11 .cse12 .cse13 .cse14 .cse32 .cse33 .cse45 .cse18 .cse46 .cse20 .cse47) 20) .cse53) .cse24)) (<= .cse40 42949672940) (<= 0 (+ .cse25 42949672960 .cse3 .cse41 .cse4 .cse42 .cse5 .cse43 main_~temp~0 .cse44 .cse11 .cse12 .cse13 .cse14 .cse32 .cse33 .cse45 .cse18 .cse46 .cse20 .cse47)) (<= 0 (+ 42949672960 .cse3 .cse41 .cse4 .cse42 .cse5 .cse43 .cse7 main_~temp~0 .cse44 .cse11 .cse12 .cse13 .cse14 .cse32 .cse33 .cse45 .cse18 .cse46 .cse20 .cse47)))))) (let ((.cse56 (select .cse28 (+ |main_~#x~0.offset| .cse29 72))) (.cse57 (select .cse28 (+ .cse29 36)))) (and (<= main_~i~2 1) (<= 1 main_~i~2) (let ((.cse60 (+ .cse55 .cse2 .cse25 .cse3 .cse4 .cse5 .cse6 .cse10 main_~temp~0 .cse56 .cse11 .cse12 .cse15 .cse16 .cse32 .cse17 .cse18 .cse57 .cse19 .cse20))) (let ((.cse58 (div .cse60 20))) (let ((.cse59 (= .cse58 main_~ret~1)) (.cse54 (<= 0 (+ .cse55 .cse2 .cse25 42949672960 .cse3 .cse4 .cse5 .cse6 .cse10 main_~temp~0 .cse56 .cse11 .cse12 .cse15 .cse16 .cse32 .cse17 .cse18 .cse57 .cse19 .cse20)))) (or (and .cse54 (<= (div (+ .cse55 .cse2 .cse25 19 .cse3 .cse4 .cse5 .cse6 .cse10 main_~temp~0 .cse56 .cse11 .cse12 .cse15 .cse16 .cse32 .cse17 .cse18 .cse57 .cse19 .cse20) 20) .cse58) (<= (+ .cse55 .cse2 .cse25 .cse3 .cse4 .cse5 .cse6 .cse10 main_~temp~0 .cse56 .cse11 .cse12 .cse15 .cse16 .cse32 .cse17 .cse18 20 .cse57 .cse19 .cse20) 0) .cse24 .cse59) (and (<= 0 .cse60) (<= .cse60 42949672940) .cse24 .cse59) (and (<= (+ .cse55 .cse2 .cse25 .cse3 .cse4 .cse5 .cse6 .cse10 main_~temp~0 .cse56 .cse11 .cse12 .cse15 .cse16 .cse32 .cse17 .cse18 .cse57 .cse19 .cse20 1) 0) (= (+ .cse58 1) main_~ret~1) .cse54 (<= .cse60 (+ 19 (* 20 (div (+ .cse55 (- 1) .cse2 .cse25 .cse3 .cse4 .cse5 .cse6 .cse10 main_~temp~0 .cse56 .cse11 .cse12 .cse15 .cse16 .cse32 .cse17 .cse18 .cse57 .cse19 .cse20) 20)))) .cse24))))) (let ((.cse61 (+ .cse55 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 main_~temp~0 .cse56 .cse11 .cse12 .cse15 .cse16 .cse32 .cse17 .cse18 .cse57 .cse19 .cse20))) (let ((.cse62 (div .cse61 20))) (let ((.cse63 (= .cse62 main_~ret~1))) (or (and (<= (+ .cse55 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 main_~temp~0 .cse56 .cse11 .cse12 .cse15 .cse16 .cse32 .cse17 .cse18 .cse57 .cse19 .cse20 1) 0) (<= .cse61 (+ (* 20 (div (+ .cse55 (- 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 main_~temp~0 .cse56 .cse11 .cse12 .cse15 .cse16 .cse32 .cse17 .cse18 .cse57 .cse19 .cse20) 20)) 19)) (= (+ .cse62 1) main_~ret~1) (<= 0 (+ .cse55 .cse2 42949672960 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 main_~temp~0 .cse56 .cse11 .cse12 .cse15 .cse16 .cse32 .cse17 .cse18 .cse57 .cse19 .cse20))) (and .cse63 (<= (div (+ .cse55 .cse2 19 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 main_~temp~0 .cse56 .cse11 .cse12 .cse15 .cse16 .cse32 .cse17 .cse18 .cse57 .cse19 .cse20) 20) .cse62)) (and .cse63 (<= .cse61 42949672940) (<= 0 .cse61)))))) .cse27)) (let ((.cse65 (+ .cse2 .cse25 .cse41 .cse66 .cse42 .cse43 main_~temp~0 .cse44 .cse13 .cse14 .cse67 .cse33 .cse45 .cse18 .cse68 .cse46 .cse20 .cse47 .cse69 .cse70))) (let ((.cse71 (div .cse65 20))) (let ((.cse64 (= main_~ret~1 .cse71))) (and (or (and .cse64 .cse24) (<= .cse65 (+ 19 (* (div (+ (- 1) .cse2 .cse25 .cse41 .cse66 .cse42 .cse43 main_~temp~0 .cse44 .cse13 .cse14 .cse67 .cse33 .cse45 .cse18 .cse68 .cse46 .cse20 .cse47 .cse69 .cse70) 20) 20)))) (or (<= (div (+ .cse2 .cse25 19 .cse41 .cse66 .cse42 .cse43 main_~temp~0 .cse44 .cse13 .cse14 .cse67 .cse33 .cse45 .cse18 .cse68 .cse46 .cse20 .cse47 .cse69 .cse70) 20) .cse71) (and (= (+ .cse71 1) main_~ret~1) (<= (+ .cse2 .cse25 .cse41 .cse66 .cse42 .cse43 main_~temp~0 .cse44 .cse13 .cse14 .cse67 .cse33 .cse45 .cse18 .cse68 .cse46 .cse20 .cse47 .cse69 .cse70 1) 0) .cse24) (and .cse64 (<= 0 .cse65) .cse24)) (<= .cse65 42949672940) .cse27 (<= 0 (+ .cse2 .cse25 42949672960 .cse41 .cse66 .cse42 .cse43 main_~temp~0 .cse44 .cse13 .cse14 .cse67 .cse33 .cse45 .cse18 .cse68 .cse46 .cse20 .cse47 .cse69 .cse70)) (let ((.cse73 (+ .cse2 .cse41 .cse66 .cse42 .cse43 .cse7 main_~temp~0 .cse44 .cse13 .cse14 .cse67 .cse33 .cse45 .cse18 .cse68 .cse46 .cse20 .cse47 .cse69 .cse70))) (let ((.cse74 (div .cse73 20))) (let ((.cse72 (= main_~ret~1 .cse74))) (or (and (or (and .cse72 (<= 0 .cse73)) (and (<= (+ .cse2 .cse41 .cse66 .cse42 .cse43 .cse7 main_~temp~0 .cse44 .cse13 .cse14 .cse67 .cse33 .cse45 .cse18 .cse68 .cse46 .cse20 .cse47 .cse69 .cse70 1) 0) (= (+ .cse74 1) main_~ret~1))) (<= .cse73 42949672940) (<= 0 (+ .cse2 42949672960 .cse41 .cse66 .cse42 .cse43 .cse7 main_~temp~0 .cse44 .cse13 .cse14 .cse67 .cse33 .cse45 .cse18 .cse68 .cse46 .cse20 .cse47 .cse69 .cse70)) (<= .cse73 (+ 19 (* 20 (div (+ (- 1) .cse2 .cse41 .cse66 .cse42 .cse43 .cse7 main_~temp~0 .cse44 .cse13 .cse14 .cse67 .cse33 .cse45 .cse18 .cse68 .cse46 .cse20 .cse47 .cse69 .cse70) 20))))) (and .cse72 (<= .cse73 (* 20 .cse74))))))) (= .cse29 68))))) (let ((.cse76 (select .cse28 (+ .cse29 8)))) (and (let ((.cse78 (+ .cse2 .cse3 .cse41 .cse4 .cse30 .cse43 .cse7 .cse9 main_~temp~0 .cse44 .cse11 .cse12 .cse13 .cse14 .cse15 .cse32 .cse76 .cse33 .cse45 .cse20))) (let ((.cse77 (div .cse78 20))) (let ((.cse75 (= main_~ret~1 .cse77))) (or (and .cse75 (<= (div (+ .cse2 19 .cse3 .cse41 .cse4 .cse30 .cse43 .cse7 .cse9 main_~temp~0 .cse44 .cse11 .cse12 .cse13 .cse14 .cse15 .cse32 .cse76 .cse33 .cse45 .cse20) 20) .cse77)) (and (= main_~ret~1 (+ .cse77 1)) (<= 0 (+ .cse2 42949672960 .cse3 .cse41 .cse4 .cse30 .cse43 .cse7 .cse9 main_~temp~0 .cse44 .cse11 .cse12 .cse13 .cse14 .cse15 .cse32 .cse76 .cse33 .cse45 .cse20)) (<= (+ .cse2 .cse3 .cse41 .cse4 .cse30 .cse43 .cse7 .cse9 main_~temp~0 .cse44 .cse11 .cse12 .cse13 .cse14 .cse15 .cse32 .cse76 .cse33 .cse45 .cse20 1) 0) (<= .cse78 (+ 19 (* (div (+ (- 1) .cse2 .cse3 .cse41 .cse4 .cse30 .cse43 .cse7 .cse9 main_~temp~0 .cse44 .cse11 .cse12 .cse13 .cse14 .cse15 .cse32 .cse76 .cse33 .cse45 .cse20) 20) 20)))) (and (<= 0 .cse78) (<= .cse78 42949672940) .cse75))))) (<= main_~i~2 8) .cse27 (let ((.cse80 (+ .cse2 .cse25 .cse3 .cse41 .cse4 .cse30 .cse43 .cse9 main_~temp~0 .cse44 .cse11 .cse12 .cse13 .cse14 .cse15 .cse32 .cse76 .cse33 .cse45 .cse20))) (let ((.cse82 (div .cse80 20))) (let ((.cse79 (= .cse82 main_~ret~1)) (.cse81 (<= 0 (+ .cse2 .cse25 42949672960 .cse3 .cse41 .cse4 .cse30 .cse43 .cse9 main_~temp~0 .cse44 .cse11 .cse12 .cse13 .cse14 .cse15 .cse32 .cse76 .cse33 .cse45 .cse20)))) (or (and .cse79 (<= 0 .cse80) (<= .cse80 42949672940) .cse24) (and .cse81 (<= .cse80 (+ 19 (* (div (+ (- 1) .cse2 .cse25 .cse3 .cse41 .cse4 .cse30 .cse43 .cse9 main_~temp~0 .cse44 .cse11 .cse12 .cse13 .cse14 .cse15 .cse32 .cse76 .cse33 .cse45 .cse20) 20) 20))) (= (+ .cse82 1) main_~ret~1) (<= (+ .cse2 .cse25 .cse3 .cse41 .cse4 .cse30 .cse43 .cse9 main_~temp~0 .cse44 .cse11 .cse12 .cse13 .cse14 .cse15 .cse32 .cse76 .cse33 .cse45 .cse20 1) 0) .cse24) (and .cse79 .cse81 (<= (+ .cse2 .cse25 .cse3 .cse41 .cse4 .cse30 .cse43 .cse9 main_~temp~0 .cse44 .cse11 .cse12 .cse13 .cse14 .cse15 .cse32 .cse76 .cse33 .cse45 20 .cse20) 0) (<= (div (+ .cse2 .cse25 19 .cse3 .cse41 .cse4 .cse30 .cse43 .cse9 main_~temp~0 .cse44 .cse11 .cse12 .cse13 .cse14 .cse15 .cse32 .cse76 .cse33 .cse45 .cse20) 20) .cse82) .cse24))))) (<= 8 main_~i~2))) (and (let ((.cse84 (+ .cse2 .cse3 .cse41 .cse4 .cse42 .cse5 .cse30 .cse43 .cse7 main_~temp~0 .cse44 .cse11 .cse12 .cse13 .cse14 .cse32 .cse33 .cse45 .cse20 .cse47))) (let ((.cse83 (div .cse84 20))) (let ((.cse85 (= main_~ret~1 .cse83))) (or (and (<= 0 (+ .cse2 42949672960 .cse3 .cse41 .cse4 .cse42 .cse5 .cse30 .cse43 .cse7 main_~temp~0 .cse44 .cse11 .cse12 .cse13 .cse14 .cse32 .cse33 .cse45 .cse20 .cse47)) (or (and (= main_~ret~1 (+ 1 .cse83)) (<= (+ .cse2 .cse3 .cse41 .cse4 .cse42 .cse5 .cse30 .cse43 .cse7 main_~temp~0 .cse44 .cse11 .cse12 .cse13 .cse14 .cse32 .cse33 .cse45 .cse20 .cse47 1) 0)) (and (<= 0 .cse84) .cse85)) (<= .cse84 (+ 19 (* (div (+ (- 1) .cse2 .cse3 .cse41 .cse4 .cse42 .cse5 .cse30 .cse43 .cse7 main_~temp~0 .cse44 .cse11 .cse12 .cse13 .cse14 .cse32 .cse33 .cse45 .cse20 .cse47) 20) 20))) (<= .cse84 42949672940)) (and (<= .cse84 (* 20 .cse83)) .cse85))))) (let ((.cse89 (+ .cse2 .cse25 .cse3 .cse41 .cse4 .cse42 .cse5 .cse30 .cse43 main_~temp~0 .cse44 .cse11 .cse12 .cse13 .cse14 .cse32 .cse33 .cse45 .cse20 .cse47))) (let ((.cse87 (div .cse89 20))) (let ((.cse86 (= main_~ret~1 .cse87)) (.cse88 (<= 0 (+ .cse2 .cse25 42949672960 .cse3 .cse41 .cse4 .cse42 .cse5 .cse30 .cse43 main_~temp~0 .cse44 .cse11 .cse12 .cse13 .cse14 .cse32 .cse33 .cse45 .cse20 .cse47)))) (or (and .cse86 (<= (div (+ .cse2 .cse25 19 .cse3 .cse41 .cse4 .cse42 .cse5 .cse30 .cse43 main_~temp~0 .cse44 .cse11 .cse12 .cse13 .cse14 .cse32 .cse33 .cse45 .cse20 .cse47) 20) .cse87) .cse88 (<= (+ .cse2 .cse25 .cse3 .cse41 .cse4 .cse42 .cse5 .cse30 .cse43 main_~temp~0 .cse44 .cse11 .cse12 .cse13 .cse14 .cse32 .cse33 .cse45 20 .cse20 .cse47) 0) .cse24) (and .cse86 (<= .cse89 42949672940) (<= 0 .cse89) .cse24) (and (<= (+ .cse2 .cse25 .cse3 .cse41 .cse4 .cse42 .cse5 .cse30 .cse43 main_~temp~0 .cse44 .cse11 .cse12 .cse13 .cse14 .cse32 .cse33 .cse45 .cse20 .cse47 1) 0) (<= .cse89 (+ 19 (* 20 (div (+ (- 1) .cse2 .cse25 .cse3 .cse41 .cse4 .cse42 .cse5 .cse30 .cse43 main_~temp~0 .cse44 .cse11 .cse12 .cse13 .cse14 .cse32 .cse33 .cse45 .cse20 .cse47) 20)))) .cse88 (= main_~ret~1 (+ .cse87 1)) .cse24))))) (= 40 .cse29) .cse27) (let ((.cse90 (+ .cse2 .cse25 .cse41 .cse66 .cse42 .cse43 .cse91 main_~temp~0 .cse44 .cse13 .cse14 .cse67 .cse33 .cse45 .cse68 .cse46 .cse20 .cse47 .cse69 .cse70)) (.cse93 (+ .cse2 .cse41 .cse66 .cse42 .cse43 .cse7 .cse91 main_~temp~0 .cse44 .cse13 .cse14 .cse67 .cse33 .cse45 .cse68 .cse46 .cse20 .cse47 .cse69 .cse70))) (let ((.cse96 (div .cse93 20)) (.cse94 (div .cse90 20))) (let ((.cse92 (= main_~ret~1 .cse94)) (.cse95 (= main_~ret~1 .cse96))) (and (or (<= .cse90 (+ 19 (* (div (+ (- 1) .cse2 .cse25 .cse41 .cse66 .cse42 .cse43 .cse91 main_~temp~0 .cse44 .cse13 .cse14 .cse67 .cse33 .cse45 .cse68 .cse46 .cse20 .cse47 .cse69 .cse70) 20) 20))) .cse92) (<= .cse93 42949672940) (or (and (<= 0 .cse90) .cse92) (<= (div (+ .cse2 .cse25 19 .cse41 .cse66 .cse42 .cse43 .cse91 main_~temp~0 .cse44 .cse13 .cse14 .cse67 .cse33 .cse45 .cse68 .cse46 .cse20 .cse47 .cse69 .cse70) 20) .cse94) (and (= main_~ret~1 (+ .cse94 1)) (<= (+ .cse2 .cse25 .cse41 .cse66 .cse42 .cse43 .cse91 main_~temp~0 .cse44 .cse13 .cse14 .cse67 .cse33 .cse45 .cse68 .cse46 .cse20 .cse47 .cse69 .cse70 1) 0))) (<= .cse90 42949672940) (or .cse95 (<= .cse93 (+ 19 (* (div (+ (- 1) .cse2 .cse41 .cse66 .cse42 .cse43 .cse7 .cse91 main_~temp~0 .cse44 .cse13 .cse14 .cse67 .cse33 .cse45 .cse68 .cse46 .cse20 .cse47 .cse69 .cse70) 20) 20)))) (<= 0 (+ .cse2 .cse25 42949672960 .cse41 .cse66 .cse42 .cse43 .cse91 main_~temp~0 .cse44 .cse13 .cse14 .cse67 .cse33 .cse45 .cse68 .cse46 .cse20 .cse47 .cse69 .cse70)) (or (and .cse95 (<= 0 .cse93) .cse24) (and (<= (+ .cse2 .cse41 .cse66 .cse42 .cse43 .cse7 .cse91 main_~temp~0 .cse44 .cse13 .cse14 .cse67 .cse33 .cse45 .cse68 .cse46 .cse20 .cse47 .cse69 .cse70 1) 0) (= (+ .cse96 1) main_~ret~1) .cse24) (and (<= (div (+ .cse2 19 .cse41 .cse66 .cse42 .cse43 .cse7 .cse91 main_~temp~0 .cse44 .cse13 .cse14 .cse67 .cse33 .cse45 .cse68 .cse46 .cse20 .cse47 .cse69 .cse70) 20) .cse96) .cse24)) .cse27 (<= 0 (+ .cse2 42949672960 .cse41 .cse66 .cse42 .cse43 .cse7 .cse91 main_~temp~0 .cse44 .cse13 .cse14 .cse67 .cse33 .cse45 .cse68 .cse46 .cse20 .cse47 .cse69 .cse70)) (<= 18 main_~i~2) (<= main_~i~2 18))))) (let ((.cse97 (+ .cse2 .cse3 .cse41 .cse42 .cse5 .cse43 .cse7 main_~temp~0 .cse44 .cse11 .cse12 .cse13 .cse14 .cse33 .cse45 .cse18 .cse46 .cse20 .cse47 .cse69)) (.cse101 (+ .cse2 .cse25 .cse3 .cse41 .cse42 .cse5 .cse43 main_~temp~0 .cse44 .cse11 .cse12 .cse13 .cse14 .cse33 .cse45 .cse18 .cse46 .cse20 .cse47 .cse69))) (let ((.cse102 (div .cse101 20)) (.cse98 (div .cse97 20))) (let ((.cse99 (= main_~ret~1 .cse98)) (.cse100 (= main_~ret~1 .cse102))) (and (or (<= .cse97 (* 20 .cse98)) (and (= main_~ret~1 (+ .cse98 1)) (<= (+ .cse2 .cse3 .cse41 .cse42 .cse5 .cse43 .cse7 main_~temp~0 .cse44 .cse11 .cse12 .cse13 .cse14 .cse33 .cse45 .cse18 .cse46 .cse20 .cse47 .cse69 1) 0)) (and (<= 0 .cse97) .cse99)) (<= 0 (+ .cse2 .cse25 42949672960 .cse3 .cse41 .cse42 .cse5 .cse43 main_~temp~0 .cse44 .cse11 .cse12 .cse13 .cse14 .cse33 .cse45 .cse18 .cse46 .cse20 .cse47 .cse69)) (or .cse99 (<= .cse97 (+ 19 (* 20 (div (+ (- 1) .cse2 .cse3 .cse41 .cse42 .cse5 .cse43 .cse7 main_~temp~0 .cse44 .cse11 .cse12 .cse13 .cse14 .cse33 .cse45 .cse18 .cse46 .cse20 .cse47 .cse69) 20))))) (or .cse100 (<= .cse101 (+ 19 (* (div (+ (- 1) .cse2 .cse25 .cse3 .cse41 .cse42 .cse5 .cse43 main_~temp~0 .cse44 .cse11 .cse12 .cse13 .cse14 .cse33 .cse45 .cse18 .cse46 .cse20 .cse47 .cse69) 20) 20)))) (<= .cse101 42949672940) (<= .cse97 42949672940) .cse27 (<= 0 (+ .cse2 42949672960 .cse3 .cse41 .cse42 .cse5 .cse43 .cse7 main_~temp~0 .cse44 .cse11 .cse12 .cse13 .cse14 .cse33 .cse45 .cse18 .cse46 .cse20 .cse47 .cse69)) (= .cse29 52) (or (and (<= .cse101 (* .cse102 20)) .cse24) (and (<= (+ .cse2 .cse25 .cse3 .cse41 .cse42 .cse5 .cse43 main_~temp~0 .cse44 .cse11 .cse12 .cse13 .cse14 .cse33 .cse45 .cse18 .cse46 .cse20 .cse47 .cse69 1) 0) (= main_~ret~1 (+ .cse102 1)) .cse24) (and .cse100 (<= 0 .cse101) .cse24)))))) (let ((.cse103 (+ .cse2 .cse3 .cse41 .cse42 .cse5 .cse43 .cse7 main_~temp~0 .cse44 .cse12 .cse13 .cse14 .cse33 .cse45 .cse18 .cse46 .cse20 .cse47 .cse69 .cse70))) (let ((.cse108 (div .cse103 20))) (let ((.cse107 (= main_~ret~1 .cse108))) (and (<= 0 (+ .cse2 42949672960 .cse3 .cse41 .cse42 .cse5 .cse43 .cse7 main_~temp~0 .cse44 .cse12 .cse13 .cse14 .cse33 .cse45 .cse18 .cse46 .cse20 .cse47 .cse69 .cse70)) (<= .cse103 42949672940) (let ((.cse104 (+ .cse2 .cse25 .cse3 .cse41 .cse42 .cse5 .cse43 main_~temp~0 .cse44 .cse12 .cse13 .cse14 .cse33 .cse45 .cse18 .cse46 .cse20 .cse47 .cse69 .cse70))) (let ((.cse106 (div .cse104 20))) (let ((.cse105 (= .cse106 main_~ret~1))) (or (and (<= .cse104 42949672940) .cse105 (<= 0 .cse104) .cse24) (and (<= (div (+ .cse2 .cse25 19 .cse3 .cse41 .cse42 .cse5 .cse43 main_~temp~0 .cse44 .cse12 .cse13 .cse14 .cse33 .cse45 .cse18 .cse46 .cse20 .cse47 .cse69 .cse70) 20) .cse106) .cse105 .cse24) (and (= (+ .cse106 1) main_~ret~1) (<= 0 (+ .cse2 .cse25 42949672960 .cse3 .cse41 .cse42 .cse5 .cse43 main_~temp~0 .cse44 .cse12 .cse13 .cse14 .cse33 .cse45 .cse18 .cse46 .cse20 .cse47 .cse69 .cse70)) (<= .cse104 (+ 19 (* (div (+ (- 1) .cse2 .cse25 .cse3 .cse41 .cse42 .cse5 .cse43 main_~temp~0 .cse44 .cse12 .cse13 .cse14 .cse33 .cse45 .cse18 .cse46 .cse20 .cse47 .cse69 .cse70) 20) 20))) (<= (+ .cse2 .cse25 .cse3 .cse41 .cse42 .cse5 .cse43 main_~temp~0 .cse44 .cse12 .cse13 .cse14 .cse33 .cse45 .cse18 .cse46 .cse20 .cse47 .cse69 .cse70 1) 0) .cse24))))) (or (<= .cse103 (+ 19 (* 20 (div (+ (- 1) .cse2 .cse3 .cse41 .cse42 .cse5 .cse43 .cse7 main_~temp~0 .cse44 .cse12 .cse13 .cse14 .cse33 .cse45 .cse18 .cse46 .cse20 .cse47 .cse69 .cse70) 20)))) .cse107) .cse27 (or (and (<= 0 .cse103) .cse107) (<= .cse103 (* 20 .cse108)) (and (= main_~ret~1 (+ .cse108 1)) (<= (+ .cse2 .cse3 .cse41 .cse42 .cse5 .cse43 .cse7 main_~temp~0 .cse44 .cse12 .cse13 .cse14 .cse33 .cse45 .cse18 .cse46 .cse20 .cse47 .cse69 .cse70 1) 0))) (= 56 .cse29))))) (let ((.cse111 (select .cse28 (+ .cse29 16)))) (let ((.cse110 (+ .cse2 .cse3 .cse41 .cse4 .cse30 .cse43 .cse7 .cse9 .cse10 main_~temp~0 .cse111 .cse12 .cse13 .cse14 .cse15 .cse32 .cse33 .cse18 .cse19 .cse20)) (.cse113 (+ .cse2 .cse25 .cse3 .cse41 .cse4 .cse30 .cse43 .cse9 .cse10 main_~temp~0 .cse111 .cse12 .cse13 .cse14 .cse15 .cse32 .cse33 .cse18 .cse19 .cse20))) (let ((.cse112 (div .cse113 20)) (.cse115 (div .cse110 20))) (let ((.cse109 (= main_~ret~1 .cse115)) (.cse114 (= main_~ret~1 .cse112))) (and (or (and .cse109 .cse24) (<= .cse110 (+ 19 (* (div (+ (- 1) .cse2 .cse3 .cse41 .cse4 .cse30 .cse43 .cse7 .cse9 .cse10 main_~temp~0 .cse111 .cse12 .cse13 .cse14 .cse15 .cse32 .cse33 .cse18 .cse19 .cse20) 20) 20)))) (or (and (<= (+ .cse2 .cse25 .cse3 .cse41 .cse4 .cse30 .cse43 .cse9 .cse10 main_~temp~0 .cse111 .cse12 .cse13 .cse14 .cse15 .cse32 .cse33 .cse18 .cse19 .cse20 1) 0) (= main_~ret~1 (+ .cse112 1))) (<= (div (+ .cse2 .cse25 19 .cse3 .cse41 .cse4 .cse30 .cse43 .cse9 .cse10 main_~temp~0 .cse111 .cse12 .cse13 .cse14 .cse15 .cse32 .cse33 .cse18 .cse19 .cse20) 20) .cse112) (and (<= 0 .cse113) .cse114)) (<= 0 (+ .cse2 42949672960 .cse3 .cse41 .cse4 .cse30 .cse43 .cse7 .cse9 .cse10 main_~temp~0 .cse111 .cse12 .cse13 .cse14 .cse15 .cse32 .cse33 .cse18 .cse19 .cse20)) (<= .cse113 42949672940) (<= main_~i~2 6) (<= 6 main_~i~2) (<= 0 (+ .cse2 .cse25 42949672960 .cse3 .cse41 .cse4 .cse30 .cse43 .cse9 .cse10 main_~temp~0 .cse111 .cse12 .cse13 .cse14 .cse15 .cse32 .cse33 .cse18 .cse19 .cse20)) (<= .cse110 42949672940) (or (and .cse109 (<= 0 .cse110) .cse24) (and (= main_~ret~1 (+ .cse115 1)) (<= (+ .cse2 .cse3 .cse41 .cse4 .cse30 .cse43 .cse7 .cse9 .cse10 main_~temp~0 .cse111 .cse12 .cse13 .cse14 .cse15 .cse32 .cse33 .cse18 .cse19 .cse20 1) 0) .cse24) (<= (div (+ .cse2 19 .cse3 .cse41 .cse4 .cse30 .cse43 .cse7 .cse9 .cse10 main_~temp~0 .cse111 .cse12 .cse13 .cse14 .cse15 .cse32 .cse33 .cse18 .cse19 .cse20) 20) .cse115)) .cse27 (or .cse114 (<= .cse113 (+ 19 (* 20 (div (+ (- 1) .cse2 .cse25 .cse3 .cse41 .cse4 .cse30 .cse43 .cse9 .cse10 main_~temp~0 .cse111 .cse12 .cse13 .cse14 .cse15 .cse32 .cse33 .cse18 .cse19 .cse20) 20)))))))))) (let ((.cse116 (+ .cse2 .cse25 .cse41 .cse42 .cse43 main_~temp~0 .cse44 .cse12 .cse13 .cse14 .cse67 .cse33 .cse45 .cse18 .cse68 .cse46 .cse20 .cse47 .cse69 .cse70))) (let ((.cse121 (div .cse116 20))) (let ((.cse120 (= main_~ret~1 .cse121))) (and (<= .cse116 42949672940) (let ((.cse118 (+ .cse2 .cse41 .cse42 .cse43 .cse7 main_~temp~0 .cse44 .cse12 .cse13 .cse14 .cse67 .cse33 .cse45 .cse18 .cse68 .cse46 .cse20 .cse47 .cse69 .cse70))) (let ((.cse119 (div .cse118 20))) (let ((.cse117 (= main_~ret~1 .cse119))) (or (and .cse117 (<= .cse118 42949672940) (<= 0 .cse118) .cse24) (and (<= .cse118 (+ (* (div (+ (- 1) .cse2 .cse41 .cse42 .cse43 .cse7 main_~temp~0 .cse44 .cse12 .cse13 .cse14 .cse67 .cse33 .cse45 .cse18 .cse68 .cse46 .cse20 .cse47 .cse69 .cse70) 20) 20) 19)) (<= 0 (+ .cse2 42949672960 .cse41 .cse42 .cse43 .cse7 main_~temp~0 .cse44 .cse12 .cse13 .cse14 .cse67 .cse33 .cse45 .cse18 .cse68 .cse46 .cse20 .cse47 .cse69 .cse70)) (<= (+ .cse2 .cse41 .cse42 .cse43 .cse7 main_~temp~0 .cse44 .cse12 .cse13 .cse14 .cse67 .cse33 .cse45 .cse18 .cse68 .cse46 .cse20 .cse47 .cse69 .cse70 1) 0) (= main_~ret~1 (+ .cse119 1)) .cse24) (and .cse117 (<= (div (+ .cse2 19 .cse41 .cse42 .cse43 .cse7 main_~temp~0 .cse44 .cse12 .cse13 .cse14 .cse67 .cse33 .cse45 .cse18 .cse68 .cse46 .cse20 .cse47 .cse69 .cse70) 20) .cse119) .cse24))))) (or (and .cse120 (<= 0 .cse116)) (and (<= (+ .cse2 .cse25 .cse41 .cse42 .cse43 main_~temp~0 .cse44 .cse12 .cse13 .cse14 .cse67 .cse33 .cse45 .cse18 .cse68 .cse46 .cse20 .cse47 .cse69 .cse70 1) 0) (= main_~ret~1 (+ .cse121 1))) (<= .cse116 (* 20 .cse121))) .cse27 (<= 0 (+ .cse2 .cse25 42949672960 .cse41 .cse42 .cse43 main_~temp~0 .cse44 .cse12 .cse13 .cse14 .cse67 .cse33 .cse45 .cse18 .cse68 .cse46 .cse20 .cse47 .cse69 .cse70)) (= .cse29 64) (or .cse120 (<= .cse116 (+ 19 (* (div (+ (- 1) .cse2 .cse25 .cse41 .cse42 .cse43 main_~temp~0 .cse44 .cse12 .cse13 .cse14 .cse67 .cse33 .cse45 .cse18 .cse68 .cse46 .cse20 .cse47 .cse69 .cse70) 20) 20)))))))) (let ((.cse124 (select .cse28 (+ .cse29 20)))) (let ((.cse123 (+ .cse2 .cse41 .cse4 .cse5 .cse124 .cse30 .cse6 .cse7 .cse9 .cse10 main_~temp~0 .cse11 .cse12 .cse13 .cse14 .cse15 .cse33 .cse18 .cse19 .cse20)) (.cse125 (+ .cse2 .cse25 .cse41 .cse4 .cse5 .cse124 .cse30 .cse6 .cse9 .cse10 main_~temp~0 .cse11 .cse12 .cse13 .cse14 .cse15 .cse33 .cse18 .cse19 .cse20))) (let ((.cse126 (div .cse125 20)) (.cse128 (div .cse123 20))) (let ((.cse122 (= main_~ret~1 .cse128)) (.cse127 (= main_~ret~1 .cse126))) (and (or .cse122 (<= .cse123 (+ 19 (* (div (+ (- 1) .cse2 .cse41 .cse4 .cse5 .cse124 .cse30 .cse6 .cse7 .cse9 .cse10 main_~temp~0 .cse11 .cse12 .cse13 .cse14 .cse15 .cse33 .cse18 .cse19 .cse20) 20) 20)))) (<= 0 (+ .cse2 .cse25 42949672960 .cse41 .cse4 .cse5 .cse124 .cse30 .cse6 .cse9 .cse10 main_~temp~0 .cse11 .cse12 .cse13 .cse14 .cse15 .cse33 .cse18 .cse19 .cse20)) (<= main_~i~2 5) (<= .cse123 42949672940) (<= .cse125 42949672940) (<= 5 main_~i~2) (or (and (= main_~ret~1 (+ .cse126 1)) (<= (+ .cse2 .cse25 .cse41 .cse4 .cse5 .cse124 .cse30 .cse6 .cse9 .cse10 main_~temp~0 .cse11 .cse12 .cse13 .cse14 .cse15 .cse33 .cse18 .cse19 .cse20 1) 0) .cse24) (<= (div (+ .cse2 .cse25 19 .cse41 .cse4 .cse5 .cse124 .cse30 .cse6 .cse9 .cse10 main_~temp~0 .cse11 .cse12 .cse13 .cse14 .cse15 .cse33 .cse18 .cse19 .cse20) 20) .cse126) (and .cse127 .cse24 (<= 0 .cse125))) (or (and (<= (+ .cse2 .cse41 .cse4 .cse5 .cse124 .cse30 .cse6 .cse7 .cse9 .cse10 main_~temp~0 .cse11 .cse12 .cse13 .cse14 .cse15 .cse33 .cse18 .cse19 .cse20 1) 0) (= (+ .cse128 1) main_~ret~1)) (<= .cse123 (* .cse128 20)) (and (<= 0 .cse123) .cse122)) (<= 0 (+ .cse2 42949672960 .cse41 .cse4 .cse5 .cse124 .cse30 .cse6 .cse7 .cse9 .cse10 main_~temp~0 .cse11 .cse12 .cse13 .cse14 .cse15 .cse33 .cse18 .cse19 .cse20)) .cse27 (or (<= .cse125 (+ 19 (* 20 (div (+ (- 1) .cse2 .cse25 .cse41 .cse4 .cse5 .cse124 .cse30 .cse6 .cse9 .cse10 main_~temp~0 .cse11 .cse12 .cse13 .cse14 .cse15 .cse33 .cse18 .cse19 .cse20) 20)))) (and .cse127 .cse24))))))) (let ((.cse132 (select .cse28 (+ .cse29 12)))) (let ((.cse134 (+ .cse2 .cse25 .cse41 .cse4 .cse5 .cse30 .cse43 .cse132 .cse9 .cse10 main_~temp~0 .cse11 .cse13 .cse14 .cse15 .cse32 .cse33 .cse45 .cse18 .cse20))) (let ((.cse133 (div .cse134 20))) (let ((.cse135 (= main_~ret~1 .cse133))) (and (let ((.cse130 (+ .cse2 .cse41 .cse4 .cse5 .cse30 .cse43 .cse7 .cse132 .cse9 .cse10 main_~temp~0 .cse11 .cse13 .cse14 .cse15 .cse32 .cse33 .cse45 .cse18 .cse20))) (let ((.cse131 (div .cse130 20))) (let ((.cse129 (= main_~ret~1 .cse131))) (or (and .cse129 (<= .cse130 (* .cse131 20))) (and (<= .cse130 (+ 19 (* (div (+ (- 1) .cse2 .cse41 .cse4 .cse5 .cse30 .cse43 .cse7 .cse132 .cse9 .cse10 main_~temp~0 .cse11 .cse13 .cse14 .cse15 .cse32 .cse33 .cse45 .cse18 .cse20) 20) 20))) (or (and (<= (+ .cse2 .cse41 .cse4 .cse5 .cse30 .cse43 .cse7 .cse132 .cse9 .cse10 main_~temp~0 .cse11 .cse13 .cse14 .cse15 .cse32 .cse33 .cse45 .cse18 .cse20 1) 0) (= main_~ret~1 (+ .cse131 1))) (and .cse129 (<= 0 .cse130))) (<= 0 (+ .cse2 42949672960 .cse41 .cse4 .cse5 .cse30 .cse43 .cse7 .cse132 .cse9 .cse10 main_~temp~0 .cse11 .cse13 .cse14 .cse15 .cse32 .cse33 .cse45 .cse18 .cse20)) (<= .cse130 42949672940)))))) (<= 7 main_~i~2) (or (and (<= (+ .cse2 .cse25 .cse41 .cse4 .cse5 .cse30 .cse43 .cse132 .cse9 .cse10 main_~temp~0 .cse11 .cse13 .cse14 .cse15 .cse32 .cse33 .cse45 .cse18 .cse20 1) 0) (= (+ .cse133 1) main_~ret~1) .cse24) (and (<= 0 .cse134) .cse135 .cse24) (and (<= .cse134 (* 20 .cse133)) .cse24)) .cse27 (<= main_~i~2 7) (or (<= .cse134 (+ 19 (* (div (+ (- 1) .cse2 .cse25 .cse41 .cse4 .cse5 .cse30 .cse43 .cse132 .cse9 .cse10 main_~temp~0 .cse11 .cse13 .cse14 .cse15 .cse32 .cse33 .cse45 .cse18 .cse20) 20) 20))) .cse135) (<= 0 (+ .cse2 .cse25 42949672960 .cse41 .cse4 .cse5 .cse30 .cse43 .cse132 .cse9 .cse10 main_~temp~0 .cse11 .cse13 .cse14 .cse15 .cse32 .cse33 .cse45 .cse18 .cse20)) (<= .cse134 42949672940)))))) (let ((.cse140 (+ .cse2 .cse41 .cse42 .cse5 .cse43 .cse7 main_~temp~0 .cse44 .cse12 .cse13 .cse14 .cse67 .cse33 .cse45 .cse18 .cse46 .cse20 .cse47 .cse69 .cse70))) (let ((.cse139 (div .cse140 20))) (let ((.cse141 (= .cse139 main_~ret~1))) (and (<= 0 (+ .cse2 42949672960 .cse41 .cse42 .cse5 .cse43 .cse7 main_~temp~0 .cse44 .cse12 .cse13 .cse14 .cse67 .cse33 .cse45 .cse18 .cse46 .cse20 .cse47 .cse69 .cse70)) (let ((.cse136 (+ .cse2 .cse25 .cse41 .cse42 .cse5 .cse43 main_~temp~0 .cse44 .cse12 .cse13 .cse14 .cse67 .cse33 .cse45 .cse18 .cse46 .cse20 .cse47 .cse69 .cse70))) (let ((.cse138 (div .cse136 20))) (let ((.cse137 (= .cse138 main_~ret~1))) (or (and (<= .cse136 (+ 19 (* 20 (div (+ (- 1) .cse2 .cse25 .cse41 .cse42 .cse5 .cse43 main_~temp~0 .cse44 .cse12 .cse13 .cse14 .cse67 .cse33 .cse45 .cse18 .cse46 .cse20 .cse47 .cse69 .cse70) 20)))) (<= 0 (+ .cse2 .cse25 42949672960 .cse41 .cse42 .cse5 .cse43 main_~temp~0 .cse44 .cse12 .cse13 .cse14 .cse67 .cse33 .cse45 .cse18 .cse46 .cse20 .cse47 .cse69 .cse70)) (or (and (<= 0 .cse136) .cse137 .cse24) (and (= main_~ret~1 (+ .cse138 1)) (<= (+ .cse2 .cse25 .cse41 .cse42 .cse5 .cse43 main_~temp~0 .cse44 .cse12 .cse13 .cse14 .cse67 .cse33 .cse45 .cse18 .cse46 .cse20 .cse47 .cse69 .cse70 1) 0) .cse24)) (<= .cse136 42949672940)) (and .cse137 (<= .cse136 (* .cse138 20)) .cse24))))) (or (and (= main_~ret~1 (+ .cse139 1)) (<= (+ .cse2 .cse41 .cse42 .cse5 .cse43 .cse7 main_~temp~0 .cse44 .cse12 .cse13 .cse14 .cse67 .cse33 .cse45 .cse18 .cse46 .cse20 .cse47 .cse69 .cse70 1) 0)) (and (<= 0 .cse140) .cse141) (<= .cse140 (* .cse139 20))) .cse27 (= .cse29 .cse142) (or .cse141 (<= .cse140 (+ 19 (* (div (+ (- 1) .cse2 .cse41 .cse42 .cse5 .cse43 .cse7 main_~temp~0 .cse44 .cse12 .cse13 .cse14 .cse67 .cse33 .cse45 .cse18 .cse46 .cse20 .cse47 .cse69 .cse70) 20) 20)))) (<= .cse140 42949672940))))) (let ((.cse143 (+ .cse2 .cse25 .cse3 .cse41 .cse4 .cse42 .cse5 .cse30 .cse43 main_~temp~0 .cse44 .cse11 .cse13 .cse14 .cse15 .cse32 .cse33 .cse45 .cse18 .cse20))) (let ((.cse144 (div .cse143 20))) (let ((.cse145 (= main_~ret~1 .cse144))) (and (<= .cse143 42949672940) (or (and (= main_~ret~1 (+ .cse144 1)) (<= (+ .cse2 .cse25 .cse3 .cse41 .cse4 .cse42 .cse5 .cse30 .cse43 main_~temp~0 .cse44 .cse11 .cse13 .cse14 .cse15 .cse32 .cse33 .cse45 .cse18 .cse20 1) 0)) (and (<= 0 .cse143) .cse145) (<= .cse143 (* .cse144 20))) (or (<= .cse143 (+ 19 (* (div (+ (- 1) .cse2 .cse25 .cse3 .cse41 .cse4 .cse42 .cse5 .cse30 .cse43 main_~temp~0 .cse44 .cse11 .cse13 .cse14 .cse15 .cse32 .cse33 .cse45 .cse18 .cse20) 20) 20))) .cse145) (<= 0 (+ .cse2 .cse25 42949672960 .cse3 .cse41 .cse4 .cse42 .cse5 .cse30 .cse43 main_~temp~0 .cse44 .cse11 .cse13 .cse14 .cse15 .cse32 .cse33 .cse45 .cse18 .cse20)) (let ((.cse146 (+ .cse2 .cse3 .cse41 .cse4 .cse42 .cse5 .cse30 .cse43 .cse7 main_~temp~0 .cse44 .cse11 .cse13 .cse14 .cse15 .cse32 .cse33 .cse45 .cse18 .cse20))) (let ((.cse147 (div .cse146 20))) (let ((.cse148 (= .cse147 main_~ret~1))) (or (and (<= 0 (+ .cse2 42949672960 .cse3 .cse41 .cse4 .cse42 .cse5 .cse30 .cse43 .cse7 main_~temp~0 .cse44 .cse11 .cse13 .cse14 .cse15 .cse32 .cse33 .cse45 .cse18 .cse20)) (<= .cse146 (+ 19 (* 20 (div (+ (- 1) .cse2 .cse3 .cse41 .cse4 .cse42 .cse5 .cse30 .cse43 .cse7 main_~temp~0 .cse44 .cse11 .cse13 .cse14 .cse15 .cse32 .cse33 .cse45 .cse18 .cse20) 20)))) (or (and (<= (+ .cse2 .cse3 .cse41 .cse4 .cse42 .cse5 .cse30 .cse43 .cse7 main_~temp~0 .cse44 .cse11 .cse13 .cse14 .cse15 .cse32 .cse33 .cse45 .cse18 .cse20 1) 0) (= (+ .cse147 1) main_~ret~1) .cse24) (and (<= 0 .cse146) .cse148 .cse24)) (<= .cse146 42949672940)) (and (<= .cse146 (* .cse147 20)) .cse148 .cse24))))) .cse27 (<= 9 main_~i~2) (<= main_~i~2 9))))) (let ((.cse152 (+ .cse3 .cse41 .cse42 .cse5 .cse43 .cse7 main_~temp~0 .cse44 .cse11 .cse12 .cse13 .cse14 .cse32 .cse33 .cse45 .cse18 .cse46 .cse20 .cse47 .cse69))) (let ((.cse153 (div .cse152 20))) (let ((.cse154 (= main_~ret~1 .cse153))) (and (let ((.cse149 (+ .cse25 .cse3 .cse41 .cse42 .cse5 .cse43 main_~temp~0 .cse44 .cse11 .cse12 .cse13 .cse14 .cse32 .cse33 .cse45 .cse18 .cse46 .cse20 .cse47 .cse69))) (let ((.cse151 (div .cse149 20))) (let ((.cse150 (= main_~ret~1 .cse151))) (or (and (<= .cse149 (+ 19 (* 20 (div (+ (- 1) .cse25 .cse3 .cse41 .cse42 .cse5 .cse43 main_~temp~0 .cse44 .cse11 .cse12 .cse13 .cse14 .cse32 .cse33 .cse45 .cse18 .cse46 .cse20 .cse47 .cse69) 20)))) (<= .cse149 42949672940) (or (and (<= 0 .cse149) .cse150) (and (= main_~ret~1 (+ .cse151 1)) (<= (+ .cse25 .cse3 .cse41 .cse42 .cse5 .cse43 main_~temp~0 .cse44 .cse11 .cse12 .cse13 .cse14 .cse32 .cse33 .cse45 .cse18 .cse46 .cse20 .cse47 .cse69 1) 0))) (<= 0 (+ .cse25 42949672960 .cse3 .cse41 .cse42 .cse5 .cse43 main_~temp~0 .cse44 .cse11 .cse12 .cse13 .cse14 .cse32 .cse33 .cse45 .cse18 .cse46 .cse20 .cse47 .cse69))) (and .cse150 (<= .cse149 (* 20 .cse151))))))) (or (<= .cse152 (* .cse153 20)) (and (<= (+ .cse3 .cse41 .cse42 .cse5 .cse43 .cse7 main_~temp~0 .cse44 .cse11 .cse12 .cse13 .cse14 .cse32 .cse33 .cse45 .cse18 .cse46 .cse20 .cse47 .cse69 1) 0) (= (+ .cse153 1) main_~ret~1) .cse24) (and .cse154 (<= 0 .cse152) .cse24)) (<= .cse152 42949672940) .cse27 (= .cse29 48) (or (and .cse154 .cse24) (<= .cse152 (+ 19 (* (div (+ (- 1) .cse3 .cse41 .cse42 .cse5 .cse43 .cse7 main_~temp~0 .cse44 .cse11 .cse12 .cse13 .cse14 .cse32 .cse33 .cse45 .cse18 .cse46 .cse20 .cse47 .cse69) 20) 20)))) (<= 0 (+ 42949672960 .cse3 .cse41 .cse42 .cse5 .cse43 .cse7 main_~temp~0 .cse44 .cse11 .cse12 .cse13 .cse14 .cse32 .cse33 .cse45 .cse18 .cse46 .cse20 .cse47 .cse69)))))) (let ((.cse155 (select .cse28 (+ .cse29 32)))) (let ((.cse159 (+ .cse55 .cse2 .cse3 .cse5 .cse30 .cse6 .cse7 .cse9 .cse10 main_~temp~0 .cse11 .cse12 .cse13 .cse155 .cse16 .cse32 .cse17 .cse18 .cse19 .cse20))) (let ((.cse161 (div .cse159 20))) (let ((.cse160 (= main_~ret~1 .cse161))) (and (<= 0 (+ .cse55 .cse2 42949672960 .cse3 .cse5 .cse30 .cse6 .cse7 .cse9 .cse10 main_~temp~0 .cse11 .cse12 .cse13 .cse155 .cse16 .cse32 .cse17 .cse18 .cse19 .cse20)) (let ((.cse158 (+ .cse55 .cse2 .cse25 .cse3 .cse5 .cse30 .cse6 .cse9 .cse10 main_~temp~0 .cse11 .cse12 .cse13 .cse155 .cse16 .cse32 .cse17 .cse18 .cse19 .cse20))) (let ((.cse157 (div .cse158 20))) (let ((.cse156 (= main_~ret~1 .cse157))) (or (and .cse156 (<= (div (+ .cse55 .cse2 .cse25 19 .cse3 .cse5 .cse30 .cse6 .cse9 .cse10 main_~temp~0 .cse11 .cse12 .cse13 .cse155 .cse16 .cse32 .cse17 .cse18 .cse19 .cse20) 20) .cse157)) (and (<= 0 (+ .cse55 .cse2 .cse25 42949672960 .cse3 .cse5 .cse30 .cse6 .cse9 .cse10 main_~temp~0 .cse11 .cse12 .cse13 .cse155 .cse16 .cse32 .cse17 .cse18 .cse19 .cse20)) (= (+ .cse157 1) main_~ret~1) (<= (+ .cse55 .cse2 .cse25 .cse3 .cse5 .cse30 .cse6 .cse9 .cse10 main_~temp~0 .cse11 .cse12 .cse13 .cse155 .cse16 .cse32 .cse17 .cse18 .cse19 .cse20 1) 0) (<= .cse158 (+ 19 (* (div (+ .cse55 (- 1) .cse2 .cse25 .cse3 .cse5 .cse30 .cse6 .cse9 .cse10 main_~temp~0 .cse11 .cse12 .cse13 .cse155 .cse16 .cse32 .cse17 .cse18 .cse19 .cse20) 20) 20)))) (and (<= .cse158 42949672940) .cse156 (<= 0 .cse158)))))) (or (and (<= 0 .cse159) .cse160 .cse24) (and (= main_~ret~1 (+ .cse161 1)) (<= (+ .cse55 .cse2 .cse3 .cse5 .cse30 .cse6 .cse7 .cse9 .cse10 main_~temp~0 .cse11 .cse12 .cse13 .cse155 .cse16 .cse32 .cse17 .cse18 .cse19 .cse20 1) 0) .cse24) (and (<= (div (+ .cse55 .cse2 19 .cse3 .cse5 .cse30 .cse6 .cse7 .cse9 .cse10 main_~temp~0 .cse11 .cse12 .cse13 .cse155 .cse16 .cse32 .cse17 .cse18 .cse19 .cse20) 20) .cse161) .cse24)) (or (<= .cse159 (+ (* (div (+ .cse55 (- 1) .cse2 .cse3 .cse5 .cse30 .cse6 .cse7 .cse9 .cse10 main_~temp~0 .cse11 .cse12 .cse13 .cse155 .cse16 .cse32 .cse17 .cse18 .cse19 .cse20) 20) 20) 19)) .cse160) (<= 2 main_~i~2) (<= .cse159 42949672940) (<= main_~i~2 2) .cse27))))) (let ((.cse164 (select .cse28 40)) (.cse165 (select .cse28 (+ |main_~#x~0.offset| 76))) (.cse166 (select .cse28 (+ |main_~#x~0.offset| 72)))) (let ((.cse162 (+ .cse164 .cse2 .cse165 .cse25 .cse41 .cse66 .cse42 .cse43 .cse91 main_~temp~0 .cse166 .cse44 .cse14 .cse67 .cse33 .cse45 .cse68 .cse47 .cse69 .cse70))) (let ((.cse170 (div .cse162 20))) (let ((.cse169 (= .cse170 main_~ret~1))) (and (<= .cse162 42949672940) (let ((.cse163 (+ .cse164 .cse2 .cse165 .cse41 .cse66 .cse42 .cse43 .cse7 .cse91 main_~temp~0 .cse166 .cse44 .cse14 .cse67 .cse33 .cse45 .cse68 .cse47 .cse69 .cse70))) (let ((.cse167 (div .cse163 20))) (let ((.cse168 (= .cse167 main_~ret~1))) (or (and (<= .cse163 42949672940) (<= 0 (+ .cse164 .cse2 .cse165 42949672960 .cse41 .cse66 .cse42 .cse43 .cse7 .cse91 main_~temp~0 .cse166 .cse44 .cse14 .cse67 .cse33 .cse45 .cse68 .cse47 .cse69 .cse70)) (<= .cse163 (+ 19 (* 20 (div (+ .cse164 (- 1) .cse2 .cse165 .cse41 .cse66 .cse42 .cse43 .cse7 .cse91 main_~temp~0 .cse166 .cse44 .cse14 .cse67 .cse33 .cse45 .cse68 .cse47 .cse69 .cse70) 20)))) (or (and (<= (+ .cse164 .cse2 .cse165 .cse41 .cse66 .cse42 .cse43 .cse7 .cse91 main_~temp~0 .cse166 .cse44 .cse14 .cse67 .cse33 .cse45 .cse68 .cse47 .cse69 .cse70 1) 0) (= (+ .cse167 1) main_~ret~1)) (and .cse168 (<= 0 .cse163)))) (and (<= .cse163 (* .cse167 20)) .cse168))))) (or (<= .cse162 (+ (* (div (+ .cse164 (- 1) .cse2 .cse165 .cse25 .cse41 .cse66 .cse42 .cse43 .cse91 main_~temp~0 .cse166 .cse44 .cse14 .cse67 .cse33 .cse45 .cse68 .cse47 .cse69 .cse70) 20) 20) 19)) .cse169) (<= 0 (+ .cse164 .cse2 .cse165 .cse25 42949672960 .cse41 .cse66 .cse42 .cse43 .cse91 main_~temp~0 .cse166 .cse44 .cse14 .cse67 .cse33 .cse45 .cse68 .cse47 .cse69 .cse70)) .cse27 (or (and (= main_~ret~1 (+ .cse170 1)) (<= (+ .cse164 .cse2 .cse165 .cse25 .cse41 .cse66 .cse42 .cse43 .cse91 main_~temp~0 .cse166 .cse44 .cse14 .cse67 .cse33 .cse45 .cse68 .cse47 .cse69 .cse70 1) 0) .cse24) (and (<= 0 .cse162) .cse169 .cse24) (and (<= (div (+ .cse164 .cse2 .cse165 .cse25 19 .cse41 .cse66 .cse42 .cse43 .cse91 main_~temp~0 .cse166 .cse44 .cse14 .cse67 .cse33 .cse45 .cse68 .cse47 .cse69 .cse70) 20) .cse170) .cse24)) (= main_~i~2 0)))))))))) [2022-01-31 18:37:51,892 INFO L854 garLoopResultBuilder]: At program point L41-1(line 41) the Hoare annotation is: (let ((.cse27 (select |#memory_int| |main_~#x~0.base|))) (let ((.cse1 (select .cse27 40)) (.cse2 (select .cse27 48)) (.cse3 (select .cse27 (+ |main_~#x~0.offset| 4))) (.cse4 (select .cse27 (+ |main_~#x~0.offset| 76))) (.cse5 (select .cse27 (+ |main_~#x~0.offset| 16))) (.cse6 (select .cse27 (+ |main_~#x~0.offset| 64))) (.cse7 (select .cse27 (+ |main_~#x~0.offset| 32))) (.cse8 (select .cse27 (+ |main_~#x~0.offset| 20))) (.cse9 (select .cse27 (+ |main_~#x~0.offset| 68))) (.cse10 (select .cse27 (+ |main_~#x~0.offset| 72))) (.cse11 (select .cse27 (+ |main_~#x~0.offset| 28))) (.cse12 (select .cse27 (+ |main_~#x~0.offset| 8))) (.cse13 (select .cse27 (+ 56 |main_~#x~0.offset|))) (.cse14 (select .cse27 (+ |main_~#x~0.offset| 12))) (.cse15 (select .cse27 (+ |main_~#x~0.offset| 24))) (.cse16 (select .cse27 (+ |main_~#x~0.offset| 60))) (.cse17 (select .cse27 |main_~#x~0.offset|)) (.cse18 (select .cse27 (+ |main_~#x~0.offset| 36))) (.cse19 (select .cse27 (+ |main_~#x~0.offset| 44))) (.cse20 (select .cse27 (+ |main_~#x~0.offset| 52)))) (let ((.cse0 (+ .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20))) (let ((.cse26 (div .cse0 20))) (let ((.cse21 (= .cse26 main_~ret~1)) (.cse25 (<= 0 .cse0)) (.cse24 (<= (+ 2147483649 |main_#t~ret8|) 0)) (.cse23 (= main_~ret~1 |main_#t~ret8|)) (.cse22 (<= (+ .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 20 .cse17 .cse18 .cse19 .cse20) 0))) (and (<= .cse0 42949672940) (<= 0 (+ .cse1 .cse2 .cse3 .cse4 42949672960 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20)) (or (and .cse21 .cse22) (<= .cse0 (+ 19 (* 20 (div (+ .cse1 (- 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) 20)))) (and (or .cse23 .cse24) .cse25)) (or (and (<= (+ .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 1) 0) (= main_~ret~1 (+ .cse26 1)) .cse23) (and .cse21 .cse25 (or (<= 2147483648 |main_#t~ret8|) .cse23 .cse24)) (and (<= (div (+ .cse1 .cse2 .cse3 .cse4 19 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) 20) .cse26) .cse23 .cse22)) (= |main_~#x~0.offset| 0))))))) [2022-01-31 18:37:51,893 INFO L854 garLoopResultBuilder]: At program point L43-3(lines 43 45) the Hoare annotation is: (let ((.cse80 (+ |main_~#x~0.offset| 60)) (.cse34 (select |#memory_int| |main_~#x~0.base|)) (.cse22 (* main_~i~2 4))) (let ((.cse71 (select .cse34 (+ |main_~#x~0.offset| .cse22 68))) (.cse54 (select .cse34 (+ |main_~#x~0.offset| 64))) (.cse55 (select .cse34 (+ |main_~#x~0.offset| 68))) (.cse56 (select .cse34 (+ |main_~#x~0.offset| 72))) (.cse69 (select .cse34 (+ 56 |main_~#x~0.offset| .cse22))) (.cse31 (select .cse34 (+ |main_~#x~0.offset| .cse22 44))) (.cse47 (select .cse34 (+ |main_~#x~0.offset| .cse22 48))) (.cse73 (select .cse34 (+ |main_~#x~0.offset| .cse22 60))) (.cse74 (select .cse34 (+ |main_~#x~0.offset| .cse22 64))) (.cse49 (select .cse34 (+ |main_~#x~0.offset| .cse22 52))) (.cse3 (select .cse34 (+ |main_~#x~0.offset| .cse22 32))) (.cse30 (select .cse34 (+ |main_~#x~0.offset| .cse22 36))) (.cse32 (select .cse34 (+ |main_~#x~0.offset| 40 .cse22))) (.cse13 (select .cse34 (+ |main_~#x~0.offset| .cse22 28))) (.cse1 (select .cse34 (+ |main_~#x~0.offset| .cse22 20))) (.cse5 (select .cse34 (+ |main_~#x~0.offset| .cse22 16))) (.cse9 (select .cse34 (+ |main_~#x~0.offset| .cse22 24))) (.cse24 (= main_~ret~1 main_~ret2~0)) (.cse29 (select .cse34 48)) (.cse2 (select .cse34 (+ |main_~#x~0.offset| 16))) (.cse4 (select .cse34 (+ |main_~#x~0.offset| 32))) (.cse6 (select .cse34 (+ |main_~#x~0.offset| 20))) (.cse7 (select .cse34 (+ |main_~#x~0.offset| .cse22 4))) (.cse8 (select .cse34 (+ |main_~#x~0.offset| 28))) (.cse10 (select .cse34 (+ |main_~#x~0.offset| .cse22 12))) (.cse11 (select .cse34 4)) (.cse12 (select .cse34 (+ |main_~#x~0.offset| 8))) (.cse57 (select .cse34 (+ 56 |main_~#x~0.offset|))) (.cse14 (select .cse34 (+ |main_~#x~0.offset| 12))) (.cse15 (select .cse34 (+ |main_~#x~0.offset| 24))) (.cse16 (select .cse34 (+ |main_~#x~0.offset| .cse22 8))) (.cse58 (select .cse34 .cse80)) (.cse17 (select .cse34 (+ |main_~#x~0.offset| 40))) (.cse18 (select .cse34 0)) (.cse19 (select .cse34 (+ |main_~#x~0.offset| 36))) (.cse37 (select .cse34 (+ |main_~#x~0.offset| 44))) (.cse59 (select .cse34 (+ |main_~#x~0.offset| 52))) (.cse21 (= |main_~#x~0.offset| 0))) (or (let ((.cse0 (+ .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 main_~temp~0 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19))) (let ((.cse23 (div .cse0 20))) (let ((.cse20 (= main_~ret~1 .cse23))) (and (or (<= .cse0 (+ 19 (* 20 (div (+ (- 1) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 main_~temp~0 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) 20)))) .cse20) .cse21 (= 44 (+ |main_~#x~0.offset| .cse22)) (or (and (<= (+ .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 main_~temp~0 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 1) 0) (= main_~ret~1 (+ .cse23 1)) .cse24) (and .cse20 (<= 0 .cse0) .cse24) (and (<= (div (+ 19 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 main_~temp~0 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) 20) .cse23) .cse24)) (<= .cse0 42949672940) (<= 0 (+ 42949672960 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 main_~temp~0 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19)))))) (and (let ((.cse33 (select .cse34 (+ .cse22 8)))) (let ((.cse25 (+ .cse29 .cse1 .cse2 .cse3 .cse30 .cse6 .cse7 .cse31 main_~temp~0 .cse8 .cse9 .cse10 .cse11 .cse12 .cse32 .cse13 .cse33 .cse14 .cse15 .cse18))) (let ((.cse27 (div .cse25 20))) (let ((.cse28 (<= 0 (+ .cse29 42949672960 .cse1 .cse2 .cse3 .cse30 .cse6 .cse7 .cse31 main_~temp~0 .cse8 .cse9 .cse10 .cse11 .cse12 .cse32 .cse13 .cse33 .cse14 .cse15 .cse18))) (.cse26 (= main_~ret~1 .cse27))) (or (and (<= 0 .cse25) (<= .cse25 42949672940) .cse26 .cse24) (and (= main_~ret~1 (+ .cse27 1)) .cse28 (<= (+ .cse29 .cse1 .cse2 .cse3 .cse30 .cse6 .cse7 .cse31 main_~temp~0 .cse8 .cse9 .cse10 .cse11 .cse12 .cse32 .cse13 .cse33 .cse14 .cse15 .cse18 1) 0) (<= .cse25 (+ 19 (* (div (+ (- 1) .cse29 .cse1 .cse2 .cse3 .cse30 .cse6 .cse7 .cse31 main_~temp~0 .cse8 .cse9 .cse10 .cse11 .cse12 .cse32 .cse13 .cse33 .cse14 .cse15 .cse18) 20) 20))) .cse24) (and .cse28 .cse26 (<= (+ .cse29 .cse1 .cse2 .cse3 .cse30 .cse6 .cse7 .cse31 main_~temp~0 .cse8 .cse9 .cse10 .cse11 .cse12 .cse32 .cse13 .cse33 .cse14 .cse15 20 .cse18) 0) (<= (div (+ .cse29 19 .cse1 .cse2 .cse3 .cse30 .cse6 .cse7 .cse31 main_~temp~0 .cse8 .cse9 .cse10 .cse11 .cse12 .cse32 .cse13 .cse33 .cse14 .cse15 .cse18) 20) .cse27) .cse24)))))) (<= main_~i~2 8) .cse21 (<= 8 main_~i~2)) (let ((.cse35 (+ .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 main_~temp~0 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse37))) (let ((.cse36 (div .cse35 20))) (let ((.cse38 (= main_~ret~1 .cse36))) (and (or (<= .cse35 (* .cse36 20)) (and (<= (+ .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 main_~temp~0 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse37 1) 0) (= (+ .cse36 1) main_~ret~1) .cse24) (and .cse38 (<= 0 .cse35) .cse24)) (<= .cse35 42949672940) .cse21 (= .cse22 48) (or (and .cse38 .cse24) (<= .cse35 (+ 19 (* (div (+ (- 1) .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 main_~temp~0 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse37) 20) 20)))) (<= 0 (+ 42949672960 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 main_~temp~0 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse37)))))) (and (let ((.cse43 (+ .cse29 .cse1 .cse2 .cse3 .cse4 .cse5 .cse30 .cse6 .cse7 main_~temp~0 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse18 .cse19))) (let ((.cse44 (div .cse43 20))) (let ((.cse39 (<= 0 (+ .cse29 42949672960 .cse1 .cse2 .cse3 .cse4 .cse5 .cse30 .cse6 .cse7 main_~temp~0 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse18 .cse19))) (.cse41 (<= 0 .cse43)) (.cse40 (= main_~ret~1 .cse44)) (.cse42 (<= .cse43 42949672940))) (or (and (or (and .cse39 .cse40 (<= (+ .cse29 .cse1 .cse2 .cse3 .cse4 .cse5 .cse30 .cse6 .cse7 main_~temp~0 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 20 .cse18 .cse19) 0) .cse24) (and .cse41 .cse40 .cse42 .cse24)) (<= .cse43 (* 20 .cse44))) (and .cse39 (<= .cse43 (+ 19 (* (div (+ (- 1) .cse29 .cse1 .cse2 .cse3 .cse4 .cse5 .cse30 .cse6 .cse7 main_~temp~0 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse18 .cse19) 20) 20))) (or (and (= main_~ret~1 (+ 1 .cse44)) (<= (+ .cse29 .cse1 .cse2 .cse3 .cse4 .cse5 .cse30 .cse6 .cse7 main_~temp~0 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse18 .cse19 1) 0) .cse24) (and .cse41 .cse40 .cse24)) .cse42))))) (<= 10 main_~i~2) .cse21 (<= main_~i~2 10)) (let ((.cse48 (select .cse34 (+ .cse22 16)))) (let ((.cse46 (+ .cse29 .cse1 .cse2 .cse3 .cse30 .cse6 .cse7 .cse31 .cse47 main_~temp~0 .cse48 .cse10 .cse11 .cse12 .cse32 .cse13 .cse14 .cse16 .cse49 .cse18))) (let ((.cse50 (div .cse46 20))) (let ((.cse45 (= main_~ret~1 .cse50))) (and (or (and .cse45 .cse24) (<= .cse46 (+ 19 (* (div (+ (- 1) .cse29 .cse1 .cse2 .cse3 .cse30 .cse6 .cse7 .cse31 .cse47 main_~temp~0 .cse48 .cse10 .cse11 .cse12 .cse32 .cse13 .cse14 .cse16 .cse49 .cse18) 20) 20)))) (<= 0 (+ .cse29 42949672960 .cse1 .cse2 .cse3 .cse30 .cse6 .cse7 .cse31 .cse47 main_~temp~0 .cse48 .cse10 .cse11 .cse12 .cse32 .cse13 .cse14 .cse16 .cse49 .cse18)) (<= main_~i~2 6) (<= 6 main_~i~2) (<= .cse46 42949672940) (or (and .cse45 (<= 0 .cse46) .cse24) (and (= main_~ret~1 (+ .cse50 1)) (<= (+ .cse29 .cse1 .cse2 .cse3 .cse30 .cse6 .cse7 .cse31 .cse47 main_~temp~0 .cse48 .cse10 .cse11 .cse12 .cse32 .cse13 .cse14 .cse16 .cse49 .cse18 1) 0) .cse24) (<= (div (+ .cse29 19 .cse1 .cse2 .cse3 .cse30 .cse6 .cse7 .cse31 .cse47 main_~temp~0 .cse48 .cse10 .cse11 .cse12 .cse32 .cse13 .cse14 .cse16 .cse49 .cse18) 20) .cse50)) .cse21))))) (let ((.cse53 (select .cse34 (+ |main_~#x~0.offset| 76)))) (and (let ((.cse52 (select .cse34 40))) (let ((.cse51 (+ .cse52 .cse29 .cse53 .cse2 .cse54 .cse4 .cse6 .cse7 .cse55 main_~temp~0 .cse56 .cse8 .cse12 .cse57 .cse14 .cse15 .cse58 .cse19 .cse37 .cse59))) (let ((.cse60 (div .cse51 20))) (let ((.cse61 (= .cse60 main_~ret~1))) (or (and (<= .cse51 42949672940) (<= 0 (+ .cse52 .cse29 .cse53 42949672960 .cse2 .cse54 .cse4 .cse6 .cse7 .cse55 main_~temp~0 .cse56 .cse8 .cse12 .cse57 .cse14 .cse15 .cse58 .cse19 .cse37 .cse59)) (<= .cse51 (+ 19 (* 20 (div (+ .cse52 (- 1) .cse29 .cse53 .cse2 .cse54 .cse4 .cse6 .cse7 .cse55 main_~temp~0 .cse56 .cse8 .cse12 .cse57 .cse14 .cse15 .cse58 .cse19 .cse37 .cse59) 20)))) (or (and (<= (+ .cse52 .cse29 .cse53 .cse2 .cse54 .cse4 .cse6 .cse7 .cse55 main_~temp~0 .cse56 .cse8 .cse12 .cse57 .cse14 .cse15 .cse58 .cse19 .cse37 .cse59 1) 0) (= (+ .cse60 1) main_~ret~1)) (and .cse61 (<= 0 .cse51)))) (and (<= .cse51 (* .cse60 20)) .cse61)))))) (let ((.cse65 (+ .cse29 .cse53 .cse2 .cse54 .cse4 .cse6 .cse55 .cse56 .cse8 .cse11 .cse12 .cse57 .cse14 .cse15 .cse58 .cse17 .cse18 .cse19 .cse37 .cse59))) (let ((.cse62 (div .cse65 20))) (let ((.cse63 (<= 0 (+ .cse29 .cse53 42949672960 .cse2 .cse54 .cse4 .cse6 .cse55 .cse56 .cse8 .cse11 .cse12 .cse57 .cse14 .cse15 .cse58 .cse17 .cse18 .cse19 .cse37 .cse59))) (.cse64 (= main_~ret~1 .cse62))) (or (and (<= (+ .cse29 .cse53 .cse2 .cse54 .cse4 .cse6 .cse55 .cse56 .cse8 .cse11 .cse12 .cse57 .cse14 .cse15 .cse58 20 .cse17 .cse18 .cse19 .cse37 .cse59) 0) (<= (div (+ .cse29 .cse53 19 .cse2 .cse54 .cse4 .cse6 .cse55 .cse56 .cse8 .cse11 .cse12 .cse57 .cse14 .cse15 .cse58 .cse17 .cse18 .cse19 .cse37 .cse59) 20) .cse62) .cse63 .cse64 .cse24) (and (<= (+ .cse29 .cse53 .cse2 .cse54 .cse4 .cse6 .cse55 .cse56 .cse8 .cse11 .cse12 .cse57 .cse14 .cse15 .cse58 .cse17 .cse18 .cse19 .cse37 .cse59 1) 0) (<= .cse65 (+ 19 (* (div (+ (- 1) .cse29 .cse53 .cse2 .cse54 .cse4 .cse6 .cse55 .cse56 .cse8 .cse11 .cse12 .cse57 .cse14 .cse15 .cse58 .cse17 .cse18 .cse19 .cse37 .cse59) 20) 20))) .cse63 (= (+ .cse62 1) main_~ret~1) .cse24) (and (<= 0 .cse65) (<= .cse65 42949672940) .cse64 .cse24))))) .cse21 (= main_~i~2 0))) (let ((.cse68 (select .cse34 (+ .cse22 20)))) (let ((.cse67 (+ .cse29 .cse2 .cse3 .cse5 .cse68 .cse30 .cse69 .cse7 .cse31 .cse47 main_~temp~0 .cse9 .cse10 .cse11 .cse12 .cse32 .cse14 .cse16 .cse49 .cse18))) (let ((.cse70 (div .cse67 20))) (let ((.cse66 (= main_~ret~1 .cse70))) (and (or .cse66 (<= .cse67 (+ 19 (* (div (+ (- 1) .cse29 .cse2 .cse3 .cse5 .cse68 .cse30 .cse69 .cse7 .cse31 .cse47 main_~temp~0 .cse9 .cse10 .cse11 .cse12 .cse32 .cse14 .cse16 .cse49 .cse18) 20) 20)))) (<= main_~i~2 5) (or (and (<= (+ .cse29 .cse2 .cse3 .cse5 .cse68 .cse30 .cse69 .cse7 .cse31 .cse47 main_~temp~0 .cse9 .cse10 .cse11 .cse12 .cse32 .cse14 .cse16 .cse49 .cse18 1) 0) (= (+ .cse70 1) main_~ret~1) .cse24) (and (<= .cse67 (* .cse70 20)) .cse24) (and (<= 0 .cse67) .cse66 .cse24)) (<= .cse67 42949672940) (<= 5 main_~i~2) (<= 0 (+ .cse29 42949672960 .cse2 .cse3 .cse5 .cse68 .cse30 .cse69 .cse7 .cse31 .cse47 main_~temp~0 .cse9 .cse10 .cse11 .cse12 .cse32 .cse14 .cse16 .cse49 .cse18)) .cse21))))) (let ((.cse72 (select .cse34 (+ .cse22 32)))) (let ((.cse75 (+ .cse71 .cse29 .cse1 .cse5 .cse30 .cse69 .cse7 .cse31 .cse47 main_~temp~0 .cse9 .cse10 .cse11 .cse72 .cse73 .cse13 .cse74 .cse16 .cse49 .cse18))) (let ((.cse77 (div .cse75 20))) (let ((.cse76 (= main_~ret~1 .cse77))) (and (<= 0 (+ .cse71 .cse29 42949672960 .cse1 .cse5 .cse30 .cse69 .cse7 .cse31 .cse47 main_~temp~0 .cse9 .cse10 .cse11 .cse72 .cse73 .cse13 .cse74 .cse16 .cse49 .cse18)) (or (and (<= 0 .cse75) .cse76 .cse24) (and (= main_~ret~1 (+ .cse77 1)) (<= (+ .cse71 .cse29 .cse1 .cse5 .cse30 .cse69 .cse7 .cse31 .cse47 main_~temp~0 .cse9 .cse10 .cse11 .cse72 .cse73 .cse13 .cse74 .cse16 .cse49 .cse18 1) 0) .cse24) (and (<= (div (+ .cse71 .cse29 19 .cse1 .cse5 .cse30 .cse69 .cse7 .cse31 .cse47 main_~temp~0 .cse9 .cse10 .cse11 .cse72 .cse73 .cse13 .cse74 .cse16 .cse49 .cse18) 20) .cse77) .cse24)) (or (<= .cse75 (+ (* (div (+ .cse71 (- 1) .cse29 .cse1 .cse5 .cse30 .cse69 .cse7 .cse31 .cse47 main_~temp~0 .cse9 .cse10 .cse11 .cse72 .cse73 .cse13 .cse74 .cse16 .cse49 .cse18) 20) 20) 19)) .cse76) (<= 2 main_~i~2) (<= .cse75 42949672940) (<= main_~i~2 2) .cse21))))) (let ((.cse79 (+ .cse29 .cse2 .cse4 .cse5 .cse6 .cse7 main_~temp~0 .cse8 .cse10 .cse11 .cse12 .cse57 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse37 .cse59))) (let ((.cse81 (div .cse79 20))) (let ((.cse78 (= .cse81 main_~ret~1))) (and (<= 0 (+ .cse29 42949672960 .cse2 .cse4 .cse5 .cse6 .cse7 main_~temp~0 .cse8 .cse10 .cse11 .cse12 .cse57 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse37 .cse59)) (or (and .cse78 .cse24) (<= .cse79 (+ 19 (* (div (+ (- 1) .cse29 .cse2 .cse4 .cse5 .cse6 .cse7 main_~temp~0 .cse8 .cse10 .cse11 .cse12 .cse57 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse37 .cse59) 20) 20)))) .cse21 (= .cse22 .cse80) (or (and (<= 0 .cse79) .cse78 .cse24) (<= .cse79 (* .cse81 20)) (and (= main_~ret~1 (+ .cse81 1)) (<= (+ .cse29 .cse2 .cse4 .cse5 .cse6 .cse7 main_~temp~0 .cse8 .cse10 .cse11 .cse12 .cse57 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse37 .cse59 1) 0) .cse24)) (<= .cse79 42949672940))))) (and (<= main_~i~2 1) (<= 1 main_~i~2) (let ((.cse82 (select .cse34 (+ |main_~#x~0.offset| .cse22 72))) (.cse83 (select .cse34 (+ .cse22 36)))) (let ((.cse84 (+ .cse71 .cse29 .cse1 .cse3 .cse5 .cse69 .cse7 .cse47 main_~temp~0 .cse82 .cse9 .cse10 .cse32 .cse73 .cse13 .cse74 .cse16 .cse83 .cse49 .cse18))) (let ((.cse85 (div .cse84 20))) (let ((.cse86 (<= 0 (+ .cse71 .cse29 42949672960 .cse1 .cse3 .cse5 .cse69 .cse7 .cse47 main_~temp~0 .cse82 .cse9 .cse10 .cse32 .cse73 .cse13 .cse74 .cse16 .cse83 .cse49 .cse18))) (.cse87 (= .cse85 main_~ret~1))) (or (and (<= (+ .cse71 .cse29 .cse1 .cse3 .cse5 .cse69 .cse7 .cse47 main_~temp~0 .cse82 .cse9 .cse10 .cse32 .cse73 .cse13 .cse74 .cse16 .cse83 .cse49 .cse18 1) 0) (<= .cse84 (+ (* 20 (div (+ .cse71 (- 1) .cse29 .cse1 .cse3 .cse5 .cse69 .cse7 .cse47 main_~temp~0 .cse82 .cse9 .cse10 .cse32 .cse73 .cse13 .cse74 .cse16 .cse83 .cse49 .cse18) 20)) 19)) (= (+ .cse85 1) main_~ret~1) .cse86 .cse24) (and .cse87 (<= (+ .cse71 .cse29 .cse1 .cse3 .cse5 .cse69 .cse7 .cse47 main_~temp~0 .cse82 .cse9 .cse10 .cse32 .cse73 .cse13 .cse74 .cse16 20 .cse83 .cse49 .cse18) 0) (<= (div (+ .cse71 .cse29 19 .cse1 .cse3 .cse5 .cse69 .cse7 .cse47 main_~temp~0 .cse82 .cse9 .cse10 .cse32 .cse73 .cse13 .cse74 .cse16 .cse83 .cse49 .cse18) 20) .cse85) .cse86 .cse24) (and .cse87 (<= .cse84 42949672940) (<= 0 .cse84) .cse24)))))) .cse21) (and (let ((.cse93 (+ .cse29 .cse2 .cse54 .cse4 .cse6 .cse7 main_~temp~0 .cse8 .cse11 .cse12 .cse57 .cse14 .cse15 .cse16 .cse58 .cse17 .cse18 .cse19 .cse37 .cse59))) (let ((.cse90 (div .cse93 20))) (let ((.cse89 (<= 0 .cse93)) (.cse91 (<= .cse93 42949672940)) (.cse88 (= main_~ret~1 .cse90)) (.cse92 (<= 0 (+ .cse29 42949672960 .cse2 .cse54 .cse4 .cse6 .cse7 main_~temp~0 .cse8 .cse11 .cse12 .cse57 .cse14 .cse15 .cse16 .cse58 .cse17 .cse18 .cse19 .cse37 .cse59)))) (or (and (or (and .cse88 .cse89 .cse24) (and (<= (+ .cse29 .cse2 .cse54 .cse4 .cse6 .cse7 main_~temp~0 .cse8 .cse11 .cse12 .cse57 .cse14 .cse15 .cse16 .cse58 .cse17 .cse18 .cse19 .cse37 .cse59 1) 0) (= (+ .cse90 1) main_~ret~1) .cse24)) .cse91 .cse92 (<= .cse93 (+ 19 (* 20 (div (+ (- 1) .cse29 .cse2 .cse54 .cse4 .cse6 .cse7 main_~temp~0 .cse8 .cse11 .cse12 .cse57 .cse14 .cse15 .cse16 .cse58 .cse17 .cse18 .cse19 .cse37 .cse59) 20))))) (and (or (and .cse88 .cse89 .cse91 .cse24) (and (<= (+ .cse29 .cse2 .cse54 .cse4 .cse6 .cse7 main_~temp~0 .cse8 .cse11 .cse12 .cse57 .cse14 .cse15 .cse16 .cse58 20 .cse17 .cse18 .cse19 .cse37 .cse59) 0) .cse88 .cse92 .cse24)) (<= .cse93 (* 20 .cse90))))))) .cse21 (= .cse22 68)) (let ((.cse94 (select .cse34 (+ .cse22 24)))) (let ((.cse96 (+ .cse29 .cse1 .cse5 .cse30 .cse69 .cse7 .cse31 .cse47 main_~temp~0 .cse94 .cse10 .cse11 .cse12 .cse32 .cse73 .cse13 .cse14 .cse16 .cse49 .cse18))) (let ((.cse97 (div .cse96 20))) (let ((.cse95 (= main_~ret~1 .cse97))) (and (<= main_~i~2 4) (<= 0 (+ .cse29 42949672960 .cse1 .cse5 .cse30 .cse69 .cse7 .cse31 .cse47 main_~temp~0 .cse94 .cse10 .cse11 .cse12 .cse32 .cse73 .cse13 .cse14 .cse16 .cse49 .cse18)) (<= 4 main_~i~2) (or (and .cse95 .cse24) (<= .cse96 (+ (* (div (+ (- 1) .cse29 .cse1 .cse5 .cse30 .cse69 .cse7 .cse31 .cse47 main_~temp~0 .cse94 .cse10 .cse11 .cse12 .cse32 .cse73 .cse13 .cse14 .cse16 .cse49 .cse18) 20) 20) 19))) (or (and (<= (+ .cse29 .cse1 .cse5 .cse30 .cse69 .cse7 .cse31 .cse47 main_~temp~0 .cse94 .cse10 .cse11 .cse12 .cse32 .cse73 .cse13 .cse14 .cse16 .cse49 .cse18 1) 0) (= main_~ret~1 (+ .cse97 1)) .cse24) (<= (div (+ .cse29 19 .cse1 .cse5 .cse30 .cse69 .cse7 .cse31 .cse47 main_~temp~0 .cse94 .cse10 .cse11 .cse12 .cse32 .cse73 .cse13 .cse14 .cse16 .cse49 .cse18) 20) .cse97) (and .cse95 (<= 0 .cse96) .cse24)) .cse21 (<= .cse96 42949672940)))))) (and (let ((.cse98 (select .cse34 (+ .cse22 12)))) (let ((.cse103 (+ .cse29 .cse2 .cse3 .cse5 .cse30 .cse6 .cse7 .cse98 .cse31 .cse47 main_~temp~0 .cse9 .cse11 .cse12 .cse32 .cse13 .cse14 .cse15 .cse16 .cse18))) (let ((.cse104 (div .cse103 20))) (let ((.cse99 (= main_~ret~1 .cse104)) (.cse101 (<= 0 .cse103)) (.cse100 (<= 0 (+ .cse29 42949672960 .cse2 .cse3 .cse5 .cse30 .cse6 .cse7 .cse98 .cse31 .cse47 main_~temp~0 .cse9 .cse11 .cse12 .cse32 .cse13 .cse14 .cse15 .cse16 .cse18))) (.cse102 (<= .cse103 42949672940))) (or (and (or (and (<= (+ .cse29 .cse2 .cse3 .cse5 .cse30 .cse6 .cse7 .cse98 .cse31 .cse47 main_~temp~0 .cse9 .cse11 .cse12 .cse32 .cse13 .cse14 .cse15 .cse16 20 .cse18) 0) .cse99 .cse100 .cse24) (and .cse99 .cse101 .cse102 .cse24)) (<= .cse103 (* .cse104 20))) (and (<= .cse103 (+ 19 (* (div (+ (- 1) .cse29 .cse2 .cse3 .cse5 .cse30 .cse6 .cse7 .cse98 .cse31 .cse47 main_~temp~0 .cse9 .cse11 .cse12 .cse32 .cse13 .cse14 .cse15 .cse16 .cse18) 20) 20))) (or (and (<= (+ .cse29 .cse2 .cse3 .cse5 .cse30 .cse6 .cse7 .cse98 .cse31 .cse47 main_~temp~0 .cse9 .cse11 .cse12 .cse32 .cse13 .cse14 .cse15 .cse16 .cse18 1) 0) (= main_~ret~1 (+ .cse104 1)) .cse24) (and .cse99 .cse101 .cse24)) .cse100 .cse102)))))) (<= 7 main_~i~2) .cse21 (<= main_~i~2 7)) (let ((.cse105 (+ .cse29 .cse2 .cse54 .cse4 .cse6 .cse7 .cse55 main_~temp~0 .cse8 .cse11 .cse12 .cse57 .cse14 .cse15 .cse58 .cse17 .cse18 .cse19 .cse37 .cse59))) (let ((.cse107 (div .cse105 20))) (let ((.cse106 (= main_~ret~1 .cse107))) (and (<= .cse105 42949672940) (or .cse106 (<= .cse105 (+ 19 (* (div (+ (- 1) .cse29 .cse2 .cse54 .cse4 .cse6 .cse7 .cse55 main_~temp~0 .cse8 .cse11 .cse12 .cse57 .cse14 .cse15 .cse58 .cse17 .cse18 .cse19 .cse37 .cse59) 20) 20)))) (or (and .cse106 (<= 0 .cse105) .cse24) (and (<= (+ .cse29 .cse2 .cse54 .cse4 .cse6 .cse7 .cse55 main_~temp~0 .cse8 .cse11 .cse12 .cse57 .cse14 .cse15 .cse58 .cse17 .cse18 .cse19 .cse37 .cse59 1) 0) (= (+ .cse107 1) main_~ret~1) .cse24) (and (<= (div (+ .cse29 19 .cse2 .cse54 .cse4 .cse6 .cse7 .cse55 main_~temp~0 .cse8 .cse11 .cse12 .cse57 .cse14 .cse15 .cse58 .cse17 .cse18 .cse19 .cse37 .cse59) 20) .cse107) .cse24)) .cse21 (<= 0 (+ .cse29 42949672960 .cse2 .cse54 .cse4 .cse6 .cse7 .cse55 main_~temp~0 .cse8 .cse11 .cse12 .cse57 .cse14 .cse15 .cse58 .cse17 .cse18 .cse19 .cse37 .cse59)) (<= 18 main_~i~2) (<= main_~i~2 18))))) (and (<= 19 main_~i~2) .cse21 (let ((.cse108 (+ .cse29 .cse2 .cse54 .cse4 .cse6 .cse55 main_~temp~0 .cse56 .cse8 .cse11 .cse12 .cse57 .cse14 .cse15 .cse58 .cse17 .cse18 .cse19 .cse37 .cse59))) (let ((.cse110 (div .cse108 20))) (let ((.cse109 (<= 0 (+ .cse29 42949672960 .cse2 .cse54 .cse4 .cse6 .cse55 main_~temp~0 .cse56 .cse8 .cse11 .cse12 .cse57 .cse14 .cse15 .cse58 .cse17 .cse18 .cse19 .cse37 .cse59))) (.cse111 (= main_~ret~1 .cse110))) (or (and (<= (+ .cse29 .cse2 .cse54 .cse4 .cse6 .cse55 main_~temp~0 .cse56 .cse8 .cse11 .cse12 .cse57 .cse14 .cse15 .cse58 .cse17 .cse18 .cse19 .cse37 .cse59 1) 0) (<= .cse108 (+ 19 (* (div (+ (- 1) .cse29 .cse2 .cse54 .cse4 .cse6 .cse55 main_~temp~0 .cse56 .cse8 .cse11 .cse12 .cse57 .cse14 .cse15 .cse58 .cse17 .cse18 .cse19 .cse37 .cse59) 20) 20))) .cse109 (= (+ .cse110 1) main_~ret~1) .cse24) (and .cse109 (<= (div (+ .cse29 19 .cse2 .cse54 .cse4 .cse6 .cse55 main_~temp~0 .cse56 .cse8 .cse11 .cse12 .cse57 .cse14 .cse15 .cse58 .cse17 .cse18 .cse19 .cse37 .cse59) 20) .cse110) (<= (+ .cse29 .cse2 .cse54 .cse4 .cse6 .cse55 main_~temp~0 .cse56 .cse8 .cse11 .cse12 .cse57 .cse14 .cse15 .cse58 20 .cse17 .cse18 .cse19 .cse37 .cse59) 0) .cse111 .cse24) (and (<= 0 .cse108) (<= .cse108 42949672940) .cse111 .cse24)))))) (let ((.cse112 (+ .cse29 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 main_~temp~0 .cse8 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse37 .cse59))) (let ((.cse114 (div .cse112 20))) (let ((.cse113 (= main_~ret~1 .cse114))) (and (or (<= .cse112 (+ 19 (* 20 (div (+ (- 1) .cse29 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 main_~temp~0 .cse8 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse37 .cse59) 20)))) (and .cse113 .cse24)) (<= 0 (+ .cse29 42949672960 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 main_~temp~0 .cse8 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse37 .cse59)) (<= .cse112 42949672940) (or (and (= main_~ret~1 (+ .cse114 1)) (<= (+ .cse29 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 main_~temp~0 .cse8 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse37 .cse59 1) 0) .cse24) (and (<= 0 .cse112) .cse113 .cse24) (<= .cse112 (* 20 .cse114))) .cse21 (= 56 .cse22))))) (let ((.cse116 (select .cse34 (+ .cse22 28)))) (let ((.cse115 (+ .cse29 .cse1 .cse3 .cse5 .cse69 .cse7 .cse116 .cse31 .cse47 main_~temp~0 .cse9 .cse10 .cse11 .cse12 .cse32 .cse73 .cse74 .cse16 .cse49 .cse18))) (let ((.cse117 (div .cse115 20))) (let ((.cse118 (= main_~ret~1 .cse117))) (and (<= .cse115 42949672940) (<= 0 (+ .cse29 42949672960 .cse1 .cse3 .cse5 .cse69 .cse7 .cse116 .cse31 .cse47 main_~temp~0 .cse9 .cse10 .cse11 .cse12 .cse32 .cse73 .cse74 .cse16 .cse49 .cse18)) (or (<= (div (+ .cse29 19 .cse1 .cse3 .cse5 .cse69 .cse7 .cse116 .cse31 .cse47 main_~temp~0 .cse9 .cse10 .cse11 .cse12 .cse32 .cse73 .cse74 .cse16 .cse49 .cse18) 20) .cse117) (and .cse118 (<= 0 .cse115) .cse24) (and (= main_~ret~1 (+ .cse117 1)) (<= (+ .cse29 .cse1 .cse3 .cse5 .cse69 .cse7 .cse116 .cse31 .cse47 main_~temp~0 .cse9 .cse10 .cse11 .cse12 .cse32 .cse73 .cse74 .cse16 .cse49 .cse18 1) 0) .cse24)) (<= 3 main_~i~2) (or (and .cse118 .cse24) (<= .cse115 (+ (* (div (+ (- 1) .cse29 .cse1 .cse3 .cse5 .cse69 .cse7 .cse116 .cse31 .cse47 main_~temp~0 .cse9 .cse10 .cse11 .cse12 .cse32 .cse73 .cse74 .cse16 .cse49 .cse18) 20) 20) 19))) .cse21 (<= main_~i~2 3)))))) (and (let ((.cse120 (+ .cse29 .cse1 .cse2 .cse3 .cse4 .cse5 .cse30 .cse6 .cse7 main_~temp~0 .cse8 .cse9 .cse11 .cse12 .cse32 .cse13 .cse14 .cse15 .cse16 .cse18))) (let ((.cse121 (div .cse120 20))) (let ((.cse122 (<= 0 .cse120)) (.cse124 (<= .cse120 42949672940)) (.cse119 (<= 0 (+ .cse29 42949672960 .cse1 .cse2 .cse3 .cse4 .cse5 .cse30 .cse6 .cse7 main_~temp~0 .cse8 .cse9 .cse11 .cse12 .cse32 .cse13 .cse14 .cse15 .cse16 .cse18))) (.cse123 (= .cse121 main_~ret~1))) (or (and .cse119 (<= .cse120 (+ 19 (* 20 (div (+ (- 1) .cse29 .cse1 .cse2 .cse3 .cse4 .cse5 .cse30 .cse6 .cse7 main_~temp~0 .cse8 .cse9 .cse11 .cse12 .cse32 .cse13 .cse14 .cse15 .cse16 .cse18) 20)))) (or (and (<= (+ .cse29 .cse1 .cse2 .cse3 .cse4 .cse5 .cse30 .cse6 .cse7 main_~temp~0 .cse8 .cse9 .cse11 .cse12 .cse32 .cse13 .cse14 .cse15 .cse16 .cse18 1) 0) (= (+ .cse121 1) main_~ret~1) .cse24) (and .cse122 .cse123 .cse24)) .cse124) (and (or (and .cse122 .cse124 .cse123 .cse24) (and .cse119 (<= (+ .cse29 .cse1 .cse2 .cse3 .cse4 .cse5 .cse30 .cse6 .cse7 main_~temp~0 .cse8 .cse9 .cse11 .cse12 .cse32 .cse13 .cse14 .cse15 .cse16 20 .cse18) 0) .cse123 .cse24)) (<= .cse120 (* .cse121 20))))))) .cse21 (<= 9 main_~i~2) (<= main_~i~2 9)) (let ((.cse126 (+ .cse29 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 main_~temp~0 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse37))) (let ((.cse127 (div .cse126 20))) (let ((.cse125 (= main_~ret~1 .cse127))) (and (or .cse125 (<= .cse126 (+ 19 (* 20 (div (+ (- 1) .cse29 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 main_~temp~0 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse37) 20))))) (<= .cse126 42949672940) .cse21 (<= 0 (+ .cse29 42949672960 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 main_~temp~0 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse37)) (= .cse22 52) (or (and (= main_~ret~1 (+ .cse127 1)) (<= (+ .cse29 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 main_~temp~0 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse37 1) 0) .cse24) (and (<= .cse126 (* 20 .cse127)) .cse24) (and (<= 0 .cse126) .cse125 .cse24)))))) (and (let ((.cse129 (+ .cse29 .cse2 .cse4 .cse6 .cse7 main_~temp~0 .cse8 .cse10 .cse11 .cse12 .cse57 .cse14 .cse15 .cse16 .cse58 .cse17 .cse18 .cse19 .cse37 .cse59))) (let ((.cse131 (div .cse129 20))) (let ((.cse128 (= main_~ret~1 .cse131)) (.cse130 (<= 0 (+ .cse29 42949672960 .cse2 .cse4 .cse6 .cse7 main_~temp~0 .cse8 .cse10 .cse11 .cse12 .cse57 .cse14 .cse15 .cse16 .cse58 .cse17 .cse18 .cse19 .cse37 .cse59)))) (or (and .cse128 (<= .cse129 42949672940) (<= 0 .cse129) .cse24) (and (<= .cse129 (+ (* (div (+ (- 1) .cse29 .cse2 .cse4 .cse6 .cse7 main_~temp~0 .cse8 .cse10 .cse11 .cse12 .cse57 .cse14 .cse15 .cse16 .cse58 .cse17 .cse18 .cse19 .cse37 .cse59) 20) 20) 19)) .cse130 (<= (+ .cse29 .cse2 .cse4 .cse6 .cse7 main_~temp~0 .cse8 .cse10 .cse11 .cse12 .cse57 .cse14 .cse15 .cse16 .cse58 .cse17 .cse18 .cse19 .cse37 .cse59 1) 0) (= main_~ret~1 (+ .cse131 1)) .cse24) (and .cse128 (<= (+ .cse29 .cse2 .cse4 .cse6 .cse7 main_~temp~0 .cse8 .cse10 .cse11 .cse12 .cse57 .cse14 .cse15 .cse16 .cse58 20 .cse17 .cse18 .cse19 .cse37 .cse59) 0) (<= (div (+ .cse29 19 .cse2 .cse4 .cse6 .cse7 main_~temp~0 .cse8 .cse10 .cse11 .cse12 .cse57 .cse14 .cse15 .cse16 .cse58 .cse17 .cse18 .cse19 .cse37 .cse59) 20) .cse131) .cse130 .cse24))))) .cse21 (= .cse22 64))))) [2022-01-31 18:37:51,893 INFO L854 garLoopResultBuilder]: At program point L43-4(lines 43 45) the Hoare annotation is: (and (<= 19 main_~i~2) (= |main_~#x~0.offset| 0) (let ((.cse24 (select |#memory_int| |main_~#x~0.base|))) (let ((.cse0 (select .cse24 48)) (.cse1 (select .cse24 (+ |main_~#x~0.offset| 16))) (.cse2 (select .cse24 (+ |main_~#x~0.offset| 64))) (.cse3 (select .cse24 (+ |main_~#x~0.offset| 32))) (.cse4 (select .cse24 (+ |main_~#x~0.offset| 20))) (.cse5 (select .cse24 (+ |main_~#x~0.offset| 68))) (.cse6 (select .cse24 (+ |main_~#x~0.offset| 72))) (.cse7 (select .cse24 (+ |main_~#x~0.offset| 28))) (.cse8 (select .cse24 4)) (.cse9 (select .cse24 (+ |main_~#x~0.offset| 8))) (.cse10 (select .cse24 (+ 56 |main_~#x~0.offset|))) (.cse11 (select .cse24 (+ |main_~#x~0.offset| 12))) (.cse12 (select .cse24 (+ |main_~#x~0.offset| 24))) (.cse13 (select .cse24 (+ |main_~#x~0.offset| 60))) (.cse14 (select .cse24 (+ |main_~#x~0.offset| 40))) (.cse15 (select .cse24 0)) (.cse16 (select .cse24 (+ |main_~#x~0.offset| 36))) (.cse17 (select .cse24 (+ |main_~#x~0.offset| 44))) (.cse18 (select .cse24 (+ |main_~#x~0.offset| 52)))) (let ((.cse19 (+ .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 main_~temp~0 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18))) (let ((.cse21 (div .cse19 20))) (let ((.cse20 (<= 0 (+ .cse0 42949672960 .cse1 .cse2 .cse3 .cse4 .cse5 main_~temp~0 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18))) (.cse23 (= main_~ret~1 .cse21)) (.cse22 (= main_~ret~1 main_~ret2~0))) (or (and (<= (+ .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 main_~temp~0 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 1) 0) (<= .cse19 (+ 19 (* (div (+ (- 1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 main_~temp~0 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) 20) 20))) .cse20 (= (+ .cse21 1) main_~ret~1) .cse22) (and .cse20 (<= (div (+ .cse0 19 .cse1 .cse2 .cse3 .cse4 .cse5 main_~temp~0 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) 20) .cse21) (<= (+ .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 main_~temp~0 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 20 .cse14 .cse15 .cse16 .cse17 .cse18) 0) .cse23 .cse22) (and (<= 0 .cse19) (<= .cse19 42949672940) .cse23 .cse22)))))))) [2022-01-31 18:37:51,893 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-01-31 18:37:51,893 INFO L854 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-01-31 18:37:51,893 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-01-31 18:37:51,893 INFO L854 garLoopResultBuilder]: At program point avgEXIT(lines 15 24) the Hoare annotation is: (let ((.cse28 (select |#memory_int| |avg_#in~x.base|))) (let ((.cse23 (* 20 |avg_#res|)) (.cse3 (select .cse28 (+ 36 |avg_#in~x.offset|))) (.cse4 (select .cse28 (+ 12 |avg_#in~x.offset|))) (.cse5 (select .cse28 (+ 28 |avg_#in~x.offset|))) (.cse6 (select .cse28 (+ 76 |avg_#in~x.offset|))) (.cse7 (select .cse28 (+ 52 |avg_#in~x.offset|))) (.cse8 (select .cse28 (+ 32 |avg_#in~x.offset|))) (.cse9 (select .cse28 |avg_#in~x.offset|)) (.cse10 (select .cse28 (+ 72 |avg_#in~x.offset|))) (.cse11 (select .cse28 (+ 64 |avg_#in~x.offset|))) (.cse12 (select .cse28 (+ 40 |avg_#in~x.offset|))) (.cse13 (select .cse28 (+ |avg_#in~x.offset| 4))) (.cse14 (select .cse28 (+ 60 |avg_#in~x.offset|))) (.cse15 (select .cse28 (+ 8 |avg_#in~x.offset|))) (.cse16 (select .cse28 48)) (.cse17 (select .cse28 (+ 44 |avg_#in~x.offset|))) (.cse18 (select .cse28 (+ 68 |avg_#in~x.offset|))) (.cse19 (select .cse28 (+ |avg_#in~x.offset| 24))) (.cse21 (select .cse28 (+ 16 |avg_#in~x.offset|))) (.cse22 (select .cse28 (+ 20 |avg_#in~x.offset|))) (.cse20 (select .cse28 (+ 56 |avg_#in~x.offset|)))) (let ((.cse0 (+ .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 .cse20)) (.cse1 (<= 1 |avg_#in~x.offset|)) (.cse2 (<= (+ |avg_#in~x.offset| 1) 0)) (.cse24 (+ .cse23 19))) (and (or (and (<= .cse0 avg_~ret~0) (<= avg_~ret~0 .cse0)) .cse1 .cse2) (or .cse1 .cse2 (and (or (<= 1 (+ .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (* (div (+ (* (- 1) .cse7) (* (- 1) .cse14) (* (- 1) .cse20) 19 (* (- 1) .cse8) (* (- 1) .cse9) (* (- 1) .cse15) (* (- 1) .cse19) (* (- 1) .cse12) (* (- 1) .cse6) (* (- 1) .cse16) (* (- 1) .cse4) (* (- 1) .cse21) (* (- 1) .cse18) (* (- 1) .cse10) (* (- 1) .cse13) (* (- 1) .cse3) (* (- 1) .cse17) (* (- 1) .cse22) (* (- 1) .cse5) (* (- 1) .cse11)) 20) 20) .cse21 .cse22 .cse20)) (<= (+ .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 42949672980 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 .cse20) 0) (<= .cse23 .cse0) (<= 0 .cse0)) (or (<= 42949672960 .cse0) (<= .cse0 .cse24)))) (<= 20 avg_~i~0) (or .cse1 .cse2 (let ((.cse25 (select .cse28 40))) (let ((.cse27 (+ .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 .cse20 .cse25 1)) (.cse26 (+ .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 .cse20 .cse25))) (and (or (<= 0 (+ (* (div (+ (* .cse3 (- 19)) (* .cse14 (- 19)) (* .cse21 (- 19)) (* .cse5 (- 19)) (* .cse11 (- 19)) (* .cse4 (- 19)) (* .cse6 (- 19)) (* (- 19) .cse22) (* (- 19) .cse20) (* (- 19) .cse25) (* .cse10 (- 19)) (* .cse18 (- 19)) (* .cse16 (- 19)) (* .cse13 (- 19)) (* .cse19 (- 19)) (* .cse9 (- 19)) (* .cse15 (- 19)) (* .cse7 (- 19)) (* .cse8 (- 19)) (* .cse17 (- 19))) 380) 20) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 .cse20 .cse25)) (<= 0 .cse26) (and (or (<= (+ .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 42949672981 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 .cse20 .cse25) 0) (<= .cse23 (+ .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 20 .cse22 .cse20 .cse25))) (<= .cse27 .cse23))) (or (<= .cse27 0) (<= (+ .cse23 85899345920) .cse26) (and (<= .cse23 .cse26) (<= .cse26 .cse24)) (<= 85899345920 .cse26)))))))))) [2022-01-31 18:37:51,894 INFO L854 garLoopResultBuilder]: At program point L20-2(lines 20 22) the Hoare annotation is: (let ((.cse0 (* 4 avg_~i~0)) (.cse24 (select |#memory_int| avg_~x.base))) (let ((.cse29 (select .cse24 (+ 40 avg_~x.offset))) (.cse23 (select .cse24 (+ 56 avg_~x.offset))) (.cse6 (select .cse24 avg_~x.offset)) (.cse7 (select .cse24 48)) (.cse8 (select .cse24 (+ 32 avg_~x.offset))) (.cse25 (select .cse24 (+ 60 avg_~x.offset))) (.cse26 (select .cse24 (+ 64 avg_~x.offset))) (.cse12 (select .cse24 (+ 36 avg_~x.offset))) (.cse15 (select .cse24 40)) (.cse27 (select .cse24 (+ 52 avg_~x.offset))) (.cse18 (select .cse24 (+ 44 avg_~x.offset))) (.cse4 (<= (+ avg_~x.offset 1) 0)) (.cse19 (<= 1 avg_~x.offset)) (.cse2 (= |avg_#in~x.base| avg_~x.base)) (.cse3 (= |avg_#in~x.offset| avg_~x.offset)) (.cse21 (select .cse24 |avg_#in~x.offset|)) (.cse9 (select .cse24 (+ 16 avg_~x.offset))) (.cse10 (select .cse24 (+ avg_~x.offset 24))) (.cse11 (select .cse24 (+ 28 avg_~x.offset))) (.cse1 (select .cse24 (+ .cse0 avg_~x.offset))) (.cse13 (select .cse24 (+ 4 avg_~x.offset))) (.cse14 (select .cse24 (+ 12 avg_~x.offset))) (.cse16 (select .cse24 (+ 8 avg_~x.offset))) (.cse17 (select .cse24 (+ 20 avg_~x.offset)))) (or (and (= .cse0 0) (<= avg_~ret~0 .cse1) .cse2 (<= .cse1 avg_~ret~0) .cse3) (and (<= avg_~i~0 13) (or .cse4 (let ((.cse5 (+ .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse1 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18))) (and (<= avg_~ret~0 .cse5) (<= .cse5 avg_~ret~0))) .cse19) .cse2 (<= 13 avg_~i~0) .cse3) (let ((.cse20 (+ .cse21 .cse8 .cse9 .cse10 .cse11 .cse1 .cse13 .cse14 .cse16 .cse17))) (and .cse2 (<= 9 avg_~i~0) (<= avg_~i~0 9) (<= avg_~ret~0 .cse20) (<= .cse20 avg_~ret~0) .cse3)) (and .cse2 (<= avg_~i~0 18) (or (let ((.cse22 (+ .cse23 .cse6 .cse7 .cse8 .cse9 (select .cse24 (+ 68 avg_~x.offset)) .cse10 .cse25 .cse11 .cse26 .cse1 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse27 .cse18))) (and (<= avg_~ret~0 .cse22) (<= .cse22 avg_~ret~0))) .cse4 .cse19) (<= 18 avg_~i~0) .cse3) (let ((.cse28 (+ .cse21 .cse29 .cse8 .cse9 .cse10 .cse11 .cse1 .cse12 .cse13 .cse14 .cse16 .cse17))) (and (<= avg_~i~0 11) (<= avg_~ret~0 .cse28) .cse2 (<= .cse28 avg_~ret~0) (<= 11 avg_~i~0) .cse3)) (let ((.cse30 (+ .cse21 .cse1 .cse13 .cse14 .cse16))) (and (<= .cse30 avg_~ret~0) (<= avg_~ret~0 .cse30) .cse2 (<= 4 avg_~i~0) (<= avg_~i~0 4) .cse3)) (and (<= 14 avg_~i~0) .cse2 (<= avg_~i~0 14) (or .cse4 (let ((.cse31 (+ .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse1 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse27 .cse18))) (and (<= .cse31 avg_~ret~0) (<= avg_~ret~0 .cse31))) .cse19) .cse3) (let ((.cse32 (+ .cse21 .cse9 .cse1 .cse13 .cse14 .cse16 .cse17))) (and (<= .cse32 avg_~ret~0) (<= avg_~i~0 6) (<= avg_~ret~0 .cse32) (<= 6 avg_~i~0) .cse2 .cse3)) (and (<= 15 avg_~i~0) (<= avg_~i~0 15) .cse2 (or (let ((.cse33 (+ .cse23 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse1 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse27 .cse18))) (and (<= avg_~ret~0 .cse33) (<= .cse33 avg_~ret~0))) .cse4 .cse19) .cse3) (let ((.cse34 (+ .cse21 .cse1 .cse13 .cse16))) (and (<= avg_~i~0 3) (<= avg_~ret~0 .cse34) (<= .cse34 avg_~ret~0) .cse2 (<= 3 avg_~i~0) .cse3)) (and (or (let ((.cse35 (+ .cse23 .cse6 .cse7 .cse8 .cse9 .cse10 .cse25 .cse11 .cse1 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse27 .cse18))) (and (<= .cse35 avg_~ret~0) (<= avg_~ret~0 .cse35))) .cse4 .cse19) (<= 16 avg_~i~0) .cse2 (<= avg_~i~0 16) .cse3) (let ((.cse36 (+ .cse21 .cse9 .cse10 .cse1 .cse13 .cse14 .cse16 .cse17))) (and (<= 7 avg_~i~0) (<= avg_~i~0 7) (<= .cse36 avg_~ret~0) .cse2 (<= avg_~ret~0 .cse36) .cse3)) (let ((.cse37 (+ .cse21 .cse1))) (and .cse2 (<= 1 avg_~i~0) (<= avg_~i~0 1) (<= avg_~ret~0 .cse37) (<= .cse37 avg_~ret~0) .cse3)) (let ((.cse38 (+ .cse21 .cse8 .cse9 .cse10 .cse11 .cse1 .cse12 .cse13 .cse14 .cse16 .cse17))) (and (<= 10 avg_~i~0) .cse2 (<= avg_~ret~0 .cse38) (<= .cse38 avg_~ret~0) (<= avg_~i~0 10) .cse3)) (let ((.cse39 (+ .cse21 .cse1 .cse13))) (and (<= avg_~ret~0 .cse39) (<= .cse39 avg_~ret~0) (<= 2 avg_~i~0) .cse2 (<= avg_~i~0 2) .cse3)) (let ((.cse40 (+ .cse21 .cse9 .cse1 .cse13 .cse14 .cse16))) (and (<= 5 avg_~i~0) .cse2 (<= avg_~i~0 5) (<= avg_~ret~0 .cse40) (<= .cse40 avg_~ret~0) .cse3)) (let ((.cse41 (+ .cse21 .cse29 .cse8 .cse9 .cse10 .cse11 .cse1 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18))) (and (<= 12 avg_~i~0) (<= avg_~i~0 12) .cse2 (<= .cse41 avg_~ret~0) (<= avg_~ret~0 .cse41) .cse3)) (and (<= avg_~i~0 17) (or (let ((.cse42 (+ .cse23 .cse6 .cse7 .cse8 .cse9 .cse10 .cse25 .cse11 .cse26 .cse1 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse27 .cse18))) (and (<= avg_~ret~0 .cse42) (<= .cse42 avg_~ret~0))) .cse4 .cse19) (<= 17 avg_~i~0) .cse2 .cse3) (and (or (let ((.cse43 (let ((.cse44 (select |#memory_int| |avg_#in~x.base|))) (+ (select .cse44 (+ 36 |avg_#in~x.offset|)) (select .cse44 (+ 12 |avg_#in~x.offset|)) (select .cse44 (+ 28 |avg_#in~x.offset|)) (select .cse44 (+ 76 |avg_#in~x.offset|)) (select .cse44 (+ 52 |avg_#in~x.offset|)) (select .cse44 (+ 32 |avg_#in~x.offset|)) (select .cse44 |avg_#in~x.offset|) (select .cse44 (+ 72 |avg_#in~x.offset|)) (select .cse44 (+ 64 |avg_#in~x.offset|)) (select .cse44 (+ 40 |avg_#in~x.offset|)) (select .cse44 (+ |avg_#in~x.offset| 4)) (select .cse44 (+ 60 |avg_#in~x.offset|)) (select .cse44 (+ 8 |avg_#in~x.offset|)) (select .cse44 48) (select .cse44 (+ 44 |avg_#in~x.offset|)) (select .cse44 (+ 68 |avg_#in~x.offset|)) (select .cse44 (+ |avg_#in~x.offset| 24)) (select .cse44 (+ 16 |avg_#in~x.offset|)) (select .cse44 (+ 20 |avg_#in~x.offset|)) (select .cse44 (+ 56 |avg_#in~x.offset|)))))) (and (<= .cse43 avg_~ret~0) (<= avg_~ret~0 .cse43))) (<= 1 |avg_#in~x.offset|) (<= (+ |avg_#in~x.offset| 1) 0)) (<= 19 avg_~i~0) (<= avg_~i~0 19)) (let ((.cse45 (+ .cse21 .cse9 .cse10 .cse11 .cse1 .cse13 .cse14 .cse16 .cse17))) (and (<= 8 avg_~i~0) (<= avg_~ret~0 .cse45) .cse2 (<= .cse45 avg_~ret~0) (<= avg_~i~0 8) .cse3))))) [2022-01-31 18:37:51,894 INFO L854 garLoopResultBuilder]: At program point avgFINAL(lines 15 24) the Hoare annotation is: (let ((.cse28 (select |#memory_int| |avg_#in~x.base|))) (let ((.cse23 (* 20 |avg_#res|)) (.cse3 (select .cse28 (+ 36 |avg_#in~x.offset|))) (.cse4 (select .cse28 (+ 12 |avg_#in~x.offset|))) (.cse5 (select .cse28 (+ 28 |avg_#in~x.offset|))) (.cse6 (select .cse28 (+ 76 |avg_#in~x.offset|))) (.cse7 (select .cse28 (+ 52 |avg_#in~x.offset|))) (.cse8 (select .cse28 (+ 32 |avg_#in~x.offset|))) (.cse9 (select .cse28 |avg_#in~x.offset|)) (.cse10 (select .cse28 (+ 72 |avg_#in~x.offset|))) (.cse11 (select .cse28 (+ 64 |avg_#in~x.offset|))) (.cse12 (select .cse28 (+ 40 |avg_#in~x.offset|))) (.cse13 (select .cse28 (+ |avg_#in~x.offset| 4))) (.cse14 (select .cse28 (+ 60 |avg_#in~x.offset|))) (.cse15 (select .cse28 (+ 8 |avg_#in~x.offset|))) (.cse16 (select .cse28 48)) (.cse17 (select .cse28 (+ 44 |avg_#in~x.offset|))) (.cse18 (select .cse28 (+ 68 |avg_#in~x.offset|))) (.cse19 (select .cse28 (+ |avg_#in~x.offset| 24))) (.cse21 (select .cse28 (+ 16 |avg_#in~x.offset|))) (.cse22 (select .cse28 (+ 20 |avg_#in~x.offset|))) (.cse20 (select .cse28 (+ 56 |avg_#in~x.offset|)))) (let ((.cse0 (+ .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 .cse20)) (.cse1 (<= 1 |avg_#in~x.offset|)) (.cse2 (<= (+ |avg_#in~x.offset| 1) 0)) (.cse24 (+ .cse23 19))) (and (or (and (<= .cse0 avg_~ret~0) (<= avg_~ret~0 .cse0)) .cse1 .cse2) (or .cse1 .cse2 (and (or (<= 1 (+ .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (* (div (+ (* (- 1) .cse7) (* (- 1) .cse14) (* (- 1) .cse20) 19 (* (- 1) .cse8) (* (- 1) .cse9) (* (- 1) .cse15) (* (- 1) .cse19) (* (- 1) .cse12) (* (- 1) .cse6) (* (- 1) .cse16) (* (- 1) .cse4) (* (- 1) .cse21) (* (- 1) .cse18) (* (- 1) .cse10) (* (- 1) .cse13) (* (- 1) .cse3) (* (- 1) .cse17) (* (- 1) .cse22) (* (- 1) .cse5) (* (- 1) .cse11)) 20) 20) .cse21 .cse22 .cse20)) (<= (+ .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 42949672980 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 .cse20) 0) (<= .cse23 .cse0) (<= 0 .cse0)) (or (<= 42949672960 .cse0) (<= .cse0 .cse24)))) (<= 20 avg_~i~0) (or .cse1 .cse2 (let ((.cse25 (select .cse28 40))) (let ((.cse27 (+ .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 .cse20 .cse25 1)) (.cse26 (+ .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 .cse20 .cse25))) (and (or (<= 0 (+ (* (div (+ (* .cse3 (- 19)) (* .cse14 (- 19)) (* .cse21 (- 19)) (* .cse5 (- 19)) (* .cse11 (- 19)) (* .cse4 (- 19)) (* .cse6 (- 19)) (* (- 19) .cse22) (* (- 19) .cse20) (* (- 19) .cse25) (* .cse10 (- 19)) (* .cse18 (- 19)) (* .cse16 (- 19)) (* .cse13 (- 19)) (* .cse19 (- 19)) (* .cse9 (- 19)) (* .cse15 (- 19)) (* .cse7 (- 19)) (* .cse8 (- 19)) (* .cse17 (- 19))) 380) 20) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 .cse20 .cse25)) (<= 0 .cse26) (and (or (<= (+ .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 42949672981 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 .cse20 .cse25) 0) (<= .cse23 (+ .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 20 .cse22 .cse20 .cse25))) (<= .cse27 .cse23))) (or (<= .cse27 0) (<= (+ .cse23 85899345920) .cse26) (and (<= .cse23 .cse26) (<= .cse26 .cse24)) (<= 85899345920 .cse26)))))))))) [2022-01-31 18:37:51,894 INFO L854 garLoopResultBuilder]: At program point L20-3(lines 20 22) the Hoare annotation is: (let ((.cse33 (select |#memory_int| avg_~x.base))) (let ((.cse37 (select .cse33 (+ 40 avg_~x.offset))) (.cse3 (select .cse33 |avg_#in~x.offset|)) (.cse0 (= |avg_#in~x.base| avg_~x.base)) (.cse16 (select .cse33 (+ 56 avg_~x.offset))) (.cse17 (select .cse33 avg_~x.offset)) (.cse18 (select .cse33 48)) (.cse13 (select .cse33 (+ 32 avg_~x.offset))) (.cse4 (select .cse33 (+ 16 avg_~x.offset))) (.cse32 (select .cse33 (+ 68 avg_~x.offset))) (.cse5 (select .cse33 (+ avg_~x.offset 24))) (.cse19 (select .cse33 (+ 60 avg_~x.offset))) (.cse6 (select .cse33 (+ 28 avg_~x.offset))) (.cse34 (select .cse33 (+ 64 avg_~x.offset))) (.cse20 (select .cse33 (+ 36 avg_~x.offset))) (.cse7 (select .cse33 (+ 4 avg_~x.offset))) (.cse8 (select .cse33 (+ 12 avg_~x.offset))) (.cse21 (select .cse33 40)) (.cse9 (select .cse33 (+ 8 avg_~x.offset))) (.cse10 (select .cse33 (+ 20 avg_~x.offset))) (.cse22 (select .cse33 (+ 52 avg_~x.offset))) (.cse23 (select .cse33 (+ 44 avg_~x.offset))) (.cse14 (<= (+ avg_~x.offset 1) 0)) (.cse24 (<= 1 avg_~x.offset)) (.cse2 (= |avg_#in~x.offset| avg_~x.offset))) (or (let ((.cse1 (+ .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (and (<= 8 avg_~i~0) .cse0 (<= .cse1 avg_~ret~0) (<= avg_~i~0 8) (<= avg_~ret~0 .cse1) .cse2)) (let ((.cse11 (+ .cse3 .cse4 .cse7 .cse8 .cse9))) (and (<= 5 avg_~i~0) .cse0 (<= avg_~i~0 5) (<= avg_~ret~0 .cse11) (<= .cse11 avg_~ret~0) .cse2)) (let ((.cse12 (+ .cse3 .cse13 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (and (<= avg_~ret~0 .cse12) .cse0 (<= 9 avg_~i~0) (<= avg_~i~0 9) (<= .cse12 avg_~ret~0) .cse2)) (and (<= 16 avg_~i~0) .cse0 (<= avg_~i~0 16) (or .cse14 (let ((.cse15 (+ .cse16 .cse17 .cse18 .cse13 .cse4 .cse5 .cse19 .cse6 .cse20 .cse7 .cse8 .cse21 .cse9 .cse10 .cse22 .cse23))) (and (<= avg_~ret~0 .cse15) (<= .cse15 avg_~ret~0))) .cse24) .cse2) (let ((.cse25 (+ .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10))) (and (<= 7 avg_~i~0) (<= avg_~i~0 7) .cse0 (<= avg_~ret~0 .cse25) (<= .cse25 avg_~ret~0) .cse2)) (and (<= .cse3 avg_~ret~0) .cse0 (<= 1 avg_~i~0) (<= avg_~i~0 1) (<= avg_~ret~0 .cse3) .cse2) (and (<= 15 avg_~i~0) (<= avg_~i~0 15) (or .cse14 (let ((.cse26 (+ .cse16 .cse17 .cse18 .cse13 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse21 .cse9 .cse10 .cse22 .cse23))) (and (<= .cse26 avg_~ret~0) (<= avg_~ret~0 .cse26))) .cse24) .cse0 .cse2) (let ((.cse27 (+ .cse3 .cse7 .cse9))) (and (<= avg_~i~0 3) (<= avg_~ret~0 .cse27) .cse0 (<= .cse27 avg_~ret~0) (<= 3 avg_~i~0) .cse2)) (let ((.cse28 (+ .cse3 .cse7 .cse8 .cse9))) (and (<= avg_~ret~0 .cse28) .cse0 (<= .cse28 avg_~ret~0) (<= 4 avg_~i~0) (<= avg_~i~0 4) .cse2)) (let ((.cse29 (+ .cse3 .cse7))) (and (<= .cse29 avg_~ret~0) (<= 2 avg_~i~0) .cse0 (<= avg_~ret~0 .cse29) (<= avg_~i~0 2) .cse2)) (and (or .cse14 (let ((.cse30 (+ .cse17 .cse18 .cse13 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse21 .cse9 .cse10 .cse22 .cse23))) (and (<= avg_~ret~0 .cse30) (<= .cse30 avg_~ret~0))) .cse24) (<= 14 avg_~i~0) .cse0 (<= avg_~i~0 14) .cse2) (and .cse0 (or .cse14 (let ((.cse31 (+ .cse16 .cse17 .cse18 .cse13 .cse4 .cse32 (select .cse33 (+ 72 avg_~x.offset)) .cse5 .cse19 .cse6 .cse34 .cse20 .cse7 .cse8 .cse21 .cse9 .cse10 .cse22 .cse23))) (and (<= avg_~ret~0 .cse31) (<= .cse31 avg_~ret~0))) .cse24) (<= 19 avg_~i~0) (<= avg_~i~0 19) .cse2) (and (<= avg_~ret~0 0) (= (* 4 avg_~i~0) 0) (<= 0 avg_~ret~0) .cse0 .cse2) (and (<= avg_~i~0 17) (or (let ((.cse35 (+ .cse16 .cse17 .cse18 .cse13 .cse4 .cse5 .cse19 .cse6 .cse34 .cse20 .cse7 .cse8 .cse21 .cse9 .cse10 .cse22 .cse23))) (and (<= .cse35 avg_~ret~0) (<= avg_~ret~0 .cse35))) .cse14 .cse24) (<= 17 avg_~i~0) .cse0 .cse2) (let ((.cse36 (+ .cse3 .cse37 .cse13 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10))) (and (<= avg_~i~0 11) (<= avg_~ret~0 .cse36) .cse0 (<= 11 avg_~i~0) (<= .cse36 avg_~ret~0) .cse2)) (and (<= avg_~i~0 13) (or (let ((.cse38 (+ .cse17 .cse18 .cse13 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse21 .cse9 .cse10 .cse23))) (and (<= avg_~ret~0 .cse38) (<= .cse38 avg_~ret~0))) .cse14 .cse24) .cse0 (<= 13 avg_~i~0) .cse2) (let ((.cse39 (+ .cse3 .cse37 .cse13 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse23))) (and (<= 12 avg_~i~0) (<= avg_~i~0 12) (<= .cse39 avg_~ret~0) .cse0 (<= avg_~ret~0 .cse39) .cse2)) (let ((.cse40 (+ .cse3 .cse13 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10))) (and (<= 10 avg_~i~0) .cse0 (<= avg_~ret~0 .cse40) (<= .cse40 avg_~ret~0) (<= avg_~i~0 10) .cse2)) (let ((.cse41 (+ .cse3 .cse4 .cse7 .cse8 .cse9 .cse10))) (and (<= avg_~i~0 6) (<= 6 avg_~i~0) .cse0 (<= .cse41 avg_~ret~0) (<= avg_~ret~0 .cse41) .cse2)) (and .cse0 (or (let ((.cse42 (+ .cse16 .cse17 .cse18 .cse13 .cse4 .cse32 .cse5 .cse19 .cse6 .cse34 .cse20 .cse7 .cse8 .cse21 .cse9 .cse10 .cse22 .cse23))) (and (<= avg_~ret~0 .cse42) (<= .cse42 avg_~ret~0))) .cse14 .cse24) (<= avg_~i~0 18) (<= 18 avg_~i~0) .cse2) (and (or (let ((.cse43 (let ((.cse44 (select |#memory_int| |avg_#in~x.base|))) (+ (select .cse44 (+ 36 |avg_#in~x.offset|)) (select .cse44 (+ 12 |avg_#in~x.offset|)) (select .cse44 (+ 28 |avg_#in~x.offset|)) (select .cse44 (+ 76 |avg_#in~x.offset|)) (select .cse44 (+ 52 |avg_#in~x.offset|)) (select .cse44 (+ 32 |avg_#in~x.offset|)) (select .cse44 |avg_#in~x.offset|) (select .cse44 (+ 72 |avg_#in~x.offset|)) (select .cse44 (+ 64 |avg_#in~x.offset|)) (select .cse44 (+ 40 |avg_#in~x.offset|)) (select .cse44 (+ |avg_#in~x.offset| 4)) (select .cse44 (+ 60 |avg_#in~x.offset|)) (select .cse44 (+ 8 |avg_#in~x.offset|)) (select .cse44 48) (select .cse44 (+ 44 |avg_#in~x.offset|)) (select .cse44 (+ 68 |avg_#in~x.offset|)) (select .cse44 (+ |avg_#in~x.offset| 24)) (select .cse44 (+ 16 |avg_#in~x.offset|)) (select .cse44 (+ 20 |avg_#in~x.offset|)) (select .cse44 (+ 56 |avg_#in~x.offset|)))))) (and (<= .cse43 avg_~ret~0) (<= avg_~ret~0 .cse43))) (<= 1 |avg_#in~x.offset|) (<= (+ |avg_#in~x.offset| 1) 0)) (<= 20 avg_~i~0))))) [2022-01-31 18:37:51,894 INFO L854 garLoopResultBuilder]: At program point L20-4(lines 20 22) the Hoare annotation is: (and (or (let ((.cse0 (let ((.cse1 (select |#memory_int| |avg_#in~x.base|))) (+ (select .cse1 (+ 36 |avg_#in~x.offset|)) (select .cse1 (+ 12 |avg_#in~x.offset|)) (select .cse1 (+ 28 |avg_#in~x.offset|)) (select .cse1 (+ 76 |avg_#in~x.offset|)) (select .cse1 (+ 52 |avg_#in~x.offset|)) (select .cse1 (+ 32 |avg_#in~x.offset|)) (select .cse1 |avg_#in~x.offset|) (select .cse1 (+ 72 |avg_#in~x.offset|)) (select .cse1 (+ 64 |avg_#in~x.offset|)) (select .cse1 (+ 40 |avg_#in~x.offset|)) (select .cse1 (+ |avg_#in~x.offset| 4)) (select .cse1 (+ 60 |avg_#in~x.offset|)) (select .cse1 (+ 8 |avg_#in~x.offset|)) (select .cse1 48) (select .cse1 (+ 44 |avg_#in~x.offset|)) (select .cse1 (+ 68 |avg_#in~x.offset|)) (select .cse1 (+ |avg_#in~x.offset| 24)) (select .cse1 (+ 16 |avg_#in~x.offset|)) (select .cse1 (+ 20 |avg_#in~x.offset|)) (select .cse1 (+ 56 |avg_#in~x.offset|)))))) (and (<= .cse0 avg_~ret~0) (<= avg_~ret~0 .cse0))) (<= 1 |avg_#in~x.offset|) (<= (+ |avg_#in~x.offset| 1) 0)) (<= 20 avg_~i~0)) [2022-01-31 18:37:51,895 INFO L861 garLoopResultBuilder]: At program point avgENTRY(lines 15 24) the Hoare annotation is: true [2022-01-31 18:37:51,895 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-01-31 18:37:51,895 INFO L861 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-01-31 18:37:51,895 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-01-31 18:37:51,895 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-01-31 18:37:51,897 INFO L732 BasicCegarLoop]: Path program histogram: [58, 3, 1, 1] [2022-01-31 18:37:51,898 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-31 18:37:52,064 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 06:37:52 BoogieIcfgContainer [2022-01-31 18:37:52,064 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-31 18:37:52,065 INFO L158 Benchmark]: Toolchain (without parser) took 641280.09ms. Allocated memory was 182.5MB in the beginning and 4.5GB in the end (delta: 4.3GB). Free memory was 133.0MB in the beginning and 2.3GB in the end (delta: -2.1GB). Peak memory consumption was 2.8GB. Max. memory is 8.0GB. [2022-01-31 18:37:52,065 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 182.5MB. Free memory was 149.8MB in the beginning and 149.6MB in the end (delta: 143.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-01-31 18:37:52,065 INFO L158 Benchmark]: CACSL2BoogieTranslator took 248.60ms. Allocated memory is still 182.5MB. Free memory was 132.9MB in the beginning and 157.9MB in the end (delta: -25.1MB). Peak memory consumption was 9.6MB. Max. memory is 8.0GB. [2022-01-31 18:37:52,065 INFO L158 Benchmark]: Boogie Preprocessor took 21.89ms. Allocated memory is still 182.5MB. Free memory was 157.9MB in the beginning and 156.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-31 18:37:52,065 INFO L158 Benchmark]: RCFGBuilder took 275.21ms. Allocated memory is still 182.5MB. Free memory was 156.4MB in the beginning and 144.8MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-01-31 18:37:52,066 INFO L158 Benchmark]: TraceAbstraction took 640728.12ms. Allocated memory was 182.5MB in the beginning and 4.5GB in the end (delta: 4.3GB). Free memory was 144.3MB in the beginning and 2.3GB in the end (delta: -2.1GB). Peak memory consumption was 2.8GB. Max. memory is 8.0GB. [2022-01-31 18:37:52,066 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 182.5MB. Free memory was 149.8MB in the beginning and 149.6MB in the end (delta: 143.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 248.60ms. Allocated memory is still 182.5MB. Free memory was 132.9MB in the beginning and 157.9MB in the end (delta: -25.1MB). Peak memory consumption was 9.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 21.89ms. Allocated memory is still 182.5MB. Free memory was 157.9MB in the beginning and 156.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 275.21ms. Allocated memory is still 182.5MB. Free memory was 156.4MB in the beginning and 144.8MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 640728.12ms. Allocated memory was 182.5MB in the beginning and 4.5GB in the end (delta: 4.3GB). Free memory was 144.3MB in the beginning and 2.3GB in the end (delta: -2.1GB). Peak memory consumption was 2.8GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 50]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 34 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 640.5s, OverallIterations: 63, TraceHistogramMax: 61, PathProgramHistogramMax: 58, EmptinessCheckTime: 0.1s, AutomataDifference: 85.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 441.2s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2629 SdHoareTripleChecker+Valid, 34.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2441 mSDsluCounter, 3100 SdHoareTripleChecker+Invalid, 30.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1544 mSDsCounter, 1184 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 27368 IncrementalHoareTripleChecker+Invalid, 28552 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1184 mSolverCounterUnsat, 1556 mSDtfsCounter, 27368 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2316 GetRequests, 573 SyntacticMatches, 43 SemanticMatches, 1700 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17540 ImplicationChecksByTransitivity, 109.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=193occurred in iteration=60, InterpolantAutomatonStates: 988, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 63 MinimizatonAttempts, 66 StatesRemovedByMinimization, 56 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 31 LocationsWithAnnotation, 799 PreInvPairs, 1027 NumberOfFragments, 148254 HoareAnnotationTreeSize, 799 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 368.7s HoareSimplificationTime, 31 FomulaSimplificationsInter, 12363 FormulaSimplificationTreeSizeReductionInter, 72.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((4 <= i && x == 0) && unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x] <= 8589934588) && 0 <= unknown-#memory_int-unknown[x][x + 4] + 8589934592 + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x]) && i <= 4) || ((((unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 36] <= 23622320117 && 11 <= i) && x == 0) && 0 <= unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + 8] + 23622320128 + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 36]) && i <= 11)) || ((((i <= 7 && 7 <= i) && 0 <= unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + 15032385536 + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x]) && unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x] <= 15032385529) && x == 0)) || (((20 <= i && 0 <= unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 76] + 42949672960 + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 64] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + 68] + unknown-#memory_int-unknown[x][x + 72] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + 60] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52]) && unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 76] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 64] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + 68] + unknown-#memory_int-unknown[x][x + 72] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + 60] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52] <= 42949672940) && x == 0)) || ((((unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x] <= 4294967294 && i <= 2) && x == 0) && 2 <= i) && 0 <= unknown-#memory_int-unknown[x][x + 4] + 4294967296 + unknown-#memory_int-unknown[x][x])) || ((((0 <= unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 64] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + 68] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + 60] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 36] + 38654705664 + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52] && unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 64] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + 68] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + 60] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52] <= 38654705646) && x == 0) && i <= 18) && (48 + -1 * x) / 4 + 6 <= i)) || ((((0 <= unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + 25769803776 + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] && unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] <= 25769803764) && x + i * 4 <= 48) && x == 0) && 12 <= i)) || (x == 0 && i == 0)) || ((((0 <= unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 4] + 30064771072 + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52] && 14 <= i) && unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52] <= 30064771058) && x == 0) && i <= 14)) || ((((0 <= unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x] + 6442450944 && i <= 3) && unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x] <= 6442450941) && x == 0) && 3 <= i)) || ((((i <= 5 && 5 <= i) && unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x] <= 10737418235) && x == 0) && 0 <= unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + 10737418240 + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x])) || ((((i <= 8 && 8 <= i) && 0 <= 17179869184 + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x]) && x == 0) && unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x] <= 17179869176)) || ((((unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + 60] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52] <= 34359738352 && i <= 16) && 16 <= i) && x == 0) && 0 <= unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + 60] + unknown-#memory_int-unknown[x][x + 40] + 34359738368 + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52])) || ((((6 <= i && x == 0) && i <= 6) && unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x] <= 12884901882) && 0 <= unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + 12884901888 + unknown-#memory_int-unknown[x][x])) || ((((0 <= unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + 8] + 19327352832 + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x] && unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x] <= 19327352823) && i <= 9) && 9 <= i) && x == 0)) || ((((i <= 13 && (48 + -1 * x) / 4 + 1 <= i) && x == 0) && 0 <= unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 36] + 27917287424 + unknown-#memory_int-unknown[x][x + 44]) && unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] <= 27917287411)) || ((((19 <= i && 0 <= unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 4] + 40802189312 + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 64] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + 68] + unknown-#memory_int-unknown[x][x + 72] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + 60] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52]) && i <= 19) && unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 64] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + 68] + unknown-#memory_int-unknown[x][x + 72] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + 60] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52] <= 40802189293) && x == 0)) || ((((0 <= unknown-#memory_int-unknown[x][x] + 2147483648 && 1 <= i) && unknown-#memory_int-unknown[x][x] <= 2147483647) && i <= 1) && x == 0)) || ((((10 <= i && 0 <= unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x] + 21474836480 + unknown-#memory_int-unknown[x][x + 36]) && x == 0) && i <= 10) && unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 36] <= 21474836470)) || ((((unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52] <= 32212254705 && i <= 15) && 0 <= unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + 8] + 32212254720 + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52]) && (48 + -1 * x) / 4 + 3 <= i) && x == 0)) || ((((i <= 17 && unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 64] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + 60] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52] <= 36507221999) && x == 0) && 0 <= unknown-#memory_int-unknown[x][48] + 36507222016 + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 64] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + 60] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52]) && 17 <= i) - InvariantResult [Line: 43]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] <= 19 + 20 * ((-1 + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36]) / 20) || ret == (unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36]) / 20) && x == 0) && 44 == x + i * 4) && ((((unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + 1 <= 0 && ret == (unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36]) / 20 + 1) && ret == ret2) || ((ret == (unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36]) / 20 && 0 <= unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36]) && ret == ret2)) || ((19 + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36]) / 20 <= (unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36]) / 20 && ret == ret2))) && unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] <= 42949672940) && 0 <= 42949672960 + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36]) || ((((((((0 <= unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 36] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 44] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 40 + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][i * 4 + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][0] && unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 36] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 44] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 40 + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][i * 4 + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][0] <= 42949672940) && ret == (unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 36] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 44] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 40 + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][i * 4 + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][0]) / 20) && ret == ret2) || ((((ret == (unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 36] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 44] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 40 + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][i * 4 + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][0]) / 20 + 1 && 0 <= unknown-#memory_int-unknown[x][48] + 42949672960 + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 36] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 44] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 40 + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][i * 4 + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][0]) && unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 36] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 44] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 40 + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][i * 4 + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][0] + 1 <= 0) && unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 36] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 44] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 40 + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][i * 4 + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][0] <= 19 + (-1 + unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 36] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 44] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 40 + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][i * 4 + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][0]) / 20 * 20) && ret == ret2)) || ((((0 <= unknown-#memory_int-unknown[x][48] + 42949672960 + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 36] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 44] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 40 + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][i * 4 + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][0] && ret == (unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 36] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 44] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 40 + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][i * 4 + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][0]) / 20) && unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 36] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 44] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 40 + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][i * 4 + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + 20 + unknown-#memory_int-unknown[x][0] <= 0) && (unknown-#memory_int-unknown[x][48] + 19 + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 36] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 44] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 40 + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][i * 4 + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][0]) / 20 <= (unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 36] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 44] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 40 + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][i * 4 + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][0]) / 20) && ret == ret2)) && i <= 8) && x == 0) && 8 <= i)) || (((((((unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] <= (unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44]) / 20 * 20 || ((unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + 1 <= 0 && (unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44]) / 20 + 1 == ret) && ret == ret2)) || ((ret == (unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44]) / 20 && 0 <= unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44]) && ret == ret2)) && unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] <= 42949672940) && x == 0) && i * 4 == 48) && ((ret == (unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44]) / 20 && ret == ret2) || unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] <= 19 + (-1 + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44]) / 20 * 20)) && 0 <= 42949672960 + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44])) || (((((((((0 <= unknown-#memory_int-unknown[x][48] + 42949672960 + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 36] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] && ret == (unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 36] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36]) / 20) && unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 36] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + 20 + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] <= 0) && ret == ret2) || (((0 <= unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 36] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] && ret == (unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 36] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36]) / 20) && unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 36] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] <= 42949672940) && ret == ret2)) && unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 36] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] <= 20 * ((unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 36] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36]) / 20)) || (((0 <= unknown-#memory_int-unknown[x][48] + 42949672960 + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 36] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] && unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 36] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] <= 19 + (-1 + unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 36] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36]) / 20 * 20) && (((ret == 1 + (unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 36] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36]) / 20 && unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 36] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + 1 <= 0) && ret == ret2) || ((0 <= unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 36] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] && ret == (unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 36] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36]) / 20) && ret == ret2))) && unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 36] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] <= 42949672940)) && 10 <= i) && x == 0) && i <= 10)) || ((((((((ret == (unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 36] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 44] + unknown-#memory_int-unknown[x][x + i * 4 + 48] + temp + unknown-#memory_int-unknown[x][i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 40 + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 52] + unknown-#memory_int-unknown[x][0]) / 20 && ret == ret2) || unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 36] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 44] + unknown-#memory_int-unknown[x][x + i * 4 + 48] + temp + unknown-#memory_int-unknown[x][i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 40 + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 52] + unknown-#memory_int-unknown[x][0] <= 19 + (-1 + unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 36] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 44] + unknown-#memory_int-unknown[x][x + i * 4 + 48] + temp + unknown-#memory_int-unknown[x][i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 40 + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 52] + unknown-#memory_int-unknown[x][0]) / 20 * 20) && 0 <= unknown-#memory_int-unknown[x][48] + 42949672960 + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 36] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 44] + unknown-#memory_int-unknown[x][x + i * 4 + 48] + temp + unknown-#memory_int-unknown[x][i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 40 + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 52] + unknown-#memory_int-unknown[x][0]) && i <= 6) && 6 <= i) && unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 36] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 44] + unknown-#memory_int-unknown[x][x + i * 4 + 48] + temp + unknown-#memory_int-unknown[x][i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 40 + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 52] + unknown-#memory_int-unknown[x][0] <= 42949672940) && ((((ret == (unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 36] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 44] + unknown-#memory_int-unknown[x][x + i * 4 + 48] + temp + unknown-#memory_int-unknown[x][i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 40 + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 52] + unknown-#memory_int-unknown[x][0]) / 20 && 0 <= unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 36] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 44] + unknown-#memory_int-unknown[x][x + i * 4 + 48] + temp + unknown-#memory_int-unknown[x][i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 40 + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 52] + unknown-#memory_int-unknown[x][0]) && ret == ret2) || ((ret == (unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 36] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 44] + unknown-#memory_int-unknown[x][x + i * 4 + 48] + temp + unknown-#memory_int-unknown[x][i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 40 + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 52] + unknown-#memory_int-unknown[x][0]) / 20 + 1 && unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 36] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 44] + unknown-#memory_int-unknown[x][x + i * 4 + 48] + temp + unknown-#memory_int-unknown[x][i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 40 + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 52] + unknown-#memory_int-unknown[x][0] + 1 <= 0) && ret == ret2)) || (unknown-#memory_int-unknown[x][48] + 19 + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 36] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 44] + unknown-#memory_int-unknown[x][x + i * 4 + 48] + temp + unknown-#memory_int-unknown[x][i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 40 + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 52] + unknown-#memory_int-unknown[x][0]) / 20 <= (unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 36] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 44] + unknown-#memory_int-unknown[x][x + i * 4 + 48] + temp + unknown-#memory_int-unknown[x][i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 40 + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 52] + unknown-#memory_int-unknown[x][0]) / 20)) && x == 0)) || (((((((unknown-#memory_int-unknown[x][40] + unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 76] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 64] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + 68] + temp + unknown-#memory_int-unknown[x][x + 72] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + 60] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52] <= 42949672940 && 0 <= unknown-#memory_int-unknown[x][40] + unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 76] + 42949672960 + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 64] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + 68] + temp + unknown-#memory_int-unknown[x][x + 72] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + 60] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52]) && unknown-#memory_int-unknown[x][40] + unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 76] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 64] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + 68] + temp + unknown-#memory_int-unknown[x][x + 72] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + 60] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52] <= 19 + 20 * ((unknown-#memory_int-unknown[x][40] + -1 + unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 76] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 64] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + 68] + temp + unknown-#memory_int-unknown[x][x + 72] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + 60] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52]) / 20)) && ((unknown-#memory_int-unknown[x][40] + unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 76] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 64] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + 68] + temp + unknown-#memory_int-unknown[x][x + 72] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + 60] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52] + 1 <= 0 && (unknown-#memory_int-unknown[x][40] + unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 76] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 64] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + 68] + temp + unknown-#memory_int-unknown[x][x + 72] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + 60] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52]) / 20 + 1 == ret) || ((unknown-#memory_int-unknown[x][40] + unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 76] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 64] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + 68] + temp + unknown-#memory_int-unknown[x][x + 72] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + 60] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52]) / 20 == ret && 0 <= unknown-#memory_int-unknown[x][40] + unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 76] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 64] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + 68] + temp + unknown-#memory_int-unknown[x][x + 72] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + 60] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52]))) || (unknown-#memory_int-unknown[x][40] + unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 76] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 64] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + 68] + temp + unknown-#memory_int-unknown[x][x + 72] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + 60] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52] <= (unknown-#memory_int-unknown[x][40] + unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 76] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 64] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + 68] + temp + unknown-#memory_int-unknown[x][x + 72] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + 60] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52]) / 20 * 20 && (unknown-#memory_int-unknown[x][40] + unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 76] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 64] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + 68] + temp + unknown-#memory_int-unknown[x][x + 72] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + 60] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52]) / 20 == ret)) && ((((((unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 76] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 64] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + 68] + unknown-#memory_int-unknown[x][x + 72] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + 60] + 20 + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52] <= 0 && (unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 76] + 19 + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 64] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + 68] + unknown-#memory_int-unknown[x][x + 72] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + 60] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52]) / 20 <= (unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 76] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 64] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + 68] + unknown-#memory_int-unknown[x][x + 72] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + 60] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52]) / 20) && 0 <= unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 76] + 42949672960 + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 64] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + 68] + unknown-#memory_int-unknown[x][x + 72] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + 60] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52]) && ret == (unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 76] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 64] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + 68] + unknown-#memory_int-unknown[x][x + 72] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + 60] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52]) / 20) && ret == ret2) || ((((unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 76] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 64] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + 68] + unknown-#memory_int-unknown[x][x + 72] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + 60] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52] + 1 <= 0 && unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 76] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 64] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + 68] + unknown-#memory_int-unknown[x][x + 72] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + 60] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52] <= 19 + (-1 + unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 76] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 64] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + 68] + unknown-#memory_int-unknown[x][x + 72] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + 60] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52]) / 20 * 20) && 0 <= unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 76] + 42949672960 + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 64] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + 68] + unknown-#memory_int-unknown[x][x + 72] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + 60] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52]) && (unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 76] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 64] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + 68] + unknown-#memory_int-unknown[x][x + 72] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + 60] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52]) / 20 + 1 == ret) && ret == ret2)) || (((0 <= unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 76] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 64] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + 68] + unknown-#memory_int-unknown[x][x + 72] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + 60] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52] && unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 76] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 64] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + 68] + unknown-#memory_int-unknown[x][x + 72] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + 60] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52] <= 42949672940) && ret == (unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 76] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 64] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + 68] + unknown-#memory_int-unknown[x][x + 72] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + 60] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52]) / 20) && ret == ret2))) && x == 0) && i == 0)) || (((((((ret == (unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 36] + unknown-#memory_int-unknown[x][56 + x + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 44] + unknown-#memory_int-unknown[x][x + i * 4 + 48] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 40 + i * 4] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 52] + unknown-#memory_int-unknown[x][0]) / 20 || unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 36] + unknown-#memory_int-unknown[x][56 + x + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 44] + unknown-#memory_int-unknown[x][x + i * 4 + 48] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 40 + i * 4] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 52] + unknown-#memory_int-unknown[x][0] <= 19 + (-1 + unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 36] + unknown-#memory_int-unknown[x][56 + x + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 44] + unknown-#memory_int-unknown[x][x + i * 4 + 48] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 40 + i * 4] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 52] + unknown-#memory_int-unknown[x][0]) / 20 * 20) && i <= 5) && ((((unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 36] + unknown-#memory_int-unknown[x][56 + x + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 44] + unknown-#memory_int-unknown[x][x + i * 4 + 48] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 40 + i * 4] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 52] + unknown-#memory_int-unknown[x][0] + 1 <= 0 && (unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 36] + unknown-#memory_int-unknown[x][56 + x + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 44] + unknown-#memory_int-unknown[x][x + i * 4 + 48] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 40 + i * 4] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 52] + unknown-#memory_int-unknown[x][0]) / 20 + 1 == ret) && ret == ret2) || (unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 36] + unknown-#memory_int-unknown[x][56 + x + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 44] + unknown-#memory_int-unknown[x][x + i * 4 + 48] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 40 + i * 4] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 52] + unknown-#memory_int-unknown[x][0] <= (unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 36] + unknown-#memory_int-unknown[x][56 + x + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 44] + unknown-#memory_int-unknown[x][x + i * 4 + 48] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 40 + i * 4] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 52] + unknown-#memory_int-unknown[x][0]) / 20 * 20 && ret == ret2)) || ((0 <= unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 36] + unknown-#memory_int-unknown[x][56 + x + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 44] + unknown-#memory_int-unknown[x][x + i * 4 + 48] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 40 + i * 4] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 52] + unknown-#memory_int-unknown[x][0] && ret == (unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 36] + unknown-#memory_int-unknown[x][56 + x + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 44] + unknown-#memory_int-unknown[x][x + i * 4 + 48] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 40 + i * 4] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 52] + unknown-#memory_int-unknown[x][0]) / 20) && ret == ret2))) && unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 36] + unknown-#memory_int-unknown[x][56 + x + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 44] + unknown-#memory_int-unknown[x][x + i * 4 + 48] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 40 + i * 4] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 52] + unknown-#memory_int-unknown[x][0] <= 42949672940) && 5 <= i) && 0 <= unknown-#memory_int-unknown[x][48] + 42949672960 + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 36] + unknown-#memory_int-unknown[x][56 + x + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 44] + unknown-#memory_int-unknown[x][x + i * 4 + 48] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 40 + i * 4] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 52] + unknown-#memory_int-unknown[x][0]) && x == 0)) || ((((((0 <= unknown-#memory_int-unknown[x][x + i * 4 + 68] + unknown-#memory_int-unknown[x][48] + 42949672960 + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 36] + unknown-#memory_int-unknown[x][56 + x + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 44] + unknown-#memory_int-unknown[x][x + i * 4 + 48] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][i * 4 + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 60] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 64] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 52] + unknown-#memory_int-unknown[x][0] && ((((0 <= unknown-#memory_int-unknown[x][x + i * 4 + 68] + unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 36] + unknown-#memory_int-unknown[x][56 + x + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 44] + unknown-#memory_int-unknown[x][x + i * 4 + 48] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][i * 4 + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 60] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 64] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 52] + unknown-#memory_int-unknown[x][0] && ret == (unknown-#memory_int-unknown[x][x + i * 4 + 68] + unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 36] + unknown-#memory_int-unknown[x][56 + x + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 44] + unknown-#memory_int-unknown[x][x + i * 4 + 48] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][i * 4 + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 60] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 64] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 52] + unknown-#memory_int-unknown[x][0]) / 20) && ret == ret2) || ((ret == (unknown-#memory_int-unknown[x][x + i * 4 + 68] + unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 36] + unknown-#memory_int-unknown[x][56 + x + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 44] + unknown-#memory_int-unknown[x][x + i * 4 + 48] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][i * 4 + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 60] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 64] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 52] + unknown-#memory_int-unknown[x][0]) / 20 + 1 && unknown-#memory_int-unknown[x][x + i * 4 + 68] + unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 36] + unknown-#memory_int-unknown[x][56 + x + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 44] + unknown-#memory_int-unknown[x][x + i * 4 + 48] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][i * 4 + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 60] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 64] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 52] + unknown-#memory_int-unknown[x][0] + 1 <= 0) && ret == ret2)) || ((unknown-#memory_int-unknown[x][x + i * 4 + 68] + unknown-#memory_int-unknown[x][48] + 19 + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 36] + unknown-#memory_int-unknown[x][56 + x + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 44] + unknown-#memory_int-unknown[x][x + i * 4 + 48] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][i * 4 + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 60] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 64] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 52] + unknown-#memory_int-unknown[x][0]) / 20 <= (unknown-#memory_int-unknown[x][x + i * 4 + 68] + unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 36] + unknown-#memory_int-unknown[x][56 + x + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 44] + unknown-#memory_int-unknown[x][x + i * 4 + 48] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][i * 4 + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 60] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 64] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 52] + unknown-#memory_int-unknown[x][0]) / 20 && ret == ret2))) && (unknown-#memory_int-unknown[x][x + i * 4 + 68] + unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 36] + unknown-#memory_int-unknown[x][56 + x + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 44] + unknown-#memory_int-unknown[x][x + i * 4 + 48] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][i * 4 + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 60] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 64] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 52] + unknown-#memory_int-unknown[x][0] <= (unknown-#memory_int-unknown[x][x + i * 4 + 68] + -1 + unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 36] + unknown-#memory_int-unknown[x][56 + x + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 44] + unknown-#memory_int-unknown[x][x + i * 4 + 48] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][i * 4 + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 60] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 64] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 52] + unknown-#memory_int-unknown[x][0]) / 20 * 20 + 19 || ret == (unknown-#memory_int-unknown[x][x + i * 4 + 68] + unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 36] + unknown-#memory_int-unknown[x][56 + x + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 44] + unknown-#memory_int-unknown[x][x + i * 4 + 48] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][i * 4 + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 60] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 64] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 52] + unknown-#memory_int-unknown[x][0]) / 20)) && 2 <= i) && unknown-#memory_int-unknown[x][x + i * 4 + 68] + unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 36] + unknown-#memory_int-unknown[x][56 + x + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 44] + unknown-#memory_int-unknown[x][x + i * 4 + 48] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][i * 4 + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 60] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 64] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 52] + unknown-#memory_int-unknown[x][0] <= 42949672940) && i <= 2) && x == 0)) || (((((0 <= unknown-#memory_int-unknown[x][48] + 42949672960 + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52] && (((unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52]) / 20 == ret && ret == ret2) || unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52] <= 19 + (-1 + unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52]) / 20 * 20)) && x == 0) && i * 4 == x + 60) && ((((0 <= unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52] && (unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52]) / 20 == ret) && ret == ret2) || unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52] <= (unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52]) / 20 * 20) || ((ret == (unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52]) / 20 + 1 && unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52] + 1 <= 0) && ret == ret2))) && unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52] <= 42949672940)) || (((i <= 1 && 1 <= i) && ((((((unknown-#memory_int-unknown[x][x + i * 4 + 68] + unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][56 + x + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 48] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 72] + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][x + 40 + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 60] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 64] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][i * 4 + 36] + unknown-#memory_int-unknown[x][x + i * 4 + 52] + unknown-#memory_int-unknown[x][0] + 1 <= 0 && unknown-#memory_int-unknown[x][x + i * 4 + 68] + unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][56 + x + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 48] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 72] + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][x + 40 + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 60] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 64] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][i * 4 + 36] + unknown-#memory_int-unknown[x][x + i * 4 + 52] + unknown-#memory_int-unknown[x][0] <= 20 * ((unknown-#memory_int-unknown[x][x + i * 4 + 68] + -1 + unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][56 + x + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 48] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 72] + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][x + 40 + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 60] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 64] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][i * 4 + 36] + unknown-#memory_int-unknown[x][x + i * 4 + 52] + unknown-#memory_int-unknown[x][0]) / 20) + 19) && (unknown-#memory_int-unknown[x][x + i * 4 + 68] + unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][56 + x + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 48] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 72] + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][x + 40 + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 60] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 64] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][i * 4 + 36] + unknown-#memory_int-unknown[x][x + i * 4 + 52] + unknown-#memory_int-unknown[x][0]) / 20 + 1 == ret) && 0 <= unknown-#memory_int-unknown[x][x + i * 4 + 68] + unknown-#memory_int-unknown[x][48] + 42949672960 + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][56 + x + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 48] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 72] + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][x + 40 + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 60] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 64] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][i * 4 + 36] + unknown-#memory_int-unknown[x][x + i * 4 + 52] + unknown-#memory_int-unknown[x][0]) && ret == ret2) || (((((unknown-#memory_int-unknown[x][x + i * 4 + 68] + unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][56 + x + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 48] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 72] + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][x + 40 + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 60] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 64] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][i * 4 + 36] + unknown-#memory_int-unknown[x][x + i * 4 + 52] + unknown-#memory_int-unknown[x][0]) / 20 == ret && unknown-#memory_int-unknown[x][x + i * 4 + 68] + unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][56 + x + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 48] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 72] + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][x + 40 + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 60] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 64] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + 20 + unknown-#memory_int-unknown[x][i * 4 + 36] + unknown-#memory_int-unknown[x][x + i * 4 + 52] + unknown-#memory_int-unknown[x][0] <= 0) && (unknown-#memory_int-unknown[x][x + i * 4 + 68] + unknown-#memory_int-unknown[x][48] + 19 + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][56 + x + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 48] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 72] + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][x + 40 + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 60] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 64] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][i * 4 + 36] + unknown-#memory_int-unknown[x][x + i * 4 + 52] + unknown-#memory_int-unknown[x][0]) / 20 <= (unknown-#memory_int-unknown[x][x + i * 4 + 68] + unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][56 + x + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 48] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 72] + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][x + 40 + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 60] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 64] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][i * 4 + 36] + unknown-#memory_int-unknown[x][x + i * 4 + 52] + unknown-#memory_int-unknown[x][0]) / 20) && 0 <= unknown-#memory_int-unknown[x][x + i * 4 + 68] + unknown-#memory_int-unknown[x][48] + 42949672960 + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][56 + x + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 48] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 72] + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][x + 40 + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 60] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 64] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][i * 4 + 36] + unknown-#memory_int-unknown[x][x + i * 4 + 52] + unknown-#memory_int-unknown[x][0]) && ret == ret2)) || ((((unknown-#memory_int-unknown[x][x + i * 4 + 68] + unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][56 + x + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 48] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 72] + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][x + 40 + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 60] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 64] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][i * 4 + 36] + unknown-#memory_int-unknown[x][x + i * 4 + 52] + unknown-#memory_int-unknown[x][0]) / 20 == ret && unknown-#memory_int-unknown[x][x + i * 4 + 68] + unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][56 + x + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 48] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 72] + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][x + 40 + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 60] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 64] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][i * 4 + 36] + unknown-#memory_int-unknown[x][x + i * 4 + 52] + unknown-#memory_int-unknown[x][0] <= 42949672940) && 0 <= unknown-#memory_int-unknown[x][x + i * 4 + 68] + unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][56 + x + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 48] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 72] + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][x + 40 + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 60] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 64] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][i * 4 + 36] + unknown-#memory_int-unknown[x][x + i * 4 + 52] + unknown-#memory_int-unknown[x][0]) && ret == ret2))) && x == 0)) || (((((((((ret == (unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 64] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + 60] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52]) / 20 && 0 <= unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 64] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + 60] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52]) && ret == ret2) || ((unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 64] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + 60] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52] + 1 <= 0 && (unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 64] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + 60] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52]) / 20 + 1 == ret) && ret == ret2)) && unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 64] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + 60] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52] <= 42949672940) && 0 <= unknown-#memory_int-unknown[x][48] + 42949672960 + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 64] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + 60] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52]) && unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 64] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + 60] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52] <= 19 + 20 * ((-1 + unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 64] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + 60] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52]) / 20)) || (((((ret == (unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 64] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + 60] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52]) / 20 && 0 <= unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 64] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + 60] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52]) && unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 64] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + 60] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52] <= 42949672940) && ret == ret2) || (((unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 64] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + 60] + 20 + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52] <= 0 && ret == (unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 64] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + 60] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52]) / 20) && 0 <= unknown-#memory_int-unknown[x][48] + 42949672960 + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 64] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + 60] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52]) && ret == ret2)) && unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 64] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + 60] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52] <= 20 * ((unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 64] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + 60] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52]) / 20))) && x == 0) && i * 4 == 68)) || ((((((i <= 4 && 0 <= unknown-#memory_int-unknown[x][48] + 42949672960 + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 36] + unknown-#memory_int-unknown[x][56 + x + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 44] + unknown-#memory_int-unknown[x][x + i * 4 + 48] + temp + unknown-#memory_int-unknown[x][i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 40 + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 60] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 52] + unknown-#memory_int-unknown[x][0]) && 4 <= i) && ((ret == (unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 36] + unknown-#memory_int-unknown[x][56 + x + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 44] + unknown-#memory_int-unknown[x][x + i * 4 + 48] + temp + unknown-#memory_int-unknown[x][i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 40 + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 60] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 52] + unknown-#memory_int-unknown[x][0]) / 20 && ret == ret2) || unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 36] + unknown-#memory_int-unknown[x][56 + x + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 44] + unknown-#memory_int-unknown[x][x + i * 4 + 48] + temp + unknown-#memory_int-unknown[x][i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 40 + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 60] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 52] + unknown-#memory_int-unknown[x][0] <= (-1 + unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 36] + unknown-#memory_int-unknown[x][56 + x + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 44] + unknown-#memory_int-unknown[x][x + i * 4 + 48] + temp + unknown-#memory_int-unknown[x][i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 40 + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 60] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 52] + unknown-#memory_int-unknown[x][0]) / 20 * 20 + 19)) && ((((unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 36] + unknown-#memory_int-unknown[x][56 + x + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 44] + unknown-#memory_int-unknown[x][x + i * 4 + 48] + temp + unknown-#memory_int-unknown[x][i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 40 + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 60] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 52] + unknown-#memory_int-unknown[x][0] + 1 <= 0 && ret == (unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 36] + unknown-#memory_int-unknown[x][56 + x + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 44] + unknown-#memory_int-unknown[x][x + i * 4 + 48] + temp + unknown-#memory_int-unknown[x][i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 40 + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 60] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 52] + unknown-#memory_int-unknown[x][0]) / 20 + 1) && ret == ret2) || (unknown-#memory_int-unknown[x][48] + 19 + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 36] + unknown-#memory_int-unknown[x][56 + x + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 44] + unknown-#memory_int-unknown[x][x + i * 4 + 48] + temp + unknown-#memory_int-unknown[x][i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 40 + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 60] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 52] + unknown-#memory_int-unknown[x][0]) / 20 <= (unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 36] + unknown-#memory_int-unknown[x][56 + x + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 44] + unknown-#memory_int-unknown[x][x + i * 4 + 48] + temp + unknown-#memory_int-unknown[x][i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 40 + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 60] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 52] + unknown-#memory_int-unknown[x][0]) / 20) || ((ret == (unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 36] + unknown-#memory_int-unknown[x][56 + x + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 44] + unknown-#memory_int-unknown[x][x + i * 4 + 48] + temp + unknown-#memory_int-unknown[x][i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 40 + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 60] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 52] + unknown-#memory_int-unknown[x][0]) / 20 && 0 <= unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 36] + unknown-#memory_int-unknown[x][56 + x + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 44] + unknown-#memory_int-unknown[x][x + i * 4 + 48] + temp + unknown-#memory_int-unknown[x][i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 40 + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 60] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 52] + unknown-#memory_int-unknown[x][0]) && ret == ret2))) && x == 0) && unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 36] + unknown-#memory_int-unknown[x][56 + x + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 44] + unknown-#memory_int-unknown[x][x + i * 4 + 48] + temp + unknown-#memory_int-unknown[x][i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 40 + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 60] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 52] + unknown-#memory_int-unknown[x][0] <= 42949672940)) || (((((((((unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 36] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][i * 4 + 12] + unknown-#memory_int-unknown[x][x + i * 4 + 44] + unknown-#memory_int-unknown[x][x + i * 4 + 48] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 40 + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + 20 + unknown-#memory_int-unknown[x][0] <= 0 && ret == (unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 36] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][i * 4 + 12] + unknown-#memory_int-unknown[x][x + i * 4 + 44] + unknown-#memory_int-unknown[x][x + i * 4 + 48] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 40 + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][0]) / 20) && 0 <= unknown-#memory_int-unknown[x][48] + 42949672960 + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 36] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][i * 4 + 12] + unknown-#memory_int-unknown[x][x + i * 4 + 44] + unknown-#memory_int-unknown[x][x + i * 4 + 48] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 40 + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][0]) && ret == ret2) || (((ret == (unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 36] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][i * 4 + 12] + unknown-#memory_int-unknown[x][x + i * 4 + 44] + unknown-#memory_int-unknown[x][x + i * 4 + 48] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 40 + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][0]) / 20 && 0 <= unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 36] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][i * 4 + 12] + unknown-#memory_int-unknown[x][x + i * 4 + 44] + unknown-#memory_int-unknown[x][x + i * 4 + 48] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 40 + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][0]) && unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 36] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][i * 4 + 12] + unknown-#memory_int-unknown[x][x + i * 4 + 44] + unknown-#memory_int-unknown[x][x + i * 4 + 48] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 40 + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][0] <= 42949672940) && ret == ret2)) && unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 36] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][i * 4 + 12] + unknown-#memory_int-unknown[x][x + i * 4 + 44] + unknown-#memory_int-unknown[x][x + i * 4 + 48] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 40 + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][0] <= (unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 36] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][i * 4 + 12] + unknown-#memory_int-unknown[x][x + i * 4 + 44] + unknown-#memory_int-unknown[x][x + i * 4 + 48] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 40 + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][0]) / 20 * 20) || (((unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 36] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][i * 4 + 12] + unknown-#memory_int-unknown[x][x + i * 4 + 44] + unknown-#memory_int-unknown[x][x + i * 4 + 48] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 40 + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][0] <= 19 + (-1 + unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 36] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][i * 4 + 12] + unknown-#memory_int-unknown[x][x + i * 4 + 44] + unknown-#memory_int-unknown[x][x + i * 4 + 48] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 40 + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][0]) / 20 * 20 && (((unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 36] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][i * 4 + 12] + unknown-#memory_int-unknown[x][x + i * 4 + 44] + unknown-#memory_int-unknown[x][x + i * 4 + 48] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 40 + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][0] + 1 <= 0 && ret == (unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 36] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][i * 4 + 12] + unknown-#memory_int-unknown[x][x + i * 4 + 44] + unknown-#memory_int-unknown[x][x + i * 4 + 48] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 40 + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][0]) / 20 + 1) && ret == ret2) || ((ret == (unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 36] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][i * 4 + 12] + unknown-#memory_int-unknown[x][x + i * 4 + 44] + unknown-#memory_int-unknown[x][x + i * 4 + 48] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 40 + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][0]) / 20 && 0 <= unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 36] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][i * 4 + 12] + unknown-#memory_int-unknown[x][x + i * 4 + 44] + unknown-#memory_int-unknown[x][x + i * 4 + 48] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 40 + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][0]) && ret == ret2))) && 0 <= unknown-#memory_int-unknown[x][48] + 42949672960 + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 36] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][i * 4 + 12] + unknown-#memory_int-unknown[x][x + i * 4 + 44] + unknown-#memory_int-unknown[x][x + i * 4 + 48] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 40 + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][0]) && unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 36] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][i * 4 + 12] + unknown-#memory_int-unknown[x][x + i * 4 + 44] + unknown-#memory_int-unknown[x][x + i * 4 + 48] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 40 + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][0] <= 42949672940)) && 7 <= i) && x == 0) && i <= 7)) || ((((((unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 64] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + 68] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + 60] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52] <= 42949672940 && (ret == (unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 64] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + 68] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + 60] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52]) / 20 || unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 64] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + 68] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + 60] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52] <= 19 + (-1 + unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 64] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + 68] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + 60] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52]) / 20 * 20)) && ((((ret == (unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 64] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + 68] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + 60] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52]) / 20 && 0 <= unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 64] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + 68] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + 60] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52]) && ret == ret2) || ((unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 64] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + 68] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + 60] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52] + 1 <= 0 && (unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 64] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + 68] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + 60] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52]) / 20 + 1 == ret) && ret == ret2)) || ((unknown-#memory_int-unknown[x][48] + 19 + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 64] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + 68] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + 60] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52]) / 20 <= (unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 64] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + 68] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + 60] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52]) / 20 && ret == ret2))) && x == 0) && 0 <= unknown-#memory_int-unknown[x][48] + 42949672960 + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 64] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + 68] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + 60] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52]) && 18 <= i) && i <= 18)) || ((19 <= i && x == 0) && ((((((unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 64] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + 68] + temp + unknown-#memory_int-unknown[x][x + 72] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + 60] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52] + 1 <= 0 && unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 64] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + 68] + temp + unknown-#memory_int-unknown[x][x + 72] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + 60] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52] <= 19 + (-1 + unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 64] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + 68] + temp + unknown-#memory_int-unknown[x][x + 72] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + 60] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52]) / 20 * 20) && 0 <= unknown-#memory_int-unknown[x][48] + 42949672960 + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 64] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + 68] + temp + unknown-#memory_int-unknown[x][x + 72] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + 60] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52]) && (unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 64] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + 68] + temp + unknown-#memory_int-unknown[x][x + 72] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + 60] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52]) / 20 + 1 == ret) && ret == ret2) || ((((0 <= unknown-#memory_int-unknown[x][48] + 42949672960 + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 64] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + 68] + temp + unknown-#memory_int-unknown[x][x + 72] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + 60] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52] && (unknown-#memory_int-unknown[x][48] + 19 + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 64] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + 68] + temp + unknown-#memory_int-unknown[x][x + 72] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + 60] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52]) / 20 <= (unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 64] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + 68] + temp + unknown-#memory_int-unknown[x][x + 72] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + 60] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52]) / 20) && unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 64] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + 68] + temp + unknown-#memory_int-unknown[x][x + 72] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + 60] + 20 + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52] <= 0) && ret == (unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 64] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + 68] + temp + unknown-#memory_int-unknown[x][x + 72] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + 60] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52]) / 20) && ret == ret2)) || (((0 <= unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 64] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + 68] + temp + unknown-#memory_int-unknown[x][x + 72] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + 60] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52] && unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 64] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + 68] + temp + unknown-#memory_int-unknown[x][x + 72] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + 60] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52] <= 42949672940) && ret == (unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 64] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + 68] + temp + unknown-#memory_int-unknown[x][x + 72] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + 60] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52]) / 20) && ret == ret2)))) || ((((((unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52] <= 19 + 20 * ((-1 + unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52]) / 20) || (ret == (unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52]) / 20 && ret == ret2)) && 0 <= unknown-#memory_int-unknown[x][48] + 42949672960 + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52]) && unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52] <= 42949672940) && ((((ret == (unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52]) / 20 + 1 && unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52] + 1 <= 0) && ret == ret2) || ((0 <= unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52] && ret == (unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52]) / 20) && ret == ret2)) || unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52] <= 20 * ((unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52]) / 20))) && x == 0) && 56 == i * 4)) || ((((((unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][56 + x + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][i * 4 + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 44] + unknown-#memory_int-unknown[x][x + i * 4 + 48] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 40 + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 60] + unknown-#memory_int-unknown[x][x + i * 4 + 64] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 52] + unknown-#memory_int-unknown[x][0] <= 42949672940 && 0 <= unknown-#memory_int-unknown[x][48] + 42949672960 + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][56 + x + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][i * 4 + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 44] + unknown-#memory_int-unknown[x][x + i * 4 + 48] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 40 + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 60] + unknown-#memory_int-unknown[x][x + i * 4 + 64] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 52] + unknown-#memory_int-unknown[x][0]) && (((unknown-#memory_int-unknown[x][48] + 19 + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][56 + x + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][i * 4 + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 44] + unknown-#memory_int-unknown[x][x + i * 4 + 48] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 40 + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 60] + unknown-#memory_int-unknown[x][x + i * 4 + 64] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 52] + unknown-#memory_int-unknown[x][0]) / 20 <= (unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][56 + x + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][i * 4 + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 44] + unknown-#memory_int-unknown[x][x + i * 4 + 48] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 40 + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 60] + unknown-#memory_int-unknown[x][x + i * 4 + 64] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 52] + unknown-#memory_int-unknown[x][0]) / 20 || ((ret == (unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][56 + x + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][i * 4 + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 44] + unknown-#memory_int-unknown[x][x + i * 4 + 48] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 40 + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 60] + unknown-#memory_int-unknown[x][x + i * 4 + 64] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 52] + unknown-#memory_int-unknown[x][0]) / 20 && 0 <= unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][56 + x + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][i * 4 + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 44] + unknown-#memory_int-unknown[x][x + i * 4 + 48] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 40 + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 60] + unknown-#memory_int-unknown[x][x + i * 4 + 64] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 52] + unknown-#memory_int-unknown[x][0]) && ret == ret2)) || ((ret == (unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][56 + x + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][i * 4 + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 44] + unknown-#memory_int-unknown[x][x + i * 4 + 48] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 40 + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 60] + unknown-#memory_int-unknown[x][x + i * 4 + 64] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 52] + unknown-#memory_int-unknown[x][0]) / 20 + 1 && unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][56 + x + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][i * 4 + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 44] + unknown-#memory_int-unknown[x][x + i * 4 + 48] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 40 + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 60] + unknown-#memory_int-unknown[x][x + i * 4 + 64] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 52] + unknown-#memory_int-unknown[x][0] + 1 <= 0) && ret == ret2))) && 3 <= i) && ((ret == (unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][56 + x + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][i * 4 + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 44] + unknown-#memory_int-unknown[x][x + i * 4 + 48] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 40 + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 60] + unknown-#memory_int-unknown[x][x + i * 4 + 64] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 52] + unknown-#memory_int-unknown[x][0]) / 20 && ret == ret2) || unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][56 + x + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][i * 4 + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 44] + unknown-#memory_int-unknown[x][x + i * 4 + 48] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 40 + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 60] + unknown-#memory_int-unknown[x][x + i * 4 + 64] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 52] + unknown-#memory_int-unknown[x][0] <= (-1 + unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][56 + x + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][i * 4 + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 44] + unknown-#memory_int-unknown[x][x + i * 4 + 48] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 40 + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 60] + unknown-#memory_int-unknown[x][x + i * 4 + 64] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 52] + unknown-#memory_int-unknown[x][0]) / 20 * 20 + 19)) && x == 0) && i <= 3)) || (((((((0 <= unknown-#memory_int-unknown[x][48] + 42949672960 + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 36] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 40 + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][0] && unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 36] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 40 + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][0] <= 19 + 20 * ((-1 + unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 36] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 40 + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][0]) / 20)) && (((unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 36] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 40 + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][0] + 1 <= 0 && (unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 36] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 40 + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][0]) / 20 + 1 == ret) && ret == ret2) || ((0 <= unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 36] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 40 + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][0] && (unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 36] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 40 + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][0]) / 20 == ret) && ret == ret2))) && unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 36] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 40 + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][0] <= 42949672940) || (((((0 <= unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 36] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 40 + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][0] && unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 36] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 40 + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][0] <= 42949672940) && (unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 36] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 40 + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][0]) / 20 == ret) && ret == ret2) || (((0 <= unknown-#memory_int-unknown[x][48] + 42949672960 + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 36] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 40 + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][0] && unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 36] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 40 + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + 20 + unknown-#memory_int-unknown[x][0] <= 0) && (unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 36] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 40 + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][0]) / 20 == ret) && ret == ret2)) && unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 36] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 40 + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][0] <= (unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 36] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 40 + i * 4] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][0]) / 20 * 20)) && x == 0) && 9 <= i) && i <= 9)) || ((((((ret == (unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44]) / 20 || unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] <= 19 + 20 * ((-1 + unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44]) / 20)) && unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] <= 42949672940) && x == 0) && 0 <= unknown-#memory_int-unknown[x][48] + 42949672960 + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44]) && i * 4 == 52) && ((((ret == (unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44]) / 20 + 1 && unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + 1 <= 0) && ret == ret2) || (unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] <= 20 * ((unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44]) / 20) && ret == ret2)) || ((0 <= unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] && ret == (unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44]) / 20) && ret == ret2)))) || (((((((ret == (unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + 60] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52]) / 20 && unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + 60] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52] <= 42949672940) && 0 <= unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + 60] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52]) && ret == ret2) || ((((unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + 60] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52] <= (-1 + unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + 60] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52]) / 20 * 20 + 19 && 0 <= unknown-#memory_int-unknown[x][48] + 42949672960 + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + 60] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52]) && unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + 60] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52] + 1 <= 0) && ret == (unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + 60] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52]) / 20 + 1) && ret == ret2)) || ((((ret == (unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + 60] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52]) / 20 && unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + 60] + 20 + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52] <= 0) && (unknown-#memory_int-unknown[x][48] + 19 + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + 60] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52]) / 20 <= (unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + 60] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52]) / 20) && 0 <= unknown-#memory_int-unknown[x][48] + 42949672960 + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + 60] + unknown-#memory_int-unknown[x][x + 40] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 44] + unknown-#memory_int-unknown[x][x + 52]) && ret == ret2)) && x == 0) && i * 4 == 64) - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((8 <= i && x == x) && unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][28 + x] + unknown-#memory_int-unknown[x][4 + x] + unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][20 + x] <= ret) && i <= 8) && ret <= unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][28 + x] + unknown-#memory_int-unknown[x][4 + x] + unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][20 + x]) && x == x) || (((((5 <= i && x == x) && i <= 5) && ret <= unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][4 + x] + unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][8 + x]) && unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][4 + x] + unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][8 + x] <= ret) && x == x)) || (((((ret <= unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][32 + x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][28 + x] + unknown-#memory_int-unknown[x][4 + x] + unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][20 + x] && x == x) && 9 <= i) && i <= 9) && unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][32 + x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][28 + x] + unknown-#memory_int-unknown[x][4 + x] + unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][20 + x] <= ret) && x == x)) || ((((16 <= i && x == x) && i <= 16) && ((x + 1 <= 0 || (ret <= unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][32 + x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][60 + x] + unknown-#memory_int-unknown[x][28 + x] + unknown-#memory_int-unknown[x][36 + x] + unknown-#memory_int-unknown[x][4 + x] + unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][40] + unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][20 + x] + unknown-#memory_int-unknown[x][52 + x] + unknown-#memory_int-unknown[x][44 + x] && unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][32 + x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][60 + x] + unknown-#memory_int-unknown[x][28 + x] + unknown-#memory_int-unknown[x][36 + x] + unknown-#memory_int-unknown[x][4 + x] + unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][40] + unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][20 + x] + unknown-#memory_int-unknown[x][52 + x] + unknown-#memory_int-unknown[x][44 + x] <= ret)) || 1 <= x)) && x == x)) || (((((7 <= i && i <= 7) && x == x) && ret <= unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][4 + x] + unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][20 + x]) && unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][4 + x] + unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][20 + x] <= ret) && x == x)) || (((((unknown-#memory_int-unknown[x][x] <= ret && x == x) && 1 <= i) && i <= 1) && ret <= unknown-#memory_int-unknown[x][x]) && x == x)) || ((((15 <= i && i <= 15) && ((x + 1 <= 0 || (unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][32 + x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][28 + x] + unknown-#memory_int-unknown[x][36 + x] + unknown-#memory_int-unknown[x][4 + x] + unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][40] + unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][20 + x] + unknown-#memory_int-unknown[x][52 + x] + unknown-#memory_int-unknown[x][44 + x] <= ret && ret <= unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][32 + x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][28 + x] + unknown-#memory_int-unknown[x][36 + x] + unknown-#memory_int-unknown[x][4 + x] + unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][40] + unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][20 + x] + unknown-#memory_int-unknown[x][52 + x] + unknown-#memory_int-unknown[x][44 + x])) || 1 <= x)) && x == x) && x == x)) || (((((i <= 3 && ret <= unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][4 + x] + unknown-#memory_int-unknown[x][8 + x]) && x == x) && unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][4 + x] + unknown-#memory_int-unknown[x][8 + x] <= ret) && 3 <= i) && x == x)) || (((((ret <= unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][4 + x] + unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][8 + x] && x == x) && unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][4 + x] + unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][8 + x] <= ret) && 4 <= i) && i <= 4) && x == x)) || (((((unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][4 + x] <= ret && 2 <= i) && x == x) && ret <= unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][4 + x]) && i <= 2) && x == x)) || ((((((x + 1 <= 0 || (ret <= unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][32 + x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][28 + x] + unknown-#memory_int-unknown[x][36 + x] + unknown-#memory_int-unknown[x][4 + x] + unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][40] + unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][20 + x] + unknown-#memory_int-unknown[x][52 + x] + unknown-#memory_int-unknown[x][44 + x] && unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][32 + x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][28 + x] + unknown-#memory_int-unknown[x][36 + x] + unknown-#memory_int-unknown[x][4 + x] + unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][40] + unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][20 + x] + unknown-#memory_int-unknown[x][52 + x] + unknown-#memory_int-unknown[x][44 + x] <= ret)) || 1 <= x) && 14 <= i) && x == x) && i <= 14) && x == x)) || ((((x == x && ((x + 1 <= 0 || (ret <= unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][32 + x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][68 + x] + unknown-#memory_int-unknown[x][72 + x] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][60 + x] + unknown-#memory_int-unknown[x][28 + x] + unknown-#memory_int-unknown[x][64 + x] + unknown-#memory_int-unknown[x][36 + x] + unknown-#memory_int-unknown[x][4 + x] + unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][40] + unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][20 + x] + unknown-#memory_int-unknown[x][52 + x] + unknown-#memory_int-unknown[x][44 + x] && unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][32 + x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][68 + x] + unknown-#memory_int-unknown[x][72 + x] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][60 + x] + unknown-#memory_int-unknown[x][28 + x] + unknown-#memory_int-unknown[x][64 + x] + unknown-#memory_int-unknown[x][36 + x] + unknown-#memory_int-unknown[x][4 + x] + unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][40] + unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][20 + x] + unknown-#memory_int-unknown[x][52 + x] + unknown-#memory_int-unknown[x][44 + x] <= ret)) || 1 <= x)) && 19 <= i) && i <= 19) && x == x)) || ((((ret <= 0 && 4 * i == 0) && 0 <= ret) && x == x) && x == x)) || ((((i <= 17 && (((unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][32 + x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][60 + x] + unknown-#memory_int-unknown[x][28 + x] + unknown-#memory_int-unknown[x][64 + x] + unknown-#memory_int-unknown[x][36 + x] + unknown-#memory_int-unknown[x][4 + x] + unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][40] + unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][20 + x] + unknown-#memory_int-unknown[x][52 + x] + unknown-#memory_int-unknown[x][44 + x] <= ret && ret <= unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][32 + x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][60 + x] + unknown-#memory_int-unknown[x][28 + x] + unknown-#memory_int-unknown[x][64 + x] + unknown-#memory_int-unknown[x][36 + x] + unknown-#memory_int-unknown[x][4 + x] + unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][40] + unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][20 + x] + unknown-#memory_int-unknown[x][52 + x] + unknown-#memory_int-unknown[x][44 + x]) || x + 1 <= 0) || 1 <= x)) && 17 <= i) && x == x) && x == x)) || (((((i <= 11 && ret <= unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][40 + x] + unknown-#memory_int-unknown[x][32 + x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][28 + x] + unknown-#memory_int-unknown[x][36 + x] + unknown-#memory_int-unknown[x][4 + x] + unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][20 + x]) && x == x) && 11 <= i) && unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][40 + x] + unknown-#memory_int-unknown[x][32 + x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][28 + x] + unknown-#memory_int-unknown[x][36 + x] + unknown-#memory_int-unknown[x][4 + x] + unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][20 + x] <= ret) && x == x)) || ((((i <= 13 && (((ret <= unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][32 + x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][28 + x] + unknown-#memory_int-unknown[x][36 + x] + unknown-#memory_int-unknown[x][4 + x] + unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][40] + unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][20 + x] + unknown-#memory_int-unknown[x][44 + x] && unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][32 + x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][28 + x] + unknown-#memory_int-unknown[x][36 + x] + unknown-#memory_int-unknown[x][4 + x] + unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][40] + unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][20 + x] + unknown-#memory_int-unknown[x][44 + x] <= ret) || x + 1 <= 0) || 1 <= x)) && x == x) && 13 <= i) && x == x)) || (((((12 <= i && i <= 12) && unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][40 + x] + unknown-#memory_int-unknown[x][32 + x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][28 + x] + unknown-#memory_int-unknown[x][36 + x] + unknown-#memory_int-unknown[x][4 + x] + unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][20 + x] + unknown-#memory_int-unknown[x][44 + x] <= ret) && x == x) && ret <= unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][40 + x] + unknown-#memory_int-unknown[x][32 + x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][28 + x] + unknown-#memory_int-unknown[x][36 + x] + unknown-#memory_int-unknown[x][4 + x] + unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][20 + x] + unknown-#memory_int-unknown[x][44 + x]) && x == x)) || (((((10 <= i && x == x) && ret <= unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][32 + x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][28 + x] + unknown-#memory_int-unknown[x][36 + x] + unknown-#memory_int-unknown[x][4 + x] + unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][20 + x]) && unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][32 + x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][28 + x] + unknown-#memory_int-unknown[x][36 + x] + unknown-#memory_int-unknown[x][4 + x] + unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][20 + x] <= ret) && i <= 10) && x == x)) || (((((i <= 6 && 6 <= i) && x == x) && unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][4 + x] + unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][20 + x] <= ret) && ret <= unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][4 + x] + unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][20 + x]) && x == x)) || ((((x == x && (((ret <= unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][32 + x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][68 + x] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][60 + x] + unknown-#memory_int-unknown[x][28 + x] + unknown-#memory_int-unknown[x][64 + x] + unknown-#memory_int-unknown[x][36 + x] + unknown-#memory_int-unknown[x][4 + x] + unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][40] + unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][20 + x] + unknown-#memory_int-unknown[x][52 + x] + unknown-#memory_int-unknown[x][44 + x] && unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][32 + x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][68 + x] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][60 + x] + unknown-#memory_int-unknown[x][28 + x] + unknown-#memory_int-unknown[x][64 + x] + unknown-#memory_int-unknown[x][36 + x] + unknown-#memory_int-unknown[x][4 + x] + unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][40] + unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][20 + x] + unknown-#memory_int-unknown[x][52 + x] + unknown-#memory_int-unknown[x][44 + x] <= ret) || x + 1 <= 0) || 1 <= x)) && i <= 18) && 18 <= i) && x == x)) || ((((unknown-#memory_int-unknown[x][36 + x] + unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][28 + x] + unknown-#memory_int-unknown[x][76 + x] + unknown-#memory_int-unknown[x][52 + x] + unknown-#memory_int-unknown[x][32 + x] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][72 + x] + unknown-#memory_int-unknown[x][64 + x] + unknown-#memory_int-unknown[x][40 + x] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][60 + x] + unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][44 + x] + unknown-#memory_int-unknown[x][68 + x] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][20 + x] + unknown-#memory_int-unknown[x][56 + x] <= ret && ret <= unknown-#memory_int-unknown[x][36 + x] + unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][28 + x] + unknown-#memory_int-unknown[x][76 + x] + unknown-#memory_int-unknown[x][52 + x] + unknown-#memory_int-unknown[x][32 + x] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][72 + x] + unknown-#memory_int-unknown[x][64 + x] + unknown-#memory_int-unknown[x][40 + x] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][60 + x] + unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][44 + x] + unknown-#memory_int-unknown[x][68 + x] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][20 + x] + unknown-#memory_int-unknown[x][56 + x]) || 1 <= x) || x + 1 <= 0) && 20 <= i) - ProcedureContractResult [Line: 15]: Procedure Contract for avg Derived contract for procedure avg: (((((unknown-#memory_int-unknown[x][36 + x] + unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][28 + x] + unknown-#memory_int-unknown[x][76 + x] + unknown-#memory_int-unknown[x][52 + x] + unknown-#memory_int-unknown[x][32 + x] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][72 + x] + unknown-#memory_int-unknown[x][64 + x] + unknown-#memory_int-unknown[x][40 + x] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][60 + x] + unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][44 + x] + unknown-#memory_int-unknown[x][68 + x] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][20 + x] + unknown-#memory_int-unknown[x][56 + x] <= ret && ret <= unknown-#memory_int-unknown[x][36 + x] + unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][28 + x] + unknown-#memory_int-unknown[x][76 + x] + unknown-#memory_int-unknown[x][52 + x] + unknown-#memory_int-unknown[x][32 + x] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][72 + x] + unknown-#memory_int-unknown[x][64 + x] + unknown-#memory_int-unknown[x][40 + x] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][60 + x] + unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][44 + x] + unknown-#memory_int-unknown[x][68 + x] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][20 + x] + unknown-#memory_int-unknown[x][56 + x]) || 1 <= x) || x + 1 <= 0) && ((1 <= x || x + 1 <= 0) || ((((1 <= unknown-#memory_int-unknown[x][36 + x] + unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][28 + x] + unknown-#memory_int-unknown[x][76 + x] + unknown-#memory_int-unknown[x][52 + x] + unknown-#memory_int-unknown[x][32 + x] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][72 + x] + unknown-#memory_int-unknown[x][64 + x] + unknown-#memory_int-unknown[x][40 + x] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][60 + x] + unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][44 + x] + unknown-#memory_int-unknown[x][68 + x] + unknown-#memory_int-unknown[x][x + 24] + (-1 * unknown-#memory_int-unknown[x][52 + x] + -1 * unknown-#memory_int-unknown[x][60 + x] + -1 * unknown-#memory_int-unknown[x][56 + x] + 19 + -1 * unknown-#memory_int-unknown[x][32 + x] + -1 * unknown-#memory_int-unknown[x][x] + -1 * unknown-#memory_int-unknown[x][8 + x] + -1 * unknown-#memory_int-unknown[x][x + 24] + -1 * unknown-#memory_int-unknown[x][40 + x] + -1 * unknown-#memory_int-unknown[x][76 + x] + -1 * unknown-#memory_int-unknown[x][48] + -1 * unknown-#memory_int-unknown[x][12 + x] + -1 * unknown-#memory_int-unknown[x][16 + x] + -1 * unknown-#memory_int-unknown[x][68 + x] + -1 * unknown-#memory_int-unknown[x][72 + x] + -1 * unknown-#memory_int-unknown[x][x + 4] + -1 * unknown-#memory_int-unknown[x][36 + x] + -1 * unknown-#memory_int-unknown[x][44 + x] + -1 * unknown-#memory_int-unknown[x][20 + x] + -1 * unknown-#memory_int-unknown[x][28 + x] + -1 * unknown-#memory_int-unknown[x][64 + x]) / 20 * 20 + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][20 + x] + unknown-#memory_int-unknown[x][56 + x] || unknown-#memory_int-unknown[x][36 + x] + unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][28 + x] + unknown-#memory_int-unknown[x][76 + x] + unknown-#memory_int-unknown[x][52 + x] + unknown-#memory_int-unknown[x][32 + x] + unknown-#memory_int-unknown[x][x] + 42949672980 + unknown-#memory_int-unknown[x][72 + x] + unknown-#memory_int-unknown[x][64 + x] + unknown-#memory_int-unknown[x][40 + x] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][60 + x] + unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][44 + x] + unknown-#memory_int-unknown[x][68 + x] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][20 + x] + unknown-#memory_int-unknown[x][56 + x] <= 0) || 20 * \result <= unknown-#memory_int-unknown[x][36 + x] + unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][28 + x] + unknown-#memory_int-unknown[x][76 + x] + unknown-#memory_int-unknown[x][52 + x] + unknown-#memory_int-unknown[x][32 + x] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][72 + x] + unknown-#memory_int-unknown[x][64 + x] + unknown-#memory_int-unknown[x][40 + x] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][60 + x] + unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][44 + x] + unknown-#memory_int-unknown[x][68 + x] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][20 + x] + unknown-#memory_int-unknown[x][56 + x]) || 0 <= unknown-#memory_int-unknown[x][36 + x] + unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][28 + x] + unknown-#memory_int-unknown[x][76 + x] + unknown-#memory_int-unknown[x][52 + x] + unknown-#memory_int-unknown[x][32 + x] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][72 + x] + unknown-#memory_int-unknown[x][64 + x] + unknown-#memory_int-unknown[x][40 + x] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][60 + x] + unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][44 + x] + unknown-#memory_int-unknown[x][68 + x] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][20 + x] + unknown-#memory_int-unknown[x][56 + x]) && (42949672960 <= unknown-#memory_int-unknown[x][36 + x] + unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][28 + x] + unknown-#memory_int-unknown[x][76 + x] + unknown-#memory_int-unknown[x][52 + x] + unknown-#memory_int-unknown[x][32 + x] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][72 + x] + unknown-#memory_int-unknown[x][64 + x] + unknown-#memory_int-unknown[x][40 + x] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][60 + x] + unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][44 + x] + unknown-#memory_int-unknown[x][68 + x] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][20 + x] + unknown-#memory_int-unknown[x][56 + x] || unknown-#memory_int-unknown[x][36 + x] + unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][28 + x] + unknown-#memory_int-unknown[x][76 + x] + unknown-#memory_int-unknown[x][52 + x] + unknown-#memory_int-unknown[x][32 + x] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][72 + x] + unknown-#memory_int-unknown[x][64 + x] + unknown-#memory_int-unknown[x][40 + x] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][60 + x] + unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][44 + x] + unknown-#memory_int-unknown[x][68 + x] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][20 + x] + unknown-#memory_int-unknown[x][56 + x] <= 20 * \result + 19)))) && 20 <= i) && ((1 <= x || x + 1 <= 0) || (((0 <= (unknown-#memory_int-unknown[x][36 + x] * -19 + unknown-#memory_int-unknown[x][60 + x] * -19 + unknown-#memory_int-unknown[x][16 + x] * -19 + unknown-#memory_int-unknown[x][28 + x] * -19 + unknown-#memory_int-unknown[x][64 + x] * -19 + unknown-#memory_int-unknown[x][12 + x] * -19 + unknown-#memory_int-unknown[x][76 + x] * -19 + -19 * unknown-#memory_int-unknown[x][20 + x] + -19 * unknown-#memory_int-unknown[x][56 + x] + -19 * unknown-#memory_int-unknown[x][40] + unknown-#memory_int-unknown[x][72 + x] * -19 + unknown-#memory_int-unknown[x][68 + x] * -19 + unknown-#memory_int-unknown[x][48] * -19 + unknown-#memory_int-unknown[x][x + 4] * -19 + unknown-#memory_int-unknown[x][x + 24] * -19 + unknown-#memory_int-unknown[x][x] * -19 + unknown-#memory_int-unknown[x][8 + x] * -19 + unknown-#memory_int-unknown[x][52 + x] * -19 + unknown-#memory_int-unknown[x][32 + x] * -19 + unknown-#memory_int-unknown[x][44 + x] * -19) / 380 * 20 + unknown-#memory_int-unknown[x][36 + x] + unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][28 + x] + unknown-#memory_int-unknown[x][76 + x] + unknown-#memory_int-unknown[x][52 + x] + unknown-#memory_int-unknown[x][32 + x] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][72 + x] + unknown-#memory_int-unknown[x][64 + x] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][60 + x] + unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][44 + x] + unknown-#memory_int-unknown[x][68 + x] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][20 + x] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][40] || 0 <= unknown-#memory_int-unknown[x][36 + x] + unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][28 + x] + unknown-#memory_int-unknown[x][76 + x] + unknown-#memory_int-unknown[x][52 + x] + unknown-#memory_int-unknown[x][32 + x] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][72 + x] + unknown-#memory_int-unknown[x][64 + x] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][60 + x] + unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][44 + x] + unknown-#memory_int-unknown[x][68 + x] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][20 + x] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][40]) || ((unknown-#memory_int-unknown[x][36 + x] + unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][28 + x] + unknown-#memory_int-unknown[x][76 + x] + unknown-#memory_int-unknown[x][52 + x] + unknown-#memory_int-unknown[x][32 + x] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][72 + x] + unknown-#memory_int-unknown[x][64 + x] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][60 + x] + unknown-#memory_int-unknown[x][8 + x] + 42949672981 + unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][44 + x] + unknown-#memory_int-unknown[x][68 + x] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][20 + x] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][40] <= 0 || 20 * \result <= unknown-#memory_int-unknown[x][36 + x] + unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][28 + x] + unknown-#memory_int-unknown[x][76 + x] + unknown-#memory_int-unknown[x][52 + x] + unknown-#memory_int-unknown[x][32 + x] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][72 + x] + unknown-#memory_int-unknown[x][64 + x] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][60 + x] + unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][44 + x] + unknown-#memory_int-unknown[x][68 + x] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][16 + x] + 20 + unknown-#memory_int-unknown[x][20 + x] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][40]) && unknown-#memory_int-unknown[x][36 + x] + unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][28 + x] + unknown-#memory_int-unknown[x][76 + x] + unknown-#memory_int-unknown[x][52 + x] + unknown-#memory_int-unknown[x][32 + x] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][72 + x] + unknown-#memory_int-unknown[x][64 + x] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][60 + x] + unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][44 + x] + unknown-#memory_int-unknown[x][68 + x] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][20 + x] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][40] + 1 <= 20 * \result)) && (((unknown-#memory_int-unknown[x][36 + x] + unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][28 + x] + unknown-#memory_int-unknown[x][76 + x] + unknown-#memory_int-unknown[x][52 + x] + unknown-#memory_int-unknown[x][32 + x] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][72 + x] + unknown-#memory_int-unknown[x][64 + x] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][60 + x] + unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][44 + x] + unknown-#memory_int-unknown[x][68 + x] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][20 + x] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][40] + 1 <= 0 || 20 * \result + 85899345920 <= unknown-#memory_int-unknown[x][36 + x] + unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][28 + x] + unknown-#memory_int-unknown[x][76 + x] + unknown-#memory_int-unknown[x][52 + x] + unknown-#memory_int-unknown[x][32 + x] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][72 + x] + unknown-#memory_int-unknown[x][64 + x] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][60 + x] + unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][44 + x] + unknown-#memory_int-unknown[x][68 + x] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][20 + x] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][40]) || (20 * \result <= unknown-#memory_int-unknown[x][36 + x] + unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][28 + x] + unknown-#memory_int-unknown[x][76 + x] + unknown-#memory_int-unknown[x][52 + x] + unknown-#memory_int-unknown[x][32 + x] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][72 + x] + unknown-#memory_int-unknown[x][64 + x] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][60 + x] + unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][44 + x] + unknown-#memory_int-unknown[x][68 + x] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][20 + x] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][40] && unknown-#memory_int-unknown[x][36 + x] + unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][28 + x] + unknown-#memory_int-unknown[x][76 + x] + unknown-#memory_int-unknown[x][52 + x] + unknown-#memory_int-unknown[x][32 + x] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][72 + x] + unknown-#memory_int-unknown[x][64 + x] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][60 + x] + unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][44 + x] + unknown-#memory_int-unknown[x][68 + x] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][20 + x] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][40] <= 20 * \result + 19)) || 85899345920 <= unknown-#memory_int-unknown[x][36 + x] + unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][28 + x] + unknown-#memory_int-unknown[x][76 + x] + unknown-#memory_int-unknown[x][52 + x] + unknown-#memory_int-unknown[x][32 + x] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][72 + x] + unknown-#memory_int-unknown[x][64 + x] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][60 + x] + unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][44 + x] + unknown-#memory_int-unknown[x][68 + x] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][20 + x] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][40]))) - ProcedureContractResult [Line: 26]: Procedure Contract for main Derived contract for procedure main: 1 RESULT: Ultimate proved your program to be correct! [2022-01-31 18:37:52,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...