/usr/bin/java -ea -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/nla-digbench-scaling/fermat1-ll_unwindbound20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 05:56:40,223 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 05:56:40,225 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 05:56:40,248 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 05:56:40,249 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 05:56:40,250 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 05:56:40,254 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 05:56:40,256 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 05:56:40,257 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 05:56:40,258 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 05:56:40,258 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 05:56:40,263 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 05:56:40,264 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 05:56:40,266 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 05:56:40,266 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 05:56:40,267 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 05:56:40,268 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 05:56:40,268 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 05:56:40,270 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 05:56:40,271 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 05:56:40,272 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 05:56:40,273 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 05:56:40,274 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 05:56:40,274 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 05:56:40,275 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 05:56:40,277 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 05:56:40,277 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 05:56:40,278 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 05:56:40,278 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 05:56:40,279 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 05:56:40,279 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 05:56:40,279 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 05:56:40,280 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 05:56:40,281 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 05:56:40,281 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 05:56:40,282 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 05:56:40,282 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 05:56:40,283 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 05:56:40,283 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 05:56:40,283 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 05:56:40,284 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 05:56:40,284 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 05:56:40,285 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 05:56:40,292 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 05:56:40,293 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 05:56:40,293 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 05:56:40,294 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 05:56:40,294 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 05:56:40,294 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 05:56:40,294 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 05:56:40,294 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 05:56:40,295 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 05:56:40,295 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 05:56:40,295 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 05:56:40,295 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 05:56:40,295 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 05:56:40,295 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 05:56:40,296 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 05:56:40,296 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 05:56:40,296 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 05:56:40,296 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 05:56:40,296 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 05:56:40,297 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 05:56:40,297 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 05:56:40,297 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 05:56:40,297 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 05:56:40,297 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 05:56:40,297 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 05:56:40,298 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-04-28 05:56:40,479 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 05:56:40,496 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 05:56:40,498 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 05:56:40,499 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 05:56:40,500 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 05:56:40,502 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/fermat1-ll_unwindbound20.c [2022-04-28 05:56:40,566 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a412918f8/e7cc7d201d04421e8ccc3de7680ff128/FLAGafc14b2f9 [2022-04-28 05:56:40,918 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 05:56:40,919 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/fermat1-ll_unwindbound20.c [2022-04-28 05:56:40,927 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a412918f8/e7cc7d201d04421e8ccc3de7680ff128/FLAGafc14b2f9 [2022-04-28 05:56:40,936 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a412918f8/e7cc7d201d04421e8ccc3de7680ff128 [2022-04-28 05:56:40,938 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 05:56:40,939 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 05:56:40,940 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 05:56:40,940 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 05:56:40,943 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 05:56:40,944 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 05:56:40" (1/1) ... [2022-04-28 05:56:40,945 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bcc0f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:56:40, skipping insertion in model container [2022-04-28 05:56:40,945 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 05:56:40" (1/1) ... [2022-04-28 05:56:40,950 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 05:56:40,961 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 05:56:41,109 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/fermat1-ll_unwindbound20.c[535,548] [2022-04-28 05:56:41,131 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 05:56:41,137 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 05:56:41,145 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/fermat1-ll_unwindbound20.c[535,548] [2022-04-28 05:56:41,156 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 05:56:41,166 INFO L208 MainTranslator]: Completed translation [2022-04-28 05:56:41,167 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:56:41 WrapperNode [2022-04-28 05:56:41,167 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 05:56:41,168 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 05:56:41,168 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 05:56:41,168 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 05:56:41,176 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:56:41" (1/1) ... [2022-04-28 05:56:41,177 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:56:41" (1/1) ... [2022-04-28 05:56:41,185 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:56:41" (1/1) ... [2022-04-28 05:56:41,185 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:56:41" (1/1) ... [2022-04-28 05:56:41,191 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:56:41" (1/1) ... [2022-04-28 05:56:41,195 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:56:41" (1/1) ... [2022-04-28 05:56:41,209 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:56:41" (1/1) ... [2022-04-28 05:56:41,211 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 05:56:41,212 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 05:56:41,212 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 05:56:41,212 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 05:56:41,215 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:56:41" (1/1) ... [2022-04-28 05:56:41,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 05:56:41,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:56:41,248 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-04-28 05:56:41,274 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-04-28 05:56:41,288 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 05:56:41,288 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 05:56:41,289 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 05:56:41,289 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 05:56:41,289 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 05:56:41,289 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 05:56:41,289 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 05:56:41,289 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 05:56:41,290 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 05:56:41,290 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 05:56:41,290 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 05:56:41,291 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 05:56:41,293 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 05:56:41,293 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 05:56:41,293 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 05:56:41,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 05:56:41,293 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 05:56:41,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 05:56:41,293 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 05:56:41,293 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 05:56:41,352 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 05:56:41,354 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 05:56:41,577 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 05:56:41,583 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 05:56:41,583 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-28 05:56:41,584 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 05:56:41 BoogieIcfgContainer [2022-04-28 05:56:41,585 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 05:56:41,586 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 05:56:41,586 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 05:56:41,596 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 05:56:41,596 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 05:56:40" (1/3) ... [2022-04-28 05:56:41,597 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@280b74f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 05:56:41, skipping insertion in model container [2022-04-28 05:56:41,597 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:56:41" (2/3) ... [2022-04-28 05:56:41,597 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@280b74f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 05:56:41, skipping insertion in model container [2022-04-28 05:56:41,597 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 05:56:41" (3/3) ... [2022-04-28 05:56:41,598 INFO L111 eAbstractionObserver]: Analyzing ICFG fermat1-ll_unwindbound20.c [2022-04-28 05:56:41,610 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 05:56:41,610 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 05:56:41,647 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 05:56:41,652 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@40c81dcc, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3365ed60 [2022-04-28 05:56:41,652 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 05:56:41,659 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 24 states have internal predecessors, (35), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 05:56:41,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 05:56:41,666 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:56:41,666 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:56:41,666 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:56:41,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:56:41,671 INFO L85 PathProgramCache]: Analyzing trace with hash 928708300, now seen corresponding path program 1 times [2022-04-28 05:56:41,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:56:41,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1542051699] [2022-04-28 05:56:41,688 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:56:41,688 INFO L85 PathProgramCache]: Analyzing trace with hash 928708300, now seen corresponding path program 2 times [2022-04-28 05:56:41,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:56:41,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757632792] [2022-04-28 05:56:41,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:56:41,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:56:41,772 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:56:41,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1252208615] [2022-04-28 05:56:41,773 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:56:41,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:56:41,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:56:41,779 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:56:41,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-28 05:56:41,843 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 05:56:41,843 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:56:41,845 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 1 conjunts are in the unsatisfiable core [2022-04-28 05:56:41,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:56:41,857 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:56:41,939 INFO L272 TraceCheckUtils]: 0: Hoare triple {40#true} call ULTIMATE.init(); {40#true} is VALID [2022-04-28 05:56:41,939 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {40#true} is VALID [2022-04-28 05:56:41,940 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-28 05:56:41,940 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40#true} {40#true} #102#return; {40#true} is VALID [2022-04-28 05:56:41,940 INFO L272 TraceCheckUtils]: 4: Hoare triple {40#true} call #t~ret9 := main(); {40#true} is VALID [2022-04-28 05:56:41,940 INFO L290 TraceCheckUtils]: 5: Hoare triple {40#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {40#true} is VALID [2022-04-28 05:56:41,941 INFO L272 TraceCheckUtils]: 6: Hoare triple {40#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {40#true} is VALID [2022-04-28 05:56:41,941 INFO L290 TraceCheckUtils]: 7: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-28 05:56:41,941 INFO L290 TraceCheckUtils]: 8: Hoare triple {40#true} assume 0 == ~cond;assume false; {40#true} is VALID [2022-04-28 05:56:41,941 INFO L290 TraceCheckUtils]: 9: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-28 05:56:41,941 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {40#true} {40#true} #90#return; {40#true} is VALID [2022-04-28 05:56:41,942 INFO L272 TraceCheckUtils]: 11: Hoare triple {40#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {40#true} is VALID [2022-04-28 05:56:41,942 INFO L290 TraceCheckUtils]: 12: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-28 05:56:41,943 INFO L290 TraceCheckUtils]: 13: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-28 05:56:41,943 INFO L290 TraceCheckUtils]: 14: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-28 05:56:41,943 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {41#false} {40#true} #92#return; {41#false} is VALID [2022-04-28 05:56:41,943 INFO L290 TraceCheckUtils]: 16: Hoare triple {41#false} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {41#false} is VALID [2022-04-28 05:56:41,943 INFO L290 TraceCheckUtils]: 17: Hoare triple {41#false} assume !true; {41#false} is VALID [2022-04-28 05:56:41,944 INFO L272 TraceCheckUtils]: 18: Hoare triple {41#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {41#false} is VALID [2022-04-28 05:56:41,944 INFO L290 TraceCheckUtils]: 19: Hoare triple {41#false} ~cond := #in~cond; {41#false} is VALID [2022-04-28 05:56:41,944 INFO L290 TraceCheckUtils]: 20: Hoare triple {41#false} assume 0 == ~cond; {41#false} is VALID [2022-04-28 05:56:41,944 INFO L290 TraceCheckUtils]: 21: Hoare triple {41#false} assume !false; {41#false} is VALID [2022-04-28 05:56:41,945 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 05:56:41,945 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 05:56:41,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:56:41,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757632792] [2022-04-28 05:56:41,946 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:56:41,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1252208615] [2022-04-28 05:56:41,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1252208615] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:56:41,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:56:41,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-28 05:56:41,949 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:56:41,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1542051699] [2022-04-28 05:56:41,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1542051699] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:56:41,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:56:41,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-28 05:56:41,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167818286] [2022-04-28 05:56:41,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:56:41,955 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2022-04-28 05:56:41,957 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:56:41,959 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 05:56:41,982 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:56:41,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-04-28 05:56:41,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:56:41,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-04-28 05:56:42,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-28 05:56:42,003 INFO L87 Difference]: Start difference. First operand has 37 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 24 states have internal predecessors, (35), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 05:56:42,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:42,102 INFO L93 Difference]: Finished difference Result 67 states and 100 transitions. [2022-04-28 05:56:42,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-28 05:56:42,102 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2022-04-28 05:56:42,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:56:42,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 05:56:42,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 100 transitions. [2022-04-28 05:56:42,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 05:56:42,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 100 transitions. [2022-04-28 05:56:42,133 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2 states and 100 transitions. [2022-04-28 05:56:42,255 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:56:42,264 INFO L225 Difference]: With dead ends: 67 [2022-04-28 05:56:42,265 INFO L226 Difference]: Without dead ends: 32 [2022-04-28 05:56:42,268 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-28 05:56:42,273 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 05:56:42,275 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 05:56:42,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-28 05:56:42,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-28 05:56:42,304 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:56:42,305 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 05:56:42,306 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 05:56:42,307 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 05:56:42,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:42,315 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-28 05:56:42,316 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-28 05:56:42,321 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:56:42,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:56:42,323 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 32 states. [2022-04-28 05:56:42,324 INFO L87 Difference]: Start difference. First operand has 32 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 32 states. [2022-04-28 05:56:42,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:42,328 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-28 05:56:42,328 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-28 05:56:42,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:56:42,330 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:56:42,330 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:56:42,330 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:56:42,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 05:56:42,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2022-04-28 05:56:42,337 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 22 [2022-04-28 05:56:42,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:56:42,338 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2022-04-28 05:56:42,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 05:56:42,341 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 41 transitions. [2022-04-28 05:56:42,384 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:56:42,384 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-28 05:56:42,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 05:56:42,385 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:56:42,386 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:56:42,412 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 05:56:42,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-04-28 05:56:42,609 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:56:42,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:56:42,610 INFO L85 PathProgramCache]: Analyzing trace with hash -155606603, now seen corresponding path program 1 times [2022-04-28 05:56:42,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:56:42,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1881401825] [2022-04-28 05:56:42,611 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:56:42,611 INFO L85 PathProgramCache]: Analyzing trace with hash -155606603, now seen corresponding path program 2 times [2022-04-28 05:56:42,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:56:42,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679343488] [2022-04-28 05:56:42,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:56:42,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:56:42,637 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:56:42,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [576250439] [2022-04-28 05:56:42,637 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:56:42,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:56:42,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:56:42,639 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:56:42,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-28 05:56:42,698 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 05:56:42,699 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:56:42,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 05:56:42,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:56:42,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:56:42,914 INFO L272 TraceCheckUtils]: 0: Hoare triple {369#true} call ULTIMATE.init(); {369#true} is VALID [2022-04-28 05:56:42,915 INFO L290 TraceCheckUtils]: 1: Hoare triple {369#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {377#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:42,916 INFO L290 TraceCheckUtils]: 2: Hoare triple {377#(<= ~counter~0 0)} assume true; {377#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:42,916 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {377#(<= ~counter~0 0)} {369#true} #102#return; {377#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:42,917 INFO L272 TraceCheckUtils]: 4: Hoare triple {377#(<= ~counter~0 0)} call #t~ret9 := main(); {377#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:42,917 INFO L290 TraceCheckUtils]: 5: Hoare triple {377#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {377#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:42,918 INFO L272 TraceCheckUtils]: 6: Hoare triple {377#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {377#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:42,919 INFO L290 TraceCheckUtils]: 7: Hoare triple {377#(<= ~counter~0 0)} ~cond := #in~cond; {377#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:42,919 INFO L290 TraceCheckUtils]: 8: Hoare triple {377#(<= ~counter~0 0)} assume !(0 == ~cond); {377#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:42,919 INFO L290 TraceCheckUtils]: 9: Hoare triple {377#(<= ~counter~0 0)} assume true; {377#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:42,920 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {377#(<= ~counter~0 0)} {377#(<= ~counter~0 0)} #90#return; {377#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:42,921 INFO L272 TraceCheckUtils]: 11: Hoare triple {377#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {377#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:42,921 INFO L290 TraceCheckUtils]: 12: Hoare triple {377#(<= ~counter~0 0)} ~cond := #in~cond; {377#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:42,923 INFO L290 TraceCheckUtils]: 13: Hoare triple {377#(<= ~counter~0 0)} assume !(0 == ~cond); {377#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:42,923 INFO L290 TraceCheckUtils]: 14: Hoare triple {377#(<= ~counter~0 0)} assume true; {377#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:42,925 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {377#(<= ~counter~0 0)} {377#(<= ~counter~0 0)} #92#return; {377#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:42,925 INFO L290 TraceCheckUtils]: 16: Hoare triple {377#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {377#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:42,926 INFO L290 TraceCheckUtils]: 17: Hoare triple {377#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {426#(<= |main_#t~post6| 0)} is VALID [2022-04-28 05:56:42,926 INFO L290 TraceCheckUtils]: 18: Hoare triple {426#(<= |main_#t~post6| 0)} assume !(#t~post6 < 20);havoc #t~post6; {370#false} is VALID [2022-04-28 05:56:42,927 INFO L272 TraceCheckUtils]: 19: Hoare triple {370#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {370#false} is VALID [2022-04-28 05:56:42,927 INFO L290 TraceCheckUtils]: 20: Hoare triple {370#false} ~cond := #in~cond; {370#false} is VALID [2022-04-28 05:56:42,928 INFO L290 TraceCheckUtils]: 21: Hoare triple {370#false} assume 0 == ~cond; {370#false} is VALID [2022-04-28 05:56:42,928 INFO L290 TraceCheckUtils]: 22: Hoare triple {370#false} assume !false; {370#false} is VALID [2022-04-28 05:56:42,928 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 05:56:42,929 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 05:56:42,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:56:42,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679343488] [2022-04-28 05:56:42,929 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:56:42,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [576250439] [2022-04-28 05:56:42,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [576250439] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:56:42,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:56:42,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 05:56:42,930 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:56:42,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1881401825] [2022-04-28 05:56:42,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1881401825] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:56:42,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:56:42,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 05:56:42,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31382692] [2022-04-28 05:56:42,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:56:42,933 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-28 05:56:42,933 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:56:42,933 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 05:56:42,952 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:56:42,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 05:56:42,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:56:42,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 05:56:42,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 05:56:42,954 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 05:56:43,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:43,060 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2022-04-28 05:56:43,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 05:56:43,061 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-28 05:56:43,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:56:43,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 05:56:43,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-04-28 05:56:43,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 05:56:43,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-04-28 05:56:43,065 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 50 transitions. [2022-04-28 05:56:43,113 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:56:43,117 INFO L225 Difference]: With dead ends: 41 [2022-04-28 05:56:43,117 INFO L226 Difference]: Without dead ends: 34 [2022-04-28 05:56:43,117 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 05:56:43,124 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 05:56:43,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 101 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 05:56:43,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-28 05:56:43,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-28 05:56:43,144 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:56:43,144 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 05:56:43,145 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 05:56:43,147 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 05:56:43,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:43,150 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-28 05:56:43,150 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-28 05:56:43,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:56:43,152 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:56:43,152 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 34 states. [2022-04-28 05:56:43,153 INFO L87 Difference]: Start difference. First operand has 34 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 34 states. [2022-04-28 05:56:43,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:43,163 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-28 05:56:43,164 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-28 05:56:43,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:56:43,169 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:56:43,169 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:56:43,169 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:56:43,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 05:56:43,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2022-04-28 05:56:43,171 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 23 [2022-04-28 05:56:43,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:56:43,171 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2022-04-28 05:56:43,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 05:56:43,172 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 43 transitions. [2022-04-28 05:56:43,227 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:56:43,227 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-28 05:56:43,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 05:56:43,228 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:56:43,228 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:56:43,259 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-28 05:56:43,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-04-28 05:56:43,444 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:56:43,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:56:43,444 INFO L85 PathProgramCache]: Analyzing trace with hash -153938307, now seen corresponding path program 1 times [2022-04-28 05:56:43,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:56:43,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [235296312] [2022-04-28 05:56:43,445 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:56:43,445 INFO L85 PathProgramCache]: Analyzing trace with hash -153938307, now seen corresponding path program 2 times [2022-04-28 05:56:43,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:56:43,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117211520] [2022-04-28 05:56:43,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:56:43,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:56:43,461 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:56:43,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1313078116] [2022-04-28 05:56:43,461 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:56:43,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:56:43,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:56:43,462 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:56:43,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-28 05:56:43,513 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 05:56:43,513 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:56:43,514 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 05:56:43,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:56:43,527 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:56:43,874 INFO L272 TraceCheckUtils]: 0: Hoare triple {659#true} call ULTIMATE.init(); {659#true} is VALID [2022-04-28 05:56:43,874 INFO L290 TraceCheckUtils]: 1: Hoare triple {659#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {659#true} is VALID [2022-04-28 05:56:43,874 INFO L290 TraceCheckUtils]: 2: Hoare triple {659#true} assume true; {659#true} is VALID [2022-04-28 05:56:43,874 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {659#true} {659#true} #102#return; {659#true} is VALID [2022-04-28 05:56:43,875 INFO L272 TraceCheckUtils]: 4: Hoare triple {659#true} call #t~ret9 := main(); {659#true} is VALID [2022-04-28 05:56:43,875 INFO L290 TraceCheckUtils]: 5: Hoare triple {659#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {659#true} is VALID [2022-04-28 05:56:43,875 INFO L272 TraceCheckUtils]: 6: Hoare triple {659#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {659#true} is VALID [2022-04-28 05:56:43,875 INFO L290 TraceCheckUtils]: 7: Hoare triple {659#true} ~cond := #in~cond; {659#true} is VALID [2022-04-28 05:56:43,875 INFO L290 TraceCheckUtils]: 8: Hoare triple {659#true} assume !(0 == ~cond); {659#true} is VALID [2022-04-28 05:56:43,876 INFO L290 TraceCheckUtils]: 9: Hoare triple {659#true} assume true; {659#true} is VALID [2022-04-28 05:56:43,876 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {659#true} {659#true} #90#return; {659#true} is VALID [2022-04-28 05:56:43,876 INFO L272 TraceCheckUtils]: 11: Hoare triple {659#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {659#true} is VALID [2022-04-28 05:56:43,876 INFO L290 TraceCheckUtils]: 12: Hoare triple {659#true} ~cond := #in~cond; {659#true} is VALID [2022-04-28 05:56:43,876 INFO L290 TraceCheckUtils]: 13: Hoare triple {659#true} assume !(0 == ~cond); {659#true} is VALID [2022-04-28 05:56:43,877 INFO L290 TraceCheckUtils]: 14: Hoare triple {659#true} assume true; {659#true} is VALID [2022-04-28 05:56:43,877 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {659#true} {659#true} #92#return; {659#true} is VALID [2022-04-28 05:56:45,601 INFO L290 TraceCheckUtils]: 16: Hoare triple {659#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {712#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} is VALID [2022-04-28 05:56:45,615 INFO L290 TraceCheckUtils]: 17: Hoare triple {712#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {712#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} is VALID [2022-04-28 05:56:45,616 INFO L290 TraceCheckUtils]: 18: Hoare triple {712#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} assume !!(#t~post6 < 20);havoc #t~post6; {712#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} is VALID [2022-04-28 05:56:45,849 INFO L272 TraceCheckUtils]: 19: Hoare triple {712#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {722#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:56:45,850 INFO L290 TraceCheckUtils]: 20: Hoare triple {722#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {726#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:56:45,850 INFO L290 TraceCheckUtils]: 21: Hoare triple {726#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {660#false} is VALID [2022-04-28 05:56:45,850 INFO L290 TraceCheckUtils]: 22: Hoare triple {660#false} assume !false; {660#false} is VALID [2022-04-28 05:56:45,851 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 05:56:45,851 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 05:56:45,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:56:45,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117211520] [2022-04-28 05:56:45,851 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:56:45,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1313078116] [2022-04-28 05:56:45,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1313078116] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:56:45,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:56:45,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 05:56:45,852 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:56:45,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [235296312] [2022-04-28 05:56:45,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [235296312] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:56:45,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:56:45,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 05:56:45,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549910429] [2022-04-28 05:56:45,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:56:45,853 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-04-28 05:56:45,853 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:56:45,854 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 05:56:49,217 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 19 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 05:56:49,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 05:56:49,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:56:49,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 05:56:49,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 05:56:49,218 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 05:56:51,005 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 05:56:54,883 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 05:56:56,647 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 05:56:59,853 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 05:57:05,653 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 05:57:05,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:05,731 INFO L93 Difference]: Finished difference Result 53 states and 70 transitions. [2022-04-28 05:57:05,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 05:57:05,732 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-04-28 05:57:05,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:57:05,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 05:57:05,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-04-28 05:57:05,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 05:57:05,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-04-28 05:57:05,737 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 68 transitions. [2022-04-28 05:57:12,267 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 66 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 05:57:12,269 INFO L225 Difference]: With dead ends: 53 [2022-04-28 05:57:12,269 INFO L226 Difference]: Without dead ends: 51 [2022-04-28 05:57:12,269 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 05:57:12,270 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 16 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.4s IncrementalHoareTripleChecker+Time [2022-04-28 05:57:12,270 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 116 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 3 Unknown, 0 Unchecked, 11.4s Time] [2022-04-28 05:57:12,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-28 05:57:12,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2022-04-28 05:57:12,291 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:57:12,292 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 50 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 05:57:12,292 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 50 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 05:57:12,292 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 50 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 05:57:12,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:12,295 INFO L93 Difference]: Finished difference Result 51 states and 68 transitions. [2022-04-28 05:57:12,295 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 68 transitions. [2022-04-28 05:57:12,295 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:57:12,296 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:57:12,296 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 51 states. [2022-04-28 05:57:12,296 INFO L87 Difference]: Start difference. First operand has 50 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 51 states. [2022-04-28 05:57:12,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:12,299 INFO L93 Difference]: Finished difference Result 51 states and 68 transitions. [2022-04-28 05:57:12,299 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 68 transitions. [2022-04-28 05:57:12,300 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:57:12,300 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:57:12,300 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:57:12,300 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:57:12,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 05:57:12,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 67 transitions. [2022-04-28 05:57:12,303 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 67 transitions. Word has length 23 [2022-04-28 05:57:12,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:57:12,303 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 67 transitions. [2022-04-28 05:57:12,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 05:57:12,303 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 67 transitions. [2022-04-28 05:57:16,097 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 66 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 05:57:16,098 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 67 transitions. [2022-04-28 05:57:16,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 05:57:16,098 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:57:16,098 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:57:16,120 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-28 05:57:16,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:57:16,299 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:57:16,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:57:16,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1676885497, now seen corresponding path program 1 times [2022-04-28 05:57:16,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:57:16,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [358193185] [2022-04-28 05:57:16,300 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:57:16,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1676885497, now seen corresponding path program 2 times [2022-04-28 05:57:16,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:57:16,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655479255] [2022-04-28 05:57:16,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:57:16,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:57:16,331 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:57:16,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1946940231] [2022-04-28 05:57:16,331 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:57:16,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:57:16,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:57:16,338 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:57:16,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-28 05:57:16,393 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:57:16,393 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:57:16,394 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 05:57:16,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:57:16,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:57:16,594 INFO L272 TraceCheckUtils]: 0: Hoare triple {1042#true} call ULTIMATE.init(); {1042#true} is VALID [2022-04-28 05:57:16,594 INFO L290 TraceCheckUtils]: 1: Hoare triple {1042#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1042#true} is VALID [2022-04-28 05:57:16,594 INFO L290 TraceCheckUtils]: 2: Hoare triple {1042#true} assume true; {1042#true} is VALID [2022-04-28 05:57:16,594 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1042#true} {1042#true} #102#return; {1042#true} is VALID [2022-04-28 05:57:16,594 INFO L272 TraceCheckUtils]: 4: Hoare triple {1042#true} call #t~ret9 := main(); {1042#true} is VALID [2022-04-28 05:57:16,594 INFO L290 TraceCheckUtils]: 5: Hoare triple {1042#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {1042#true} is VALID [2022-04-28 05:57:16,595 INFO L272 TraceCheckUtils]: 6: Hoare triple {1042#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {1042#true} is VALID [2022-04-28 05:57:16,595 INFO L290 TraceCheckUtils]: 7: Hoare triple {1042#true} ~cond := #in~cond; {1042#true} is VALID [2022-04-28 05:57:16,595 INFO L290 TraceCheckUtils]: 8: Hoare triple {1042#true} assume !(0 == ~cond); {1042#true} is VALID [2022-04-28 05:57:16,595 INFO L290 TraceCheckUtils]: 9: Hoare triple {1042#true} assume true; {1042#true} is VALID [2022-04-28 05:57:16,595 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1042#true} {1042#true} #90#return; {1042#true} is VALID [2022-04-28 05:57:16,595 INFO L272 TraceCheckUtils]: 11: Hoare triple {1042#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {1042#true} is VALID [2022-04-28 05:57:16,595 INFO L290 TraceCheckUtils]: 12: Hoare triple {1042#true} ~cond := #in~cond; {1042#true} is VALID [2022-04-28 05:57:16,595 INFO L290 TraceCheckUtils]: 13: Hoare triple {1042#true} assume !(0 == ~cond); {1042#true} is VALID [2022-04-28 05:57:16,596 INFO L290 TraceCheckUtils]: 14: Hoare triple {1042#true} assume true; {1042#true} is VALID [2022-04-28 05:57:16,596 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1042#true} {1042#true} #92#return; {1042#true} is VALID [2022-04-28 05:57:16,596 INFO L290 TraceCheckUtils]: 16: Hoare triple {1042#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {1042#true} is VALID [2022-04-28 05:57:16,596 INFO L290 TraceCheckUtils]: 17: Hoare triple {1042#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1042#true} is VALID [2022-04-28 05:57:16,596 INFO L290 TraceCheckUtils]: 18: Hoare triple {1042#true} assume !!(#t~post6 < 20);havoc #t~post6; {1042#true} is VALID [2022-04-28 05:57:16,596 INFO L272 TraceCheckUtils]: 19: Hoare triple {1042#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1042#true} is VALID [2022-04-28 05:57:16,598 INFO L290 TraceCheckUtils]: 20: Hoare triple {1042#true} ~cond := #in~cond; {1107#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:57:16,599 INFO L290 TraceCheckUtils]: 21: Hoare triple {1107#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1111#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:57:16,599 INFO L290 TraceCheckUtils]: 22: Hoare triple {1111#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1111#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:57:16,600 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1111#(not (= |__VERIFIER_assert_#in~cond| 0))} {1042#true} #94#return; {1118#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4) (* main_~r~0 4)))} is VALID [2022-04-28 05:57:16,601 INFO L290 TraceCheckUtils]: 24: Hoare triple {1118#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4) (* main_~r~0 4)))} assume !(0 != ~r~0); {1122#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4)))} is VALID [2022-04-28 05:57:16,602 INFO L272 TraceCheckUtils]: 25: Hoare triple {1122#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4)))} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1126#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:57:16,602 INFO L290 TraceCheckUtils]: 26: Hoare triple {1126#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1130#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:57:16,603 INFO L290 TraceCheckUtils]: 27: Hoare triple {1130#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1043#false} is VALID [2022-04-28 05:57:16,603 INFO L290 TraceCheckUtils]: 28: Hoare triple {1043#false} assume !false; {1043#false} is VALID [2022-04-28 05:57:16,603 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 05:57:16,603 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:57:17,064 INFO L290 TraceCheckUtils]: 28: Hoare triple {1043#false} assume !false; {1043#false} is VALID [2022-04-28 05:57:17,065 INFO L290 TraceCheckUtils]: 27: Hoare triple {1130#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1043#false} is VALID [2022-04-28 05:57:17,066 INFO L290 TraceCheckUtils]: 26: Hoare triple {1126#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1130#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:57:17,067 INFO L272 TraceCheckUtils]: 25: Hoare triple {1122#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4)))} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1126#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:57:17,067 INFO L290 TraceCheckUtils]: 24: Hoare triple {1149#(or (not (= main_~r~0 0)) (= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4))))} assume !(0 != ~r~0); {1122#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4)))} is VALID [2022-04-28 05:57:17,068 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1111#(not (= |__VERIFIER_assert_#in~cond| 0))} {1042#true} #94#return; {1149#(or (not (= main_~r~0 0)) (= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4))))} is VALID [2022-04-28 05:57:17,069 INFO L290 TraceCheckUtils]: 22: Hoare triple {1111#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1111#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:57:17,069 INFO L290 TraceCheckUtils]: 21: Hoare triple {1162#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {1111#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:57:17,070 INFO L290 TraceCheckUtils]: 20: Hoare triple {1042#true} ~cond := #in~cond; {1162#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 05:57:17,070 INFO L272 TraceCheckUtils]: 19: Hoare triple {1042#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1042#true} is VALID [2022-04-28 05:57:17,070 INFO L290 TraceCheckUtils]: 18: Hoare triple {1042#true} assume !!(#t~post6 < 20);havoc #t~post6; {1042#true} is VALID [2022-04-28 05:57:17,070 INFO L290 TraceCheckUtils]: 17: Hoare triple {1042#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1042#true} is VALID [2022-04-28 05:57:17,070 INFO L290 TraceCheckUtils]: 16: Hoare triple {1042#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {1042#true} is VALID [2022-04-28 05:57:17,071 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1042#true} {1042#true} #92#return; {1042#true} is VALID [2022-04-28 05:57:17,071 INFO L290 TraceCheckUtils]: 14: Hoare triple {1042#true} assume true; {1042#true} is VALID [2022-04-28 05:57:17,071 INFO L290 TraceCheckUtils]: 13: Hoare triple {1042#true} assume !(0 == ~cond); {1042#true} is VALID [2022-04-28 05:57:17,071 INFO L290 TraceCheckUtils]: 12: Hoare triple {1042#true} ~cond := #in~cond; {1042#true} is VALID [2022-04-28 05:57:17,071 INFO L272 TraceCheckUtils]: 11: Hoare triple {1042#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {1042#true} is VALID [2022-04-28 05:57:17,071 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1042#true} {1042#true} #90#return; {1042#true} is VALID [2022-04-28 05:57:17,071 INFO L290 TraceCheckUtils]: 9: Hoare triple {1042#true} assume true; {1042#true} is VALID [2022-04-28 05:57:17,072 INFO L290 TraceCheckUtils]: 8: Hoare triple {1042#true} assume !(0 == ~cond); {1042#true} is VALID [2022-04-28 05:57:17,072 INFO L290 TraceCheckUtils]: 7: Hoare triple {1042#true} ~cond := #in~cond; {1042#true} is VALID [2022-04-28 05:57:17,072 INFO L272 TraceCheckUtils]: 6: Hoare triple {1042#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {1042#true} is VALID [2022-04-28 05:57:17,072 INFO L290 TraceCheckUtils]: 5: Hoare triple {1042#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {1042#true} is VALID [2022-04-28 05:57:17,072 INFO L272 TraceCheckUtils]: 4: Hoare triple {1042#true} call #t~ret9 := main(); {1042#true} is VALID [2022-04-28 05:57:17,072 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1042#true} {1042#true} #102#return; {1042#true} is VALID [2022-04-28 05:57:17,072 INFO L290 TraceCheckUtils]: 2: Hoare triple {1042#true} assume true; {1042#true} is VALID [2022-04-28 05:57:17,073 INFO L290 TraceCheckUtils]: 1: Hoare triple {1042#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1042#true} is VALID [2022-04-28 05:57:17,073 INFO L272 TraceCheckUtils]: 0: Hoare triple {1042#true} call ULTIMATE.init(); {1042#true} is VALID [2022-04-28 05:57:17,073 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 05:57:17,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:57:17,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655479255] [2022-04-28 05:57:17,073 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:57:17,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1946940231] [2022-04-28 05:57:17,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1946940231] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:57:17,074 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:57:17,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-28 05:57:17,074 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:57:17,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [358193185] [2022-04-28 05:57:17,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [358193185] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:57:17,074 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:57:17,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 05:57:17,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787193314] [2022-04-28 05:57:17,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:57:17,075 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 29 [2022-04-28 05:57:17,075 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:57:17,075 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 05:57:17,097 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:57:17,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 05:57:17,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:57:17,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 05:57:17,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-28 05:57:17,098 INFO L87 Difference]: Start difference. First operand 50 states and 67 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 05:57:17,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:17,498 INFO L93 Difference]: Finished difference Result 57 states and 73 transitions. [2022-04-28 05:57:17,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 05:57:17,499 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 29 [2022-04-28 05:57:17,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:57:17,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 05:57:17,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-28 05:57:17,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 05:57:17,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-28 05:57:17,502 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 47 transitions. [2022-04-28 05:57:17,549 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:57:17,551 INFO L225 Difference]: With dead ends: 57 [2022-04-28 05:57:17,551 INFO L226 Difference]: Without dead ends: 52 [2022-04-28 05:57:17,552 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-04-28 05:57:17,552 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 25 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 05:57:17,553 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 135 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 05:57:17,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-28 05:57:17,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 36. [2022-04-28 05:57:17,573 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:57:17,574 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 36 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 8 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 05:57:17,574 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 36 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 8 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 05:57:17,574 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 36 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 8 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 05:57:17,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:17,577 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2022-04-28 05:57:17,577 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2022-04-28 05:57:17,577 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:57:17,577 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:57:17,577 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 8 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 52 states. [2022-04-28 05:57:17,578 INFO L87 Difference]: Start difference. First operand has 36 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 8 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 52 states. [2022-04-28 05:57:17,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:17,580 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2022-04-28 05:57:17,580 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2022-04-28 05:57:17,580 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:57:17,581 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:57:17,581 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:57:17,581 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:57:17,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 8 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 05:57:17,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2022-04-28 05:57:17,582 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 29 [2022-04-28 05:57:17,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:57:17,583 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2022-04-28 05:57:17,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 05:57:17,583 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 43 transitions. [2022-04-28 05:57:19,638 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 42 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 05:57:19,639 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2022-04-28 05:57:19,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-28 05:57:19,639 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:57:19,639 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:57:19,656 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-28 05:57:19,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:57:19,844 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:57:19,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:57:19,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1154059858, now seen corresponding path program 1 times [2022-04-28 05:57:19,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:57:19,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [490003137] [2022-04-28 05:57:19,844 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:57:19,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1154059858, now seen corresponding path program 2 times [2022-04-28 05:57:19,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:57:19,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072242339] [2022-04-28 05:57:19,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:57:19,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:57:19,859 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:57:19,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1868554083] [2022-04-28 05:57:19,859 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:57:19,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:57:19,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:57:19,860 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:57:19,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-28 05:57:20,051 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:57:20,051 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:57:20,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 05:57:20,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:57:20,072 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:57:20,257 INFO L272 TraceCheckUtils]: 0: Hoare triple {1521#true} call ULTIMATE.init(); {1521#true} is VALID [2022-04-28 05:57:20,258 INFO L290 TraceCheckUtils]: 1: Hoare triple {1521#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1529#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:20,259 INFO L290 TraceCheckUtils]: 2: Hoare triple {1529#(<= ~counter~0 0)} assume true; {1529#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:20,259 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1529#(<= ~counter~0 0)} {1521#true} #102#return; {1529#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:20,260 INFO L272 TraceCheckUtils]: 4: Hoare triple {1529#(<= ~counter~0 0)} call #t~ret9 := main(); {1529#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:20,260 INFO L290 TraceCheckUtils]: 5: Hoare triple {1529#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {1529#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:20,260 INFO L272 TraceCheckUtils]: 6: Hoare triple {1529#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {1529#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:20,261 INFO L290 TraceCheckUtils]: 7: Hoare triple {1529#(<= ~counter~0 0)} ~cond := #in~cond; {1529#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:20,261 INFO L290 TraceCheckUtils]: 8: Hoare triple {1529#(<= ~counter~0 0)} assume !(0 == ~cond); {1529#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:20,261 INFO L290 TraceCheckUtils]: 9: Hoare triple {1529#(<= ~counter~0 0)} assume true; {1529#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:20,262 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1529#(<= ~counter~0 0)} {1529#(<= ~counter~0 0)} #90#return; {1529#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:20,263 INFO L272 TraceCheckUtils]: 11: Hoare triple {1529#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {1529#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:20,263 INFO L290 TraceCheckUtils]: 12: Hoare triple {1529#(<= ~counter~0 0)} ~cond := #in~cond; {1529#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:20,263 INFO L290 TraceCheckUtils]: 13: Hoare triple {1529#(<= ~counter~0 0)} assume !(0 == ~cond); {1529#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:20,264 INFO L290 TraceCheckUtils]: 14: Hoare triple {1529#(<= ~counter~0 0)} assume true; {1529#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:20,264 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1529#(<= ~counter~0 0)} {1529#(<= ~counter~0 0)} #92#return; {1529#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:20,264 INFO L290 TraceCheckUtils]: 16: Hoare triple {1529#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {1529#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:20,265 INFO L290 TraceCheckUtils]: 17: Hoare triple {1529#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1578#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:20,265 INFO L290 TraceCheckUtils]: 18: Hoare triple {1578#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {1578#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:20,266 INFO L272 TraceCheckUtils]: 19: Hoare triple {1578#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1578#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:20,266 INFO L290 TraceCheckUtils]: 20: Hoare triple {1578#(<= ~counter~0 1)} ~cond := #in~cond; {1578#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:20,266 INFO L290 TraceCheckUtils]: 21: Hoare triple {1578#(<= ~counter~0 1)} assume !(0 == ~cond); {1578#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:20,267 INFO L290 TraceCheckUtils]: 22: Hoare triple {1578#(<= ~counter~0 1)} assume true; {1578#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:20,267 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1578#(<= ~counter~0 1)} {1578#(<= ~counter~0 1)} #94#return; {1578#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:20,268 INFO L290 TraceCheckUtils]: 24: Hoare triple {1578#(<= ~counter~0 1)} assume !!(0 != ~r~0); {1578#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:20,268 INFO L290 TraceCheckUtils]: 25: Hoare triple {1578#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1603#(<= |main_#t~post7| 1)} is VALID [2022-04-28 05:57:20,268 INFO L290 TraceCheckUtils]: 26: Hoare triple {1603#(<= |main_#t~post7| 1)} assume !(#t~post7 < 20);havoc #t~post7; {1522#false} is VALID [2022-04-28 05:57:20,268 INFO L290 TraceCheckUtils]: 27: Hoare triple {1522#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {1522#false} is VALID [2022-04-28 05:57:20,269 INFO L290 TraceCheckUtils]: 28: Hoare triple {1522#false} assume !(#t~post8 < 20);havoc #t~post8; {1522#false} is VALID [2022-04-28 05:57:20,269 INFO L290 TraceCheckUtils]: 29: Hoare triple {1522#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1522#false} is VALID [2022-04-28 05:57:20,269 INFO L290 TraceCheckUtils]: 30: Hoare triple {1522#false} assume !(#t~post6 < 20);havoc #t~post6; {1522#false} is VALID [2022-04-28 05:57:20,269 INFO L272 TraceCheckUtils]: 31: Hoare triple {1522#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1522#false} is VALID [2022-04-28 05:57:20,269 INFO L290 TraceCheckUtils]: 32: Hoare triple {1522#false} ~cond := #in~cond; {1522#false} is VALID [2022-04-28 05:57:20,269 INFO L290 TraceCheckUtils]: 33: Hoare triple {1522#false} assume 0 == ~cond; {1522#false} is VALID [2022-04-28 05:57:20,269 INFO L290 TraceCheckUtils]: 34: Hoare triple {1522#false} assume !false; {1522#false} is VALID [2022-04-28 05:57:20,269 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 05:57:20,269 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 05:57:20,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:57:20,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072242339] [2022-04-28 05:57:20,270 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:57:20,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1868554083] [2022-04-28 05:57:20,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1868554083] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:57:20,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:57:20,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 05:57:20,270 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:57:20,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [490003137] [2022-04-28 05:57:20,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [490003137] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:57:20,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:57:20,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 05:57:20,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438176638] [2022-04-28 05:57:20,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:57:20,271 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 35 [2022-04-28 05:57:20,272 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:57:20,272 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 05:57:20,298 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:57:20,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 05:57:20,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:57:20,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 05:57:20,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-28 05:57:20,299 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 05:57:20,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:20,423 INFO L93 Difference]: Finished difference Result 65 states and 79 transitions. [2022-04-28 05:57:20,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 05:57:20,423 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 35 [2022-04-28 05:57:20,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:57:20,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 05:57:20,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2022-04-28 05:57:20,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 05:57:20,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2022-04-28 05:57:20,428 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 77 transitions. [2022-04-28 05:57:20,495 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:57:20,497 INFO L225 Difference]: With dead ends: 65 [2022-04-28 05:57:20,497 INFO L226 Difference]: Without dead ends: 44 [2022-04-28 05:57:20,497 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-28 05:57:20,498 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 6 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 05:57:20,498 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 103 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 05:57:20,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-28 05:57:20,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-04-28 05:57:20,526 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:57:20,527 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 44 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 05:57:20,527 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 44 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 05:57:20,527 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 44 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 05:57:20,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:20,529 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2022-04-28 05:57:20,529 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2022-04-28 05:57:20,529 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:57:20,529 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:57:20,529 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 44 states. [2022-04-28 05:57:20,530 INFO L87 Difference]: Start difference. First operand has 44 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 44 states. [2022-04-28 05:57:20,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:20,531 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2022-04-28 05:57:20,532 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2022-04-28 05:57:20,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:57:20,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:57:20,532 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:57:20,532 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:57:20,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 05:57:20,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2022-04-28 05:57:20,534 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 35 [2022-04-28 05:57:20,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:57:20,534 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2022-04-28 05:57:20,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 05:57:20,534 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 51 transitions. [2022-04-28 05:57:22,593 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 50 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 05:57:22,593 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2022-04-28 05:57:22,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-28 05:57:22,594 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:57:22,594 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:57:22,599 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-28 05:57:22,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:57:22,798 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:57:22,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:57:22,799 INFO L85 PathProgramCache]: Analyzing trace with hash -174895632, now seen corresponding path program 1 times [2022-04-28 05:57:22,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:57:22,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1173278737] [2022-04-28 05:57:22,799 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:57:22,799 INFO L85 PathProgramCache]: Analyzing trace with hash -174895632, now seen corresponding path program 2 times [2022-04-28 05:57:22,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:57:22,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745204170] [2022-04-28 05:57:22,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:57:22,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:57:22,824 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:57:22,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1319765391] [2022-04-28 05:57:22,824 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:57:22,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:57:22,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:57:22,829 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:57:22,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-28 05:57:22,871 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:57:22,871 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:57:22,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 05:57:22,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:57:22,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:57:23,109 INFO L272 TraceCheckUtils]: 0: Hoare triple {1936#true} call ULTIMATE.init(); {1936#true} is VALID [2022-04-28 05:57:23,110 INFO L290 TraceCheckUtils]: 1: Hoare triple {1936#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1944#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:23,110 INFO L290 TraceCheckUtils]: 2: Hoare triple {1944#(<= ~counter~0 0)} assume true; {1944#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:23,110 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1944#(<= ~counter~0 0)} {1936#true} #102#return; {1944#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:23,115 INFO L272 TraceCheckUtils]: 4: Hoare triple {1944#(<= ~counter~0 0)} call #t~ret9 := main(); {1944#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:23,115 INFO L290 TraceCheckUtils]: 5: Hoare triple {1944#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {1944#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:23,116 INFO L272 TraceCheckUtils]: 6: Hoare triple {1944#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {1944#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:23,117 INFO L290 TraceCheckUtils]: 7: Hoare triple {1944#(<= ~counter~0 0)} ~cond := #in~cond; {1944#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:23,117 INFO L290 TraceCheckUtils]: 8: Hoare triple {1944#(<= ~counter~0 0)} assume !(0 == ~cond); {1944#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:23,130 INFO L290 TraceCheckUtils]: 9: Hoare triple {1944#(<= ~counter~0 0)} assume true; {1944#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:23,131 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1944#(<= ~counter~0 0)} {1944#(<= ~counter~0 0)} #90#return; {1944#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:23,132 INFO L272 TraceCheckUtils]: 11: Hoare triple {1944#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {1944#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:23,132 INFO L290 TraceCheckUtils]: 12: Hoare triple {1944#(<= ~counter~0 0)} ~cond := #in~cond; {1944#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:23,132 INFO L290 TraceCheckUtils]: 13: Hoare triple {1944#(<= ~counter~0 0)} assume !(0 == ~cond); {1944#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:23,133 INFO L290 TraceCheckUtils]: 14: Hoare triple {1944#(<= ~counter~0 0)} assume true; {1944#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:23,133 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1944#(<= ~counter~0 0)} {1944#(<= ~counter~0 0)} #92#return; {1944#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:23,134 INFO L290 TraceCheckUtils]: 16: Hoare triple {1944#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {1944#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:23,134 INFO L290 TraceCheckUtils]: 17: Hoare triple {1944#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1993#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:23,135 INFO L290 TraceCheckUtils]: 18: Hoare triple {1993#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {1993#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:23,135 INFO L272 TraceCheckUtils]: 19: Hoare triple {1993#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1993#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:23,136 INFO L290 TraceCheckUtils]: 20: Hoare triple {1993#(<= ~counter~0 1)} ~cond := #in~cond; {1993#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:23,136 INFO L290 TraceCheckUtils]: 21: Hoare triple {1993#(<= ~counter~0 1)} assume !(0 == ~cond); {1993#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:23,137 INFO L290 TraceCheckUtils]: 22: Hoare triple {1993#(<= ~counter~0 1)} assume true; {1993#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:23,137 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1993#(<= ~counter~0 1)} {1993#(<= ~counter~0 1)} #94#return; {1993#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:23,138 INFO L290 TraceCheckUtils]: 24: Hoare triple {1993#(<= ~counter~0 1)} assume !!(0 != ~r~0); {1993#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:23,138 INFO L290 TraceCheckUtils]: 25: Hoare triple {1993#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2018#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:23,139 INFO L290 TraceCheckUtils]: 26: Hoare triple {2018#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {2018#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:23,139 INFO L272 TraceCheckUtils]: 27: Hoare triple {2018#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2018#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:23,140 INFO L290 TraceCheckUtils]: 28: Hoare triple {2018#(<= ~counter~0 2)} ~cond := #in~cond; {2018#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:23,140 INFO L290 TraceCheckUtils]: 29: Hoare triple {2018#(<= ~counter~0 2)} assume !(0 == ~cond); {2018#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:23,140 INFO L290 TraceCheckUtils]: 30: Hoare triple {2018#(<= ~counter~0 2)} assume true; {2018#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:23,141 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2018#(<= ~counter~0 2)} {2018#(<= ~counter~0 2)} #96#return; {2018#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:23,141 INFO L290 TraceCheckUtils]: 32: Hoare triple {2018#(<= ~counter~0 2)} assume !(~r~0 > 0); {2018#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:23,142 INFO L290 TraceCheckUtils]: 33: Hoare triple {2018#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {2043#(<= |main_#t~post8| 2)} is VALID [2022-04-28 05:57:23,142 INFO L290 TraceCheckUtils]: 34: Hoare triple {2043#(<= |main_#t~post8| 2)} assume !(#t~post8 < 20);havoc #t~post8; {1937#false} is VALID [2022-04-28 05:57:23,142 INFO L290 TraceCheckUtils]: 35: Hoare triple {1937#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1937#false} is VALID [2022-04-28 05:57:23,142 INFO L290 TraceCheckUtils]: 36: Hoare triple {1937#false} assume !(#t~post6 < 20);havoc #t~post6; {1937#false} is VALID [2022-04-28 05:57:23,142 INFO L272 TraceCheckUtils]: 37: Hoare triple {1937#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1937#false} is VALID [2022-04-28 05:57:23,142 INFO L290 TraceCheckUtils]: 38: Hoare triple {1937#false} ~cond := #in~cond; {1937#false} is VALID [2022-04-28 05:57:23,143 INFO L290 TraceCheckUtils]: 39: Hoare triple {1937#false} assume 0 == ~cond; {1937#false} is VALID [2022-04-28 05:57:23,143 INFO L290 TraceCheckUtils]: 40: Hoare triple {1937#false} assume !false; {1937#false} is VALID [2022-04-28 05:57:23,143 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 05:57:23,143 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:57:23,384 INFO L290 TraceCheckUtils]: 40: Hoare triple {1937#false} assume !false; {1937#false} is VALID [2022-04-28 05:57:23,384 INFO L290 TraceCheckUtils]: 39: Hoare triple {1937#false} assume 0 == ~cond; {1937#false} is VALID [2022-04-28 05:57:23,385 INFO L290 TraceCheckUtils]: 38: Hoare triple {1937#false} ~cond := #in~cond; {1937#false} is VALID [2022-04-28 05:57:23,385 INFO L272 TraceCheckUtils]: 37: Hoare triple {1937#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1937#false} is VALID [2022-04-28 05:57:23,385 INFO L290 TraceCheckUtils]: 36: Hoare triple {1937#false} assume !(#t~post6 < 20);havoc #t~post6; {1937#false} is VALID [2022-04-28 05:57:23,385 INFO L290 TraceCheckUtils]: 35: Hoare triple {1937#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1937#false} is VALID [2022-04-28 05:57:23,385 INFO L290 TraceCheckUtils]: 34: Hoare triple {2083#(< |main_#t~post8| 20)} assume !(#t~post8 < 20);havoc #t~post8; {1937#false} is VALID [2022-04-28 05:57:23,386 INFO L290 TraceCheckUtils]: 33: Hoare triple {2087#(< ~counter~0 20)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {2083#(< |main_#t~post8| 20)} is VALID [2022-04-28 05:57:23,386 INFO L290 TraceCheckUtils]: 32: Hoare triple {2087#(< ~counter~0 20)} assume !(~r~0 > 0); {2087#(< ~counter~0 20)} is VALID [2022-04-28 05:57:23,387 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1936#true} {2087#(< ~counter~0 20)} #96#return; {2087#(< ~counter~0 20)} is VALID [2022-04-28 05:57:23,387 INFO L290 TraceCheckUtils]: 30: Hoare triple {1936#true} assume true; {1936#true} is VALID [2022-04-28 05:57:23,387 INFO L290 TraceCheckUtils]: 29: Hoare triple {1936#true} assume !(0 == ~cond); {1936#true} is VALID [2022-04-28 05:57:23,387 INFO L290 TraceCheckUtils]: 28: Hoare triple {1936#true} ~cond := #in~cond; {1936#true} is VALID [2022-04-28 05:57:23,387 INFO L272 TraceCheckUtils]: 27: Hoare triple {2087#(< ~counter~0 20)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1936#true} is VALID [2022-04-28 05:57:23,387 INFO L290 TraceCheckUtils]: 26: Hoare triple {2087#(< ~counter~0 20)} assume !!(#t~post7 < 20);havoc #t~post7; {2087#(< ~counter~0 20)} is VALID [2022-04-28 05:57:23,388 INFO L290 TraceCheckUtils]: 25: Hoare triple {2112#(< ~counter~0 19)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2087#(< ~counter~0 20)} is VALID [2022-04-28 05:57:23,388 INFO L290 TraceCheckUtils]: 24: Hoare triple {2112#(< ~counter~0 19)} assume !!(0 != ~r~0); {2112#(< ~counter~0 19)} is VALID [2022-04-28 05:57:23,388 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1936#true} {2112#(< ~counter~0 19)} #94#return; {2112#(< ~counter~0 19)} is VALID [2022-04-28 05:57:23,389 INFO L290 TraceCheckUtils]: 22: Hoare triple {1936#true} assume true; {1936#true} is VALID [2022-04-28 05:57:23,389 INFO L290 TraceCheckUtils]: 21: Hoare triple {1936#true} assume !(0 == ~cond); {1936#true} is VALID [2022-04-28 05:57:23,389 INFO L290 TraceCheckUtils]: 20: Hoare triple {1936#true} ~cond := #in~cond; {1936#true} is VALID [2022-04-28 05:57:23,389 INFO L272 TraceCheckUtils]: 19: Hoare triple {2112#(< ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1936#true} is VALID [2022-04-28 05:57:23,389 INFO L290 TraceCheckUtils]: 18: Hoare triple {2112#(< ~counter~0 19)} assume !!(#t~post6 < 20);havoc #t~post6; {2112#(< ~counter~0 19)} is VALID [2022-04-28 05:57:23,389 INFO L290 TraceCheckUtils]: 17: Hoare triple {2137#(< ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2112#(< ~counter~0 19)} is VALID [2022-04-28 05:57:23,390 INFO L290 TraceCheckUtils]: 16: Hoare triple {2137#(< ~counter~0 18)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {2137#(< ~counter~0 18)} is VALID [2022-04-28 05:57:23,390 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1936#true} {2137#(< ~counter~0 18)} #92#return; {2137#(< ~counter~0 18)} is VALID [2022-04-28 05:57:23,390 INFO L290 TraceCheckUtils]: 14: Hoare triple {1936#true} assume true; {1936#true} is VALID [2022-04-28 05:57:23,390 INFO L290 TraceCheckUtils]: 13: Hoare triple {1936#true} assume !(0 == ~cond); {1936#true} is VALID [2022-04-28 05:57:23,390 INFO L290 TraceCheckUtils]: 12: Hoare triple {1936#true} ~cond := #in~cond; {1936#true} is VALID [2022-04-28 05:57:23,390 INFO L272 TraceCheckUtils]: 11: Hoare triple {2137#(< ~counter~0 18)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {1936#true} is VALID [2022-04-28 05:57:23,391 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1936#true} {2137#(< ~counter~0 18)} #90#return; {2137#(< ~counter~0 18)} is VALID [2022-04-28 05:57:23,391 INFO L290 TraceCheckUtils]: 9: Hoare triple {1936#true} assume true; {1936#true} is VALID [2022-04-28 05:57:23,391 INFO L290 TraceCheckUtils]: 8: Hoare triple {1936#true} assume !(0 == ~cond); {1936#true} is VALID [2022-04-28 05:57:23,391 INFO L290 TraceCheckUtils]: 7: Hoare triple {1936#true} ~cond := #in~cond; {1936#true} is VALID [2022-04-28 05:57:23,391 INFO L272 TraceCheckUtils]: 6: Hoare triple {2137#(< ~counter~0 18)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {1936#true} is VALID [2022-04-28 05:57:23,392 INFO L290 TraceCheckUtils]: 5: Hoare triple {2137#(< ~counter~0 18)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {2137#(< ~counter~0 18)} is VALID [2022-04-28 05:57:23,392 INFO L272 TraceCheckUtils]: 4: Hoare triple {2137#(< ~counter~0 18)} call #t~ret9 := main(); {2137#(< ~counter~0 18)} is VALID [2022-04-28 05:57:23,392 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2137#(< ~counter~0 18)} {1936#true} #102#return; {2137#(< ~counter~0 18)} is VALID [2022-04-28 05:57:23,393 INFO L290 TraceCheckUtils]: 2: Hoare triple {2137#(< ~counter~0 18)} assume true; {2137#(< ~counter~0 18)} is VALID [2022-04-28 05:57:23,393 INFO L290 TraceCheckUtils]: 1: Hoare triple {1936#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2137#(< ~counter~0 18)} is VALID [2022-04-28 05:57:23,393 INFO L272 TraceCheckUtils]: 0: Hoare triple {1936#true} call ULTIMATE.init(); {1936#true} is VALID [2022-04-28 05:57:23,394 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-28 05:57:23,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:57:23,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745204170] [2022-04-28 05:57:23,394 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:57:23,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1319765391] [2022-04-28 05:57:23,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1319765391] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 05:57:23,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 05:57:23,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2022-04-28 05:57:23,394 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:57:23,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1173278737] [2022-04-28 05:57:23,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1173278737] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:57:23,395 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:57:23,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 05:57:23,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781515330] [2022-04-28 05:57:23,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:57:23,395 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) Word has length 41 [2022-04-28 05:57:23,396 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:57:23,396 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 05:57:23,431 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:57:23,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 05:57:23,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:57:23,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 05:57:23,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-28 05:57:23,432 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 05:57:23,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:23,624 INFO L93 Difference]: Finished difference Result 74 states and 89 transitions. [2022-04-28 05:57:23,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 05:57:23,625 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) Word has length 41 [2022-04-28 05:57:23,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:57:23,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 05:57:23,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2022-04-28 05:57:23,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 05:57:23,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2022-04-28 05:57:23,629 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 87 transitions. [2022-04-28 05:57:23,699 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:57:23,701 INFO L225 Difference]: With dead ends: 74 [2022-04-28 05:57:23,701 INFO L226 Difference]: Without dead ends: 53 [2022-04-28 05:57:23,701 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-28 05:57:23,702 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 22 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 05:57:23,702 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 125 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 05:57:23,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-28 05:57:23,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2022-04-28 05:57:23,757 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:57:23,758 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 52 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 05:57:23,760 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 52 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 05:57:23,760 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 52 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 05:57:23,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:23,762 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2022-04-28 05:57:23,762 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2022-04-28 05:57:23,762 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:57:23,762 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:57:23,762 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 53 states. [2022-04-28 05:57:23,763 INFO L87 Difference]: Start difference. First operand has 52 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 53 states. [2022-04-28 05:57:23,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:23,766 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2022-04-28 05:57:23,766 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2022-04-28 05:57:23,766 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:57:23,766 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:57:23,766 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:57:23,767 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:57:23,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 05:57:23,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2022-04-28 05:57:23,770 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 60 transitions. Word has length 41 [2022-04-28 05:57:23,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:57:23,771 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 60 transitions. [2022-04-28 05:57:23,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 05:57:23,771 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 60 transitions. [2022-04-28 05:57:25,846 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 59 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 05:57:25,846 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2022-04-28 05:57:25,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-28 05:57:25,847 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:57:25,847 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:57:25,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-28 05:57:26,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:57:26,048 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:57:26,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:57:26,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1292932747, now seen corresponding path program 1 times [2022-04-28 05:57:26,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:57:26,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [454794653] [2022-04-28 05:57:26,049 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:57:26,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1292932747, now seen corresponding path program 2 times [2022-04-28 05:57:26,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:57:26,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335148811] [2022-04-28 05:57:26,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:57:26,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:57:26,066 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:57:26,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1589204955] [2022-04-28 05:57:26,066 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:57:26,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:57:26,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:57:26,067 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:57:26,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-28 05:57:26,112 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:57:26,113 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:57:26,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 05:57:26,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:57:26,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:57:26,355 INFO L272 TraceCheckUtils]: 0: Hoare triple {2549#true} call ULTIMATE.init(); {2549#true} is VALID [2022-04-28 05:57:26,356 INFO L290 TraceCheckUtils]: 1: Hoare triple {2549#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2557#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:26,357 INFO L290 TraceCheckUtils]: 2: Hoare triple {2557#(<= ~counter~0 0)} assume true; {2557#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:26,358 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2557#(<= ~counter~0 0)} {2549#true} #102#return; {2557#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:26,359 INFO L272 TraceCheckUtils]: 4: Hoare triple {2557#(<= ~counter~0 0)} call #t~ret9 := main(); {2557#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:26,361 INFO L290 TraceCheckUtils]: 5: Hoare triple {2557#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {2557#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:26,362 INFO L272 TraceCheckUtils]: 6: Hoare triple {2557#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {2557#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:26,362 INFO L290 TraceCheckUtils]: 7: Hoare triple {2557#(<= ~counter~0 0)} ~cond := #in~cond; {2557#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:26,362 INFO L290 TraceCheckUtils]: 8: Hoare triple {2557#(<= ~counter~0 0)} assume !(0 == ~cond); {2557#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:26,363 INFO L290 TraceCheckUtils]: 9: Hoare triple {2557#(<= ~counter~0 0)} assume true; {2557#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:26,364 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2557#(<= ~counter~0 0)} {2557#(<= ~counter~0 0)} #90#return; {2557#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:26,366 INFO L272 TraceCheckUtils]: 11: Hoare triple {2557#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {2557#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:26,369 INFO L290 TraceCheckUtils]: 12: Hoare triple {2557#(<= ~counter~0 0)} ~cond := #in~cond; {2557#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:26,369 INFO L290 TraceCheckUtils]: 13: Hoare triple {2557#(<= ~counter~0 0)} assume !(0 == ~cond); {2557#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:26,369 INFO L290 TraceCheckUtils]: 14: Hoare triple {2557#(<= ~counter~0 0)} assume true; {2557#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:26,370 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2557#(<= ~counter~0 0)} {2557#(<= ~counter~0 0)} #92#return; {2557#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:26,370 INFO L290 TraceCheckUtils]: 16: Hoare triple {2557#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {2557#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:26,371 INFO L290 TraceCheckUtils]: 17: Hoare triple {2557#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2606#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:26,371 INFO L290 TraceCheckUtils]: 18: Hoare triple {2606#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {2606#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:26,372 INFO L272 TraceCheckUtils]: 19: Hoare triple {2606#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2606#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:26,372 INFO L290 TraceCheckUtils]: 20: Hoare triple {2606#(<= ~counter~0 1)} ~cond := #in~cond; {2606#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:26,373 INFO L290 TraceCheckUtils]: 21: Hoare triple {2606#(<= ~counter~0 1)} assume !(0 == ~cond); {2606#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:26,373 INFO L290 TraceCheckUtils]: 22: Hoare triple {2606#(<= ~counter~0 1)} assume true; {2606#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:26,374 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2606#(<= ~counter~0 1)} {2606#(<= ~counter~0 1)} #94#return; {2606#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:26,374 INFO L290 TraceCheckUtils]: 24: Hoare triple {2606#(<= ~counter~0 1)} assume !!(0 != ~r~0); {2606#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:26,375 INFO L290 TraceCheckUtils]: 25: Hoare triple {2606#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2631#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:26,375 INFO L290 TraceCheckUtils]: 26: Hoare triple {2631#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {2631#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:26,376 INFO L272 TraceCheckUtils]: 27: Hoare triple {2631#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2631#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:26,376 INFO L290 TraceCheckUtils]: 28: Hoare triple {2631#(<= ~counter~0 2)} ~cond := #in~cond; {2631#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:26,376 INFO L290 TraceCheckUtils]: 29: Hoare triple {2631#(<= ~counter~0 2)} assume !(0 == ~cond); {2631#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:26,377 INFO L290 TraceCheckUtils]: 30: Hoare triple {2631#(<= ~counter~0 2)} assume true; {2631#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:26,377 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2631#(<= ~counter~0 2)} {2631#(<= ~counter~0 2)} #96#return; {2631#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:26,378 INFO L290 TraceCheckUtils]: 32: Hoare triple {2631#(<= ~counter~0 2)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2631#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:26,378 INFO L290 TraceCheckUtils]: 33: Hoare triple {2631#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2656#(<= |main_#t~post7| 2)} is VALID [2022-04-28 05:57:26,379 INFO L290 TraceCheckUtils]: 34: Hoare triple {2656#(<= |main_#t~post7| 2)} assume !(#t~post7 < 20);havoc #t~post7; {2550#false} is VALID [2022-04-28 05:57:26,379 INFO L290 TraceCheckUtils]: 35: Hoare triple {2550#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {2550#false} is VALID [2022-04-28 05:57:26,379 INFO L290 TraceCheckUtils]: 36: Hoare triple {2550#false} assume !(#t~post8 < 20);havoc #t~post8; {2550#false} is VALID [2022-04-28 05:57:26,379 INFO L290 TraceCheckUtils]: 37: Hoare triple {2550#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2550#false} is VALID [2022-04-28 05:57:26,379 INFO L290 TraceCheckUtils]: 38: Hoare triple {2550#false} assume !(#t~post6 < 20);havoc #t~post6; {2550#false} is VALID [2022-04-28 05:57:26,379 INFO L272 TraceCheckUtils]: 39: Hoare triple {2550#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2550#false} is VALID [2022-04-28 05:57:26,379 INFO L290 TraceCheckUtils]: 40: Hoare triple {2550#false} ~cond := #in~cond; {2550#false} is VALID [2022-04-28 05:57:26,379 INFO L290 TraceCheckUtils]: 41: Hoare triple {2550#false} assume 0 == ~cond; {2550#false} is VALID [2022-04-28 05:57:26,379 INFO L290 TraceCheckUtils]: 42: Hoare triple {2550#false} assume !false; {2550#false} is VALID [2022-04-28 05:57:26,380 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 05:57:26,380 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:57:26,614 INFO L290 TraceCheckUtils]: 42: Hoare triple {2550#false} assume !false; {2550#false} is VALID [2022-04-28 05:57:26,615 INFO L290 TraceCheckUtils]: 41: Hoare triple {2550#false} assume 0 == ~cond; {2550#false} is VALID [2022-04-28 05:57:26,615 INFO L290 TraceCheckUtils]: 40: Hoare triple {2550#false} ~cond := #in~cond; {2550#false} is VALID [2022-04-28 05:57:26,615 INFO L272 TraceCheckUtils]: 39: Hoare triple {2550#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2550#false} is VALID [2022-04-28 05:57:26,615 INFO L290 TraceCheckUtils]: 38: Hoare triple {2550#false} assume !(#t~post6 < 20);havoc #t~post6; {2550#false} is VALID [2022-04-28 05:57:26,615 INFO L290 TraceCheckUtils]: 37: Hoare triple {2550#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2550#false} is VALID [2022-04-28 05:57:26,615 INFO L290 TraceCheckUtils]: 36: Hoare triple {2550#false} assume !(#t~post8 < 20);havoc #t~post8; {2550#false} is VALID [2022-04-28 05:57:26,615 INFO L290 TraceCheckUtils]: 35: Hoare triple {2550#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {2550#false} is VALID [2022-04-28 05:57:26,616 INFO L290 TraceCheckUtils]: 34: Hoare triple {2708#(< |main_#t~post7| 20)} assume !(#t~post7 < 20);havoc #t~post7; {2550#false} is VALID [2022-04-28 05:57:26,616 INFO L290 TraceCheckUtils]: 33: Hoare triple {2712#(< ~counter~0 20)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2708#(< |main_#t~post7| 20)} is VALID [2022-04-28 05:57:26,616 INFO L290 TraceCheckUtils]: 32: Hoare triple {2712#(< ~counter~0 20)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2712#(< ~counter~0 20)} is VALID [2022-04-28 05:57:26,617 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2549#true} {2712#(< ~counter~0 20)} #96#return; {2712#(< ~counter~0 20)} is VALID [2022-04-28 05:57:26,617 INFO L290 TraceCheckUtils]: 30: Hoare triple {2549#true} assume true; {2549#true} is VALID [2022-04-28 05:57:26,617 INFO L290 TraceCheckUtils]: 29: Hoare triple {2549#true} assume !(0 == ~cond); {2549#true} is VALID [2022-04-28 05:57:26,617 INFO L290 TraceCheckUtils]: 28: Hoare triple {2549#true} ~cond := #in~cond; {2549#true} is VALID [2022-04-28 05:57:26,618 INFO L272 TraceCheckUtils]: 27: Hoare triple {2712#(< ~counter~0 20)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2549#true} is VALID [2022-04-28 05:57:26,618 INFO L290 TraceCheckUtils]: 26: Hoare triple {2712#(< ~counter~0 20)} assume !!(#t~post7 < 20);havoc #t~post7; {2712#(< ~counter~0 20)} is VALID [2022-04-28 05:57:26,619 INFO L290 TraceCheckUtils]: 25: Hoare triple {2737#(< ~counter~0 19)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2712#(< ~counter~0 20)} is VALID [2022-04-28 05:57:26,619 INFO L290 TraceCheckUtils]: 24: Hoare triple {2737#(< ~counter~0 19)} assume !!(0 != ~r~0); {2737#(< ~counter~0 19)} is VALID [2022-04-28 05:57:26,620 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2549#true} {2737#(< ~counter~0 19)} #94#return; {2737#(< ~counter~0 19)} is VALID [2022-04-28 05:57:26,620 INFO L290 TraceCheckUtils]: 22: Hoare triple {2549#true} assume true; {2549#true} is VALID [2022-04-28 05:57:26,620 INFO L290 TraceCheckUtils]: 21: Hoare triple {2549#true} assume !(0 == ~cond); {2549#true} is VALID [2022-04-28 05:57:26,620 INFO L290 TraceCheckUtils]: 20: Hoare triple {2549#true} ~cond := #in~cond; {2549#true} is VALID [2022-04-28 05:57:26,620 INFO L272 TraceCheckUtils]: 19: Hoare triple {2737#(< ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2549#true} is VALID [2022-04-28 05:57:26,621 INFO L290 TraceCheckUtils]: 18: Hoare triple {2737#(< ~counter~0 19)} assume !!(#t~post6 < 20);havoc #t~post6; {2737#(< ~counter~0 19)} is VALID [2022-04-28 05:57:26,622 INFO L290 TraceCheckUtils]: 17: Hoare triple {2762#(< ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2737#(< ~counter~0 19)} is VALID [2022-04-28 05:57:26,622 INFO L290 TraceCheckUtils]: 16: Hoare triple {2762#(< ~counter~0 18)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {2762#(< ~counter~0 18)} is VALID [2022-04-28 05:57:26,623 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2549#true} {2762#(< ~counter~0 18)} #92#return; {2762#(< ~counter~0 18)} is VALID [2022-04-28 05:57:26,623 INFO L290 TraceCheckUtils]: 14: Hoare triple {2549#true} assume true; {2549#true} is VALID [2022-04-28 05:57:26,623 INFO L290 TraceCheckUtils]: 13: Hoare triple {2549#true} assume !(0 == ~cond); {2549#true} is VALID [2022-04-28 05:57:26,623 INFO L290 TraceCheckUtils]: 12: Hoare triple {2549#true} ~cond := #in~cond; {2549#true} is VALID [2022-04-28 05:57:26,623 INFO L272 TraceCheckUtils]: 11: Hoare triple {2762#(< ~counter~0 18)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {2549#true} is VALID [2022-04-28 05:57:26,624 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2549#true} {2762#(< ~counter~0 18)} #90#return; {2762#(< ~counter~0 18)} is VALID [2022-04-28 05:57:26,624 INFO L290 TraceCheckUtils]: 9: Hoare triple {2549#true} assume true; {2549#true} is VALID [2022-04-28 05:57:26,624 INFO L290 TraceCheckUtils]: 8: Hoare triple {2549#true} assume !(0 == ~cond); {2549#true} is VALID [2022-04-28 05:57:26,624 INFO L290 TraceCheckUtils]: 7: Hoare triple {2549#true} ~cond := #in~cond; {2549#true} is VALID [2022-04-28 05:57:26,624 INFO L272 TraceCheckUtils]: 6: Hoare triple {2762#(< ~counter~0 18)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {2549#true} is VALID [2022-04-28 05:57:26,624 INFO L290 TraceCheckUtils]: 5: Hoare triple {2762#(< ~counter~0 18)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {2762#(< ~counter~0 18)} is VALID [2022-04-28 05:57:26,625 INFO L272 TraceCheckUtils]: 4: Hoare triple {2762#(< ~counter~0 18)} call #t~ret9 := main(); {2762#(< ~counter~0 18)} is VALID [2022-04-28 05:57:26,625 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2762#(< ~counter~0 18)} {2549#true} #102#return; {2762#(< ~counter~0 18)} is VALID [2022-04-28 05:57:26,625 INFO L290 TraceCheckUtils]: 2: Hoare triple {2762#(< ~counter~0 18)} assume true; {2762#(< ~counter~0 18)} is VALID [2022-04-28 05:57:26,626 INFO L290 TraceCheckUtils]: 1: Hoare triple {2549#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2762#(< ~counter~0 18)} is VALID [2022-04-28 05:57:26,626 INFO L272 TraceCheckUtils]: 0: Hoare triple {2549#true} call ULTIMATE.init(); {2549#true} is VALID [2022-04-28 05:57:26,626 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-28 05:57:26,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:57:26,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335148811] [2022-04-28 05:57:26,627 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:57:26,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1589204955] [2022-04-28 05:57:26,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1589204955] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:57:26,627 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:57:26,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-28 05:57:26,627 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:57:26,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [454794653] [2022-04-28 05:57:26,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [454794653] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:57:26,627 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:57:26,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 05:57:26,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330580663] [2022-04-28 05:57:26,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:57:26,628 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) Word has length 43 [2022-04-28 05:57:26,628 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:57:26,628 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 05:57:26,661 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:57:26,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 05:57:26,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:57:26,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 05:57:26,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-28 05:57:26,662 INFO L87 Difference]: Start difference. First operand 52 states and 60 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 05:57:26,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:26,876 INFO L93 Difference]: Finished difference Result 75 states and 90 transitions. [2022-04-28 05:57:26,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 05:57:26,876 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) Word has length 43 [2022-04-28 05:57:26,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:57:26,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 05:57:26,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 87 transitions. [2022-04-28 05:57:26,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 05:57:26,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 87 transitions. [2022-04-28 05:57:26,880 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 87 transitions. [2022-04-28 05:57:26,948 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:57:26,950 INFO L225 Difference]: With dead ends: 75 [2022-04-28 05:57:26,950 INFO L226 Difference]: Without dead ends: 54 [2022-04-28 05:57:26,950 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-04-28 05:57:26,951 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 9 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 05:57:26,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 141 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 05:57:26,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-28 05:57:27,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-04-28 05:57:27,032 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:57:27,032 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 54 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 states have internal predecessors, (44), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 05:57:27,032 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 54 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 states have internal predecessors, (44), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 05:57:27,032 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 54 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 states have internal predecessors, (44), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 05:57:27,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:27,034 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2022-04-28 05:57:27,034 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2022-04-28 05:57:27,035 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:57:27,035 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:57:27,035 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 states have internal predecessors, (44), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 54 states. [2022-04-28 05:57:27,035 INFO L87 Difference]: Start difference. First operand has 54 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 states have internal predecessors, (44), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 54 states. [2022-04-28 05:57:27,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:27,037 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2022-04-28 05:57:27,037 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2022-04-28 05:57:27,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:57:27,037 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:57:27,037 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:57:27,037 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:57:27,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 states have internal predecessors, (44), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 05:57:27,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2022-04-28 05:57:27,039 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 62 transitions. Word has length 43 [2022-04-28 05:57:27,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:57:27,040 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 62 transitions. [2022-04-28 05:57:27,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 05:57:27,040 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 62 transitions. [2022-04-28 05:57:29,121 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 61 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 05:57:29,121 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2022-04-28 05:57:29,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-28 05:57:29,121 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:57:29,121 INFO L195 NwaCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:57:29,138 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-28 05:57:29,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:57:29,322 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:57:29,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:57:29,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1407897436, now seen corresponding path program 1 times [2022-04-28 05:57:29,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:57:29,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1743263629] [2022-04-28 05:57:29,323 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:57:29,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1407897436, now seen corresponding path program 2 times [2022-04-28 05:57:29,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:57:29,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32370916] [2022-04-28 05:57:29,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:57:29,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:57:29,344 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:57:29,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1213628246] [2022-04-28 05:57:29,345 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:57:29,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:57:29,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:57:29,347 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:57:29,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-28 05:57:29,403 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:57:29,403 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:57:29,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-28 05:57:29,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:57:29,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:57:29,570 INFO L272 TraceCheckUtils]: 0: Hoare triple {3184#true} call ULTIMATE.init(); {3184#true} is VALID [2022-04-28 05:57:29,570 INFO L290 TraceCheckUtils]: 1: Hoare triple {3184#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3184#true} is VALID [2022-04-28 05:57:29,570 INFO L290 TraceCheckUtils]: 2: Hoare triple {3184#true} assume true; {3184#true} is VALID [2022-04-28 05:57:29,570 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3184#true} {3184#true} #102#return; {3184#true} is VALID [2022-04-28 05:57:29,570 INFO L272 TraceCheckUtils]: 4: Hoare triple {3184#true} call #t~ret9 := main(); {3184#true} is VALID [2022-04-28 05:57:29,570 INFO L290 TraceCheckUtils]: 5: Hoare triple {3184#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {3184#true} is VALID [2022-04-28 05:57:29,570 INFO L272 TraceCheckUtils]: 6: Hoare triple {3184#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {3184#true} is VALID [2022-04-28 05:57:29,571 INFO L290 TraceCheckUtils]: 7: Hoare triple {3184#true} ~cond := #in~cond; {3184#true} is VALID [2022-04-28 05:57:29,571 INFO L290 TraceCheckUtils]: 8: Hoare triple {3184#true} assume !(0 == ~cond); {3184#true} is VALID [2022-04-28 05:57:29,571 INFO L290 TraceCheckUtils]: 9: Hoare triple {3184#true} assume true; {3184#true} is VALID [2022-04-28 05:57:29,571 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3184#true} {3184#true} #90#return; {3184#true} is VALID [2022-04-28 05:57:29,571 INFO L272 TraceCheckUtils]: 11: Hoare triple {3184#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {3184#true} is VALID [2022-04-28 05:57:29,571 INFO L290 TraceCheckUtils]: 12: Hoare triple {3184#true} ~cond := #in~cond; {3184#true} is VALID [2022-04-28 05:57:29,571 INFO L290 TraceCheckUtils]: 13: Hoare triple {3184#true} assume !(0 == ~cond); {3184#true} is VALID [2022-04-28 05:57:29,571 INFO L290 TraceCheckUtils]: 14: Hoare triple {3184#true} assume true; {3184#true} is VALID [2022-04-28 05:57:29,571 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3184#true} {3184#true} #92#return; {3184#true} is VALID [2022-04-28 05:57:29,572 INFO L290 TraceCheckUtils]: 16: Hoare triple {3184#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {3184#true} is VALID [2022-04-28 05:57:29,572 INFO L290 TraceCheckUtils]: 17: Hoare triple {3184#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3184#true} is VALID [2022-04-28 05:57:29,572 INFO L290 TraceCheckUtils]: 18: Hoare triple {3184#true} assume !!(#t~post6 < 20);havoc #t~post6; {3184#true} is VALID [2022-04-28 05:57:29,572 INFO L272 TraceCheckUtils]: 19: Hoare triple {3184#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {3184#true} is VALID [2022-04-28 05:57:29,572 INFO L290 TraceCheckUtils]: 20: Hoare triple {3184#true} ~cond := #in~cond; {3184#true} is VALID [2022-04-28 05:57:29,572 INFO L290 TraceCheckUtils]: 21: Hoare triple {3184#true} assume !(0 == ~cond); {3184#true} is VALID [2022-04-28 05:57:29,572 INFO L290 TraceCheckUtils]: 22: Hoare triple {3184#true} assume true; {3184#true} is VALID [2022-04-28 05:57:29,572 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3184#true} {3184#true} #94#return; {3184#true} is VALID [2022-04-28 05:57:29,573 INFO L290 TraceCheckUtils]: 24: Hoare triple {3184#true} assume !!(0 != ~r~0); {3261#(not (= main_~r~0 0))} is VALID [2022-04-28 05:57:29,573 INFO L290 TraceCheckUtils]: 25: Hoare triple {3261#(not (= main_~r~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {3261#(not (= main_~r~0 0))} is VALID [2022-04-28 05:57:29,573 INFO L290 TraceCheckUtils]: 26: Hoare triple {3261#(not (= main_~r~0 0))} assume !!(#t~post7 < 20);havoc #t~post7; {3261#(not (= main_~r~0 0))} is VALID [2022-04-28 05:57:29,573 INFO L272 TraceCheckUtils]: 27: Hoare triple {3261#(not (= main_~r~0 0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {3184#true} is VALID [2022-04-28 05:57:29,573 INFO L290 TraceCheckUtils]: 28: Hoare triple {3184#true} ~cond := #in~cond; {3184#true} is VALID [2022-04-28 05:57:29,573 INFO L290 TraceCheckUtils]: 29: Hoare triple {3184#true} assume !(0 == ~cond); {3184#true} is VALID [2022-04-28 05:57:29,574 INFO L290 TraceCheckUtils]: 30: Hoare triple {3184#true} assume true; {3184#true} is VALID [2022-04-28 05:57:29,574 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3184#true} {3261#(not (= main_~r~0 0))} #96#return; {3261#(not (= main_~r~0 0))} is VALID [2022-04-28 05:57:29,575 INFO L290 TraceCheckUtils]: 32: Hoare triple {3261#(not (= main_~r~0 0))} assume !(~r~0 > 0); {3286#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} is VALID [2022-04-28 05:57:29,575 INFO L290 TraceCheckUtils]: 33: Hoare triple {3286#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {3286#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} is VALID [2022-04-28 05:57:29,575 INFO L290 TraceCheckUtils]: 34: Hoare triple {3286#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} assume !!(#t~post8 < 20);havoc #t~post8; {3286#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} is VALID [2022-04-28 05:57:29,581 INFO L272 TraceCheckUtils]: 35: Hoare triple {3286#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {3184#true} is VALID [2022-04-28 05:57:29,581 INFO L290 TraceCheckUtils]: 36: Hoare triple {3184#true} ~cond := #in~cond; {3184#true} is VALID [2022-04-28 05:57:29,582 INFO L290 TraceCheckUtils]: 37: Hoare triple {3184#true} assume !(0 == ~cond); {3184#true} is VALID [2022-04-28 05:57:29,582 INFO L290 TraceCheckUtils]: 38: Hoare triple {3184#true} assume true; {3184#true} is VALID [2022-04-28 05:57:29,582 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {3184#true} {3286#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} #98#return; {3286#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} is VALID [2022-04-28 05:57:29,583 INFO L290 TraceCheckUtils]: 40: Hoare triple {3286#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} assume !(~r~0 < 0); {3185#false} is VALID [2022-04-28 05:57:29,584 INFO L290 TraceCheckUtils]: 41: Hoare triple {3185#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3185#false} is VALID [2022-04-28 05:57:29,584 INFO L290 TraceCheckUtils]: 42: Hoare triple {3185#false} assume !(#t~post6 < 20);havoc #t~post6; {3185#false} is VALID [2022-04-28 05:57:29,584 INFO L272 TraceCheckUtils]: 43: Hoare triple {3185#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {3185#false} is VALID [2022-04-28 05:57:29,584 INFO L290 TraceCheckUtils]: 44: Hoare triple {3185#false} ~cond := #in~cond; {3185#false} is VALID [2022-04-28 05:57:29,587 INFO L290 TraceCheckUtils]: 45: Hoare triple {3185#false} assume 0 == ~cond; {3185#false} is VALID [2022-04-28 05:57:29,587 INFO L290 TraceCheckUtils]: 46: Hoare triple {3185#false} assume !false; {3185#false} is VALID [2022-04-28 05:57:29,587 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-28 05:57:29,587 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 05:57:29,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:57:29,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32370916] [2022-04-28 05:57:29,588 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:57:29,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1213628246] [2022-04-28 05:57:29,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1213628246] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:57:29,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:57:29,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 05:57:29,588 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:57:29,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1743263629] [2022-04-28 05:57:29,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1743263629] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:57:29,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:57:29,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 05:57:29,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012215558] [2022-04-28 05:57:29,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:57:29,591 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 47 [2022-04-28 05:57:29,592 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:57:29,592 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-28 05:57:29,621 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:57:29,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 05:57:29,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:57:29,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 05:57:29,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-28 05:57:29,623 INFO L87 Difference]: Start difference. First operand 54 states and 62 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-28 05:57:29,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:29,827 INFO L93 Difference]: Finished difference Result 101 states and 131 transitions. [2022-04-28 05:57:29,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 05:57:29,827 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 47 [2022-04-28 05:57:29,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:57:29,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-28 05:57:29,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2022-04-28 05:57:29,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-28 05:57:29,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2022-04-28 05:57:29,833 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 108 transitions. [2022-04-28 05:57:29,926 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:57:29,928 INFO L225 Difference]: With dead ends: 101 [2022-04-28 05:57:29,928 INFO L226 Difference]: Without dead ends: 80 [2022-04-28 05:57:29,929 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-28 05:57:29,929 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 19 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 05:57:29,930 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 101 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 05:57:29,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-04-28 05:57:30,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 70. [2022-04-28 05:57:30,010 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:57:30,010 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand has 70 states, 50 states have (on average 1.22) internal successors, (61), 50 states have internal predecessors, (61), 14 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 05:57:30,010 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand has 70 states, 50 states have (on average 1.22) internal successors, (61), 50 states have internal predecessors, (61), 14 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 05:57:30,011 INFO L87 Difference]: Start difference. First operand 80 states. Second operand has 70 states, 50 states have (on average 1.22) internal successors, (61), 50 states have internal predecessors, (61), 14 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 05:57:30,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:30,014 INFO L93 Difference]: Finished difference Result 80 states and 102 transitions. [2022-04-28 05:57:30,014 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 102 transitions. [2022-04-28 05:57:30,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:57:30,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:57:30,015 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 50 states have (on average 1.22) internal successors, (61), 50 states have internal predecessors, (61), 14 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 80 states. [2022-04-28 05:57:30,015 INFO L87 Difference]: Start difference. First operand has 70 states, 50 states have (on average 1.22) internal successors, (61), 50 states have internal predecessors, (61), 14 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 80 states. [2022-04-28 05:57:30,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:30,018 INFO L93 Difference]: Finished difference Result 80 states and 102 transitions. [2022-04-28 05:57:30,018 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 102 transitions. [2022-04-28 05:57:30,019 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:57:30,019 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:57:30,019 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:57:30,019 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:57:30,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 50 states have (on average 1.22) internal successors, (61), 50 states have internal predecessors, (61), 14 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 05:57:30,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 87 transitions. [2022-04-28 05:57:30,026 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 87 transitions. Word has length 47 [2022-04-28 05:57:30,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:57:30,027 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 87 transitions. [2022-04-28 05:57:30,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-28 05:57:30,027 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 70 states and 87 transitions. [2022-04-28 05:57:32,148 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 86 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 05:57:32,149 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 87 transitions. [2022-04-28 05:57:32,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-28 05:57:32,149 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:57:32,149 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:57:32,169 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-28 05:57:32,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-04-28 05:57:32,350 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:57:32,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:57:32,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1915058849, now seen corresponding path program 1 times [2022-04-28 05:57:32,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:57:32,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1143723099] [2022-04-28 05:57:32,351 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:57:32,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1915058849, now seen corresponding path program 2 times [2022-04-28 05:57:32,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:57:32,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882097356] [2022-04-28 05:57:32,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:57:32,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:57:32,369 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:57:32,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1284288517] [2022-04-28 05:57:32,369 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:57:32,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:57:32,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:57:32,373 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:57:32,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-28 05:57:32,418 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:57:32,419 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:57:32,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 05:57:32,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:57:32,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:57:32,678 INFO L272 TraceCheckUtils]: 0: Hoare triple {3830#true} call ULTIMATE.init(); {3830#true} is VALID [2022-04-28 05:57:32,679 INFO L290 TraceCheckUtils]: 1: Hoare triple {3830#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3838#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:32,679 INFO L290 TraceCheckUtils]: 2: Hoare triple {3838#(<= ~counter~0 0)} assume true; {3838#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:32,680 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3838#(<= ~counter~0 0)} {3830#true} #102#return; {3838#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:32,681 INFO L272 TraceCheckUtils]: 4: Hoare triple {3838#(<= ~counter~0 0)} call #t~ret9 := main(); {3838#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:32,682 INFO L290 TraceCheckUtils]: 5: Hoare triple {3838#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {3838#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:32,683 INFO L272 TraceCheckUtils]: 6: Hoare triple {3838#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {3838#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:32,683 INFO L290 TraceCheckUtils]: 7: Hoare triple {3838#(<= ~counter~0 0)} ~cond := #in~cond; {3838#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:32,684 INFO L290 TraceCheckUtils]: 8: Hoare triple {3838#(<= ~counter~0 0)} assume !(0 == ~cond); {3838#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:32,684 INFO L290 TraceCheckUtils]: 9: Hoare triple {3838#(<= ~counter~0 0)} assume true; {3838#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:32,685 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3838#(<= ~counter~0 0)} {3838#(<= ~counter~0 0)} #90#return; {3838#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:32,685 INFO L272 TraceCheckUtils]: 11: Hoare triple {3838#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {3838#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:32,685 INFO L290 TraceCheckUtils]: 12: Hoare triple {3838#(<= ~counter~0 0)} ~cond := #in~cond; {3838#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:32,686 INFO L290 TraceCheckUtils]: 13: Hoare triple {3838#(<= ~counter~0 0)} assume !(0 == ~cond); {3838#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:32,686 INFO L290 TraceCheckUtils]: 14: Hoare triple {3838#(<= ~counter~0 0)} assume true; {3838#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:32,686 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3838#(<= ~counter~0 0)} {3838#(<= ~counter~0 0)} #92#return; {3838#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:32,687 INFO L290 TraceCheckUtils]: 16: Hoare triple {3838#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {3838#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:32,687 INFO L290 TraceCheckUtils]: 17: Hoare triple {3838#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3887#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:32,688 INFO L290 TraceCheckUtils]: 18: Hoare triple {3887#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {3887#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:32,688 INFO L272 TraceCheckUtils]: 19: Hoare triple {3887#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {3887#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:32,689 INFO L290 TraceCheckUtils]: 20: Hoare triple {3887#(<= ~counter~0 1)} ~cond := #in~cond; {3887#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:32,689 INFO L290 TraceCheckUtils]: 21: Hoare triple {3887#(<= ~counter~0 1)} assume !(0 == ~cond); {3887#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:32,689 INFO L290 TraceCheckUtils]: 22: Hoare triple {3887#(<= ~counter~0 1)} assume true; {3887#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:32,690 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3887#(<= ~counter~0 1)} {3887#(<= ~counter~0 1)} #94#return; {3887#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:32,690 INFO L290 TraceCheckUtils]: 24: Hoare triple {3887#(<= ~counter~0 1)} assume !!(0 != ~r~0); {3887#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:32,691 INFO L290 TraceCheckUtils]: 25: Hoare triple {3887#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {3912#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:32,691 INFO L290 TraceCheckUtils]: 26: Hoare triple {3912#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {3912#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:32,691 INFO L272 TraceCheckUtils]: 27: Hoare triple {3912#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {3912#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:32,692 INFO L290 TraceCheckUtils]: 28: Hoare triple {3912#(<= ~counter~0 2)} ~cond := #in~cond; {3912#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:32,692 INFO L290 TraceCheckUtils]: 29: Hoare triple {3912#(<= ~counter~0 2)} assume !(0 == ~cond); {3912#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:32,692 INFO L290 TraceCheckUtils]: 30: Hoare triple {3912#(<= ~counter~0 2)} assume true; {3912#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:32,693 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3912#(<= ~counter~0 2)} {3912#(<= ~counter~0 2)} #96#return; {3912#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:32,693 INFO L290 TraceCheckUtils]: 32: Hoare triple {3912#(<= ~counter~0 2)} assume !(~r~0 > 0); {3912#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:32,694 INFO L290 TraceCheckUtils]: 33: Hoare triple {3912#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {3937#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:32,694 INFO L290 TraceCheckUtils]: 34: Hoare triple {3937#(<= ~counter~0 3)} assume !!(#t~post8 < 20);havoc #t~post8; {3937#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:32,695 INFO L272 TraceCheckUtils]: 35: Hoare triple {3937#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {3937#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:32,695 INFO L290 TraceCheckUtils]: 36: Hoare triple {3937#(<= ~counter~0 3)} ~cond := #in~cond; {3937#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:32,695 INFO L290 TraceCheckUtils]: 37: Hoare triple {3937#(<= ~counter~0 3)} assume !(0 == ~cond); {3937#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:32,696 INFO L290 TraceCheckUtils]: 38: Hoare triple {3937#(<= ~counter~0 3)} assume true; {3937#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:32,696 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {3937#(<= ~counter~0 3)} {3937#(<= ~counter~0 3)} #98#return; {3937#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:32,697 INFO L290 TraceCheckUtils]: 40: Hoare triple {3937#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {3937#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:32,697 INFO L290 TraceCheckUtils]: 41: Hoare triple {3937#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {3962#(<= |main_#t~post8| 3)} is VALID [2022-04-28 05:57:32,697 INFO L290 TraceCheckUtils]: 42: Hoare triple {3962#(<= |main_#t~post8| 3)} assume !(#t~post8 < 20);havoc #t~post8; {3831#false} is VALID [2022-04-28 05:57:32,697 INFO L290 TraceCheckUtils]: 43: Hoare triple {3831#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3831#false} is VALID [2022-04-28 05:57:32,698 INFO L290 TraceCheckUtils]: 44: Hoare triple {3831#false} assume !(#t~post6 < 20);havoc #t~post6; {3831#false} is VALID [2022-04-28 05:57:32,698 INFO L272 TraceCheckUtils]: 45: Hoare triple {3831#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {3831#false} is VALID [2022-04-28 05:57:32,698 INFO L290 TraceCheckUtils]: 46: Hoare triple {3831#false} ~cond := #in~cond; {3831#false} is VALID [2022-04-28 05:57:32,698 INFO L290 TraceCheckUtils]: 47: Hoare triple {3831#false} assume 0 == ~cond; {3831#false} is VALID [2022-04-28 05:57:32,698 INFO L290 TraceCheckUtils]: 48: Hoare triple {3831#false} assume !false; {3831#false} is VALID [2022-04-28 05:57:32,698 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 05:57:32,698 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:57:32,981 INFO L290 TraceCheckUtils]: 48: Hoare triple {3831#false} assume !false; {3831#false} is VALID [2022-04-28 05:57:32,982 INFO L290 TraceCheckUtils]: 47: Hoare triple {3831#false} assume 0 == ~cond; {3831#false} is VALID [2022-04-28 05:57:32,982 INFO L290 TraceCheckUtils]: 46: Hoare triple {3831#false} ~cond := #in~cond; {3831#false} is VALID [2022-04-28 05:57:32,982 INFO L272 TraceCheckUtils]: 45: Hoare triple {3831#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {3831#false} is VALID [2022-04-28 05:57:32,982 INFO L290 TraceCheckUtils]: 44: Hoare triple {3831#false} assume !(#t~post6 < 20);havoc #t~post6; {3831#false} is VALID [2022-04-28 05:57:32,982 INFO L290 TraceCheckUtils]: 43: Hoare triple {3831#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3831#false} is VALID [2022-04-28 05:57:32,987 INFO L290 TraceCheckUtils]: 42: Hoare triple {4002#(< |main_#t~post8| 20)} assume !(#t~post8 < 20);havoc #t~post8; {3831#false} is VALID [2022-04-28 05:57:32,988 INFO L290 TraceCheckUtils]: 41: Hoare triple {4006#(< ~counter~0 20)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {4002#(< |main_#t~post8| 20)} is VALID [2022-04-28 05:57:32,988 INFO L290 TraceCheckUtils]: 40: Hoare triple {4006#(< ~counter~0 20)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {4006#(< ~counter~0 20)} is VALID [2022-04-28 05:57:32,989 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {3830#true} {4006#(< ~counter~0 20)} #98#return; {4006#(< ~counter~0 20)} is VALID [2022-04-28 05:57:32,989 INFO L290 TraceCheckUtils]: 38: Hoare triple {3830#true} assume true; {3830#true} is VALID [2022-04-28 05:57:32,990 INFO L290 TraceCheckUtils]: 37: Hoare triple {3830#true} assume !(0 == ~cond); {3830#true} is VALID [2022-04-28 05:57:32,990 INFO L290 TraceCheckUtils]: 36: Hoare triple {3830#true} ~cond := #in~cond; {3830#true} is VALID [2022-04-28 05:57:32,990 INFO L272 TraceCheckUtils]: 35: Hoare triple {4006#(< ~counter~0 20)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {3830#true} is VALID [2022-04-28 05:57:32,990 INFO L290 TraceCheckUtils]: 34: Hoare triple {4006#(< ~counter~0 20)} assume !!(#t~post8 < 20);havoc #t~post8; {4006#(< ~counter~0 20)} is VALID [2022-04-28 05:57:32,990 INFO L290 TraceCheckUtils]: 33: Hoare triple {4031#(< ~counter~0 19)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {4006#(< ~counter~0 20)} is VALID [2022-04-28 05:57:32,991 INFO L290 TraceCheckUtils]: 32: Hoare triple {4031#(< ~counter~0 19)} assume !(~r~0 > 0); {4031#(< ~counter~0 19)} is VALID [2022-04-28 05:57:32,991 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3830#true} {4031#(< ~counter~0 19)} #96#return; {4031#(< ~counter~0 19)} is VALID [2022-04-28 05:57:32,991 INFO L290 TraceCheckUtils]: 30: Hoare triple {3830#true} assume true; {3830#true} is VALID [2022-04-28 05:57:32,991 INFO L290 TraceCheckUtils]: 29: Hoare triple {3830#true} assume !(0 == ~cond); {3830#true} is VALID [2022-04-28 05:57:32,991 INFO L290 TraceCheckUtils]: 28: Hoare triple {3830#true} ~cond := #in~cond; {3830#true} is VALID [2022-04-28 05:57:32,992 INFO L272 TraceCheckUtils]: 27: Hoare triple {4031#(< ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {3830#true} is VALID [2022-04-28 05:57:32,995 INFO L290 TraceCheckUtils]: 26: Hoare triple {4031#(< ~counter~0 19)} assume !!(#t~post7 < 20);havoc #t~post7; {4031#(< ~counter~0 19)} is VALID [2022-04-28 05:57:32,996 INFO L290 TraceCheckUtils]: 25: Hoare triple {4056#(< ~counter~0 18)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4031#(< ~counter~0 19)} is VALID [2022-04-28 05:57:32,996 INFO L290 TraceCheckUtils]: 24: Hoare triple {4056#(< ~counter~0 18)} assume !!(0 != ~r~0); {4056#(< ~counter~0 18)} is VALID [2022-04-28 05:57:32,997 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3830#true} {4056#(< ~counter~0 18)} #94#return; {4056#(< ~counter~0 18)} is VALID [2022-04-28 05:57:32,997 INFO L290 TraceCheckUtils]: 22: Hoare triple {3830#true} assume true; {3830#true} is VALID [2022-04-28 05:57:32,997 INFO L290 TraceCheckUtils]: 21: Hoare triple {3830#true} assume !(0 == ~cond); {3830#true} is VALID [2022-04-28 05:57:32,997 INFO L290 TraceCheckUtils]: 20: Hoare triple {3830#true} ~cond := #in~cond; {3830#true} is VALID [2022-04-28 05:57:32,997 INFO L272 TraceCheckUtils]: 19: Hoare triple {4056#(< ~counter~0 18)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {3830#true} is VALID [2022-04-28 05:57:32,997 INFO L290 TraceCheckUtils]: 18: Hoare triple {4056#(< ~counter~0 18)} assume !!(#t~post6 < 20);havoc #t~post6; {4056#(< ~counter~0 18)} is VALID [2022-04-28 05:57:32,998 INFO L290 TraceCheckUtils]: 17: Hoare triple {4081#(< ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4056#(< ~counter~0 18)} is VALID [2022-04-28 05:57:32,998 INFO L290 TraceCheckUtils]: 16: Hoare triple {4081#(< ~counter~0 17)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {4081#(< ~counter~0 17)} is VALID [2022-04-28 05:57:32,999 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3830#true} {4081#(< ~counter~0 17)} #92#return; {4081#(< ~counter~0 17)} is VALID [2022-04-28 05:57:32,999 INFO L290 TraceCheckUtils]: 14: Hoare triple {3830#true} assume true; {3830#true} is VALID [2022-04-28 05:57:32,999 INFO L290 TraceCheckUtils]: 13: Hoare triple {3830#true} assume !(0 == ~cond); {3830#true} is VALID [2022-04-28 05:57:32,999 INFO L290 TraceCheckUtils]: 12: Hoare triple {3830#true} ~cond := #in~cond; {3830#true} is VALID [2022-04-28 05:57:32,999 INFO L272 TraceCheckUtils]: 11: Hoare triple {4081#(< ~counter~0 17)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {3830#true} is VALID [2022-04-28 05:57:33,000 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3830#true} {4081#(< ~counter~0 17)} #90#return; {4081#(< ~counter~0 17)} is VALID [2022-04-28 05:57:33,000 INFO L290 TraceCheckUtils]: 9: Hoare triple {3830#true} assume true; {3830#true} is VALID [2022-04-28 05:57:33,000 INFO L290 TraceCheckUtils]: 8: Hoare triple {3830#true} assume !(0 == ~cond); {3830#true} is VALID [2022-04-28 05:57:33,000 INFO L290 TraceCheckUtils]: 7: Hoare triple {3830#true} ~cond := #in~cond; {3830#true} is VALID [2022-04-28 05:57:33,000 INFO L272 TraceCheckUtils]: 6: Hoare triple {4081#(< ~counter~0 17)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {3830#true} is VALID [2022-04-28 05:57:33,001 INFO L290 TraceCheckUtils]: 5: Hoare triple {4081#(< ~counter~0 17)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {4081#(< ~counter~0 17)} is VALID [2022-04-28 05:57:33,001 INFO L272 TraceCheckUtils]: 4: Hoare triple {4081#(< ~counter~0 17)} call #t~ret9 := main(); {4081#(< ~counter~0 17)} is VALID [2022-04-28 05:57:33,002 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4081#(< ~counter~0 17)} {3830#true} #102#return; {4081#(< ~counter~0 17)} is VALID [2022-04-28 05:57:33,002 INFO L290 TraceCheckUtils]: 2: Hoare triple {4081#(< ~counter~0 17)} assume true; {4081#(< ~counter~0 17)} is VALID [2022-04-28 05:57:33,003 INFO L290 TraceCheckUtils]: 1: Hoare triple {3830#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4081#(< ~counter~0 17)} is VALID [2022-04-28 05:57:33,003 INFO L272 TraceCheckUtils]: 0: Hoare triple {3830#true} call ULTIMATE.init(); {3830#true} is VALID [2022-04-28 05:57:33,003 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-28 05:57:33,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:57:33,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882097356] [2022-04-28 05:57:33,003 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:57:33,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1284288517] [2022-04-28 05:57:33,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1284288517] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:57:33,003 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:57:33,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-28 05:57:33,004 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:57:33,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1143723099] [2022-04-28 05:57:33,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1143723099] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:57:33,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:57:33,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 05:57:33,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390849508] [2022-04-28 05:57:33,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:57:33,005 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 49 [2022-04-28 05:57:33,005 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:57:33,005 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 05:57:33,045 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:57:33,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 05:57:33,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:57:33,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 05:57:33,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-28 05:57:33,047 INFO L87 Difference]: Start difference. First operand 70 states and 87 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 05:57:33,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:33,307 INFO L93 Difference]: Finished difference Result 118 states and 153 transitions. [2022-04-28 05:57:33,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 05:57:33,307 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 49 [2022-04-28 05:57:33,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:57:33,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 05:57:33,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2022-04-28 05:57:33,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 05:57:33,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2022-04-28 05:57:33,312 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 101 transitions. [2022-04-28 05:57:33,397 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:57:33,399 INFO L225 Difference]: With dead ends: 118 [2022-04-28 05:57:33,399 INFO L226 Difference]: Without dead ends: 81 [2022-04-28 05:57:33,399 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2022-04-28 05:57:33,400 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 19 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 05:57:33,400 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 135 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 05:57:33,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-04-28 05:57:33,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2022-04-28 05:57:33,476 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:57:33,476 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand has 80 states, 57 states have (on average 1.2105263157894737) internal successors, (69), 57 states have internal predecessors, (69), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 05:57:33,477 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand has 80 states, 57 states have (on average 1.2105263157894737) internal successors, (69), 57 states have internal predecessors, (69), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 05:57:33,477 INFO L87 Difference]: Start difference. First operand 81 states. Second operand has 80 states, 57 states have (on average 1.2105263157894737) internal successors, (69), 57 states have internal predecessors, (69), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 05:57:33,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:33,481 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2022-04-28 05:57:33,481 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 100 transitions. [2022-04-28 05:57:33,482 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:57:33,482 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:57:33,482 INFO L74 IsIncluded]: Start isIncluded. First operand has 80 states, 57 states have (on average 1.2105263157894737) internal successors, (69), 57 states have internal predecessors, (69), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 81 states. [2022-04-28 05:57:33,482 INFO L87 Difference]: Start difference. First operand has 80 states, 57 states have (on average 1.2105263157894737) internal successors, (69), 57 states have internal predecessors, (69), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 81 states. [2022-04-28 05:57:33,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:33,485 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2022-04-28 05:57:33,485 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 100 transitions. [2022-04-28 05:57:33,485 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:57:33,485 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:57:33,485 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:57:33,485 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:57:33,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 57 states have (on average 1.2105263157894737) internal successors, (69), 57 states have internal predecessors, (69), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 05:57:33,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 99 transitions. [2022-04-28 05:57:33,489 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 99 transitions. Word has length 49 [2022-04-28 05:57:33,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:57:33,490 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 99 transitions. [2022-04-28 05:57:33,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 05:57:33,490 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 80 states and 99 transitions. [2022-04-28 05:57:35,608 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 98 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 05:57:35,609 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 99 transitions. [2022-04-28 05:57:35,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-28 05:57:35,609 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:57:35,609 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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-04-28 05:57:35,625 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-28 05:57:35,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:57:35,810 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:57:35,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:57:35,810 INFO L85 PathProgramCache]: Analyzing trace with hash -60460648, now seen corresponding path program 3 times [2022-04-28 05:57:35,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:57:35,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1417582283] [2022-04-28 05:57:35,810 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:57:35,810 INFO L85 PathProgramCache]: Analyzing trace with hash -60460648, now seen corresponding path program 4 times [2022-04-28 05:57:35,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:57:35,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543722717] [2022-04-28 05:57:35,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:57:35,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:57:35,831 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:57:35,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2378575] [2022-04-28 05:57:35,831 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 05:57:35,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:57:35,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:57:35,833 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:57:35,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-28 05:57:35,911 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 05:57:35,911 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:57:35,912 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 05:57:35,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:57:35,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:57:36,188 INFO L272 TraceCheckUtils]: 0: Hoare triple {4695#true} call ULTIMATE.init(); {4695#true} is VALID [2022-04-28 05:57:36,189 INFO L290 TraceCheckUtils]: 1: Hoare triple {4695#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4703#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:36,189 INFO L290 TraceCheckUtils]: 2: Hoare triple {4703#(<= ~counter~0 0)} assume true; {4703#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:36,189 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4703#(<= ~counter~0 0)} {4695#true} #102#return; {4703#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:36,190 INFO L272 TraceCheckUtils]: 4: Hoare triple {4703#(<= ~counter~0 0)} call #t~ret9 := main(); {4703#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:36,190 INFO L290 TraceCheckUtils]: 5: Hoare triple {4703#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {4703#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:36,190 INFO L272 TraceCheckUtils]: 6: Hoare triple {4703#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {4703#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:36,191 INFO L290 TraceCheckUtils]: 7: Hoare triple {4703#(<= ~counter~0 0)} ~cond := #in~cond; {4703#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:36,191 INFO L290 TraceCheckUtils]: 8: Hoare triple {4703#(<= ~counter~0 0)} assume !(0 == ~cond); {4703#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:36,191 INFO L290 TraceCheckUtils]: 9: Hoare triple {4703#(<= ~counter~0 0)} assume true; {4703#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:36,192 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4703#(<= ~counter~0 0)} {4703#(<= ~counter~0 0)} #90#return; {4703#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:36,192 INFO L272 TraceCheckUtils]: 11: Hoare triple {4703#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {4703#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:36,192 INFO L290 TraceCheckUtils]: 12: Hoare triple {4703#(<= ~counter~0 0)} ~cond := #in~cond; {4703#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:36,192 INFO L290 TraceCheckUtils]: 13: Hoare triple {4703#(<= ~counter~0 0)} assume !(0 == ~cond); {4703#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:36,193 INFO L290 TraceCheckUtils]: 14: Hoare triple {4703#(<= ~counter~0 0)} assume true; {4703#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:36,193 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4703#(<= ~counter~0 0)} {4703#(<= ~counter~0 0)} #92#return; {4703#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:36,193 INFO L290 TraceCheckUtils]: 16: Hoare triple {4703#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {4703#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:36,194 INFO L290 TraceCheckUtils]: 17: Hoare triple {4703#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4752#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:36,194 INFO L290 TraceCheckUtils]: 18: Hoare triple {4752#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {4752#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:36,195 INFO L272 TraceCheckUtils]: 19: Hoare triple {4752#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4752#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:36,195 INFO L290 TraceCheckUtils]: 20: Hoare triple {4752#(<= ~counter~0 1)} ~cond := #in~cond; {4752#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:36,195 INFO L290 TraceCheckUtils]: 21: Hoare triple {4752#(<= ~counter~0 1)} assume !(0 == ~cond); {4752#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:36,196 INFO L290 TraceCheckUtils]: 22: Hoare triple {4752#(<= ~counter~0 1)} assume true; {4752#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:36,196 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4752#(<= ~counter~0 1)} {4752#(<= ~counter~0 1)} #94#return; {4752#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:36,197 INFO L290 TraceCheckUtils]: 24: Hoare triple {4752#(<= ~counter~0 1)} assume !!(0 != ~r~0); {4752#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:36,197 INFO L290 TraceCheckUtils]: 25: Hoare triple {4752#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4777#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:36,198 INFO L290 TraceCheckUtils]: 26: Hoare triple {4777#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {4777#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:36,198 INFO L272 TraceCheckUtils]: 27: Hoare triple {4777#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4777#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:36,199 INFO L290 TraceCheckUtils]: 28: Hoare triple {4777#(<= ~counter~0 2)} ~cond := #in~cond; {4777#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:36,199 INFO L290 TraceCheckUtils]: 29: Hoare triple {4777#(<= ~counter~0 2)} assume !(0 == ~cond); {4777#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:36,199 INFO L290 TraceCheckUtils]: 30: Hoare triple {4777#(<= ~counter~0 2)} assume true; {4777#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:36,200 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {4777#(<= ~counter~0 2)} {4777#(<= ~counter~0 2)} #96#return; {4777#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:36,200 INFO L290 TraceCheckUtils]: 32: Hoare triple {4777#(<= ~counter~0 2)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4777#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:36,201 INFO L290 TraceCheckUtils]: 33: Hoare triple {4777#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4802#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:36,201 INFO L290 TraceCheckUtils]: 34: Hoare triple {4802#(<= ~counter~0 3)} assume !!(#t~post7 < 20);havoc #t~post7; {4802#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:36,202 INFO L272 TraceCheckUtils]: 35: Hoare triple {4802#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4802#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:36,202 INFO L290 TraceCheckUtils]: 36: Hoare triple {4802#(<= ~counter~0 3)} ~cond := #in~cond; {4802#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:36,202 INFO L290 TraceCheckUtils]: 37: Hoare triple {4802#(<= ~counter~0 3)} assume !(0 == ~cond); {4802#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:36,203 INFO L290 TraceCheckUtils]: 38: Hoare triple {4802#(<= ~counter~0 3)} assume true; {4802#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:36,203 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {4802#(<= ~counter~0 3)} {4802#(<= ~counter~0 3)} #96#return; {4802#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:36,203 INFO L290 TraceCheckUtils]: 40: Hoare triple {4802#(<= ~counter~0 3)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4802#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:36,204 INFO L290 TraceCheckUtils]: 41: Hoare triple {4802#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4827#(<= |main_#t~post7| 3)} is VALID [2022-04-28 05:57:36,204 INFO L290 TraceCheckUtils]: 42: Hoare triple {4827#(<= |main_#t~post7| 3)} assume !(#t~post7 < 20);havoc #t~post7; {4696#false} is VALID [2022-04-28 05:57:36,204 INFO L290 TraceCheckUtils]: 43: Hoare triple {4696#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {4696#false} is VALID [2022-04-28 05:57:36,204 INFO L290 TraceCheckUtils]: 44: Hoare triple {4696#false} assume !(#t~post8 < 20);havoc #t~post8; {4696#false} is VALID [2022-04-28 05:57:36,204 INFO L290 TraceCheckUtils]: 45: Hoare triple {4696#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4696#false} is VALID [2022-04-28 05:57:36,204 INFO L290 TraceCheckUtils]: 46: Hoare triple {4696#false} assume !(#t~post6 < 20);havoc #t~post6; {4696#false} is VALID [2022-04-28 05:57:36,204 INFO L272 TraceCheckUtils]: 47: Hoare triple {4696#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4696#false} is VALID [2022-04-28 05:57:36,205 INFO L290 TraceCheckUtils]: 48: Hoare triple {4696#false} ~cond := #in~cond; {4696#false} is VALID [2022-04-28 05:57:36,205 INFO L290 TraceCheckUtils]: 49: Hoare triple {4696#false} assume 0 == ~cond; {4696#false} is VALID [2022-04-28 05:57:36,205 INFO L290 TraceCheckUtils]: 50: Hoare triple {4696#false} assume !false; {4696#false} is VALID [2022-04-28 05:57:36,205 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 8 proven. 20 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 05:57:36,205 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:57:36,492 INFO L290 TraceCheckUtils]: 50: Hoare triple {4696#false} assume !false; {4696#false} is VALID [2022-04-28 05:57:36,492 INFO L290 TraceCheckUtils]: 49: Hoare triple {4696#false} assume 0 == ~cond; {4696#false} is VALID [2022-04-28 05:57:36,493 INFO L290 TraceCheckUtils]: 48: Hoare triple {4696#false} ~cond := #in~cond; {4696#false} is VALID [2022-04-28 05:57:36,493 INFO L272 TraceCheckUtils]: 47: Hoare triple {4696#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4696#false} is VALID [2022-04-28 05:57:36,493 INFO L290 TraceCheckUtils]: 46: Hoare triple {4696#false} assume !(#t~post6 < 20);havoc #t~post6; {4696#false} is VALID [2022-04-28 05:57:36,493 INFO L290 TraceCheckUtils]: 45: Hoare triple {4696#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4696#false} is VALID [2022-04-28 05:57:36,493 INFO L290 TraceCheckUtils]: 44: Hoare triple {4696#false} assume !(#t~post8 < 20);havoc #t~post8; {4696#false} is VALID [2022-04-28 05:57:36,493 INFO L290 TraceCheckUtils]: 43: Hoare triple {4696#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {4696#false} is VALID [2022-04-28 05:57:36,493 INFO L290 TraceCheckUtils]: 42: Hoare triple {4879#(< |main_#t~post7| 20)} assume !(#t~post7 < 20);havoc #t~post7; {4696#false} is VALID [2022-04-28 05:57:36,494 INFO L290 TraceCheckUtils]: 41: Hoare triple {4883#(< ~counter~0 20)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4879#(< |main_#t~post7| 20)} is VALID [2022-04-28 05:57:36,494 INFO L290 TraceCheckUtils]: 40: Hoare triple {4883#(< ~counter~0 20)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4883#(< ~counter~0 20)} is VALID [2022-04-28 05:57:36,495 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {4695#true} {4883#(< ~counter~0 20)} #96#return; {4883#(< ~counter~0 20)} is VALID [2022-04-28 05:57:36,495 INFO L290 TraceCheckUtils]: 38: Hoare triple {4695#true} assume true; {4695#true} is VALID [2022-04-28 05:57:36,495 INFO L290 TraceCheckUtils]: 37: Hoare triple {4695#true} assume !(0 == ~cond); {4695#true} is VALID [2022-04-28 05:57:36,495 INFO L290 TraceCheckUtils]: 36: Hoare triple {4695#true} ~cond := #in~cond; {4695#true} is VALID [2022-04-28 05:57:36,495 INFO L272 TraceCheckUtils]: 35: Hoare triple {4883#(< ~counter~0 20)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4695#true} is VALID [2022-04-28 05:57:36,496 INFO L290 TraceCheckUtils]: 34: Hoare triple {4883#(< ~counter~0 20)} assume !!(#t~post7 < 20);havoc #t~post7; {4883#(< ~counter~0 20)} is VALID [2022-04-28 05:57:36,496 INFO L290 TraceCheckUtils]: 33: Hoare triple {4908#(< ~counter~0 19)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4883#(< ~counter~0 20)} is VALID [2022-04-28 05:57:36,497 INFO L290 TraceCheckUtils]: 32: Hoare triple {4908#(< ~counter~0 19)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4908#(< ~counter~0 19)} is VALID [2022-04-28 05:57:36,497 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {4695#true} {4908#(< ~counter~0 19)} #96#return; {4908#(< ~counter~0 19)} is VALID [2022-04-28 05:57:36,497 INFO L290 TraceCheckUtils]: 30: Hoare triple {4695#true} assume true; {4695#true} is VALID [2022-04-28 05:57:36,498 INFO L290 TraceCheckUtils]: 29: Hoare triple {4695#true} assume !(0 == ~cond); {4695#true} is VALID [2022-04-28 05:57:36,498 INFO L290 TraceCheckUtils]: 28: Hoare triple {4695#true} ~cond := #in~cond; {4695#true} is VALID [2022-04-28 05:57:36,498 INFO L272 TraceCheckUtils]: 27: Hoare triple {4908#(< ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4695#true} is VALID [2022-04-28 05:57:36,498 INFO L290 TraceCheckUtils]: 26: Hoare triple {4908#(< ~counter~0 19)} assume !!(#t~post7 < 20);havoc #t~post7; {4908#(< ~counter~0 19)} is VALID [2022-04-28 05:57:36,499 INFO L290 TraceCheckUtils]: 25: Hoare triple {4933#(< ~counter~0 18)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4908#(< ~counter~0 19)} is VALID [2022-04-28 05:57:36,499 INFO L290 TraceCheckUtils]: 24: Hoare triple {4933#(< ~counter~0 18)} assume !!(0 != ~r~0); {4933#(< ~counter~0 18)} is VALID [2022-04-28 05:57:36,500 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4695#true} {4933#(< ~counter~0 18)} #94#return; {4933#(< ~counter~0 18)} is VALID [2022-04-28 05:57:36,500 INFO L290 TraceCheckUtils]: 22: Hoare triple {4695#true} assume true; {4695#true} is VALID [2022-04-28 05:57:36,500 INFO L290 TraceCheckUtils]: 21: Hoare triple {4695#true} assume !(0 == ~cond); {4695#true} is VALID [2022-04-28 05:57:36,500 INFO L290 TraceCheckUtils]: 20: Hoare triple {4695#true} ~cond := #in~cond; {4695#true} is VALID [2022-04-28 05:57:36,500 INFO L272 TraceCheckUtils]: 19: Hoare triple {4933#(< ~counter~0 18)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4695#true} is VALID [2022-04-28 05:57:36,501 INFO L290 TraceCheckUtils]: 18: Hoare triple {4933#(< ~counter~0 18)} assume !!(#t~post6 < 20);havoc #t~post6; {4933#(< ~counter~0 18)} is VALID [2022-04-28 05:57:36,501 INFO L290 TraceCheckUtils]: 17: Hoare triple {4958#(< ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4933#(< ~counter~0 18)} is VALID [2022-04-28 05:57:36,502 INFO L290 TraceCheckUtils]: 16: Hoare triple {4958#(< ~counter~0 17)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {4958#(< ~counter~0 17)} is VALID [2022-04-28 05:57:36,502 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4695#true} {4958#(< ~counter~0 17)} #92#return; {4958#(< ~counter~0 17)} is VALID [2022-04-28 05:57:36,502 INFO L290 TraceCheckUtils]: 14: Hoare triple {4695#true} assume true; {4695#true} is VALID [2022-04-28 05:57:36,502 INFO L290 TraceCheckUtils]: 13: Hoare triple {4695#true} assume !(0 == ~cond); {4695#true} is VALID [2022-04-28 05:57:36,503 INFO L290 TraceCheckUtils]: 12: Hoare triple {4695#true} ~cond := #in~cond; {4695#true} is VALID [2022-04-28 05:57:36,503 INFO L272 TraceCheckUtils]: 11: Hoare triple {4958#(< ~counter~0 17)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {4695#true} is VALID [2022-04-28 05:57:36,503 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4695#true} {4958#(< ~counter~0 17)} #90#return; {4958#(< ~counter~0 17)} is VALID [2022-04-28 05:57:36,503 INFO L290 TraceCheckUtils]: 9: Hoare triple {4695#true} assume true; {4695#true} is VALID [2022-04-28 05:57:36,503 INFO L290 TraceCheckUtils]: 8: Hoare triple {4695#true} assume !(0 == ~cond); {4695#true} is VALID [2022-04-28 05:57:36,504 INFO L290 TraceCheckUtils]: 7: Hoare triple {4695#true} ~cond := #in~cond; {4695#true} is VALID [2022-04-28 05:57:36,504 INFO L272 TraceCheckUtils]: 6: Hoare triple {4958#(< ~counter~0 17)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {4695#true} is VALID [2022-04-28 05:57:36,504 INFO L290 TraceCheckUtils]: 5: Hoare triple {4958#(< ~counter~0 17)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {4958#(< ~counter~0 17)} is VALID [2022-04-28 05:57:36,504 INFO L272 TraceCheckUtils]: 4: Hoare triple {4958#(< ~counter~0 17)} call #t~ret9 := main(); {4958#(< ~counter~0 17)} is VALID [2022-04-28 05:57:36,505 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4958#(< ~counter~0 17)} {4695#true} #102#return; {4958#(< ~counter~0 17)} is VALID [2022-04-28 05:57:36,505 INFO L290 TraceCheckUtils]: 2: Hoare triple {4958#(< ~counter~0 17)} assume true; {4958#(< ~counter~0 17)} is VALID [2022-04-28 05:57:36,506 INFO L290 TraceCheckUtils]: 1: Hoare triple {4695#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4958#(< ~counter~0 17)} is VALID [2022-04-28 05:57:36,506 INFO L272 TraceCheckUtils]: 0: Hoare triple {4695#true} call ULTIMATE.init(); {4695#true} is VALID [2022-04-28 05:57:36,506 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-28 05:57:36,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:57:36,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543722717] [2022-04-28 05:57:36,507 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:57:36,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2378575] [2022-04-28 05:57:36,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2378575] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:57:36,508 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:57:36,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-28 05:57:36,508 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:57:36,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1417582283] [2022-04-28 05:57:36,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1417582283] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:57:36,508 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:57:36,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 05:57:36,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120157155] [2022-04-28 05:57:36,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:57:36,509 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 51 [2022-04-28 05:57:36,509 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:57:36,509 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 05:57:36,555 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:57:36,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 05:57:36,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:57:36,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 05:57:36,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-28 05:57:36,555 INFO L87 Difference]: Start difference. First operand 80 states and 99 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 05:57:36,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:36,805 INFO L93 Difference]: Finished difference Result 119 states and 154 transitions. [2022-04-28 05:57:36,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 05:57:36,805 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 51 [2022-04-28 05:57:36,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:57:36,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 05:57:36,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 101 transitions. [2022-04-28 05:57:36,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 05:57:36,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 101 transitions. [2022-04-28 05:57:36,809 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 101 transitions. [2022-04-28 05:57:36,889 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:57:36,891 INFO L225 Difference]: With dead ends: 119 [2022-04-28 05:57:36,891 INFO L226 Difference]: Without dead ends: 82 [2022-04-28 05:57:36,892 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2022-04-28 05:57:36,892 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 17 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 05:57:36,892 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 135 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 05:57:36,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-04-28 05:57:36,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2022-04-28 05:57:36,970 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:57:36,970 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand has 82 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 59 states have internal predecessors, (71), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 05:57:36,970 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand has 82 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 59 states have internal predecessors, (71), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 05:57:36,971 INFO L87 Difference]: Start difference. First operand 82 states. Second operand has 82 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 59 states have internal predecessors, (71), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 05:57:36,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:36,973 INFO L93 Difference]: Finished difference Result 82 states and 101 transitions. [2022-04-28 05:57:36,973 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 101 transitions. [2022-04-28 05:57:36,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:57:36,974 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:57:36,974 INFO L74 IsIncluded]: Start isIncluded. First operand has 82 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 59 states have internal predecessors, (71), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 82 states. [2022-04-28 05:57:36,974 INFO L87 Difference]: Start difference. First operand has 82 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 59 states have internal predecessors, (71), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 82 states. [2022-04-28 05:57:36,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:36,977 INFO L93 Difference]: Finished difference Result 82 states and 101 transitions. [2022-04-28 05:57:36,977 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 101 transitions. [2022-04-28 05:57:36,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:57:36,977 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:57:36,977 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:57:36,977 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:57:36,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 59 states have internal predecessors, (71), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 05:57:36,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 101 transitions. [2022-04-28 05:57:36,980 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 101 transitions. Word has length 51 [2022-04-28 05:57:36,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:57:36,980 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 101 transitions. [2022-04-28 05:57:36,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 05:57:36,981 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 82 states and 101 transitions. [2022-04-28 05:57:37,422 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:57:37,422 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 101 transitions. [2022-04-28 05:57:37,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-28 05:57:37,423 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:57:37,423 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:57:37,439 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-04-28 05:57:37,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-28 05:57:37,627 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:57:37,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:57:37,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1067781299, now seen corresponding path program 1 times [2022-04-28 05:57:37,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:57:37,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1109288115] [2022-04-28 05:57:37,628 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:57:37,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1067781299, now seen corresponding path program 2 times [2022-04-28 05:57:37,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:57:37,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929959730] [2022-04-28 05:57:37,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:57:37,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:57:37,638 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:57:37,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [414474830] [2022-04-28 05:57:37,638 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:57:37,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:57:37,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:57:37,639 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:57:37,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-28 05:57:37,689 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:57:37,689 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:57:37,690 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 05:57:37,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:57:37,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:57:37,968 INFO L272 TraceCheckUtils]: 0: Hoare triple {5582#true} call ULTIMATE.init(); {5582#true} is VALID [2022-04-28 05:57:37,969 INFO L290 TraceCheckUtils]: 1: Hoare triple {5582#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5590#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:37,969 INFO L290 TraceCheckUtils]: 2: Hoare triple {5590#(<= ~counter~0 0)} assume true; {5590#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:37,969 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5590#(<= ~counter~0 0)} {5582#true} #102#return; {5590#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:37,970 INFO L272 TraceCheckUtils]: 4: Hoare triple {5590#(<= ~counter~0 0)} call #t~ret9 := main(); {5590#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:37,970 INFO L290 TraceCheckUtils]: 5: Hoare triple {5590#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {5590#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:37,971 INFO L272 TraceCheckUtils]: 6: Hoare triple {5590#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {5590#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:37,971 INFO L290 TraceCheckUtils]: 7: Hoare triple {5590#(<= ~counter~0 0)} ~cond := #in~cond; {5590#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:37,971 INFO L290 TraceCheckUtils]: 8: Hoare triple {5590#(<= ~counter~0 0)} assume !(0 == ~cond); {5590#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:37,972 INFO L290 TraceCheckUtils]: 9: Hoare triple {5590#(<= ~counter~0 0)} assume true; {5590#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:37,972 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5590#(<= ~counter~0 0)} {5590#(<= ~counter~0 0)} #90#return; {5590#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:37,973 INFO L272 TraceCheckUtils]: 11: Hoare triple {5590#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {5590#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:37,973 INFO L290 TraceCheckUtils]: 12: Hoare triple {5590#(<= ~counter~0 0)} ~cond := #in~cond; {5590#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:37,973 INFO L290 TraceCheckUtils]: 13: Hoare triple {5590#(<= ~counter~0 0)} assume !(0 == ~cond); {5590#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:37,974 INFO L290 TraceCheckUtils]: 14: Hoare triple {5590#(<= ~counter~0 0)} assume true; {5590#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:37,974 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {5590#(<= ~counter~0 0)} {5590#(<= ~counter~0 0)} #92#return; {5590#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:37,975 INFO L290 TraceCheckUtils]: 16: Hoare triple {5590#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {5590#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:37,976 INFO L290 TraceCheckUtils]: 17: Hoare triple {5590#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5639#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:37,976 INFO L290 TraceCheckUtils]: 18: Hoare triple {5639#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {5639#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:37,977 INFO L272 TraceCheckUtils]: 19: Hoare triple {5639#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {5639#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:37,977 INFO L290 TraceCheckUtils]: 20: Hoare triple {5639#(<= ~counter~0 1)} ~cond := #in~cond; {5639#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:37,977 INFO L290 TraceCheckUtils]: 21: Hoare triple {5639#(<= ~counter~0 1)} assume !(0 == ~cond); {5639#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:37,978 INFO L290 TraceCheckUtils]: 22: Hoare triple {5639#(<= ~counter~0 1)} assume true; {5639#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:37,979 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {5639#(<= ~counter~0 1)} {5639#(<= ~counter~0 1)} #94#return; {5639#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:37,979 INFO L290 TraceCheckUtils]: 24: Hoare triple {5639#(<= ~counter~0 1)} assume !!(0 != ~r~0); {5639#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:37,980 INFO L290 TraceCheckUtils]: 25: Hoare triple {5639#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {5664#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:37,980 INFO L290 TraceCheckUtils]: 26: Hoare triple {5664#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {5664#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:37,981 INFO L272 TraceCheckUtils]: 27: Hoare triple {5664#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {5664#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:37,981 INFO L290 TraceCheckUtils]: 28: Hoare triple {5664#(<= ~counter~0 2)} ~cond := #in~cond; {5664#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:37,981 INFO L290 TraceCheckUtils]: 29: Hoare triple {5664#(<= ~counter~0 2)} assume !(0 == ~cond); {5664#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:37,982 INFO L290 TraceCheckUtils]: 30: Hoare triple {5664#(<= ~counter~0 2)} assume true; {5664#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:37,983 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {5664#(<= ~counter~0 2)} {5664#(<= ~counter~0 2)} #96#return; {5664#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:37,983 INFO L290 TraceCheckUtils]: 32: Hoare triple {5664#(<= ~counter~0 2)} assume !(~r~0 > 0); {5664#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:37,984 INFO L290 TraceCheckUtils]: 33: Hoare triple {5664#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {5689#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:37,984 INFO L290 TraceCheckUtils]: 34: Hoare triple {5689#(<= ~counter~0 3)} assume !!(#t~post8 < 20);havoc #t~post8; {5689#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:37,985 INFO L272 TraceCheckUtils]: 35: Hoare triple {5689#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {5689#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:37,985 INFO L290 TraceCheckUtils]: 36: Hoare triple {5689#(<= ~counter~0 3)} ~cond := #in~cond; {5689#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:37,985 INFO L290 TraceCheckUtils]: 37: Hoare triple {5689#(<= ~counter~0 3)} assume !(0 == ~cond); {5689#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:37,986 INFO L290 TraceCheckUtils]: 38: Hoare triple {5689#(<= ~counter~0 3)} assume true; {5689#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:37,987 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {5689#(<= ~counter~0 3)} {5689#(<= ~counter~0 3)} #98#return; {5689#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:37,987 INFO L290 TraceCheckUtils]: 40: Hoare triple {5689#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {5689#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:37,988 INFO L290 TraceCheckUtils]: 41: Hoare triple {5689#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {5714#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:37,988 INFO L290 TraceCheckUtils]: 42: Hoare triple {5714#(<= ~counter~0 4)} assume !!(#t~post8 < 20);havoc #t~post8; {5714#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:37,989 INFO L272 TraceCheckUtils]: 43: Hoare triple {5714#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {5714#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:37,989 INFO L290 TraceCheckUtils]: 44: Hoare triple {5714#(<= ~counter~0 4)} ~cond := #in~cond; {5714#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:37,989 INFO L290 TraceCheckUtils]: 45: Hoare triple {5714#(<= ~counter~0 4)} assume !(0 == ~cond); {5714#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:37,990 INFO L290 TraceCheckUtils]: 46: Hoare triple {5714#(<= ~counter~0 4)} assume true; {5714#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:37,991 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {5714#(<= ~counter~0 4)} {5714#(<= ~counter~0 4)} #98#return; {5714#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:37,991 INFO L290 TraceCheckUtils]: 48: Hoare triple {5714#(<= ~counter~0 4)} assume !(~r~0 < 0); {5714#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:37,991 INFO L290 TraceCheckUtils]: 49: Hoare triple {5714#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5739#(<= |main_#t~post6| 4)} is VALID [2022-04-28 05:57:37,992 INFO L290 TraceCheckUtils]: 50: Hoare triple {5739#(<= |main_#t~post6| 4)} assume !(#t~post6 < 20);havoc #t~post6; {5583#false} is VALID [2022-04-28 05:57:37,992 INFO L272 TraceCheckUtils]: 51: Hoare triple {5583#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {5583#false} is VALID [2022-04-28 05:57:37,992 INFO L290 TraceCheckUtils]: 52: Hoare triple {5583#false} ~cond := #in~cond; {5583#false} is VALID [2022-04-28 05:57:37,992 INFO L290 TraceCheckUtils]: 53: Hoare triple {5583#false} assume 0 == ~cond; {5583#false} is VALID [2022-04-28 05:57:37,992 INFO L290 TraceCheckUtils]: 54: Hoare triple {5583#false} assume !false; {5583#false} is VALID [2022-04-28 05:57:37,992 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 30 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 05:57:37,992 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:57:38,345 INFO L290 TraceCheckUtils]: 54: Hoare triple {5583#false} assume !false; {5583#false} is VALID [2022-04-28 05:57:38,345 INFO L290 TraceCheckUtils]: 53: Hoare triple {5583#false} assume 0 == ~cond; {5583#false} is VALID [2022-04-28 05:57:38,345 INFO L290 TraceCheckUtils]: 52: Hoare triple {5583#false} ~cond := #in~cond; {5583#false} is VALID [2022-04-28 05:57:38,346 INFO L272 TraceCheckUtils]: 51: Hoare triple {5583#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {5583#false} is VALID [2022-04-28 05:57:38,346 INFO L290 TraceCheckUtils]: 50: Hoare triple {5767#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {5583#false} is VALID [2022-04-28 05:57:38,346 INFO L290 TraceCheckUtils]: 49: Hoare triple {5771#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5767#(< |main_#t~post6| 20)} is VALID [2022-04-28 05:57:38,347 INFO L290 TraceCheckUtils]: 48: Hoare triple {5771#(< ~counter~0 20)} assume !(~r~0 < 0); {5771#(< ~counter~0 20)} is VALID [2022-04-28 05:57:38,347 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {5582#true} {5771#(< ~counter~0 20)} #98#return; {5771#(< ~counter~0 20)} is VALID [2022-04-28 05:57:38,347 INFO L290 TraceCheckUtils]: 46: Hoare triple {5582#true} assume true; {5582#true} is VALID [2022-04-28 05:57:38,347 INFO L290 TraceCheckUtils]: 45: Hoare triple {5582#true} assume !(0 == ~cond); {5582#true} is VALID [2022-04-28 05:57:38,348 INFO L290 TraceCheckUtils]: 44: Hoare triple {5582#true} ~cond := #in~cond; {5582#true} is VALID [2022-04-28 05:57:38,348 INFO L272 TraceCheckUtils]: 43: Hoare triple {5771#(< ~counter~0 20)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {5582#true} is VALID [2022-04-28 05:57:38,348 INFO L290 TraceCheckUtils]: 42: Hoare triple {5771#(< ~counter~0 20)} assume !!(#t~post8 < 20);havoc #t~post8; {5771#(< ~counter~0 20)} is VALID [2022-04-28 05:57:38,349 INFO L290 TraceCheckUtils]: 41: Hoare triple {5796#(< ~counter~0 19)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {5771#(< ~counter~0 20)} is VALID [2022-04-28 05:57:38,349 INFO L290 TraceCheckUtils]: 40: Hoare triple {5796#(< ~counter~0 19)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {5796#(< ~counter~0 19)} is VALID [2022-04-28 05:57:38,350 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {5582#true} {5796#(< ~counter~0 19)} #98#return; {5796#(< ~counter~0 19)} is VALID [2022-04-28 05:57:38,350 INFO L290 TraceCheckUtils]: 38: Hoare triple {5582#true} assume true; {5582#true} is VALID [2022-04-28 05:57:38,350 INFO L290 TraceCheckUtils]: 37: Hoare triple {5582#true} assume !(0 == ~cond); {5582#true} is VALID [2022-04-28 05:57:38,350 INFO L290 TraceCheckUtils]: 36: Hoare triple {5582#true} ~cond := #in~cond; {5582#true} is VALID [2022-04-28 05:57:38,350 INFO L272 TraceCheckUtils]: 35: Hoare triple {5796#(< ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {5582#true} is VALID [2022-04-28 05:57:38,350 INFO L290 TraceCheckUtils]: 34: Hoare triple {5796#(< ~counter~0 19)} assume !!(#t~post8 < 20);havoc #t~post8; {5796#(< ~counter~0 19)} is VALID [2022-04-28 05:57:38,351 INFO L290 TraceCheckUtils]: 33: Hoare triple {5821#(< ~counter~0 18)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {5796#(< ~counter~0 19)} is VALID [2022-04-28 05:57:38,351 INFO L290 TraceCheckUtils]: 32: Hoare triple {5821#(< ~counter~0 18)} assume !(~r~0 > 0); {5821#(< ~counter~0 18)} is VALID [2022-04-28 05:57:38,352 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {5582#true} {5821#(< ~counter~0 18)} #96#return; {5821#(< ~counter~0 18)} is VALID [2022-04-28 05:57:38,352 INFO L290 TraceCheckUtils]: 30: Hoare triple {5582#true} assume true; {5582#true} is VALID [2022-04-28 05:57:38,352 INFO L290 TraceCheckUtils]: 29: Hoare triple {5582#true} assume !(0 == ~cond); {5582#true} is VALID [2022-04-28 05:57:38,352 INFO L290 TraceCheckUtils]: 28: Hoare triple {5582#true} ~cond := #in~cond; {5582#true} is VALID [2022-04-28 05:57:38,352 INFO L272 TraceCheckUtils]: 27: Hoare triple {5821#(< ~counter~0 18)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {5582#true} is VALID [2022-04-28 05:57:38,353 INFO L290 TraceCheckUtils]: 26: Hoare triple {5821#(< ~counter~0 18)} assume !!(#t~post7 < 20);havoc #t~post7; {5821#(< ~counter~0 18)} is VALID [2022-04-28 05:57:38,353 INFO L290 TraceCheckUtils]: 25: Hoare triple {5846#(< ~counter~0 17)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {5821#(< ~counter~0 18)} is VALID [2022-04-28 05:57:38,354 INFO L290 TraceCheckUtils]: 24: Hoare triple {5846#(< ~counter~0 17)} assume !!(0 != ~r~0); {5846#(< ~counter~0 17)} is VALID [2022-04-28 05:57:38,354 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {5582#true} {5846#(< ~counter~0 17)} #94#return; {5846#(< ~counter~0 17)} is VALID [2022-04-28 05:57:38,354 INFO L290 TraceCheckUtils]: 22: Hoare triple {5582#true} assume true; {5582#true} is VALID [2022-04-28 05:57:38,354 INFO L290 TraceCheckUtils]: 21: Hoare triple {5582#true} assume !(0 == ~cond); {5582#true} is VALID [2022-04-28 05:57:38,355 INFO L290 TraceCheckUtils]: 20: Hoare triple {5582#true} ~cond := #in~cond; {5582#true} is VALID [2022-04-28 05:57:38,355 INFO L272 TraceCheckUtils]: 19: Hoare triple {5846#(< ~counter~0 17)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {5582#true} is VALID [2022-04-28 05:57:38,355 INFO L290 TraceCheckUtils]: 18: Hoare triple {5846#(< ~counter~0 17)} assume !!(#t~post6 < 20);havoc #t~post6; {5846#(< ~counter~0 17)} is VALID [2022-04-28 05:57:38,355 INFO L290 TraceCheckUtils]: 17: Hoare triple {5871#(< ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5846#(< ~counter~0 17)} is VALID [2022-04-28 05:57:38,356 INFO L290 TraceCheckUtils]: 16: Hoare triple {5871#(< ~counter~0 16)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {5871#(< ~counter~0 16)} is VALID [2022-04-28 05:57:38,356 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {5582#true} {5871#(< ~counter~0 16)} #92#return; {5871#(< ~counter~0 16)} is VALID [2022-04-28 05:57:38,356 INFO L290 TraceCheckUtils]: 14: Hoare triple {5582#true} assume true; {5582#true} is VALID [2022-04-28 05:57:38,356 INFO L290 TraceCheckUtils]: 13: Hoare triple {5582#true} assume !(0 == ~cond); {5582#true} is VALID [2022-04-28 05:57:38,357 INFO L290 TraceCheckUtils]: 12: Hoare triple {5582#true} ~cond := #in~cond; {5582#true} is VALID [2022-04-28 05:57:38,357 INFO L272 TraceCheckUtils]: 11: Hoare triple {5871#(< ~counter~0 16)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {5582#true} is VALID [2022-04-28 05:57:38,357 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5582#true} {5871#(< ~counter~0 16)} #90#return; {5871#(< ~counter~0 16)} is VALID [2022-04-28 05:57:38,357 INFO L290 TraceCheckUtils]: 9: Hoare triple {5582#true} assume true; {5582#true} is VALID [2022-04-28 05:57:38,357 INFO L290 TraceCheckUtils]: 8: Hoare triple {5582#true} assume !(0 == ~cond); {5582#true} is VALID [2022-04-28 05:57:38,357 INFO L290 TraceCheckUtils]: 7: Hoare triple {5582#true} ~cond := #in~cond; {5582#true} is VALID [2022-04-28 05:57:38,357 INFO L272 TraceCheckUtils]: 6: Hoare triple {5871#(< ~counter~0 16)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {5582#true} is VALID [2022-04-28 05:57:38,358 INFO L290 TraceCheckUtils]: 5: Hoare triple {5871#(< ~counter~0 16)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {5871#(< ~counter~0 16)} is VALID [2022-04-28 05:57:38,358 INFO L272 TraceCheckUtils]: 4: Hoare triple {5871#(< ~counter~0 16)} call #t~ret9 := main(); {5871#(< ~counter~0 16)} is VALID [2022-04-28 05:57:38,359 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5871#(< ~counter~0 16)} {5582#true} #102#return; {5871#(< ~counter~0 16)} is VALID [2022-04-28 05:57:38,359 INFO L290 TraceCheckUtils]: 2: Hoare triple {5871#(< ~counter~0 16)} assume true; {5871#(< ~counter~0 16)} is VALID [2022-04-28 05:57:38,359 INFO L290 TraceCheckUtils]: 1: Hoare triple {5582#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5871#(< ~counter~0 16)} is VALID [2022-04-28 05:57:38,360 INFO L272 TraceCheckUtils]: 0: Hoare triple {5582#true} call ULTIMATE.init(); {5582#true} is VALID [2022-04-28 05:57:38,360 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 05:57:38,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:57:38,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929959730] [2022-04-28 05:57:38,360 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:57:38,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [414474830] [2022-04-28 05:57:38,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [414474830] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:57:38,360 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:57:38,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-28 05:57:38,361 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:57:38,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1109288115] [2022-04-28 05:57:38,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1109288115] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:57:38,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:57:38,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 05:57:38,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323029059] [2022-04-28 05:57:38,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:57:38,361 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) Word has length 55 [2022-04-28 05:57:38,362 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:57:38,362 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 05:57:38,405 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:57:38,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 05:57:38,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:57:38,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 05:57:38,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-28 05:57:38,406 INFO L87 Difference]: Start difference. First operand 82 states and 101 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 05:57:38,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:38,751 INFO L93 Difference]: Finished difference Result 99 states and 121 transitions. [2022-04-28 05:57:38,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 05:57:38,751 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) Word has length 55 [2022-04-28 05:57:38,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:57:38,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 05:57:38,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2022-04-28 05:57:38,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 05:57:38,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2022-04-28 05:57:38,754 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 95 transitions. [2022-04-28 05:57:38,830 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:57:38,832 INFO L225 Difference]: With dead ends: 99 [2022-04-28 05:57:38,832 INFO L226 Difference]: Without dead ends: 94 [2022-04-28 05:57:38,833 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2022-04-28 05:57:38,833 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 33 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 05:57:38,833 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 149 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 05:57:38,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-04-28 05:57:38,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91. [2022-04-28 05:57:38,928 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:57:38,928 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand has 91 states, 65 states have (on average 1.2) internal successors, (78), 66 states have internal predecessors, (78), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 05:57:38,929 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand has 91 states, 65 states have (on average 1.2) internal successors, (78), 66 states have internal predecessors, (78), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 05:57:38,929 INFO L87 Difference]: Start difference. First operand 94 states. Second operand has 91 states, 65 states have (on average 1.2) internal successors, (78), 66 states have internal predecessors, (78), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 05:57:38,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:38,931 INFO L93 Difference]: Finished difference Result 94 states and 116 transitions. [2022-04-28 05:57:38,931 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 116 transitions. [2022-04-28 05:57:38,931 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:57:38,931 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:57:38,932 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 65 states have (on average 1.2) internal successors, (78), 66 states have internal predecessors, (78), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand 94 states. [2022-04-28 05:57:38,932 INFO L87 Difference]: Start difference. First operand has 91 states, 65 states have (on average 1.2) internal successors, (78), 66 states have internal predecessors, (78), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand 94 states. [2022-04-28 05:57:38,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:38,934 INFO L93 Difference]: Finished difference Result 94 states and 116 transitions. [2022-04-28 05:57:38,934 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 116 transitions. [2022-04-28 05:57:38,934 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:57:38,934 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:57:38,934 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:57:38,934 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:57:38,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 65 states have (on average 1.2) internal successors, (78), 66 states have internal predecessors, (78), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 05:57:38,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 112 transitions. [2022-04-28 05:57:38,937 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 112 transitions. Word has length 55 [2022-04-28 05:57:38,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:57:38,938 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 112 transitions. [2022-04-28 05:57:38,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 05:57:38,938 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 91 states and 112 transitions. [2022-04-28 05:57:40,054 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:57:40,054 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 112 transitions. [2022-04-28 05:57:40,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-04-28 05:57:40,054 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:57:40,055 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:57:40,071 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-28 05:57:40,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-28 05:57:40,255 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:57:40,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:57:40,256 INFO L85 PathProgramCache]: Analyzing trace with hash -2095290798, now seen corresponding path program 3 times [2022-04-28 05:57:40,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:57:40,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [251166885] [2022-04-28 05:57:40,256 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:57:40,256 INFO L85 PathProgramCache]: Analyzing trace with hash -2095290798, now seen corresponding path program 4 times [2022-04-28 05:57:40,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:57:40,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197102216] [2022-04-28 05:57:40,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:57:40,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:57:40,270 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:57:40,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2023252214] [2022-04-28 05:57:40,270 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 05:57:40,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:57:40,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:57:40,271 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:57:40,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-28 05:57:40,324 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 05:57:40,324 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:57:40,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 05:57:40,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:57:40,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:57:40,613 INFO L272 TraceCheckUtils]: 0: Hoare triple {6495#true} call ULTIMATE.init(); {6495#true} is VALID [2022-04-28 05:57:40,613 INFO L290 TraceCheckUtils]: 1: Hoare triple {6495#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {6503#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:40,613 INFO L290 TraceCheckUtils]: 2: Hoare triple {6503#(<= ~counter~0 0)} assume true; {6503#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:40,614 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6503#(<= ~counter~0 0)} {6495#true} #102#return; {6503#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:40,614 INFO L272 TraceCheckUtils]: 4: Hoare triple {6503#(<= ~counter~0 0)} call #t~ret9 := main(); {6503#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:40,614 INFO L290 TraceCheckUtils]: 5: Hoare triple {6503#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {6503#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:40,615 INFO L272 TraceCheckUtils]: 6: Hoare triple {6503#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {6503#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:40,615 INFO L290 TraceCheckUtils]: 7: Hoare triple {6503#(<= ~counter~0 0)} ~cond := #in~cond; {6503#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:40,615 INFO L290 TraceCheckUtils]: 8: Hoare triple {6503#(<= ~counter~0 0)} assume !(0 == ~cond); {6503#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:40,616 INFO L290 TraceCheckUtils]: 9: Hoare triple {6503#(<= ~counter~0 0)} assume true; {6503#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:40,616 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6503#(<= ~counter~0 0)} {6503#(<= ~counter~0 0)} #90#return; {6503#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:40,616 INFO L272 TraceCheckUtils]: 11: Hoare triple {6503#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {6503#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:40,617 INFO L290 TraceCheckUtils]: 12: Hoare triple {6503#(<= ~counter~0 0)} ~cond := #in~cond; {6503#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:40,617 INFO L290 TraceCheckUtils]: 13: Hoare triple {6503#(<= ~counter~0 0)} assume !(0 == ~cond); {6503#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:40,617 INFO L290 TraceCheckUtils]: 14: Hoare triple {6503#(<= ~counter~0 0)} assume true; {6503#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:40,618 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6503#(<= ~counter~0 0)} {6503#(<= ~counter~0 0)} #92#return; {6503#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:40,618 INFO L290 TraceCheckUtils]: 16: Hoare triple {6503#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {6503#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:40,618 INFO L290 TraceCheckUtils]: 17: Hoare triple {6503#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6552#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:40,619 INFO L290 TraceCheckUtils]: 18: Hoare triple {6552#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {6552#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:40,619 INFO L272 TraceCheckUtils]: 19: Hoare triple {6552#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {6552#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:40,619 INFO L290 TraceCheckUtils]: 20: Hoare triple {6552#(<= ~counter~0 1)} ~cond := #in~cond; {6552#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:40,620 INFO L290 TraceCheckUtils]: 21: Hoare triple {6552#(<= ~counter~0 1)} assume !(0 == ~cond); {6552#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:40,620 INFO L290 TraceCheckUtils]: 22: Hoare triple {6552#(<= ~counter~0 1)} assume true; {6552#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:40,621 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6552#(<= ~counter~0 1)} {6552#(<= ~counter~0 1)} #94#return; {6552#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:40,621 INFO L290 TraceCheckUtils]: 24: Hoare triple {6552#(<= ~counter~0 1)} assume !!(0 != ~r~0); {6552#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:40,621 INFO L290 TraceCheckUtils]: 25: Hoare triple {6552#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {6577#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:40,622 INFO L290 TraceCheckUtils]: 26: Hoare triple {6577#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {6577#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:40,622 INFO L272 TraceCheckUtils]: 27: Hoare triple {6577#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {6577#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:40,622 INFO L290 TraceCheckUtils]: 28: Hoare triple {6577#(<= ~counter~0 2)} ~cond := #in~cond; {6577#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:40,623 INFO L290 TraceCheckUtils]: 29: Hoare triple {6577#(<= ~counter~0 2)} assume !(0 == ~cond); {6577#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:40,623 INFO L290 TraceCheckUtils]: 30: Hoare triple {6577#(<= ~counter~0 2)} assume true; {6577#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:40,623 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {6577#(<= ~counter~0 2)} {6577#(<= ~counter~0 2)} #96#return; {6577#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:40,624 INFO L290 TraceCheckUtils]: 32: Hoare triple {6577#(<= ~counter~0 2)} assume !(~r~0 > 0); {6577#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:40,624 INFO L290 TraceCheckUtils]: 33: Hoare triple {6577#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {6602#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:40,624 INFO L290 TraceCheckUtils]: 34: Hoare triple {6602#(<= ~counter~0 3)} assume !!(#t~post8 < 20);havoc #t~post8; {6602#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:40,625 INFO L272 TraceCheckUtils]: 35: Hoare triple {6602#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {6602#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:40,625 INFO L290 TraceCheckUtils]: 36: Hoare triple {6602#(<= ~counter~0 3)} ~cond := #in~cond; {6602#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:40,625 INFO L290 TraceCheckUtils]: 37: Hoare triple {6602#(<= ~counter~0 3)} assume !(0 == ~cond); {6602#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:40,626 INFO L290 TraceCheckUtils]: 38: Hoare triple {6602#(<= ~counter~0 3)} assume true; {6602#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:40,626 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {6602#(<= ~counter~0 3)} {6602#(<= ~counter~0 3)} #98#return; {6602#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:40,626 INFO L290 TraceCheckUtils]: 40: Hoare triple {6602#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {6602#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:40,627 INFO L290 TraceCheckUtils]: 41: Hoare triple {6602#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {6627#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:40,627 INFO L290 TraceCheckUtils]: 42: Hoare triple {6627#(<= ~counter~0 4)} assume !!(#t~post8 < 20);havoc #t~post8; {6627#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:40,627 INFO L272 TraceCheckUtils]: 43: Hoare triple {6627#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {6627#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:40,628 INFO L290 TraceCheckUtils]: 44: Hoare triple {6627#(<= ~counter~0 4)} ~cond := #in~cond; {6627#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:40,628 INFO L290 TraceCheckUtils]: 45: Hoare triple {6627#(<= ~counter~0 4)} assume !(0 == ~cond); {6627#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:40,628 INFO L290 TraceCheckUtils]: 46: Hoare triple {6627#(<= ~counter~0 4)} assume true; {6627#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:40,629 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {6627#(<= ~counter~0 4)} {6627#(<= ~counter~0 4)} #98#return; {6627#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:40,629 INFO L290 TraceCheckUtils]: 48: Hoare triple {6627#(<= ~counter~0 4)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {6627#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:40,629 INFO L290 TraceCheckUtils]: 49: Hoare triple {6627#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {6652#(<= |main_#t~post8| 4)} is VALID [2022-04-28 05:57:40,630 INFO L290 TraceCheckUtils]: 50: Hoare triple {6652#(<= |main_#t~post8| 4)} assume !(#t~post8 < 20);havoc #t~post8; {6496#false} is VALID [2022-04-28 05:57:40,630 INFO L290 TraceCheckUtils]: 51: Hoare triple {6496#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6496#false} is VALID [2022-04-28 05:57:40,630 INFO L290 TraceCheckUtils]: 52: Hoare triple {6496#false} assume !(#t~post6 < 20);havoc #t~post6; {6496#false} is VALID [2022-04-28 05:57:40,630 INFO L272 TraceCheckUtils]: 53: Hoare triple {6496#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {6496#false} is VALID [2022-04-28 05:57:40,630 INFO L290 TraceCheckUtils]: 54: Hoare triple {6496#false} ~cond := #in~cond; {6496#false} is VALID [2022-04-28 05:57:40,630 INFO L290 TraceCheckUtils]: 55: Hoare triple {6496#false} assume 0 == ~cond; {6496#false} is VALID [2022-04-28 05:57:40,630 INFO L290 TraceCheckUtils]: 56: Hoare triple {6496#false} assume !false; {6496#false} is VALID [2022-04-28 05:57:40,630 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 10 proven. 32 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 05:57:40,630 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:57:40,932 INFO L290 TraceCheckUtils]: 56: Hoare triple {6496#false} assume !false; {6496#false} is VALID [2022-04-28 05:57:40,932 INFO L290 TraceCheckUtils]: 55: Hoare triple {6496#false} assume 0 == ~cond; {6496#false} is VALID [2022-04-28 05:57:40,932 INFO L290 TraceCheckUtils]: 54: Hoare triple {6496#false} ~cond := #in~cond; {6496#false} is VALID [2022-04-28 05:57:40,932 INFO L272 TraceCheckUtils]: 53: Hoare triple {6496#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {6496#false} is VALID [2022-04-28 05:57:40,933 INFO L290 TraceCheckUtils]: 52: Hoare triple {6496#false} assume !(#t~post6 < 20);havoc #t~post6; {6496#false} is VALID [2022-04-28 05:57:40,933 INFO L290 TraceCheckUtils]: 51: Hoare triple {6496#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6496#false} is VALID [2022-04-28 05:57:40,933 INFO L290 TraceCheckUtils]: 50: Hoare triple {6692#(< |main_#t~post8| 20)} assume !(#t~post8 < 20);havoc #t~post8; {6496#false} is VALID [2022-04-28 05:57:40,933 INFO L290 TraceCheckUtils]: 49: Hoare triple {6696#(< ~counter~0 20)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {6692#(< |main_#t~post8| 20)} is VALID [2022-04-28 05:57:40,934 INFO L290 TraceCheckUtils]: 48: Hoare triple {6696#(< ~counter~0 20)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {6696#(< ~counter~0 20)} is VALID [2022-04-28 05:57:40,934 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {6495#true} {6696#(< ~counter~0 20)} #98#return; {6696#(< ~counter~0 20)} is VALID [2022-04-28 05:57:40,934 INFO L290 TraceCheckUtils]: 46: Hoare triple {6495#true} assume true; {6495#true} is VALID [2022-04-28 05:57:40,934 INFO L290 TraceCheckUtils]: 45: Hoare triple {6495#true} assume !(0 == ~cond); {6495#true} is VALID [2022-04-28 05:57:40,934 INFO L290 TraceCheckUtils]: 44: Hoare triple {6495#true} ~cond := #in~cond; {6495#true} is VALID [2022-04-28 05:57:40,934 INFO L272 TraceCheckUtils]: 43: Hoare triple {6696#(< ~counter~0 20)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {6495#true} is VALID [2022-04-28 05:57:40,935 INFO L290 TraceCheckUtils]: 42: Hoare triple {6696#(< ~counter~0 20)} assume !!(#t~post8 < 20);havoc #t~post8; {6696#(< ~counter~0 20)} is VALID [2022-04-28 05:57:40,935 INFO L290 TraceCheckUtils]: 41: Hoare triple {6721#(< ~counter~0 19)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {6696#(< ~counter~0 20)} is VALID [2022-04-28 05:57:40,936 INFO L290 TraceCheckUtils]: 40: Hoare triple {6721#(< ~counter~0 19)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {6721#(< ~counter~0 19)} is VALID [2022-04-28 05:57:40,936 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {6495#true} {6721#(< ~counter~0 19)} #98#return; {6721#(< ~counter~0 19)} is VALID [2022-04-28 05:57:40,936 INFO L290 TraceCheckUtils]: 38: Hoare triple {6495#true} assume true; {6495#true} is VALID [2022-04-28 05:57:40,936 INFO L290 TraceCheckUtils]: 37: Hoare triple {6495#true} assume !(0 == ~cond); {6495#true} is VALID [2022-04-28 05:57:40,936 INFO L290 TraceCheckUtils]: 36: Hoare triple {6495#true} ~cond := #in~cond; {6495#true} is VALID [2022-04-28 05:57:40,936 INFO L272 TraceCheckUtils]: 35: Hoare triple {6721#(< ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {6495#true} is VALID [2022-04-28 05:57:40,955 INFO L290 TraceCheckUtils]: 34: Hoare triple {6721#(< ~counter~0 19)} assume !!(#t~post8 < 20);havoc #t~post8; {6721#(< ~counter~0 19)} is VALID [2022-04-28 05:57:40,956 INFO L290 TraceCheckUtils]: 33: Hoare triple {6746#(< ~counter~0 18)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {6721#(< ~counter~0 19)} is VALID [2022-04-28 05:57:40,957 INFO L290 TraceCheckUtils]: 32: Hoare triple {6746#(< ~counter~0 18)} assume !(~r~0 > 0); {6746#(< ~counter~0 18)} is VALID [2022-04-28 05:57:40,958 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {6495#true} {6746#(< ~counter~0 18)} #96#return; {6746#(< ~counter~0 18)} is VALID [2022-04-28 05:57:40,958 INFO L290 TraceCheckUtils]: 30: Hoare triple {6495#true} assume true; {6495#true} is VALID [2022-04-28 05:57:40,958 INFO L290 TraceCheckUtils]: 29: Hoare triple {6495#true} assume !(0 == ~cond); {6495#true} is VALID [2022-04-28 05:57:40,958 INFO L290 TraceCheckUtils]: 28: Hoare triple {6495#true} ~cond := #in~cond; {6495#true} is VALID [2022-04-28 05:57:40,959 INFO L272 TraceCheckUtils]: 27: Hoare triple {6746#(< ~counter~0 18)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {6495#true} is VALID [2022-04-28 05:57:40,965 INFO L290 TraceCheckUtils]: 26: Hoare triple {6746#(< ~counter~0 18)} assume !!(#t~post7 < 20);havoc #t~post7; {6746#(< ~counter~0 18)} is VALID [2022-04-28 05:57:40,966 INFO L290 TraceCheckUtils]: 25: Hoare triple {6771#(< ~counter~0 17)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {6746#(< ~counter~0 18)} is VALID [2022-04-28 05:57:40,967 INFO L290 TraceCheckUtils]: 24: Hoare triple {6771#(< ~counter~0 17)} assume !!(0 != ~r~0); {6771#(< ~counter~0 17)} is VALID [2022-04-28 05:57:40,967 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6495#true} {6771#(< ~counter~0 17)} #94#return; {6771#(< ~counter~0 17)} is VALID [2022-04-28 05:57:40,967 INFO L290 TraceCheckUtils]: 22: Hoare triple {6495#true} assume true; {6495#true} is VALID [2022-04-28 05:57:40,967 INFO L290 TraceCheckUtils]: 21: Hoare triple {6495#true} assume !(0 == ~cond); {6495#true} is VALID [2022-04-28 05:57:40,968 INFO L290 TraceCheckUtils]: 20: Hoare triple {6495#true} ~cond := #in~cond; {6495#true} is VALID [2022-04-28 05:57:40,968 INFO L272 TraceCheckUtils]: 19: Hoare triple {6771#(< ~counter~0 17)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {6495#true} is VALID [2022-04-28 05:57:40,968 INFO L290 TraceCheckUtils]: 18: Hoare triple {6771#(< ~counter~0 17)} assume !!(#t~post6 < 20);havoc #t~post6; {6771#(< ~counter~0 17)} is VALID [2022-04-28 05:57:40,969 INFO L290 TraceCheckUtils]: 17: Hoare triple {6796#(< ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6771#(< ~counter~0 17)} is VALID [2022-04-28 05:57:40,969 INFO L290 TraceCheckUtils]: 16: Hoare triple {6796#(< ~counter~0 16)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {6796#(< ~counter~0 16)} is VALID [2022-04-28 05:57:40,969 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6495#true} {6796#(< ~counter~0 16)} #92#return; {6796#(< ~counter~0 16)} is VALID [2022-04-28 05:57:40,970 INFO L290 TraceCheckUtils]: 14: Hoare triple {6495#true} assume true; {6495#true} is VALID [2022-04-28 05:57:40,970 INFO L290 TraceCheckUtils]: 13: Hoare triple {6495#true} assume !(0 == ~cond); {6495#true} is VALID [2022-04-28 05:57:40,970 INFO L290 TraceCheckUtils]: 12: Hoare triple {6495#true} ~cond := #in~cond; {6495#true} is VALID [2022-04-28 05:57:40,970 INFO L272 TraceCheckUtils]: 11: Hoare triple {6796#(< ~counter~0 16)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {6495#true} is VALID [2022-04-28 05:57:40,970 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6495#true} {6796#(< ~counter~0 16)} #90#return; {6796#(< ~counter~0 16)} is VALID [2022-04-28 05:57:40,970 INFO L290 TraceCheckUtils]: 9: Hoare triple {6495#true} assume true; {6495#true} is VALID [2022-04-28 05:57:40,971 INFO L290 TraceCheckUtils]: 8: Hoare triple {6495#true} assume !(0 == ~cond); {6495#true} is VALID [2022-04-28 05:57:40,971 INFO L290 TraceCheckUtils]: 7: Hoare triple {6495#true} ~cond := #in~cond; {6495#true} is VALID [2022-04-28 05:57:40,971 INFO L272 TraceCheckUtils]: 6: Hoare triple {6796#(< ~counter~0 16)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {6495#true} is VALID [2022-04-28 05:57:40,971 INFO L290 TraceCheckUtils]: 5: Hoare triple {6796#(< ~counter~0 16)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {6796#(< ~counter~0 16)} is VALID [2022-04-28 05:57:40,971 INFO L272 TraceCheckUtils]: 4: Hoare triple {6796#(< ~counter~0 16)} call #t~ret9 := main(); {6796#(< ~counter~0 16)} is VALID [2022-04-28 05:57:40,972 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6796#(< ~counter~0 16)} {6495#true} #102#return; {6796#(< ~counter~0 16)} is VALID [2022-04-28 05:57:40,972 INFO L290 TraceCheckUtils]: 2: Hoare triple {6796#(< ~counter~0 16)} assume true; {6796#(< ~counter~0 16)} is VALID [2022-04-28 05:57:40,973 INFO L290 TraceCheckUtils]: 1: Hoare triple {6495#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {6796#(< ~counter~0 16)} is VALID [2022-04-28 05:57:40,973 INFO L272 TraceCheckUtils]: 0: Hoare triple {6495#true} call ULTIMATE.init(); {6495#true} is VALID [2022-04-28 05:57:40,973 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 05:57:40,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:57:40,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197102216] [2022-04-28 05:57:40,974 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:57:40,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023252214] [2022-04-28 05:57:40,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2023252214] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:57:40,974 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:57:40,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-28 05:57:40,974 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:57:40,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [251166885] [2022-04-28 05:57:40,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [251166885] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:57:40,974 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:57:40,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 05:57:40,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830799031] [2022-04-28 05:57:40,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:57:40,975 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) Word has length 57 [2022-04-28 05:57:40,975 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:57:40,975 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 05:57:41,014 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:57:41,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 05:57:41,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:57:41,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 05:57:41,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-28 05:57:41,015 INFO L87 Difference]: Start difference. First operand 91 states and 112 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 05:57:41,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:41,339 INFO L93 Difference]: Finished difference Result 132 states and 170 transitions. [2022-04-28 05:57:41,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 05:57:41,339 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) Word has length 57 [2022-04-28 05:57:41,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:57:41,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 05:57:41,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 117 transitions. [2022-04-28 05:57:41,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 05:57:41,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 117 transitions. [2022-04-28 05:57:41,342 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 117 transitions. [2022-04-28 05:57:41,424 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:57:41,425 INFO L225 Difference]: With dead ends: 132 [2022-04-28 05:57:41,426 INFO L226 Difference]: Without dead ends: 95 [2022-04-28 05:57:41,426 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2022-04-28 05:57:41,426 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 25 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 05:57:41,427 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 160 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 05:57:41,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-04-28 05:57:41,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2022-04-28 05:57:41,516 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:57:41,516 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand has 94 states, 68 states have (on average 1.2058823529411764) internal successors, (82), 68 states have internal predecessors, (82), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 05:57:41,517 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand has 94 states, 68 states have (on average 1.2058823529411764) internal successors, (82), 68 states have internal predecessors, (82), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 05:57:41,517 INFO L87 Difference]: Start difference. First operand 95 states. Second operand has 94 states, 68 states have (on average 1.2058823529411764) internal successors, (82), 68 states have internal predecessors, (82), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 05:57:41,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:41,519 INFO L93 Difference]: Finished difference Result 95 states and 117 transitions. [2022-04-28 05:57:41,519 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 117 transitions. [2022-04-28 05:57:41,519 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:57:41,519 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:57:41,520 INFO L74 IsIncluded]: Start isIncluded. First operand has 94 states, 68 states have (on average 1.2058823529411764) internal successors, (82), 68 states have internal predecessors, (82), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 95 states. [2022-04-28 05:57:41,520 INFO L87 Difference]: Start difference. First operand has 94 states, 68 states have (on average 1.2058823529411764) internal successors, (82), 68 states have internal predecessors, (82), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 95 states. [2022-04-28 05:57:41,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:41,522 INFO L93 Difference]: Finished difference Result 95 states and 117 transitions. [2022-04-28 05:57:41,522 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 117 transitions. [2022-04-28 05:57:41,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:57:41,522 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:57:41,522 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:57:41,522 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:57:41,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 68 states have (on average 1.2058823529411764) internal successors, (82), 68 states have internal predecessors, (82), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 05:57:41,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 116 transitions. [2022-04-28 05:57:41,524 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 116 transitions. Word has length 57 [2022-04-28 05:57:41,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:57:41,525 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 116 transitions. [2022-04-28 05:57:41,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 05:57:41,525 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 94 states and 116 transitions. [2022-04-28 05:57:42,634 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:57:42,635 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 116 transitions. [2022-04-28 05:57:42,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-28 05:57:42,635 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:57:42,636 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 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, 1, 1] [2022-04-28 05:57:42,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-28 05:57:42,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-28 05:57:42,839 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:57:42,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:57:42,840 INFO L85 PathProgramCache]: Analyzing trace with hash -659642693, now seen corresponding path program 5 times [2022-04-28 05:57:42,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:57:42,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1367043492] [2022-04-28 05:57:42,840 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:57:42,840 INFO L85 PathProgramCache]: Analyzing trace with hash -659642693, now seen corresponding path program 6 times [2022-04-28 05:57:42,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:57:42,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144710632] [2022-04-28 05:57:42,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:57:42,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:57:42,856 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:57:42,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1438136901] [2022-04-28 05:57:42,857 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 05:57:42,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:57:42,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:57:42,860 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:57:42,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-28 05:57:42,946 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 05:57:42,947 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:57:42,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 05:57:42,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:57:42,960 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:57:43,232 INFO L272 TraceCheckUtils]: 0: Hoare triple {7496#true} call ULTIMATE.init(); {7496#true} is VALID [2022-04-28 05:57:43,233 INFO L290 TraceCheckUtils]: 1: Hoare triple {7496#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {7504#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:43,233 INFO L290 TraceCheckUtils]: 2: Hoare triple {7504#(<= ~counter~0 0)} assume true; {7504#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:43,237 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7504#(<= ~counter~0 0)} {7496#true} #102#return; {7504#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:43,238 INFO L272 TraceCheckUtils]: 4: Hoare triple {7504#(<= ~counter~0 0)} call #t~ret9 := main(); {7504#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:43,239 INFO L290 TraceCheckUtils]: 5: Hoare triple {7504#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {7504#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:43,239 INFO L272 TraceCheckUtils]: 6: Hoare triple {7504#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {7504#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:43,240 INFO L290 TraceCheckUtils]: 7: Hoare triple {7504#(<= ~counter~0 0)} ~cond := #in~cond; {7504#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:43,240 INFO L290 TraceCheckUtils]: 8: Hoare triple {7504#(<= ~counter~0 0)} assume !(0 == ~cond); {7504#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:43,240 INFO L290 TraceCheckUtils]: 9: Hoare triple {7504#(<= ~counter~0 0)} assume true; {7504#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:43,241 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7504#(<= ~counter~0 0)} {7504#(<= ~counter~0 0)} #90#return; {7504#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:43,241 INFO L272 TraceCheckUtils]: 11: Hoare triple {7504#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {7504#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:43,241 INFO L290 TraceCheckUtils]: 12: Hoare triple {7504#(<= ~counter~0 0)} ~cond := #in~cond; {7504#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:43,242 INFO L290 TraceCheckUtils]: 13: Hoare triple {7504#(<= ~counter~0 0)} assume !(0 == ~cond); {7504#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:43,242 INFO L290 TraceCheckUtils]: 14: Hoare triple {7504#(<= ~counter~0 0)} assume true; {7504#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:43,242 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7504#(<= ~counter~0 0)} {7504#(<= ~counter~0 0)} #92#return; {7504#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:43,243 INFO L290 TraceCheckUtils]: 16: Hoare triple {7504#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {7504#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:43,243 INFO L290 TraceCheckUtils]: 17: Hoare triple {7504#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7553#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:43,243 INFO L290 TraceCheckUtils]: 18: Hoare triple {7553#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {7553#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:43,244 INFO L272 TraceCheckUtils]: 19: Hoare triple {7553#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7553#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:43,244 INFO L290 TraceCheckUtils]: 20: Hoare triple {7553#(<= ~counter~0 1)} ~cond := #in~cond; {7553#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:43,244 INFO L290 TraceCheckUtils]: 21: Hoare triple {7553#(<= ~counter~0 1)} assume !(0 == ~cond); {7553#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:43,245 INFO L290 TraceCheckUtils]: 22: Hoare triple {7553#(<= ~counter~0 1)} assume true; {7553#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:43,245 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {7553#(<= ~counter~0 1)} {7553#(<= ~counter~0 1)} #94#return; {7553#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:43,246 INFO L290 TraceCheckUtils]: 24: Hoare triple {7553#(<= ~counter~0 1)} assume !!(0 != ~r~0); {7553#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:43,246 INFO L290 TraceCheckUtils]: 25: Hoare triple {7553#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7578#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:43,246 INFO L290 TraceCheckUtils]: 26: Hoare triple {7578#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {7578#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:43,247 INFO L272 TraceCheckUtils]: 27: Hoare triple {7578#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7578#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:43,247 INFO L290 TraceCheckUtils]: 28: Hoare triple {7578#(<= ~counter~0 2)} ~cond := #in~cond; {7578#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:43,247 INFO L290 TraceCheckUtils]: 29: Hoare triple {7578#(<= ~counter~0 2)} assume !(0 == ~cond); {7578#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:43,248 INFO L290 TraceCheckUtils]: 30: Hoare triple {7578#(<= ~counter~0 2)} assume true; {7578#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:43,250 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {7578#(<= ~counter~0 2)} {7578#(<= ~counter~0 2)} #96#return; {7578#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:43,250 INFO L290 TraceCheckUtils]: 32: Hoare triple {7578#(<= ~counter~0 2)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {7578#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:43,250 INFO L290 TraceCheckUtils]: 33: Hoare triple {7578#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7603#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:43,251 INFO L290 TraceCheckUtils]: 34: Hoare triple {7603#(<= ~counter~0 3)} assume !!(#t~post7 < 20);havoc #t~post7; {7603#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:43,251 INFO L272 TraceCheckUtils]: 35: Hoare triple {7603#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7603#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:43,251 INFO L290 TraceCheckUtils]: 36: Hoare triple {7603#(<= ~counter~0 3)} ~cond := #in~cond; {7603#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:43,252 INFO L290 TraceCheckUtils]: 37: Hoare triple {7603#(<= ~counter~0 3)} assume !(0 == ~cond); {7603#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:43,252 INFO L290 TraceCheckUtils]: 38: Hoare triple {7603#(<= ~counter~0 3)} assume true; {7603#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:43,255 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {7603#(<= ~counter~0 3)} {7603#(<= ~counter~0 3)} #96#return; {7603#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:43,256 INFO L290 TraceCheckUtils]: 40: Hoare triple {7603#(<= ~counter~0 3)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {7603#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:43,256 INFO L290 TraceCheckUtils]: 41: Hoare triple {7603#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7628#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:43,257 INFO L290 TraceCheckUtils]: 42: Hoare triple {7628#(<= ~counter~0 4)} assume !!(#t~post7 < 20);havoc #t~post7; {7628#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:43,258 INFO L272 TraceCheckUtils]: 43: Hoare triple {7628#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7628#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:43,258 INFO L290 TraceCheckUtils]: 44: Hoare triple {7628#(<= ~counter~0 4)} ~cond := #in~cond; {7628#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:43,258 INFO L290 TraceCheckUtils]: 45: Hoare triple {7628#(<= ~counter~0 4)} assume !(0 == ~cond); {7628#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:43,259 INFO L290 TraceCheckUtils]: 46: Hoare triple {7628#(<= ~counter~0 4)} assume true; {7628#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:43,259 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {7628#(<= ~counter~0 4)} {7628#(<= ~counter~0 4)} #96#return; {7628#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:43,260 INFO L290 TraceCheckUtils]: 48: Hoare triple {7628#(<= ~counter~0 4)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {7628#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:43,260 INFO L290 TraceCheckUtils]: 49: Hoare triple {7628#(<= ~counter~0 4)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7653#(<= |main_#t~post7| 4)} is VALID [2022-04-28 05:57:43,260 INFO L290 TraceCheckUtils]: 50: Hoare triple {7653#(<= |main_#t~post7| 4)} assume !(#t~post7 < 20);havoc #t~post7; {7497#false} is VALID [2022-04-28 05:57:43,261 INFO L290 TraceCheckUtils]: 51: Hoare triple {7497#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {7497#false} is VALID [2022-04-28 05:57:43,261 INFO L290 TraceCheckUtils]: 52: Hoare triple {7497#false} assume !(#t~post8 < 20);havoc #t~post8; {7497#false} is VALID [2022-04-28 05:57:43,261 INFO L290 TraceCheckUtils]: 53: Hoare triple {7497#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7497#false} is VALID [2022-04-28 05:57:43,261 INFO L290 TraceCheckUtils]: 54: Hoare triple {7497#false} assume !(#t~post6 < 20);havoc #t~post6; {7497#false} is VALID [2022-04-28 05:57:43,261 INFO L272 TraceCheckUtils]: 55: Hoare triple {7497#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7497#false} is VALID [2022-04-28 05:57:43,261 INFO L290 TraceCheckUtils]: 56: Hoare triple {7497#false} ~cond := #in~cond; {7497#false} is VALID [2022-04-28 05:57:43,261 INFO L290 TraceCheckUtils]: 57: Hoare triple {7497#false} assume 0 == ~cond; {7497#false} is VALID [2022-04-28 05:57:43,261 INFO L290 TraceCheckUtils]: 58: Hoare triple {7497#false} assume !false; {7497#false} is VALID [2022-04-28 05:57:43,261 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 10 proven. 42 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 05:57:43,262 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:57:43,564 INFO L290 TraceCheckUtils]: 58: Hoare triple {7497#false} assume !false; {7497#false} is VALID [2022-04-28 05:57:43,565 INFO L290 TraceCheckUtils]: 57: Hoare triple {7497#false} assume 0 == ~cond; {7497#false} is VALID [2022-04-28 05:57:43,565 INFO L290 TraceCheckUtils]: 56: Hoare triple {7497#false} ~cond := #in~cond; {7497#false} is VALID [2022-04-28 05:57:43,565 INFO L272 TraceCheckUtils]: 55: Hoare triple {7497#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7497#false} is VALID [2022-04-28 05:57:43,565 INFO L290 TraceCheckUtils]: 54: Hoare triple {7497#false} assume !(#t~post6 < 20);havoc #t~post6; {7497#false} is VALID [2022-04-28 05:57:43,565 INFO L290 TraceCheckUtils]: 53: Hoare triple {7497#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7497#false} is VALID [2022-04-28 05:57:43,565 INFO L290 TraceCheckUtils]: 52: Hoare triple {7497#false} assume !(#t~post8 < 20);havoc #t~post8; {7497#false} is VALID [2022-04-28 05:57:43,565 INFO L290 TraceCheckUtils]: 51: Hoare triple {7497#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {7497#false} is VALID [2022-04-28 05:57:43,565 INFO L290 TraceCheckUtils]: 50: Hoare triple {7705#(< |main_#t~post7| 20)} assume !(#t~post7 < 20);havoc #t~post7; {7497#false} is VALID [2022-04-28 05:57:43,566 INFO L290 TraceCheckUtils]: 49: Hoare triple {7709#(< ~counter~0 20)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7705#(< |main_#t~post7| 20)} is VALID [2022-04-28 05:57:43,566 INFO L290 TraceCheckUtils]: 48: Hoare triple {7709#(< ~counter~0 20)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {7709#(< ~counter~0 20)} is VALID [2022-04-28 05:57:43,566 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {7496#true} {7709#(< ~counter~0 20)} #96#return; {7709#(< ~counter~0 20)} is VALID [2022-04-28 05:57:43,566 INFO L290 TraceCheckUtils]: 46: Hoare triple {7496#true} assume true; {7496#true} is VALID [2022-04-28 05:57:43,566 INFO L290 TraceCheckUtils]: 45: Hoare triple {7496#true} assume !(0 == ~cond); {7496#true} is VALID [2022-04-28 05:57:43,567 INFO L290 TraceCheckUtils]: 44: Hoare triple {7496#true} ~cond := #in~cond; {7496#true} is VALID [2022-04-28 05:57:43,567 INFO L272 TraceCheckUtils]: 43: Hoare triple {7709#(< ~counter~0 20)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7496#true} is VALID [2022-04-28 05:57:43,567 INFO L290 TraceCheckUtils]: 42: Hoare triple {7709#(< ~counter~0 20)} assume !!(#t~post7 < 20);havoc #t~post7; {7709#(< ~counter~0 20)} is VALID [2022-04-28 05:57:43,567 INFO L290 TraceCheckUtils]: 41: Hoare triple {7734#(< ~counter~0 19)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7709#(< ~counter~0 20)} is VALID [2022-04-28 05:57:43,568 INFO L290 TraceCheckUtils]: 40: Hoare triple {7734#(< ~counter~0 19)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {7734#(< ~counter~0 19)} is VALID [2022-04-28 05:57:43,568 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {7496#true} {7734#(< ~counter~0 19)} #96#return; {7734#(< ~counter~0 19)} is VALID [2022-04-28 05:57:43,568 INFO L290 TraceCheckUtils]: 38: Hoare triple {7496#true} assume true; {7496#true} is VALID [2022-04-28 05:57:43,568 INFO L290 TraceCheckUtils]: 37: Hoare triple {7496#true} assume !(0 == ~cond); {7496#true} is VALID [2022-04-28 05:57:43,568 INFO L290 TraceCheckUtils]: 36: Hoare triple {7496#true} ~cond := #in~cond; {7496#true} is VALID [2022-04-28 05:57:43,568 INFO L272 TraceCheckUtils]: 35: Hoare triple {7734#(< ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7496#true} is VALID [2022-04-28 05:57:43,569 INFO L290 TraceCheckUtils]: 34: Hoare triple {7734#(< ~counter~0 19)} assume !!(#t~post7 < 20);havoc #t~post7; {7734#(< ~counter~0 19)} is VALID [2022-04-28 05:57:43,569 INFO L290 TraceCheckUtils]: 33: Hoare triple {7759#(< ~counter~0 18)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7734#(< ~counter~0 19)} is VALID [2022-04-28 05:57:43,569 INFO L290 TraceCheckUtils]: 32: Hoare triple {7759#(< ~counter~0 18)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {7759#(< ~counter~0 18)} is VALID [2022-04-28 05:57:43,570 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {7496#true} {7759#(< ~counter~0 18)} #96#return; {7759#(< ~counter~0 18)} is VALID [2022-04-28 05:57:43,570 INFO L290 TraceCheckUtils]: 30: Hoare triple {7496#true} assume true; {7496#true} is VALID [2022-04-28 05:57:43,570 INFO L290 TraceCheckUtils]: 29: Hoare triple {7496#true} assume !(0 == ~cond); {7496#true} is VALID [2022-04-28 05:57:43,570 INFO L290 TraceCheckUtils]: 28: Hoare triple {7496#true} ~cond := #in~cond; {7496#true} is VALID [2022-04-28 05:57:43,570 INFO L272 TraceCheckUtils]: 27: Hoare triple {7759#(< ~counter~0 18)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7496#true} is VALID [2022-04-28 05:57:43,570 INFO L290 TraceCheckUtils]: 26: Hoare triple {7759#(< ~counter~0 18)} assume !!(#t~post7 < 20);havoc #t~post7; {7759#(< ~counter~0 18)} is VALID [2022-04-28 05:57:43,571 INFO L290 TraceCheckUtils]: 25: Hoare triple {7784#(< ~counter~0 17)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7759#(< ~counter~0 18)} is VALID [2022-04-28 05:57:43,571 INFO L290 TraceCheckUtils]: 24: Hoare triple {7784#(< ~counter~0 17)} assume !!(0 != ~r~0); {7784#(< ~counter~0 17)} is VALID [2022-04-28 05:57:43,572 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {7496#true} {7784#(< ~counter~0 17)} #94#return; {7784#(< ~counter~0 17)} is VALID [2022-04-28 05:57:43,572 INFO L290 TraceCheckUtils]: 22: Hoare triple {7496#true} assume true; {7496#true} is VALID [2022-04-28 05:57:43,572 INFO L290 TraceCheckUtils]: 21: Hoare triple {7496#true} assume !(0 == ~cond); {7496#true} is VALID [2022-04-28 05:57:43,572 INFO L290 TraceCheckUtils]: 20: Hoare triple {7496#true} ~cond := #in~cond; {7496#true} is VALID [2022-04-28 05:57:43,572 INFO L272 TraceCheckUtils]: 19: Hoare triple {7784#(< ~counter~0 17)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7496#true} is VALID [2022-04-28 05:57:43,572 INFO L290 TraceCheckUtils]: 18: Hoare triple {7784#(< ~counter~0 17)} assume !!(#t~post6 < 20);havoc #t~post6; {7784#(< ~counter~0 17)} is VALID [2022-04-28 05:57:43,572 INFO L290 TraceCheckUtils]: 17: Hoare triple {7809#(< ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7784#(< ~counter~0 17)} is VALID [2022-04-28 05:57:43,573 INFO L290 TraceCheckUtils]: 16: Hoare triple {7809#(< ~counter~0 16)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {7809#(< ~counter~0 16)} is VALID [2022-04-28 05:57:43,573 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7496#true} {7809#(< ~counter~0 16)} #92#return; {7809#(< ~counter~0 16)} is VALID [2022-04-28 05:57:43,573 INFO L290 TraceCheckUtils]: 14: Hoare triple {7496#true} assume true; {7496#true} is VALID [2022-04-28 05:57:43,573 INFO L290 TraceCheckUtils]: 13: Hoare triple {7496#true} assume !(0 == ~cond); {7496#true} is VALID [2022-04-28 05:57:43,573 INFO L290 TraceCheckUtils]: 12: Hoare triple {7496#true} ~cond := #in~cond; {7496#true} is VALID [2022-04-28 05:57:43,573 INFO L272 TraceCheckUtils]: 11: Hoare triple {7809#(< ~counter~0 16)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {7496#true} is VALID [2022-04-28 05:57:43,574 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7496#true} {7809#(< ~counter~0 16)} #90#return; {7809#(< ~counter~0 16)} is VALID [2022-04-28 05:57:43,574 INFO L290 TraceCheckUtils]: 9: Hoare triple {7496#true} assume true; {7496#true} is VALID [2022-04-28 05:57:43,574 INFO L290 TraceCheckUtils]: 8: Hoare triple {7496#true} assume !(0 == ~cond); {7496#true} is VALID [2022-04-28 05:57:43,574 INFO L290 TraceCheckUtils]: 7: Hoare triple {7496#true} ~cond := #in~cond; {7496#true} is VALID [2022-04-28 05:57:43,574 INFO L272 TraceCheckUtils]: 6: Hoare triple {7809#(< ~counter~0 16)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {7496#true} is VALID [2022-04-28 05:57:43,574 INFO L290 TraceCheckUtils]: 5: Hoare triple {7809#(< ~counter~0 16)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {7809#(< ~counter~0 16)} is VALID [2022-04-28 05:57:43,575 INFO L272 TraceCheckUtils]: 4: Hoare triple {7809#(< ~counter~0 16)} call #t~ret9 := main(); {7809#(< ~counter~0 16)} is VALID [2022-04-28 05:57:43,575 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7809#(< ~counter~0 16)} {7496#true} #102#return; {7809#(< ~counter~0 16)} is VALID [2022-04-28 05:57:43,575 INFO L290 TraceCheckUtils]: 2: Hoare triple {7809#(< ~counter~0 16)} assume true; {7809#(< ~counter~0 16)} is VALID [2022-04-28 05:57:43,576 INFO L290 TraceCheckUtils]: 1: Hoare triple {7496#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {7809#(< ~counter~0 16)} is VALID [2022-04-28 05:57:43,576 INFO L272 TraceCheckUtils]: 0: Hoare triple {7496#true} call ULTIMATE.init(); {7496#true} is VALID [2022-04-28 05:57:43,576 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 05:57:43,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:57:43,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144710632] [2022-04-28 05:57:43,576 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:57:43,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1438136901] [2022-04-28 05:57:43,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1438136901] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:57:43,576 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:57:43,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-28 05:57:43,577 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:57:43,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1367043492] [2022-04-28 05:57:43,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1367043492] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:57:43,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:57:43,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 05:57:43,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917934213] [2022-04-28 05:57:43,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:57:43,577 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) Word has length 59 [2022-04-28 05:57:43,577 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:57:43,577 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 05:57:43,615 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:57:43,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 05:57:43,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:57:43,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 05:57:43,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-28 05:57:43,616 INFO L87 Difference]: Start difference. First operand 94 states and 116 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 05:57:43,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:43,917 INFO L93 Difference]: Finished difference Result 133 states and 171 transitions. [2022-04-28 05:57:43,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 05:57:43,917 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) Word has length 59 [2022-04-28 05:57:43,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:57:43,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 05:57:43,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 117 transitions. [2022-04-28 05:57:43,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 05:57:43,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 117 transitions. [2022-04-28 05:57:43,920 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 117 transitions. [2022-04-28 05:57:44,008 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:57:44,010 INFO L225 Difference]: With dead ends: 133 [2022-04-28 05:57:44,010 INFO L226 Difference]: Without dead ends: 96 [2022-04-28 05:57:44,011 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=165, Unknown=0, NotChecked=0, Total=272 [2022-04-28 05:57:44,011 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 35 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 05:57:44,011 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 146 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 05:57:44,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-04-28 05:57:44,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2022-04-28 05:57:44,095 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:57:44,095 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand has 96 states, 70 states have (on average 1.2) internal successors, (84), 70 states have internal predecessors, (84), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 05:57:44,095 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand has 96 states, 70 states have (on average 1.2) internal successors, (84), 70 states have internal predecessors, (84), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 05:57:44,096 INFO L87 Difference]: Start difference. First operand 96 states. Second operand has 96 states, 70 states have (on average 1.2) internal successors, (84), 70 states have internal predecessors, (84), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 05:57:44,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:44,098 INFO L93 Difference]: Finished difference Result 96 states and 118 transitions. [2022-04-28 05:57:44,098 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 118 transitions. [2022-04-28 05:57:44,098 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:57:44,098 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:57:44,099 INFO L74 IsIncluded]: Start isIncluded. First operand has 96 states, 70 states have (on average 1.2) internal successors, (84), 70 states have internal predecessors, (84), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 96 states. [2022-04-28 05:57:44,099 INFO L87 Difference]: Start difference. First operand has 96 states, 70 states have (on average 1.2) internal successors, (84), 70 states have internal predecessors, (84), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 96 states. [2022-04-28 05:57:44,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:44,101 INFO L93 Difference]: Finished difference Result 96 states and 118 transitions. [2022-04-28 05:57:44,101 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 118 transitions. [2022-04-28 05:57:44,101 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:57:44,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:57:44,102 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:57:44,102 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:57:44,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 70 states have (on average 1.2) internal successors, (84), 70 states have internal predecessors, (84), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 05:57:44,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 118 transitions. [2022-04-28 05:57:44,104 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 118 transitions. Word has length 59 [2022-04-28 05:57:44,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:57:44,104 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 118 transitions. [2022-04-28 05:57:44,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 05:57:44,104 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 96 states and 118 transitions. [2022-04-28 05:57:45,708 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:57:45,708 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 118 transitions. [2022-04-28 05:57:45,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-28 05:57:45,709 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:57:45,709 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:57:45,714 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-04-28 05:57:45,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-28 05:57:45,911 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:57:45,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:57:45,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1402694082, now seen corresponding path program 3 times [2022-04-28 05:57:45,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:57:45,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1148325557] [2022-04-28 05:57:45,912 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:57:45,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1402694082, now seen corresponding path program 4 times [2022-04-28 05:57:45,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:57:45,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352369976] [2022-04-28 05:57:45,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:57:45,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:57:45,931 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:57:45,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2108588581] [2022-04-28 05:57:45,931 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 05:57:45,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:57:45,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:57:45,932 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:57:45,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-28 05:57:45,987 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 05:57:45,988 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:57:45,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 05:57:46,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:57:46,004 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:57:46,296 INFO L272 TraceCheckUtils]: 0: Hoare triple {8519#true} call ULTIMATE.init(); {8519#true} is VALID [2022-04-28 05:57:46,296 INFO L290 TraceCheckUtils]: 1: Hoare triple {8519#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {8527#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:46,297 INFO L290 TraceCheckUtils]: 2: Hoare triple {8527#(<= ~counter~0 0)} assume true; {8527#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:46,297 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8527#(<= ~counter~0 0)} {8519#true} #102#return; {8527#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:46,298 INFO L272 TraceCheckUtils]: 4: Hoare triple {8527#(<= ~counter~0 0)} call #t~ret9 := main(); {8527#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:46,298 INFO L290 TraceCheckUtils]: 5: Hoare triple {8527#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {8527#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:46,299 INFO L272 TraceCheckUtils]: 6: Hoare triple {8527#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {8527#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:46,299 INFO L290 TraceCheckUtils]: 7: Hoare triple {8527#(<= ~counter~0 0)} ~cond := #in~cond; {8527#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:46,299 INFO L290 TraceCheckUtils]: 8: Hoare triple {8527#(<= ~counter~0 0)} assume !(0 == ~cond); {8527#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:46,300 INFO L290 TraceCheckUtils]: 9: Hoare triple {8527#(<= ~counter~0 0)} assume true; {8527#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:46,300 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8527#(<= ~counter~0 0)} {8527#(<= ~counter~0 0)} #90#return; {8527#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:46,300 INFO L272 TraceCheckUtils]: 11: Hoare triple {8527#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {8527#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:46,301 INFO L290 TraceCheckUtils]: 12: Hoare triple {8527#(<= ~counter~0 0)} ~cond := #in~cond; {8527#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:46,301 INFO L290 TraceCheckUtils]: 13: Hoare triple {8527#(<= ~counter~0 0)} assume !(0 == ~cond); {8527#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:46,301 INFO L290 TraceCheckUtils]: 14: Hoare triple {8527#(<= ~counter~0 0)} assume true; {8527#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:46,302 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {8527#(<= ~counter~0 0)} {8527#(<= ~counter~0 0)} #92#return; {8527#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:46,302 INFO L290 TraceCheckUtils]: 16: Hoare triple {8527#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {8527#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:46,303 INFO L290 TraceCheckUtils]: 17: Hoare triple {8527#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8576#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:46,303 INFO L290 TraceCheckUtils]: 18: Hoare triple {8576#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {8576#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:46,303 INFO L272 TraceCheckUtils]: 19: Hoare triple {8576#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8576#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:46,304 INFO L290 TraceCheckUtils]: 20: Hoare triple {8576#(<= ~counter~0 1)} ~cond := #in~cond; {8576#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:46,304 INFO L290 TraceCheckUtils]: 21: Hoare triple {8576#(<= ~counter~0 1)} assume !(0 == ~cond); {8576#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:46,304 INFO L290 TraceCheckUtils]: 22: Hoare triple {8576#(<= ~counter~0 1)} assume true; {8576#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:46,305 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {8576#(<= ~counter~0 1)} {8576#(<= ~counter~0 1)} #94#return; {8576#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:46,305 INFO L290 TraceCheckUtils]: 24: Hoare triple {8576#(<= ~counter~0 1)} assume !!(0 != ~r~0); {8576#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:46,305 INFO L290 TraceCheckUtils]: 25: Hoare triple {8576#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8601#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:46,306 INFO L290 TraceCheckUtils]: 26: Hoare triple {8601#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {8601#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:46,306 INFO L272 TraceCheckUtils]: 27: Hoare triple {8601#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8601#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:46,306 INFO L290 TraceCheckUtils]: 28: Hoare triple {8601#(<= ~counter~0 2)} ~cond := #in~cond; {8601#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:46,307 INFO L290 TraceCheckUtils]: 29: Hoare triple {8601#(<= ~counter~0 2)} assume !(0 == ~cond); {8601#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:46,307 INFO L290 TraceCheckUtils]: 30: Hoare triple {8601#(<= ~counter~0 2)} assume true; {8601#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:46,308 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {8601#(<= ~counter~0 2)} {8601#(<= ~counter~0 2)} #96#return; {8601#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:46,308 INFO L290 TraceCheckUtils]: 32: Hoare triple {8601#(<= ~counter~0 2)} assume !(~r~0 > 0); {8601#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:46,308 INFO L290 TraceCheckUtils]: 33: Hoare triple {8601#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {8626#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:46,308 INFO L290 TraceCheckUtils]: 34: Hoare triple {8626#(<= ~counter~0 3)} assume !!(#t~post8 < 20);havoc #t~post8; {8626#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:46,309 INFO L272 TraceCheckUtils]: 35: Hoare triple {8626#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8626#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:46,309 INFO L290 TraceCheckUtils]: 36: Hoare triple {8626#(<= ~counter~0 3)} ~cond := #in~cond; {8626#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:46,310 INFO L290 TraceCheckUtils]: 37: Hoare triple {8626#(<= ~counter~0 3)} assume !(0 == ~cond); {8626#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:46,310 INFO L290 TraceCheckUtils]: 38: Hoare triple {8626#(<= ~counter~0 3)} assume true; {8626#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:46,310 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {8626#(<= ~counter~0 3)} {8626#(<= ~counter~0 3)} #98#return; {8626#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:46,311 INFO L290 TraceCheckUtils]: 40: Hoare triple {8626#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {8626#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:46,311 INFO L290 TraceCheckUtils]: 41: Hoare triple {8626#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {8651#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:46,311 INFO L290 TraceCheckUtils]: 42: Hoare triple {8651#(<= ~counter~0 4)} assume !!(#t~post8 < 20);havoc #t~post8; {8651#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:46,312 INFO L272 TraceCheckUtils]: 43: Hoare triple {8651#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8651#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:46,312 INFO L290 TraceCheckUtils]: 44: Hoare triple {8651#(<= ~counter~0 4)} ~cond := #in~cond; {8651#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:46,312 INFO L290 TraceCheckUtils]: 45: Hoare triple {8651#(<= ~counter~0 4)} assume !(0 == ~cond); {8651#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:46,313 INFO L290 TraceCheckUtils]: 46: Hoare triple {8651#(<= ~counter~0 4)} assume true; {8651#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:46,313 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {8651#(<= ~counter~0 4)} {8651#(<= ~counter~0 4)} #98#return; {8651#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:46,313 INFO L290 TraceCheckUtils]: 48: Hoare triple {8651#(<= ~counter~0 4)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {8651#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:46,314 INFO L290 TraceCheckUtils]: 49: Hoare triple {8651#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {8676#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:46,314 INFO L290 TraceCheckUtils]: 50: Hoare triple {8676#(<= ~counter~0 5)} assume !!(#t~post8 < 20);havoc #t~post8; {8676#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:46,314 INFO L272 TraceCheckUtils]: 51: Hoare triple {8676#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8676#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:46,315 INFO L290 TraceCheckUtils]: 52: Hoare triple {8676#(<= ~counter~0 5)} ~cond := #in~cond; {8676#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:46,315 INFO L290 TraceCheckUtils]: 53: Hoare triple {8676#(<= ~counter~0 5)} assume !(0 == ~cond); {8676#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:46,315 INFO L290 TraceCheckUtils]: 54: Hoare triple {8676#(<= ~counter~0 5)} assume true; {8676#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:46,316 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {8676#(<= ~counter~0 5)} {8676#(<= ~counter~0 5)} #98#return; {8676#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:46,316 INFO L290 TraceCheckUtils]: 56: Hoare triple {8676#(<= ~counter~0 5)} assume !(~r~0 < 0); {8676#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:46,316 INFO L290 TraceCheckUtils]: 57: Hoare triple {8676#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8701#(<= |main_#t~post6| 5)} is VALID [2022-04-28 05:57:46,317 INFO L290 TraceCheckUtils]: 58: Hoare triple {8701#(<= |main_#t~post6| 5)} assume !(#t~post6 < 20);havoc #t~post6; {8520#false} is VALID [2022-04-28 05:57:46,317 INFO L272 TraceCheckUtils]: 59: Hoare triple {8520#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8520#false} is VALID [2022-04-28 05:57:46,317 INFO L290 TraceCheckUtils]: 60: Hoare triple {8520#false} ~cond := #in~cond; {8520#false} is VALID [2022-04-28 05:57:46,317 INFO L290 TraceCheckUtils]: 61: Hoare triple {8520#false} assume 0 == ~cond; {8520#false} is VALID [2022-04-28 05:57:46,317 INFO L290 TraceCheckUtils]: 62: Hoare triple {8520#false} assume !false; {8520#false} is VALID [2022-04-28 05:57:46,317 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 10 proven. 54 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 05:57:46,317 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:57:46,649 INFO L290 TraceCheckUtils]: 62: Hoare triple {8520#false} assume !false; {8520#false} is VALID [2022-04-28 05:57:46,650 INFO L290 TraceCheckUtils]: 61: Hoare triple {8520#false} assume 0 == ~cond; {8520#false} is VALID [2022-04-28 05:57:46,650 INFO L290 TraceCheckUtils]: 60: Hoare triple {8520#false} ~cond := #in~cond; {8520#false} is VALID [2022-04-28 05:57:46,650 INFO L272 TraceCheckUtils]: 59: Hoare triple {8520#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8520#false} is VALID [2022-04-28 05:57:46,650 INFO L290 TraceCheckUtils]: 58: Hoare triple {8729#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {8520#false} is VALID [2022-04-28 05:57:46,650 INFO L290 TraceCheckUtils]: 57: Hoare triple {8733#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8729#(< |main_#t~post6| 20)} is VALID [2022-04-28 05:57:46,651 INFO L290 TraceCheckUtils]: 56: Hoare triple {8733#(< ~counter~0 20)} assume !(~r~0 < 0); {8733#(< ~counter~0 20)} is VALID [2022-04-28 05:57:46,651 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {8519#true} {8733#(< ~counter~0 20)} #98#return; {8733#(< ~counter~0 20)} is VALID [2022-04-28 05:57:46,651 INFO L290 TraceCheckUtils]: 54: Hoare triple {8519#true} assume true; {8519#true} is VALID [2022-04-28 05:57:46,651 INFO L290 TraceCheckUtils]: 53: Hoare triple {8519#true} assume !(0 == ~cond); {8519#true} is VALID [2022-04-28 05:57:46,651 INFO L290 TraceCheckUtils]: 52: Hoare triple {8519#true} ~cond := #in~cond; {8519#true} is VALID [2022-04-28 05:57:46,651 INFO L272 TraceCheckUtils]: 51: Hoare triple {8733#(< ~counter~0 20)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8519#true} is VALID [2022-04-28 05:57:46,652 INFO L290 TraceCheckUtils]: 50: Hoare triple {8733#(< ~counter~0 20)} assume !!(#t~post8 < 20);havoc #t~post8; {8733#(< ~counter~0 20)} is VALID [2022-04-28 05:57:46,652 INFO L290 TraceCheckUtils]: 49: Hoare triple {8758#(< ~counter~0 19)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {8733#(< ~counter~0 20)} is VALID [2022-04-28 05:57:46,652 INFO L290 TraceCheckUtils]: 48: Hoare triple {8758#(< ~counter~0 19)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {8758#(< ~counter~0 19)} is VALID [2022-04-28 05:57:46,653 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {8519#true} {8758#(< ~counter~0 19)} #98#return; {8758#(< ~counter~0 19)} is VALID [2022-04-28 05:57:46,653 INFO L290 TraceCheckUtils]: 46: Hoare triple {8519#true} assume true; {8519#true} is VALID [2022-04-28 05:57:46,653 INFO L290 TraceCheckUtils]: 45: Hoare triple {8519#true} assume !(0 == ~cond); {8519#true} is VALID [2022-04-28 05:57:46,653 INFO L290 TraceCheckUtils]: 44: Hoare triple {8519#true} ~cond := #in~cond; {8519#true} is VALID [2022-04-28 05:57:46,653 INFO L272 TraceCheckUtils]: 43: Hoare triple {8758#(< ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8519#true} is VALID [2022-04-28 05:57:46,653 INFO L290 TraceCheckUtils]: 42: Hoare triple {8758#(< ~counter~0 19)} assume !!(#t~post8 < 20);havoc #t~post8; {8758#(< ~counter~0 19)} is VALID [2022-04-28 05:57:46,654 INFO L290 TraceCheckUtils]: 41: Hoare triple {8783#(< ~counter~0 18)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {8758#(< ~counter~0 19)} is VALID [2022-04-28 05:57:46,654 INFO L290 TraceCheckUtils]: 40: Hoare triple {8783#(< ~counter~0 18)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {8783#(< ~counter~0 18)} is VALID [2022-04-28 05:57:46,655 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {8519#true} {8783#(< ~counter~0 18)} #98#return; {8783#(< ~counter~0 18)} is VALID [2022-04-28 05:57:46,655 INFO L290 TraceCheckUtils]: 38: Hoare triple {8519#true} assume true; {8519#true} is VALID [2022-04-28 05:57:46,655 INFO L290 TraceCheckUtils]: 37: Hoare triple {8519#true} assume !(0 == ~cond); {8519#true} is VALID [2022-04-28 05:57:46,655 INFO L290 TraceCheckUtils]: 36: Hoare triple {8519#true} ~cond := #in~cond; {8519#true} is VALID [2022-04-28 05:57:46,655 INFO L272 TraceCheckUtils]: 35: Hoare triple {8783#(< ~counter~0 18)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8519#true} is VALID [2022-04-28 05:57:46,655 INFO L290 TraceCheckUtils]: 34: Hoare triple {8783#(< ~counter~0 18)} assume !!(#t~post8 < 20);havoc #t~post8; {8783#(< ~counter~0 18)} is VALID [2022-04-28 05:57:46,656 INFO L290 TraceCheckUtils]: 33: Hoare triple {8808#(< ~counter~0 17)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {8783#(< ~counter~0 18)} is VALID [2022-04-28 05:57:46,656 INFO L290 TraceCheckUtils]: 32: Hoare triple {8808#(< ~counter~0 17)} assume !(~r~0 > 0); {8808#(< ~counter~0 17)} is VALID [2022-04-28 05:57:46,656 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {8519#true} {8808#(< ~counter~0 17)} #96#return; {8808#(< ~counter~0 17)} is VALID [2022-04-28 05:57:46,656 INFO L290 TraceCheckUtils]: 30: Hoare triple {8519#true} assume true; {8519#true} is VALID [2022-04-28 05:57:46,656 INFO L290 TraceCheckUtils]: 29: Hoare triple {8519#true} assume !(0 == ~cond); {8519#true} is VALID [2022-04-28 05:57:46,657 INFO L290 TraceCheckUtils]: 28: Hoare triple {8519#true} ~cond := #in~cond; {8519#true} is VALID [2022-04-28 05:57:46,657 INFO L272 TraceCheckUtils]: 27: Hoare triple {8808#(< ~counter~0 17)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8519#true} is VALID [2022-04-28 05:57:46,657 INFO L290 TraceCheckUtils]: 26: Hoare triple {8808#(< ~counter~0 17)} assume !!(#t~post7 < 20);havoc #t~post7; {8808#(< ~counter~0 17)} is VALID [2022-04-28 05:57:46,657 INFO L290 TraceCheckUtils]: 25: Hoare triple {8833#(< ~counter~0 16)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8808#(< ~counter~0 17)} is VALID [2022-04-28 05:57:46,658 INFO L290 TraceCheckUtils]: 24: Hoare triple {8833#(< ~counter~0 16)} assume !!(0 != ~r~0); {8833#(< ~counter~0 16)} is VALID [2022-04-28 05:57:46,658 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {8519#true} {8833#(< ~counter~0 16)} #94#return; {8833#(< ~counter~0 16)} is VALID [2022-04-28 05:57:46,658 INFO L290 TraceCheckUtils]: 22: Hoare triple {8519#true} assume true; {8519#true} is VALID [2022-04-28 05:57:46,658 INFO L290 TraceCheckUtils]: 21: Hoare triple {8519#true} assume !(0 == ~cond); {8519#true} is VALID [2022-04-28 05:57:46,658 INFO L290 TraceCheckUtils]: 20: Hoare triple {8519#true} ~cond := #in~cond; {8519#true} is VALID [2022-04-28 05:57:46,658 INFO L272 TraceCheckUtils]: 19: Hoare triple {8833#(< ~counter~0 16)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8519#true} is VALID [2022-04-28 05:57:46,658 INFO L290 TraceCheckUtils]: 18: Hoare triple {8833#(< ~counter~0 16)} assume !!(#t~post6 < 20);havoc #t~post6; {8833#(< ~counter~0 16)} is VALID [2022-04-28 05:57:46,659 INFO L290 TraceCheckUtils]: 17: Hoare triple {8858#(< ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8833#(< ~counter~0 16)} is VALID [2022-04-28 05:57:46,659 INFO L290 TraceCheckUtils]: 16: Hoare triple {8858#(< ~counter~0 15)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {8858#(< ~counter~0 15)} is VALID [2022-04-28 05:57:46,660 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {8519#true} {8858#(< ~counter~0 15)} #92#return; {8858#(< ~counter~0 15)} is VALID [2022-04-28 05:57:46,660 INFO L290 TraceCheckUtils]: 14: Hoare triple {8519#true} assume true; {8519#true} is VALID [2022-04-28 05:57:46,660 INFO L290 TraceCheckUtils]: 13: Hoare triple {8519#true} assume !(0 == ~cond); {8519#true} is VALID [2022-04-28 05:57:46,660 INFO L290 TraceCheckUtils]: 12: Hoare triple {8519#true} ~cond := #in~cond; {8519#true} is VALID [2022-04-28 05:57:46,660 INFO L272 TraceCheckUtils]: 11: Hoare triple {8858#(< ~counter~0 15)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {8519#true} is VALID [2022-04-28 05:57:46,660 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8519#true} {8858#(< ~counter~0 15)} #90#return; {8858#(< ~counter~0 15)} is VALID [2022-04-28 05:57:46,660 INFO L290 TraceCheckUtils]: 9: Hoare triple {8519#true} assume true; {8519#true} is VALID [2022-04-28 05:57:46,660 INFO L290 TraceCheckUtils]: 8: Hoare triple {8519#true} assume !(0 == ~cond); {8519#true} is VALID [2022-04-28 05:57:46,660 INFO L290 TraceCheckUtils]: 7: Hoare triple {8519#true} ~cond := #in~cond; {8519#true} is VALID [2022-04-28 05:57:46,661 INFO L272 TraceCheckUtils]: 6: Hoare triple {8858#(< ~counter~0 15)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {8519#true} is VALID [2022-04-28 05:57:46,661 INFO L290 TraceCheckUtils]: 5: Hoare triple {8858#(< ~counter~0 15)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {8858#(< ~counter~0 15)} is VALID [2022-04-28 05:57:46,661 INFO L272 TraceCheckUtils]: 4: Hoare triple {8858#(< ~counter~0 15)} call #t~ret9 := main(); {8858#(< ~counter~0 15)} is VALID [2022-04-28 05:57:46,662 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8858#(< ~counter~0 15)} {8519#true} #102#return; {8858#(< ~counter~0 15)} is VALID [2022-04-28 05:57:46,662 INFO L290 TraceCheckUtils]: 2: Hoare triple {8858#(< ~counter~0 15)} assume true; {8858#(< ~counter~0 15)} is VALID [2022-04-28 05:57:46,662 INFO L290 TraceCheckUtils]: 1: Hoare triple {8519#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {8858#(< ~counter~0 15)} is VALID [2022-04-28 05:57:46,663 INFO L272 TraceCheckUtils]: 0: Hoare triple {8519#true} call ULTIMATE.init(); {8519#true} is VALID [2022-04-28 05:57:46,663 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-04-28 05:57:46,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:57:46,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352369976] [2022-04-28 05:57:46,663 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:57:46,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2108588581] [2022-04-28 05:57:46,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2108588581] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:57:46,663 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:57:46,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2022-04-28 05:57:46,663 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:57:46,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1148325557] [2022-04-28 05:57:46,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1148325557] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:57:46,664 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:57:46,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 05:57:46,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983680550] [2022-04-28 05:57:46,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:57:46,664 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) Word has length 63 [2022-04-28 05:57:46,664 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:57:46,665 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-28 05:57:46,723 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:57:46,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 05:57:46,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:57:46,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 05:57:46,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2022-04-28 05:57:46,724 INFO L87 Difference]: Start difference. First operand 96 states and 118 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-28 05:57:47,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:47,078 INFO L93 Difference]: Finished difference Result 116 states and 142 transitions. [2022-04-28 05:57:47,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 05:57:47,079 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) Word has length 63 [2022-04-28 05:57:47,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:57:47,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-28 05:57:47,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 115 transitions. [2022-04-28 05:57:47,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-28 05:57:47,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 115 transitions. [2022-04-28 05:57:47,082 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 115 transitions. [2022-04-28 05:57:47,165 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:57:47,167 INFO L225 Difference]: With dead ends: 116 [2022-04-28 05:57:47,167 INFO L226 Difference]: Without dead ends: 111 [2022-04-28 05:57:47,167 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=183, Unknown=0, NotChecked=0, Total=306 [2022-04-28 05:57:47,168 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 49 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 05:57:47,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 165 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 05:57:47,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-04-28 05:57:47,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 106. [2022-04-28 05:57:47,264 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:57:47,264 INFO L82 GeneralOperation]: Start isEquivalent. First operand 111 states. Second operand has 106 states, 76 states have (on average 1.1973684210526316) internal successors, (91), 78 states have internal predecessors, (91), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 05:57:47,264 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand has 106 states, 76 states have (on average 1.1973684210526316) internal successors, (91), 78 states have internal predecessors, (91), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 05:57:47,265 INFO L87 Difference]: Start difference. First operand 111 states. Second operand has 106 states, 76 states have (on average 1.1973684210526316) internal successors, (91), 78 states have internal predecessors, (91), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 05:57:47,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:47,267 INFO L93 Difference]: Finished difference Result 111 states and 137 transitions. [2022-04-28 05:57:47,267 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 137 transitions. [2022-04-28 05:57:47,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:57:47,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:57:47,268 INFO L74 IsIncluded]: Start isIncluded. First operand has 106 states, 76 states have (on average 1.1973684210526316) internal successors, (91), 78 states have internal predecessors, (91), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) Second operand 111 states. [2022-04-28 05:57:47,268 INFO L87 Difference]: Start difference. First operand has 106 states, 76 states have (on average 1.1973684210526316) internal successors, (91), 78 states have internal predecessors, (91), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) Second operand 111 states. [2022-04-28 05:57:47,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:47,270 INFO L93 Difference]: Finished difference Result 111 states and 137 transitions. [2022-04-28 05:57:47,270 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 137 transitions. [2022-04-28 05:57:47,271 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:57:47,271 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:57:47,271 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:57:47,271 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:57:47,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 76 states have (on average 1.1973684210526316) internal successors, (91), 78 states have internal predecessors, (91), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 05:57:47,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 131 transitions. [2022-04-28 05:57:47,273 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 131 transitions. Word has length 63 [2022-04-28 05:57:47,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:57:47,274 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 131 transitions. [2022-04-28 05:57:47,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-28 05:57:47,274 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 106 states and 131 transitions. [2022-04-28 05:57:47,770 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:57:47,770 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 131 transitions. [2022-04-28 05:57:47,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-28 05:57:47,770 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:57:47,770 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 4, 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, 1, 1, 1, 1, 1] [2022-04-28 05:57:47,786 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-28 05:57:47,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:57:47,971 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:57:47,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:57:47,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1823928061, now seen corresponding path program 5 times [2022-04-28 05:57:47,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:57:47,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [663933882] [2022-04-28 05:57:47,972 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:57:47,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1823928061, now seen corresponding path program 6 times [2022-04-28 05:57:47,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:57:47,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787284495] [2022-04-28 05:57:47,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:57:47,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:57:47,995 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:57:47,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1067087695] [2022-04-28 05:57:47,995 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 05:57:47,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:57:47,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:57:47,996 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:57:47,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-28 05:57:48,062 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-28 05:57:48,063 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:57:48,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 05:57:48,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:57:48,077 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:57:48,400 INFO L272 TraceCheckUtils]: 0: Hoare triple {9582#true} call ULTIMATE.init(); {9582#true} is VALID [2022-04-28 05:57:48,401 INFO L290 TraceCheckUtils]: 1: Hoare triple {9582#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {9590#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:48,401 INFO L290 TraceCheckUtils]: 2: Hoare triple {9590#(<= ~counter~0 0)} assume true; {9590#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:48,402 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9590#(<= ~counter~0 0)} {9582#true} #102#return; {9590#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:48,402 INFO L272 TraceCheckUtils]: 4: Hoare triple {9590#(<= ~counter~0 0)} call #t~ret9 := main(); {9590#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:48,403 INFO L290 TraceCheckUtils]: 5: Hoare triple {9590#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {9590#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:48,403 INFO L272 TraceCheckUtils]: 6: Hoare triple {9590#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {9590#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:48,404 INFO L290 TraceCheckUtils]: 7: Hoare triple {9590#(<= ~counter~0 0)} ~cond := #in~cond; {9590#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:48,404 INFO L290 TraceCheckUtils]: 8: Hoare triple {9590#(<= ~counter~0 0)} assume !(0 == ~cond); {9590#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:48,404 INFO L290 TraceCheckUtils]: 9: Hoare triple {9590#(<= ~counter~0 0)} assume true; {9590#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:48,405 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9590#(<= ~counter~0 0)} {9590#(<= ~counter~0 0)} #90#return; {9590#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:48,406 INFO L272 TraceCheckUtils]: 11: Hoare triple {9590#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {9590#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:48,406 INFO L290 TraceCheckUtils]: 12: Hoare triple {9590#(<= ~counter~0 0)} ~cond := #in~cond; {9590#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:48,406 INFO L290 TraceCheckUtils]: 13: Hoare triple {9590#(<= ~counter~0 0)} assume !(0 == ~cond); {9590#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:48,407 INFO L290 TraceCheckUtils]: 14: Hoare triple {9590#(<= ~counter~0 0)} assume true; {9590#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:48,407 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {9590#(<= ~counter~0 0)} {9590#(<= ~counter~0 0)} #92#return; {9590#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:48,407 INFO L290 TraceCheckUtils]: 16: Hoare triple {9590#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {9590#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:48,408 INFO L290 TraceCheckUtils]: 17: Hoare triple {9590#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9639#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:48,409 INFO L290 TraceCheckUtils]: 18: Hoare triple {9639#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {9639#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:48,409 INFO L272 TraceCheckUtils]: 19: Hoare triple {9639#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {9639#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:48,410 INFO L290 TraceCheckUtils]: 20: Hoare triple {9639#(<= ~counter~0 1)} ~cond := #in~cond; {9639#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:48,410 INFO L290 TraceCheckUtils]: 21: Hoare triple {9639#(<= ~counter~0 1)} assume !(0 == ~cond); {9639#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:48,410 INFO L290 TraceCheckUtils]: 22: Hoare triple {9639#(<= ~counter~0 1)} assume true; {9639#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:48,411 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {9639#(<= ~counter~0 1)} {9639#(<= ~counter~0 1)} #94#return; {9639#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:48,411 INFO L290 TraceCheckUtils]: 24: Hoare triple {9639#(<= ~counter~0 1)} assume !!(0 != ~r~0); {9639#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:48,412 INFO L290 TraceCheckUtils]: 25: Hoare triple {9639#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {9664#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:48,412 INFO L290 TraceCheckUtils]: 26: Hoare triple {9664#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {9664#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:48,413 INFO L272 TraceCheckUtils]: 27: Hoare triple {9664#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {9664#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:48,413 INFO L290 TraceCheckUtils]: 28: Hoare triple {9664#(<= ~counter~0 2)} ~cond := #in~cond; {9664#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:48,414 INFO L290 TraceCheckUtils]: 29: Hoare triple {9664#(<= ~counter~0 2)} assume !(0 == ~cond); {9664#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:48,414 INFO L290 TraceCheckUtils]: 30: Hoare triple {9664#(<= ~counter~0 2)} assume true; {9664#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:48,415 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {9664#(<= ~counter~0 2)} {9664#(<= ~counter~0 2)} #96#return; {9664#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:48,415 INFO L290 TraceCheckUtils]: 32: Hoare triple {9664#(<= ~counter~0 2)} assume !(~r~0 > 0); {9664#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:48,416 INFO L290 TraceCheckUtils]: 33: Hoare triple {9664#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {9689#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:48,416 INFO L290 TraceCheckUtils]: 34: Hoare triple {9689#(<= ~counter~0 3)} assume !!(#t~post8 < 20);havoc #t~post8; {9689#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:48,417 INFO L272 TraceCheckUtils]: 35: Hoare triple {9689#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {9689#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:48,417 INFO L290 TraceCheckUtils]: 36: Hoare triple {9689#(<= ~counter~0 3)} ~cond := #in~cond; {9689#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:48,417 INFO L290 TraceCheckUtils]: 37: Hoare triple {9689#(<= ~counter~0 3)} assume !(0 == ~cond); {9689#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:48,418 INFO L290 TraceCheckUtils]: 38: Hoare triple {9689#(<= ~counter~0 3)} assume true; {9689#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:48,418 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {9689#(<= ~counter~0 3)} {9689#(<= ~counter~0 3)} #98#return; {9689#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:48,419 INFO L290 TraceCheckUtils]: 40: Hoare triple {9689#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {9689#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:48,419 INFO L290 TraceCheckUtils]: 41: Hoare triple {9689#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {9714#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:48,420 INFO L290 TraceCheckUtils]: 42: Hoare triple {9714#(<= ~counter~0 4)} assume !!(#t~post8 < 20);havoc #t~post8; {9714#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:48,420 INFO L272 TraceCheckUtils]: 43: Hoare triple {9714#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {9714#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:48,421 INFO L290 TraceCheckUtils]: 44: Hoare triple {9714#(<= ~counter~0 4)} ~cond := #in~cond; {9714#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:48,421 INFO L290 TraceCheckUtils]: 45: Hoare triple {9714#(<= ~counter~0 4)} assume !(0 == ~cond); {9714#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:48,422 INFO L290 TraceCheckUtils]: 46: Hoare triple {9714#(<= ~counter~0 4)} assume true; {9714#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:48,422 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {9714#(<= ~counter~0 4)} {9714#(<= ~counter~0 4)} #98#return; {9714#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:48,423 INFO L290 TraceCheckUtils]: 48: Hoare triple {9714#(<= ~counter~0 4)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {9714#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:48,423 INFO L290 TraceCheckUtils]: 49: Hoare triple {9714#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {9739#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:48,424 INFO L290 TraceCheckUtils]: 50: Hoare triple {9739#(<= ~counter~0 5)} assume !!(#t~post8 < 20);havoc #t~post8; {9739#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:48,424 INFO L272 TraceCheckUtils]: 51: Hoare triple {9739#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {9739#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:48,425 INFO L290 TraceCheckUtils]: 52: Hoare triple {9739#(<= ~counter~0 5)} ~cond := #in~cond; {9739#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:48,425 INFO L290 TraceCheckUtils]: 53: Hoare triple {9739#(<= ~counter~0 5)} assume !(0 == ~cond); {9739#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:48,426 INFO L290 TraceCheckUtils]: 54: Hoare triple {9739#(<= ~counter~0 5)} assume true; {9739#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:48,426 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {9739#(<= ~counter~0 5)} {9739#(<= ~counter~0 5)} #98#return; {9739#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:48,427 INFO L290 TraceCheckUtils]: 56: Hoare triple {9739#(<= ~counter~0 5)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {9739#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:48,427 INFO L290 TraceCheckUtils]: 57: Hoare triple {9739#(<= ~counter~0 5)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {9764#(<= |main_#t~post8| 5)} is VALID [2022-04-28 05:57:48,427 INFO L290 TraceCheckUtils]: 58: Hoare triple {9764#(<= |main_#t~post8| 5)} assume !(#t~post8 < 20);havoc #t~post8; {9583#false} is VALID [2022-04-28 05:57:48,428 INFO L290 TraceCheckUtils]: 59: Hoare triple {9583#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9583#false} is VALID [2022-04-28 05:57:48,428 INFO L290 TraceCheckUtils]: 60: Hoare triple {9583#false} assume !(#t~post6 < 20);havoc #t~post6; {9583#false} is VALID [2022-04-28 05:57:48,428 INFO L272 TraceCheckUtils]: 61: Hoare triple {9583#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {9583#false} is VALID [2022-04-28 05:57:48,428 INFO L290 TraceCheckUtils]: 62: Hoare triple {9583#false} ~cond := #in~cond; {9583#false} is VALID [2022-04-28 05:57:48,428 INFO L290 TraceCheckUtils]: 63: Hoare triple {9583#false} assume 0 == ~cond; {9583#false} is VALID [2022-04-28 05:57:48,428 INFO L290 TraceCheckUtils]: 64: Hoare triple {9583#false} assume !false; {9583#false} is VALID [2022-04-28 05:57:48,428 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 12 proven. 58 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 05:57:48,428 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:57:48,799 INFO L290 TraceCheckUtils]: 64: Hoare triple {9583#false} assume !false; {9583#false} is VALID [2022-04-28 05:57:48,799 INFO L290 TraceCheckUtils]: 63: Hoare triple {9583#false} assume 0 == ~cond; {9583#false} is VALID [2022-04-28 05:57:48,799 INFO L290 TraceCheckUtils]: 62: Hoare triple {9583#false} ~cond := #in~cond; {9583#false} is VALID [2022-04-28 05:57:48,799 INFO L272 TraceCheckUtils]: 61: Hoare triple {9583#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {9583#false} is VALID [2022-04-28 05:57:48,799 INFO L290 TraceCheckUtils]: 60: Hoare triple {9583#false} assume !(#t~post6 < 20);havoc #t~post6; {9583#false} is VALID [2022-04-28 05:57:48,799 INFO L290 TraceCheckUtils]: 59: Hoare triple {9583#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9583#false} is VALID [2022-04-28 05:57:48,803 INFO L290 TraceCheckUtils]: 58: Hoare triple {9804#(< |main_#t~post8| 20)} assume !(#t~post8 < 20);havoc #t~post8; {9583#false} is VALID [2022-04-28 05:57:48,803 INFO L290 TraceCheckUtils]: 57: Hoare triple {9808#(< ~counter~0 20)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {9804#(< |main_#t~post8| 20)} is VALID [2022-04-28 05:57:48,803 INFO L290 TraceCheckUtils]: 56: Hoare triple {9808#(< ~counter~0 20)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {9808#(< ~counter~0 20)} is VALID [2022-04-28 05:57:48,804 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {9582#true} {9808#(< ~counter~0 20)} #98#return; {9808#(< ~counter~0 20)} is VALID [2022-04-28 05:57:48,804 INFO L290 TraceCheckUtils]: 54: Hoare triple {9582#true} assume true; {9582#true} is VALID [2022-04-28 05:57:48,804 INFO L290 TraceCheckUtils]: 53: Hoare triple {9582#true} assume !(0 == ~cond); {9582#true} is VALID [2022-04-28 05:57:48,804 INFO L290 TraceCheckUtils]: 52: Hoare triple {9582#true} ~cond := #in~cond; {9582#true} is VALID [2022-04-28 05:57:48,804 INFO L272 TraceCheckUtils]: 51: Hoare triple {9808#(< ~counter~0 20)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {9582#true} is VALID [2022-04-28 05:57:48,805 INFO L290 TraceCheckUtils]: 50: Hoare triple {9808#(< ~counter~0 20)} assume !!(#t~post8 < 20);havoc #t~post8; {9808#(< ~counter~0 20)} is VALID [2022-04-28 05:57:48,805 INFO L290 TraceCheckUtils]: 49: Hoare triple {9833#(< ~counter~0 19)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {9808#(< ~counter~0 20)} is VALID [2022-04-28 05:57:48,805 INFO L290 TraceCheckUtils]: 48: Hoare triple {9833#(< ~counter~0 19)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {9833#(< ~counter~0 19)} is VALID [2022-04-28 05:57:48,806 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {9582#true} {9833#(< ~counter~0 19)} #98#return; {9833#(< ~counter~0 19)} is VALID [2022-04-28 05:57:48,806 INFO L290 TraceCheckUtils]: 46: Hoare triple {9582#true} assume true; {9582#true} is VALID [2022-04-28 05:57:48,806 INFO L290 TraceCheckUtils]: 45: Hoare triple {9582#true} assume !(0 == ~cond); {9582#true} is VALID [2022-04-28 05:57:48,806 INFO L290 TraceCheckUtils]: 44: Hoare triple {9582#true} ~cond := #in~cond; {9582#true} is VALID [2022-04-28 05:57:48,806 INFO L272 TraceCheckUtils]: 43: Hoare triple {9833#(< ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {9582#true} is VALID [2022-04-28 05:57:48,806 INFO L290 TraceCheckUtils]: 42: Hoare triple {9833#(< ~counter~0 19)} assume !!(#t~post8 < 20);havoc #t~post8; {9833#(< ~counter~0 19)} is VALID [2022-04-28 05:57:48,807 INFO L290 TraceCheckUtils]: 41: Hoare triple {9858#(< ~counter~0 18)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {9833#(< ~counter~0 19)} is VALID [2022-04-28 05:57:48,807 INFO L290 TraceCheckUtils]: 40: Hoare triple {9858#(< ~counter~0 18)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {9858#(< ~counter~0 18)} is VALID [2022-04-28 05:57:48,808 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {9582#true} {9858#(< ~counter~0 18)} #98#return; {9858#(< ~counter~0 18)} is VALID [2022-04-28 05:57:48,808 INFO L290 TraceCheckUtils]: 38: Hoare triple {9582#true} assume true; {9582#true} is VALID [2022-04-28 05:57:48,808 INFO L290 TraceCheckUtils]: 37: Hoare triple {9582#true} assume !(0 == ~cond); {9582#true} is VALID [2022-04-28 05:57:48,808 INFO L290 TraceCheckUtils]: 36: Hoare triple {9582#true} ~cond := #in~cond; {9582#true} is VALID [2022-04-28 05:57:48,808 INFO L272 TraceCheckUtils]: 35: Hoare triple {9858#(< ~counter~0 18)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {9582#true} is VALID [2022-04-28 05:57:48,808 INFO L290 TraceCheckUtils]: 34: Hoare triple {9858#(< ~counter~0 18)} assume !!(#t~post8 < 20);havoc #t~post8; {9858#(< ~counter~0 18)} is VALID [2022-04-28 05:57:48,809 INFO L290 TraceCheckUtils]: 33: Hoare triple {9883#(< ~counter~0 17)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {9858#(< ~counter~0 18)} is VALID [2022-04-28 05:57:48,809 INFO L290 TraceCheckUtils]: 32: Hoare triple {9883#(< ~counter~0 17)} assume !(~r~0 > 0); {9883#(< ~counter~0 17)} is VALID [2022-04-28 05:57:48,809 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {9582#true} {9883#(< ~counter~0 17)} #96#return; {9883#(< ~counter~0 17)} is VALID [2022-04-28 05:57:48,809 INFO L290 TraceCheckUtils]: 30: Hoare triple {9582#true} assume true; {9582#true} is VALID [2022-04-28 05:57:48,809 INFO L290 TraceCheckUtils]: 29: Hoare triple {9582#true} assume !(0 == ~cond); {9582#true} is VALID [2022-04-28 05:57:48,810 INFO L290 TraceCheckUtils]: 28: Hoare triple {9582#true} ~cond := #in~cond; {9582#true} is VALID [2022-04-28 05:57:48,810 INFO L272 TraceCheckUtils]: 27: Hoare triple {9883#(< ~counter~0 17)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {9582#true} is VALID [2022-04-28 05:57:48,810 INFO L290 TraceCheckUtils]: 26: Hoare triple {9883#(< ~counter~0 17)} assume !!(#t~post7 < 20);havoc #t~post7; {9883#(< ~counter~0 17)} is VALID [2022-04-28 05:57:48,810 INFO L290 TraceCheckUtils]: 25: Hoare triple {9908#(< ~counter~0 16)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {9883#(< ~counter~0 17)} is VALID [2022-04-28 05:57:48,811 INFO L290 TraceCheckUtils]: 24: Hoare triple {9908#(< ~counter~0 16)} assume !!(0 != ~r~0); {9908#(< ~counter~0 16)} is VALID [2022-04-28 05:57:48,811 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {9582#true} {9908#(< ~counter~0 16)} #94#return; {9908#(< ~counter~0 16)} is VALID [2022-04-28 05:57:48,811 INFO L290 TraceCheckUtils]: 22: Hoare triple {9582#true} assume true; {9582#true} is VALID [2022-04-28 05:57:48,811 INFO L290 TraceCheckUtils]: 21: Hoare triple {9582#true} assume !(0 == ~cond); {9582#true} is VALID [2022-04-28 05:57:48,811 INFO L290 TraceCheckUtils]: 20: Hoare triple {9582#true} ~cond := #in~cond; {9582#true} is VALID [2022-04-28 05:57:48,811 INFO L272 TraceCheckUtils]: 19: Hoare triple {9908#(< ~counter~0 16)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {9582#true} is VALID [2022-04-28 05:57:48,812 INFO L290 TraceCheckUtils]: 18: Hoare triple {9908#(< ~counter~0 16)} assume !!(#t~post6 < 20);havoc #t~post6; {9908#(< ~counter~0 16)} is VALID [2022-04-28 05:57:48,812 INFO L290 TraceCheckUtils]: 17: Hoare triple {9933#(< ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9908#(< ~counter~0 16)} is VALID [2022-04-28 05:57:48,812 INFO L290 TraceCheckUtils]: 16: Hoare triple {9933#(< ~counter~0 15)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {9933#(< ~counter~0 15)} is VALID [2022-04-28 05:57:48,813 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {9582#true} {9933#(< ~counter~0 15)} #92#return; {9933#(< ~counter~0 15)} is VALID [2022-04-28 05:57:48,813 INFO L290 TraceCheckUtils]: 14: Hoare triple {9582#true} assume true; {9582#true} is VALID [2022-04-28 05:57:48,813 INFO L290 TraceCheckUtils]: 13: Hoare triple {9582#true} assume !(0 == ~cond); {9582#true} is VALID [2022-04-28 05:57:48,813 INFO L290 TraceCheckUtils]: 12: Hoare triple {9582#true} ~cond := #in~cond; {9582#true} is VALID [2022-04-28 05:57:48,813 INFO L272 TraceCheckUtils]: 11: Hoare triple {9933#(< ~counter~0 15)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {9582#true} is VALID [2022-04-28 05:57:48,813 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9582#true} {9933#(< ~counter~0 15)} #90#return; {9933#(< ~counter~0 15)} is VALID [2022-04-28 05:57:48,813 INFO L290 TraceCheckUtils]: 9: Hoare triple {9582#true} assume true; {9582#true} is VALID [2022-04-28 05:57:48,813 INFO L290 TraceCheckUtils]: 8: Hoare triple {9582#true} assume !(0 == ~cond); {9582#true} is VALID [2022-04-28 05:57:48,814 INFO L290 TraceCheckUtils]: 7: Hoare triple {9582#true} ~cond := #in~cond; {9582#true} is VALID [2022-04-28 05:57:48,814 INFO L272 TraceCheckUtils]: 6: Hoare triple {9933#(< ~counter~0 15)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {9582#true} is VALID [2022-04-28 05:57:48,814 INFO L290 TraceCheckUtils]: 5: Hoare triple {9933#(< ~counter~0 15)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {9933#(< ~counter~0 15)} is VALID [2022-04-28 05:57:48,814 INFO L272 TraceCheckUtils]: 4: Hoare triple {9933#(< ~counter~0 15)} call #t~ret9 := main(); {9933#(< ~counter~0 15)} is VALID [2022-04-28 05:57:48,814 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9933#(< ~counter~0 15)} {9582#true} #102#return; {9933#(< ~counter~0 15)} is VALID [2022-04-28 05:57:48,815 INFO L290 TraceCheckUtils]: 2: Hoare triple {9933#(< ~counter~0 15)} assume true; {9933#(< ~counter~0 15)} is VALID [2022-04-28 05:57:48,815 INFO L290 TraceCheckUtils]: 1: Hoare triple {9582#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {9933#(< ~counter~0 15)} is VALID [2022-04-28 05:57:48,815 INFO L272 TraceCheckUtils]: 0: Hoare triple {9582#true} call ULTIMATE.init(); {9582#true} is VALID [2022-04-28 05:57:48,815 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-04-28 05:57:48,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:57:48,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787284495] [2022-04-28 05:57:48,816 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:57:48,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1067087695] [2022-04-28 05:57:48,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1067087695] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:57:48,816 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:57:48,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2022-04-28 05:57:48,816 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:57:48,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [663933882] [2022-04-28 05:57:48,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [663933882] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:57:48,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:57:48,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 05:57:48,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416274221] [2022-04-28 05:57:48,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:57:48,817 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) Word has length 65 [2022-04-28 05:57:48,817 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:57:48,817 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-28 05:57:48,859 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:57:48,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 05:57:48,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:57:48,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 05:57:48,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2022-04-28 05:57:48,860 INFO L87 Difference]: Start difference. First operand 106 states and 131 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-28 05:57:49,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:49,236 INFO L93 Difference]: Finished difference Result 149 states and 191 transitions. [2022-04-28 05:57:49,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 05:57:49,236 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) Word has length 65 [2022-04-28 05:57:49,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:57:49,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-28 05:57:49,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 137 transitions. [2022-04-28 05:57:49,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-28 05:57:49,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 137 transitions. [2022-04-28 05:57:49,240 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 137 transitions. [2022-04-28 05:57:49,336 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:57:49,338 INFO L225 Difference]: With dead ends: 149 [2022-04-28 05:57:49,338 INFO L226 Difference]: Without dead ends: 112 [2022-04-28 05:57:49,338 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=135, Invalid=207, Unknown=0, NotChecked=0, Total=342 [2022-04-28 05:57:49,339 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 55 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 05:57:49,339 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 155 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 05:57:49,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-04-28 05:57:49,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 109. [2022-04-28 05:57:49,441 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:57:49,441 INFO L82 GeneralOperation]: Start isEquivalent. First operand 112 states. Second operand has 109 states, 79 states have (on average 1.2025316455696202) internal successors, (95), 80 states have internal predecessors, (95), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 05:57:49,441 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand has 109 states, 79 states have (on average 1.2025316455696202) internal successors, (95), 80 states have internal predecessors, (95), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 05:57:49,441 INFO L87 Difference]: Start difference. First operand 112 states. Second operand has 109 states, 79 states have (on average 1.2025316455696202) internal successors, (95), 80 states have internal predecessors, (95), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 05:57:49,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:49,444 INFO L93 Difference]: Finished difference Result 112 states and 138 transitions. [2022-04-28 05:57:49,444 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 138 transitions. [2022-04-28 05:57:49,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:57:49,444 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:57:49,444 INFO L74 IsIncluded]: Start isIncluded. First operand has 109 states, 79 states have (on average 1.2025316455696202) internal successors, (95), 80 states have internal predecessors, (95), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand 112 states. [2022-04-28 05:57:49,445 INFO L87 Difference]: Start difference. First operand has 109 states, 79 states have (on average 1.2025316455696202) internal successors, (95), 80 states have internal predecessors, (95), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand 112 states. [2022-04-28 05:57:49,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:49,447 INFO L93 Difference]: Finished difference Result 112 states and 138 transitions. [2022-04-28 05:57:49,447 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 138 transitions. [2022-04-28 05:57:49,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:57:49,447 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:57:49,447 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:57:49,448 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:57:49,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 79 states have (on average 1.2025316455696202) internal successors, (95), 80 states have internal predecessors, (95), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 05:57:49,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 135 transitions. [2022-04-28 05:57:49,450 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 135 transitions. Word has length 65 [2022-04-28 05:57:49,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:57:49,450 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 135 transitions. [2022-04-28 05:57:49,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-28 05:57:49,451 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 109 states and 135 transitions. [2022-04-28 05:57:51,620 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 134 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 05:57:51,621 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 135 transitions. [2022-04-28 05:57:51,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-28 05:57:51,622 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:57:51,622 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:57:51,641 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-28 05:57:51,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-04-28 05:57:51,835 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:57:51,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:57:51,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1211810838, now seen corresponding path program 1 times [2022-04-28 05:57:51,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:57:51,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2026586848] [2022-04-28 05:57:51,836 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:57:51,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1211810838, now seen corresponding path program 2 times [2022-04-28 05:57:51,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:57:51,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235481796] [2022-04-28 05:57:51,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:57:51,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:57:51,847 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:57:51,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1415976963] [2022-04-28 05:57:51,847 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:57:51,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:57:51,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:57:51,848 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:57:51,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-28 05:57:51,894 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:57:51,894 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:57:51,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 05:57:51,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:57:51,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:57:52,226 INFO L272 TraceCheckUtils]: 0: Hoare triple {10733#true} call ULTIMATE.init(); {10733#true} is VALID [2022-04-28 05:57:52,227 INFO L290 TraceCheckUtils]: 1: Hoare triple {10733#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {10741#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:52,228 INFO L290 TraceCheckUtils]: 2: Hoare triple {10741#(<= ~counter~0 0)} assume true; {10741#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:52,228 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10741#(<= ~counter~0 0)} {10733#true} #102#return; {10741#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:52,228 INFO L272 TraceCheckUtils]: 4: Hoare triple {10741#(<= ~counter~0 0)} call #t~ret9 := main(); {10741#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:52,229 INFO L290 TraceCheckUtils]: 5: Hoare triple {10741#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {10741#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:52,229 INFO L272 TraceCheckUtils]: 6: Hoare triple {10741#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {10741#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:52,230 INFO L290 TraceCheckUtils]: 7: Hoare triple {10741#(<= ~counter~0 0)} ~cond := #in~cond; {10741#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:52,230 INFO L290 TraceCheckUtils]: 8: Hoare triple {10741#(<= ~counter~0 0)} assume !(0 == ~cond); {10741#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:52,231 INFO L290 TraceCheckUtils]: 9: Hoare triple {10741#(<= ~counter~0 0)} assume true; {10741#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:52,231 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10741#(<= ~counter~0 0)} {10741#(<= ~counter~0 0)} #90#return; {10741#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:52,232 INFO L272 TraceCheckUtils]: 11: Hoare triple {10741#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {10741#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:52,232 INFO L290 TraceCheckUtils]: 12: Hoare triple {10741#(<= ~counter~0 0)} ~cond := #in~cond; {10741#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:52,232 INFO L290 TraceCheckUtils]: 13: Hoare triple {10741#(<= ~counter~0 0)} assume !(0 == ~cond); {10741#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:52,232 INFO L290 TraceCheckUtils]: 14: Hoare triple {10741#(<= ~counter~0 0)} assume true; {10741#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:52,233 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {10741#(<= ~counter~0 0)} {10741#(<= ~counter~0 0)} #92#return; {10741#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:52,233 INFO L290 TraceCheckUtils]: 16: Hoare triple {10741#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {10741#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:52,234 INFO L290 TraceCheckUtils]: 17: Hoare triple {10741#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10790#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:52,234 INFO L290 TraceCheckUtils]: 18: Hoare triple {10790#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {10790#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:52,235 INFO L272 TraceCheckUtils]: 19: Hoare triple {10790#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10790#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:52,235 INFO L290 TraceCheckUtils]: 20: Hoare triple {10790#(<= ~counter~0 1)} ~cond := #in~cond; {10790#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:52,235 INFO L290 TraceCheckUtils]: 21: Hoare triple {10790#(<= ~counter~0 1)} assume !(0 == ~cond); {10790#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:52,235 INFO L290 TraceCheckUtils]: 22: Hoare triple {10790#(<= ~counter~0 1)} assume true; {10790#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:52,236 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {10790#(<= ~counter~0 1)} {10790#(<= ~counter~0 1)} #94#return; {10790#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:52,236 INFO L290 TraceCheckUtils]: 24: Hoare triple {10790#(<= ~counter~0 1)} assume !!(0 != ~r~0); {10790#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:52,237 INFO L290 TraceCheckUtils]: 25: Hoare triple {10790#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {10815#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:52,237 INFO L290 TraceCheckUtils]: 26: Hoare triple {10815#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {10815#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:52,237 INFO L272 TraceCheckUtils]: 27: Hoare triple {10815#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10815#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:52,238 INFO L290 TraceCheckUtils]: 28: Hoare triple {10815#(<= ~counter~0 2)} ~cond := #in~cond; {10815#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:52,238 INFO L290 TraceCheckUtils]: 29: Hoare triple {10815#(<= ~counter~0 2)} assume !(0 == ~cond); {10815#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:52,238 INFO L290 TraceCheckUtils]: 30: Hoare triple {10815#(<= ~counter~0 2)} assume true; {10815#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:52,239 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {10815#(<= ~counter~0 2)} {10815#(<= ~counter~0 2)} #96#return; {10815#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:52,239 INFO L290 TraceCheckUtils]: 32: Hoare triple {10815#(<= ~counter~0 2)} assume !(~r~0 > 0); {10815#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:52,239 INFO L290 TraceCheckUtils]: 33: Hoare triple {10815#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {10840#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:52,240 INFO L290 TraceCheckUtils]: 34: Hoare triple {10840#(<= ~counter~0 3)} assume !!(#t~post8 < 20);havoc #t~post8; {10840#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:52,240 INFO L272 TraceCheckUtils]: 35: Hoare triple {10840#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10840#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:52,240 INFO L290 TraceCheckUtils]: 36: Hoare triple {10840#(<= ~counter~0 3)} ~cond := #in~cond; {10840#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:52,241 INFO L290 TraceCheckUtils]: 37: Hoare triple {10840#(<= ~counter~0 3)} assume !(0 == ~cond); {10840#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:52,241 INFO L290 TraceCheckUtils]: 38: Hoare triple {10840#(<= ~counter~0 3)} assume true; {10840#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:52,241 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {10840#(<= ~counter~0 3)} {10840#(<= ~counter~0 3)} #98#return; {10840#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:52,242 INFO L290 TraceCheckUtils]: 40: Hoare triple {10840#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {10840#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:52,242 INFO L290 TraceCheckUtils]: 41: Hoare triple {10840#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {10865#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:52,242 INFO L290 TraceCheckUtils]: 42: Hoare triple {10865#(<= ~counter~0 4)} assume !!(#t~post8 < 20);havoc #t~post8; {10865#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:52,243 INFO L272 TraceCheckUtils]: 43: Hoare triple {10865#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10865#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:52,243 INFO L290 TraceCheckUtils]: 44: Hoare triple {10865#(<= ~counter~0 4)} ~cond := #in~cond; {10865#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:52,244 INFO L290 TraceCheckUtils]: 45: Hoare triple {10865#(<= ~counter~0 4)} assume !(0 == ~cond); {10865#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:52,244 INFO L290 TraceCheckUtils]: 46: Hoare triple {10865#(<= ~counter~0 4)} assume true; {10865#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:52,244 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {10865#(<= ~counter~0 4)} {10865#(<= ~counter~0 4)} #98#return; {10865#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:52,245 INFO L290 TraceCheckUtils]: 48: Hoare triple {10865#(<= ~counter~0 4)} assume !(~r~0 < 0); {10865#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:52,245 INFO L290 TraceCheckUtils]: 49: Hoare triple {10865#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10890#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:52,245 INFO L290 TraceCheckUtils]: 50: Hoare triple {10890#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {10890#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:52,246 INFO L272 TraceCheckUtils]: 51: Hoare triple {10890#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10890#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:52,246 INFO L290 TraceCheckUtils]: 52: Hoare triple {10890#(<= ~counter~0 5)} ~cond := #in~cond; {10890#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:52,246 INFO L290 TraceCheckUtils]: 53: Hoare triple {10890#(<= ~counter~0 5)} assume !(0 == ~cond); {10890#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:52,247 INFO L290 TraceCheckUtils]: 54: Hoare triple {10890#(<= ~counter~0 5)} assume true; {10890#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:52,247 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {10890#(<= ~counter~0 5)} {10890#(<= ~counter~0 5)} #94#return; {10890#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:52,247 INFO L290 TraceCheckUtils]: 56: Hoare triple {10890#(<= ~counter~0 5)} assume !!(0 != ~r~0); {10890#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:52,248 INFO L290 TraceCheckUtils]: 57: Hoare triple {10890#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {10915#(<= |main_#t~post7| 5)} is VALID [2022-04-28 05:57:52,248 INFO L290 TraceCheckUtils]: 58: Hoare triple {10915#(<= |main_#t~post7| 5)} assume !(#t~post7 < 20);havoc #t~post7; {10734#false} is VALID [2022-04-28 05:57:52,248 INFO L290 TraceCheckUtils]: 59: Hoare triple {10734#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {10734#false} is VALID [2022-04-28 05:57:52,248 INFO L290 TraceCheckUtils]: 60: Hoare triple {10734#false} assume !(#t~post8 < 20);havoc #t~post8; {10734#false} is VALID [2022-04-28 05:57:52,248 INFO L290 TraceCheckUtils]: 61: Hoare triple {10734#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10734#false} is VALID [2022-04-28 05:57:52,248 INFO L290 TraceCheckUtils]: 62: Hoare triple {10734#false} assume !(#t~post6 < 20);havoc #t~post6; {10734#false} is VALID [2022-04-28 05:57:52,248 INFO L272 TraceCheckUtils]: 63: Hoare triple {10734#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10734#false} is VALID [2022-04-28 05:57:52,248 INFO L290 TraceCheckUtils]: 64: Hoare triple {10734#false} ~cond := #in~cond; {10734#false} is VALID [2022-04-28 05:57:52,248 INFO L290 TraceCheckUtils]: 65: Hoare triple {10734#false} assume 0 == ~cond; {10734#false} is VALID [2022-04-28 05:57:52,248 INFO L290 TraceCheckUtils]: 66: Hoare triple {10734#false} assume !false; {10734#false} is VALID [2022-04-28 05:57:52,249 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 18 proven. 50 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 05:57:52,249 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:57:52,582 INFO L290 TraceCheckUtils]: 66: Hoare triple {10734#false} assume !false; {10734#false} is VALID [2022-04-28 05:57:52,582 INFO L290 TraceCheckUtils]: 65: Hoare triple {10734#false} assume 0 == ~cond; {10734#false} is VALID [2022-04-28 05:57:52,582 INFO L290 TraceCheckUtils]: 64: Hoare triple {10734#false} ~cond := #in~cond; {10734#false} is VALID [2022-04-28 05:57:52,582 INFO L272 TraceCheckUtils]: 63: Hoare triple {10734#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10734#false} is VALID [2022-04-28 05:57:52,582 INFO L290 TraceCheckUtils]: 62: Hoare triple {10734#false} assume !(#t~post6 < 20);havoc #t~post6; {10734#false} is VALID [2022-04-28 05:57:52,582 INFO L290 TraceCheckUtils]: 61: Hoare triple {10734#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10734#false} is VALID [2022-04-28 05:57:52,582 INFO L290 TraceCheckUtils]: 60: Hoare triple {10734#false} assume !(#t~post8 < 20);havoc #t~post8; {10734#false} is VALID [2022-04-28 05:57:52,582 INFO L290 TraceCheckUtils]: 59: Hoare triple {10734#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {10734#false} is VALID [2022-04-28 05:57:52,583 INFO L290 TraceCheckUtils]: 58: Hoare triple {10967#(< |main_#t~post7| 20)} assume !(#t~post7 < 20);havoc #t~post7; {10734#false} is VALID [2022-04-28 05:57:52,583 INFO L290 TraceCheckUtils]: 57: Hoare triple {10971#(< ~counter~0 20)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {10967#(< |main_#t~post7| 20)} is VALID [2022-04-28 05:57:52,583 INFO L290 TraceCheckUtils]: 56: Hoare triple {10971#(< ~counter~0 20)} assume !!(0 != ~r~0); {10971#(< ~counter~0 20)} is VALID [2022-04-28 05:57:52,584 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {10733#true} {10971#(< ~counter~0 20)} #94#return; {10971#(< ~counter~0 20)} is VALID [2022-04-28 05:57:52,584 INFO L290 TraceCheckUtils]: 54: Hoare triple {10733#true} assume true; {10733#true} is VALID [2022-04-28 05:57:52,584 INFO L290 TraceCheckUtils]: 53: Hoare triple {10733#true} assume !(0 == ~cond); {10733#true} is VALID [2022-04-28 05:57:52,584 INFO L290 TraceCheckUtils]: 52: Hoare triple {10733#true} ~cond := #in~cond; {10733#true} is VALID [2022-04-28 05:57:52,584 INFO L272 TraceCheckUtils]: 51: Hoare triple {10971#(< ~counter~0 20)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10733#true} is VALID [2022-04-28 05:57:52,584 INFO L290 TraceCheckUtils]: 50: Hoare triple {10971#(< ~counter~0 20)} assume !!(#t~post6 < 20);havoc #t~post6; {10971#(< ~counter~0 20)} is VALID [2022-04-28 05:57:52,585 INFO L290 TraceCheckUtils]: 49: Hoare triple {10996#(< ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10971#(< ~counter~0 20)} is VALID [2022-04-28 05:57:52,585 INFO L290 TraceCheckUtils]: 48: Hoare triple {10996#(< ~counter~0 19)} assume !(~r~0 < 0); {10996#(< ~counter~0 19)} is VALID [2022-04-28 05:57:52,586 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {10733#true} {10996#(< ~counter~0 19)} #98#return; {10996#(< ~counter~0 19)} is VALID [2022-04-28 05:57:52,586 INFO L290 TraceCheckUtils]: 46: Hoare triple {10733#true} assume true; {10733#true} is VALID [2022-04-28 05:57:52,586 INFO L290 TraceCheckUtils]: 45: Hoare triple {10733#true} assume !(0 == ~cond); {10733#true} is VALID [2022-04-28 05:57:52,586 INFO L290 TraceCheckUtils]: 44: Hoare triple {10733#true} ~cond := #in~cond; {10733#true} is VALID [2022-04-28 05:57:52,586 INFO L272 TraceCheckUtils]: 43: Hoare triple {10996#(< ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10733#true} is VALID [2022-04-28 05:57:52,586 INFO L290 TraceCheckUtils]: 42: Hoare triple {10996#(< ~counter~0 19)} assume !!(#t~post8 < 20);havoc #t~post8; {10996#(< ~counter~0 19)} is VALID [2022-04-28 05:57:52,587 INFO L290 TraceCheckUtils]: 41: Hoare triple {11021#(< ~counter~0 18)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {10996#(< ~counter~0 19)} is VALID [2022-04-28 05:57:52,587 INFO L290 TraceCheckUtils]: 40: Hoare triple {11021#(< ~counter~0 18)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {11021#(< ~counter~0 18)} is VALID [2022-04-28 05:57:52,587 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {10733#true} {11021#(< ~counter~0 18)} #98#return; {11021#(< ~counter~0 18)} is VALID [2022-04-28 05:57:52,587 INFO L290 TraceCheckUtils]: 38: Hoare triple {10733#true} assume true; {10733#true} is VALID [2022-04-28 05:57:52,588 INFO L290 TraceCheckUtils]: 37: Hoare triple {10733#true} assume !(0 == ~cond); {10733#true} is VALID [2022-04-28 05:57:52,588 INFO L290 TraceCheckUtils]: 36: Hoare triple {10733#true} ~cond := #in~cond; {10733#true} is VALID [2022-04-28 05:57:52,588 INFO L272 TraceCheckUtils]: 35: Hoare triple {11021#(< ~counter~0 18)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10733#true} is VALID [2022-04-28 05:57:52,588 INFO L290 TraceCheckUtils]: 34: Hoare triple {11021#(< ~counter~0 18)} assume !!(#t~post8 < 20);havoc #t~post8; {11021#(< ~counter~0 18)} is VALID [2022-04-28 05:57:52,588 INFO L290 TraceCheckUtils]: 33: Hoare triple {11046#(< ~counter~0 17)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {11021#(< ~counter~0 18)} is VALID [2022-04-28 05:57:52,589 INFO L290 TraceCheckUtils]: 32: Hoare triple {11046#(< ~counter~0 17)} assume !(~r~0 > 0); {11046#(< ~counter~0 17)} is VALID [2022-04-28 05:57:52,589 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {10733#true} {11046#(< ~counter~0 17)} #96#return; {11046#(< ~counter~0 17)} is VALID [2022-04-28 05:57:52,589 INFO L290 TraceCheckUtils]: 30: Hoare triple {10733#true} assume true; {10733#true} is VALID [2022-04-28 05:57:52,589 INFO L290 TraceCheckUtils]: 29: Hoare triple {10733#true} assume !(0 == ~cond); {10733#true} is VALID [2022-04-28 05:57:52,589 INFO L290 TraceCheckUtils]: 28: Hoare triple {10733#true} ~cond := #in~cond; {10733#true} is VALID [2022-04-28 05:57:52,589 INFO L272 TraceCheckUtils]: 27: Hoare triple {11046#(< ~counter~0 17)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10733#true} is VALID [2022-04-28 05:57:52,590 INFO L290 TraceCheckUtils]: 26: Hoare triple {11046#(< ~counter~0 17)} assume !!(#t~post7 < 20);havoc #t~post7; {11046#(< ~counter~0 17)} is VALID [2022-04-28 05:57:52,590 INFO L290 TraceCheckUtils]: 25: Hoare triple {11071#(< ~counter~0 16)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {11046#(< ~counter~0 17)} is VALID [2022-04-28 05:57:52,590 INFO L290 TraceCheckUtils]: 24: Hoare triple {11071#(< ~counter~0 16)} assume !!(0 != ~r~0); {11071#(< ~counter~0 16)} is VALID [2022-04-28 05:57:52,591 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {10733#true} {11071#(< ~counter~0 16)} #94#return; {11071#(< ~counter~0 16)} is VALID [2022-04-28 05:57:52,591 INFO L290 TraceCheckUtils]: 22: Hoare triple {10733#true} assume true; {10733#true} is VALID [2022-04-28 05:57:52,591 INFO L290 TraceCheckUtils]: 21: Hoare triple {10733#true} assume !(0 == ~cond); {10733#true} is VALID [2022-04-28 05:57:52,591 INFO L290 TraceCheckUtils]: 20: Hoare triple {10733#true} ~cond := #in~cond; {10733#true} is VALID [2022-04-28 05:57:52,591 INFO L272 TraceCheckUtils]: 19: Hoare triple {11071#(< ~counter~0 16)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10733#true} is VALID [2022-04-28 05:57:52,591 INFO L290 TraceCheckUtils]: 18: Hoare triple {11071#(< ~counter~0 16)} assume !!(#t~post6 < 20);havoc #t~post6; {11071#(< ~counter~0 16)} is VALID [2022-04-28 05:57:52,592 INFO L290 TraceCheckUtils]: 17: Hoare triple {11096#(< ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11071#(< ~counter~0 16)} is VALID [2022-04-28 05:57:52,592 INFO L290 TraceCheckUtils]: 16: Hoare triple {11096#(< ~counter~0 15)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {11096#(< ~counter~0 15)} is VALID [2022-04-28 05:57:52,593 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {10733#true} {11096#(< ~counter~0 15)} #92#return; {11096#(< ~counter~0 15)} is VALID [2022-04-28 05:57:52,593 INFO L290 TraceCheckUtils]: 14: Hoare triple {10733#true} assume true; {10733#true} is VALID [2022-04-28 05:57:52,593 INFO L290 TraceCheckUtils]: 13: Hoare triple {10733#true} assume !(0 == ~cond); {10733#true} is VALID [2022-04-28 05:57:52,593 INFO L290 TraceCheckUtils]: 12: Hoare triple {10733#true} ~cond := #in~cond; {10733#true} is VALID [2022-04-28 05:57:52,593 INFO L272 TraceCheckUtils]: 11: Hoare triple {11096#(< ~counter~0 15)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {10733#true} is VALID [2022-04-28 05:57:52,593 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10733#true} {11096#(< ~counter~0 15)} #90#return; {11096#(< ~counter~0 15)} is VALID [2022-04-28 05:57:52,593 INFO L290 TraceCheckUtils]: 9: Hoare triple {10733#true} assume true; {10733#true} is VALID [2022-04-28 05:57:52,593 INFO L290 TraceCheckUtils]: 8: Hoare triple {10733#true} assume !(0 == ~cond); {10733#true} is VALID [2022-04-28 05:57:52,593 INFO L290 TraceCheckUtils]: 7: Hoare triple {10733#true} ~cond := #in~cond; {10733#true} is VALID [2022-04-28 05:57:52,594 INFO L272 TraceCheckUtils]: 6: Hoare triple {11096#(< ~counter~0 15)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {10733#true} is VALID [2022-04-28 05:57:52,594 INFO L290 TraceCheckUtils]: 5: Hoare triple {11096#(< ~counter~0 15)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {11096#(< ~counter~0 15)} is VALID [2022-04-28 05:57:52,594 INFO L272 TraceCheckUtils]: 4: Hoare triple {11096#(< ~counter~0 15)} call #t~ret9 := main(); {11096#(< ~counter~0 15)} is VALID [2022-04-28 05:57:52,594 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11096#(< ~counter~0 15)} {10733#true} #102#return; {11096#(< ~counter~0 15)} is VALID [2022-04-28 05:57:52,595 INFO L290 TraceCheckUtils]: 2: Hoare triple {11096#(< ~counter~0 15)} assume true; {11096#(< ~counter~0 15)} is VALID [2022-04-28 05:57:52,595 INFO L290 TraceCheckUtils]: 1: Hoare triple {10733#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {11096#(< ~counter~0 15)} is VALID [2022-04-28 05:57:52,595 INFO L272 TraceCheckUtils]: 0: Hoare triple {10733#true} call ULTIMATE.init(); {10733#true} is VALID [2022-04-28 05:57:52,595 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 18 proven. 10 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-04-28 05:57:52,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:57:52,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235481796] [2022-04-28 05:57:52,596 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:57:52,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1415976963] [2022-04-28 05:57:52,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1415976963] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:57:52,596 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:57:52,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2022-04-28 05:57:52,596 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:57:52,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2026586848] [2022-04-28 05:57:52,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2026586848] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:57:52,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:57:52,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 05:57:52,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436413804] [2022-04-28 05:57:52,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:57:52,597 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 8 states have internal predecessors, (46), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) Word has length 67 [2022-04-28 05:57:52,597 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:57:52,597 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 8 states have internal predecessors, (46), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-28 05:57:52,641 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:57:52,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 05:57:52,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:57:52,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 05:57:52,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2022-04-28 05:57:52,642 INFO L87 Difference]: Start difference. First operand 109 states and 135 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 8 states have internal predecessors, (46), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-28 05:57:52,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:52,990 INFO L93 Difference]: Finished difference Result 151 states and 194 transitions. [2022-04-28 05:57:52,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 05:57:52,990 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 8 states have internal predecessors, (46), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) Word has length 67 [2022-04-28 05:57:52,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:57:52,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 8 states have internal predecessors, (46), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-28 05:57:52,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 137 transitions. [2022-04-28 05:57:52,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 8 states have internal predecessors, (46), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-28 05:57:52,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 137 transitions. [2022-04-28 05:57:52,995 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 137 transitions. [2022-04-28 05:57:53,100 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:57:53,102 INFO L225 Difference]: With dead ends: 151 [2022-04-28 05:57:53,102 INFO L226 Difference]: Without dead ends: 114 [2022-04-28 05:57:53,102 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=152, Invalid=228, Unknown=0, NotChecked=0, Total=380 [2022-04-28 05:57:53,103 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 38 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 05:57:53,103 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 182 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 05:57:53,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-04-28 05:57:53,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2022-04-28 05:57:53,222 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:57:53,223 INFO L82 GeneralOperation]: Start isEquivalent. First operand 114 states. Second operand has 114 states, 84 states have (on average 1.1904761904761905) internal successors, (100), 84 states have internal predecessors, (100), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 05:57:53,223 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand has 114 states, 84 states have (on average 1.1904761904761905) internal successors, (100), 84 states have internal predecessors, (100), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 05:57:53,223 INFO L87 Difference]: Start difference. First operand 114 states. Second operand has 114 states, 84 states have (on average 1.1904761904761905) internal successors, (100), 84 states have internal predecessors, (100), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 05:57:53,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:53,226 INFO L93 Difference]: Finished difference Result 114 states and 140 transitions. [2022-04-28 05:57:53,226 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 140 transitions. [2022-04-28 05:57:53,226 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:57:53,226 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:57:53,227 INFO L74 IsIncluded]: Start isIncluded. First operand has 114 states, 84 states have (on average 1.1904761904761905) internal successors, (100), 84 states have internal predecessors, (100), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 114 states. [2022-04-28 05:57:53,227 INFO L87 Difference]: Start difference. First operand has 114 states, 84 states have (on average 1.1904761904761905) internal successors, (100), 84 states have internal predecessors, (100), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 114 states. [2022-04-28 05:57:53,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:53,229 INFO L93 Difference]: Finished difference Result 114 states and 140 transitions. [2022-04-28 05:57:53,229 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 140 transitions. [2022-04-28 05:57:53,230 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:57:53,230 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:57:53,230 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:57:53,230 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:57:53,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 84 states have (on average 1.1904761904761905) internal successors, (100), 84 states have internal predecessors, (100), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 05:57:53,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 140 transitions. [2022-04-28 05:57:53,232 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 140 transitions. Word has length 67 [2022-04-28 05:57:53,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:57:53,233 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 140 transitions. [2022-04-28 05:57:53,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 8 states have internal predecessors, (46), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-28 05:57:53,233 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 114 states and 140 transitions. [2022-04-28 05:57:55,426 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 139 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 05:57:55,426 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 140 transitions. [2022-04-28 05:57:55,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-04-28 05:57:55,427 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:57:55,428 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1] [2022-04-28 05:57:55,446 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-28 05:57:55,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-28 05:57:55,635 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:57:55,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:57:55,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1645787183, now seen corresponding path program 5 times [2022-04-28 05:57:55,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:57:55,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [70750089] [2022-04-28 05:57:55,636 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:57:55,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1645787183, now seen corresponding path program 6 times [2022-04-28 05:57:55,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:57:55,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633333340] [2022-04-28 05:57:55,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:57:55,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:57:55,650 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:57:55,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [840629413] [2022-04-28 05:57:55,650 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 05:57:55,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:57:55,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:57:55,652 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:57:55,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-28 05:57:55,720 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 05:57:55,720 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:57:55,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-28 05:57:55,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:57:55,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:57:56,107 INFO L272 TraceCheckUtils]: 0: Hoare triple {11916#true} call ULTIMATE.init(); {11916#true} is VALID [2022-04-28 05:57:56,108 INFO L290 TraceCheckUtils]: 1: Hoare triple {11916#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {11924#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:56,108 INFO L290 TraceCheckUtils]: 2: Hoare triple {11924#(<= ~counter~0 0)} assume true; {11924#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:56,109 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11924#(<= ~counter~0 0)} {11916#true} #102#return; {11924#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:56,109 INFO L272 TraceCheckUtils]: 4: Hoare triple {11924#(<= ~counter~0 0)} call #t~ret9 := main(); {11924#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:56,109 INFO L290 TraceCheckUtils]: 5: Hoare triple {11924#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {11924#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:56,110 INFO L272 TraceCheckUtils]: 6: Hoare triple {11924#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {11924#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:56,110 INFO L290 TraceCheckUtils]: 7: Hoare triple {11924#(<= ~counter~0 0)} ~cond := #in~cond; {11924#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:56,110 INFO L290 TraceCheckUtils]: 8: Hoare triple {11924#(<= ~counter~0 0)} assume !(0 == ~cond); {11924#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:56,110 INFO L290 TraceCheckUtils]: 9: Hoare triple {11924#(<= ~counter~0 0)} assume true; {11924#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:56,111 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11924#(<= ~counter~0 0)} {11924#(<= ~counter~0 0)} #90#return; {11924#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:56,111 INFO L272 TraceCheckUtils]: 11: Hoare triple {11924#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {11924#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:56,112 INFO L290 TraceCheckUtils]: 12: Hoare triple {11924#(<= ~counter~0 0)} ~cond := #in~cond; {11924#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:56,112 INFO L290 TraceCheckUtils]: 13: Hoare triple {11924#(<= ~counter~0 0)} assume !(0 == ~cond); {11924#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:56,112 INFO L290 TraceCheckUtils]: 14: Hoare triple {11924#(<= ~counter~0 0)} assume true; {11924#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:56,112 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {11924#(<= ~counter~0 0)} {11924#(<= ~counter~0 0)} #92#return; {11924#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:56,114 INFO L290 TraceCheckUtils]: 16: Hoare triple {11924#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {11924#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:56,114 INFO L290 TraceCheckUtils]: 17: Hoare triple {11924#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11973#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:56,115 INFO L290 TraceCheckUtils]: 18: Hoare triple {11973#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {11973#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:56,115 INFO L272 TraceCheckUtils]: 19: Hoare triple {11973#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {11973#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:56,115 INFO L290 TraceCheckUtils]: 20: Hoare triple {11973#(<= ~counter~0 1)} ~cond := #in~cond; {11973#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:56,116 INFO L290 TraceCheckUtils]: 21: Hoare triple {11973#(<= ~counter~0 1)} assume !(0 == ~cond); {11973#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:56,116 INFO L290 TraceCheckUtils]: 22: Hoare triple {11973#(<= ~counter~0 1)} assume true; {11973#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:56,116 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {11973#(<= ~counter~0 1)} {11973#(<= ~counter~0 1)} #94#return; {11973#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:56,117 INFO L290 TraceCheckUtils]: 24: Hoare triple {11973#(<= ~counter~0 1)} assume !!(0 != ~r~0); {11973#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:56,117 INFO L290 TraceCheckUtils]: 25: Hoare triple {11973#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {11998#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:56,117 INFO L290 TraceCheckUtils]: 26: Hoare triple {11998#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {11998#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:56,118 INFO L272 TraceCheckUtils]: 27: Hoare triple {11998#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {11998#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:56,118 INFO L290 TraceCheckUtils]: 28: Hoare triple {11998#(<= ~counter~0 2)} ~cond := #in~cond; {11998#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:56,118 INFO L290 TraceCheckUtils]: 29: Hoare triple {11998#(<= ~counter~0 2)} assume !(0 == ~cond); {11998#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:56,119 INFO L290 TraceCheckUtils]: 30: Hoare triple {11998#(<= ~counter~0 2)} assume true; {11998#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:56,119 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {11998#(<= ~counter~0 2)} {11998#(<= ~counter~0 2)} #96#return; {11998#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:56,119 INFO L290 TraceCheckUtils]: 32: Hoare triple {11998#(<= ~counter~0 2)} assume !(~r~0 > 0); {11998#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:56,120 INFO L290 TraceCheckUtils]: 33: Hoare triple {11998#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {12023#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:56,120 INFO L290 TraceCheckUtils]: 34: Hoare triple {12023#(<= ~counter~0 3)} assume !!(#t~post8 < 20);havoc #t~post8; {12023#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:56,121 INFO L272 TraceCheckUtils]: 35: Hoare triple {12023#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {12023#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:56,121 INFO L290 TraceCheckUtils]: 36: Hoare triple {12023#(<= ~counter~0 3)} ~cond := #in~cond; {12023#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:56,121 INFO L290 TraceCheckUtils]: 37: Hoare triple {12023#(<= ~counter~0 3)} assume !(0 == ~cond); {12023#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:56,122 INFO L290 TraceCheckUtils]: 38: Hoare triple {12023#(<= ~counter~0 3)} assume true; {12023#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:56,122 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {12023#(<= ~counter~0 3)} {12023#(<= ~counter~0 3)} #98#return; {12023#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:56,122 INFO L290 TraceCheckUtils]: 40: Hoare triple {12023#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {12023#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:56,123 INFO L290 TraceCheckUtils]: 41: Hoare triple {12023#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {12048#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:56,123 INFO L290 TraceCheckUtils]: 42: Hoare triple {12048#(<= ~counter~0 4)} assume !!(#t~post8 < 20);havoc #t~post8; {12048#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:56,124 INFO L272 TraceCheckUtils]: 43: Hoare triple {12048#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {12048#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:56,124 INFO L290 TraceCheckUtils]: 44: Hoare triple {12048#(<= ~counter~0 4)} ~cond := #in~cond; {12048#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:56,124 INFO L290 TraceCheckUtils]: 45: Hoare triple {12048#(<= ~counter~0 4)} assume !(0 == ~cond); {12048#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:56,124 INFO L290 TraceCheckUtils]: 46: Hoare triple {12048#(<= ~counter~0 4)} assume true; {12048#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:56,125 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {12048#(<= ~counter~0 4)} {12048#(<= ~counter~0 4)} #98#return; {12048#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:56,125 INFO L290 TraceCheckUtils]: 48: Hoare triple {12048#(<= ~counter~0 4)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {12048#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:56,126 INFO L290 TraceCheckUtils]: 49: Hoare triple {12048#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {12073#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:56,126 INFO L290 TraceCheckUtils]: 50: Hoare triple {12073#(<= ~counter~0 5)} assume !!(#t~post8 < 20);havoc #t~post8; {12073#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:56,126 INFO L272 TraceCheckUtils]: 51: Hoare triple {12073#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {12073#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:56,127 INFO L290 TraceCheckUtils]: 52: Hoare triple {12073#(<= ~counter~0 5)} ~cond := #in~cond; {12073#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:56,127 INFO L290 TraceCheckUtils]: 53: Hoare triple {12073#(<= ~counter~0 5)} assume !(0 == ~cond); {12073#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:56,127 INFO L290 TraceCheckUtils]: 54: Hoare triple {12073#(<= ~counter~0 5)} assume true; {12073#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:56,128 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {12073#(<= ~counter~0 5)} {12073#(<= ~counter~0 5)} #98#return; {12073#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:56,128 INFO L290 TraceCheckUtils]: 56: Hoare triple {12073#(<= ~counter~0 5)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {12073#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:56,128 INFO L290 TraceCheckUtils]: 57: Hoare triple {12073#(<= ~counter~0 5)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {12098#(<= ~counter~0 6)} is VALID [2022-04-28 05:57:56,129 INFO L290 TraceCheckUtils]: 58: Hoare triple {12098#(<= ~counter~0 6)} assume !!(#t~post8 < 20);havoc #t~post8; {12098#(<= ~counter~0 6)} is VALID [2022-04-28 05:57:56,129 INFO L272 TraceCheckUtils]: 59: Hoare triple {12098#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {12098#(<= ~counter~0 6)} is VALID [2022-04-28 05:57:56,131 INFO L290 TraceCheckUtils]: 60: Hoare triple {12098#(<= ~counter~0 6)} ~cond := #in~cond; {12098#(<= ~counter~0 6)} is VALID [2022-04-28 05:57:56,134 INFO L290 TraceCheckUtils]: 61: Hoare triple {12098#(<= ~counter~0 6)} assume !(0 == ~cond); {12098#(<= ~counter~0 6)} is VALID [2022-04-28 05:57:56,134 INFO L290 TraceCheckUtils]: 62: Hoare triple {12098#(<= ~counter~0 6)} assume true; {12098#(<= ~counter~0 6)} is VALID [2022-04-28 05:57:56,135 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {12098#(<= ~counter~0 6)} {12098#(<= ~counter~0 6)} #98#return; {12098#(<= ~counter~0 6)} is VALID [2022-04-28 05:57:56,135 INFO L290 TraceCheckUtils]: 64: Hoare triple {12098#(<= ~counter~0 6)} assume !(~r~0 < 0); {12098#(<= ~counter~0 6)} is VALID [2022-04-28 05:57:56,135 INFO L290 TraceCheckUtils]: 65: Hoare triple {12098#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12123#(<= |main_#t~post6| 6)} is VALID [2022-04-28 05:57:56,136 INFO L290 TraceCheckUtils]: 66: Hoare triple {12123#(<= |main_#t~post6| 6)} assume !(#t~post6 < 20);havoc #t~post6; {11917#false} is VALID [2022-04-28 05:57:56,136 INFO L272 TraceCheckUtils]: 67: Hoare triple {11917#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {11917#false} is VALID [2022-04-28 05:57:56,136 INFO L290 TraceCheckUtils]: 68: Hoare triple {11917#false} ~cond := #in~cond; {11917#false} is VALID [2022-04-28 05:57:56,136 INFO L290 TraceCheckUtils]: 69: Hoare triple {11917#false} assume 0 == ~cond; {11917#false} is VALID [2022-04-28 05:57:56,136 INFO L290 TraceCheckUtils]: 70: Hoare triple {11917#false} assume !false; {11917#false} is VALID [2022-04-28 05:57:56,136 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 12 proven. 86 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 05:57:56,136 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:57:56,533 INFO L290 TraceCheckUtils]: 70: Hoare triple {11917#false} assume !false; {11917#false} is VALID [2022-04-28 05:57:56,533 INFO L290 TraceCheckUtils]: 69: Hoare triple {11917#false} assume 0 == ~cond; {11917#false} is VALID [2022-04-28 05:57:56,533 INFO L290 TraceCheckUtils]: 68: Hoare triple {11917#false} ~cond := #in~cond; {11917#false} is VALID [2022-04-28 05:57:56,533 INFO L272 TraceCheckUtils]: 67: Hoare triple {11917#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {11917#false} is VALID [2022-04-28 05:57:56,534 INFO L290 TraceCheckUtils]: 66: Hoare triple {12151#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {11917#false} is VALID [2022-04-28 05:57:56,534 INFO L290 TraceCheckUtils]: 65: Hoare triple {12155#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12151#(< |main_#t~post6| 20)} is VALID [2022-04-28 05:57:56,534 INFO L290 TraceCheckUtils]: 64: Hoare triple {12155#(< ~counter~0 20)} assume !(~r~0 < 0); {12155#(< ~counter~0 20)} is VALID [2022-04-28 05:57:56,535 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {11916#true} {12155#(< ~counter~0 20)} #98#return; {12155#(< ~counter~0 20)} is VALID [2022-04-28 05:57:56,535 INFO L290 TraceCheckUtils]: 62: Hoare triple {11916#true} assume true; {11916#true} is VALID [2022-04-28 05:57:56,535 INFO L290 TraceCheckUtils]: 61: Hoare triple {11916#true} assume !(0 == ~cond); {11916#true} is VALID [2022-04-28 05:57:56,535 INFO L290 TraceCheckUtils]: 60: Hoare triple {11916#true} ~cond := #in~cond; {11916#true} is VALID [2022-04-28 05:57:56,535 INFO L272 TraceCheckUtils]: 59: Hoare triple {12155#(< ~counter~0 20)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {11916#true} is VALID [2022-04-28 05:57:56,535 INFO L290 TraceCheckUtils]: 58: Hoare triple {12155#(< ~counter~0 20)} assume !!(#t~post8 < 20);havoc #t~post8; {12155#(< ~counter~0 20)} is VALID [2022-04-28 05:57:56,536 INFO L290 TraceCheckUtils]: 57: Hoare triple {12180#(< ~counter~0 19)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {12155#(< ~counter~0 20)} is VALID [2022-04-28 05:57:56,536 INFO L290 TraceCheckUtils]: 56: Hoare triple {12180#(< ~counter~0 19)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {12180#(< ~counter~0 19)} is VALID [2022-04-28 05:57:56,537 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {11916#true} {12180#(< ~counter~0 19)} #98#return; {12180#(< ~counter~0 19)} is VALID [2022-04-28 05:57:56,537 INFO L290 TraceCheckUtils]: 54: Hoare triple {11916#true} assume true; {11916#true} is VALID [2022-04-28 05:57:56,537 INFO L290 TraceCheckUtils]: 53: Hoare triple {11916#true} assume !(0 == ~cond); {11916#true} is VALID [2022-04-28 05:57:56,537 INFO L290 TraceCheckUtils]: 52: Hoare triple {11916#true} ~cond := #in~cond; {11916#true} is VALID [2022-04-28 05:57:56,537 INFO L272 TraceCheckUtils]: 51: Hoare triple {12180#(< ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {11916#true} is VALID [2022-04-28 05:57:56,537 INFO L290 TraceCheckUtils]: 50: Hoare triple {12180#(< ~counter~0 19)} assume !!(#t~post8 < 20);havoc #t~post8; {12180#(< ~counter~0 19)} is VALID [2022-04-28 05:57:56,538 INFO L290 TraceCheckUtils]: 49: Hoare triple {12205#(< ~counter~0 18)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {12180#(< ~counter~0 19)} is VALID [2022-04-28 05:57:56,538 INFO L290 TraceCheckUtils]: 48: Hoare triple {12205#(< ~counter~0 18)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {12205#(< ~counter~0 18)} is VALID [2022-04-28 05:57:56,538 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {11916#true} {12205#(< ~counter~0 18)} #98#return; {12205#(< ~counter~0 18)} is VALID [2022-04-28 05:57:56,538 INFO L290 TraceCheckUtils]: 46: Hoare triple {11916#true} assume true; {11916#true} is VALID [2022-04-28 05:57:56,538 INFO L290 TraceCheckUtils]: 45: Hoare triple {11916#true} assume !(0 == ~cond); {11916#true} is VALID [2022-04-28 05:57:56,539 INFO L290 TraceCheckUtils]: 44: Hoare triple {11916#true} ~cond := #in~cond; {11916#true} is VALID [2022-04-28 05:57:56,539 INFO L272 TraceCheckUtils]: 43: Hoare triple {12205#(< ~counter~0 18)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {11916#true} is VALID [2022-04-28 05:57:56,539 INFO L290 TraceCheckUtils]: 42: Hoare triple {12205#(< ~counter~0 18)} assume !!(#t~post8 < 20);havoc #t~post8; {12205#(< ~counter~0 18)} is VALID [2022-04-28 05:57:56,539 INFO L290 TraceCheckUtils]: 41: Hoare triple {12230#(< ~counter~0 17)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {12205#(< ~counter~0 18)} is VALID [2022-04-28 05:57:56,540 INFO L290 TraceCheckUtils]: 40: Hoare triple {12230#(< ~counter~0 17)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {12230#(< ~counter~0 17)} is VALID [2022-04-28 05:57:56,540 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {11916#true} {12230#(< ~counter~0 17)} #98#return; {12230#(< ~counter~0 17)} is VALID [2022-04-28 05:57:56,540 INFO L290 TraceCheckUtils]: 38: Hoare triple {11916#true} assume true; {11916#true} is VALID [2022-04-28 05:57:56,540 INFO L290 TraceCheckUtils]: 37: Hoare triple {11916#true} assume !(0 == ~cond); {11916#true} is VALID [2022-04-28 05:57:56,540 INFO L290 TraceCheckUtils]: 36: Hoare triple {11916#true} ~cond := #in~cond; {11916#true} is VALID [2022-04-28 05:57:56,540 INFO L272 TraceCheckUtils]: 35: Hoare triple {12230#(< ~counter~0 17)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {11916#true} is VALID [2022-04-28 05:57:56,541 INFO L290 TraceCheckUtils]: 34: Hoare triple {12230#(< ~counter~0 17)} assume !!(#t~post8 < 20);havoc #t~post8; {12230#(< ~counter~0 17)} is VALID [2022-04-28 05:57:56,541 INFO L290 TraceCheckUtils]: 33: Hoare triple {12255#(< ~counter~0 16)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {12230#(< ~counter~0 17)} is VALID [2022-04-28 05:57:56,541 INFO L290 TraceCheckUtils]: 32: Hoare triple {12255#(< ~counter~0 16)} assume !(~r~0 > 0); {12255#(< ~counter~0 16)} is VALID [2022-04-28 05:57:56,542 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {11916#true} {12255#(< ~counter~0 16)} #96#return; {12255#(< ~counter~0 16)} is VALID [2022-04-28 05:57:56,542 INFO L290 TraceCheckUtils]: 30: Hoare triple {11916#true} assume true; {11916#true} is VALID [2022-04-28 05:57:56,542 INFO L290 TraceCheckUtils]: 29: Hoare triple {11916#true} assume !(0 == ~cond); {11916#true} is VALID [2022-04-28 05:57:56,542 INFO L290 TraceCheckUtils]: 28: Hoare triple {11916#true} ~cond := #in~cond; {11916#true} is VALID [2022-04-28 05:57:56,542 INFO L272 TraceCheckUtils]: 27: Hoare triple {12255#(< ~counter~0 16)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {11916#true} is VALID [2022-04-28 05:57:56,542 INFO L290 TraceCheckUtils]: 26: Hoare triple {12255#(< ~counter~0 16)} assume !!(#t~post7 < 20);havoc #t~post7; {12255#(< ~counter~0 16)} is VALID [2022-04-28 05:57:56,543 INFO L290 TraceCheckUtils]: 25: Hoare triple {12280#(< ~counter~0 15)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {12255#(< ~counter~0 16)} is VALID [2022-04-28 05:57:56,543 INFO L290 TraceCheckUtils]: 24: Hoare triple {12280#(< ~counter~0 15)} assume !!(0 != ~r~0); {12280#(< ~counter~0 15)} is VALID [2022-04-28 05:57:56,543 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {11916#true} {12280#(< ~counter~0 15)} #94#return; {12280#(< ~counter~0 15)} is VALID [2022-04-28 05:57:56,544 INFO L290 TraceCheckUtils]: 22: Hoare triple {11916#true} assume true; {11916#true} is VALID [2022-04-28 05:57:56,544 INFO L290 TraceCheckUtils]: 21: Hoare triple {11916#true} assume !(0 == ~cond); {11916#true} is VALID [2022-04-28 05:57:56,544 INFO L290 TraceCheckUtils]: 20: Hoare triple {11916#true} ~cond := #in~cond; {11916#true} is VALID [2022-04-28 05:57:56,544 INFO L272 TraceCheckUtils]: 19: Hoare triple {12280#(< ~counter~0 15)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {11916#true} is VALID [2022-04-28 05:57:56,544 INFO L290 TraceCheckUtils]: 18: Hoare triple {12280#(< ~counter~0 15)} assume !!(#t~post6 < 20);havoc #t~post6; {12280#(< ~counter~0 15)} is VALID [2022-04-28 05:57:56,544 INFO L290 TraceCheckUtils]: 17: Hoare triple {12305#(< ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12280#(< ~counter~0 15)} is VALID [2022-04-28 05:57:56,545 INFO L290 TraceCheckUtils]: 16: Hoare triple {12305#(< ~counter~0 14)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {12305#(< ~counter~0 14)} is VALID [2022-04-28 05:57:56,545 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {11916#true} {12305#(< ~counter~0 14)} #92#return; {12305#(< ~counter~0 14)} is VALID [2022-04-28 05:57:56,545 INFO L290 TraceCheckUtils]: 14: Hoare triple {11916#true} assume true; {11916#true} is VALID [2022-04-28 05:57:56,545 INFO L290 TraceCheckUtils]: 13: Hoare triple {11916#true} assume !(0 == ~cond); {11916#true} is VALID [2022-04-28 05:57:56,545 INFO L290 TraceCheckUtils]: 12: Hoare triple {11916#true} ~cond := #in~cond; {11916#true} is VALID [2022-04-28 05:57:56,545 INFO L272 TraceCheckUtils]: 11: Hoare triple {12305#(< ~counter~0 14)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {11916#true} is VALID [2022-04-28 05:57:56,546 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11916#true} {12305#(< ~counter~0 14)} #90#return; {12305#(< ~counter~0 14)} is VALID [2022-04-28 05:57:56,546 INFO L290 TraceCheckUtils]: 9: Hoare triple {11916#true} assume true; {11916#true} is VALID [2022-04-28 05:57:56,546 INFO L290 TraceCheckUtils]: 8: Hoare triple {11916#true} assume !(0 == ~cond); {11916#true} is VALID [2022-04-28 05:57:56,546 INFO L290 TraceCheckUtils]: 7: Hoare triple {11916#true} ~cond := #in~cond; {11916#true} is VALID [2022-04-28 05:57:56,546 INFO L272 TraceCheckUtils]: 6: Hoare triple {12305#(< ~counter~0 14)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {11916#true} is VALID [2022-04-28 05:57:56,546 INFO L290 TraceCheckUtils]: 5: Hoare triple {12305#(< ~counter~0 14)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {12305#(< ~counter~0 14)} is VALID [2022-04-28 05:57:56,547 INFO L272 TraceCheckUtils]: 4: Hoare triple {12305#(< ~counter~0 14)} call #t~ret9 := main(); {12305#(< ~counter~0 14)} is VALID [2022-04-28 05:57:56,547 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12305#(< ~counter~0 14)} {11916#true} #102#return; {12305#(< ~counter~0 14)} is VALID [2022-04-28 05:57:56,547 INFO L290 TraceCheckUtils]: 2: Hoare triple {12305#(< ~counter~0 14)} assume true; {12305#(< ~counter~0 14)} is VALID [2022-04-28 05:57:56,548 INFO L290 TraceCheckUtils]: 1: Hoare triple {11916#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {12305#(< ~counter~0 14)} is VALID [2022-04-28 05:57:56,548 INFO L272 TraceCheckUtils]: 0: Hoare triple {11916#true} call ULTIMATE.init(); {11916#true} is VALID [2022-04-28 05:57:56,548 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 12 proven. 26 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-04-28 05:57:56,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:57:56,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633333340] [2022-04-28 05:57:56,548 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:57:56,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [840629413] [2022-04-28 05:57:56,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [840629413] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:57:56,548 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:57:56,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-04-28 05:57:56,549 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:57:56,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [70750089] [2022-04-28 05:57:56,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [70750089] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:57:56,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:57:56,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 05:57:56,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19879283] [2022-04-28 05:57:56,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:57:56,549 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 9 states have internal predecessors, (48), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) Word has length 71 [2022-04-28 05:57:56,549 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:57:56,550 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 4.8) internal successors, (48), 9 states have internal predecessors, (48), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 05:57:56,596 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:57:56,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 05:57:56,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:57:56,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 05:57:56,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2022-04-28 05:57:56,597 INFO L87 Difference]: Start difference. First operand 114 states and 140 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 9 states have internal predecessors, (48), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 05:57:57,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:57,031 INFO L93 Difference]: Finished difference Result 137 states and 169 transitions. [2022-04-28 05:57:57,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 05:57:57,031 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 9 states have internal predecessors, (48), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) Word has length 71 [2022-04-28 05:57:57,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:57:57,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 9 states have internal predecessors, (48), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 05:57:57,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 135 transitions. [2022-04-28 05:57:57,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 9 states have internal predecessors, (48), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 05:57:57,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 135 transitions. [2022-04-28 05:57:57,035 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 135 transitions. [2022-04-28 05:57:57,128 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:57:57,131 INFO L225 Difference]: With dead ends: 137 [2022-04-28 05:57:57,131 INFO L226 Difference]: Without dead ends: 132 [2022-04-28 05:57:57,131 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=170, Invalid=250, Unknown=0, NotChecked=0, Total=420 [2022-04-28 05:57:57,131 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 61 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 05:57:57,132 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 189 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 05:57:57,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-04-28 05:57:57,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 125. [2022-04-28 05:57:57,249 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:57:57,249 INFO L82 GeneralOperation]: Start isEquivalent. First operand 132 states. Second operand has 125 states, 90 states have (on average 1.1888888888888889) internal successors, (107), 93 states have internal predecessors, (107), 25 states have call successors, (25), 11 states have call predecessors, (25), 9 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-28 05:57:57,249 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand has 125 states, 90 states have (on average 1.1888888888888889) internal successors, (107), 93 states have internal predecessors, (107), 25 states have call successors, (25), 11 states have call predecessors, (25), 9 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-28 05:57:57,250 INFO L87 Difference]: Start difference. First operand 132 states. Second operand has 125 states, 90 states have (on average 1.1888888888888889) internal successors, (107), 93 states have internal predecessors, (107), 25 states have call successors, (25), 11 states have call predecessors, (25), 9 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-28 05:57:57,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:57,252 INFO L93 Difference]: Finished difference Result 132 states and 164 transitions. [2022-04-28 05:57:57,252 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 164 transitions. [2022-04-28 05:57:57,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:57:57,253 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:57:57,253 INFO L74 IsIncluded]: Start isIncluded. First operand has 125 states, 90 states have (on average 1.1888888888888889) internal successors, (107), 93 states have internal predecessors, (107), 25 states have call successors, (25), 11 states have call predecessors, (25), 9 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) Second operand 132 states. [2022-04-28 05:57:57,253 INFO L87 Difference]: Start difference. First operand has 125 states, 90 states have (on average 1.1888888888888889) internal successors, (107), 93 states have internal predecessors, (107), 25 states have call successors, (25), 11 states have call predecessors, (25), 9 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) Second operand 132 states. [2022-04-28 05:57:57,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:57,256 INFO L93 Difference]: Finished difference Result 132 states and 164 transitions. [2022-04-28 05:57:57,256 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 164 transitions. [2022-04-28 05:57:57,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:57:57,257 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:57:57,257 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:57:57,257 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:57:57,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 90 states have (on average 1.1888888888888889) internal successors, (107), 93 states have internal predecessors, (107), 25 states have call successors, (25), 11 states have call predecessors, (25), 9 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-28 05:57:57,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 155 transitions. [2022-04-28 05:57:57,260 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 155 transitions. Word has length 71 [2022-04-28 05:57:57,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:57:57,260 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 155 transitions. [2022-04-28 05:57:57,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 9 states have internal predecessors, (48), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 05:57:57,260 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 125 states and 155 transitions. [2022-04-28 05:57:58,066 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:57:58,067 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 155 transitions. [2022-04-28 05:57:58,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-28 05:57:58,067 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:57:58,067 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:57:58,085 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-28 05:57:58,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-28 05:57:58,271 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:57:58,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:57:58,272 INFO L85 PathProgramCache]: Analyzing trace with hash -15963768, now seen corresponding path program 1 times [2022-04-28 05:57:58,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:57:58,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [28562525] [2022-04-28 05:57:58,272 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:57:58,273 INFO L85 PathProgramCache]: Analyzing trace with hash -15963768, now seen corresponding path program 2 times [2022-04-28 05:57:58,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:57:58,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984161781] [2022-04-28 05:57:58,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:57:58,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:57:58,288 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:57:58,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1090274771] [2022-04-28 05:57:58,289 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:57:58,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:57:58,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:57:58,290 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:57:58,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-28 05:57:58,332 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:57:58,332 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:57:58,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-28 05:57:58,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:57:58,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:57:58,536 INFO L272 TraceCheckUtils]: 0: Hoare triple {13153#true} call ULTIMATE.init(); {13153#true} is VALID [2022-04-28 05:57:58,536 INFO L290 TraceCheckUtils]: 1: Hoare triple {13153#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {13153#true} is VALID [2022-04-28 05:57:58,536 INFO L290 TraceCheckUtils]: 2: Hoare triple {13153#true} assume true; {13153#true} is VALID [2022-04-28 05:57:58,536 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13153#true} {13153#true} #102#return; {13153#true} is VALID [2022-04-28 05:57:58,536 INFO L272 TraceCheckUtils]: 4: Hoare triple {13153#true} call #t~ret9 := main(); {13153#true} is VALID [2022-04-28 05:57:58,536 INFO L290 TraceCheckUtils]: 5: Hoare triple {13153#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {13153#true} is VALID [2022-04-28 05:57:58,536 INFO L272 TraceCheckUtils]: 6: Hoare triple {13153#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {13153#true} is VALID [2022-04-28 05:57:58,537 INFO L290 TraceCheckUtils]: 7: Hoare triple {13153#true} ~cond := #in~cond; {13153#true} is VALID [2022-04-28 05:57:58,537 INFO L290 TraceCheckUtils]: 8: Hoare triple {13153#true} assume !(0 == ~cond); {13153#true} is VALID [2022-04-28 05:57:58,537 INFO L290 TraceCheckUtils]: 9: Hoare triple {13153#true} assume true; {13153#true} is VALID [2022-04-28 05:57:58,537 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13153#true} {13153#true} #90#return; {13153#true} is VALID [2022-04-28 05:57:58,537 INFO L272 TraceCheckUtils]: 11: Hoare triple {13153#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {13153#true} is VALID [2022-04-28 05:57:58,537 INFO L290 TraceCheckUtils]: 12: Hoare triple {13153#true} ~cond := #in~cond; {13153#true} is VALID [2022-04-28 05:57:58,537 INFO L290 TraceCheckUtils]: 13: Hoare triple {13153#true} assume !(0 == ~cond); {13153#true} is VALID [2022-04-28 05:57:58,537 INFO L290 TraceCheckUtils]: 14: Hoare triple {13153#true} assume true; {13153#true} is VALID [2022-04-28 05:57:58,537 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {13153#true} {13153#true} #92#return; {13153#true} is VALID [2022-04-28 05:57:58,537 INFO L290 TraceCheckUtils]: 16: Hoare triple {13153#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {13153#true} is VALID [2022-04-28 05:57:58,537 INFO L290 TraceCheckUtils]: 17: Hoare triple {13153#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13153#true} is VALID [2022-04-28 05:57:58,537 INFO L290 TraceCheckUtils]: 18: Hoare triple {13153#true} assume !!(#t~post6 < 20);havoc #t~post6; {13153#true} is VALID [2022-04-28 05:57:58,537 INFO L272 TraceCheckUtils]: 19: Hoare triple {13153#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {13153#true} is VALID [2022-04-28 05:57:58,537 INFO L290 TraceCheckUtils]: 20: Hoare triple {13153#true} ~cond := #in~cond; {13153#true} is VALID [2022-04-28 05:57:58,537 INFO L290 TraceCheckUtils]: 21: Hoare triple {13153#true} assume !(0 == ~cond); {13153#true} is VALID [2022-04-28 05:57:58,537 INFO L290 TraceCheckUtils]: 22: Hoare triple {13153#true} assume true; {13153#true} is VALID [2022-04-28 05:57:58,537 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {13153#true} {13153#true} #94#return; {13153#true} is VALID [2022-04-28 05:57:58,537 INFO L290 TraceCheckUtils]: 24: Hoare triple {13153#true} assume !!(0 != ~r~0); {13153#true} is VALID [2022-04-28 05:57:58,538 INFO L290 TraceCheckUtils]: 25: Hoare triple {13153#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {13153#true} is VALID [2022-04-28 05:57:58,538 INFO L290 TraceCheckUtils]: 26: Hoare triple {13153#true} assume !!(#t~post7 < 20);havoc #t~post7; {13153#true} is VALID [2022-04-28 05:57:58,538 INFO L272 TraceCheckUtils]: 27: Hoare triple {13153#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {13153#true} is VALID [2022-04-28 05:57:58,538 INFO L290 TraceCheckUtils]: 28: Hoare triple {13153#true} ~cond := #in~cond; {13153#true} is VALID [2022-04-28 05:57:58,538 INFO L290 TraceCheckUtils]: 29: Hoare triple {13153#true} assume !(0 == ~cond); {13153#true} is VALID [2022-04-28 05:57:58,538 INFO L290 TraceCheckUtils]: 30: Hoare triple {13153#true} assume true; {13153#true} is VALID [2022-04-28 05:57:58,538 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {13153#true} {13153#true} #96#return; {13153#true} is VALID [2022-04-28 05:57:58,538 INFO L290 TraceCheckUtils]: 32: Hoare triple {13153#true} assume !(~r~0 > 0); {13153#true} is VALID [2022-04-28 05:57:58,538 INFO L290 TraceCheckUtils]: 33: Hoare triple {13153#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {13153#true} is VALID [2022-04-28 05:57:58,538 INFO L290 TraceCheckUtils]: 34: Hoare triple {13153#true} assume !!(#t~post8 < 20);havoc #t~post8; {13153#true} is VALID [2022-04-28 05:57:58,538 INFO L272 TraceCheckUtils]: 35: Hoare triple {13153#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {13153#true} is VALID [2022-04-28 05:57:58,538 INFO L290 TraceCheckUtils]: 36: Hoare triple {13153#true} ~cond := #in~cond; {13153#true} is VALID [2022-04-28 05:57:58,538 INFO L290 TraceCheckUtils]: 37: Hoare triple {13153#true} assume !(0 == ~cond); {13153#true} is VALID [2022-04-28 05:57:58,538 INFO L290 TraceCheckUtils]: 38: Hoare triple {13153#true} assume true; {13153#true} is VALID [2022-04-28 05:57:58,538 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {13153#true} {13153#true} #98#return; {13153#true} is VALID [2022-04-28 05:57:58,538 INFO L290 TraceCheckUtils]: 40: Hoare triple {13153#true} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {13153#true} is VALID [2022-04-28 05:57:58,538 INFO L290 TraceCheckUtils]: 41: Hoare triple {13153#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {13153#true} is VALID [2022-04-28 05:57:58,538 INFO L290 TraceCheckUtils]: 42: Hoare triple {13153#true} assume !!(#t~post8 < 20);havoc #t~post8; {13153#true} is VALID [2022-04-28 05:57:58,539 INFO L272 TraceCheckUtils]: 43: Hoare triple {13153#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {13153#true} is VALID [2022-04-28 05:57:58,539 INFO L290 TraceCheckUtils]: 44: Hoare triple {13153#true} ~cond := #in~cond; {13153#true} is VALID [2022-04-28 05:57:58,539 INFO L290 TraceCheckUtils]: 45: Hoare triple {13153#true} assume !(0 == ~cond); {13153#true} is VALID [2022-04-28 05:57:58,539 INFO L290 TraceCheckUtils]: 46: Hoare triple {13153#true} assume true; {13153#true} is VALID [2022-04-28 05:57:58,539 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {13153#true} {13153#true} #98#return; {13153#true} is VALID [2022-04-28 05:57:58,539 INFO L290 TraceCheckUtils]: 48: Hoare triple {13153#true} assume !(~r~0 < 0); {13302#(not (< main_~r~0 0))} is VALID [2022-04-28 05:57:58,539 INFO L290 TraceCheckUtils]: 49: Hoare triple {13302#(not (< main_~r~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13302#(not (< main_~r~0 0))} is VALID [2022-04-28 05:57:58,540 INFO L290 TraceCheckUtils]: 50: Hoare triple {13302#(not (< main_~r~0 0))} assume !!(#t~post6 < 20);havoc #t~post6; {13302#(not (< main_~r~0 0))} is VALID [2022-04-28 05:57:58,540 INFO L272 TraceCheckUtils]: 51: Hoare triple {13302#(not (< main_~r~0 0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {13153#true} is VALID [2022-04-28 05:57:58,540 INFO L290 TraceCheckUtils]: 52: Hoare triple {13153#true} ~cond := #in~cond; {13153#true} is VALID [2022-04-28 05:57:58,540 INFO L290 TraceCheckUtils]: 53: Hoare triple {13153#true} assume !(0 == ~cond); {13153#true} is VALID [2022-04-28 05:57:58,540 INFO L290 TraceCheckUtils]: 54: Hoare triple {13153#true} assume true; {13153#true} is VALID [2022-04-28 05:57:58,540 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {13153#true} {13302#(not (< main_~r~0 0))} #94#return; {13302#(not (< main_~r~0 0))} is VALID [2022-04-28 05:57:58,541 INFO L290 TraceCheckUtils]: 56: Hoare triple {13302#(not (< main_~r~0 0))} assume !!(0 != ~r~0); {13327#(and (not (= main_~r~0 0)) (not (< main_~r~0 0)))} is VALID [2022-04-28 05:57:58,541 INFO L290 TraceCheckUtils]: 57: Hoare triple {13327#(and (not (= main_~r~0 0)) (not (< main_~r~0 0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {13327#(and (not (= main_~r~0 0)) (not (< main_~r~0 0)))} is VALID [2022-04-28 05:57:58,541 INFO L290 TraceCheckUtils]: 58: Hoare triple {13327#(and (not (= main_~r~0 0)) (not (< main_~r~0 0)))} assume !!(#t~post7 < 20);havoc #t~post7; {13327#(and (not (= main_~r~0 0)) (not (< main_~r~0 0)))} is VALID [2022-04-28 05:57:58,541 INFO L272 TraceCheckUtils]: 59: Hoare triple {13327#(and (not (= main_~r~0 0)) (not (< main_~r~0 0)))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {13153#true} is VALID [2022-04-28 05:57:58,541 INFO L290 TraceCheckUtils]: 60: Hoare triple {13153#true} ~cond := #in~cond; {13153#true} is VALID [2022-04-28 05:57:58,541 INFO L290 TraceCheckUtils]: 61: Hoare triple {13153#true} assume !(0 == ~cond); {13153#true} is VALID [2022-04-28 05:57:58,542 INFO L290 TraceCheckUtils]: 62: Hoare triple {13153#true} assume true; {13153#true} is VALID [2022-04-28 05:57:58,542 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {13153#true} {13327#(and (not (= main_~r~0 0)) (not (< main_~r~0 0)))} #96#return; {13327#(and (not (= main_~r~0 0)) (not (< main_~r~0 0)))} is VALID [2022-04-28 05:57:58,542 INFO L290 TraceCheckUtils]: 64: Hoare triple {13327#(and (not (= main_~r~0 0)) (not (< main_~r~0 0)))} assume !(~r~0 > 0); {13154#false} is VALID [2022-04-28 05:57:58,542 INFO L290 TraceCheckUtils]: 65: Hoare triple {13154#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {13154#false} is VALID [2022-04-28 05:57:58,542 INFO L290 TraceCheckUtils]: 66: Hoare triple {13154#false} assume !(#t~post8 < 20);havoc #t~post8; {13154#false} is VALID [2022-04-28 05:57:58,543 INFO L290 TraceCheckUtils]: 67: Hoare triple {13154#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13154#false} is VALID [2022-04-28 05:57:58,543 INFO L290 TraceCheckUtils]: 68: Hoare triple {13154#false} assume !(#t~post6 < 20);havoc #t~post6; {13154#false} is VALID [2022-04-28 05:57:58,543 INFO L272 TraceCheckUtils]: 69: Hoare triple {13154#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {13154#false} is VALID [2022-04-28 05:57:58,543 INFO L290 TraceCheckUtils]: 70: Hoare triple {13154#false} ~cond := #in~cond; {13154#false} is VALID [2022-04-28 05:57:58,543 INFO L290 TraceCheckUtils]: 71: Hoare triple {13154#false} assume 0 == ~cond; {13154#false} is VALID [2022-04-28 05:57:58,543 INFO L290 TraceCheckUtils]: 72: Hoare triple {13154#false} assume !false; {13154#false} is VALID [2022-04-28 05:57:58,543 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-04-28 05:57:58,543 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 05:57:58,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:57:58,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984161781] [2022-04-28 05:57:58,543 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:57:58,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1090274771] [2022-04-28 05:57:58,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1090274771] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:57:58,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:57:58,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 05:57:58,544 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:57:58,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [28562525] [2022-04-28 05:57:58,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [28562525] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:57:58,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:57:58,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 05:57:58,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496027559] [2022-04-28 05:57:58,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:57:58,544 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 73 [2022-04-28 05:57:58,544 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:57:58,545 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 05:57:58,578 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:57:58,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 05:57:58,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:57:58,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 05:57:58,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-28 05:57:58,578 INFO L87 Difference]: Start difference. First operand 125 states and 155 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 05:57:58,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:58,821 INFO L93 Difference]: Finished difference Result 180 states and 235 transitions. [2022-04-28 05:57:58,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 05:57:58,822 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 73 [2022-04-28 05:57:58,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:57:58,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 05:57:58,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2022-04-28 05:57:58,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 05:57:58,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2022-04-28 05:57:58,823 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 94 transitions. [2022-04-28 05:57:58,886 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:57:58,888 INFO L225 Difference]: With dead ends: 180 [2022-04-28 05:57:58,888 INFO L226 Difference]: Without dead ends: 143 [2022-04-28 05:57:58,888 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-28 05:57:58,889 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 17 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 05:57:58,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 93 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 05:57:58,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-04-28 05:57:59,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 137. [2022-04-28 05:57:59,057 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:57:59,057 INFO L82 GeneralOperation]: Start isEquivalent. First operand 143 states. Second operand has 137 states, 99 states have (on average 1.202020202020202) internal successors, (119), 102 states have internal predecessors, (119), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 05:57:59,058 INFO L74 IsIncluded]: Start isIncluded. First operand 143 states. Second operand has 137 states, 99 states have (on average 1.202020202020202) internal successors, (119), 102 states have internal predecessors, (119), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 05:57:59,058 INFO L87 Difference]: Start difference. First operand 143 states. Second operand has 137 states, 99 states have (on average 1.202020202020202) internal successors, (119), 102 states have internal predecessors, (119), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 05:57:59,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:59,061 INFO L93 Difference]: Finished difference Result 143 states and 181 transitions. [2022-04-28 05:57:59,061 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 181 transitions. [2022-04-28 05:57:59,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:57:59,061 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:57:59,062 INFO L74 IsIncluded]: Start isIncluded. First operand has 137 states, 99 states have (on average 1.202020202020202) internal successors, (119), 102 states have internal predecessors, (119), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) Second operand 143 states. [2022-04-28 05:57:59,062 INFO L87 Difference]: Start difference. First operand has 137 states, 99 states have (on average 1.202020202020202) internal successors, (119), 102 states have internal predecessors, (119), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) Second operand 143 states. [2022-04-28 05:57:59,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:59,065 INFO L93 Difference]: Finished difference Result 143 states and 181 transitions. [2022-04-28 05:57:59,065 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 181 transitions. [2022-04-28 05:57:59,065 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:57:59,065 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:57:59,066 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:57:59,066 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:57:59,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 99 states have (on average 1.202020202020202) internal successors, (119), 102 states have internal predecessors, (119), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 05:57:59,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 173 transitions. [2022-04-28 05:57:59,069 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 173 transitions. Word has length 73 [2022-04-28 05:57:59,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:57:59,069 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 173 transitions. [2022-04-28 05:57:59,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 05:57:59,069 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 137 states and 173 transitions. [2022-04-28 05:57:59,663 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 173 edges. 173 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:57:59,663 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 173 transitions. [2022-04-28 05:57:59,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-28 05:57:59,665 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:57:59,665 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 5, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:57:59,682 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-28 05:57:59,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-28 05:57:59,871 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:57:59,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:57:59,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1401128268, now seen corresponding path program 7 times [2022-04-28 05:57:59,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:57:59,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1187720936] [2022-04-28 05:57:59,872 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:57:59,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1401128268, now seen corresponding path program 8 times [2022-04-28 05:57:59,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:57:59,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084967549] [2022-04-28 05:57:59,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:57:59,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:57:59,884 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:57:59,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [667490977] [2022-04-28 05:57:59,884 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:57:59,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:57:59,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:57:59,885 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:57:59,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-28 05:57:59,932 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:57:59,932 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:57:59,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-28 05:57:59,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:57:59,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:58:00,336 INFO L272 TraceCheckUtils]: 0: Hoare triple {14295#true} call ULTIMATE.init(); {14295#true} is VALID [2022-04-28 05:58:00,337 INFO L290 TraceCheckUtils]: 1: Hoare triple {14295#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {14303#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:00,337 INFO L290 TraceCheckUtils]: 2: Hoare triple {14303#(<= ~counter~0 0)} assume true; {14303#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:00,338 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14303#(<= ~counter~0 0)} {14295#true} #102#return; {14303#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:00,338 INFO L272 TraceCheckUtils]: 4: Hoare triple {14303#(<= ~counter~0 0)} call #t~ret9 := main(); {14303#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:00,338 INFO L290 TraceCheckUtils]: 5: Hoare triple {14303#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {14303#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:00,339 INFO L272 TraceCheckUtils]: 6: Hoare triple {14303#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {14303#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:00,339 INFO L290 TraceCheckUtils]: 7: Hoare triple {14303#(<= ~counter~0 0)} ~cond := #in~cond; {14303#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:00,339 INFO L290 TraceCheckUtils]: 8: Hoare triple {14303#(<= ~counter~0 0)} assume !(0 == ~cond); {14303#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:00,340 INFO L290 TraceCheckUtils]: 9: Hoare triple {14303#(<= ~counter~0 0)} assume true; {14303#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:00,340 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14303#(<= ~counter~0 0)} {14303#(<= ~counter~0 0)} #90#return; {14303#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:00,341 INFO L272 TraceCheckUtils]: 11: Hoare triple {14303#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {14303#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:00,341 INFO L290 TraceCheckUtils]: 12: Hoare triple {14303#(<= ~counter~0 0)} ~cond := #in~cond; {14303#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:00,341 INFO L290 TraceCheckUtils]: 13: Hoare triple {14303#(<= ~counter~0 0)} assume !(0 == ~cond); {14303#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:00,342 INFO L290 TraceCheckUtils]: 14: Hoare triple {14303#(<= ~counter~0 0)} assume true; {14303#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:00,342 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {14303#(<= ~counter~0 0)} {14303#(<= ~counter~0 0)} #92#return; {14303#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:00,343 INFO L290 TraceCheckUtils]: 16: Hoare triple {14303#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {14303#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:00,343 INFO L290 TraceCheckUtils]: 17: Hoare triple {14303#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14352#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:00,344 INFO L290 TraceCheckUtils]: 18: Hoare triple {14352#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {14352#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:00,344 INFO L272 TraceCheckUtils]: 19: Hoare triple {14352#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {14352#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:00,345 INFO L290 TraceCheckUtils]: 20: Hoare triple {14352#(<= ~counter~0 1)} ~cond := #in~cond; {14352#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:00,345 INFO L290 TraceCheckUtils]: 21: Hoare triple {14352#(<= ~counter~0 1)} assume !(0 == ~cond); {14352#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:00,346 INFO L290 TraceCheckUtils]: 22: Hoare triple {14352#(<= ~counter~0 1)} assume true; {14352#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:00,346 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {14352#(<= ~counter~0 1)} {14352#(<= ~counter~0 1)} #94#return; {14352#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:00,347 INFO L290 TraceCheckUtils]: 24: Hoare triple {14352#(<= ~counter~0 1)} assume !!(0 != ~r~0); {14352#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:00,347 INFO L290 TraceCheckUtils]: 25: Hoare triple {14352#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {14377#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:00,348 INFO L290 TraceCheckUtils]: 26: Hoare triple {14377#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {14377#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:00,348 INFO L272 TraceCheckUtils]: 27: Hoare triple {14377#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {14377#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:00,349 INFO L290 TraceCheckUtils]: 28: Hoare triple {14377#(<= ~counter~0 2)} ~cond := #in~cond; {14377#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:00,349 INFO L290 TraceCheckUtils]: 29: Hoare triple {14377#(<= ~counter~0 2)} assume !(0 == ~cond); {14377#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:00,349 INFO L290 TraceCheckUtils]: 30: Hoare triple {14377#(<= ~counter~0 2)} assume true; {14377#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:00,350 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {14377#(<= ~counter~0 2)} {14377#(<= ~counter~0 2)} #96#return; {14377#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:00,350 INFO L290 TraceCheckUtils]: 32: Hoare triple {14377#(<= ~counter~0 2)} assume !(~r~0 > 0); {14377#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:00,351 INFO L290 TraceCheckUtils]: 33: Hoare triple {14377#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {14402#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:00,351 INFO L290 TraceCheckUtils]: 34: Hoare triple {14402#(<= ~counter~0 3)} assume !!(#t~post8 < 20);havoc #t~post8; {14402#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:00,352 INFO L272 TraceCheckUtils]: 35: Hoare triple {14402#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {14402#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:00,352 INFO L290 TraceCheckUtils]: 36: Hoare triple {14402#(<= ~counter~0 3)} ~cond := #in~cond; {14402#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:00,352 INFO L290 TraceCheckUtils]: 37: Hoare triple {14402#(<= ~counter~0 3)} assume !(0 == ~cond); {14402#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:00,353 INFO L290 TraceCheckUtils]: 38: Hoare triple {14402#(<= ~counter~0 3)} assume true; {14402#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:00,353 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {14402#(<= ~counter~0 3)} {14402#(<= ~counter~0 3)} #98#return; {14402#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:00,354 INFO L290 TraceCheckUtils]: 40: Hoare triple {14402#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {14402#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:00,354 INFO L290 TraceCheckUtils]: 41: Hoare triple {14402#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {14427#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:00,355 INFO L290 TraceCheckUtils]: 42: Hoare triple {14427#(<= ~counter~0 4)} assume !!(#t~post8 < 20);havoc #t~post8; {14427#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:00,355 INFO L272 TraceCheckUtils]: 43: Hoare triple {14427#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {14427#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:00,356 INFO L290 TraceCheckUtils]: 44: Hoare triple {14427#(<= ~counter~0 4)} ~cond := #in~cond; {14427#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:00,357 INFO L290 TraceCheckUtils]: 45: Hoare triple {14427#(<= ~counter~0 4)} assume !(0 == ~cond); {14427#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:00,357 INFO L290 TraceCheckUtils]: 46: Hoare triple {14427#(<= ~counter~0 4)} assume true; {14427#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:00,358 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {14427#(<= ~counter~0 4)} {14427#(<= ~counter~0 4)} #98#return; {14427#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:00,358 INFO L290 TraceCheckUtils]: 48: Hoare triple {14427#(<= ~counter~0 4)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {14427#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:00,359 INFO L290 TraceCheckUtils]: 49: Hoare triple {14427#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {14452#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:00,359 INFO L290 TraceCheckUtils]: 50: Hoare triple {14452#(<= ~counter~0 5)} assume !!(#t~post8 < 20);havoc #t~post8; {14452#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:00,360 INFO L272 TraceCheckUtils]: 51: Hoare triple {14452#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {14452#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:00,360 INFO L290 TraceCheckUtils]: 52: Hoare triple {14452#(<= ~counter~0 5)} ~cond := #in~cond; {14452#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:00,360 INFO L290 TraceCheckUtils]: 53: Hoare triple {14452#(<= ~counter~0 5)} assume !(0 == ~cond); {14452#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:00,361 INFO L290 TraceCheckUtils]: 54: Hoare triple {14452#(<= ~counter~0 5)} assume true; {14452#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:00,361 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {14452#(<= ~counter~0 5)} {14452#(<= ~counter~0 5)} #98#return; {14452#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:00,362 INFO L290 TraceCheckUtils]: 56: Hoare triple {14452#(<= ~counter~0 5)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {14452#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:00,362 INFO L290 TraceCheckUtils]: 57: Hoare triple {14452#(<= ~counter~0 5)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {14477#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:00,362 INFO L290 TraceCheckUtils]: 58: Hoare triple {14477#(<= ~counter~0 6)} assume !!(#t~post8 < 20);havoc #t~post8; {14477#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:00,363 INFO L272 TraceCheckUtils]: 59: Hoare triple {14477#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {14477#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:00,363 INFO L290 TraceCheckUtils]: 60: Hoare triple {14477#(<= ~counter~0 6)} ~cond := #in~cond; {14477#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:00,364 INFO L290 TraceCheckUtils]: 61: Hoare triple {14477#(<= ~counter~0 6)} assume !(0 == ~cond); {14477#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:00,364 INFO L290 TraceCheckUtils]: 62: Hoare triple {14477#(<= ~counter~0 6)} assume true; {14477#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:00,365 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {14477#(<= ~counter~0 6)} {14477#(<= ~counter~0 6)} #98#return; {14477#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:00,365 INFO L290 TraceCheckUtils]: 64: Hoare triple {14477#(<= ~counter~0 6)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {14477#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:00,365 INFO L290 TraceCheckUtils]: 65: Hoare triple {14477#(<= ~counter~0 6)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {14502#(<= |main_#t~post8| 6)} is VALID [2022-04-28 05:58:00,366 INFO L290 TraceCheckUtils]: 66: Hoare triple {14502#(<= |main_#t~post8| 6)} assume !(#t~post8 < 20);havoc #t~post8; {14296#false} is VALID [2022-04-28 05:58:00,366 INFO L290 TraceCheckUtils]: 67: Hoare triple {14296#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14296#false} is VALID [2022-04-28 05:58:00,366 INFO L290 TraceCheckUtils]: 68: Hoare triple {14296#false} assume !(#t~post6 < 20);havoc #t~post6; {14296#false} is VALID [2022-04-28 05:58:00,366 INFO L272 TraceCheckUtils]: 69: Hoare triple {14296#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {14296#false} is VALID [2022-04-28 05:58:00,366 INFO L290 TraceCheckUtils]: 70: Hoare triple {14296#false} ~cond := #in~cond; {14296#false} is VALID [2022-04-28 05:58:00,366 INFO L290 TraceCheckUtils]: 71: Hoare triple {14296#false} assume 0 == ~cond; {14296#false} is VALID [2022-04-28 05:58:00,366 INFO L290 TraceCheckUtils]: 72: Hoare triple {14296#false} assume !false; {14296#false} is VALID [2022-04-28 05:58:00,367 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 14 proven. 92 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 05:58:00,367 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:58:00,748 INFO L290 TraceCheckUtils]: 72: Hoare triple {14296#false} assume !false; {14296#false} is VALID [2022-04-28 05:58:00,749 INFO L290 TraceCheckUtils]: 71: Hoare triple {14296#false} assume 0 == ~cond; {14296#false} is VALID [2022-04-28 05:58:00,749 INFO L290 TraceCheckUtils]: 70: Hoare triple {14296#false} ~cond := #in~cond; {14296#false} is VALID [2022-04-28 05:58:00,749 INFO L272 TraceCheckUtils]: 69: Hoare triple {14296#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {14296#false} is VALID [2022-04-28 05:58:00,749 INFO L290 TraceCheckUtils]: 68: Hoare triple {14296#false} assume !(#t~post6 < 20);havoc #t~post6; {14296#false} is VALID [2022-04-28 05:58:00,749 INFO L290 TraceCheckUtils]: 67: Hoare triple {14296#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14296#false} is VALID [2022-04-28 05:58:00,749 INFO L290 TraceCheckUtils]: 66: Hoare triple {14542#(< |main_#t~post8| 20)} assume !(#t~post8 < 20);havoc #t~post8; {14296#false} is VALID [2022-04-28 05:58:00,749 INFO L290 TraceCheckUtils]: 65: Hoare triple {14546#(< ~counter~0 20)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {14542#(< |main_#t~post8| 20)} is VALID [2022-04-28 05:58:00,750 INFO L290 TraceCheckUtils]: 64: Hoare triple {14546#(< ~counter~0 20)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {14546#(< ~counter~0 20)} is VALID [2022-04-28 05:58:00,750 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {14295#true} {14546#(< ~counter~0 20)} #98#return; {14546#(< ~counter~0 20)} is VALID [2022-04-28 05:58:00,750 INFO L290 TraceCheckUtils]: 62: Hoare triple {14295#true} assume true; {14295#true} is VALID [2022-04-28 05:58:00,750 INFO L290 TraceCheckUtils]: 61: Hoare triple {14295#true} assume !(0 == ~cond); {14295#true} is VALID [2022-04-28 05:58:00,750 INFO L290 TraceCheckUtils]: 60: Hoare triple {14295#true} ~cond := #in~cond; {14295#true} is VALID [2022-04-28 05:58:00,750 INFO L272 TraceCheckUtils]: 59: Hoare triple {14546#(< ~counter~0 20)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {14295#true} is VALID [2022-04-28 05:58:00,751 INFO L290 TraceCheckUtils]: 58: Hoare triple {14546#(< ~counter~0 20)} assume !!(#t~post8 < 20);havoc #t~post8; {14546#(< ~counter~0 20)} is VALID [2022-04-28 05:58:00,751 INFO L290 TraceCheckUtils]: 57: Hoare triple {14571#(< ~counter~0 19)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {14546#(< ~counter~0 20)} is VALID [2022-04-28 05:58:00,752 INFO L290 TraceCheckUtils]: 56: Hoare triple {14571#(< ~counter~0 19)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {14571#(< ~counter~0 19)} is VALID [2022-04-28 05:58:00,752 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {14295#true} {14571#(< ~counter~0 19)} #98#return; {14571#(< ~counter~0 19)} is VALID [2022-04-28 05:58:00,752 INFO L290 TraceCheckUtils]: 54: Hoare triple {14295#true} assume true; {14295#true} is VALID [2022-04-28 05:58:00,752 INFO L290 TraceCheckUtils]: 53: Hoare triple {14295#true} assume !(0 == ~cond); {14295#true} is VALID [2022-04-28 05:58:00,752 INFO L290 TraceCheckUtils]: 52: Hoare triple {14295#true} ~cond := #in~cond; {14295#true} is VALID [2022-04-28 05:58:00,752 INFO L272 TraceCheckUtils]: 51: Hoare triple {14571#(< ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {14295#true} is VALID [2022-04-28 05:58:00,753 INFO L290 TraceCheckUtils]: 50: Hoare triple {14571#(< ~counter~0 19)} assume !!(#t~post8 < 20);havoc #t~post8; {14571#(< ~counter~0 19)} is VALID [2022-04-28 05:58:00,753 INFO L290 TraceCheckUtils]: 49: Hoare triple {14596#(< ~counter~0 18)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {14571#(< ~counter~0 19)} is VALID [2022-04-28 05:58:00,753 INFO L290 TraceCheckUtils]: 48: Hoare triple {14596#(< ~counter~0 18)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {14596#(< ~counter~0 18)} is VALID [2022-04-28 05:58:00,754 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {14295#true} {14596#(< ~counter~0 18)} #98#return; {14596#(< ~counter~0 18)} is VALID [2022-04-28 05:58:00,754 INFO L290 TraceCheckUtils]: 46: Hoare triple {14295#true} assume true; {14295#true} is VALID [2022-04-28 05:58:00,754 INFO L290 TraceCheckUtils]: 45: Hoare triple {14295#true} assume !(0 == ~cond); {14295#true} is VALID [2022-04-28 05:58:00,754 INFO L290 TraceCheckUtils]: 44: Hoare triple {14295#true} ~cond := #in~cond; {14295#true} is VALID [2022-04-28 05:58:00,754 INFO L272 TraceCheckUtils]: 43: Hoare triple {14596#(< ~counter~0 18)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {14295#true} is VALID [2022-04-28 05:58:00,754 INFO L290 TraceCheckUtils]: 42: Hoare triple {14596#(< ~counter~0 18)} assume !!(#t~post8 < 20);havoc #t~post8; {14596#(< ~counter~0 18)} is VALID [2022-04-28 05:58:00,755 INFO L290 TraceCheckUtils]: 41: Hoare triple {14621#(< ~counter~0 17)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {14596#(< ~counter~0 18)} is VALID [2022-04-28 05:58:00,755 INFO L290 TraceCheckUtils]: 40: Hoare triple {14621#(< ~counter~0 17)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {14621#(< ~counter~0 17)} is VALID [2022-04-28 05:58:00,756 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {14295#true} {14621#(< ~counter~0 17)} #98#return; {14621#(< ~counter~0 17)} is VALID [2022-04-28 05:58:00,756 INFO L290 TraceCheckUtils]: 38: Hoare triple {14295#true} assume true; {14295#true} is VALID [2022-04-28 05:58:00,756 INFO L290 TraceCheckUtils]: 37: Hoare triple {14295#true} assume !(0 == ~cond); {14295#true} is VALID [2022-04-28 05:58:00,756 INFO L290 TraceCheckUtils]: 36: Hoare triple {14295#true} ~cond := #in~cond; {14295#true} is VALID [2022-04-28 05:58:00,756 INFO L272 TraceCheckUtils]: 35: Hoare triple {14621#(< ~counter~0 17)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {14295#true} is VALID [2022-04-28 05:58:00,756 INFO L290 TraceCheckUtils]: 34: Hoare triple {14621#(< ~counter~0 17)} assume !!(#t~post8 < 20);havoc #t~post8; {14621#(< ~counter~0 17)} is VALID [2022-04-28 05:58:00,757 INFO L290 TraceCheckUtils]: 33: Hoare triple {14646#(< ~counter~0 16)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {14621#(< ~counter~0 17)} is VALID [2022-04-28 05:58:00,757 INFO L290 TraceCheckUtils]: 32: Hoare triple {14646#(< ~counter~0 16)} assume !(~r~0 > 0); {14646#(< ~counter~0 16)} is VALID [2022-04-28 05:58:00,757 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {14295#true} {14646#(< ~counter~0 16)} #96#return; {14646#(< ~counter~0 16)} is VALID [2022-04-28 05:58:00,757 INFO L290 TraceCheckUtils]: 30: Hoare triple {14295#true} assume true; {14295#true} is VALID [2022-04-28 05:58:00,757 INFO L290 TraceCheckUtils]: 29: Hoare triple {14295#true} assume !(0 == ~cond); {14295#true} is VALID [2022-04-28 05:58:00,757 INFO L290 TraceCheckUtils]: 28: Hoare triple {14295#true} ~cond := #in~cond; {14295#true} is VALID [2022-04-28 05:58:00,758 INFO L272 TraceCheckUtils]: 27: Hoare triple {14646#(< ~counter~0 16)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {14295#true} is VALID [2022-04-28 05:58:00,758 INFO L290 TraceCheckUtils]: 26: Hoare triple {14646#(< ~counter~0 16)} assume !!(#t~post7 < 20);havoc #t~post7; {14646#(< ~counter~0 16)} is VALID [2022-04-28 05:58:00,758 INFO L290 TraceCheckUtils]: 25: Hoare triple {14671#(< ~counter~0 15)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {14646#(< ~counter~0 16)} is VALID [2022-04-28 05:58:00,759 INFO L290 TraceCheckUtils]: 24: Hoare triple {14671#(< ~counter~0 15)} assume !!(0 != ~r~0); {14671#(< ~counter~0 15)} is VALID [2022-04-28 05:58:00,759 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {14295#true} {14671#(< ~counter~0 15)} #94#return; {14671#(< ~counter~0 15)} is VALID [2022-04-28 05:58:00,759 INFO L290 TraceCheckUtils]: 22: Hoare triple {14295#true} assume true; {14295#true} is VALID [2022-04-28 05:58:00,759 INFO L290 TraceCheckUtils]: 21: Hoare triple {14295#true} assume !(0 == ~cond); {14295#true} is VALID [2022-04-28 05:58:00,759 INFO L290 TraceCheckUtils]: 20: Hoare triple {14295#true} ~cond := #in~cond; {14295#true} is VALID [2022-04-28 05:58:00,759 INFO L272 TraceCheckUtils]: 19: Hoare triple {14671#(< ~counter~0 15)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {14295#true} is VALID [2022-04-28 05:58:00,760 INFO L290 TraceCheckUtils]: 18: Hoare triple {14671#(< ~counter~0 15)} assume !!(#t~post6 < 20);havoc #t~post6; {14671#(< ~counter~0 15)} is VALID [2022-04-28 05:58:00,760 INFO L290 TraceCheckUtils]: 17: Hoare triple {14696#(< ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14671#(< ~counter~0 15)} is VALID [2022-04-28 05:58:00,760 INFO L290 TraceCheckUtils]: 16: Hoare triple {14696#(< ~counter~0 14)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {14696#(< ~counter~0 14)} is VALID [2022-04-28 05:58:00,761 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {14295#true} {14696#(< ~counter~0 14)} #92#return; {14696#(< ~counter~0 14)} is VALID [2022-04-28 05:58:00,761 INFO L290 TraceCheckUtils]: 14: Hoare triple {14295#true} assume true; {14295#true} is VALID [2022-04-28 05:58:00,761 INFO L290 TraceCheckUtils]: 13: Hoare triple {14295#true} assume !(0 == ~cond); {14295#true} is VALID [2022-04-28 05:58:00,761 INFO L290 TraceCheckUtils]: 12: Hoare triple {14295#true} ~cond := #in~cond; {14295#true} is VALID [2022-04-28 05:58:00,761 INFO L272 TraceCheckUtils]: 11: Hoare triple {14696#(< ~counter~0 14)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {14295#true} is VALID [2022-04-28 05:58:00,761 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14295#true} {14696#(< ~counter~0 14)} #90#return; {14696#(< ~counter~0 14)} is VALID [2022-04-28 05:58:00,761 INFO L290 TraceCheckUtils]: 9: Hoare triple {14295#true} assume true; {14295#true} is VALID [2022-04-28 05:58:00,761 INFO L290 TraceCheckUtils]: 8: Hoare triple {14295#true} assume !(0 == ~cond); {14295#true} is VALID [2022-04-28 05:58:00,761 INFO L290 TraceCheckUtils]: 7: Hoare triple {14295#true} ~cond := #in~cond; {14295#true} is VALID [2022-04-28 05:58:00,762 INFO L272 TraceCheckUtils]: 6: Hoare triple {14696#(< ~counter~0 14)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {14295#true} is VALID [2022-04-28 05:58:00,762 INFO L290 TraceCheckUtils]: 5: Hoare triple {14696#(< ~counter~0 14)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {14696#(< ~counter~0 14)} is VALID [2022-04-28 05:58:00,762 INFO L272 TraceCheckUtils]: 4: Hoare triple {14696#(< ~counter~0 14)} call #t~ret9 := main(); {14696#(< ~counter~0 14)} is VALID [2022-04-28 05:58:00,762 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14696#(< ~counter~0 14)} {14295#true} #102#return; {14696#(< ~counter~0 14)} is VALID [2022-04-28 05:58:00,763 INFO L290 TraceCheckUtils]: 2: Hoare triple {14696#(< ~counter~0 14)} assume true; {14696#(< ~counter~0 14)} is VALID [2022-04-28 05:58:00,763 INFO L290 TraceCheckUtils]: 1: Hoare triple {14295#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {14696#(< ~counter~0 14)} is VALID [2022-04-28 05:58:00,763 INFO L272 TraceCheckUtils]: 0: Hoare triple {14295#true} call ULTIMATE.init(); {14295#true} is VALID [2022-04-28 05:58:00,763 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 14 proven. 32 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-04-28 05:58:00,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:58:00,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084967549] [2022-04-28 05:58:00,764 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:58:00,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [667490977] [2022-04-28 05:58:00,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [667490977] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:58:00,764 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:58:00,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-04-28 05:58:00,764 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:58:00,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1187720936] [2022-04-28 05:58:00,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1187720936] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:58:00,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:58:00,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 05:58:00,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465702335] [2022-04-28 05:58:00,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:58:00,765 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) Word has length 73 [2022-04-28 05:58:00,765 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:58:00,765 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 05:58:00,813 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:58:00,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 05:58:00,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:58:00,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 05:58:00,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2022-04-28 05:58:00,814 INFO L87 Difference]: Start difference. First operand 137 states and 173 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 05:58:01,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:58:01,321 INFO L93 Difference]: Finished difference Result 193 states and 252 transitions. [2022-04-28 05:58:01,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 05:58:01,322 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) Word has length 73 [2022-04-28 05:58:01,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:58:01,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 05:58:01,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 157 transitions. [2022-04-28 05:58:01,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 05:58:01,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 157 transitions. [2022-04-28 05:58:01,326 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 157 transitions. [2022-04-28 05:58:01,445 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 157 edges. 157 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:58:01,447 INFO L225 Difference]: With dead ends: 193 [2022-04-28 05:58:01,448 INFO L226 Difference]: Without dead ends: 144 [2022-04-28 05:58:01,448 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=185, Invalid=277, Unknown=0, NotChecked=0, Total=462 [2022-04-28 05:58:01,448 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 53 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 05:58:01,449 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 197 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 05:58:01,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-04-28 05:58:01,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 140. [2022-04-28 05:58:01,595 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:58:01,596 INFO L82 GeneralOperation]: Start isEquivalent. First operand 144 states. Second operand has 140 states, 102 states have (on average 1.2058823529411764) internal successors, (123), 104 states have internal predecessors, (123), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 05:58:01,596 INFO L74 IsIncluded]: Start isIncluded. First operand 144 states. Second operand has 140 states, 102 states have (on average 1.2058823529411764) internal successors, (123), 104 states have internal predecessors, (123), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 05:58:01,596 INFO L87 Difference]: Start difference. First operand 144 states. Second operand has 140 states, 102 states have (on average 1.2058823529411764) internal successors, (123), 104 states have internal predecessors, (123), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 05:58:01,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:58:01,599 INFO L93 Difference]: Finished difference Result 144 states and 181 transitions. [2022-04-28 05:58:01,599 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 181 transitions. [2022-04-28 05:58:01,600 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:58:01,600 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:58:01,600 INFO L74 IsIncluded]: Start isIncluded. First operand has 140 states, 102 states have (on average 1.2058823529411764) internal successors, (123), 104 states have internal predecessors, (123), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) Second operand 144 states. [2022-04-28 05:58:01,600 INFO L87 Difference]: Start difference. First operand has 140 states, 102 states have (on average 1.2058823529411764) internal successors, (123), 104 states have internal predecessors, (123), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) Second operand 144 states. [2022-04-28 05:58:01,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:58:01,603 INFO L93 Difference]: Finished difference Result 144 states and 181 transitions. [2022-04-28 05:58:01,603 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 181 transitions. [2022-04-28 05:58:01,603 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:58:01,603 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:58:01,603 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:58:01,604 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:58:01,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 102 states have (on average 1.2058823529411764) internal successors, (123), 104 states have internal predecessors, (123), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 05:58:01,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 177 transitions. [2022-04-28 05:58:01,607 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 177 transitions. Word has length 73 [2022-04-28 05:58:01,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:58:01,607 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 177 transitions. [2022-04-28 05:58:01,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 05:58:01,607 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 140 states and 177 transitions. [2022-04-28 05:58:03,845 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 177 edges. 176 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 05:58:03,845 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 177 transitions. [2022-04-28 05:58:03,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-28 05:58:03,846 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:58:03,846 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:58:03,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-28 05:58:04,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:58:04,068 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:58:04,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:58:04,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1116733197, now seen corresponding path program 1 times [2022-04-28 05:58:04,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:58:04,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [415989061] [2022-04-28 05:58:04,069 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:58:04,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1116733197, now seen corresponding path program 2 times [2022-04-28 05:58:04,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:58:04,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481227433] [2022-04-28 05:58:04,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:58:04,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:58:04,084 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:58:04,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [867164668] [2022-04-28 05:58:04,084 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:58:04,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:58:04,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:58:04,085 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:58:04,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-28 05:58:04,139 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:58:04,139 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:58:04,140 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-28 05:58:04,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:58:04,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:58:04,499 INFO L272 TraceCheckUtils]: 0: Hoare triple {15712#true} call ULTIMATE.init(); {15712#true} is VALID [2022-04-28 05:58:04,500 INFO L290 TraceCheckUtils]: 1: Hoare triple {15712#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {15720#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:04,500 INFO L290 TraceCheckUtils]: 2: Hoare triple {15720#(<= ~counter~0 0)} assume true; {15720#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:04,501 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15720#(<= ~counter~0 0)} {15712#true} #102#return; {15720#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:04,501 INFO L272 TraceCheckUtils]: 4: Hoare triple {15720#(<= ~counter~0 0)} call #t~ret9 := main(); {15720#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:04,501 INFO L290 TraceCheckUtils]: 5: Hoare triple {15720#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {15720#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:04,502 INFO L272 TraceCheckUtils]: 6: Hoare triple {15720#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {15720#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:04,502 INFO L290 TraceCheckUtils]: 7: Hoare triple {15720#(<= ~counter~0 0)} ~cond := #in~cond; {15720#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:04,503 INFO L290 TraceCheckUtils]: 8: Hoare triple {15720#(<= ~counter~0 0)} assume !(0 == ~cond); {15720#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:04,503 INFO L290 TraceCheckUtils]: 9: Hoare triple {15720#(<= ~counter~0 0)} assume true; {15720#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:04,504 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {15720#(<= ~counter~0 0)} {15720#(<= ~counter~0 0)} #90#return; {15720#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:04,504 INFO L272 TraceCheckUtils]: 11: Hoare triple {15720#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {15720#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:04,505 INFO L290 TraceCheckUtils]: 12: Hoare triple {15720#(<= ~counter~0 0)} ~cond := #in~cond; {15720#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:04,505 INFO L290 TraceCheckUtils]: 13: Hoare triple {15720#(<= ~counter~0 0)} assume !(0 == ~cond); {15720#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:04,505 INFO L290 TraceCheckUtils]: 14: Hoare triple {15720#(<= ~counter~0 0)} assume true; {15720#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:04,506 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {15720#(<= ~counter~0 0)} {15720#(<= ~counter~0 0)} #92#return; {15720#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:04,506 INFO L290 TraceCheckUtils]: 16: Hoare triple {15720#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {15720#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:04,507 INFO L290 TraceCheckUtils]: 17: Hoare triple {15720#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15769#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:04,507 INFO L290 TraceCheckUtils]: 18: Hoare triple {15769#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {15769#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:04,508 INFO L272 TraceCheckUtils]: 19: Hoare triple {15769#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {15769#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:04,509 INFO L290 TraceCheckUtils]: 20: Hoare triple {15769#(<= ~counter~0 1)} ~cond := #in~cond; {15769#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:04,509 INFO L290 TraceCheckUtils]: 21: Hoare triple {15769#(<= ~counter~0 1)} assume !(0 == ~cond); {15769#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:04,509 INFO L290 TraceCheckUtils]: 22: Hoare triple {15769#(<= ~counter~0 1)} assume true; {15769#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:04,510 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {15769#(<= ~counter~0 1)} {15769#(<= ~counter~0 1)} #94#return; {15769#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:04,510 INFO L290 TraceCheckUtils]: 24: Hoare triple {15769#(<= ~counter~0 1)} assume !!(0 != ~r~0); {15769#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:04,511 INFO L290 TraceCheckUtils]: 25: Hoare triple {15769#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {15794#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:04,511 INFO L290 TraceCheckUtils]: 26: Hoare triple {15794#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {15794#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:04,512 INFO L272 TraceCheckUtils]: 27: Hoare triple {15794#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {15794#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:04,512 INFO L290 TraceCheckUtils]: 28: Hoare triple {15794#(<= ~counter~0 2)} ~cond := #in~cond; {15794#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:04,513 INFO L290 TraceCheckUtils]: 29: Hoare triple {15794#(<= ~counter~0 2)} assume !(0 == ~cond); {15794#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:04,513 INFO L290 TraceCheckUtils]: 30: Hoare triple {15794#(<= ~counter~0 2)} assume true; {15794#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:04,514 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {15794#(<= ~counter~0 2)} {15794#(<= ~counter~0 2)} #96#return; {15794#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:04,514 INFO L290 TraceCheckUtils]: 32: Hoare triple {15794#(<= ~counter~0 2)} assume !(~r~0 > 0); {15794#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:04,515 INFO L290 TraceCheckUtils]: 33: Hoare triple {15794#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {15819#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:04,515 INFO L290 TraceCheckUtils]: 34: Hoare triple {15819#(<= ~counter~0 3)} assume !!(#t~post8 < 20);havoc #t~post8; {15819#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:04,516 INFO L272 TraceCheckUtils]: 35: Hoare triple {15819#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {15819#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:04,516 INFO L290 TraceCheckUtils]: 36: Hoare triple {15819#(<= ~counter~0 3)} ~cond := #in~cond; {15819#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:04,516 INFO L290 TraceCheckUtils]: 37: Hoare triple {15819#(<= ~counter~0 3)} assume !(0 == ~cond); {15819#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:04,517 INFO L290 TraceCheckUtils]: 38: Hoare triple {15819#(<= ~counter~0 3)} assume true; {15819#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:04,517 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {15819#(<= ~counter~0 3)} {15819#(<= ~counter~0 3)} #98#return; {15819#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:04,518 INFO L290 TraceCheckUtils]: 40: Hoare triple {15819#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {15819#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:04,518 INFO L290 TraceCheckUtils]: 41: Hoare triple {15819#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {15844#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:04,519 INFO L290 TraceCheckUtils]: 42: Hoare triple {15844#(<= ~counter~0 4)} assume !!(#t~post8 < 20);havoc #t~post8; {15844#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:04,519 INFO L272 TraceCheckUtils]: 43: Hoare triple {15844#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {15844#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:04,520 INFO L290 TraceCheckUtils]: 44: Hoare triple {15844#(<= ~counter~0 4)} ~cond := #in~cond; {15844#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:04,520 INFO L290 TraceCheckUtils]: 45: Hoare triple {15844#(<= ~counter~0 4)} assume !(0 == ~cond); {15844#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:04,520 INFO L290 TraceCheckUtils]: 46: Hoare triple {15844#(<= ~counter~0 4)} assume true; {15844#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:04,521 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {15844#(<= ~counter~0 4)} {15844#(<= ~counter~0 4)} #98#return; {15844#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:04,521 INFO L290 TraceCheckUtils]: 48: Hoare triple {15844#(<= ~counter~0 4)} assume !(~r~0 < 0); {15844#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:04,522 INFO L290 TraceCheckUtils]: 49: Hoare triple {15844#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15869#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:04,522 INFO L290 TraceCheckUtils]: 50: Hoare triple {15869#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {15869#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:04,523 INFO L272 TraceCheckUtils]: 51: Hoare triple {15869#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {15869#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:04,523 INFO L290 TraceCheckUtils]: 52: Hoare triple {15869#(<= ~counter~0 5)} ~cond := #in~cond; {15869#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:04,523 INFO L290 TraceCheckUtils]: 53: Hoare triple {15869#(<= ~counter~0 5)} assume !(0 == ~cond); {15869#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:04,524 INFO L290 TraceCheckUtils]: 54: Hoare triple {15869#(<= ~counter~0 5)} assume true; {15869#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:04,524 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {15869#(<= ~counter~0 5)} {15869#(<= ~counter~0 5)} #94#return; {15869#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:04,525 INFO L290 TraceCheckUtils]: 56: Hoare triple {15869#(<= ~counter~0 5)} assume !!(0 != ~r~0); {15869#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:04,526 INFO L290 TraceCheckUtils]: 57: Hoare triple {15869#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {15894#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:04,526 INFO L290 TraceCheckUtils]: 58: Hoare triple {15894#(<= ~counter~0 6)} assume !!(#t~post7 < 20);havoc #t~post7; {15894#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:04,527 INFO L272 TraceCheckUtils]: 59: Hoare triple {15894#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {15894#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:04,527 INFO L290 TraceCheckUtils]: 60: Hoare triple {15894#(<= ~counter~0 6)} ~cond := #in~cond; {15894#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:04,527 INFO L290 TraceCheckUtils]: 61: Hoare triple {15894#(<= ~counter~0 6)} assume !(0 == ~cond); {15894#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:04,528 INFO L290 TraceCheckUtils]: 62: Hoare triple {15894#(<= ~counter~0 6)} assume true; {15894#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:04,529 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {15894#(<= ~counter~0 6)} {15894#(<= ~counter~0 6)} #96#return; {15894#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:04,529 INFO L290 TraceCheckUtils]: 64: Hoare triple {15894#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {15894#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:04,529 INFO L290 TraceCheckUtils]: 65: Hoare triple {15894#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {15919#(<= |main_#t~post7| 6)} is VALID [2022-04-28 05:58:04,530 INFO L290 TraceCheckUtils]: 66: Hoare triple {15919#(<= |main_#t~post7| 6)} assume !(#t~post7 < 20);havoc #t~post7; {15713#false} is VALID [2022-04-28 05:58:04,530 INFO L290 TraceCheckUtils]: 67: Hoare triple {15713#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {15713#false} is VALID [2022-04-28 05:58:04,530 INFO L290 TraceCheckUtils]: 68: Hoare triple {15713#false} assume !(#t~post8 < 20);havoc #t~post8; {15713#false} is VALID [2022-04-28 05:58:04,530 INFO L290 TraceCheckUtils]: 69: Hoare triple {15713#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15713#false} is VALID [2022-04-28 05:58:04,530 INFO L290 TraceCheckUtils]: 70: Hoare triple {15713#false} assume !(#t~post6 < 20);havoc #t~post6; {15713#false} is VALID [2022-04-28 05:58:04,530 INFO L272 TraceCheckUtils]: 71: Hoare triple {15713#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {15713#false} is VALID [2022-04-28 05:58:04,530 INFO L290 TraceCheckUtils]: 72: Hoare triple {15713#false} ~cond := #in~cond; {15713#false} is VALID [2022-04-28 05:58:04,531 INFO L290 TraceCheckUtils]: 73: Hoare triple {15713#false} assume 0 == ~cond; {15713#false} is VALID [2022-04-28 05:58:04,531 INFO L290 TraceCheckUtils]: 74: Hoare triple {15713#false} assume !false; {15713#false} is VALID [2022-04-28 05:58:04,531 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 20 proven. 76 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 05:58:04,531 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:58:04,910 INFO L290 TraceCheckUtils]: 74: Hoare triple {15713#false} assume !false; {15713#false} is VALID [2022-04-28 05:58:04,911 INFO L290 TraceCheckUtils]: 73: Hoare triple {15713#false} assume 0 == ~cond; {15713#false} is VALID [2022-04-28 05:58:04,911 INFO L290 TraceCheckUtils]: 72: Hoare triple {15713#false} ~cond := #in~cond; {15713#false} is VALID [2022-04-28 05:58:04,911 INFO L272 TraceCheckUtils]: 71: Hoare triple {15713#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {15713#false} is VALID [2022-04-28 05:58:04,911 INFO L290 TraceCheckUtils]: 70: Hoare triple {15713#false} assume !(#t~post6 < 20);havoc #t~post6; {15713#false} is VALID [2022-04-28 05:58:04,911 INFO L290 TraceCheckUtils]: 69: Hoare triple {15713#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15713#false} is VALID [2022-04-28 05:58:04,911 INFO L290 TraceCheckUtils]: 68: Hoare triple {15713#false} assume !(#t~post8 < 20);havoc #t~post8; {15713#false} is VALID [2022-04-28 05:58:04,911 INFO L290 TraceCheckUtils]: 67: Hoare triple {15713#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {15713#false} is VALID [2022-04-28 05:58:04,911 INFO L290 TraceCheckUtils]: 66: Hoare triple {15971#(< |main_#t~post7| 20)} assume !(#t~post7 < 20);havoc #t~post7; {15713#false} is VALID [2022-04-28 05:58:04,912 INFO L290 TraceCheckUtils]: 65: Hoare triple {15975#(< ~counter~0 20)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {15971#(< |main_#t~post7| 20)} is VALID [2022-04-28 05:58:04,912 INFO L290 TraceCheckUtils]: 64: Hoare triple {15975#(< ~counter~0 20)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {15975#(< ~counter~0 20)} is VALID [2022-04-28 05:58:04,912 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {15712#true} {15975#(< ~counter~0 20)} #96#return; {15975#(< ~counter~0 20)} is VALID [2022-04-28 05:58:04,913 INFO L290 TraceCheckUtils]: 62: Hoare triple {15712#true} assume true; {15712#true} is VALID [2022-04-28 05:58:04,913 INFO L290 TraceCheckUtils]: 61: Hoare triple {15712#true} assume !(0 == ~cond); {15712#true} is VALID [2022-04-28 05:58:04,913 INFO L290 TraceCheckUtils]: 60: Hoare triple {15712#true} ~cond := #in~cond; {15712#true} is VALID [2022-04-28 05:58:04,913 INFO L272 TraceCheckUtils]: 59: Hoare triple {15975#(< ~counter~0 20)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {15712#true} is VALID [2022-04-28 05:58:04,913 INFO L290 TraceCheckUtils]: 58: Hoare triple {15975#(< ~counter~0 20)} assume !!(#t~post7 < 20);havoc #t~post7; {15975#(< ~counter~0 20)} is VALID [2022-04-28 05:58:04,914 INFO L290 TraceCheckUtils]: 57: Hoare triple {16000#(< ~counter~0 19)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {15975#(< ~counter~0 20)} is VALID [2022-04-28 05:58:04,914 INFO L290 TraceCheckUtils]: 56: Hoare triple {16000#(< ~counter~0 19)} assume !!(0 != ~r~0); {16000#(< ~counter~0 19)} is VALID [2022-04-28 05:58:04,915 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {15712#true} {16000#(< ~counter~0 19)} #94#return; {16000#(< ~counter~0 19)} is VALID [2022-04-28 05:58:04,915 INFO L290 TraceCheckUtils]: 54: Hoare triple {15712#true} assume true; {15712#true} is VALID [2022-04-28 05:58:04,915 INFO L290 TraceCheckUtils]: 53: Hoare triple {15712#true} assume !(0 == ~cond); {15712#true} is VALID [2022-04-28 05:58:04,915 INFO L290 TraceCheckUtils]: 52: Hoare triple {15712#true} ~cond := #in~cond; {15712#true} is VALID [2022-04-28 05:58:04,915 INFO L272 TraceCheckUtils]: 51: Hoare triple {16000#(< ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {15712#true} is VALID [2022-04-28 05:58:04,915 INFO L290 TraceCheckUtils]: 50: Hoare triple {16000#(< ~counter~0 19)} assume !!(#t~post6 < 20);havoc #t~post6; {16000#(< ~counter~0 19)} is VALID [2022-04-28 05:58:04,916 INFO L290 TraceCheckUtils]: 49: Hoare triple {16025#(< ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16000#(< ~counter~0 19)} is VALID [2022-04-28 05:58:04,916 INFO L290 TraceCheckUtils]: 48: Hoare triple {16025#(< ~counter~0 18)} assume !(~r~0 < 0); {16025#(< ~counter~0 18)} is VALID [2022-04-28 05:58:04,917 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {15712#true} {16025#(< ~counter~0 18)} #98#return; {16025#(< ~counter~0 18)} is VALID [2022-04-28 05:58:04,917 INFO L290 TraceCheckUtils]: 46: Hoare triple {15712#true} assume true; {15712#true} is VALID [2022-04-28 05:58:04,917 INFO L290 TraceCheckUtils]: 45: Hoare triple {15712#true} assume !(0 == ~cond); {15712#true} is VALID [2022-04-28 05:58:04,917 INFO L290 TraceCheckUtils]: 44: Hoare triple {15712#true} ~cond := #in~cond; {15712#true} is VALID [2022-04-28 05:58:04,917 INFO L272 TraceCheckUtils]: 43: Hoare triple {16025#(< ~counter~0 18)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {15712#true} is VALID [2022-04-28 05:58:04,917 INFO L290 TraceCheckUtils]: 42: Hoare triple {16025#(< ~counter~0 18)} assume !!(#t~post8 < 20);havoc #t~post8; {16025#(< ~counter~0 18)} is VALID [2022-04-28 05:58:04,918 INFO L290 TraceCheckUtils]: 41: Hoare triple {16050#(< ~counter~0 17)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {16025#(< ~counter~0 18)} is VALID [2022-04-28 05:58:04,918 INFO L290 TraceCheckUtils]: 40: Hoare triple {16050#(< ~counter~0 17)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {16050#(< ~counter~0 17)} is VALID [2022-04-28 05:58:04,918 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {15712#true} {16050#(< ~counter~0 17)} #98#return; {16050#(< ~counter~0 17)} is VALID [2022-04-28 05:58:04,918 INFO L290 TraceCheckUtils]: 38: Hoare triple {15712#true} assume true; {15712#true} is VALID [2022-04-28 05:58:04,918 INFO L290 TraceCheckUtils]: 37: Hoare triple {15712#true} assume !(0 == ~cond); {15712#true} is VALID [2022-04-28 05:58:04,919 INFO L290 TraceCheckUtils]: 36: Hoare triple {15712#true} ~cond := #in~cond; {15712#true} is VALID [2022-04-28 05:58:04,919 INFO L272 TraceCheckUtils]: 35: Hoare triple {16050#(< ~counter~0 17)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {15712#true} is VALID [2022-04-28 05:58:04,919 INFO L290 TraceCheckUtils]: 34: Hoare triple {16050#(< ~counter~0 17)} assume !!(#t~post8 < 20);havoc #t~post8; {16050#(< ~counter~0 17)} is VALID [2022-04-28 05:58:04,919 INFO L290 TraceCheckUtils]: 33: Hoare triple {16075#(< ~counter~0 16)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {16050#(< ~counter~0 17)} is VALID [2022-04-28 05:58:04,920 INFO L290 TraceCheckUtils]: 32: Hoare triple {16075#(< ~counter~0 16)} assume !(~r~0 > 0); {16075#(< ~counter~0 16)} is VALID [2022-04-28 05:58:04,920 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {15712#true} {16075#(< ~counter~0 16)} #96#return; {16075#(< ~counter~0 16)} is VALID [2022-04-28 05:58:04,920 INFO L290 TraceCheckUtils]: 30: Hoare triple {15712#true} assume true; {15712#true} is VALID [2022-04-28 05:58:04,920 INFO L290 TraceCheckUtils]: 29: Hoare triple {15712#true} assume !(0 == ~cond); {15712#true} is VALID [2022-04-28 05:58:04,920 INFO L290 TraceCheckUtils]: 28: Hoare triple {15712#true} ~cond := #in~cond; {15712#true} is VALID [2022-04-28 05:58:04,920 INFO L272 TraceCheckUtils]: 27: Hoare triple {16075#(< ~counter~0 16)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {15712#true} is VALID [2022-04-28 05:58:04,921 INFO L290 TraceCheckUtils]: 26: Hoare triple {16075#(< ~counter~0 16)} assume !!(#t~post7 < 20);havoc #t~post7; {16075#(< ~counter~0 16)} is VALID [2022-04-28 05:58:04,921 INFO L290 TraceCheckUtils]: 25: Hoare triple {16100#(< ~counter~0 15)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {16075#(< ~counter~0 16)} is VALID [2022-04-28 05:58:04,921 INFO L290 TraceCheckUtils]: 24: Hoare triple {16100#(< ~counter~0 15)} assume !!(0 != ~r~0); {16100#(< ~counter~0 15)} is VALID [2022-04-28 05:58:04,922 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {15712#true} {16100#(< ~counter~0 15)} #94#return; {16100#(< ~counter~0 15)} is VALID [2022-04-28 05:58:04,922 INFO L290 TraceCheckUtils]: 22: Hoare triple {15712#true} assume true; {15712#true} is VALID [2022-04-28 05:58:04,922 INFO L290 TraceCheckUtils]: 21: Hoare triple {15712#true} assume !(0 == ~cond); {15712#true} is VALID [2022-04-28 05:58:04,922 INFO L290 TraceCheckUtils]: 20: Hoare triple {15712#true} ~cond := #in~cond; {15712#true} is VALID [2022-04-28 05:58:04,922 INFO L272 TraceCheckUtils]: 19: Hoare triple {16100#(< ~counter~0 15)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {15712#true} is VALID [2022-04-28 05:58:04,922 INFO L290 TraceCheckUtils]: 18: Hoare triple {16100#(< ~counter~0 15)} assume !!(#t~post6 < 20);havoc #t~post6; {16100#(< ~counter~0 15)} is VALID [2022-04-28 05:58:04,923 INFO L290 TraceCheckUtils]: 17: Hoare triple {16125#(< ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16100#(< ~counter~0 15)} is VALID [2022-04-28 05:58:04,923 INFO L290 TraceCheckUtils]: 16: Hoare triple {16125#(< ~counter~0 14)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {16125#(< ~counter~0 14)} is VALID [2022-04-28 05:58:04,923 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {15712#true} {16125#(< ~counter~0 14)} #92#return; {16125#(< ~counter~0 14)} is VALID [2022-04-28 05:58:04,924 INFO L290 TraceCheckUtils]: 14: Hoare triple {15712#true} assume true; {15712#true} is VALID [2022-04-28 05:58:04,924 INFO L290 TraceCheckUtils]: 13: Hoare triple {15712#true} assume !(0 == ~cond); {15712#true} is VALID [2022-04-28 05:58:04,924 INFO L290 TraceCheckUtils]: 12: Hoare triple {15712#true} ~cond := #in~cond; {15712#true} is VALID [2022-04-28 05:58:04,924 INFO L272 TraceCheckUtils]: 11: Hoare triple {16125#(< ~counter~0 14)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {15712#true} is VALID [2022-04-28 05:58:04,924 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {15712#true} {16125#(< ~counter~0 14)} #90#return; {16125#(< ~counter~0 14)} is VALID [2022-04-28 05:58:04,924 INFO L290 TraceCheckUtils]: 9: Hoare triple {15712#true} assume true; {15712#true} is VALID [2022-04-28 05:58:04,924 INFO L290 TraceCheckUtils]: 8: Hoare triple {15712#true} assume !(0 == ~cond); {15712#true} is VALID [2022-04-28 05:58:04,924 INFO L290 TraceCheckUtils]: 7: Hoare triple {15712#true} ~cond := #in~cond; {15712#true} is VALID [2022-04-28 05:58:04,924 INFO L272 TraceCheckUtils]: 6: Hoare triple {16125#(< ~counter~0 14)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {15712#true} is VALID [2022-04-28 05:58:04,925 INFO L290 TraceCheckUtils]: 5: Hoare triple {16125#(< ~counter~0 14)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {16125#(< ~counter~0 14)} is VALID [2022-04-28 05:58:04,925 INFO L272 TraceCheckUtils]: 4: Hoare triple {16125#(< ~counter~0 14)} call #t~ret9 := main(); {16125#(< ~counter~0 14)} is VALID [2022-04-28 05:58:04,925 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16125#(< ~counter~0 14)} {15712#true} #102#return; {16125#(< ~counter~0 14)} is VALID [2022-04-28 05:58:04,925 INFO L290 TraceCheckUtils]: 2: Hoare triple {16125#(< ~counter~0 14)} assume true; {16125#(< ~counter~0 14)} is VALID [2022-04-28 05:58:04,926 INFO L290 TraceCheckUtils]: 1: Hoare triple {15712#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {16125#(< ~counter~0 14)} is VALID [2022-04-28 05:58:04,926 INFO L272 TraceCheckUtils]: 0: Hoare triple {15712#true} call ULTIMATE.init(); {15712#true} is VALID [2022-04-28 05:58:04,926 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 20 proven. 16 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-04-28 05:58:04,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:58:04,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481227433] [2022-04-28 05:58:04,927 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:58:04,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [867164668] [2022-04-28 05:58:04,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [867164668] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:58:04,927 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:58:04,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-04-28 05:58:04,927 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:58:04,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [415989061] [2022-04-28 05:58:04,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [415989061] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:58:04,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:58:04,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 05:58:04,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582695999] [2022-04-28 05:58:04,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:58:04,928 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) Word has length 75 [2022-04-28 05:58:04,928 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:58:04,928 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 05:58:04,995 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:58:04,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 05:58:04,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:58:04,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 05:58:04,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2022-04-28 05:58:04,996 INFO L87 Difference]: Start difference. First operand 140 states and 177 transitions. Second operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 05:58:05,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:58:05,542 INFO L93 Difference]: Finished difference Result 195 states and 255 transitions. [2022-04-28 05:58:05,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 05:58:05,543 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) Word has length 75 [2022-04-28 05:58:05,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:58:05,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 05:58:05,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 157 transitions. [2022-04-28 05:58:05,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 05:58:05,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 157 transitions. [2022-04-28 05:58:05,546 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 157 transitions. [2022-04-28 05:58:05,681 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 157 edges. 157 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:58:05,683 INFO L225 Difference]: With dead ends: 195 [2022-04-28 05:58:05,683 INFO L226 Difference]: Without dead ends: 146 [2022-04-28 05:58:05,683 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=205, Invalid=301, Unknown=0, NotChecked=0, Total=506 [2022-04-28 05:58:05,684 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 69 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 05:58:05,684 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 179 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 05:58:05,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-04-28 05:58:05,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2022-04-28 05:58:05,842 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:58:05,843 INFO L82 GeneralOperation]: Start isEquivalent. First operand 146 states. Second operand has 146 states, 108 states have (on average 1.1944444444444444) internal successors, (129), 108 states have internal predecessors, (129), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 05:58:05,843 INFO L74 IsIncluded]: Start isIncluded. First operand 146 states. Second operand has 146 states, 108 states have (on average 1.1944444444444444) internal successors, (129), 108 states have internal predecessors, (129), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 05:58:05,843 INFO L87 Difference]: Start difference. First operand 146 states. Second operand has 146 states, 108 states have (on average 1.1944444444444444) internal successors, (129), 108 states have internal predecessors, (129), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 05:58:05,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:58:05,846 INFO L93 Difference]: Finished difference Result 146 states and 183 transitions. [2022-04-28 05:58:05,846 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 183 transitions. [2022-04-28 05:58:05,846 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:58:05,846 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:58:05,847 INFO L74 IsIncluded]: Start isIncluded. First operand has 146 states, 108 states have (on average 1.1944444444444444) internal successors, (129), 108 states have internal predecessors, (129), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand 146 states. [2022-04-28 05:58:05,847 INFO L87 Difference]: Start difference. First operand has 146 states, 108 states have (on average 1.1944444444444444) internal successors, (129), 108 states have internal predecessors, (129), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand 146 states. [2022-04-28 05:58:05,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:58:05,849 INFO L93 Difference]: Finished difference Result 146 states and 183 transitions. [2022-04-28 05:58:05,850 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 183 transitions. [2022-04-28 05:58:05,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:58:05,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:58:05,850 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:58:05,850 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:58:05,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 108 states have (on average 1.1944444444444444) internal successors, (129), 108 states have internal predecessors, (129), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 05:58:05,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 183 transitions. [2022-04-28 05:58:05,853 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 183 transitions. Word has length 75 [2022-04-28 05:58:05,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:58:05,854 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 183 transitions. [2022-04-28 05:58:05,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 05:58:05,854 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 146 states and 183 transitions. [2022-04-28 05:58:08,103 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 183 edges. 182 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 05:58:08,103 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 183 transitions. [2022-04-28 05:58:08,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-04-28 05:58:08,104 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:58:08,104 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 5, 5, 5, 5, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:58:08,119 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-04-28 05:58:08,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:58:08,304 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:58:08,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:58:08,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1970775776, now seen corresponding path program 7 times [2022-04-28 05:58:08,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:58:08,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [806235360] [2022-04-28 05:58:08,305 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:58:08,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1970775776, now seen corresponding path program 8 times [2022-04-28 05:58:08,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:58:08,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471285486] [2022-04-28 05:58:08,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:58:08,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:58:08,315 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:58:08,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [991859857] [2022-04-28 05:58:08,315 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:58:08,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:58:08,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:58:08,316 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:58:08,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-28 05:58:08,379 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:58:08,379 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:58:08,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-28 05:58:08,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:58:08,396 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:58:08,767 INFO L272 TraceCheckUtils]: 0: Hoare triple {17163#true} call ULTIMATE.init(); {17163#true} is VALID [2022-04-28 05:58:08,768 INFO L290 TraceCheckUtils]: 1: Hoare triple {17163#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {17171#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:08,768 INFO L290 TraceCheckUtils]: 2: Hoare triple {17171#(<= ~counter~0 0)} assume true; {17171#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:08,768 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17171#(<= ~counter~0 0)} {17163#true} #102#return; {17171#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:08,769 INFO L272 TraceCheckUtils]: 4: Hoare triple {17171#(<= ~counter~0 0)} call #t~ret9 := main(); {17171#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:08,769 INFO L290 TraceCheckUtils]: 5: Hoare triple {17171#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {17171#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:08,769 INFO L272 TraceCheckUtils]: 6: Hoare triple {17171#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {17171#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:08,770 INFO L290 TraceCheckUtils]: 7: Hoare triple {17171#(<= ~counter~0 0)} ~cond := #in~cond; {17171#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:08,770 INFO L290 TraceCheckUtils]: 8: Hoare triple {17171#(<= ~counter~0 0)} assume !(0 == ~cond); {17171#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:08,770 INFO L290 TraceCheckUtils]: 9: Hoare triple {17171#(<= ~counter~0 0)} assume true; {17171#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:08,771 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {17171#(<= ~counter~0 0)} {17171#(<= ~counter~0 0)} #90#return; {17171#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:08,771 INFO L272 TraceCheckUtils]: 11: Hoare triple {17171#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {17171#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:08,771 INFO L290 TraceCheckUtils]: 12: Hoare triple {17171#(<= ~counter~0 0)} ~cond := #in~cond; {17171#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:08,771 INFO L290 TraceCheckUtils]: 13: Hoare triple {17171#(<= ~counter~0 0)} assume !(0 == ~cond); {17171#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:08,772 INFO L290 TraceCheckUtils]: 14: Hoare triple {17171#(<= ~counter~0 0)} assume true; {17171#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:08,772 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {17171#(<= ~counter~0 0)} {17171#(<= ~counter~0 0)} #92#return; {17171#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:08,772 INFO L290 TraceCheckUtils]: 16: Hoare triple {17171#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {17171#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:08,773 INFO L290 TraceCheckUtils]: 17: Hoare triple {17171#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17220#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:08,773 INFO L290 TraceCheckUtils]: 18: Hoare triple {17220#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {17220#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:08,774 INFO L272 TraceCheckUtils]: 19: Hoare triple {17220#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {17220#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:08,774 INFO L290 TraceCheckUtils]: 20: Hoare triple {17220#(<= ~counter~0 1)} ~cond := #in~cond; {17220#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:08,774 INFO L290 TraceCheckUtils]: 21: Hoare triple {17220#(<= ~counter~0 1)} assume !(0 == ~cond); {17220#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:08,775 INFO L290 TraceCheckUtils]: 22: Hoare triple {17220#(<= ~counter~0 1)} assume true; {17220#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:08,775 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {17220#(<= ~counter~0 1)} {17220#(<= ~counter~0 1)} #94#return; {17220#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:08,775 INFO L290 TraceCheckUtils]: 24: Hoare triple {17220#(<= ~counter~0 1)} assume !!(0 != ~r~0); {17220#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:08,776 INFO L290 TraceCheckUtils]: 25: Hoare triple {17220#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {17245#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:08,776 INFO L290 TraceCheckUtils]: 26: Hoare triple {17245#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {17245#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:08,777 INFO L272 TraceCheckUtils]: 27: Hoare triple {17245#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {17245#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:08,777 INFO L290 TraceCheckUtils]: 28: Hoare triple {17245#(<= ~counter~0 2)} ~cond := #in~cond; {17245#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:08,777 INFO L290 TraceCheckUtils]: 29: Hoare triple {17245#(<= ~counter~0 2)} assume !(0 == ~cond); {17245#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:08,778 INFO L290 TraceCheckUtils]: 30: Hoare triple {17245#(<= ~counter~0 2)} assume true; {17245#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:08,778 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {17245#(<= ~counter~0 2)} {17245#(<= ~counter~0 2)} #96#return; {17245#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:08,779 INFO L290 TraceCheckUtils]: 32: Hoare triple {17245#(<= ~counter~0 2)} assume !(~r~0 > 0); {17245#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:08,779 INFO L290 TraceCheckUtils]: 33: Hoare triple {17245#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {17270#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:08,780 INFO L290 TraceCheckUtils]: 34: Hoare triple {17270#(<= ~counter~0 3)} assume !!(#t~post8 < 20);havoc #t~post8; {17270#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:08,780 INFO L272 TraceCheckUtils]: 35: Hoare triple {17270#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {17270#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:08,780 INFO L290 TraceCheckUtils]: 36: Hoare triple {17270#(<= ~counter~0 3)} ~cond := #in~cond; {17270#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:08,781 INFO L290 TraceCheckUtils]: 37: Hoare triple {17270#(<= ~counter~0 3)} assume !(0 == ~cond); {17270#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:08,781 INFO L290 TraceCheckUtils]: 38: Hoare triple {17270#(<= ~counter~0 3)} assume true; {17270#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:08,781 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {17270#(<= ~counter~0 3)} {17270#(<= ~counter~0 3)} #98#return; {17270#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:08,782 INFO L290 TraceCheckUtils]: 40: Hoare triple {17270#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {17270#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:08,782 INFO L290 TraceCheckUtils]: 41: Hoare triple {17270#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {17295#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:08,782 INFO L290 TraceCheckUtils]: 42: Hoare triple {17295#(<= ~counter~0 4)} assume !!(#t~post8 < 20);havoc #t~post8; {17295#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:08,783 INFO L272 TraceCheckUtils]: 43: Hoare triple {17295#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {17295#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:08,783 INFO L290 TraceCheckUtils]: 44: Hoare triple {17295#(<= ~counter~0 4)} ~cond := #in~cond; {17295#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:08,783 INFO L290 TraceCheckUtils]: 45: Hoare triple {17295#(<= ~counter~0 4)} assume !(0 == ~cond); {17295#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:08,784 INFO L290 TraceCheckUtils]: 46: Hoare triple {17295#(<= ~counter~0 4)} assume true; {17295#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:08,784 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {17295#(<= ~counter~0 4)} {17295#(<= ~counter~0 4)} #98#return; {17295#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:08,784 INFO L290 TraceCheckUtils]: 48: Hoare triple {17295#(<= ~counter~0 4)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {17295#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:08,785 INFO L290 TraceCheckUtils]: 49: Hoare triple {17295#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {17320#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:08,785 INFO L290 TraceCheckUtils]: 50: Hoare triple {17320#(<= ~counter~0 5)} assume !!(#t~post8 < 20);havoc #t~post8; {17320#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:08,786 INFO L272 TraceCheckUtils]: 51: Hoare triple {17320#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {17320#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:08,786 INFO L290 TraceCheckUtils]: 52: Hoare triple {17320#(<= ~counter~0 5)} ~cond := #in~cond; {17320#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:08,786 INFO L290 TraceCheckUtils]: 53: Hoare triple {17320#(<= ~counter~0 5)} assume !(0 == ~cond); {17320#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:08,787 INFO L290 TraceCheckUtils]: 54: Hoare triple {17320#(<= ~counter~0 5)} assume true; {17320#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:08,787 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {17320#(<= ~counter~0 5)} {17320#(<= ~counter~0 5)} #98#return; {17320#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:08,787 INFO L290 TraceCheckUtils]: 56: Hoare triple {17320#(<= ~counter~0 5)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {17320#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:08,788 INFO L290 TraceCheckUtils]: 57: Hoare triple {17320#(<= ~counter~0 5)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {17345#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:08,788 INFO L290 TraceCheckUtils]: 58: Hoare triple {17345#(<= ~counter~0 6)} assume !!(#t~post8 < 20);havoc #t~post8; {17345#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:08,789 INFO L272 TraceCheckUtils]: 59: Hoare triple {17345#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {17345#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:08,789 INFO L290 TraceCheckUtils]: 60: Hoare triple {17345#(<= ~counter~0 6)} ~cond := #in~cond; {17345#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:08,789 INFO L290 TraceCheckUtils]: 61: Hoare triple {17345#(<= ~counter~0 6)} assume !(0 == ~cond); {17345#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:08,789 INFO L290 TraceCheckUtils]: 62: Hoare triple {17345#(<= ~counter~0 6)} assume true; {17345#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:08,790 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {17345#(<= ~counter~0 6)} {17345#(<= ~counter~0 6)} #98#return; {17345#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:08,790 INFO L290 TraceCheckUtils]: 64: Hoare triple {17345#(<= ~counter~0 6)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {17345#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:08,791 INFO L290 TraceCheckUtils]: 65: Hoare triple {17345#(<= ~counter~0 6)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {17370#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:08,791 INFO L290 TraceCheckUtils]: 66: Hoare triple {17370#(<= ~counter~0 7)} assume !!(#t~post8 < 20);havoc #t~post8; {17370#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:08,791 INFO L272 TraceCheckUtils]: 67: Hoare triple {17370#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {17370#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:08,792 INFO L290 TraceCheckUtils]: 68: Hoare triple {17370#(<= ~counter~0 7)} ~cond := #in~cond; {17370#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:08,792 INFO L290 TraceCheckUtils]: 69: Hoare triple {17370#(<= ~counter~0 7)} assume !(0 == ~cond); {17370#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:08,792 INFO L290 TraceCheckUtils]: 70: Hoare triple {17370#(<= ~counter~0 7)} assume true; {17370#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:08,793 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {17370#(<= ~counter~0 7)} {17370#(<= ~counter~0 7)} #98#return; {17370#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:08,793 INFO L290 TraceCheckUtils]: 72: Hoare triple {17370#(<= ~counter~0 7)} assume !(~r~0 < 0); {17370#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:08,793 INFO L290 TraceCheckUtils]: 73: Hoare triple {17370#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17395#(<= |main_#t~post6| 7)} is VALID [2022-04-28 05:58:08,794 INFO L290 TraceCheckUtils]: 74: Hoare triple {17395#(<= |main_#t~post6| 7)} assume !(#t~post6 < 20);havoc #t~post6; {17164#false} is VALID [2022-04-28 05:58:08,794 INFO L272 TraceCheckUtils]: 75: Hoare triple {17164#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {17164#false} is VALID [2022-04-28 05:58:08,794 INFO L290 TraceCheckUtils]: 76: Hoare triple {17164#false} ~cond := #in~cond; {17164#false} is VALID [2022-04-28 05:58:08,794 INFO L290 TraceCheckUtils]: 77: Hoare triple {17164#false} assume 0 == ~cond; {17164#false} is VALID [2022-04-28 05:58:08,794 INFO L290 TraceCheckUtils]: 78: Hoare triple {17164#false} assume !false; {17164#false} is VALID [2022-04-28 05:58:08,794 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 14 proven. 126 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 05:58:08,794 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:58:09,223 INFO L290 TraceCheckUtils]: 78: Hoare triple {17164#false} assume !false; {17164#false} is VALID [2022-04-28 05:58:09,223 INFO L290 TraceCheckUtils]: 77: Hoare triple {17164#false} assume 0 == ~cond; {17164#false} is VALID [2022-04-28 05:58:09,223 INFO L290 TraceCheckUtils]: 76: Hoare triple {17164#false} ~cond := #in~cond; {17164#false} is VALID [2022-04-28 05:58:09,223 INFO L272 TraceCheckUtils]: 75: Hoare triple {17164#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {17164#false} is VALID [2022-04-28 05:58:09,223 INFO L290 TraceCheckUtils]: 74: Hoare triple {17423#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {17164#false} is VALID [2022-04-28 05:58:09,224 INFO L290 TraceCheckUtils]: 73: Hoare triple {17427#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17423#(< |main_#t~post6| 20)} is VALID [2022-04-28 05:58:09,224 INFO L290 TraceCheckUtils]: 72: Hoare triple {17427#(< ~counter~0 20)} assume !(~r~0 < 0); {17427#(< ~counter~0 20)} is VALID [2022-04-28 05:58:09,224 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {17163#true} {17427#(< ~counter~0 20)} #98#return; {17427#(< ~counter~0 20)} is VALID [2022-04-28 05:58:09,224 INFO L290 TraceCheckUtils]: 70: Hoare triple {17163#true} assume true; {17163#true} is VALID [2022-04-28 05:58:09,224 INFO L290 TraceCheckUtils]: 69: Hoare triple {17163#true} assume !(0 == ~cond); {17163#true} is VALID [2022-04-28 05:58:09,225 INFO L290 TraceCheckUtils]: 68: Hoare triple {17163#true} ~cond := #in~cond; {17163#true} is VALID [2022-04-28 05:58:09,225 INFO L272 TraceCheckUtils]: 67: Hoare triple {17427#(< ~counter~0 20)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {17163#true} is VALID [2022-04-28 05:58:09,225 INFO L290 TraceCheckUtils]: 66: Hoare triple {17427#(< ~counter~0 20)} assume !!(#t~post8 < 20);havoc #t~post8; {17427#(< ~counter~0 20)} is VALID [2022-04-28 05:58:09,225 INFO L290 TraceCheckUtils]: 65: Hoare triple {17452#(< ~counter~0 19)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {17427#(< ~counter~0 20)} is VALID [2022-04-28 05:58:09,226 INFO L290 TraceCheckUtils]: 64: Hoare triple {17452#(< ~counter~0 19)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {17452#(< ~counter~0 19)} is VALID [2022-04-28 05:58:09,226 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {17163#true} {17452#(< ~counter~0 19)} #98#return; {17452#(< ~counter~0 19)} is VALID [2022-04-28 05:58:09,226 INFO L290 TraceCheckUtils]: 62: Hoare triple {17163#true} assume true; {17163#true} is VALID [2022-04-28 05:58:09,226 INFO L290 TraceCheckUtils]: 61: Hoare triple {17163#true} assume !(0 == ~cond); {17163#true} is VALID [2022-04-28 05:58:09,226 INFO L290 TraceCheckUtils]: 60: Hoare triple {17163#true} ~cond := #in~cond; {17163#true} is VALID [2022-04-28 05:58:09,226 INFO L272 TraceCheckUtils]: 59: Hoare triple {17452#(< ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {17163#true} is VALID [2022-04-28 05:58:09,227 INFO L290 TraceCheckUtils]: 58: Hoare triple {17452#(< ~counter~0 19)} assume !!(#t~post8 < 20);havoc #t~post8; {17452#(< ~counter~0 19)} is VALID [2022-04-28 05:58:09,227 INFO L290 TraceCheckUtils]: 57: Hoare triple {17477#(< ~counter~0 18)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {17452#(< ~counter~0 19)} is VALID [2022-04-28 05:58:09,228 INFO L290 TraceCheckUtils]: 56: Hoare triple {17477#(< ~counter~0 18)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {17477#(< ~counter~0 18)} is VALID [2022-04-28 05:58:09,228 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {17163#true} {17477#(< ~counter~0 18)} #98#return; {17477#(< ~counter~0 18)} is VALID [2022-04-28 05:58:09,228 INFO L290 TraceCheckUtils]: 54: Hoare triple {17163#true} assume true; {17163#true} is VALID [2022-04-28 05:58:09,228 INFO L290 TraceCheckUtils]: 53: Hoare triple {17163#true} assume !(0 == ~cond); {17163#true} is VALID [2022-04-28 05:58:09,228 INFO L290 TraceCheckUtils]: 52: Hoare triple {17163#true} ~cond := #in~cond; {17163#true} is VALID [2022-04-28 05:58:09,228 INFO L272 TraceCheckUtils]: 51: Hoare triple {17477#(< ~counter~0 18)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {17163#true} is VALID [2022-04-28 05:58:09,229 INFO L290 TraceCheckUtils]: 50: Hoare triple {17477#(< ~counter~0 18)} assume !!(#t~post8 < 20);havoc #t~post8; {17477#(< ~counter~0 18)} is VALID [2022-04-28 05:58:09,229 INFO L290 TraceCheckUtils]: 49: Hoare triple {17502#(< ~counter~0 17)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {17477#(< ~counter~0 18)} is VALID [2022-04-28 05:58:09,229 INFO L290 TraceCheckUtils]: 48: Hoare triple {17502#(< ~counter~0 17)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {17502#(< ~counter~0 17)} is VALID [2022-04-28 05:58:09,230 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {17163#true} {17502#(< ~counter~0 17)} #98#return; {17502#(< ~counter~0 17)} is VALID [2022-04-28 05:58:09,230 INFO L290 TraceCheckUtils]: 46: Hoare triple {17163#true} assume true; {17163#true} is VALID [2022-04-28 05:58:09,230 INFO L290 TraceCheckUtils]: 45: Hoare triple {17163#true} assume !(0 == ~cond); {17163#true} is VALID [2022-04-28 05:58:09,230 INFO L290 TraceCheckUtils]: 44: Hoare triple {17163#true} ~cond := #in~cond; {17163#true} is VALID [2022-04-28 05:58:09,230 INFO L272 TraceCheckUtils]: 43: Hoare triple {17502#(< ~counter~0 17)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {17163#true} is VALID [2022-04-28 05:58:09,230 INFO L290 TraceCheckUtils]: 42: Hoare triple {17502#(< ~counter~0 17)} assume !!(#t~post8 < 20);havoc #t~post8; {17502#(< ~counter~0 17)} is VALID [2022-04-28 05:58:09,231 INFO L290 TraceCheckUtils]: 41: Hoare triple {17527#(< ~counter~0 16)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {17502#(< ~counter~0 17)} is VALID [2022-04-28 05:58:09,231 INFO L290 TraceCheckUtils]: 40: Hoare triple {17527#(< ~counter~0 16)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {17527#(< ~counter~0 16)} is VALID [2022-04-28 05:58:09,232 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {17163#true} {17527#(< ~counter~0 16)} #98#return; {17527#(< ~counter~0 16)} is VALID [2022-04-28 05:58:09,232 INFO L290 TraceCheckUtils]: 38: Hoare triple {17163#true} assume true; {17163#true} is VALID [2022-04-28 05:58:09,232 INFO L290 TraceCheckUtils]: 37: Hoare triple {17163#true} assume !(0 == ~cond); {17163#true} is VALID [2022-04-28 05:58:09,232 INFO L290 TraceCheckUtils]: 36: Hoare triple {17163#true} ~cond := #in~cond; {17163#true} is VALID [2022-04-28 05:58:09,232 INFO L272 TraceCheckUtils]: 35: Hoare triple {17527#(< ~counter~0 16)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {17163#true} is VALID [2022-04-28 05:58:09,232 INFO L290 TraceCheckUtils]: 34: Hoare triple {17527#(< ~counter~0 16)} assume !!(#t~post8 < 20);havoc #t~post8; {17527#(< ~counter~0 16)} is VALID [2022-04-28 05:58:09,232 INFO L290 TraceCheckUtils]: 33: Hoare triple {17552#(< ~counter~0 15)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {17527#(< ~counter~0 16)} is VALID [2022-04-28 05:58:09,233 INFO L290 TraceCheckUtils]: 32: Hoare triple {17552#(< ~counter~0 15)} assume !(~r~0 > 0); {17552#(< ~counter~0 15)} is VALID [2022-04-28 05:58:09,233 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {17163#true} {17552#(< ~counter~0 15)} #96#return; {17552#(< ~counter~0 15)} is VALID [2022-04-28 05:58:09,233 INFO L290 TraceCheckUtils]: 30: Hoare triple {17163#true} assume true; {17163#true} is VALID [2022-04-28 05:58:09,233 INFO L290 TraceCheckUtils]: 29: Hoare triple {17163#true} assume !(0 == ~cond); {17163#true} is VALID [2022-04-28 05:58:09,233 INFO L290 TraceCheckUtils]: 28: Hoare triple {17163#true} ~cond := #in~cond; {17163#true} is VALID [2022-04-28 05:58:09,234 INFO L272 TraceCheckUtils]: 27: Hoare triple {17552#(< ~counter~0 15)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {17163#true} is VALID [2022-04-28 05:58:09,234 INFO L290 TraceCheckUtils]: 26: Hoare triple {17552#(< ~counter~0 15)} assume !!(#t~post7 < 20);havoc #t~post7; {17552#(< ~counter~0 15)} is VALID [2022-04-28 05:58:09,234 INFO L290 TraceCheckUtils]: 25: Hoare triple {17577#(< ~counter~0 14)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {17552#(< ~counter~0 15)} is VALID [2022-04-28 05:58:09,234 INFO L290 TraceCheckUtils]: 24: Hoare triple {17577#(< ~counter~0 14)} assume !!(0 != ~r~0); {17577#(< ~counter~0 14)} is VALID [2022-04-28 05:58:09,235 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {17163#true} {17577#(< ~counter~0 14)} #94#return; {17577#(< ~counter~0 14)} is VALID [2022-04-28 05:58:09,235 INFO L290 TraceCheckUtils]: 22: Hoare triple {17163#true} assume true; {17163#true} is VALID [2022-04-28 05:58:09,235 INFO L290 TraceCheckUtils]: 21: Hoare triple {17163#true} assume !(0 == ~cond); {17163#true} is VALID [2022-04-28 05:58:09,235 INFO L290 TraceCheckUtils]: 20: Hoare triple {17163#true} ~cond := #in~cond; {17163#true} is VALID [2022-04-28 05:58:09,235 INFO L272 TraceCheckUtils]: 19: Hoare triple {17577#(< ~counter~0 14)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {17163#true} is VALID [2022-04-28 05:58:09,235 INFO L290 TraceCheckUtils]: 18: Hoare triple {17577#(< ~counter~0 14)} assume !!(#t~post6 < 20);havoc #t~post6; {17577#(< ~counter~0 14)} is VALID [2022-04-28 05:58:09,236 INFO L290 TraceCheckUtils]: 17: Hoare triple {17602#(< ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17577#(< ~counter~0 14)} is VALID [2022-04-28 05:58:09,236 INFO L290 TraceCheckUtils]: 16: Hoare triple {17602#(< ~counter~0 13)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {17602#(< ~counter~0 13)} is VALID [2022-04-28 05:58:09,237 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {17163#true} {17602#(< ~counter~0 13)} #92#return; {17602#(< ~counter~0 13)} is VALID [2022-04-28 05:58:09,237 INFO L290 TraceCheckUtils]: 14: Hoare triple {17163#true} assume true; {17163#true} is VALID [2022-04-28 05:58:09,237 INFO L290 TraceCheckUtils]: 13: Hoare triple {17163#true} assume !(0 == ~cond); {17163#true} is VALID [2022-04-28 05:58:09,237 INFO L290 TraceCheckUtils]: 12: Hoare triple {17163#true} ~cond := #in~cond; {17163#true} is VALID [2022-04-28 05:58:09,237 INFO L272 TraceCheckUtils]: 11: Hoare triple {17602#(< ~counter~0 13)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {17163#true} is VALID [2022-04-28 05:58:09,237 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {17163#true} {17602#(< ~counter~0 13)} #90#return; {17602#(< ~counter~0 13)} is VALID [2022-04-28 05:58:09,237 INFO L290 TraceCheckUtils]: 9: Hoare triple {17163#true} assume true; {17163#true} is VALID [2022-04-28 05:58:09,237 INFO L290 TraceCheckUtils]: 8: Hoare triple {17163#true} assume !(0 == ~cond); {17163#true} is VALID [2022-04-28 05:58:09,237 INFO L290 TraceCheckUtils]: 7: Hoare triple {17163#true} ~cond := #in~cond; {17163#true} is VALID [2022-04-28 05:58:09,238 INFO L272 TraceCheckUtils]: 6: Hoare triple {17602#(< ~counter~0 13)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {17163#true} is VALID [2022-04-28 05:58:09,238 INFO L290 TraceCheckUtils]: 5: Hoare triple {17602#(< ~counter~0 13)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {17602#(< ~counter~0 13)} is VALID [2022-04-28 05:58:09,238 INFO L272 TraceCheckUtils]: 4: Hoare triple {17602#(< ~counter~0 13)} call #t~ret9 := main(); {17602#(< ~counter~0 13)} is VALID [2022-04-28 05:58:09,238 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17602#(< ~counter~0 13)} {17163#true} #102#return; {17602#(< ~counter~0 13)} is VALID [2022-04-28 05:58:09,239 INFO L290 TraceCheckUtils]: 2: Hoare triple {17602#(< ~counter~0 13)} assume true; {17602#(< ~counter~0 13)} is VALID [2022-04-28 05:58:09,239 INFO L290 TraceCheckUtils]: 1: Hoare triple {17163#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {17602#(< ~counter~0 13)} is VALID [2022-04-28 05:58:09,239 INFO L272 TraceCheckUtils]: 0: Hoare triple {17163#true} call ULTIMATE.init(); {17163#true} is VALID [2022-04-28 05:58:09,239 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 14 proven. 42 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-04-28 05:58:09,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:58:09,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471285486] [2022-04-28 05:58:09,240 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:58:09,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [991859857] [2022-04-28 05:58:09,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [991859857] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:58:09,240 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:58:09,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2022-04-28 05:58:09,240 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:58:09,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [806235360] [2022-04-28 05:58:09,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [806235360] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:58:09,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:58:09,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 05:58:09,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021885996] [2022-04-28 05:58:09,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:58:09,241 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) Word has length 79 [2022-04-28 05:58:09,241 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:58:09,242 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-28 05:58:09,305 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:58:09,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 05:58:09,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:58:09,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 05:58:09,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=222, Unknown=0, NotChecked=0, Total=380 [2022-04-28 05:58:09,306 INFO L87 Difference]: Start difference. First operand 146 states and 183 transitions. Second operand has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-28 05:58:09,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:58:09,976 INFO L93 Difference]: Finished difference Result 168 states and 210 transitions. [2022-04-28 05:58:09,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 05:58:09,976 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) Word has length 79 [2022-04-28 05:58:09,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:58:09,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-28 05:58:09,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 155 transitions. [2022-04-28 05:58:09,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-28 05:58:09,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 155 transitions. [2022-04-28 05:58:09,984 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 155 transitions. [2022-04-28 05:58:10,101 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:58:10,104 INFO L225 Difference]: With dead ends: 168 [2022-04-28 05:58:10,104 INFO L226 Difference]: Without dead ends: 163 [2022-04-28 05:58:10,104 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=225, Invalid=327, Unknown=0, NotChecked=0, Total=552 [2022-04-28 05:58:10,105 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 82 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 05:58:10,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 221 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 05:58:10,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-04-28 05:58:10,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 157. [2022-04-28 05:58:10,287 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:58:10,287 INFO L82 GeneralOperation]: Start isEquivalent. First operand 163 states. Second operand has 157 states, 114 states have (on average 1.1929824561403508) internal successors, (136), 117 states have internal predecessors, (136), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-28 05:58:10,287 INFO L74 IsIncluded]: Start isIncluded. First operand 163 states. Second operand has 157 states, 114 states have (on average 1.1929824561403508) internal successors, (136), 117 states have internal predecessors, (136), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-28 05:58:10,287 INFO L87 Difference]: Start difference. First operand 163 states. Second operand has 157 states, 114 states have (on average 1.1929824561403508) internal successors, (136), 117 states have internal predecessors, (136), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-28 05:58:10,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:58:10,290 INFO L93 Difference]: Finished difference Result 163 states and 205 transitions. [2022-04-28 05:58:10,291 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 205 transitions. [2022-04-28 05:58:10,291 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:58:10,291 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:58:10,292 INFO L74 IsIncluded]: Start isIncluded. First operand has 157 states, 114 states have (on average 1.1929824561403508) internal successors, (136), 117 states have internal predecessors, (136), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) Second operand 163 states. [2022-04-28 05:58:10,292 INFO L87 Difference]: Start difference. First operand has 157 states, 114 states have (on average 1.1929824561403508) internal successors, (136), 117 states have internal predecessors, (136), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) Second operand 163 states. [2022-04-28 05:58:10,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:58:10,295 INFO L93 Difference]: Finished difference Result 163 states and 205 transitions. [2022-04-28 05:58:10,295 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 205 transitions. [2022-04-28 05:58:10,296 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:58:10,296 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:58:10,296 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:58:10,296 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:58:10,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 114 states have (on average 1.1929824561403508) internal successors, (136), 117 states have internal predecessors, (136), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-28 05:58:10,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 198 transitions. [2022-04-28 05:58:10,299 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 198 transitions. Word has length 79 [2022-04-28 05:58:10,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:58:10,300 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 198 transitions. [2022-04-28 05:58:10,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-28 05:58:10,300 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 157 states and 198 transitions. [2022-04-28 05:58:11,618 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 198 edges. 198 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:58:11,618 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 198 transitions. [2022-04-28 05:58:11,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-04-28 05:58:11,618 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:58:11,618 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:58:11,634 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-04-28 05:58:11,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:58:11,819 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:58:11,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:58:11,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1693648491, now seen corresponding path program 1 times [2022-04-28 05:58:11,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:58:11,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [944317500] [2022-04-28 05:58:11,820 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:58:11,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1693648491, now seen corresponding path program 2 times [2022-04-28 05:58:11,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:58:11,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948455861] [2022-04-28 05:58:11,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:58:11,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:58:11,834 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:58:11,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1598829282] [2022-04-28 05:58:11,834 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:58:11,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:58:11,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:58:11,835 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:58:11,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-04-28 05:58:11,883 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:58:11,883 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:58:11,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-28 05:58:11,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:58:11,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:58:12,296 INFO L272 TraceCheckUtils]: 0: Hoare triple {18640#true} call ULTIMATE.init(); {18640#true} is VALID [2022-04-28 05:58:12,297 INFO L290 TraceCheckUtils]: 1: Hoare triple {18640#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {18648#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:12,297 INFO L290 TraceCheckUtils]: 2: Hoare triple {18648#(<= ~counter~0 0)} assume true; {18648#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:12,298 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18648#(<= ~counter~0 0)} {18640#true} #102#return; {18648#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:12,298 INFO L272 TraceCheckUtils]: 4: Hoare triple {18648#(<= ~counter~0 0)} call #t~ret9 := main(); {18648#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:12,298 INFO L290 TraceCheckUtils]: 5: Hoare triple {18648#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {18648#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:12,299 INFO L272 TraceCheckUtils]: 6: Hoare triple {18648#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {18648#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:12,299 INFO L290 TraceCheckUtils]: 7: Hoare triple {18648#(<= ~counter~0 0)} ~cond := #in~cond; {18648#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:12,299 INFO L290 TraceCheckUtils]: 8: Hoare triple {18648#(<= ~counter~0 0)} assume !(0 == ~cond); {18648#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:12,300 INFO L290 TraceCheckUtils]: 9: Hoare triple {18648#(<= ~counter~0 0)} assume true; {18648#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:12,300 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18648#(<= ~counter~0 0)} {18648#(<= ~counter~0 0)} #90#return; {18648#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:12,300 INFO L272 TraceCheckUtils]: 11: Hoare triple {18648#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {18648#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:12,301 INFO L290 TraceCheckUtils]: 12: Hoare triple {18648#(<= ~counter~0 0)} ~cond := #in~cond; {18648#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:12,301 INFO L290 TraceCheckUtils]: 13: Hoare triple {18648#(<= ~counter~0 0)} assume !(0 == ~cond); {18648#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:12,301 INFO L290 TraceCheckUtils]: 14: Hoare triple {18648#(<= ~counter~0 0)} assume true; {18648#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:12,302 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {18648#(<= ~counter~0 0)} {18648#(<= ~counter~0 0)} #92#return; {18648#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:12,302 INFO L290 TraceCheckUtils]: 16: Hoare triple {18648#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {18648#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:12,303 INFO L290 TraceCheckUtils]: 17: Hoare triple {18648#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18697#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:12,303 INFO L290 TraceCheckUtils]: 18: Hoare triple {18697#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {18697#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:12,303 INFO L272 TraceCheckUtils]: 19: Hoare triple {18697#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {18697#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:12,304 INFO L290 TraceCheckUtils]: 20: Hoare triple {18697#(<= ~counter~0 1)} ~cond := #in~cond; {18697#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:12,304 INFO L290 TraceCheckUtils]: 21: Hoare triple {18697#(<= ~counter~0 1)} assume !(0 == ~cond); {18697#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:12,304 INFO L290 TraceCheckUtils]: 22: Hoare triple {18697#(<= ~counter~0 1)} assume true; {18697#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:12,305 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {18697#(<= ~counter~0 1)} {18697#(<= ~counter~0 1)} #94#return; {18697#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:12,305 INFO L290 TraceCheckUtils]: 24: Hoare triple {18697#(<= ~counter~0 1)} assume !!(0 != ~r~0); {18697#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:12,305 INFO L290 TraceCheckUtils]: 25: Hoare triple {18697#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18722#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:12,306 INFO L290 TraceCheckUtils]: 26: Hoare triple {18722#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {18722#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:12,306 INFO L272 TraceCheckUtils]: 27: Hoare triple {18722#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {18722#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:12,306 INFO L290 TraceCheckUtils]: 28: Hoare triple {18722#(<= ~counter~0 2)} ~cond := #in~cond; {18722#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:12,307 INFO L290 TraceCheckUtils]: 29: Hoare triple {18722#(<= ~counter~0 2)} assume !(0 == ~cond); {18722#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:12,307 INFO L290 TraceCheckUtils]: 30: Hoare triple {18722#(<= ~counter~0 2)} assume true; {18722#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:12,308 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {18722#(<= ~counter~0 2)} {18722#(<= ~counter~0 2)} #96#return; {18722#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:12,308 INFO L290 TraceCheckUtils]: 32: Hoare triple {18722#(<= ~counter~0 2)} assume !(~r~0 > 0); {18722#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:12,308 INFO L290 TraceCheckUtils]: 33: Hoare triple {18722#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {18747#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:12,309 INFO L290 TraceCheckUtils]: 34: Hoare triple {18747#(<= ~counter~0 3)} assume !!(#t~post8 < 20);havoc #t~post8; {18747#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:12,309 INFO L272 TraceCheckUtils]: 35: Hoare triple {18747#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {18747#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:12,309 INFO L290 TraceCheckUtils]: 36: Hoare triple {18747#(<= ~counter~0 3)} ~cond := #in~cond; {18747#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:12,310 INFO L290 TraceCheckUtils]: 37: Hoare triple {18747#(<= ~counter~0 3)} assume !(0 == ~cond); {18747#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:12,310 INFO L290 TraceCheckUtils]: 38: Hoare triple {18747#(<= ~counter~0 3)} assume true; {18747#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:12,310 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {18747#(<= ~counter~0 3)} {18747#(<= ~counter~0 3)} #98#return; {18747#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:12,311 INFO L290 TraceCheckUtils]: 40: Hoare triple {18747#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {18747#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:12,311 INFO L290 TraceCheckUtils]: 41: Hoare triple {18747#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {18772#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:12,311 INFO L290 TraceCheckUtils]: 42: Hoare triple {18772#(<= ~counter~0 4)} assume !!(#t~post8 < 20);havoc #t~post8; {18772#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:12,312 INFO L272 TraceCheckUtils]: 43: Hoare triple {18772#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {18772#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:12,312 INFO L290 TraceCheckUtils]: 44: Hoare triple {18772#(<= ~counter~0 4)} ~cond := #in~cond; {18772#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:12,312 INFO L290 TraceCheckUtils]: 45: Hoare triple {18772#(<= ~counter~0 4)} assume !(0 == ~cond); {18772#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:12,313 INFO L290 TraceCheckUtils]: 46: Hoare triple {18772#(<= ~counter~0 4)} assume true; {18772#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:12,313 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {18772#(<= ~counter~0 4)} {18772#(<= ~counter~0 4)} #98#return; {18772#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:12,314 INFO L290 TraceCheckUtils]: 48: Hoare triple {18772#(<= ~counter~0 4)} assume !(~r~0 < 0); {18772#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:12,315 INFO L290 TraceCheckUtils]: 49: Hoare triple {18772#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18797#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:12,316 INFO L290 TraceCheckUtils]: 50: Hoare triple {18797#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {18797#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:12,316 INFO L272 TraceCheckUtils]: 51: Hoare triple {18797#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {18797#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:12,316 INFO L290 TraceCheckUtils]: 52: Hoare triple {18797#(<= ~counter~0 5)} ~cond := #in~cond; {18797#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:12,317 INFO L290 TraceCheckUtils]: 53: Hoare triple {18797#(<= ~counter~0 5)} assume !(0 == ~cond); {18797#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:12,317 INFO L290 TraceCheckUtils]: 54: Hoare triple {18797#(<= ~counter~0 5)} assume true; {18797#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:12,318 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {18797#(<= ~counter~0 5)} {18797#(<= ~counter~0 5)} #94#return; {18797#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:12,318 INFO L290 TraceCheckUtils]: 56: Hoare triple {18797#(<= ~counter~0 5)} assume !!(0 != ~r~0); {18797#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:12,318 INFO L290 TraceCheckUtils]: 57: Hoare triple {18797#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18822#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:12,319 INFO L290 TraceCheckUtils]: 58: Hoare triple {18822#(<= ~counter~0 6)} assume !!(#t~post7 < 20);havoc #t~post7; {18822#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:12,319 INFO L272 TraceCheckUtils]: 59: Hoare triple {18822#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {18822#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:12,319 INFO L290 TraceCheckUtils]: 60: Hoare triple {18822#(<= ~counter~0 6)} ~cond := #in~cond; {18822#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:12,320 INFO L290 TraceCheckUtils]: 61: Hoare triple {18822#(<= ~counter~0 6)} assume !(0 == ~cond); {18822#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:12,320 INFO L290 TraceCheckUtils]: 62: Hoare triple {18822#(<= ~counter~0 6)} assume true; {18822#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:12,320 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {18822#(<= ~counter~0 6)} {18822#(<= ~counter~0 6)} #96#return; {18822#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:12,321 INFO L290 TraceCheckUtils]: 64: Hoare triple {18822#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {18822#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:12,321 INFO L290 TraceCheckUtils]: 65: Hoare triple {18822#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18847#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:12,321 INFO L290 TraceCheckUtils]: 66: Hoare triple {18847#(<= ~counter~0 7)} assume !!(#t~post7 < 20);havoc #t~post7; {18847#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:12,322 INFO L272 TraceCheckUtils]: 67: Hoare triple {18847#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {18847#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:12,322 INFO L290 TraceCheckUtils]: 68: Hoare triple {18847#(<= ~counter~0 7)} ~cond := #in~cond; {18847#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:12,323 INFO L290 TraceCheckUtils]: 69: Hoare triple {18847#(<= ~counter~0 7)} assume !(0 == ~cond); {18847#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:12,323 INFO L290 TraceCheckUtils]: 70: Hoare triple {18847#(<= ~counter~0 7)} assume true; {18847#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:12,323 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {18847#(<= ~counter~0 7)} {18847#(<= ~counter~0 7)} #96#return; {18847#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:12,324 INFO L290 TraceCheckUtils]: 72: Hoare triple {18847#(<= ~counter~0 7)} assume !(~r~0 > 0); {18847#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:12,324 INFO L290 TraceCheckUtils]: 73: Hoare triple {18847#(<= ~counter~0 7)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {18872#(<= |main_#t~post8| 7)} is VALID [2022-04-28 05:58:12,324 INFO L290 TraceCheckUtils]: 74: Hoare triple {18872#(<= |main_#t~post8| 7)} assume !(#t~post8 < 20);havoc #t~post8; {18641#false} is VALID [2022-04-28 05:58:12,324 INFO L290 TraceCheckUtils]: 75: Hoare triple {18641#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18641#false} is VALID [2022-04-28 05:58:12,324 INFO L290 TraceCheckUtils]: 76: Hoare triple {18641#false} assume !(#t~post6 < 20);havoc #t~post6; {18641#false} is VALID [2022-04-28 05:58:12,324 INFO L272 TraceCheckUtils]: 77: Hoare triple {18641#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {18641#false} is VALID [2022-04-28 05:58:12,325 INFO L290 TraceCheckUtils]: 78: Hoare triple {18641#false} ~cond := #in~cond; {18641#false} is VALID [2022-04-28 05:58:12,325 INFO L290 TraceCheckUtils]: 79: Hoare triple {18641#false} assume 0 == ~cond; {18641#false} is VALID [2022-04-28 05:58:12,325 INFO L290 TraceCheckUtils]: 80: Hoare triple {18641#false} assume !false; {18641#false} is VALID [2022-04-28 05:58:12,325 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 18 proven. 108 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 05:58:12,325 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:58:12,783 INFO L290 TraceCheckUtils]: 80: Hoare triple {18641#false} assume !false; {18641#false} is VALID [2022-04-28 05:58:12,783 INFO L290 TraceCheckUtils]: 79: Hoare triple {18641#false} assume 0 == ~cond; {18641#false} is VALID [2022-04-28 05:58:12,783 INFO L290 TraceCheckUtils]: 78: Hoare triple {18641#false} ~cond := #in~cond; {18641#false} is VALID [2022-04-28 05:58:12,783 INFO L272 TraceCheckUtils]: 77: Hoare triple {18641#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {18641#false} is VALID [2022-04-28 05:58:12,783 INFO L290 TraceCheckUtils]: 76: Hoare triple {18641#false} assume !(#t~post6 < 20);havoc #t~post6; {18641#false} is VALID [2022-04-28 05:58:12,783 INFO L290 TraceCheckUtils]: 75: Hoare triple {18641#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18641#false} is VALID [2022-04-28 05:58:12,784 INFO L290 TraceCheckUtils]: 74: Hoare triple {18912#(< |main_#t~post8| 20)} assume !(#t~post8 < 20);havoc #t~post8; {18641#false} is VALID [2022-04-28 05:58:12,784 INFO L290 TraceCheckUtils]: 73: Hoare triple {18916#(< ~counter~0 20)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {18912#(< |main_#t~post8| 20)} is VALID [2022-04-28 05:58:12,784 INFO L290 TraceCheckUtils]: 72: Hoare triple {18916#(< ~counter~0 20)} assume !(~r~0 > 0); {18916#(< ~counter~0 20)} is VALID [2022-04-28 05:58:12,785 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {18640#true} {18916#(< ~counter~0 20)} #96#return; {18916#(< ~counter~0 20)} is VALID [2022-04-28 05:58:12,785 INFO L290 TraceCheckUtils]: 70: Hoare triple {18640#true} assume true; {18640#true} is VALID [2022-04-28 05:58:12,785 INFO L290 TraceCheckUtils]: 69: Hoare triple {18640#true} assume !(0 == ~cond); {18640#true} is VALID [2022-04-28 05:58:12,785 INFO L290 TraceCheckUtils]: 68: Hoare triple {18640#true} ~cond := #in~cond; {18640#true} is VALID [2022-04-28 05:58:12,785 INFO L272 TraceCheckUtils]: 67: Hoare triple {18916#(< ~counter~0 20)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {18640#true} is VALID [2022-04-28 05:58:12,785 INFO L290 TraceCheckUtils]: 66: Hoare triple {18916#(< ~counter~0 20)} assume !!(#t~post7 < 20);havoc #t~post7; {18916#(< ~counter~0 20)} is VALID [2022-04-28 05:58:12,786 INFO L290 TraceCheckUtils]: 65: Hoare triple {18941#(< ~counter~0 19)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18916#(< ~counter~0 20)} is VALID [2022-04-28 05:58:12,786 INFO L290 TraceCheckUtils]: 64: Hoare triple {18941#(< ~counter~0 19)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {18941#(< ~counter~0 19)} is VALID [2022-04-28 05:58:12,787 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {18640#true} {18941#(< ~counter~0 19)} #96#return; {18941#(< ~counter~0 19)} is VALID [2022-04-28 05:58:12,787 INFO L290 TraceCheckUtils]: 62: Hoare triple {18640#true} assume true; {18640#true} is VALID [2022-04-28 05:58:12,787 INFO L290 TraceCheckUtils]: 61: Hoare triple {18640#true} assume !(0 == ~cond); {18640#true} is VALID [2022-04-28 05:58:12,787 INFO L290 TraceCheckUtils]: 60: Hoare triple {18640#true} ~cond := #in~cond; {18640#true} is VALID [2022-04-28 05:58:12,787 INFO L272 TraceCheckUtils]: 59: Hoare triple {18941#(< ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {18640#true} is VALID [2022-04-28 05:58:12,788 INFO L290 TraceCheckUtils]: 58: Hoare triple {18941#(< ~counter~0 19)} assume !!(#t~post7 < 20);havoc #t~post7; {18941#(< ~counter~0 19)} is VALID [2022-04-28 05:58:12,788 INFO L290 TraceCheckUtils]: 57: Hoare triple {18966#(< ~counter~0 18)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18941#(< ~counter~0 19)} is VALID [2022-04-28 05:58:12,788 INFO L290 TraceCheckUtils]: 56: Hoare triple {18966#(< ~counter~0 18)} assume !!(0 != ~r~0); {18966#(< ~counter~0 18)} is VALID [2022-04-28 05:58:12,789 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {18640#true} {18966#(< ~counter~0 18)} #94#return; {18966#(< ~counter~0 18)} is VALID [2022-04-28 05:58:12,789 INFO L290 TraceCheckUtils]: 54: Hoare triple {18640#true} assume true; {18640#true} is VALID [2022-04-28 05:58:12,789 INFO L290 TraceCheckUtils]: 53: Hoare triple {18640#true} assume !(0 == ~cond); {18640#true} is VALID [2022-04-28 05:58:12,789 INFO L290 TraceCheckUtils]: 52: Hoare triple {18640#true} ~cond := #in~cond; {18640#true} is VALID [2022-04-28 05:58:12,789 INFO L272 TraceCheckUtils]: 51: Hoare triple {18966#(< ~counter~0 18)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {18640#true} is VALID [2022-04-28 05:58:12,790 INFO L290 TraceCheckUtils]: 50: Hoare triple {18966#(< ~counter~0 18)} assume !!(#t~post6 < 20);havoc #t~post6; {18966#(< ~counter~0 18)} is VALID [2022-04-28 05:58:12,790 INFO L290 TraceCheckUtils]: 49: Hoare triple {18991#(< ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18966#(< ~counter~0 18)} is VALID [2022-04-28 05:58:12,790 INFO L290 TraceCheckUtils]: 48: Hoare triple {18991#(< ~counter~0 17)} assume !(~r~0 < 0); {18991#(< ~counter~0 17)} is VALID [2022-04-28 05:58:12,791 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {18640#true} {18991#(< ~counter~0 17)} #98#return; {18991#(< ~counter~0 17)} is VALID [2022-04-28 05:58:12,791 INFO L290 TraceCheckUtils]: 46: Hoare triple {18640#true} assume true; {18640#true} is VALID [2022-04-28 05:58:12,791 INFO L290 TraceCheckUtils]: 45: Hoare triple {18640#true} assume !(0 == ~cond); {18640#true} is VALID [2022-04-28 05:58:12,791 INFO L290 TraceCheckUtils]: 44: Hoare triple {18640#true} ~cond := #in~cond; {18640#true} is VALID [2022-04-28 05:58:12,791 INFO L272 TraceCheckUtils]: 43: Hoare triple {18991#(< ~counter~0 17)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {18640#true} is VALID [2022-04-28 05:58:12,791 INFO L290 TraceCheckUtils]: 42: Hoare triple {18991#(< ~counter~0 17)} assume !!(#t~post8 < 20);havoc #t~post8; {18991#(< ~counter~0 17)} is VALID [2022-04-28 05:58:12,792 INFO L290 TraceCheckUtils]: 41: Hoare triple {19016#(< ~counter~0 16)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {18991#(< ~counter~0 17)} is VALID [2022-04-28 05:58:12,792 INFO L290 TraceCheckUtils]: 40: Hoare triple {19016#(< ~counter~0 16)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {19016#(< ~counter~0 16)} is VALID [2022-04-28 05:58:12,793 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {18640#true} {19016#(< ~counter~0 16)} #98#return; {19016#(< ~counter~0 16)} is VALID [2022-04-28 05:58:12,793 INFO L290 TraceCheckUtils]: 38: Hoare triple {18640#true} assume true; {18640#true} is VALID [2022-04-28 05:58:12,793 INFO L290 TraceCheckUtils]: 37: Hoare triple {18640#true} assume !(0 == ~cond); {18640#true} is VALID [2022-04-28 05:58:12,793 INFO L290 TraceCheckUtils]: 36: Hoare triple {18640#true} ~cond := #in~cond; {18640#true} is VALID [2022-04-28 05:58:12,793 INFO L272 TraceCheckUtils]: 35: Hoare triple {19016#(< ~counter~0 16)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {18640#true} is VALID [2022-04-28 05:58:12,793 INFO L290 TraceCheckUtils]: 34: Hoare triple {19016#(< ~counter~0 16)} assume !!(#t~post8 < 20);havoc #t~post8; {19016#(< ~counter~0 16)} is VALID [2022-04-28 05:58:12,794 INFO L290 TraceCheckUtils]: 33: Hoare triple {19041#(< ~counter~0 15)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {19016#(< ~counter~0 16)} is VALID [2022-04-28 05:58:12,794 INFO L290 TraceCheckUtils]: 32: Hoare triple {19041#(< ~counter~0 15)} assume !(~r~0 > 0); {19041#(< ~counter~0 15)} is VALID [2022-04-28 05:58:12,794 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {18640#true} {19041#(< ~counter~0 15)} #96#return; {19041#(< ~counter~0 15)} is VALID [2022-04-28 05:58:12,794 INFO L290 TraceCheckUtils]: 30: Hoare triple {18640#true} assume true; {18640#true} is VALID [2022-04-28 05:58:12,795 INFO L290 TraceCheckUtils]: 29: Hoare triple {18640#true} assume !(0 == ~cond); {18640#true} is VALID [2022-04-28 05:58:12,795 INFO L290 TraceCheckUtils]: 28: Hoare triple {18640#true} ~cond := #in~cond; {18640#true} is VALID [2022-04-28 05:58:12,795 INFO L272 TraceCheckUtils]: 27: Hoare triple {19041#(< ~counter~0 15)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {18640#true} is VALID [2022-04-28 05:58:12,795 INFO L290 TraceCheckUtils]: 26: Hoare triple {19041#(< ~counter~0 15)} assume !!(#t~post7 < 20);havoc #t~post7; {19041#(< ~counter~0 15)} is VALID [2022-04-28 05:58:12,795 INFO L290 TraceCheckUtils]: 25: Hoare triple {19066#(< ~counter~0 14)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {19041#(< ~counter~0 15)} is VALID [2022-04-28 05:58:12,796 INFO L290 TraceCheckUtils]: 24: Hoare triple {19066#(< ~counter~0 14)} assume !!(0 != ~r~0); {19066#(< ~counter~0 14)} is VALID [2022-04-28 05:58:12,796 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {18640#true} {19066#(< ~counter~0 14)} #94#return; {19066#(< ~counter~0 14)} is VALID [2022-04-28 05:58:12,796 INFO L290 TraceCheckUtils]: 22: Hoare triple {18640#true} assume true; {18640#true} is VALID [2022-04-28 05:58:12,796 INFO L290 TraceCheckUtils]: 21: Hoare triple {18640#true} assume !(0 == ~cond); {18640#true} is VALID [2022-04-28 05:58:12,796 INFO L290 TraceCheckUtils]: 20: Hoare triple {18640#true} ~cond := #in~cond; {18640#true} is VALID [2022-04-28 05:58:12,796 INFO L272 TraceCheckUtils]: 19: Hoare triple {19066#(< ~counter~0 14)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {18640#true} is VALID [2022-04-28 05:58:12,797 INFO L290 TraceCheckUtils]: 18: Hoare triple {19066#(< ~counter~0 14)} assume !!(#t~post6 < 20);havoc #t~post6; {19066#(< ~counter~0 14)} is VALID [2022-04-28 05:58:12,797 INFO L290 TraceCheckUtils]: 17: Hoare triple {19091#(< ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19066#(< ~counter~0 14)} is VALID [2022-04-28 05:58:12,797 INFO L290 TraceCheckUtils]: 16: Hoare triple {19091#(< ~counter~0 13)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {19091#(< ~counter~0 13)} is VALID [2022-04-28 05:58:12,798 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {18640#true} {19091#(< ~counter~0 13)} #92#return; {19091#(< ~counter~0 13)} is VALID [2022-04-28 05:58:12,798 INFO L290 TraceCheckUtils]: 14: Hoare triple {18640#true} assume true; {18640#true} is VALID [2022-04-28 05:58:12,798 INFO L290 TraceCheckUtils]: 13: Hoare triple {18640#true} assume !(0 == ~cond); {18640#true} is VALID [2022-04-28 05:58:12,798 INFO L290 TraceCheckUtils]: 12: Hoare triple {18640#true} ~cond := #in~cond; {18640#true} is VALID [2022-04-28 05:58:12,798 INFO L272 TraceCheckUtils]: 11: Hoare triple {19091#(< ~counter~0 13)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {18640#true} is VALID [2022-04-28 05:58:12,798 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18640#true} {19091#(< ~counter~0 13)} #90#return; {19091#(< ~counter~0 13)} is VALID [2022-04-28 05:58:12,798 INFO L290 TraceCheckUtils]: 9: Hoare triple {18640#true} assume true; {18640#true} is VALID [2022-04-28 05:58:12,799 INFO L290 TraceCheckUtils]: 8: Hoare triple {18640#true} assume !(0 == ~cond); {18640#true} is VALID [2022-04-28 05:58:12,799 INFO L290 TraceCheckUtils]: 7: Hoare triple {18640#true} ~cond := #in~cond; {18640#true} is VALID [2022-04-28 05:58:12,799 INFO L272 TraceCheckUtils]: 6: Hoare triple {19091#(< ~counter~0 13)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {18640#true} is VALID [2022-04-28 05:58:12,799 INFO L290 TraceCheckUtils]: 5: Hoare triple {19091#(< ~counter~0 13)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {19091#(< ~counter~0 13)} is VALID [2022-04-28 05:58:12,799 INFO L272 TraceCheckUtils]: 4: Hoare triple {19091#(< ~counter~0 13)} call #t~ret9 := main(); {19091#(< ~counter~0 13)} is VALID [2022-04-28 05:58:12,800 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19091#(< ~counter~0 13)} {18640#true} #102#return; {19091#(< ~counter~0 13)} is VALID [2022-04-28 05:58:12,800 INFO L290 TraceCheckUtils]: 2: Hoare triple {19091#(< ~counter~0 13)} assume true; {19091#(< ~counter~0 13)} is VALID [2022-04-28 05:58:12,800 INFO L290 TraceCheckUtils]: 1: Hoare triple {18640#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {19091#(< ~counter~0 13)} is VALID [2022-04-28 05:58:12,800 INFO L272 TraceCheckUtils]: 0: Hoare triple {18640#true} call ULTIMATE.init(); {18640#true} is VALID [2022-04-28 05:58:12,801 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 18 proven. 24 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-04-28 05:58:12,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:58:12,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948455861] [2022-04-28 05:58:12,801 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:58:12,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1598829282] [2022-04-28 05:58:12,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1598829282] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:58:12,801 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:58:12,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2022-04-28 05:58:12,801 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:58:12,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [944317500] [2022-04-28 05:58:12,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [944317500] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:58:12,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:58:12,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 05:58:12,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668598650] [2022-04-28 05:58:12,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:58:12,802 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) Word has length 81 [2022-04-28 05:58:12,802 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:58:12,802 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-28 05:58:12,858 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:58:12,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 05:58:12,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:58:12,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 05:58:12,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=222, Unknown=0, NotChecked=0, Total=380 [2022-04-28 05:58:12,859 INFO L87 Difference]: Start difference. First operand 157 states and 198 transitions. Second operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-28 05:58:13,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:58:13,467 INFO L93 Difference]: Finished difference Result 213 states and 277 transitions. [2022-04-28 05:58:13,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 05:58:13,467 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) Word has length 81 [2022-04-28 05:58:13,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:58:13,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-28 05:58:13,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 177 transitions. [2022-04-28 05:58:13,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-28 05:58:13,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 177 transitions. [2022-04-28 05:58:13,471 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 177 transitions. [2022-04-28 05:58:13,612 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 177 edges. 177 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:58:13,615 INFO L225 Difference]: With dead ends: 213 [2022-04-28 05:58:13,615 INFO L226 Difference]: Without dead ends: 164 [2022-04-28 05:58:13,615 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=243, Invalid=357, Unknown=0, NotChecked=0, Total=600 [2022-04-28 05:58:13,616 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 82 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 05:58:13,616 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 193 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 05:58:13,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-04-28 05:58:13,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 160. [2022-04-28 05:58:13,794 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:58:13,794 INFO L82 GeneralOperation]: Start isEquivalent. First operand 164 states. Second operand has 160 states, 117 states have (on average 1.1965811965811965) internal successors, (140), 119 states have internal predecessors, (140), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-28 05:58:13,795 INFO L74 IsIncluded]: Start isIncluded. First operand 164 states. Second operand has 160 states, 117 states have (on average 1.1965811965811965) internal successors, (140), 119 states have internal predecessors, (140), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-28 05:58:13,795 INFO L87 Difference]: Start difference. First operand 164 states. Second operand has 160 states, 117 states have (on average 1.1965811965811965) internal successors, (140), 119 states have internal predecessors, (140), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-28 05:58:13,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:58:13,798 INFO L93 Difference]: Finished difference Result 164 states and 206 transitions. [2022-04-28 05:58:13,798 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 206 transitions. [2022-04-28 05:58:13,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:58:13,799 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:58:13,799 INFO L74 IsIncluded]: Start isIncluded. First operand has 160 states, 117 states have (on average 1.1965811965811965) internal successors, (140), 119 states have internal predecessors, (140), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) Second operand 164 states. [2022-04-28 05:58:13,799 INFO L87 Difference]: Start difference. First operand has 160 states, 117 states have (on average 1.1965811965811965) internal successors, (140), 119 states have internal predecessors, (140), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) Second operand 164 states. [2022-04-28 05:58:13,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:58:13,802 INFO L93 Difference]: Finished difference Result 164 states and 206 transitions. [2022-04-28 05:58:13,802 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 206 transitions. [2022-04-28 05:58:13,802 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:58:13,803 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:58:13,803 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:58:13,803 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:58:13,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 117 states have (on average 1.1965811965811965) internal successors, (140), 119 states have internal predecessors, (140), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-28 05:58:13,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 202 transitions. [2022-04-28 05:58:13,806 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 202 transitions. Word has length 81 [2022-04-28 05:58:13,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:58:13,806 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 202 transitions. [2022-04-28 05:58:13,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-28 05:58:13,807 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 160 states and 202 transitions. [2022-04-28 05:58:14,414 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 202 edges. 202 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:58:14,414 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 202 transitions. [2022-04-28 05:58:14,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-04-28 05:58:14,415 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:58:14,415 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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-04-28 05:58:14,439 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-04-28 05:58:14,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:58:14,627 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:58:14,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:58:14,628 INFO L85 PathProgramCache]: Analyzing trace with hash -918360272, now seen corresponding path program 3 times [2022-04-28 05:58:14,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:58:14,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1097486899] [2022-04-28 05:58:14,628 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:58:14,628 INFO L85 PathProgramCache]: Analyzing trace with hash -918360272, now seen corresponding path program 4 times [2022-04-28 05:58:14,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:58:14,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385858848] [2022-04-28 05:58:14,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:58:14,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:58:14,642 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:58:14,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2014942421] [2022-04-28 05:58:14,642 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 05:58:14,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:58:14,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:58:14,643 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:58:14,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-04-28 05:58:14,778 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 05:58:14,779 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:58:14,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-28 05:58:14,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:58:14,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:58:15,263 INFO L272 TraceCheckUtils]: 0: Hoare triple {20229#true} call ULTIMATE.init(); {20229#true} is VALID [2022-04-28 05:58:15,264 INFO L290 TraceCheckUtils]: 1: Hoare triple {20229#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {20237#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:15,264 INFO L290 TraceCheckUtils]: 2: Hoare triple {20237#(<= ~counter~0 0)} assume true; {20237#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:15,264 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20237#(<= ~counter~0 0)} {20229#true} #102#return; {20237#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:15,265 INFO L272 TraceCheckUtils]: 4: Hoare triple {20237#(<= ~counter~0 0)} call #t~ret9 := main(); {20237#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:15,265 INFO L290 TraceCheckUtils]: 5: Hoare triple {20237#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {20237#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:15,265 INFO L272 TraceCheckUtils]: 6: Hoare triple {20237#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {20237#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:15,266 INFO L290 TraceCheckUtils]: 7: Hoare triple {20237#(<= ~counter~0 0)} ~cond := #in~cond; {20237#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:15,266 INFO L290 TraceCheckUtils]: 8: Hoare triple {20237#(<= ~counter~0 0)} assume !(0 == ~cond); {20237#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:15,266 INFO L290 TraceCheckUtils]: 9: Hoare triple {20237#(<= ~counter~0 0)} assume true; {20237#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:15,267 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {20237#(<= ~counter~0 0)} {20237#(<= ~counter~0 0)} #90#return; {20237#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:15,267 INFO L272 TraceCheckUtils]: 11: Hoare triple {20237#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {20237#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:15,267 INFO L290 TraceCheckUtils]: 12: Hoare triple {20237#(<= ~counter~0 0)} ~cond := #in~cond; {20237#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:15,268 INFO L290 TraceCheckUtils]: 13: Hoare triple {20237#(<= ~counter~0 0)} assume !(0 == ~cond); {20237#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:15,268 INFO L290 TraceCheckUtils]: 14: Hoare triple {20237#(<= ~counter~0 0)} assume true; {20237#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:15,268 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {20237#(<= ~counter~0 0)} {20237#(<= ~counter~0 0)} #92#return; {20237#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:15,269 INFO L290 TraceCheckUtils]: 16: Hoare triple {20237#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {20237#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:15,269 INFO L290 TraceCheckUtils]: 17: Hoare triple {20237#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20286#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:15,269 INFO L290 TraceCheckUtils]: 18: Hoare triple {20286#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {20286#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:15,270 INFO L272 TraceCheckUtils]: 19: Hoare triple {20286#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {20286#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:15,270 INFO L290 TraceCheckUtils]: 20: Hoare triple {20286#(<= ~counter~0 1)} ~cond := #in~cond; {20286#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:15,271 INFO L290 TraceCheckUtils]: 21: Hoare triple {20286#(<= ~counter~0 1)} assume !(0 == ~cond); {20286#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:15,271 INFO L290 TraceCheckUtils]: 22: Hoare triple {20286#(<= ~counter~0 1)} assume true; {20286#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:15,271 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {20286#(<= ~counter~0 1)} {20286#(<= ~counter~0 1)} #94#return; {20286#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:15,272 INFO L290 TraceCheckUtils]: 24: Hoare triple {20286#(<= ~counter~0 1)} assume !!(0 != ~r~0); {20286#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:15,272 INFO L290 TraceCheckUtils]: 25: Hoare triple {20286#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20311#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:15,272 INFO L290 TraceCheckUtils]: 26: Hoare triple {20311#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {20311#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:15,273 INFO L272 TraceCheckUtils]: 27: Hoare triple {20311#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {20311#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:15,273 INFO L290 TraceCheckUtils]: 28: Hoare triple {20311#(<= ~counter~0 2)} ~cond := #in~cond; {20311#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:15,273 INFO L290 TraceCheckUtils]: 29: Hoare triple {20311#(<= ~counter~0 2)} assume !(0 == ~cond); {20311#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:15,274 INFO L290 TraceCheckUtils]: 30: Hoare triple {20311#(<= ~counter~0 2)} assume true; {20311#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:15,274 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {20311#(<= ~counter~0 2)} {20311#(<= ~counter~0 2)} #96#return; {20311#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:15,274 INFO L290 TraceCheckUtils]: 32: Hoare triple {20311#(<= ~counter~0 2)} assume !(~r~0 > 0); {20311#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:15,275 INFO L290 TraceCheckUtils]: 33: Hoare triple {20311#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {20336#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:15,275 INFO L290 TraceCheckUtils]: 34: Hoare triple {20336#(<= ~counter~0 3)} assume !!(#t~post8 < 20);havoc #t~post8; {20336#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:15,276 INFO L272 TraceCheckUtils]: 35: Hoare triple {20336#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {20336#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:15,276 INFO L290 TraceCheckUtils]: 36: Hoare triple {20336#(<= ~counter~0 3)} ~cond := #in~cond; {20336#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:15,276 INFO L290 TraceCheckUtils]: 37: Hoare triple {20336#(<= ~counter~0 3)} assume !(0 == ~cond); {20336#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:15,276 INFO L290 TraceCheckUtils]: 38: Hoare triple {20336#(<= ~counter~0 3)} assume true; {20336#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:15,277 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {20336#(<= ~counter~0 3)} {20336#(<= ~counter~0 3)} #98#return; {20336#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:15,277 INFO L290 TraceCheckUtils]: 40: Hoare triple {20336#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {20336#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:15,278 INFO L290 TraceCheckUtils]: 41: Hoare triple {20336#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {20361#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:15,278 INFO L290 TraceCheckUtils]: 42: Hoare triple {20361#(<= ~counter~0 4)} assume !!(#t~post8 < 20);havoc #t~post8; {20361#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:15,278 INFO L272 TraceCheckUtils]: 43: Hoare triple {20361#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {20361#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:15,279 INFO L290 TraceCheckUtils]: 44: Hoare triple {20361#(<= ~counter~0 4)} ~cond := #in~cond; {20361#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:15,279 INFO L290 TraceCheckUtils]: 45: Hoare triple {20361#(<= ~counter~0 4)} assume !(0 == ~cond); {20361#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:15,279 INFO L290 TraceCheckUtils]: 46: Hoare triple {20361#(<= ~counter~0 4)} assume true; {20361#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:15,280 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {20361#(<= ~counter~0 4)} {20361#(<= ~counter~0 4)} #98#return; {20361#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:15,280 INFO L290 TraceCheckUtils]: 48: Hoare triple {20361#(<= ~counter~0 4)} assume !(~r~0 < 0); {20361#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:15,281 INFO L290 TraceCheckUtils]: 49: Hoare triple {20361#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20386#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:15,281 INFO L290 TraceCheckUtils]: 50: Hoare triple {20386#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {20386#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:15,281 INFO L272 TraceCheckUtils]: 51: Hoare triple {20386#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {20386#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:15,282 INFO L290 TraceCheckUtils]: 52: Hoare triple {20386#(<= ~counter~0 5)} ~cond := #in~cond; {20386#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:15,282 INFO L290 TraceCheckUtils]: 53: Hoare triple {20386#(<= ~counter~0 5)} assume !(0 == ~cond); {20386#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:15,282 INFO L290 TraceCheckUtils]: 54: Hoare triple {20386#(<= ~counter~0 5)} assume true; {20386#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:15,283 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {20386#(<= ~counter~0 5)} {20386#(<= ~counter~0 5)} #94#return; {20386#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:15,283 INFO L290 TraceCheckUtils]: 56: Hoare triple {20386#(<= ~counter~0 5)} assume !!(0 != ~r~0); {20386#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:15,283 INFO L290 TraceCheckUtils]: 57: Hoare triple {20386#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20411#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:15,284 INFO L290 TraceCheckUtils]: 58: Hoare triple {20411#(<= ~counter~0 6)} assume !!(#t~post7 < 20);havoc #t~post7; {20411#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:15,284 INFO L272 TraceCheckUtils]: 59: Hoare triple {20411#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {20411#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:15,284 INFO L290 TraceCheckUtils]: 60: Hoare triple {20411#(<= ~counter~0 6)} ~cond := #in~cond; {20411#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:15,285 INFO L290 TraceCheckUtils]: 61: Hoare triple {20411#(<= ~counter~0 6)} assume !(0 == ~cond); {20411#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:15,285 INFO L290 TraceCheckUtils]: 62: Hoare triple {20411#(<= ~counter~0 6)} assume true; {20411#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:15,285 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {20411#(<= ~counter~0 6)} {20411#(<= ~counter~0 6)} #96#return; {20411#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:15,286 INFO L290 TraceCheckUtils]: 64: Hoare triple {20411#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {20411#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:15,286 INFO L290 TraceCheckUtils]: 65: Hoare triple {20411#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20436#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:15,287 INFO L290 TraceCheckUtils]: 66: Hoare triple {20436#(<= ~counter~0 7)} assume !!(#t~post7 < 20);havoc #t~post7; {20436#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:15,287 INFO L272 TraceCheckUtils]: 67: Hoare triple {20436#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {20436#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:15,287 INFO L290 TraceCheckUtils]: 68: Hoare triple {20436#(<= ~counter~0 7)} ~cond := #in~cond; {20436#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:15,288 INFO L290 TraceCheckUtils]: 69: Hoare triple {20436#(<= ~counter~0 7)} assume !(0 == ~cond); {20436#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:15,288 INFO L290 TraceCheckUtils]: 70: Hoare triple {20436#(<= ~counter~0 7)} assume true; {20436#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:15,288 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {20436#(<= ~counter~0 7)} {20436#(<= ~counter~0 7)} #96#return; {20436#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:15,289 INFO L290 TraceCheckUtils]: 72: Hoare triple {20436#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {20436#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:15,289 INFO L290 TraceCheckUtils]: 73: Hoare triple {20436#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20461#(<= |main_#t~post7| 7)} is VALID [2022-04-28 05:58:15,289 INFO L290 TraceCheckUtils]: 74: Hoare triple {20461#(<= |main_#t~post7| 7)} assume !(#t~post7 < 20);havoc #t~post7; {20230#false} is VALID [2022-04-28 05:58:15,289 INFO L290 TraceCheckUtils]: 75: Hoare triple {20230#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {20230#false} is VALID [2022-04-28 05:58:15,289 INFO L290 TraceCheckUtils]: 76: Hoare triple {20230#false} assume !(#t~post8 < 20);havoc #t~post8; {20230#false} is VALID [2022-04-28 05:58:15,289 INFO L290 TraceCheckUtils]: 77: Hoare triple {20230#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20230#false} is VALID [2022-04-28 05:58:15,290 INFO L290 TraceCheckUtils]: 78: Hoare triple {20230#false} assume !(#t~post6 < 20);havoc #t~post6; {20230#false} is VALID [2022-04-28 05:58:15,290 INFO L272 TraceCheckUtils]: 79: Hoare triple {20230#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {20230#false} is VALID [2022-04-28 05:58:15,290 INFO L290 TraceCheckUtils]: 80: Hoare triple {20230#false} ~cond := #in~cond; {20230#false} is VALID [2022-04-28 05:58:15,290 INFO L290 TraceCheckUtils]: 81: Hoare triple {20230#false} assume 0 == ~cond; {20230#false} is VALID [2022-04-28 05:58:15,290 INFO L290 TraceCheckUtils]: 82: Hoare triple {20230#false} assume !false; {20230#false} is VALID [2022-04-28 05:58:15,290 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 22 proven. 110 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 05:58:15,290 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:58:15,751 INFO L290 TraceCheckUtils]: 82: Hoare triple {20230#false} assume !false; {20230#false} is VALID [2022-04-28 05:58:15,752 INFO L290 TraceCheckUtils]: 81: Hoare triple {20230#false} assume 0 == ~cond; {20230#false} is VALID [2022-04-28 05:58:15,752 INFO L290 TraceCheckUtils]: 80: Hoare triple {20230#false} ~cond := #in~cond; {20230#false} is VALID [2022-04-28 05:58:15,752 INFO L272 TraceCheckUtils]: 79: Hoare triple {20230#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {20230#false} is VALID [2022-04-28 05:58:15,752 INFO L290 TraceCheckUtils]: 78: Hoare triple {20230#false} assume !(#t~post6 < 20);havoc #t~post6; {20230#false} is VALID [2022-04-28 05:58:15,752 INFO L290 TraceCheckUtils]: 77: Hoare triple {20230#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20230#false} is VALID [2022-04-28 05:58:15,752 INFO L290 TraceCheckUtils]: 76: Hoare triple {20230#false} assume !(#t~post8 < 20);havoc #t~post8; {20230#false} is VALID [2022-04-28 05:58:15,752 INFO L290 TraceCheckUtils]: 75: Hoare triple {20230#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {20230#false} is VALID [2022-04-28 05:58:15,752 INFO L290 TraceCheckUtils]: 74: Hoare triple {20513#(< |main_#t~post7| 20)} assume !(#t~post7 < 20);havoc #t~post7; {20230#false} is VALID [2022-04-28 05:58:15,753 INFO L290 TraceCheckUtils]: 73: Hoare triple {20517#(< ~counter~0 20)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20513#(< |main_#t~post7| 20)} is VALID [2022-04-28 05:58:15,753 INFO L290 TraceCheckUtils]: 72: Hoare triple {20517#(< ~counter~0 20)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {20517#(< ~counter~0 20)} is VALID [2022-04-28 05:58:15,753 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {20229#true} {20517#(< ~counter~0 20)} #96#return; {20517#(< ~counter~0 20)} is VALID [2022-04-28 05:58:15,753 INFO L290 TraceCheckUtils]: 70: Hoare triple {20229#true} assume true; {20229#true} is VALID [2022-04-28 05:58:15,753 INFO L290 TraceCheckUtils]: 69: Hoare triple {20229#true} assume !(0 == ~cond); {20229#true} is VALID [2022-04-28 05:58:15,754 INFO L290 TraceCheckUtils]: 68: Hoare triple {20229#true} ~cond := #in~cond; {20229#true} is VALID [2022-04-28 05:58:15,754 INFO L272 TraceCheckUtils]: 67: Hoare triple {20517#(< ~counter~0 20)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {20229#true} is VALID [2022-04-28 05:58:15,754 INFO L290 TraceCheckUtils]: 66: Hoare triple {20517#(< ~counter~0 20)} assume !!(#t~post7 < 20);havoc #t~post7; {20517#(< ~counter~0 20)} is VALID [2022-04-28 05:58:15,755 INFO L290 TraceCheckUtils]: 65: Hoare triple {20542#(< ~counter~0 19)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20517#(< ~counter~0 20)} is VALID [2022-04-28 05:58:15,755 INFO L290 TraceCheckUtils]: 64: Hoare triple {20542#(< ~counter~0 19)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {20542#(< ~counter~0 19)} is VALID [2022-04-28 05:58:15,755 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {20229#true} {20542#(< ~counter~0 19)} #96#return; {20542#(< ~counter~0 19)} is VALID [2022-04-28 05:58:15,755 INFO L290 TraceCheckUtils]: 62: Hoare triple {20229#true} assume true; {20229#true} is VALID [2022-04-28 05:58:15,755 INFO L290 TraceCheckUtils]: 61: Hoare triple {20229#true} assume !(0 == ~cond); {20229#true} is VALID [2022-04-28 05:58:15,756 INFO L290 TraceCheckUtils]: 60: Hoare triple {20229#true} ~cond := #in~cond; {20229#true} is VALID [2022-04-28 05:58:15,756 INFO L272 TraceCheckUtils]: 59: Hoare triple {20542#(< ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {20229#true} is VALID [2022-04-28 05:58:15,756 INFO L290 TraceCheckUtils]: 58: Hoare triple {20542#(< ~counter~0 19)} assume !!(#t~post7 < 20);havoc #t~post7; {20542#(< ~counter~0 19)} is VALID [2022-04-28 05:58:15,756 INFO L290 TraceCheckUtils]: 57: Hoare triple {20567#(< ~counter~0 18)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20542#(< ~counter~0 19)} is VALID [2022-04-28 05:58:15,757 INFO L290 TraceCheckUtils]: 56: Hoare triple {20567#(< ~counter~0 18)} assume !!(0 != ~r~0); {20567#(< ~counter~0 18)} is VALID [2022-04-28 05:58:15,757 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {20229#true} {20567#(< ~counter~0 18)} #94#return; {20567#(< ~counter~0 18)} is VALID [2022-04-28 05:58:15,757 INFO L290 TraceCheckUtils]: 54: Hoare triple {20229#true} assume true; {20229#true} is VALID [2022-04-28 05:58:15,757 INFO L290 TraceCheckUtils]: 53: Hoare triple {20229#true} assume !(0 == ~cond); {20229#true} is VALID [2022-04-28 05:58:15,757 INFO L290 TraceCheckUtils]: 52: Hoare triple {20229#true} ~cond := #in~cond; {20229#true} is VALID [2022-04-28 05:58:15,757 INFO L272 TraceCheckUtils]: 51: Hoare triple {20567#(< ~counter~0 18)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {20229#true} is VALID [2022-04-28 05:58:15,758 INFO L290 TraceCheckUtils]: 50: Hoare triple {20567#(< ~counter~0 18)} assume !!(#t~post6 < 20);havoc #t~post6; {20567#(< ~counter~0 18)} is VALID [2022-04-28 05:58:15,758 INFO L290 TraceCheckUtils]: 49: Hoare triple {20592#(< ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20567#(< ~counter~0 18)} is VALID [2022-04-28 05:58:15,758 INFO L290 TraceCheckUtils]: 48: Hoare triple {20592#(< ~counter~0 17)} assume !(~r~0 < 0); {20592#(< ~counter~0 17)} is VALID [2022-04-28 05:58:15,759 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {20229#true} {20592#(< ~counter~0 17)} #98#return; {20592#(< ~counter~0 17)} is VALID [2022-04-28 05:58:15,759 INFO L290 TraceCheckUtils]: 46: Hoare triple {20229#true} assume true; {20229#true} is VALID [2022-04-28 05:58:15,759 INFO L290 TraceCheckUtils]: 45: Hoare triple {20229#true} assume !(0 == ~cond); {20229#true} is VALID [2022-04-28 05:58:15,759 INFO L290 TraceCheckUtils]: 44: Hoare triple {20229#true} ~cond := #in~cond; {20229#true} is VALID [2022-04-28 05:58:15,759 INFO L272 TraceCheckUtils]: 43: Hoare triple {20592#(< ~counter~0 17)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {20229#true} is VALID [2022-04-28 05:58:15,764 INFO L290 TraceCheckUtils]: 42: Hoare triple {20592#(< ~counter~0 17)} assume !!(#t~post8 < 20);havoc #t~post8; {20592#(< ~counter~0 17)} is VALID [2022-04-28 05:58:15,764 INFO L290 TraceCheckUtils]: 41: Hoare triple {20617#(< ~counter~0 16)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {20592#(< ~counter~0 17)} is VALID [2022-04-28 05:58:15,765 INFO L290 TraceCheckUtils]: 40: Hoare triple {20617#(< ~counter~0 16)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {20617#(< ~counter~0 16)} is VALID [2022-04-28 05:58:15,765 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {20229#true} {20617#(< ~counter~0 16)} #98#return; {20617#(< ~counter~0 16)} is VALID [2022-04-28 05:58:15,765 INFO L290 TraceCheckUtils]: 38: Hoare triple {20229#true} assume true; {20229#true} is VALID [2022-04-28 05:58:15,765 INFO L290 TraceCheckUtils]: 37: Hoare triple {20229#true} assume !(0 == ~cond); {20229#true} is VALID [2022-04-28 05:58:15,765 INFO L290 TraceCheckUtils]: 36: Hoare triple {20229#true} ~cond := #in~cond; {20229#true} is VALID [2022-04-28 05:58:15,765 INFO L272 TraceCheckUtils]: 35: Hoare triple {20617#(< ~counter~0 16)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {20229#true} is VALID [2022-04-28 05:58:15,766 INFO L290 TraceCheckUtils]: 34: Hoare triple {20617#(< ~counter~0 16)} assume !!(#t~post8 < 20);havoc #t~post8; {20617#(< ~counter~0 16)} is VALID [2022-04-28 05:58:15,766 INFO L290 TraceCheckUtils]: 33: Hoare triple {20642#(< ~counter~0 15)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {20617#(< ~counter~0 16)} is VALID [2022-04-28 05:58:15,766 INFO L290 TraceCheckUtils]: 32: Hoare triple {20642#(< ~counter~0 15)} assume !(~r~0 > 0); {20642#(< ~counter~0 15)} is VALID [2022-04-28 05:58:15,767 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {20229#true} {20642#(< ~counter~0 15)} #96#return; {20642#(< ~counter~0 15)} is VALID [2022-04-28 05:58:15,767 INFO L290 TraceCheckUtils]: 30: Hoare triple {20229#true} assume true; {20229#true} is VALID [2022-04-28 05:58:15,767 INFO L290 TraceCheckUtils]: 29: Hoare triple {20229#true} assume !(0 == ~cond); {20229#true} is VALID [2022-04-28 05:58:15,767 INFO L290 TraceCheckUtils]: 28: Hoare triple {20229#true} ~cond := #in~cond; {20229#true} is VALID [2022-04-28 05:58:15,767 INFO L272 TraceCheckUtils]: 27: Hoare triple {20642#(< ~counter~0 15)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {20229#true} is VALID [2022-04-28 05:58:15,767 INFO L290 TraceCheckUtils]: 26: Hoare triple {20642#(< ~counter~0 15)} assume !!(#t~post7 < 20);havoc #t~post7; {20642#(< ~counter~0 15)} is VALID [2022-04-28 05:58:15,768 INFO L290 TraceCheckUtils]: 25: Hoare triple {20667#(< ~counter~0 14)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20642#(< ~counter~0 15)} is VALID [2022-04-28 05:58:15,768 INFO L290 TraceCheckUtils]: 24: Hoare triple {20667#(< ~counter~0 14)} assume !!(0 != ~r~0); {20667#(< ~counter~0 14)} is VALID [2022-04-28 05:58:15,769 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {20229#true} {20667#(< ~counter~0 14)} #94#return; {20667#(< ~counter~0 14)} is VALID [2022-04-28 05:58:15,769 INFO L290 TraceCheckUtils]: 22: Hoare triple {20229#true} assume true; {20229#true} is VALID [2022-04-28 05:58:15,769 INFO L290 TraceCheckUtils]: 21: Hoare triple {20229#true} assume !(0 == ~cond); {20229#true} is VALID [2022-04-28 05:58:15,769 INFO L290 TraceCheckUtils]: 20: Hoare triple {20229#true} ~cond := #in~cond; {20229#true} is VALID [2022-04-28 05:58:15,769 INFO L272 TraceCheckUtils]: 19: Hoare triple {20667#(< ~counter~0 14)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {20229#true} is VALID [2022-04-28 05:58:15,769 INFO L290 TraceCheckUtils]: 18: Hoare triple {20667#(< ~counter~0 14)} assume !!(#t~post6 < 20);havoc #t~post6; {20667#(< ~counter~0 14)} is VALID [2022-04-28 05:58:15,770 INFO L290 TraceCheckUtils]: 17: Hoare triple {20692#(< ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20667#(< ~counter~0 14)} is VALID [2022-04-28 05:58:15,770 INFO L290 TraceCheckUtils]: 16: Hoare triple {20692#(< ~counter~0 13)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {20692#(< ~counter~0 13)} is VALID [2022-04-28 05:58:15,770 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {20229#true} {20692#(< ~counter~0 13)} #92#return; {20692#(< ~counter~0 13)} is VALID [2022-04-28 05:58:15,770 INFO L290 TraceCheckUtils]: 14: Hoare triple {20229#true} assume true; {20229#true} is VALID [2022-04-28 05:58:15,771 INFO L290 TraceCheckUtils]: 13: Hoare triple {20229#true} assume !(0 == ~cond); {20229#true} is VALID [2022-04-28 05:58:15,771 INFO L290 TraceCheckUtils]: 12: Hoare triple {20229#true} ~cond := #in~cond; {20229#true} is VALID [2022-04-28 05:58:15,771 INFO L272 TraceCheckUtils]: 11: Hoare triple {20692#(< ~counter~0 13)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {20229#true} is VALID [2022-04-28 05:58:15,771 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {20229#true} {20692#(< ~counter~0 13)} #90#return; {20692#(< ~counter~0 13)} is VALID [2022-04-28 05:58:15,771 INFO L290 TraceCheckUtils]: 9: Hoare triple {20229#true} assume true; {20229#true} is VALID [2022-04-28 05:58:15,771 INFO L290 TraceCheckUtils]: 8: Hoare triple {20229#true} assume !(0 == ~cond); {20229#true} is VALID [2022-04-28 05:58:15,771 INFO L290 TraceCheckUtils]: 7: Hoare triple {20229#true} ~cond := #in~cond; {20229#true} is VALID [2022-04-28 05:58:15,771 INFO L272 TraceCheckUtils]: 6: Hoare triple {20692#(< ~counter~0 13)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {20229#true} is VALID [2022-04-28 05:58:15,772 INFO L290 TraceCheckUtils]: 5: Hoare triple {20692#(< ~counter~0 13)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {20692#(< ~counter~0 13)} is VALID [2022-04-28 05:58:15,772 INFO L272 TraceCheckUtils]: 4: Hoare triple {20692#(< ~counter~0 13)} call #t~ret9 := main(); {20692#(< ~counter~0 13)} is VALID [2022-04-28 05:58:15,772 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20692#(< ~counter~0 13)} {20229#true} #102#return; {20692#(< ~counter~0 13)} is VALID [2022-04-28 05:58:15,772 INFO L290 TraceCheckUtils]: 2: Hoare triple {20692#(< ~counter~0 13)} assume true; {20692#(< ~counter~0 13)} is VALID [2022-04-28 05:58:15,773 INFO L290 TraceCheckUtils]: 1: Hoare triple {20229#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {20692#(< ~counter~0 13)} is VALID [2022-04-28 05:58:15,773 INFO L272 TraceCheckUtils]: 0: Hoare triple {20229#true} call ULTIMATE.init(); {20229#true} is VALID [2022-04-28 05:58:15,773 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 22 proven. 26 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-04-28 05:58:15,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:58:15,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385858848] [2022-04-28 05:58:15,773 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:58:15,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2014942421] [2022-04-28 05:58:15,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2014942421] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:58:15,774 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:58:15,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2022-04-28 05:58:15,774 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:58:15,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1097486899] [2022-04-28 05:58:15,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1097486899] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:58:15,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:58:15,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 05:58:15,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943248719] [2022-04-28 05:58:15,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:58:15,774 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 states have internal predecessors, (58), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) Word has length 83 [2022-04-28 05:58:15,774 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:58:15,775 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 states have internal predecessors, (58), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-28 05:58:15,830 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:58:15,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 05:58:15,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:58:15,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 05:58:15,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=222, Unknown=0, NotChecked=0, Total=380 [2022-04-28 05:58:15,831 INFO L87 Difference]: Start difference. First operand 160 states and 202 transitions. Second operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 states have internal predecessors, (58), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-28 05:58:16,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:58:16,441 INFO L93 Difference]: Finished difference Result 215 states and 280 transitions. [2022-04-28 05:58:16,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-28 05:58:16,441 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 states have internal predecessors, (58), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) Word has length 83 [2022-04-28 05:58:16,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:58:16,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 states have internal predecessors, (58), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-28 05:58:16,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 177 transitions. [2022-04-28 05:58:16,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 states have internal predecessors, (58), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-28 05:58:16,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 177 transitions. [2022-04-28 05:58:16,446 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 177 transitions. [2022-04-28 05:58:16,601 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 177 edges. 177 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:58:16,604 INFO L225 Difference]: With dead ends: 215 [2022-04-28 05:58:16,604 INFO L226 Difference]: Without dead ends: 166 [2022-04-28 05:58:16,605 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=266, Invalid=384, Unknown=0, NotChecked=0, Total=650 [2022-04-28 05:58:16,605 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 67 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 05:58:16,605 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 215 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 05:58:16,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-04-28 05:58:16,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2022-04-28 05:58:16,827 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:58:16,827 INFO L82 GeneralOperation]: Start isEquivalent. First operand 166 states. Second operand has 166 states, 123 states have (on average 1.1869918699186992) internal successors, (146), 123 states have internal predecessors, (146), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-28 05:58:16,828 INFO L74 IsIncluded]: Start isIncluded. First operand 166 states. Second operand has 166 states, 123 states have (on average 1.1869918699186992) internal successors, (146), 123 states have internal predecessors, (146), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-28 05:58:16,828 INFO L87 Difference]: Start difference. First operand 166 states. Second operand has 166 states, 123 states have (on average 1.1869918699186992) internal successors, (146), 123 states have internal predecessors, (146), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-28 05:58:16,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:58:16,832 INFO L93 Difference]: Finished difference Result 166 states and 208 transitions. [2022-04-28 05:58:16,832 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 208 transitions. [2022-04-28 05:58:16,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:58:16,833 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:58:16,833 INFO L74 IsIncluded]: Start isIncluded. First operand has 166 states, 123 states have (on average 1.1869918699186992) internal successors, (146), 123 states have internal predecessors, (146), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand 166 states. [2022-04-28 05:58:16,833 INFO L87 Difference]: Start difference. First operand has 166 states, 123 states have (on average 1.1869918699186992) internal successors, (146), 123 states have internal predecessors, (146), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand 166 states. [2022-04-28 05:58:16,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:58:16,836 INFO L93 Difference]: Finished difference Result 166 states and 208 transitions. [2022-04-28 05:58:16,836 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 208 transitions. [2022-04-28 05:58:16,837 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:58:16,837 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:58:16,837 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:58:16,837 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:58:16,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 123 states have (on average 1.1869918699186992) internal successors, (146), 123 states have internal predecessors, (146), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-28 05:58:16,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 208 transitions. [2022-04-28 05:58:16,840 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 208 transitions. Word has length 83 [2022-04-28 05:58:16,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:58:16,841 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 208 transitions. [2022-04-28 05:58:16,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 states have internal predecessors, (58), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-28 05:58:16,841 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 166 states and 208 transitions. [2022-04-28 05:58:19,069 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 208 edges. 208 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:58:19,069 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 208 transitions. [2022-04-28 05:58:19,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-04-28 05:58:19,070 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:58:19,070 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:58:19,086 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-04-28 05:58:19,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:58:19,270 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:58:19,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:58:19,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1698627479, now seen corresponding path program 1 times [2022-04-28 05:58:19,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:58:19,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1277210346] [2022-04-28 05:58:19,271 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:58:19,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1698627479, now seen corresponding path program 2 times [2022-04-28 05:58:19,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:58:19,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552427048] [2022-04-28 05:58:19,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:58:19,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:58:19,284 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:58:19,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1211658479] [2022-04-28 05:58:19,285 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:58:19,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:58:19,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:58:19,286 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:58:19,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-04-28 05:58:19,341 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:58:19,341 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:58:19,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 05:58:19,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:58:19,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:58:19,802 INFO L272 TraceCheckUtils]: 0: Hoare triple {21852#true} call ULTIMATE.init(); {21852#true} is VALID [2022-04-28 05:58:19,803 INFO L290 TraceCheckUtils]: 1: Hoare triple {21852#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {21860#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:19,803 INFO L290 TraceCheckUtils]: 2: Hoare triple {21860#(<= ~counter~0 0)} assume true; {21860#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:19,804 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21860#(<= ~counter~0 0)} {21852#true} #102#return; {21860#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:19,804 INFO L272 TraceCheckUtils]: 4: Hoare triple {21860#(<= ~counter~0 0)} call #t~ret9 := main(); {21860#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:19,805 INFO L290 TraceCheckUtils]: 5: Hoare triple {21860#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {21860#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:19,806 INFO L272 TraceCheckUtils]: 6: Hoare triple {21860#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {21860#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:19,806 INFO L290 TraceCheckUtils]: 7: Hoare triple {21860#(<= ~counter~0 0)} ~cond := #in~cond; {21860#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:19,807 INFO L290 TraceCheckUtils]: 8: Hoare triple {21860#(<= ~counter~0 0)} assume !(0 == ~cond); {21860#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:19,807 INFO L290 TraceCheckUtils]: 9: Hoare triple {21860#(<= ~counter~0 0)} assume true; {21860#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:19,808 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {21860#(<= ~counter~0 0)} {21860#(<= ~counter~0 0)} #90#return; {21860#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:19,809 INFO L272 TraceCheckUtils]: 11: Hoare triple {21860#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {21860#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:19,809 INFO L290 TraceCheckUtils]: 12: Hoare triple {21860#(<= ~counter~0 0)} ~cond := #in~cond; {21860#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:19,810 INFO L290 TraceCheckUtils]: 13: Hoare triple {21860#(<= ~counter~0 0)} assume !(0 == ~cond); {21860#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:19,810 INFO L290 TraceCheckUtils]: 14: Hoare triple {21860#(<= ~counter~0 0)} assume true; {21860#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:19,811 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {21860#(<= ~counter~0 0)} {21860#(<= ~counter~0 0)} #92#return; {21860#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:19,812 INFO L290 TraceCheckUtils]: 16: Hoare triple {21860#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {21860#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:19,813 INFO L290 TraceCheckUtils]: 17: Hoare triple {21860#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21909#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:19,813 INFO L290 TraceCheckUtils]: 18: Hoare triple {21909#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {21909#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:19,814 INFO L272 TraceCheckUtils]: 19: Hoare triple {21909#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {21909#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:19,815 INFO L290 TraceCheckUtils]: 20: Hoare triple {21909#(<= ~counter~0 1)} ~cond := #in~cond; {21909#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:19,815 INFO L290 TraceCheckUtils]: 21: Hoare triple {21909#(<= ~counter~0 1)} assume !(0 == ~cond); {21909#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:19,815 INFO L290 TraceCheckUtils]: 22: Hoare triple {21909#(<= ~counter~0 1)} assume true; {21909#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:19,816 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {21909#(<= ~counter~0 1)} {21909#(<= ~counter~0 1)} #94#return; {21909#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:19,816 INFO L290 TraceCheckUtils]: 24: Hoare triple {21909#(<= ~counter~0 1)} assume !!(0 != ~r~0); {21909#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:19,817 INFO L290 TraceCheckUtils]: 25: Hoare triple {21909#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {21934#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:19,817 INFO L290 TraceCheckUtils]: 26: Hoare triple {21934#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {21934#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:19,817 INFO L272 TraceCheckUtils]: 27: Hoare triple {21934#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {21934#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:19,818 INFO L290 TraceCheckUtils]: 28: Hoare triple {21934#(<= ~counter~0 2)} ~cond := #in~cond; {21934#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:19,818 INFO L290 TraceCheckUtils]: 29: Hoare triple {21934#(<= ~counter~0 2)} assume !(0 == ~cond); {21934#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:19,818 INFO L290 TraceCheckUtils]: 30: Hoare triple {21934#(<= ~counter~0 2)} assume true; {21934#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:19,819 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {21934#(<= ~counter~0 2)} {21934#(<= ~counter~0 2)} #96#return; {21934#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:19,819 INFO L290 TraceCheckUtils]: 32: Hoare triple {21934#(<= ~counter~0 2)} assume !(~r~0 > 0); {21934#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:19,820 INFO L290 TraceCheckUtils]: 33: Hoare triple {21934#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {21959#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:19,820 INFO L290 TraceCheckUtils]: 34: Hoare triple {21959#(<= ~counter~0 3)} assume !!(#t~post8 < 20);havoc #t~post8; {21959#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:19,820 INFO L272 TraceCheckUtils]: 35: Hoare triple {21959#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {21959#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:19,821 INFO L290 TraceCheckUtils]: 36: Hoare triple {21959#(<= ~counter~0 3)} ~cond := #in~cond; {21959#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:19,821 INFO L290 TraceCheckUtils]: 37: Hoare triple {21959#(<= ~counter~0 3)} assume !(0 == ~cond); {21959#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:19,821 INFO L290 TraceCheckUtils]: 38: Hoare triple {21959#(<= ~counter~0 3)} assume true; {21959#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:19,822 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {21959#(<= ~counter~0 3)} {21959#(<= ~counter~0 3)} #98#return; {21959#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:19,822 INFO L290 TraceCheckUtils]: 40: Hoare triple {21959#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {21959#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:19,822 INFO L290 TraceCheckUtils]: 41: Hoare triple {21959#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {21984#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:19,823 INFO L290 TraceCheckUtils]: 42: Hoare triple {21984#(<= ~counter~0 4)} assume !!(#t~post8 < 20);havoc #t~post8; {21984#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:19,823 INFO L272 TraceCheckUtils]: 43: Hoare triple {21984#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {21984#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:19,823 INFO L290 TraceCheckUtils]: 44: Hoare triple {21984#(<= ~counter~0 4)} ~cond := #in~cond; {21984#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:19,824 INFO L290 TraceCheckUtils]: 45: Hoare triple {21984#(<= ~counter~0 4)} assume !(0 == ~cond); {21984#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:19,824 INFO L290 TraceCheckUtils]: 46: Hoare triple {21984#(<= ~counter~0 4)} assume true; {21984#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:19,824 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {21984#(<= ~counter~0 4)} {21984#(<= ~counter~0 4)} #98#return; {21984#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:19,825 INFO L290 TraceCheckUtils]: 48: Hoare triple {21984#(<= ~counter~0 4)} assume !(~r~0 < 0); {21984#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:19,825 INFO L290 TraceCheckUtils]: 49: Hoare triple {21984#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22009#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:19,825 INFO L290 TraceCheckUtils]: 50: Hoare triple {22009#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {22009#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:19,826 INFO L272 TraceCheckUtils]: 51: Hoare triple {22009#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {22009#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:19,826 INFO L290 TraceCheckUtils]: 52: Hoare triple {22009#(<= ~counter~0 5)} ~cond := #in~cond; {22009#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:19,826 INFO L290 TraceCheckUtils]: 53: Hoare triple {22009#(<= ~counter~0 5)} assume !(0 == ~cond); {22009#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:19,827 INFO L290 TraceCheckUtils]: 54: Hoare triple {22009#(<= ~counter~0 5)} assume true; {22009#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:19,827 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {22009#(<= ~counter~0 5)} {22009#(<= ~counter~0 5)} #94#return; {22009#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:19,827 INFO L290 TraceCheckUtils]: 56: Hoare triple {22009#(<= ~counter~0 5)} assume !!(0 != ~r~0); {22009#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:19,828 INFO L290 TraceCheckUtils]: 57: Hoare triple {22009#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22034#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:19,828 INFO L290 TraceCheckUtils]: 58: Hoare triple {22034#(<= ~counter~0 6)} assume !!(#t~post7 < 20);havoc #t~post7; {22034#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:19,829 INFO L272 TraceCheckUtils]: 59: Hoare triple {22034#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {22034#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:19,829 INFO L290 TraceCheckUtils]: 60: Hoare triple {22034#(<= ~counter~0 6)} ~cond := #in~cond; {22034#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:19,829 INFO L290 TraceCheckUtils]: 61: Hoare triple {22034#(<= ~counter~0 6)} assume !(0 == ~cond); {22034#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:19,830 INFO L290 TraceCheckUtils]: 62: Hoare triple {22034#(<= ~counter~0 6)} assume true; {22034#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:19,830 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {22034#(<= ~counter~0 6)} {22034#(<= ~counter~0 6)} #96#return; {22034#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:19,830 INFO L290 TraceCheckUtils]: 64: Hoare triple {22034#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {22034#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:19,831 INFO L290 TraceCheckUtils]: 65: Hoare triple {22034#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22059#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:19,831 INFO L290 TraceCheckUtils]: 66: Hoare triple {22059#(<= ~counter~0 7)} assume !!(#t~post7 < 20);havoc #t~post7; {22059#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:19,832 INFO L272 TraceCheckUtils]: 67: Hoare triple {22059#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {22059#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:19,832 INFO L290 TraceCheckUtils]: 68: Hoare triple {22059#(<= ~counter~0 7)} ~cond := #in~cond; {22059#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:19,832 INFO L290 TraceCheckUtils]: 69: Hoare triple {22059#(<= ~counter~0 7)} assume !(0 == ~cond); {22059#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:19,832 INFO L290 TraceCheckUtils]: 70: Hoare triple {22059#(<= ~counter~0 7)} assume true; {22059#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:19,833 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {22059#(<= ~counter~0 7)} {22059#(<= ~counter~0 7)} #96#return; {22059#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:19,833 INFO L290 TraceCheckUtils]: 72: Hoare triple {22059#(<= ~counter~0 7)} assume !(~r~0 > 0); {22059#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:19,834 INFO L290 TraceCheckUtils]: 73: Hoare triple {22059#(<= ~counter~0 7)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {22084#(<= ~counter~0 8)} is VALID [2022-04-28 05:58:19,834 INFO L290 TraceCheckUtils]: 74: Hoare triple {22084#(<= ~counter~0 8)} assume !!(#t~post8 < 20);havoc #t~post8; {22084#(<= ~counter~0 8)} is VALID [2022-04-28 05:58:19,834 INFO L272 TraceCheckUtils]: 75: Hoare triple {22084#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {22084#(<= ~counter~0 8)} is VALID [2022-04-28 05:58:19,835 INFO L290 TraceCheckUtils]: 76: Hoare triple {22084#(<= ~counter~0 8)} ~cond := #in~cond; {22084#(<= ~counter~0 8)} is VALID [2022-04-28 05:58:19,835 INFO L290 TraceCheckUtils]: 77: Hoare triple {22084#(<= ~counter~0 8)} assume !(0 == ~cond); {22084#(<= ~counter~0 8)} is VALID [2022-04-28 05:58:19,835 INFO L290 TraceCheckUtils]: 78: Hoare triple {22084#(<= ~counter~0 8)} assume true; {22084#(<= ~counter~0 8)} is VALID [2022-04-28 05:58:19,836 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {22084#(<= ~counter~0 8)} {22084#(<= ~counter~0 8)} #98#return; {22084#(<= ~counter~0 8)} is VALID [2022-04-28 05:58:19,836 INFO L290 TraceCheckUtils]: 80: Hoare triple {22084#(<= ~counter~0 8)} assume !(~r~0 < 0); {22084#(<= ~counter~0 8)} is VALID [2022-04-28 05:58:19,836 INFO L290 TraceCheckUtils]: 81: Hoare triple {22084#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22109#(<= |main_#t~post6| 8)} is VALID [2022-04-28 05:58:19,837 INFO L290 TraceCheckUtils]: 82: Hoare triple {22109#(<= |main_#t~post6| 8)} assume !(#t~post6 < 20);havoc #t~post6; {21853#false} is VALID [2022-04-28 05:58:19,837 INFO L272 TraceCheckUtils]: 83: Hoare triple {21853#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {21853#false} is VALID [2022-04-28 05:58:19,837 INFO L290 TraceCheckUtils]: 84: Hoare triple {21853#false} ~cond := #in~cond; {21853#false} is VALID [2022-04-28 05:58:19,837 INFO L290 TraceCheckUtils]: 85: Hoare triple {21853#false} assume 0 == ~cond; {21853#false} is VALID [2022-04-28 05:58:19,837 INFO L290 TraceCheckUtils]: 86: Hoare triple {21853#false} assume !false; {21853#false} is VALID [2022-04-28 05:58:19,837 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 16 proven. 144 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 05:58:19,837 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:58:20,302 INFO L290 TraceCheckUtils]: 86: Hoare triple {21853#false} assume !false; {21853#false} is VALID [2022-04-28 05:58:20,302 INFO L290 TraceCheckUtils]: 85: Hoare triple {21853#false} assume 0 == ~cond; {21853#false} is VALID [2022-04-28 05:58:20,302 INFO L290 TraceCheckUtils]: 84: Hoare triple {21853#false} ~cond := #in~cond; {21853#false} is VALID [2022-04-28 05:58:20,302 INFO L272 TraceCheckUtils]: 83: Hoare triple {21853#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {21853#false} is VALID [2022-04-28 05:58:20,302 INFO L290 TraceCheckUtils]: 82: Hoare triple {22137#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {21853#false} is VALID [2022-04-28 05:58:20,303 INFO L290 TraceCheckUtils]: 81: Hoare triple {22141#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22137#(< |main_#t~post6| 20)} is VALID [2022-04-28 05:58:20,303 INFO L290 TraceCheckUtils]: 80: Hoare triple {22141#(< ~counter~0 20)} assume !(~r~0 < 0); {22141#(< ~counter~0 20)} is VALID [2022-04-28 05:58:20,304 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {21852#true} {22141#(< ~counter~0 20)} #98#return; {22141#(< ~counter~0 20)} is VALID [2022-04-28 05:58:20,304 INFO L290 TraceCheckUtils]: 78: Hoare triple {21852#true} assume true; {21852#true} is VALID [2022-04-28 05:58:20,304 INFO L290 TraceCheckUtils]: 77: Hoare triple {21852#true} assume !(0 == ~cond); {21852#true} is VALID [2022-04-28 05:58:20,304 INFO L290 TraceCheckUtils]: 76: Hoare triple {21852#true} ~cond := #in~cond; {21852#true} is VALID [2022-04-28 05:58:20,304 INFO L272 TraceCheckUtils]: 75: Hoare triple {22141#(< ~counter~0 20)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {21852#true} is VALID [2022-04-28 05:58:20,304 INFO L290 TraceCheckUtils]: 74: Hoare triple {22141#(< ~counter~0 20)} assume !!(#t~post8 < 20);havoc #t~post8; {22141#(< ~counter~0 20)} is VALID [2022-04-28 05:58:20,305 INFO L290 TraceCheckUtils]: 73: Hoare triple {22166#(< ~counter~0 19)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {22141#(< ~counter~0 20)} is VALID [2022-04-28 05:58:20,305 INFO L290 TraceCheckUtils]: 72: Hoare triple {22166#(< ~counter~0 19)} assume !(~r~0 > 0); {22166#(< ~counter~0 19)} is VALID [2022-04-28 05:58:20,306 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {21852#true} {22166#(< ~counter~0 19)} #96#return; {22166#(< ~counter~0 19)} is VALID [2022-04-28 05:58:20,306 INFO L290 TraceCheckUtils]: 70: Hoare triple {21852#true} assume true; {21852#true} is VALID [2022-04-28 05:58:20,306 INFO L290 TraceCheckUtils]: 69: Hoare triple {21852#true} assume !(0 == ~cond); {21852#true} is VALID [2022-04-28 05:58:20,306 INFO L290 TraceCheckUtils]: 68: Hoare triple {21852#true} ~cond := #in~cond; {21852#true} is VALID [2022-04-28 05:58:20,306 INFO L272 TraceCheckUtils]: 67: Hoare triple {22166#(< ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {21852#true} is VALID [2022-04-28 05:58:20,306 INFO L290 TraceCheckUtils]: 66: Hoare triple {22166#(< ~counter~0 19)} assume !!(#t~post7 < 20);havoc #t~post7; {22166#(< ~counter~0 19)} is VALID [2022-04-28 05:58:20,307 INFO L290 TraceCheckUtils]: 65: Hoare triple {22191#(< ~counter~0 18)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22166#(< ~counter~0 19)} is VALID [2022-04-28 05:58:20,307 INFO L290 TraceCheckUtils]: 64: Hoare triple {22191#(< ~counter~0 18)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {22191#(< ~counter~0 18)} is VALID [2022-04-28 05:58:20,307 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {21852#true} {22191#(< ~counter~0 18)} #96#return; {22191#(< ~counter~0 18)} is VALID [2022-04-28 05:58:20,307 INFO L290 TraceCheckUtils]: 62: Hoare triple {21852#true} assume true; {21852#true} is VALID [2022-04-28 05:58:20,307 INFO L290 TraceCheckUtils]: 61: Hoare triple {21852#true} assume !(0 == ~cond); {21852#true} is VALID [2022-04-28 05:58:20,307 INFO L290 TraceCheckUtils]: 60: Hoare triple {21852#true} ~cond := #in~cond; {21852#true} is VALID [2022-04-28 05:58:20,308 INFO L272 TraceCheckUtils]: 59: Hoare triple {22191#(< ~counter~0 18)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {21852#true} is VALID [2022-04-28 05:58:20,308 INFO L290 TraceCheckUtils]: 58: Hoare triple {22191#(< ~counter~0 18)} assume !!(#t~post7 < 20);havoc #t~post7; {22191#(< ~counter~0 18)} is VALID [2022-04-28 05:58:20,308 INFO L290 TraceCheckUtils]: 57: Hoare triple {22216#(< ~counter~0 17)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22191#(< ~counter~0 18)} is VALID [2022-04-28 05:58:20,309 INFO L290 TraceCheckUtils]: 56: Hoare triple {22216#(< ~counter~0 17)} assume !!(0 != ~r~0); {22216#(< ~counter~0 17)} is VALID [2022-04-28 05:58:20,309 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {21852#true} {22216#(< ~counter~0 17)} #94#return; {22216#(< ~counter~0 17)} is VALID [2022-04-28 05:58:20,309 INFO L290 TraceCheckUtils]: 54: Hoare triple {21852#true} assume true; {21852#true} is VALID [2022-04-28 05:58:20,309 INFO L290 TraceCheckUtils]: 53: Hoare triple {21852#true} assume !(0 == ~cond); {21852#true} is VALID [2022-04-28 05:58:20,309 INFO L290 TraceCheckUtils]: 52: Hoare triple {21852#true} ~cond := #in~cond; {21852#true} is VALID [2022-04-28 05:58:20,309 INFO L272 TraceCheckUtils]: 51: Hoare triple {22216#(< ~counter~0 17)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {21852#true} is VALID [2022-04-28 05:58:20,310 INFO L290 TraceCheckUtils]: 50: Hoare triple {22216#(< ~counter~0 17)} assume !!(#t~post6 < 20);havoc #t~post6; {22216#(< ~counter~0 17)} is VALID [2022-04-28 05:58:20,310 INFO L290 TraceCheckUtils]: 49: Hoare triple {22241#(< ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22216#(< ~counter~0 17)} is VALID [2022-04-28 05:58:20,310 INFO L290 TraceCheckUtils]: 48: Hoare triple {22241#(< ~counter~0 16)} assume !(~r~0 < 0); {22241#(< ~counter~0 16)} is VALID [2022-04-28 05:58:20,311 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {21852#true} {22241#(< ~counter~0 16)} #98#return; {22241#(< ~counter~0 16)} is VALID [2022-04-28 05:58:20,311 INFO L290 TraceCheckUtils]: 46: Hoare triple {21852#true} assume true; {21852#true} is VALID [2022-04-28 05:58:20,311 INFO L290 TraceCheckUtils]: 45: Hoare triple {21852#true} assume !(0 == ~cond); {21852#true} is VALID [2022-04-28 05:58:20,311 INFO L290 TraceCheckUtils]: 44: Hoare triple {21852#true} ~cond := #in~cond; {21852#true} is VALID [2022-04-28 05:58:20,311 INFO L272 TraceCheckUtils]: 43: Hoare triple {22241#(< ~counter~0 16)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {21852#true} is VALID [2022-04-28 05:58:20,311 INFO L290 TraceCheckUtils]: 42: Hoare triple {22241#(< ~counter~0 16)} assume !!(#t~post8 < 20);havoc #t~post8; {22241#(< ~counter~0 16)} is VALID [2022-04-28 05:58:20,312 INFO L290 TraceCheckUtils]: 41: Hoare triple {22266#(< ~counter~0 15)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {22241#(< ~counter~0 16)} is VALID [2022-04-28 05:58:20,312 INFO L290 TraceCheckUtils]: 40: Hoare triple {22266#(< ~counter~0 15)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {22266#(< ~counter~0 15)} is VALID [2022-04-28 05:58:20,313 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {21852#true} {22266#(< ~counter~0 15)} #98#return; {22266#(< ~counter~0 15)} is VALID [2022-04-28 05:58:20,313 INFO L290 TraceCheckUtils]: 38: Hoare triple {21852#true} assume true; {21852#true} is VALID [2022-04-28 05:58:20,313 INFO L290 TraceCheckUtils]: 37: Hoare triple {21852#true} assume !(0 == ~cond); {21852#true} is VALID [2022-04-28 05:58:20,313 INFO L290 TraceCheckUtils]: 36: Hoare triple {21852#true} ~cond := #in~cond; {21852#true} is VALID [2022-04-28 05:58:20,313 INFO L272 TraceCheckUtils]: 35: Hoare triple {22266#(< ~counter~0 15)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {21852#true} is VALID [2022-04-28 05:58:20,313 INFO L290 TraceCheckUtils]: 34: Hoare triple {22266#(< ~counter~0 15)} assume !!(#t~post8 < 20);havoc #t~post8; {22266#(< ~counter~0 15)} is VALID [2022-04-28 05:58:20,314 INFO L290 TraceCheckUtils]: 33: Hoare triple {22291#(< ~counter~0 14)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {22266#(< ~counter~0 15)} is VALID [2022-04-28 05:58:20,314 INFO L290 TraceCheckUtils]: 32: Hoare triple {22291#(< ~counter~0 14)} assume !(~r~0 > 0); {22291#(< ~counter~0 14)} is VALID [2022-04-28 05:58:20,314 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {21852#true} {22291#(< ~counter~0 14)} #96#return; {22291#(< ~counter~0 14)} is VALID [2022-04-28 05:58:20,314 INFO L290 TraceCheckUtils]: 30: Hoare triple {21852#true} assume true; {21852#true} is VALID [2022-04-28 05:58:20,314 INFO L290 TraceCheckUtils]: 29: Hoare triple {21852#true} assume !(0 == ~cond); {21852#true} is VALID [2022-04-28 05:58:20,315 INFO L290 TraceCheckUtils]: 28: Hoare triple {21852#true} ~cond := #in~cond; {21852#true} is VALID [2022-04-28 05:58:20,315 INFO L272 TraceCheckUtils]: 27: Hoare triple {22291#(< ~counter~0 14)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {21852#true} is VALID [2022-04-28 05:58:20,315 INFO L290 TraceCheckUtils]: 26: Hoare triple {22291#(< ~counter~0 14)} assume !!(#t~post7 < 20);havoc #t~post7; {22291#(< ~counter~0 14)} is VALID [2022-04-28 05:58:20,315 INFO L290 TraceCheckUtils]: 25: Hoare triple {22316#(< ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22291#(< ~counter~0 14)} is VALID [2022-04-28 05:58:20,316 INFO L290 TraceCheckUtils]: 24: Hoare triple {22316#(< ~counter~0 13)} assume !!(0 != ~r~0); {22316#(< ~counter~0 13)} is VALID [2022-04-28 05:58:20,316 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {21852#true} {22316#(< ~counter~0 13)} #94#return; {22316#(< ~counter~0 13)} is VALID [2022-04-28 05:58:20,316 INFO L290 TraceCheckUtils]: 22: Hoare triple {21852#true} assume true; {21852#true} is VALID [2022-04-28 05:58:20,316 INFO L290 TraceCheckUtils]: 21: Hoare triple {21852#true} assume !(0 == ~cond); {21852#true} is VALID [2022-04-28 05:58:20,316 INFO L290 TraceCheckUtils]: 20: Hoare triple {21852#true} ~cond := #in~cond; {21852#true} is VALID [2022-04-28 05:58:20,316 INFO L272 TraceCheckUtils]: 19: Hoare triple {22316#(< ~counter~0 13)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {21852#true} is VALID [2022-04-28 05:58:20,317 INFO L290 TraceCheckUtils]: 18: Hoare triple {22316#(< ~counter~0 13)} assume !!(#t~post6 < 20);havoc #t~post6; {22316#(< ~counter~0 13)} is VALID [2022-04-28 05:58:20,317 INFO L290 TraceCheckUtils]: 17: Hoare triple {22341#(< ~counter~0 12)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22316#(< ~counter~0 13)} is VALID [2022-04-28 05:58:20,317 INFO L290 TraceCheckUtils]: 16: Hoare triple {22341#(< ~counter~0 12)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {22341#(< ~counter~0 12)} is VALID [2022-04-28 05:58:20,318 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {21852#true} {22341#(< ~counter~0 12)} #92#return; {22341#(< ~counter~0 12)} is VALID [2022-04-28 05:58:20,318 INFO L290 TraceCheckUtils]: 14: Hoare triple {21852#true} assume true; {21852#true} is VALID [2022-04-28 05:58:20,318 INFO L290 TraceCheckUtils]: 13: Hoare triple {21852#true} assume !(0 == ~cond); {21852#true} is VALID [2022-04-28 05:58:20,318 INFO L290 TraceCheckUtils]: 12: Hoare triple {21852#true} ~cond := #in~cond; {21852#true} is VALID [2022-04-28 05:58:20,318 INFO L272 TraceCheckUtils]: 11: Hoare triple {22341#(< ~counter~0 12)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {21852#true} is VALID [2022-04-28 05:58:20,323 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {21852#true} {22341#(< ~counter~0 12)} #90#return; {22341#(< ~counter~0 12)} is VALID [2022-04-28 05:58:20,323 INFO L290 TraceCheckUtils]: 9: Hoare triple {21852#true} assume true; {21852#true} is VALID [2022-04-28 05:58:20,324 INFO L290 TraceCheckUtils]: 8: Hoare triple {21852#true} assume !(0 == ~cond); {21852#true} is VALID [2022-04-28 05:58:20,324 INFO L290 TraceCheckUtils]: 7: Hoare triple {21852#true} ~cond := #in~cond; {21852#true} is VALID [2022-04-28 05:58:20,324 INFO L272 TraceCheckUtils]: 6: Hoare triple {22341#(< ~counter~0 12)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {21852#true} is VALID [2022-04-28 05:58:20,324 INFO L290 TraceCheckUtils]: 5: Hoare triple {22341#(< ~counter~0 12)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {22341#(< ~counter~0 12)} is VALID [2022-04-28 05:58:20,324 INFO L272 TraceCheckUtils]: 4: Hoare triple {22341#(< ~counter~0 12)} call #t~ret9 := main(); {22341#(< ~counter~0 12)} is VALID [2022-04-28 05:58:20,325 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22341#(< ~counter~0 12)} {21852#true} #102#return; {22341#(< ~counter~0 12)} is VALID [2022-04-28 05:58:20,325 INFO L290 TraceCheckUtils]: 2: Hoare triple {22341#(< ~counter~0 12)} assume true; {22341#(< ~counter~0 12)} is VALID [2022-04-28 05:58:20,326 INFO L290 TraceCheckUtils]: 1: Hoare triple {21852#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {22341#(< ~counter~0 12)} is VALID [2022-04-28 05:58:20,326 INFO L272 TraceCheckUtils]: 0: Hoare triple {21852#true} call ULTIMATE.init(); {21852#true} is VALID [2022-04-28 05:58:20,326 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 16 proven. 32 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2022-04-28 05:58:20,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:58:20,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552427048] [2022-04-28 05:58:20,326 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:58:20,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1211658479] [2022-04-28 05:58:20,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1211658479] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:58:20,327 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:58:20,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2022-04-28 05:58:20,327 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:58:20,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1277210346] [2022-04-28 05:58:20,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1277210346] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:58:20,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:58:20,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 05:58:20,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091768475] [2022-04-28 05:58:20,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:58:20,329 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 11 states have internal predecessors, (60), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) Word has length 87 [2022-04-28 05:58:20,329 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:58:20,329 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 5.0) internal successors, (60), 11 states have internal predecessors, (60), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-28 05:58:20,392 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:58:20,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 05:58:20,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:58:20,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 05:58:20,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=267, Unknown=0, NotChecked=0, Total=462 [2022-04-28 05:58:20,393 INFO L87 Difference]: Start difference. First operand 166 states and 208 transitions. Second operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 11 states have internal predecessors, (60), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-28 05:58:21,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:58:21,169 INFO L93 Difference]: Finished difference Result 188 states and 235 transitions. [2022-04-28 05:58:21,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-28 05:58:21,169 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 11 states have internal predecessors, (60), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) Word has length 87 [2022-04-28 05:58:21,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:58:21,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 11 states have internal predecessors, (60), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-28 05:58:21,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 175 transitions. [2022-04-28 05:58:21,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 11 states have internal predecessors, (60), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-28 05:58:21,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 175 transitions. [2022-04-28 05:58:21,190 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 175 transitions. [2022-04-28 05:58:21,315 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 175 edges. 175 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:58:21,318 INFO L225 Difference]: With dead ends: 188 [2022-04-28 05:58:21,318 INFO L226 Difference]: Without dead ends: 183 [2022-04-28 05:58:21,319 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=288, Invalid=414, Unknown=0, NotChecked=0, Total=702 [2022-04-28 05:58:21,319 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 83 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 05:58:21,319 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 256 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 05:58:21,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-04-28 05:58:21,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 177. [2022-04-28 05:58:21,522 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:58:21,522 INFO L82 GeneralOperation]: Start isEquivalent. First operand 183 states. Second operand has 177 states, 129 states have (on average 1.186046511627907) internal successors, (153), 132 states have internal predecessors, (153), 36 states have call successors, (36), 13 states have call predecessors, (36), 11 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2022-04-28 05:58:21,522 INFO L74 IsIncluded]: Start isIncluded. First operand 183 states. Second operand has 177 states, 129 states have (on average 1.186046511627907) internal successors, (153), 132 states have internal predecessors, (153), 36 states have call successors, (36), 13 states have call predecessors, (36), 11 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2022-04-28 05:58:21,522 INFO L87 Difference]: Start difference. First operand 183 states. Second operand has 177 states, 129 states have (on average 1.186046511627907) internal successors, (153), 132 states have internal predecessors, (153), 36 states have call successors, (36), 13 states have call predecessors, (36), 11 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2022-04-28 05:58:21,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:58:21,526 INFO L93 Difference]: Finished difference Result 183 states and 230 transitions. [2022-04-28 05:58:21,526 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 230 transitions. [2022-04-28 05:58:21,526 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:58:21,526 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:58:21,527 INFO L74 IsIncluded]: Start isIncluded. First operand has 177 states, 129 states have (on average 1.186046511627907) internal successors, (153), 132 states have internal predecessors, (153), 36 states have call successors, (36), 13 states have call predecessors, (36), 11 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) Second operand 183 states. [2022-04-28 05:58:21,527 INFO L87 Difference]: Start difference. First operand has 177 states, 129 states have (on average 1.186046511627907) internal successors, (153), 132 states have internal predecessors, (153), 36 states have call successors, (36), 13 states have call predecessors, (36), 11 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) Second operand 183 states. [2022-04-28 05:58:21,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:58:21,530 INFO L93 Difference]: Finished difference Result 183 states and 230 transitions. [2022-04-28 05:58:21,531 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 230 transitions. [2022-04-28 05:58:21,531 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:58:21,531 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:58:21,531 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:58:21,531 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:58:21,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 129 states have (on average 1.186046511627907) internal successors, (153), 132 states have internal predecessors, (153), 36 states have call successors, (36), 13 states have call predecessors, (36), 11 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2022-04-28 05:58:21,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 223 transitions. [2022-04-28 05:58:21,535 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 223 transitions. Word has length 87 [2022-04-28 05:58:21,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:58:21,535 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 223 transitions. [2022-04-28 05:58:21,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 11 states have internal predecessors, (60), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-28 05:58:21,536 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 177 states and 223 transitions. [2022-04-28 05:58:22,070 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 223 edges. 223 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:58:22,070 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 223 transitions. [2022-04-28 05:58:22,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-04-28 05:58:22,070 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:58:22,071 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:58:22,086 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2022-04-28 05:58:22,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:58:22,271 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:58:22,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:58:22,271 INFO L85 PathProgramCache]: Analyzing trace with hash 2133755932, now seen corresponding path program 3 times [2022-04-28 05:58:22,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:58:22,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [29442747] [2022-04-28 05:58:22,272 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:58:22,272 INFO L85 PathProgramCache]: Analyzing trace with hash 2133755932, now seen corresponding path program 4 times [2022-04-28 05:58:22,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:58:22,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455034592] [2022-04-28 05:58:22,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:58:22,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:58:22,282 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:58:22,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1583825937] [2022-04-28 05:58:22,283 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 05:58:22,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:58:22,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:58:22,284 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:58:22,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-04-28 05:58:22,337 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 05:58:22,337 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:58:22,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-28 05:58:22,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:58:22,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:58:22,567 INFO L272 TraceCheckUtils]: 0: Hoare triple {23501#true} call ULTIMATE.init(); {23501#true} is VALID [2022-04-28 05:58:22,567 INFO L290 TraceCheckUtils]: 1: Hoare triple {23501#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {23501#true} is VALID [2022-04-28 05:58:22,567 INFO L290 TraceCheckUtils]: 2: Hoare triple {23501#true} assume true; {23501#true} is VALID [2022-04-28 05:58:22,567 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23501#true} {23501#true} #102#return; {23501#true} is VALID [2022-04-28 05:58:22,567 INFO L272 TraceCheckUtils]: 4: Hoare triple {23501#true} call #t~ret9 := main(); {23501#true} is VALID [2022-04-28 05:58:22,567 INFO L290 TraceCheckUtils]: 5: Hoare triple {23501#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {23501#true} is VALID [2022-04-28 05:58:22,567 INFO L272 TraceCheckUtils]: 6: Hoare triple {23501#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {23501#true} is VALID [2022-04-28 05:58:22,567 INFO L290 TraceCheckUtils]: 7: Hoare triple {23501#true} ~cond := #in~cond; {23501#true} is VALID [2022-04-28 05:58:22,567 INFO L290 TraceCheckUtils]: 8: Hoare triple {23501#true} assume !(0 == ~cond); {23501#true} is VALID [2022-04-28 05:58:22,567 INFO L290 TraceCheckUtils]: 9: Hoare triple {23501#true} assume true; {23501#true} is VALID [2022-04-28 05:58:22,568 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {23501#true} {23501#true} #90#return; {23501#true} is VALID [2022-04-28 05:58:22,568 INFO L272 TraceCheckUtils]: 11: Hoare triple {23501#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {23501#true} is VALID [2022-04-28 05:58:22,568 INFO L290 TraceCheckUtils]: 12: Hoare triple {23501#true} ~cond := #in~cond; {23501#true} is VALID [2022-04-28 05:58:22,568 INFO L290 TraceCheckUtils]: 13: Hoare triple {23501#true} assume !(0 == ~cond); {23501#true} is VALID [2022-04-28 05:58:22,568 INFO L290 TraceCheckUtils]: 14: Hoare triple {23501#true} assume true; {23501#true} is VALID [2022-04-28 05:58:22,568 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {23501#true} {23501#true} #92#return; {23501#true} is VALID [2022-04-28 05:58:22,568 INFO L290 TraceCheckUtils]: 16: Hoare triple {23501#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {23554#(<= main_~v~0 1)} is VALID [2022-04-28 05:58:22,568 INFO L290 TraceCheckUtils]: 17: Hoare triple {23554#(<= main_~v~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23554#(<= main_~v~0 1)} is VALID [2022-04-28 05:58:22,569 INFO L290 TraceCheckUtils]: 18: Hoare triple {23554#(<= main_~v~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {23554#(<= main_~v~0 1)} is VALID [2022-04-28 05:58:22,569 INFO L272 TraceCheckUtils]: 19: Hoare triple {23554#(<= main_~v~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {23501#true} is VALID [2022-04-28 05:58:22,569 INFO L290 TraceCheckUtils]: 20: Hoare triple {23501#true} ~cond := #in~cond; {23501#true} is VALID [2022-04-28 05:58:22,569 INFO L290 TraceCheckUtils]: 21: Hoare triple {23501#true} assume !(0 == ~cond); {23501#true} is VALID [2022-04-28 05:58:22,569 INFO L290 TraceCheckUtils]: 22: Hoare triple {23501#true} assume true; {23501#true} is VALID [2022-04-28 05:58:22,569 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {23501#true} {23554#(<= main_~v~0 1)} #94#return; {23554#(<= main_~v~0 1)} is VALID [2022-04-28 05:58:22,570 INFO L290 TraceCheckUtils]: 24: Hoare triple {23554#(<= main_~v~0 1)} assume !!(0 != ~r~0); {23554#(<= main_~v~0 1)} is VALID [2022-04-28 05:58:22,570 INFO L290 TraceCheckUtils]: 25: Hoare triple {23554#(<= main_~v~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23554#(<= main_~v~0 1)} is VALID [2022-04-28 05:58:22,570 INFO L290 TraceCheckUtils]: 26: Hoare triple {23554#(<= main_~v~0 1)} assume !!(#t~post7 < 20);havoc #t~post7; {23554#(<= main_~v~0 1)} is VALID [2022-04-28 05:58:22,570 INFO L272 TraceCheckUtils]: 27: Hoare triple {23554#(<= main_~v~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {23501#true} is VALID [2022-04-28 05:58:22,570 INFO L290 TraceCheckUtils]: 28: Hoare triple {23501#true} ~cond := #in~cond; {23501#true} is VALID [2022-04-28 05:58:22,570 INFO L290 TraceCheckUtils]: 29: Hoare triple {23501#true} assume !(0 == ~cond); {23501#true} is VALID [2022-04-28 05:58:22,570 INFO L290 TraceCheckUtils]: 30: Hoare triple {23501#true} assume true; {23501#true} is VALID [2022-04-28 05:58:22,571 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {23501#true} {23554#(<= main_~v~0 1)} #96#return; {23554#(<= main_~v~0 1)} is VALID [2022-04-28 05:58:22,571 INFO L290 TraceCheckUtils]: 32: Hoare triple {23554#(<= main_~v~0 1)} assume !(~r~0 > 0); {23554#(<= main_~v~0 1)} is VALID [2022-04-28 05:58:22,571 INFO L290 TraceCheckUtils]: 33: Hoare triple {23554#(<= main_~v~0 1)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {23554#(<= main_~v~0 1)} is VALID [2022-04-28 05:58:22,572 INFO L290 TraceCheckUtils]: 34: Hoare triple {23554#(<= main_~v~0 1)} assume !!(#t~post8 < 20);havoc #t~post8; {23554#(<= main_~v~0 1)} is VALID [2022-04-28 05:58:22,572 INFO L272 TraceCheckUtils]: 35: Hoare triple {23554#(<= main_~v~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {23501#true} is VALID [2022-04-28 05:58:22,572 INFO L290 TraceCheckUtils]: 36: Hoare triple {23501#true} ~cond := #in~cond; {23501#true} is VALID [2022-04-28 05:58:22,572 INFO L290 TraceCheckUtils]: 37: Hoare triple {23501#true} assume !(0 == ~cond); {23501#true} is VALID [2022-04-28 05:58:22,572 INFO L290 TraceCheckUtils]: 38: Hoare triple {23501#true} assume true; {23501#true} is VALID [2022-04-28 05:58:22,572 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {23501#true} {23554#(<= main_~v~0 1)} #98#return; {23554#(<= main_~v~0 1)} is VALID [2022-04-28 05:58:22,572 INFO L290 TraceCheckUtils]: 40: Hoare triple {23554#(<= main_~v~0 1)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {23554#(<= main_~v~0 1)} is VALID [2022-04-28 05:58:22,573 INFO L290 TraceCheckUtils]: 41: Hoare triple {23554#(<= main_~v~0 1)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {23554#(<= main_~v~0 1)} is VALID [2022-04-28 05:58:22,573 INFO L290 TraceCheckUtils]: 42: Hoare triple {23554#(<= main_~v~0 1)} assume !!(#t~post8 < 20);havoc #t~post8; {23554#(<= main_~v~0 1)} is VALID [2022-04-28 05:58:22,573 INFO L272 TraceCheckUtils]: 43: Hoare triple {23554#(<= main_~v~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {23501#true} is VALID [2022-04-28 05:58:22,573 INFO L290 TraceCheckUtils]: 44: Hoare triple {23501#true} ~cond := #in~cond; {23501#true} is VALID [2022-04-28 05:58:22,573 INFO L290 TraceCheckUtils]: 45: Hoare triple {23501#true} assume !(0 == ~cond); {23501#true} is VALID [2022-04-28 05:58:22,573 INFO L290 TraceCheckUtils]: 46: Hoare triple {23501#true} assume true; {23501#true} is VALID [2022-04-28 05:58:22,574 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {23501#true} {23554#(<= main_~v~0 1)} #98#return; {23554#(<= main_~v~0 1)} is VALID [2022-04-28 05:58:22,574 INFO L290 TraceCheckUtils]: 48: Hoare triple {23554#(<= main_~v~0 1)} assume !(~r~0 < 0); {23554#(<= main_~v~0 1)} is VALID [2022-04-28 05:58:22,574 INFO L290 TraceCheckUtils]: 49: Hoare triple {23554#(<= main_~v~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23554#(<= main_~v~0 1)} is VALID [2022-04-28 05:58:22,574 INFO L290 TraceCheckUtils]: 50: Hoare triple {23554#(<= main_~v~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {23554#(<= main_~v~0 1)} is VALID [2022-04-28 05:58:22,574 INFO L272 TraceCheckUtils]: 51: Hoare triple {23554#(<= main_~v~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {23501#true} is VALID [2022-04-28 05:58:22,575 INFO L290 TraceCheckUtils]: 52: Hoare triple {23501#true} ~cond := #in~cond; {23501#true} is VALID [2022-04-28 05:58:22,575 INFO L290 TraceCheckUtils]: 53: Hoare triple {23501#true} assume !(0 == ~cond); {23501#true} is VALID [2022-04-28 05:58:22,575 INFO L290 TraceCheckUtils]: 54: Hoare triple {23501#true} assume true; {23501#true} is VALID [2022-04-28 05:58:22,575 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {23501#true} {23554#(<= main_~v~0 1)} #94#return; {23554#(<= main_~v~0 1)} is VALID [2022-04-28 05:58:22,575 INFO L290 TraceCheckUtils]: 56: Hoare triple {23554#(<= main_~v~0 1)} assume !!(0 != ~r~0); {23554#(<= main_~v~0 1)} is VALID [2022-04-28 05:58:22,576 INFO L290 TraceCheckUtils]: 57: Hoare triple {23554#(<= main_~v~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23554#(<= main_~v~0 1)} is VALID [2022-04-28 05:58:22,576 INFO L290 TraceCheckUtils]: 58: Hoare triple {23554#(<= main_~v~0 1)} assume !!(#t~post7 < 20);havoc #t~post7; {23554#(<= main_~v~0 1)} is VALID [2022-04-28 05:58:22,576 INFO L272 TraceCheckUtils]: 59: Hoare triple {23554#(<= main_~v~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {23501#true} is VALID [2022-04-28 05:58:22,576 INFO L290 TraceCheckUtils]: 60: Hoare triple {23501#true} ~cond := #in~cond; {23501#true} is VALID [2022-04-28 05:58:22,576 INFO L290 TraceCheckUtils]: 61: Hoare triple {23501#true} assume !(0 == ~cond); {23501#true} is VALID [2022-04-28 05:58:22,576 INFO L290 TraceCheckUtils]: 62: Hoare triple {23501#true} assume true; {23501#true} is VALID [2022-04-28 05:58:22,576 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {23501#true} {23554#(<= main_~v~0 1)} #96#return; {23554#(<= main_~v~0 1)} is VALID [2022-04-28 05:58:22,577 INFO L290 TraceCheckUtils]: 64: Hoare triple {23554#(<= main_~v~0 1)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {23699#(< 0 (+ main_~r~0 1))} is VALID [2022-04-28 05:58:22,577 INFO L290 TraceCheckUtils]: 65: Hoare triple {23699#(< 0 (+ main_~r~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23699#(< 0 (+ main_~r~0 1))} is VALID [2022-04-28 05:58:22,578 INFO L290 TraceCheckUtils]: 66: Hoare triple {23699#(< 0 (+ main_~r~0 1))} assume !!(#t~post7 < 20);havoc #t~post7; {23699#(< 0 (+ main_~r~0 1))} is VALID [2022-04-28 05:58:22,578 INFO L272 TraceCheckUtils]: 67: Hoare triple {23699#(< 0 (+ main_~r~0 1))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {23501#true} is VALID [2022-04-28 05:58:22,578 INFO L290 TraceCheckUtils]: 68: Hoare triple {23501#true} ~cond := #in~cond; {23501#true} is VALID [2022-04-28 05:58:22,578 INFO L290 TraceCheckUtils]: 69: Hoare triple {23501#true} assume !(0 == ~cond); {23501#true} is VALID [2022-04-28 05:58:22,578 INFO L290 TraceCheckUtils]: 70: Hoare triple {23501#true} assume true; {23501#true} is VALID [2022-04-28 05:58:22,578 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {23501#true} {23699#(< 0 (+ main_~r~0 1))} #96#return; {23699#(< 0 (+ main_~r~0 1))} is VALID [2022-04-28 05:58:22,579 INFO L290 TraceCheckUtils]: 72: Hoare triple {23699#(< 0 (+ main_~r~0 1))} assume !(~r~0 > 0); {23699#(< 0 (+ main_~r~0 1))} is VALID [2022-04-28 05:58:22,579 INFO L290 TraceCheckUtils]: 73: Hoare triple {23699#(< 0 (+ main_~r~0 1))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {23699#(< 0 (+ main_~r~0 1))} is VALID [2022-04-28 05:58:22,579 INFO L290 TraceCheckUtils]: 74: Hoare triple {23699#(< 0 (+ main_~r~0 1))} assume !!(#t~post8 < 20);havoc #t~post8; {23699#(< 0 (+ main_~r~0 1))} is VALID [2022-04-28 05:58:22,579 INFO L272 TraceCheckUtils]: 75: Hoare triple {23699#(< 0 (+ main_~r~0 1))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {23501#true} is VALID [2022-04-28 05:58:22,579 INFO L290 TraceCheckUtils]: 76: Hoare triple {23501#true} ~cond := #in~cond; {23501#true} is VALID [2022-04-28 05:58:22,579 INFO L290 TraceCheckUtils]: 77: Hoare triple {23501#true} assume !(0 == ~cond); {23501#true} is VALID [2022-04-28 05:58:22,579 INFO L290 TraceCheckUtils]: 78: Hoare triple {23501#true} assume true; {23501#true} is VALID [2022-04-28 05:58:22,580 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {23501#true} {23699#(< 0 (+ main_~r~0 1))} #98#return; {23699#(< 0 (+ main_~r~0 1))} is VALID [2022-04-28 05:58:22,580 INFO L290 TraceCheckUtils]: 80: Hoare triple {23699#(< 0 (+ main_~r~0 1))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {23502#false} is VALID [2022-04-28 05:58:22,581 INFO L290 TraceCheckUtils]: 81: Hoare triple {23502#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {23502#false} is VALID [2022-04-28 05:58:22,581 INFO L290 TraceCheckUtils]: 82: Hoare triple {23502#false} assume !(#t~post8 < 20);havoc #t~post8; {23502#false} is VALID [2022-04-28 05:58:22,581 INFO L290 TraceCheckUtils]: 83: Hoare triple {23502#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23502#false} is VALID [2022-04-28 05:58:22,581 INFO L290 TraceCheckUtils]: 84: Hoare triple {23502#false} assume !(#t~post6 < 20);havoc #t~post6; {23502#false} is VALID [2022-04-28 05:58:22,581 INFO L272 TraceCheckUtils]: 85: Hoare triple {23502#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {23502#false} is VALID [2022-04-28 05:58:22,581 INFO L290 TraceCheckUtils]: 86: Hoare triple {23502#false} ~cond := #in~cond; {23502#false} is VALID [2022-04-28 05:58:22,581 INFO L290 TraceCheckUtils]: 87: Hoare triple {23502#false} assume 0 == ~cond; {23502#false} is VALID [2022-04-28 05:58:22,581 INFO L290 TraceCheckUtils]: 88: Hoare triple {23502#false} assume !false; {23502#false} is VALID [2022-04-28 05:58:22,581 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 26 proven. 16 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2022-04-28 05:58:22,581 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:58:22,837 INFO L290 TraceCheckUtils]: 88: Hoare triple {23502#false} assume !false; {23502#false} is VALID [2022-04-28 05:58:22,837 INFO L290 TraceCheckUtils]: 87: Hoare triple {23502#false} assume 0 == ~cond; {23502#false} is VALID [2022-04-28 05:58:22,837 INFO L290 TraceCheckUtils]: 86: Hoare triple {23502#false} ~cond := #in~cond; {23502#false} is VALID [2022-04-28 05:58:22,837 INFO L272 TraceCheckUtils]: 85: Hoare triple {23502#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {23502#false} is VALID [2022-04-28 05:58:22,838 INFO L290 TraceCheckUtils]: 84: Hoare triple {23502#false} assume !(#t~post6 < 20);havoc #t~post6; {23502#false} is VALID [2022-04-28 05:58:22,838 INFO L290 TraceCheckUtils]: 83: Hoare triple {23502#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23502#false} is VALID [2022-04-28 05:58:22,838 INFO L290 TraceCheckUtils]: 82: Hoare triple {23502#false} assume !(#t~post8 < 20);havoc #t~post8; {23502#false} is VALID [2022-04-28 05:58:22,838 INFO L290 TraceCheckUtils]: 81: Hoare triple {23502#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {23502#false} is VALID [2022-04-28 05:58:22,839 INFO L290 TraceCheckUtils]: 80: Hoare triple {23699#(< 0 (+ main_~r~0 1))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {23502#false} is VALID [2022-04-28 05:58:22,839 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {23501#true} {23699#(< 0 (+ main_~r~0 1))} #98#return; {23699#(< 0 (+ main_~r~0 1))} is VALID [2022-04-28 05:58:22,839 INFO L290 TraceCheckUtils]: 78: Hoare triple {23501#true} assume true; {23501#true} is VALID [2022-04-28 05:58:22,839 INFO L290 TraceCheckUtils]: 77: Hoare triple {23501#true} assume !(0 == ~cond); {23501#true} is VALID [2022-04-28 05:58:22,839 INFO L290 TraceCheckUtils]: 76: Hoare triple {23501#true} ~cond := #in~cond; {23501#true} is VALID [2022-04-28 05:58:22,839 INFO L272 TraceCheckUtils]: 75: Hoare triple {23699#(< 0 (+ main_~r~0 1))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {23501#true} is VALID [2022-04-28 05:58:22,840 INFO L290 TraceCheckUtils]: 74: Hoare triple {23699#(< 0 (+ main_~r~0 1))} assume !!(#t~post8 < 20);havoc #t~post8; {23699#(< 0 (+ main_~r~0 1))} is VALID [2022-04-28 05:58:22,840 INFO L290 TraceCheckUtils]: 73: Hoare triple {23699#(< 0 (+ main_~r~0 1))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {23699#(< 0 (+ main_~r~0 1))} is VALID [2022-04-28 05:58:22,840 INFO L290 TraceCheckUtils]: 72: Hoare triple {23699#(< 0 (+ main_~r~0 1))} assume !(~r~0 > 0); {23699#(< 0 (+ main_~r~0 1))} is VALID [2022-04-28 05:58:22,841 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {23501#true} {23699#(< 0 (+ main_~r~0 1))} #96#return; {23699#(< 0 (+ main_~r~0 1))} is VALID [2022-04-28 05:58:22,841 INFO L290 TraceCheckUtils]: 70: Hoare triple {23501#true} assume true; {23501#true} is VALID [2022-04-28 05:58:22,841 INFO L290 TraceCheckUtils]: 69: Hoare triple {23501#true} assume !(0 == ~cond); {23501#true} is VALID [2022-04-28 05:58:22,841 INFO L290 TraceCheckUtils]: 68: Hoare triple {23501#true} ~cond := #in~cond; {23501#true} is VALID [2022-04-28 05:58:22,841 INFO L272 TraceCheckUtils]: 67: Hoare triple {23699#(< 0 (+ main_~r~0 1))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {23501#true} is VALID [2022-04-28 05:58:22,841 INFO L290 TraceCheckUtils]: 66: Hoare triple {23699#(< 0 (+ main_~r~0 1))} assume !!(#t~post7 < 20);havoc #t~post7; {23699#(< 0 (+ main_~r~0 1))} is VALID [2022-04-28 05:58:22,841 INFO L290 TraceCheckUtils]: 65: Hoare triple {23699#(< 0 (+ main_~r~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23699#(< 0 (+ main_~r~0 1))} is VALID [2022-04-28 05:58:22,842 INFO L290 TraceCheckUtils]: 64: Hoare triple {23554#(<= main_~v~0 1)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {23699#(< 0 (+ main_~r~0 1))} is VALID [2022-04-28 05:58:22,842 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {23501#true} {23554#(<= main_~v~0 1)} #96#return; {23554#(<= main_~v~0 1)} is VALID [2022-04-28 05:58:22,842 INFO L290 TraceCheckUtils]: 62: Hoare triple {23501#true} assume true; {23501#true} is VALID [2022-04-28 05:58:22,843 INFO L290 TraceCheckUtils]: 61: Hoare triple {23501#true} assume !(0 == ~cond); {23501#true} is VALID [2022-04-28 05:58:22,843 INFO L290 TraceCheckUtils]: 60: Hoare triple {23501#true} ~cond := #in~cond; {23501#true} is VALID [2022-04-28 05:58:22,843 INFO L272 TraceCheckUtils]: 59: Hoare triple {23554#(<= main_~v~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {23501#true} is VALID [2022-04-28 05:58:22,847 INFO L290 TraceCheckUtils]: 58: Hoare triple {23554#(<= main_~v~0 1)} assume !!(#t~post7 < 20);havoc #t~post7; {23554#(<= main_~v~0 1)} is VALID [2022-04-28 05:58:22,847 INFO L290 TraceCheckUtils]: 57: Hoare triple {23554#(<= main_~v~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23554#(<= main_~v~0 1)} is VALID [2022-04-28 05:58:22,848 INFO L290 TraceCheckUtils]: 56: Hoare triple {23554#(<= main_~v~0 1)} assume !!(0 != ~r~0); {23554#(<= main_~v~0 1)} is VALID [2022-04-28 05:58:22,848 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {23501#true} {23554#(<= main_~v~0 1)} #94#return; {23554#(<= main_~v~0 1)} is VALID [2022-04-28 05:58:22,848 INFO L290 TraceCheckUtils]: 54: Hoare triple {23501#true} assume true; {23501#true} is VALID [2022-04-28 05:58:22,849 INFO L290 TraceCheckUtils]: 53: Hoare triple {23501#true} assume !(0 == ~cond); {23501#true} is VALID [2022-04-28 05:58:22,849 INFO L290 TraceCheckUtils]: 52: Hoare triple {23501#true} ~cond := #in~cond; {23501#true} is VALID [2022-04-28 05:58:22,849 INFO L272 TraceCheckUtils]: 51: Hoare triple {23554#(<= main_~v~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {23501#true} is VALID [2022-04-28 05:58:22,849 INFO L290 TraceCheckUtils]: 50: Hoare triple {23554#(<= main_~v~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {23554#(<= main_~v~0 1)} is VALID [2022-04-28 05:58:22,849 INFO L290 TraceCheckUtils]: 49: Hoare triple {23554#(<= main_~v~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23554#(<= main_~v~0 1)} is VALID [2022-04-28 05:58:22,850 INFO L290 TraceCheckUtils]: 48: Hoare triple {23554#(<= main_~v~0 1)} assume !(~r~0 < 0); {23554#(<= main_~v~0 1)} is VALID [2022-04-28 05:58:22,850 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {23501#true} {23554#(<= main_~v~0 1)} #98#return; {23554#(<= main_~v~0 1)} is VALID [2022-04-28 05:58:22,850 INFO L290 TraceCheckUtils]: 46: Hoare triple {23501#true} assume true; {23501#true} is VALID [2022-04-28 05:58:22,851 INFO L290 TraceCheckUtils]: 45: Hoare triple {23501#true} assume !(0 == ~cond); {23501#true} is VALID [2022-04-28 05:58:22,851 INFO L290 TraceCheckUtils]: 44: Hoare triple {23501#true} ~cond := #in~cond; {23501#true} is VALID [2022-04-28 05:58:22,851 INFO L272 TraceCheckUtils]: 43: Hoare triple {23554#(<= main_~v~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {23501#true} is VALID [2022-04-28 05:58:22,851 INFO L290 TraceCheckUtils]: 42: Hoare triple {23554#(<= main_~v~0 1)} assume !!(#t~post8 < 20);havoc #t~post8; {23554#(<= main_~v~0 1)} is VALID [2022-04-28 05:58:22,851 INFO L290 TraceCheckUtils]: 41: Hoare triple {23554#(<= main_~v~0 1)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {23554#(<= main_~v~0 1)} is VALID [2022-04-28 05:58:22,852 INFO L290 TraceCheckUtils]: 40: Hoare triple {23554#(<= main_~v~0 1)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {23554#(<= main_~v~0 1)} is VALID [2022-04-28 05:58:22,852 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {23501#true} {23554#(<= main_~v~0 1)} #98#return; {23554#(<= main_~v~0 1)} is VALID [2022-04-28 05:58:22,852 INFO L290 TraceCheckUtils]: 38: Hoare triple {23501#true} assume true; {23501#true} is VALID [2022-04-28 05:58:22,852 INFO L290 TraceCheckUtils]: 37: Hoare triple {23501#true} assume !(0 == ~cond); {23501#true} is VALID [2022-04-28 05:58:22,853 INFO L290 TraceCheckUtils]: 36: Hoare triple {23501#true} ~cond := #in~cond; {23501#true} is VALID [2022-04-28 05:58:22,853 INFO L272 TraceCheckUtils]: 35: Hoare triple {23554#(<= main_~v~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {23501#true} is VALID [2022-04-28 05:58:22,853 INFO L290 TraceCheckUtils]: 34: Hoare triple {23554#(<= main_~v~0 1)} assume !!(#t~post8 < 20);havoc #t~post8; {23554#(<= main_~v~0 1)} is VALID [2022-04-28 05:58:22,853 INFO L290 TraceCheckUtils]: 33: Hoare triple {23554#(<= main_~v~0 1)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {23554#(<= main_~v~0 1)} is VALID [2022-04-28 05:58:22,854 INFO L290 TraceCheckUtils]: 32: Hoare triple {23554#(<= main_~v~0 1)} assume !(~r~0 > 0); {23554#(<= main_~v~0 1)} is VALID [2022-04-28 05:58:22,854 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {23501#true} {23554#(<= main_~v~0 1)} #96#return; {23554#(<= main_~v~0 1)} is VALID [2022-04-28 05:58:22,854 INFO L290 TraceCheckUtils]: 30: Hoare triple {23501#true} assume true; {23501#true} is VALID [2022-04-28 05:58:22,854 INFO L290 TraceCheckUtils]: 29: Hoare triple {23501#true} assume !(0 == ~cond); {23501#true} is VALID [2022-04-28 05:58:22,855 INFO L290 TraceCheckUtils]: 28: Hoare triple {23501#true} ~cond := #in~cond; {23501#true} is VALID [2022-04-28 05:58:22,855 INFO L272 TraceCheckUtils]: 27: Hoare triple {23554#(<= main_~v~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {23501#true} is VALID [2022-04-28 05:58:22,855 INFO L290 TraceCheckUtils]: 26: Hoare triple {23554#(<= main_~v~0 1)} assume !!(#t~post7 < 20);havoc #t~post7; {23554#(<= main_~v~0 1)} is VALID [2022-04-28 05:58:22,855 INFO L290 TraceCheckUtils]: 25: Hoare triple {23554#(<= main_~v~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23554#(<= main_~v~0 1)} is VALID [2022-04-28 05:58:22,856 INFO L290 TraceCheckUtils]: 24: Hoare triple {23554#(<= main_~v~0 1)} assume !!(0 != ~r~0); {23554#(<= main_~v~0 1)} is VALID [2022-04-28 05:58:22,856 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {23501#true} {23554#(<= main_~v~0 1)} #94#return; {23554#(<= main_~v~0 1)} is VALID [2022-04-28 05:58:22,856 INFO L290 TraceCheckUtils]: 22: Hoare triple {23501#true} assume true; {23501#true} is VALID [2022-04-28 05:58:22,856 INFO L290 TraceCheckUtils]: 21: Hoare triple {23501#true} assume !(0 == ~cond); {23501#true} is VALID [2022-04-28 05:58:22,857 INFO L290 TraceCheckUtils]: 20: Hoare triple {23501#true} ~cond := #in~cond; {23501#true} is VALID [2022-04-28 05:58:22,857 INFO L272 TraceCheckUtils]: 19: Hoare triple {23554#(<= main_~v~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {23501#true} is VALID [2022-04-28 05:58:22,857 INFO L290 TraceCheckUtils]: 18: Hoare triple {23554#(<= main_~v~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {23554#(<= main_~v~0 1)} is VALID [2022-04-28 05:58:22,857 INFO L290 TraceCheckUtils]: 17: Hoare triple {23554#(<= main_~v~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23554#(<= main_~v~0 1)} is VALID [2022-04-28 05:58:22,858 INFO L290 TraceCheckUtils]: 16: Hoare triple {23501#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {23554#(<= main_~v~0 1)} is VALID [2022-04-28 05:58:22,858 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {23501#true} {23501#true} #92#return; {23501#true} is VALID [2022-04-28 05:58:22,858 INFO L290 TraceCheckUtils]: 14: Hoare triple {23501#true} assume true; {23501#true} is VALID [2022-04-28 05:58:22,858 INFO L290 TraceCheckUtils]: 13: Hoare triple {23501#true} assume !(0 == ~cond); {23501#true} is VALID [2022-04-28 05:58:22,858 INFO L290 TraceCheckUtils]: 12: Hoare triple {23501#true} ~cond := #in~cond; {23501#true} is VALID [2022-04-28 05:58:22,858 INFO L272 TraceCheckUtils]: 11: Hoare triple {23501#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {23501#true} is VALID [2022-04-28 05:58:22,858 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {23501#true} {23501#true} #90#return; {23501#true} is VALID [2022-04-28 05:58:22,858 INFO L290 TraceCheckUtils]: 9: Hoare triple {23501#true} assume true; {23501#true} is VALID [2022-04-28 05:58:22,858 INFO L290 TraceCheckUtils]: 8: Hoare triple {23501#true} assume !(0 == ~cond); {23501#true} is VALID [2022-04-28 05:58:22,858 INFO L290 TraceCheckUtils]: 7: Hoare triple {23501#true} ~cond := #in~cond; {23501#true} is VALID [2022-04-28 05:58:22,859 INFO L272 TraceCheckUtils]: 6: Hoare triple {23501#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {23501#true} is VALID [2022-04-28 05:58:22,859 INFO L290 TraceCheckUtils]: 5: Hoare triple {23501#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {23501#true} is VALID [2022-04-28 05:58:22,859 INFO L272 TraceCheckUtils]: 4: Hoare triple {23501#true} call #t~ret9 := main(); {23501#true} is VALID [2022-04-28 05:58:22,859 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23501#true} {23501#true} #102#return; {23501#true} is VALID [2022-04-28 05:58:22,859 INFO L290 TraceCheckUtils]: 2: Hoare triple {23501#true} assume true; {23501#true} is VALID [2022-04-28 05:58:22,859 INFO L290 TraceCheckUtils]: 1: Hoare triple {23501#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {23501#true} is VALID [2022-04-28 05:58:22,859 INFO L272 TraceCheckUtils]: 0: Hoare triple {23501#true} call ULTIMATE.init(); {23501#true} is VALID [2022-04-28 05:58:22,859 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 26 proven. 16 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2022-04-28 05:58:22,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:58:22,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455034592] [2022-04-28 05:58:22,860 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:58:22,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1583825937] [2022-04-28 05:58:22,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1583825937] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:58:22,860 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:58:22,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2022-04-28 05:58:22,860 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:58:22,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [29442747] [2022-04-28 05:58:22,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [29442747] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:58:22,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:58:22,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 05:58:22,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233555098] [2022-04-28 05:58:22,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:58:22,861 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 89 [2022-04-28 05:58:22,861 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:58:22,861 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 05:58:22,901 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:58:22,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 05:58:22,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:58:22,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 05:58:22,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 05:58:22,901 INFO L87 Difference]: Start difference. First operand 177 states and 223 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 05:58:23,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:58:23,590 INFO L93 Difference]: Finished difference Result 407 states and 543 transitions. [2022-04-28 05:58:23,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 05:58:23,590 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 89 [2022-04-28 05:58:23,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:58:23,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 05:58:23,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 127 transitions. [2022-04-28 05:58:23,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 05:58:23,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 127 transitions. [2022-04-28 05:58:23,592 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 127 transitions. [2022-04-28 05:58:23,689 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:58:23,697 INFO L225 Difference]: With dead ends: 407 [2022-04-28 05:58:23,698 INFO L226 Difference]: Without dead ends: 301 [2022-04-28 05:58:23,698 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 174 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 05:58:23,699 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 15 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 05:58:23,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 138 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 05:58:23,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2022-04-28 05:58:24,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 296. [2022-04-28 05:58:24,131 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:58:24,131 INFO L82 GeneralOperation]: Start isEquivalent. First operand 301 states. Second operand has 296 states, 219 states have (on average 1.2191780821917808) internal successors, (267), 225 states have internal predecessors, (267), 65 states have call successors, (65), 13 states have call predecessors, (65), 11 states have return successors, (63), 57 states have call predecessors, (63), 63 states have call successors, (63) [2022-04-28 05:58:24,132 INFO L74 IsIncluded]: Start isIncluded. First operand 301 states. Second operand has 296 states, 219 states have (on average 1.2191780821917808) internal successors, (267), 225 states have internal predecessors, (267), 65 states have call successors, (65), 13 states have call predecessors, (65), 11 states have return successors, (63), 57 states have call predecessors, (63), 63 states have call successors, (63) [2022-04-28 05:58:24,132 INFO L87 Difference]: Start difference. First operand 301 states. Second operand has 296 states, 219 states have (on average 1.2191780821917808) internal successors, (267), 225 states have internal predecessors, (267), 65 states have call successors, (65), 13 states have call predecessors, (65), 11 states have return successors, (63), 57 states have call predecessors, (63), 63 states have call successors, (63) [2022-04-28 05:58:24,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:58:24,140 INFO L93 Difference]: Finished difference Result 301 states and 401 transitions. [2022-04-28 05:58:24,140 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 401 transitions. [2022-04-28 05:58:24,141 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:58:24,141 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:58:24,141 INFO L74 IsIncluded]: Start isIncluded. First operand has 296 states, 219 states have (on average 1.2191780821917808) internal successors, (267), 225 states have internal predecessors, (267), 65 states have call successors, (65), 13 states have call predecessors, (65), 11 states have return successors, (63), 57 states have call predecessors, (63), 63 states have call successors, (63) Second operand 301 states. [2022-04-28 05:58:24,142 INFO L87 Difference]: Start difference. First operand has 296 states, 219 states have (on average 1.2191780821917808) internal successors, (267), 225 states have internal predecessors, (267), 65 states have call successors, (65), 13 states have call predecessors, (65), 11 states have return successors, (63), 57 states have call predecessors, (63), 63 states have call successors, (63) Second operand 301 states. [2022-04-28 05:58:24,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:58:24,149 INFO L93 Difference]: Finished difference Result 301 states and 401 transitions. [2022-04-28 05:58:24,149 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 401 transitions. [2022-04-28 05:58:24,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:58:24,150 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:58:24,150 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:58:24,150 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:58:24,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 219 states have (on average 1.2191780821917808) internal successors, (267), 225 states have internal predecessors, (267), 65 states have call successors, (65), 13 states have call predecessors, (65), 11 states have return successors, (63), 57 states have call predecessors, (63), 63 states have call successors, (63) [2022-04-28 05:58:24,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 395 transitions. [2022-04-28 05:58:24,159 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 395 transitions. Word has length 89 [2022-04-28 05:58:24,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:58:24,159 INFO L495 AbstractCegarLoop]: Abstraction has 296 states and 395 transitions. [2022-04-28 05:58:24,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 05:58:24,160 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 296 states and 395 transitions. [2022-04-28 05:58:26,792 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 395 edges. 394 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 05:58:26,792 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 395 transitions. [2022-04-28 05:58:26,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-04-28 05:58:26,793 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:58:26,793 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:58:26,809 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-04-28 05:58:26,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-04-28 05:58:26,994 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:58:26,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:58:26,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1322512306, now seen corresponding path program 5 times [2022-04-28 05:58:26,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:58:26,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1264541668] [2022-04-28 05:58:26,994 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:58:26,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1322512306, now seen corresponding path program 6 times [2022-04-28 05:58:26,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:58:26,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887547900] [2022-04-28 05:58:26,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:58:26,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:58:27,019 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:58:27,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2111017293] [2022-04-28 05:58:27,020 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 05:58:27,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:58:27,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:58:27,021 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:58:27,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-04-28 05:58:27,162 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-28 05:58:27,162 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:58:27,163 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-28 05:58:27,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:58:27,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:58:27,671 INFO L272 TraceCheckUtils]: 0: Hoare triple {26048#true} call ULTIMATE.init(); {26048#true} is VALID [2022-04-28 05:58:27,671 INFO L290 TraceCheckUtils]: 1: Hoare triple {26048#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {26056#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:27,672 INFO L290 TraceCheckUtils]: 2: Hoare triple {26056#(<= ~counter~0 0)} assume true; {26056#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:27,672 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26056#(<= ~counter~0 0)} {26048#true} #102#return; {26056#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:27,672 INFO L272 TraceCheckUtils]: 4: Hoare triple {26056#(<= ~counter~0 0)} call #t~ret9 := main(); {26056#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:27,672 INFO L290 TraceCheckUtils]: 5: Hoare triple {26056#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {26056#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:27,673 INFO L272 TraceCheckUtils]: 6: Hoare triple {26056#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {26056#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:27,673 INFO L290 TraceCheckUtils]: 7: Hoare triple {26056#(<= ~counter~0 0)} ~cond := #in~cond; {26056#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:27,673 INFO L290 TraceCheckUtils]: 8: Hoare triple {26056#(<= ~counter~0 0)} assume !(0 == ~cond); {26056#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:27,674 INFO L290 TraceCheckUtils]: 9: Hoare triple {26056#(<= ~counter~0 0)} assume true; {26056#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:27,674 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {26056#(<= ~counter~0 0)} {26056#(<= ~counter~0 0)} #90#return; {26056#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:27,675 INFO L272 TraceCheckUtils]: 11: Hoare triple {26056#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {26056#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:27,675 INFO L290 TraceCheckUtils]: 12: Hoare triple {26056#(<= ~counter~0 0)} ~cond := #in~cond; {26056#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:27,675 INFO L290 TraceCheckUtils]: 13: Hoare triple {26056#(<= ~counter~0 0)} assume !(0 == ~cond); {26056#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:27,675 INFO L290 TraceCheckUtils]: 14: Hoare triple {26056#(<= ~counter~0 0)} assume true; {26056#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:27,676 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {26056#(<= ~counter~0 0)} {26056#(<= ~counter~0 0)} #92#return; {26056#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:27,676 INFO L290 TraceCheckUtils]: 16: Hoare triple {26056#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {26056#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:27,677 INFO L290 TraceCheckUtils]: 17: Hoare triple {26056#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26105#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:27,677 INFO L290 TraceCheckUtils]: 18: Hoare triple {26105#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {26105#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:27,678 INFO L272 TraceCheckUtils]: 19: Hoare triple {26105#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26105#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:27,678 INFO L290 TraceCheckUtils]: 20: Hoare triple {26105#(<= ~counter~0 1)} ~cond := #in~cond; {26105#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:27,678 INFO L290 TraceCheckUtils]: 21: Hoare triple {26105#(<= ~counter~0 1)} assume !(0 == ~cond); {26105#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:27,678 INFO L290 TraceCheckUtils]: 22: Hoare triple {26105#(<= ~counter~0 1)} assume true; {26105#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:27,679 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {26105#(<= ~counter~0 1)} {26105#(<= ~counter~0 1)} #94#return; {26105#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:27,679 INFO L290 TraceCheckUtils]: 24: Hoare triple {26105#(<= ~counter~0 1)} assume !!(0 != ~r~0); {26105#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:27,680 INFO L290 TraceCheckUtils]: 25: Hoare triple {26105#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {26130#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:27,680 INFO L290 TraceCheckUtils]: 26: Hoare triple {26130#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {26130#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:27,681 INFO L272 TraceCheckUtils]: 27: Hoare triple {26130#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26130#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:27,681 INFO L290 TraceCheckUtils]: 28: Hoare triple {26130#(<= ~counter~0 2)} ~cond := #in~cond; {26130#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:27,682 INFO L290 TraceCheckUtils]: 29: Hoare triple {26130#(<= ~counter~0 2)} assume !(0 == ~cond); {26130#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:27,682 INFO L290 TraceCheckUtils]: 30: Hoare triple {26130#(<= ~counter~0 2)} assume true; {26130#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:27,683 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {26130#(<= ~counter~0 2)} {26130#(<= ~counter~0 2)} #96#return; {26130#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:27,683 INFO L290 TraceCheckUtils]: 32: Hoare triple {26130#(<= ~counter~0 2)} assume !(~r~0 > 0); {26130#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:27,684 INFO L290 TraceCheckUtils]: 33: Hoare triple {26130#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {26155#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:27,684 INFO L290 TraceCheckUtils]: 34: Hoare triple {26155#(<= ~counter~0 3)} assume !!(#t~post8 < 20);havoc #t~post8; {26155#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:27,685 INFO L272 TraceCheckUtils]: 35: Hoare triple {26155#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26155#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:27,685 INFO L290 TraceCheckUtils]: 36: Hoare triple {26155#(<= ~counter~0 3)} ~cond := #in~cond; {26155#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:27,685 INFO L290 TraceCheckUtils]: 37: Hoare triple {26155#(<= ~counter~0 3)} assume !(0 == ~cond); {26155#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:27,685 INFO L290 TraceCheckUtils]: 38: Hoare triple {26155#(<= ~counter~0 3)} assume true; {26155#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:27,686 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {26155#(<= ~counter~0 3)} {26155#(<= ~counter~0 3)} #98#return; {26155#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:27,686 INFO L290 TraceCheckUtils]: 40: Hoare triple {26155#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {26155#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:27,687 INFO L290 TraceCheckUtils]: 41: Hoare triple {26155#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {26180#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:27,687 INFO L290 TraceCheckUtils]: 42: Hoare triple {26180#(<= ~counter~0 4)} assume !!(#t~post8 < 20);havoc #t~post8; {26180#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:27,687 INFO L272 TraceCheckUtils]: 43: Hoare triple {26180#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26180#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:27,688 INFO L290 TraceCheckUtils]: 44: Hoare triple {26180#(<= ~counter~0 4)} ~cond := #in~cond; {26180#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:27,688 INFO L290 TraceCheckUtils]: 45: Hoare triple {26180#(<= ~counter~0 4)} assume !(0 == ~cond); {26180#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:27,688 INFO L290 TraceCheckUtils]: 46: Hoare triple {26180#(<= ~counter~0 4)} assume true; {26180#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:27,689 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {26180#(<= ~counter~0 4)} {26180#(<= ~counter~0 4)} #98#return; {26180#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:27,689 INFO L290 TraceCheckUtils]: 48: Hoare triple {26180#(<= ~counter~0 4)} assume !(~r~0 < 0); {26180#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:27,690 INFO L290 TraceCheckUtils]: 49: Hoare triple {26180#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26205#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:27,690 INFO L290 TraceCheckUtils]: 50: Hoare triple {26205#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {26205#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:27,690 INFO L272 TraceCheckUtils]: 51: Hoare triple {26205#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26205#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:27,691 INFO L290 TraceCheckUtils]: 52: Hoare triple {26205#(<= ~counter~0 5)} ~cond := #in~cond; {26205#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:27,691 INFO L290 TraceCheckUtils]: 53: Hoare triple {26205#(<= ~counter~0 5)} assume !(0 == ~cond); {26205#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:27,691 INFO L290 TraceCheckUtils]: 54: Hoare triple {26205#(<= ~counter~0 5)} assume true; {26205#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:27,692 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {26205#(<= ~counter~0 5)} {26205#(<= ~counter~0 5)} #94#return; {26205#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:27,692 INFO L290 TraceCheckUtils]: 56: Hoare triple {26205#(<= ~counter~0 5)} assume !!(0 != ~r~0); {26205#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:27,692 INFO L290 TraceCheckUtils]: 57: Hoare triple {26205#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {26230#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:27,693 INFO L290 TraceCheckUtils]: 58: Hoare triple {26230#(<= ~counter~0 6)} assume !!(#t~post7 < 20);havoc #t~post7; {26230#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:27,693 INFO L272 TraceCheckUtils]: 59: Hoare triple {26230#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26230#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:27,693 INFO L290 TraceCheckUtils]: 60: Hoare triple {26230#(<= ~counter~0 6)} ~cond := #in~cond; {26230#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:27,694 INFO L290 TraceCheckUtils]: 61: Hoare triple {26230#(<= ~counter~0 6)} assume !(0 == ~cond); {26230#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:27,694 INFO L290 TraceCheckUtils]: 62: Hoare triple {26230#(<= ~counter~0 6)} assume true; {26230#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:27,694 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {26230#(<= ~counter~0 6)} {26230#(<= ~counter~0 6)} #96#return; {26230#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:27,695 INFO L290 TraceCheckUtils]: 64: Hoare triple {26230#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {26230#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:27,695 INFO L290 TraceCheckUtils]: 65: Hoare triple {26230#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {26255#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:27,696 INFO L290 TraceCheckUtils]: 66: Hoare triple {26255#(<= ~counter~0 7)} assume !!(#t~post7 < 20);havoc #t~post7; {26255#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:27,696 INFO L272 TraceCheckUtils]: 67: Hoare triple {26255#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26255#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:27,696 INFO L290 TraceCheckUtils]: 68: Hoare triple {26255#(<= ~counter~0 7)} ~cond := #in~cond; {26255#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:27,697 INFO L290 TraceCheckUtils]: 69: Hoare triple {26255#(<= ~counter~0 7)} assume !(0 == ~cond); {26255#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:27,697 INFO L290 TraceCheckUtils]: 70: Hoare triple {26255#(<= ~counter~0 7)} assume true; {26255#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:27,697 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {26255#(<= ~counter~0 7)} {26255#(<= ~counter~0 7)} #96#return; {26255#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:27,698 INFO L290 TraceCheckUtils]: 72: Hoare triple {26255#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {26255#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:27,698 INFO L290 TraceCheckUtils]: 73: Hoare triple {26255#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {26280#(<= ~counter~0 8)} is VALID [2022-04-28 05:58:27,698 INFO L290 TraceCheckUtils]: 74: Hoare triple {26280#(<= ~counter~0 8)} assume !!(#t~post7 < 20);havoc #t~post7; {26280#(<= ~counter~0 8)} is VALID [2022-04-28 05:58:27,699 INFO L272 TraceCheckUtils]: 75: Hoare triple {26280#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26280#(<= ~counter~0 8)} is VALID [2022-04-28 05:58:27,699 INFO L290 TraceCheckUtils]: 76: Hoare triple {26280#(<= ~counter~0 8)} ~cond := #in~cond; {26280#(<= ~counter~0 8)} is VALID [2022-04-28 05:58:27,699 INFO L290 TraceCheckUtils]: 77: Hoare triple {26280#(<= ~counter~0 8)} assume !(0 == ~cond); {26280#(<= ~counter~0 8)} is VALID [2022-04-28 05:58:27,700 INFO L290 TraceCheckUtils]: 78: Hoare triple {26280#(<= ~counter~0 8)} assume true; {26280#(<= ~counter~0 8)} is VALID [2022-04-28 05:58:27,700 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {26280#(<= ~counter~0 8)} {26280#(<= ~counter~0 8)} #96#return; {26280#(<= ~counter~0 8)} is VALID [2022-04-28 05:58:27,700 INFO L290 TraceCheckUtils]: 80: Hoare triple {26280#(<= ~counter~0 8)} assume !(~r~0 > 0); {26280#(<= ~counter~0 8)} is VALID [2022-04-28 05:58:27,701 INFO L290 TraceCheckUtils]: 81: Hoare triple {26280#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {26305#(<= ~counter~0 9)} is VALID [2022-04-28 05:58:27,701 INFO L290 TraceCheckUtils]: 82: Hoare triple {26305#(<= ~counter~0 9)} assume !(#t~post8 < 20);havoc #t~post8; {26305#(<= ~counter~0 9)} is VALID [2022-04-28 05:58:27,702 INFO L290 TraceCheckUtils]: 83: Hoare triple {26305#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26312#(<= |main_#t~post6| 9)} is VALID [2022-04-28 05:58:27,702 INFO L290 TraceCheckUtils]: 84: Hoare triple {26312#(<= |main_#t~post6| 9)} assume !(#t~post6 < 20);havoc #t~post6; {26049#false} is VALID [2022-04-28 05:58:27,702 INFO L272 TraceCheckUtils]: 85: Hoare triple {26049#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26049#false} is VALID [2022-04-28 05:58:27,702 INFO L290 TraceCheckUtils]: 86: Hoare triple {26049#false} ~cond := #in~cond; {26049#false} is VALID [2022-04-28 05:58:27,702 INFO L290 TraceCheckUtils]: 87: Hoare triple {26049#false} assume 0 == ~cond; {26049#false} is VALID [2022-04-28 05:58:27,703 INFO L290 TraceCheckUtils]: 88: Hoare triple {26049#false} assume !false; {26049#false} is VALID [2022-04-28 05:58:27,703 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 16 proven. 152 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 05:58:27,703 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:58:28,236 INFO L290 TraceCheckUtils]: 88: Hoare triple {26049#false} assume !false; {26049#false} is VALID [2022-04-28 05:58:28,236 INFO L290 TraceCheckUtils]: 87: Hoare triple {26049#false} assume 0 == ~cond; {26049#false} is VALID [2022-04-28 05:58:28,236 INFO L290 TraceCheckUtils]: 86: Hoare triple {26049#false} ~cond := #in~cond; {26049#false} is VALID [2022-04-28 05:58:28,236 INFO L272 TraceCheckUtils]: 85: Hoare triple {26049#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26049#false} is VALID [2022-04-28 05:58:28,237 INFO L290 TraceCheckUtils]: 84: Hoare triple {26340#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {26049#false} is VALID [2022-04-28 05:58:28,237 INFO L290 TraceCheckUtils]: 83: Hoare triple {26344#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26340#(< |main_#t~post6| 20)} is VALID [2022-04-28 05:58:28,237 INFO L290 TraceCheckUtils]: 82: Hoare triple {26344#(< ~counter~0 20)} assume !(#t~post8 < 20);havoc #t~post8; {26344#(< ~counter~0 20)} is VALID [2022-04-28 05:58:28,238 INFO L290 TraceCheckUtils]: 81: Hoare triple {26351#(< ~counter~0 19)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {26344#(< ~counter~0 20)} is VALID [2022-04-28 05:58:28,238 INFO L290 TraceCheckUtils]: 80: Hoare triple {26351#(< ~counter~0 19)} assume !(~r~0 > 0); {26351#(< ~counter~0 19)} is VALID [2022-04-28 05:58:28,239 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {26048#true} {26351#(< ~counter~0 19)} #96#return; {26351#(< ~counter~0 19)} is VALID [2022-04-28 05:58:28,239 INFO L290 TraceCheckUtils]: 78: Hoare triple {26048#true} assume true; {26048#true} is VALID [2022-04-28 05:58:28,239 INFO L290 TraceCheckUtils]: 77: Hoare triple {26048#true} assume !(0 == ~cond); {26048#true} is VALID [2022-04-28 05:58:28,239 INFO L290 TraceCheckUtils]: 76: Hoare triple {26048#true} ~cond := #in~cond; {26048#true} is VALID [2022-04-28 05:58:28,239 INFO L272 TraceCheckUtils]: 75: Hoare triple {26351#(< ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26048#true} is VALID [2022-04-28 05:58:28,239 INFO L290 TraceCheckUtils]: 74: Hoare triple {26351#(< ~counter~0 19)} assume !!(#t~post7 < 20);havoc #t~post7; {26351#(< ~counter~0 19)} is VALID [2022-04-28 05:58:28,240 INFO L290 TraceCheckUtils]: 73: Hoare triple {26376#(< ~counter~0 18)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {26351#(< ~counter~0 19)} is VALID [2022-04-28 05:58:28,240 INFO L290 TraceCheckUtils]: 72: Hoare triple {26376#(< ~counter~0 18)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {26376#(< ~counter~0 18)} is VALID [2022-04-28 05:58:28,241 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {26048#true} {26376#(< ~counter~0 18)} #96#return; {26376#(< ~counter~0 18)} is VALID [2022-04-28 05:58:28,241 INFO L290 TraceCheckUtils]: 70: Hoare triple {26048#true} assume true; {26048#true} is VALID [2022-04-28 05:58:28,241 INFO L290 TraceCheckUtils]: 69: Hoare triple {26048#true} assume !(0 == ~cond); {26048#true} is VALID [2022-04-28 05:58:28,241 INFO L290 TraceCheckUtils]: 68: Hoare triple {26048#true} ~cond := #in~cond; {26048#true} is VALID [2022-04-28 05:58:28,241 INFO L272 TraceCheckUtils]: 67: Hoare triple {26376#(< ~counter~0 18)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26048#true} is VALID [2022-04-28 05:58:28,241 INFO L290 TraceCheckUtils]: 66: Hoare triple {26376#(< ~counter~0 18)} assume !!(#t~post7 < 20);havoc #t~post7; {26376#(< ~counter~0 18)} is VALID [2022-04-28 05:58:28,242 INFO L290 TraceCheckUtils]: 65: Hoare triple {26401#(< ~counter~0 17)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {26376#(< ~counter~0 18)} is VALID [2022-04-28 05:58:28,242 INFO L290 TraceCheckUtils]: 64: Hoare triple {26401#(< ~counter~0 17)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {26401#(< ~counter~0 17)} is VALID [2022-04-28 05:58:28,242 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {26048#true} {26401#(< ~counter~0 17)} #96#return; {26401#(< ~counter~0 17)} is VALID [2022-04-28 05:58:28,243 INFO L290 TraceCheckUtils]: 62: Hoare triple {26048#true} assume true; {26048#true} is VALID [2022-04-28 05:58:28,243 INFO L290 TraceCheckUtils]: 61: Hoare triple {26048#true} assume !(0 == ~cond); {26048#true} is VALID [2022-04-28 05:58:28,243 INFO L290 TraceCheckUtils]: 60: Hoare triple {26048#true} ~cond := #in~cond; {26048#true} is VALID [2022-04-28 05:58:28,243 INFO L272 TraceCheckUtils]: 59: Hoare triple {26401#(< ~counter~0 17)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26048#true} is VALID [2022-04-28 05:58:28,243 INFO L290 TraceCheckUtils]: 58: Hoare triple {26401#(< ~counter~0 17)} assume !!(#t~post7 < 20);havoc #t~post7; {26401#(< ~counter~0 17)} is VALID [2022-04-28 05:58:28,244 INFO L290 TraceCheckUtils]: 57: Hoare triple {26426#(< ~counter~0 16)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {26401#(< ~counter~0 17)} is VALID [2022-04-28 05:58:28,244 INFO L290 TraceCheckUtils]: 56: Hoare triple {26426#(< ~counter~0 16)} assume !!(0 != ~r~0); {26426#(< ~counter~0 16)} is VALID [2022-04-28 05:58:28,244 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {26048#true} {26426#(< ~counter~0 16)} #94#return; {26426#(< ~counter~0 16)} is VALID [2022-04-28 05:58:28,244 INFO L290 TraceCheckUtils]: 54: Hoare triple {26048#true} assume true; {26048#true} is VALID [2022-04-28 05:58:28,244 INFO L290 TraceCheckUtils]: 53: Hoare triple {26048#true} assume !(0 == ~cond); {26048#true} is VALID [2022-04-28 05:58:28,244 INFO L290 TraceCheckUtils]: 52: Hoare triple {26048#true} ~cond := #in~cond; {26048#true} is VALID [2022-04-28 05:58:28,245 INFO L272 TraceCheckUtils]: 51: Hoare triple {26426#(< ~counter~0 16)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26048#true} is VALID [2022-04-28 05:58:28,245 INFO L290 TraceCheckUtils]: 50: Hoare triple {26426#(< ~counter~0 16)} assume !!(#t~post6 < 20);havoc #t~post6; {26426#(< ~counter~0 16)} is VALID [2022-04-28 05:58:28,245 INFO L290 TraceCheckUtils]: 49: Hoare triple {26451#(< ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26426#(< ~counter~0 16)} is VALID [2022-04-28 05:58:28,246 INFO L290 TraceCheckUtils]: 48: Hoare triple {26451#(< ~counter~0 15)} assume !(~r~0 < 0); {26451#(< ~counter~0 15)} is VALID [2022-04-28 05:58:28,246 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {26048#true} {26451#(< ~counter~0 15)} #98#return; {26451#(< ~counter~0 15)} is VALID [2022-04-28 05:58:28,246 INFO L290 TraceCheckUtils]: 46: Hoare triple {26048#true} assume true; {26048#true} is VALID [2022-04-28 05:58:28,246 INFO L290 TraceCheckUtils]: 45: Hoare triple {26048#true} assume !(0 == ~cond); {26048#true} is VALID [2022-04-28 05:58:28,246 INFO L290 TraceCheckUtils]: 44: Hoare triple {26048#true} ~cond := #in~cond; {26048#true} is VALID [2022-04-28 05:58:28,246 INFO L272 TraceCheckUtils]: 43: Hoare triple {26451#(< ~counter~0 15)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26048#true} is VALID [2022-04-28 05:58:28,247 INFO L290 TraceCheckUtils]: 42: Hoare triple {26451#(< ~counter~0 15)} assume !!(#t~post8 < 20);havoc #t~post8; {26451#(< ~counter~0 15)} is VALID [2022-04-28 05:58:28,247 INFO L290 TraceCheckUtils]: 41: Hoare triple {26476#(< ~counter~0 14)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {26451#(< ~counter~0 15)} is VALID [2022-04-28 05:58:28,247 INFO L290 TraceCheckUtils]: 40: Hoare triple {26476#(< ~counter~0 14)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {26476#(< ~counter~0 14)} is VALID [2022-04-28 05:58:28,248 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {26048#true} {26476#(< ~counter~0 14)} #98#return; {26476#(< ~counter~0 14)} is VALID [2022-04-28 05:58:28,248 INFO L290 TraceCheckUtils]: 38: Hoare triple {26048#true} assume true; {26048#true} is VALID [2022-04-28 05:58:28,248 INFO L290 TraceCheckUtils]: 37: Hoare triple {26048#true} assume !(0 == ~cond); {26048#true} is VALID [2022-04-28 05:58:28,248 INFO L290 TraceCheckUtils]: 36: Hoare triple {26048#true} ~cond := #in~cond; {26048#true} is VALID [2022-04-28 05:58:28,248 INFO L272 TraceCheckUtils]: 35: Hoare triple {26476#(< ~counter~0 14)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26048#true} is VALID [2022-04-28 05:58:28,248 INFO L290 TraceCheckUtils]: 34: Hoare triple {26476#(< ~counter~0 14)} assume !!(#t~post8 < 20);havoc #t~post8; {26476#(< ~counter~0 14)} is VALID [2022-04-28 05:58:28,249 INFO L290 TraceCheckUtils]: 33: Hoare triple {26501#(< ~counter~0 13)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {26476#(< ~counter~0 14)} is VALID [2022-04-28 05:58:28,249 INFO L290 TraceCheckUtils]: 32: Hoare triple {26501#(< ~counter~0 13)} assume !(~r~0 > 0); {26501#(< ~counter~0 13)} is VALID [2022-04-28 05:58:28,250 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {26048#true} {26501#(< ~counter~0 13)} #96#return; {26501#(< ~counter~0 13)} is VALID [2022-04-28 05:58:28,250 INFO L290 TraceCheckUtils]: 30: Hoare triple {26048#true} assume true; {26048#true} is VALID [2022-04-28 05:58:28,250 INFO L290 TraceCheckUtils]: 29: Hoare triple {26048#true} assume !(0 == ~cond); {26048#true} is VALID [2022-04-28 05:58:28,250 INFO L290 TraceCheckUtils]: 28: Hoare triple {26048#true} ~cond := #in~cond; {26048#true} is VALID [2022-04-28 05:58:28,250 INFO L272 TraceCheckUtils]: 27: Hoare triple {26501#(< ~counter~0 13)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26048#true} is VALID [2022-04-28 05:58:28,250 INFO L290 TraceCheckUtils]: 26: Hoare triple {26501#(< ~counter~0 13)} assume !!(#t~post7 < 20);havoc #t~post7; {26501#(< ~counter~0 13)} is VALID [2022-04-28 05:58:28,251 INFO L290 TraceCheckUtils]: 25: Hoare triple {26526#(< ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {26501#(< ~counter~0 13)} is VALID [2022-04-28 05:58:28,251 INFO L290 TraceCheckUtils]: 24: Hoare triple {26526#(< ~counter~0 12)} assume !!(0 != ~r~0); {26526#(< ~counter~0 12)} is VALID [2022-04-28 05:58:28,251 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {26048#true} {26526#(< ~counter~0 12)} #94#return; {26526#(< ~counter~0 12)} is VALID [2022-04-28 05:58:28,252 INFO L290 TraceCheckUtils]: 22: Hoare triple {26048#true} assume true; {26048#true} is VALID [2022-04-28 05:58:28,252 INFO L290 TraceCheckUtils]: 21: Hoare triple {26048#true} assume !(0 == ~cond); {26048#true} is VALID [2022-04-28 05:58:28,252 INFO L290 TraceCheckUtils]: 20: Hoare triple {26048#true} ~cond := #in~cond; {26048#true} is VALID [2022-04-28 05:58:28,252 INFO L272 TraceCheckUtils]: 19: Hoare triple {26526#(< ~counter~0 12)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26048#true} is VALID [2022-04-28 05:58:28,252 INFO L290 TraceCheckUtils]: 18: Hoare triple {26526#(< ~counter~0 12)} assume !!(#t~post6 < 20);havoc #t~post6; {26526#(< ~counter~0 12)} is VALID [2022-04-28 05:58:28,252 INFO L290 TraceCheckUtils]: 17: Hoare triple {26551#(< ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26526#(< ~counter~0 12)} is VALID [2022-04-28 05:58:28,253 INFO L290 TraceCheckUtils]: 16: Hoare triple {26551#(< ~counter~0 11)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {26551#(< ~counter~0 11)} is VALID [2022-04-28 05:58:28,253 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {26048#true} {26551#(< ~counter~0 11)} #92#return; {26551#(< ~counter~0 11)} is VALID [2022-04-28 05:58:28,253 INFO L290 TraceCheckUtils]: 14: Hoare triple {26048#true} assume true; {26048#true} is VALID [2022-04-28 05:58:28,253 INFO L290 TraceCheckUtils]: 13: Hoare triple {26048#true} assume !(0 == ~cond); {26048#true} is VALID [2022-04-28 05:58:28,253 INFO L290 TraceCheckUtils]: 12: Hoare triple {26048#true} ~cond := #in~cond; {26048#true} is VALID [2022-04-28 05:58:28,253 INFO L272 TraceCheckUtils]: 11: Hoare triple {26551#(< ~counter~0 11)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {26048#true} is VALID [2022-04-28 05:58:28,254 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {26048#true} {26551#(< ~counter~0 11)} #90#return; {26551#(< ~counter~0 11)} is VALID [2022-04-28 05:58:28,254 INFO L290 TraceCheckUtils]: 9: Hoare triple {26048#true} assume true; {26048#true} is VALID [2022-04-28 05:58:28,254 INFO L290 TraceCheckUtils]: 8: Hoare triple {26048#true} assume !(0 == ~cond); {26048#true} is VALID [2022-04-28 05:58:28,254 INFO L290 TraceCheckUtils]: 7: Hoare triple {26048#true} ~cond := #in~cond; {26048#true} is VALID [2022-04-28 05:58:28,254 INFO L272 TraceCheckUtils]: 6: Hoare triple {26551#(< ~counter~0 11)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {26048#true} is VALID [2022-04-28 05:58:28,254 INFO L290 TraceCheckUtils]: 5: Hoare triple {26551#(< ~counter~0 11)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {26551#(< ~counter~0 11)} is VALID [2022-04-28 05:58:28,255 INFO L272 TraceCheckUtils]: 4: Hoare triple {26551#(< ~counter~0 11)} call #t~ret9 := main(); {26551#(< ~counter~0 11)} is VALID [2022-04-28 05:58:28,255 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26551#(< ~counter~0 11)} {26048#true} #102#return; {26551#(< ~counter~0 11)} is VALID [2022-04-28 05:58:28,255 INFO L290 TraceCheckUtils]: 2: Hoare triple {26551#(< ~counter~0 11)} assume true; {26551#(< ~counter~0 11)} is VALID [2022-04-28 05:58:28,256 INFO L290 TraceCheckUtils]: 1: Hoare triple {26048#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {26551#(< ~counter~0 11)} is VALID [2022-04-28 05:58:28,256 INFO L272 TraceCheckUtils]: 0: Hoare triple {26048#true} call ULTIMATE.init(); {26048#true} is VALID [2022-04-28 05:58:28,256 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 16 proven. 40 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2022-04-28 05:58:28,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:58:28,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887547900] [2022-04-28 05:58:28,256 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:58:28,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2111017293] [2022-04-28 05:58:28,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2111017293] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:58:28,256 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:58:28,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2022-04-28 05:58:28,257 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:58:28,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1264541668] [2022-04-28 05:58:28,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1264541668] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:58:28,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:58:28,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 05:58:28,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350195849] [2022-04-28 05:58:28,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:58:28,257 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 12 states have internal predecessors, (62), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) Word has length 89 [2022-04-28 05:58:28,257 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:58:28,258 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 12 states have internal predecessors, (62), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-28 05:58:28,336 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:58:28,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 05:58:28,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:58:28,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 05:58:28,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-28 05:58:28,337 INFO L87 Difference]: Start difference. First operand 296 states and 395 transitions. Second operand has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 12 states have internal predecessors, (62), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-28 05:58:29,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:58:29,517 INFO L93 Difference]: Finished difference Result 362 states and 486 transitions. [2022-04-28 05:58:29,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-28 05:58:29,517 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 12 states have internal predecessors, (62), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) Word has length 89 [2022-04-28 05:58:29,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:58:29,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 12 states have internal predecessors, (62), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-28 05:58:29,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 197 transitions. [2022-04-28 05:58:29,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 12 states have internal predecessors, (62), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-28 05:58:29,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 197 transitions. [2022-04-28 05:58:29,522 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 197 transitions. [2022-04-28 05:58:29,701 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 197 edges. 197 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:58:29,707 INFO L225 Difference]: With dead ends: 362 [2022-04-28 05:58:29,707 INFO L226 Difference]: Without dead ends: 357 [2022-04-28 05:58:29,707 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=359, Invalid=511, Unknown=0, NotChecked=0, Total=870 [2022-04-28 05:58:29,708 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 148 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 05:58:29,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 236 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 05:58:29,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2022-04-28 05:58:30,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 342. [2022-04-28 05:58:30,233 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:58:30,234 INFO L82 GeneralOperation]: Start isEquivalent. First operand 357 states. Second operand has 342 states, 255 states have (on average 1.231372549019608) internal successors, (314), 261 states have internal predecessors, (314), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-28 05:58:30,234 INFO L74 IsIncluded]: Start isIncluded. First operand 357 states. Second operand has 342 states, 255 states have (on average 1.231372549019608) internal successors, (314), 261 states have internal predecessors, (314), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-28 05:58:30,234 INFO L87 Difference]: Start difference. First operand 357 states. Second operand has 342 states, 255 states have (on average 1.231372549019608) internal successors, (314), 261 states have internal predecessors, (314), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-28 05:58:30,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:58:30,243 INFO L93 Difference]: Finished difference Result 357 states and 477 transitions. [2022-04-28 05:58:30,243 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 477 transitions. [2022-04-28 05:58:30,245 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:58:30,245 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:58:30,245 INFO L74 IsIncluded]: Start isIncluded. First operand has 342 states, 255 states have (on average 1.231372549019608) internal successors, (314), 261 states have internal predecessors, (314), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) Second operand 357 states. [2022-04-28 05:58:30,246 INFO L87 Difference]: Start difference. First operand has 342 states, 255 states have (on average 1.231372549019608) internal successors, (314), 261 states have internal predecessors, (314), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) Second operand 357 states. [2022-04-28 05:58:30,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:58:30,255 INFO L93 Difference]: Finished difference Result 357 states and 477 transitions. [2022-04-28 05:58:30,255 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 477 transitions. [2022-04-28 05:58:30,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:58:30,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:58:30,256 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:58:30,256 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:58:30,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 255 states have (on average 1.231372549019608) internal successors, (314), 261 states have internal predecessors, (314), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-28 05:58:30,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 460 transitions. [2022-04-28 05:58:30,267 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 460 transitions. Word has length 89 [2022-04-28 05:58:30,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:58:30,267 INFO L495 AbstractCegarLoop]: Abstraction has 342 states and 460 transitions. [2022-04-28 05:58:30,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 12 states have internal predecessors, (62), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-28 05:58:30,268 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 342 states and 460 transitions. [2022-04-28 05:58:31,296 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 460 edges. 460 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:58:31,297 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 460 transitions. [2022-04-28 05:58:31,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-04-28 05:58:31,300 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:58:31,300 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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-04-28 05:58:31,306 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-04-28 05:58:31,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-04-28 05:58:31,507 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:58:31,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:58:31,507 INFO L85 PathProgramCache]: Analyzing trace with hash -345961389, now seen corresponding path program 5 times [2022-04-28 05:58:31,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:58:31,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1384051369] [2022-04-28 05:58:31,508 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:58:31,508 INFO L85 PathProgramCache]: Analyzing trace with hash -345961389, now seen corresponding path program 6 times [2022-04-28 05:58:31,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:58:31,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210936641] [2022-04-28 05:58:31,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:58:31,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:58:31,533 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:58:31,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1812863308] [2022-04-28 05:58:31,533 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 05:58:31,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:58:31,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:58:31,535 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:58:31,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-04-28 05:58:31,685 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-28 05:58:31,685 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:58:31,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 05:58:31,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:58:31,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:58:32,114 INFO L272 TraceCheckUtils]: 0: Hoare triple {28739#true} call ULTIMATE.init(); {28739#true} is VALID [2022-04-28 05:58:32,115 INFO L290 TraceCheckUtils]: 1: Hoare triple {28739#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {28747#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:32,115 INFO L290 TraceCheckUtils]: 2: Hoare triple {28747#(<= ~counter~0 0)} assume true; {28747#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:32,116 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28747#(<= ~counter~0 0)} {28739#true} #102#return; {28747#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:32,116 INFO L272 TraceCheckUtils]: 4: Hoare triple {28747#(<= ~counter~0 0)} call #t~ret9 := main(); {28747#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:32,116 INFO L290 TraceCheckUtils]: 5: Hoare triple {28747#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {28747#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:32,116 INFO L272 TraceCheckUtils]: 6: Hoare triple {28747#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {28747#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:32,117 INFO L290 TraceCheckUtils]: 7: Hoare triple {28747#(<= ~counter~0 0)} ~cond := #in~cond; {28747#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:32,117 INFO L290 TraceCheckUtils]: 8: Hoare triple {28747#(<= ~counter~0 0)} assume !(0 == ~cond); {28747#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:32,117 INFO L290 TraceCheckUtils]: 9: Hoare triple {28747#(<= ~counter~0 0)} assume true; {28747#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:32,118 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {28747#(<= ~counter~0 0)} {28747#(<= ~counter~0 0)} #90#return; {28747#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:32,118 INFO L272 TraceCheckUtils]: 11: Hoare triple {28747#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {28747#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:32,118 INFO L290 TraceCheckUtils]: 12: Hoare triple {28747#(<= ~counter~0 0)} ~cond := #in~cond; {28747#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:32,119 INFO L290 TraceCheckUtils]: 13: Hoare triple {28747#(<= ~counter~0 0)} assume !(0 == ~cond); {28747#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:32,119 INFO L290 TraceCheckUtils]: 14: Hoare triple {28747#(<= ~counter~0 0)} assume true; {28747#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:32,119 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {28747#(<= ~counter~0 0)} {28747#(<= ~counter~0 0)} #92#return; {28747#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:32,119 INFO L290 TraceCheckUtils]: 16: Hoare triple {28747#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {28747#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:32,120 INFO L290 TraceCheckUtils]: 17: Hoare triple {28747#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {28796#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:32,121 INFO L290 TraceCheckUtils]: 18: Hoare triple {28796#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {28796#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:32,121 INFO L272 TraceCheckUtils]: 19: Hoare triple {28796#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {28796#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:32,121 INFO L290 TraceCheckUtils]: 20: Hoare triple {28796#(<= ~counter~0 1)} ~cond := #in~cond; {28796#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:32,122 INFO L290 TraceCheckUtils]: 21: Hoare triple {28796#(<= ~counter~0 1)} assume !(0 == ~cond); {28796#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:32,122 INFO L290 TraceCheckUtils]: 22: Hoare triple {28796#(<= ~counter~0 1)} assume true; {28796#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:32,122 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {28796#(<= ~counter~0 1)} {28796#(<= ~counter~0 1)} #94#return; {28796#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:32,123 INFO L290 TraceCheckUtils]: 24: Hoare triple {28796#(<= ~counter~0 1)} assume !!(0 != ~r~0); {28796#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:32,123 INFO L290 TraceCheckUtils]: 25: Hoare triple {28796#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {28821#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:32,123 INFO L290 TraceCheckUtils]: 26: Hoare triple {28821#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {28821#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:32,124 INFO L272 TraceCheckUtils]: 27: Hoare triple {28821#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {28821#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:32,124 INFO L290 TraceCheckUtils]: 28: Hoare triple {28821#(<= ~counter~0 2)} ~cond := #in~cond; {28821#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:32,124 INFO L290 TraceCheckUtils]: 29: Hoare triple {28821#(<= ~counter~0 2)} assume !(0 == ~cond); {28821#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:32,125 INFO L290 TraceCheckUtils]: 30: Hoare triple {28821#(<= ~counter~0 2)} assume true; {28821#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:32,125 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {28821#(<= ~counter~0 2)} {28821#(<= ~counter~0 2)} #96#return; {28821#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:32,125 INFO L290 TraceCheckUtils]: 32: Hoare triple {28821#(<= ~counter~0 2)} assume !(~r~0 > 0); {28821#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:32,126 INFO L290 TraceCheckUtils]: 33: Hoare triple {28821#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {28846#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:32,126 INFO L290 TraceCheckUtils]: 34: Hoare triple {28846#(<= ~counter~0 3)} assume !!(#t~post8 < 20);havoc #t~post8; {28846#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:32,127 INFO L272 TraceCheckUtils]: 35: Hoare triple {28846#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {28846#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:32,127 INFO L290 TraceCheckUtils]: 36: Hoare triple {28846#(<= ~counter~0 3)} ~cond := #in~cond; {28846#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:32,127 INFO L290 TraceCheckUtils]: 37: Hoare triple {28846#(<= ~counter~0 3)} assume !(0 == ~cond); {28846#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:32,127 INFO L290 TraceCheckUtils]: 38: Hoare triple {28846#(<= ~counter~0 3)} assume true; {28846#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:32,128 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {28846#(<= ~counter~0 3)} {28846#(<= ~counter~0 3)} #98#return; {28846#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:32,128 INFO L290 TraceCheckUtils]: 40: Hoare triple {28846#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {28846#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:32,129 INFO L290 TraceCheckUtils]: 41: Hoare triple {28846#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {28871#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:32,129 INFO L290 TraceCheckUtils]: 42: Hoare triple {28871#(<= ~counter~0 4)} assume !!(#t~post8 < 20);havoc #t~post8; {28871#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:32,129 INFO L272 TraceCheckUtils]: 43: Hoare triple {28871#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {28871#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:32,130 INFO L290 TraceCheckUtils]: 44: Hoare triple {28871#(<= ~counter~0 4)} ~cond := #in~cond; {28871#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:32,130 INFO L290 TraceCheckUtils]: 45: Hoare triple {28871#(<= ~counter~0 4)} assume !(0 == ~cond); {28871#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:32,130 INFO L290 TraceCheckUtils]: 46: Hoare triple {28871#(<= ~counter~0 4)} assume true; {28871#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:32,131 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {28871#(<= ~counter~0 4)} {28871#(<= ~counter~0 4)} #98#return; {28871#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:32,131 INFO L290 TraceCheckUtils]: 48: Hoare triple {28871#(<= ~counter~0 4)} assume !(~r~0 < 0); {28871#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:32,131 INFO L290 TraceCheckUtils]: 49: Hoare triple {28871#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {28896#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:32,132 INFO L290 TraceCheckUtils]: 50: Hoare triple {28896#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {28896#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:32,132 INFO L272 TraceCheckUtils]: 51: Hoare triple {28896#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {28896#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:32,132 INFO L290 TraceCheckUtils]: 52: Hoare triple {28896#(<= ~counter~0 5)} ~cond := #in~cond; {28896#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:32,133 INFO L290 TraceCheckUtils]: 53: Hoare triple {28896#(<= ~counter~0 5)} assume !(0 == ~cond); {28896#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:32,133 INFO L290 TraceCheckUtils]: 54: Hoare triple {28896#(<= ~counter~0 5)} assume true; {28896#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:32,133 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {28896#(<= ~counter~0 5)} {28896#(<= ~counter~0 5)} #94#return; {28896#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:32,134 INFO L290 TraceCheckUtils]: 56: Hoare triple {28896#(<= ~counter~0 5)} assume !!(0 != ~r~0); {28896#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:32,134 INFO L290 TraceCheckUtils]: 57: Hoare triple {28896#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {28921#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:32,134 INFO L290 TraceCheckUtils]: 58: Hoare triple {28921#(<= ~counter~0 6)} assume !!(#t~post7 < 20);havoc #t~post7; {28921#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:32,135 INFO L272 TraceCheckUtils]: 59: Hoare triple {28921#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {28921#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:32,135 INFO L290 TraceCheckUtils]: 60: Hoare triple {28921#(<= ~counter~0 6)} ~cond := #in~cond; {28921#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:32,135 INFO L290 TraceCheckUtils]: 61: Hoare triple {28921#(<= ~counter~0 6)} assume !(0 == ~cond); {28921#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:32,136 INFO L290 TraceCheckUtils]: 62: Hoare triple {28921#(<= ~counter~0 6)} assume true; {28921#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:32,136 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {28921#(<= ~counter~0 6)} {28921#(<= ~counter~0 6)} #96#return; {28921#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:32,136 INFO L290 TraceCheckUtils]: 64: Hoare triple {28921#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {28921#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:32,137 INFO L290 TraceCheckUtils]: 65: Hoare triple {28921#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {28946#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:32,137 INFO L290 TraceCheckUtils]: 66: Hoare triple {28946#(<= ~counter~0 7)} assume !!(#t~post7 < 20);havoc #t~post7; {28946#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:32,138 INFO L272 TraceCheckUtils]: 67: Hoare triple {28946#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {28946#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:32,138 INFO L290 TraceCheckUtils]: 68: Hoare triple {28946#(<= ~counter~0 7)} ~cond := #in~cond; {28946#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:32,138 INFO L290 TraceCheckUtils]: 69: Hoare triple {28946#(<= ~counter~0 7)} assume !(0 == ~cond); {28946#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:32,139 INFO L290 TraceCheckUtils]: 70: Hoare triple {28946#(<= ~counter~0 7)} assume true; {28946#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:32,139 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {28946#(<= ~counter~0 7)} {28946#(<= ~counter~0 7)} #96#return; {28946#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:32,139 INFO L290 TraceCheckUtils]: 72: Hoare triple {28946#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {28946#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:32,140 INFO L290 TraceCheckUtils]: 73: Hoare triple {28946#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {28971#(<= ~counter~0 8)} is VALID [2022-04-28 05:58:32,140 INFO L290 TraceCheckUtils]: 74: Hoare triple {28971#(<= ~counter~0 8)} assume !!(#t~post7 < 20);havoc #t~post7; {28971#(<= ~counter~0 8)} is VALID [2022-04-28 05:58:32,141 INFO L272 TraceCheckUtils]: 75: Hoare triple {28971#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {28971#(<= ~counter~0 8)} is VALID [2022-04-28 05:58:32,141 INFO L290 TraceCheckUtils]: 76: Hoare triple {28971#(<= ~counter~0 8)} ~cond := #in~cond; {28971#(<= ~counter~0 8)} is VALID [2022-04-28 05:58:32,141 INFO L290 TraceCheckUtils]: 77: Hoare triple {28971#(<= ~counter~0 8)} assume !(0 == ~cond); {28971#(<= ~counter~0 8)} is VALID [2022-04-28 05:58:32,141 INFO L290 TraceCheckUtils]: 78: Hoare triple {28971#(<= ~counter~0 8)} assume true; {28971#(<= ~counter~0 8)} is VALID [2022-04-28 05:58:32,142 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {28971#(<= ~counter~0 8)} {28971#(<= ~counter~0 8)} #96#return; {28971#(<= ~counter~0 8)} is VALID [2022-04-28 05:58:32,142 INFO L290 TraceCheckUtils]: 80: Hoare triple {28971#(<= ~counter~0 8)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {28971#(<= ~counter~0 8)} is VALID [2022-04-28 05:58:32,142 INFO L290 TraceCheckUtils]: 81: Hoare triple {28971#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {28996#(<= |main_#t~post7| 8)} is VALID [2022-04-28 05:58:32,143 INFO L290 TraceCheckUtils]: 82: Hoare triple {28996#(<= |main_#t~post7| 8)} assume !(#t~post7 < 20);havoc #t~post7; {28740#false} is VALID [2022-04-28 05:58:32,143 INFO L290 TraceCheckUtils]: 83: Hoare triple {28740#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {28740#false} is VALID [2022-04-28 05:58:32,143 INFO L290 TraceCheckUtils]: 84: Hoare triple {28740#false} assume !(#t~post8 < 20);havoc #t~post8; {28740#false} is VALID [2022-04-28 05:58:32,143 INFO L290 TraceCheckUtils]: 85: Hoare triple {28740#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {28740#false} is VALID [2022-04-28 05:58:32,143 INFO L290 TraceCheckUtils]: 86: Hoare triple {28740#false} assume !(#t~post6 < 20);havoc #t~post6; {28740#false} is VALID [2022-04-28 05:58:32,143 INFO L272 TraceCheckUtils]: 87: Hoare triple {28740#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {28740#false} is VALID [2022-04-28 05:58:32,143 INFO L290 TraceCheckUtils]: 88: Hoare triple {28740#false} ~cond := #in~cond; {28740#false} is VALID [2022-04-28 05:58:32,143 INFO L290 TraceCheckUtils]: 89: Hoare triple {28740#false} assume 0 == ~cond; {28740#false} is VALID [2022-04-28 05:58:32,143 INFO L290 TraceCheckUtils]: 90: Hoare triple {28740#false} assume !false; {28740#false} is VALID [2022-04-28 05:58:32,143 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 24 proven. 152 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 05:58:32,144 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:58:32,656 INFO L290 TraceCheckUtils]: 90: Hoare triple {28740#false} assume !false; {28740#false} is VALID [2022-04-28 05:58:32,656 INFO L290 TraceCheckUtils]: 89: Hoare triple {28740#false} assume 0 == ~cond; {28740#false} is VALID [2022-04-28 05:58:32,656 INFO L290 TraceCheckUtils]: 88: Hoare triple {28740#false} ~cond := #in~cond; {28740#false} is VALID [2022-04-28 05:58:32,656 INFO L272 TraceCheckUtils]: 87: Hoare triple {28740#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {28740#false} is VALID [2022-04-28 05:58:32,656 INFO L290 TraceCheckUtils]: 86: Hoare triple {28740#false} assume !(#t~post6 < 20);havoc #t~post6; {28740#false} is VALID [2022-04-28 05:58:32,657 INFO L290 TraceCheckUtils]: 85: Hoare triple {28740#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {28740#false} is VALID [2022-04-28 05:58:32,657 INFO L290 TraceCheckUtils]: 84: Hoare triple {28740#false} assume !(#t~post8 < 20);havoc #t~post8; {28740#false} is VALID [2022-04-28 05:58:32,657 INFO L290 TraceCheckUtils]: 83: Hoare triple {28740#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {28740#false} is VALID [2022-04-28 05:58:32,657 INFO L290 TraceCheckUtils]: 82: Hoare triple {29048#(< |main_#t~post7| 20)} assume !(#t~post7 < 20);havoc #t~post7; {28740#false} is VALID [2022-04-28 05:58:32,657 INFO L290 TraceCheckUtils]: 81: Hoare triple {29052#(< ~counter~0 20)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {29048#(< |main_#t~post7| 20)} is VALID [2022-04-28 05:58:32,658 INFO L290 TraceCheckUtils]: 80: Hoare triple {29052#(< ~counter~0 20)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {29052#(< ~counter~0 20)} is VALID [2022-04-28 05:58:32,659 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {28739#true} {29052#(< ~counter~0 20)} #96#return; {29052#(< ~counter~0 20)} is VALID [2022-04-28 05:58:32,659 INFO L290 TraceCheckUtils]: 78: Hoare triple {28739#true} assume true; {28739#true} is VALID [2022-04-28 05:58:32,659 INFO L290 TraceCheckUtils]: 77: Hoare triple {28739#true} assume !(0 == ~cond); {28739#true} is VALID [2022-04-28 05:58:32,659 INFO L290 TraceCheckUtils]: 76: Hoare triple {28739#true} ~cond := #in~cond; {28739#true} is VALID [2022-04-28 05:58:32,659 INFO L272 TraceCheckUtils]: 75: Hoare triple {29052#(< ~counter~0 20)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {28739#true} is VALID [2022-04-28 05:58:32,659 INFO L290 TraceCheckUtils]: 74: Hoare triple {29052#(< ~counter~0 20)} assume !!(#t~post7 < 20);havoc #t~post7; {29052#(< ~counter~0 20)} is VALID [2022-04-28 05:58:32,660 INFO L290 TraceCheckUtils]: 73: Hoare triple {29077#(< ~counter~0 19)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {29052#(< ~counter~0 20)} is VALID [2022-04-28 05:58:32,661 INFO L290 TraceCheckUtils]: 72: Hoare triple {29077#(< ~counter~0 19)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {29077#(< ~counter~0 19)} is VALID [2022-04-28 05:58:32,661 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {28739#true} {29077#(< ~counter~0 19)} #96#return; {29077#(< ~counter~0 19)} is VALID [2022-04-28 05:58:32,661 INFO L290 TraceCheckUtils]: 70: Hoare triple {28739#true} assume true; {28739#true} is VALID [2022-04-28 05:58:32,661 INFO L290 TraceCheckUtils]: 69: Hoare triple {28739#true} assume !(0 == ~cond); {28739#true} is VALID [2022-04-28 05:58:32,661 INFO L290 TraceCheckUtils]: 68: Hoare triple {28739#true} ~cond := #in~cond; {28739#true} is VALID [2022-04-28 05:58:32,662 INFO L272 TraceCheckUtils]: 67: Hoare triple {29077#(< ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {28739#true} is VALID [2022-04-28 05:58:32,662 INFO L290 TraceCheckUtils]: 66: Hoare triple {29077#(< ~counter~0 19)} assume !!(#t~post7 < 20);havoc #t~post7; {29077#(< ~counter~0 19)} is VALID [2022-04-28 05:58:32,663 INFO L290 TraceCheckUtils]: 65: Hoare triple {29102#(< ~counter~0 18)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {29077#(< ~counter~0 19)} is VALID [2022-04-28 05:58:32,663 INFO L290 TraceCheckUtils]: 64: Hoare triple {29102#(< ~counter~0 18)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {29102#(< ~counter~0 18)} is VALID [2022-04-28 05:58:32,664 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {28739#true} {29102#(< ~counter~0 18)} #96#return; {29102#(< ~counter~0 18)} is VALID [2022-04-28 05:58:32,664 INFO L290 TraceCheckUtils]: 62: Hoare triple {28739#true} assume true; {28739#true} is VALID [2022-04-28 05:58:32,664 INFO L290 TraceCheckUtils]: 61: Hoare triple {28739#true} assume !(0 == ~cond); {28739#true} is VALID [2022-04-28 05:58:32,664 INFO L290 TraceCheckUtils]: 60: Hoare triple {28739#true} ~cond := #in~cond; {28739#true} is VALID [2022-04-28 05:58:32,664 INFO L272 TraceCheckUtils]: 59: Hoare triple {29102#(< ~counter~0 18)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {28739#true} is VALID [2022-04-28 05:58:32,664 INFO L290 TraceCheckUtils]: 58: Hoare triple {29102#(< ~counter~0 18)} assume !!(#t~post7 < 20);havoc #t~post7; {29102#(< ~counter~0 18)} is VALID [2022-04-28 05:58:32,665 INFO L290 TraceCheckUtils]: 57: Hoare triple {29127#(< ~counter~0 17)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {29102#(< ~counter~0 18)} is VALID [2022-04-28 05:58:32,665 INFO L290 TraceCheckUtils]: 56: Hoare triple {29127#(< ~counter~0 17)} assume !!(0 != ~r~0); {29127#(< ~counter~0 17)} is VALID [2022-04-28 05:58:32,666 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {28739#true} {29127#(< ~counter~0 17)} #94#return; {29127#(< ~counter~0 17)} is VALID [2022-04-28 05:58:32,666 INFO L290 TraceCheckUtils]: 54: Hoare triple {28739#true} assume true; {28739#true} is VALID [2022-04-28 05:58:32,666 INFO L290 TraceCheckUtils]: 53: Hoare triple {28739#true} assume !(0 == ~cond); {28739#true} is VALID [2022-04-28 05:58:32,666 INFO L290 TraceCheckUtils]: 52: Hoare triple {28739#true} ~cond := #in~cond; {28739#true} is VALID [2022-04-28 05:58:32,666 INFO L272 TraceCheckUtils]: 51: Hoare triple {29127#(< ~counter~0 17)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {28739#true} is VALID [2022-04-28 05:58:32,667 INFO L290 TraceCheckUtils]: 50: Hoare triple {29127#(< ~counter~0 17)} assume !!(#t~post6 < 20);havoc #t~post6; {29127#(< ~counter~0 17)} is VALID [2022-04-28 05:58:32,667 INFO L290 TraceCheckUtils]: 49: Hoare triple {29152#(< ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29127#(< ~counter~0 17)} is VALID [2022-04-28 05:58:32,668 INFO L290 TraceCheckUtils]: 48: Hoare triple {29152#(< ~counter~0 16)} assume !(~r~0 < 0); {29152#(< ~counter~0 16)} is VALID [2022-04-28 05:58:32,669 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {28739#true} {29152#(< ~counter~0 16)} #98#return; {29152#(< ~counter~0 16)} is VALID [2022-04-28 05:58:32,669 INFO L290 TraceCheckUtils]: 46: Hoare triple {28739#true} assume true; {28739#true} is VALID [2022-04-28 05:58:32,669 INFO L290 TraceCheckUtils]: 45: Hoare triple {28739#true} assume !(0 == ~cond); {28739#true} is VALID [2022-04-28 05:58:32,669 INFO L290 TraceCheckUtils]: 44: Hoare triple {28739#true} ~cond := #in~cond; {28739#true} is VALID [2022-04-28 05:58:32,669 INFO L272 TraceCheckUtils]: 43: Hoare triple {29152#(< ~counter~0 16)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {28739#true} is VALID [2022-04-28 05:58:32,669 INFO L290 TraceCheckUtils]: 42: Hoare triple {29152#(< ~counter~0 16)} assume !!(#t~post8 < 20);havoc #t~post8; {29152#(< ~counter~0 16)} is VALID [2022-04-28 05:58:32,670 INFO L290 TraceCheckUtils]: 41: Hoare triple {29177#(< ~counter~0 15)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {29152#(< ~counter~0 16)} is VALID [2022-04-28 05:58:32,670 INFO L290 TraceCheckUtils]: 40: Hoare triple {29177#(< ~counter~0 15)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {29177#(< ~counter~0 15)} is VALID [2022-04-28 05:58:32,671 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {28739#true} {29177#(< ~counter~0 15)} #98#return; {29177#(< ~counter~0 15)} is VALID [2022-04-28 05:58:32,671 INFO L290 TraceCheckUtils]: 38: Hoare triple {28739#true} assume true; {28739#true} is VALID [2022-04-28 05:58:32,671 INFO L290 TraceCheckUtils]: 37: Hoare triple {28739#true} assume !(0 == ~cond); {28739#true} is VALID [2022-04-28 05:58:32,671 INFO L290 TraceCheckUtils]: 36: Hoare triple {28739#true} ~cond := #in~cond; {28739#true} is VALID [2022-04-28 05:58:32,671 INFO L272 TraceCheckUtils]: 35: Hoare triple {29177#(< ~counter~0 15)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {28739#true} is VALID [2022-04-28 05:58:32,672 INFO L290 TraceCheckUtils]: 34: Hoare triple {29177#(< ~counter~0 15)} assume !!(#t~post8 < 20);havoc #t~post8; {29177#(< ~counter~0 15)} is VALID [2022-04-28 05:58:32,673 INFO L290 TraceCheckUtils]: 33: Hoare triple {29202#(< ~counter~0 14)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {29177#(< ~counter~0 15)} is VALID [2022-04-28 05:58:32,673 INFO L290 TraceCheckUtils]: 32: Hoare triple {29202#(< ~counter~0 14)} assume !(~r~0 > 0); {29202#(< ~counter~0 14)} is VALID [2022-04-28 05:58:32,674 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {28739#true} {29202#(< ~counter~0 14)} #96#return; {29202#(< ~counter~0 14)} is VALID [2022-04-28 05:58:32,674 INFO L290 TraceCheckUtils]: 30: Hoare triple {28739#true} assume true; {28739#true} is VALID [2022-04-28 05:58:32,674 INFO L290 TraceCheckUtils]: 29: Hoare triple {28739#true} assume !(0 == ~cond); {28739#true} is VALID [2022-04-28 05:58:32,674 INFO L290 TraceCheckUtils]: 28: Hoare triple {28739#true} ~cond := #in~cond; {28739#true} is VALID [2022-04-28 05:58:32,674 INFO L272 TraceCheckUtils]: 27: Hoare triple {29202#(< ~counter~0 14)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {28739#true} is VALID [2022-04-28 05:58:32,674 INFO L290 TraceCheckUtils]: 26: Hoare triple {29202#(< ~counter~0 14)} assume !!(#t~post7 < 20);havoc #t~post7; {29202#(< ~counter~0 14)} is VALID [2022-04-28 05:58:32,675 INFO L290 TraceCheckUtils]: 25: Hoare triple {29227#(< ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {29202#(< ~counter~0 14)} is VALID [2022-04-28 05:58:32,675 INFO L290 TraceCheckUtils]: 24: Hoare triple {29227#(< ~counter~0 13)} assume !!(0 != ~r~0); {29227#(< ~counter~0 13)} is VALID [2022-04-28 05:58:32,676 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {28739#true} {29227#(< ~counter~0 13)} #94#return; {29227#(< ~counter~0 13)} is VALID [2022-04-28 05:58:32,676 INFO L290 TraceCheckUtils]: 22: Hoare triple {28739#true} assume true; {28739#true} is VALID [2022-04-28 05:58:32,676 INFO L290 TraceCheckUtils]: 21: Hoare triple {28739#true} assume !(0 == ~cond); {28739#true} is VALID [2022-04-28 05:58:32,676 INFO L290 TraceCheckUtils]: 20: Hoare triple {28739#true} ~cond := #in~cond; {28739#true} is VALID [2022-04-28 05:58:32,676 INFO L272 TraceCheckUtils]: 19: Hoare triple {29227#(< ~counter~0 13)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {28739#true} is VALID [2022-04-28 05:58:32,677 INFO L290 TraceCheckUtils]: 18: Hoare triple {29227#(< ~counter~0 13)} assume !!(#t~post6 < 20);havoc #t~post6; {29227#(< ~counter~0 13)} is VALID [2022-04-28 05:58:32,677 INFO L290 TraceCheckUtils]: 17: Hoare triple {29252#(< ~counter~0 12)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29227#(< ~counter~0 13)} is VALID [2022-04-28 05:58:32,678 INFO L290 TraceCheckUtils]: 16: Hoare triple {29252#(< ~counter~0 12)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {29252#(< ~counter~0 12)} is VALID [2022-04-28 05:58:32,678 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {28739#true} {29252#(< ~counter~0 12)} #92#return; {29252#(< ~counter~0 12)} is VALID [2022-04-28 05:58:32,678 INFO L290 TraceCheckUtils]: 14: Hoare triple {28739#true} assume true; {28739#true} is VALID [2022-04-28 05:58:32,678 INFO L290 TraceCheckUtils]: 13: Hoare triple {28739#true} assume !(0 == ~cond); {28739#true} is VALID [2022-04-28 05:58:32,678 INFO L290 TraceCheckUtils]: 12: Hoare triple {28739#true} ~cond := #in~cond; {28739#true} is VALID [2022-04-28 05:58:32,679 INFO L272 TraceCheckUtils]: 11: Hoare triple {29252#(< ~counter~0 12)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {28739#true} is VALID [2022-04-28 05:58:32,679 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {28739#true} {29252#(< ~counter~0 12)} #90#return; {29252#(< ~counter~0 12)} is VALID [2022-04-28 05:58:32,679 INFO L290 TraceCheckUtils]: 9: Hoare triple {28739#true} assume true; {28739#true} is VALID [2022-04-28 05:58:32,679 INFO L290 TraceCheckUtils]: 8: Hoare triple {28739#true} assume !(0 == ~cond); {28739#true} is VALID [2022-04-28 05:58:32,679 INFO L290 TraceCheckUtils]: 7: Hoare triple {28739#true} ~cond := #in~cond; {28739#true} is VALID [2022-04-28 05:58:32,679 INFO L272 TraceCheckUtils]: 6: Hoare triple {29252#(< ~counter~0 12)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {28739#true} is VALID [2022-04-28 05:58:32,680 INFO L290 TraceCheckUtils]: 5: Hoare triple {29252#(< ~counter~0 12)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {29252#(< ~counter~0 12)} is VALID [2022-04-28 05:58:32,680 INFO L272 TraceCheckUtils]: 4: Hoare triple {29252#(< ~counter~0 12)} call #t~ret9 := main(); {29252#(< ~counter~0 12)} is VALID [2022-04-28 05:58:32,680 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29252#(< ~counter~0 12)} {28739#true} #102#return; {29252#(< ~counter~0 12)} is VALID [2022-04-28 05:58:32,681 INFO L290 TraceCheckUtils]: 2: Hoare triple {29252#(< ~counter~0 12)} assume true; {29252#(< ~counter~0 12)} is VALID [2022-04-28 05:58:32,681 INFO L290 TraceCheckUtils]: 1: Hoare triple {28739#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {29252#(< ~counter~0 12)} is VALID [2022-04-28 05:58:32,681 INFO L272 TraceCheckUtils]: 0: Hoare triple {28739#true} call ULTIMATE.init(); {28739#true} is VALID [2022-04-28 05:58:32,682 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 24 proven. 40 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2022-04-28 05:58:32,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:58:32,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210936641] [2022-04-28 05:58:32,682 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:58:32,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1812863308] [2022-04-28 05:58:32,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1812863308] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:58:32,682 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:58:32,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2022-04-28 05:58:32,683 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:58:32,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1384051369] [2022-04-28 05:58:32,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1384051369] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:58:32,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:58:32,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 05:58:32,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559203599] [2022-04-28 05:58:32,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:58:32,683 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 11 states have internal predecessors, (64), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) Word has length 91 [2022-04-28 05:58:32,684 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:58:32,684 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 11 states have internal predecessors, (64), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-28 05:58:32,763 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:58:32,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 05:58:32,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:58:32,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 05:58:32,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=267, Unknown=0, NotChecked=0, Total=462 [2022-04-28 05:58:32,765 INFO L87 Difference]: Start difference. First operand 342 states and 460 transitions. Second operand has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 11 states have internal predecessors, (64), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-28 05:58:33,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:58:33,820 INFO L93 Difference]: Finished difference Result 427 states and 585 transitions. [2022-04-28 05:58:33,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-28 05:58:33,820 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 11 states have internal predecessors, (64), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) Word has length 91 [2022-04-28 05:58:33,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:58:33,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 11 states have internal predecessors, (64), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-28 05:58:33,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 197 transitions. [2022-04-28 05:58:33,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 11 states have internal predecessors, (64), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-28 05:58:33,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 197 transitions. [2022-04-28 05:58:33,825 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 197 transitions. [2022-04-28 05:58:34,011 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 197 edges. 197 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:58:34,020 INFO L225 Difference]: With dead ends: 427 [2022-04-28 05:58:34,020 INFO L226 Difference]: Without dead ends: 342 [2022-04-28 05:58:34,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=335, Invalid=477, Unknown=0, NotChecked=0, Total=812 [2022-04-28 05:58:34,022 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 95 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 05:58:34,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 217 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 05:58:34,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2022-04-28 05:58:34,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342. [2022-04-28 05:58:34,605 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:58:34,605 INFO L82 GeneralOperation]: Start isEquivalent. First operand 342 states. Second operand has 342 states, 255 states have (on average 1.2156862745098038) internal successors, (310), 261 states have internal predecessors, (310), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-28 05:58:34,606 INFO L74 IsIncluded]: Start isIncluded. First operand 342 states. Second operand has 342 states, 255 states have (on average 1.2156862745098038) internal successors, (310), 261 states have internal predecessors, (310), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-28 05:58:34,606 INFO L87 Difference]: Start difference. First operand 342 states. Second operand has 342 states, 255 states have (on average 1.2156862745098038) internal successors, (310), 261 states have internal predecessors, (310), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-28 05:58:34,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:58:34,615 INFO L93 Difference]: Finished difference Result 342 states and 456 transitions. [2022-04-28 05:58:34,615 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 456 transitions. [2022-04-28 05:58:34,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:58:34,616 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:58:34,617 INFO L74 IsIncluded]: Start isIncluded. First operand has 342 states, 255 states have (on average 1.2156862745098038) internal successors, (310), 261 states have internal predecessors, (310), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) Second operand 342 states. [2022-04-28 05:58:34,617 INFO L87 Difference]: Start difference. First operand has 342 states, 255 states have (on average 1.2156862745098038) internal successors, (310), 261 states have internal predecessors, (310), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) Second operand 342 states. [2022-04-28 05:58:34,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:58:34,626 INFO L93 Difference]: Finished difference Result 342 states and 456 transitions. [2022-04-28 05:58:34,626 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 456 transitions. [2022-04-28 05:58:34,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:58:34,626 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:58:34,627 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:58:34,627 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:58:34,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 255 states have (on average 1.2156862745098038) internal successors, (310), 261 states have internal predecessors, (310), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-28 05:58:34,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 456 transitions. [2022-04-28 05:58:34,637 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 456 transitions. Word has length 91 [2022-04-28 05:58:34,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:58:34,637 INFO L495 AbstractCegarLoop]: Abstraction has 342 states and 456 transitions. [2022-04-28 05:58:34,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 11 states have internal predecessors, (64), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-28 05:58:34,638 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 342 states and 456 transitions. [2022-04-28 05:58:37,020 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 456 edges. 456 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:58:37,021 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 456 transitions. [2022-04-28 05:58:37,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-04-28 05:58:37,024 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:58:37,024 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:58:37,031 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-04-28 05:58:37,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-04-28 05:58:37,229 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:58:37,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:58:37,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1660747519, now seen corresponding path program 7 times [2022-04-28 05:58:37,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:58:37,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [575920763] [2022-04-28 05:58:37,230 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:58:37,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1660747519, now seen corresponding path program 8 times [2022-04-28 05:58:37,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:58:37,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955939059] [2022-04-28 05:58:37,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:58:37,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:58:37,242 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:58:37,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1690719716] [2022-04-28 05:58:37,242 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:58:37,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:58:37,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:58:37,243 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:58:37,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-04-28 05:58:37,303 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:58:37,303 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:58:37,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-28 05:58:37,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:58:37,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:58:37,797 INFO L272 TraceCheckUtils]: 0: Hoare triple {31542#true} call ULTIMATE.init(); {31542#true} is VALID [2022-04-28 05:58:37,797 INFO L290 TraceCheckUtils]: 1: Hoare triple {31542#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {31550#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:37,798 INFO L290 TraceCheckUtils]: 2: Hoare triple {31550#(<= ~counter~0 0)} assume true; {31550#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:37,798 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31550#(<= ~counter~0 0)} {31542#true} #102#return; {31550#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:37,798 INFO L272 TraceCheckUtils]: 4: Hoare triple {31550#(<= ~counter~0 0)} call #t~ret9 := main(); {31550#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:37,799 INFO L290 TraceCheckUtils]: 5: Hoare triple {31550#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {31550#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:37,799 INFO L272 TraceCheckUtils]: 6: Hoare triple {31550#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {31550#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:37,799 INFO L290 TraceCheckUtils]: 7: Hoare triple {31550#(<= ~counter~0 0)} ~cond := #in~cond; {31550#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:37,799 INFO L290 TraceCheckUtils]: 8: Hoare triple {31550#(<= ~counter~0 0)} assume !(0 == ~cond); {31550#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:37,800 INFO L290 TraceCheckUtils]: 9: Hoare triple {31550#(<= ~counter~0 0)} assume true; {31550#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:37,800 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {31550#(<= ~counter~0 0)} {31550#(<= ~counter~0 0)} #90#return; {31550#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:37,801 INFO L272 TraceCheckUtils]: 11: Hoare triple {31550#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {31550#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:37,801 INFO L290 TraceCheckUtils]: 12: Hoare triple {31550#(<= ~counter~0 0)} ~cond := #in~cond; {31550#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:37,801 INFO L290 TraceCheckUtils]: 13: Hoare triple {31550#(<= ~counter~0 0)} assume !(0 == ~cond); {31550#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:37,808 INFO L290 TraceCheckUtils]: 14: Hoare triple {31550#(<= ~counter~0 0)} assume true; {31550#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:37,808 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {31550#(<= ~counter~0 0)} {31550#(<= ~counter~0 0)} #92#return; {31550#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:37,809 INFO L290 TraceCheckUtils]: 16: Hoare triple {31550#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {31550#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:37,810 INFO L290 TraceCheckUtils]: 17: Hoare triple {31550#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31599#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:37,810 INFO L290 TraceCheckUtils]: 18: Hoare triple {31599#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {31599#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:37,810 INFO L272 TraceCheckUtils]: 19: Hoare triple {31599#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {31599#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:37,811 INFO L290 TraceCheckUtils]: 20: Hoare triple {31599#(<= ~counter~0 1)} ~cond := #in~cond; {31599#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:37,811 INFO L290 TraceCheckUtils]: 21: Hoare triple {31599#(<= ~counter~0 1)} assume !(0 == ~cond); {31599#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:37,811 INFO L290 TraceCheckUtils]: 22: Hoare triple {31599#(<= ~counter~0 1)} assume true; {31599#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:37,812 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {31599#(<= ~counter~0 1)} {31599#(<= ~counter~0 1)} #94#return; {31599#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:37,812 INFO L290 TraceCheckUtils]: 24: Hoare triple {31599#(<= ~counter~0 1)} assume !!(0 != ~r~0); {31599#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:37,812 INFO L290 TraceCheckUtils]: 25: Hoare triple {31599#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {31624#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:37,813 INFO L290 TraceCheckUtils]: 26: Hoare triple {31624#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {31624#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:37,813 INFO L272 TraceCheckUtils]: 27: Hoare triple {31624#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {31624#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:37,813 INFO L290 TraceCheckUtils]: 28: Hoare triple {31624#(<= ~counter~0 2)} ~cond := #in~cond; {31624#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:37,814 INFO L290 TraceCheckUtils]: 29: Hoare triple {31624#(<= ~counter~0 2)} assume !(0 == ~cond); {31624#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:37,814 INFO L290 TraceCheckUtils]: 30: Hoare triple {31624#(<= ~counter~0 2)} assume true; {31624#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:37,815 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {31624#(<= ~counter~0 2)} {31624#(<= ~counter~0 2)} #96#return; {31624#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:37,815 INFO L290 TraceCheckUtils]: 32: Hoare triple {31624#(<= ~counter~0 2)} assume !(~r~0 > 0); {31624#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:37,815 INFO L290 TraceCheckUtils]: 33: Hoare triple {31624#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {31649#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:37,816 INFO L290 TraceCheckUtils]: 34: Hoare triple {31649#(<= ~counter~0 3)} assume !!(#t~post8 < 20);havoc #t~post8; {31649#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:37,816 INFO L272 TraceCheckUtils]: 35: Hoare triple {31649#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {31649#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:37,816 INFO L290 TraceCheckUtils]: 36: Hoare triple {31649#(<= ~counter~0 3)} ~cond := #in~cond; {31649#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:37,817 INFO L290 TraceCheckUtils]: 37: Hoare triple {31649#(<= ~counter~0 3)} assume !(0 == ~cond); {31649#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:37,817 INFO L290 TraceCheckUtils]: 38: Hoare triple {31649#(<= ~counter~0 3)} assume true; {31649#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:37,817 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {31649#(<= ~counter~0 3)} {31649#(<= ~counter~0 3)} #98#return; {31649#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:37,818 INFO L290 TraceCheckUtils]: 40: Hoare triple {31649#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {31649#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:37,818 INFO L290 TraceCheckUtils]: 41: Hoare triple {31649#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {31674#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:37,819 INFO L290 TraceCheckUtils]: 42: Hoare triple {31674#(<= ~counter~0 4)} assume !!(#t~post8 < 20);havoc #t~post8; {31674#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:37,819 INFO L272 TraceCheckUtils]: 43: Hoare triple {31674#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {31674#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:37,819 INFO L290 TraceCheckUtils]: 44: Hoare triple {31674#(<= ~counter~0 4)} ~cond := #in~cond; {31674#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:37,820 INFO L290 TraceCheckUtils]: 45: Hoare triple {31674#(<= ~counter~0 4)} assume !(0 == ~cond); {31674#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:37,820 INFO L290 TraceCheckUtils]: 46: Hoare triple {31674#(<= ~counter~0 4)} assume true; {31674#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:37,820 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {31674#(<= ~counter~0 4)} {31674#(<= ~counter~0 4)} #98#return; {31674#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:37,821 INFO L290 TraceCheckUtils]: 48: Hoare triple {31674#(<= ~counter~0 4)} assume !(~r~0 < 0); {31674#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:37,821 INFO L290 TraceCheckUtils]: 49: Hoare triple {31674#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31699#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:37,821 INFO L290 TraceCheckUtils]: 50: Hoare triple {31699#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {31699#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:37,822 INFO L272 TraceCheckUtils]: 51: Hoare triple {31699#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {31699#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:37,822 INFO L290 TraceCheckUtils]: 52: Hoare triple {31699#(<= ~counter~0 5)} ~cond := #in~cond; {31699#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:37,823 INFO L290 TraceCheckUtils]: 53: Hoare triple {31699#(<= ~counter~0 5)} assume !(0 == ~cond); {31699#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:37,823 INFO L290 TraceCheckUtils]: 54: Hoare triple {31699#(<= ~counter~0 5)} assume true; {31699#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:37,823 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {31699#(<= ~counter~0 5)} {31699#(<= ~counter~0 5)} #94#return; {31699#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:37,824 INFO L290 TraceCheckUtils]: 56: Hoare triple {31699#(<= ~counter~0 5)} assume !!(0 != ~r~0); {31699#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:37,824 INFO L290 TraceCheckUtils]: 57: Hoare triple {31699#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {31724#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:37,824 INFO L290 TraceCheckUtils]: 58: Hoare triple {31724#(<= ~counter~0 6)} assume !!(#t~post7 < 20);havoc #t~post7; {31724#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:37,825 INFO L272 TraceCheckUtils]: 59: Hoare triple {31724#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {31724#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:37,825 INFO L290 TraceCheckUtils]: 60: Hoare triple {31724#(<= ~counter~0 6)} ~cond := #in~cond; {31724#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:37,825 INFO L290 TraceCheckUtils]: 61: Hoare triple {31724#(<= ~counter~0 6)} assume !(0 == ~cond); {31724#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:37,826 INFO L290 TraceCheckUtils]: 62: Hoare triple {31724#(<= ~counter~0 6)} assume true; {31724#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:37,826 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {31724#(<= ~counter~0 6)} {31724#(<= ~counter~0 6)} #96#return; {31724#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:37,826 INFO L290 TraceCheckUtils]: 64: Hoare triple {31724#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {31724#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:37,827 INFO L290 TraceCheckUtils]: 65: Hoare triple {31724#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {31749#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:37,827 INFO L290 TraceCheckUtils]: 66: Hoare triple {31749#(<= ~counter~0 7)} assume !!(#t~post7 < 20);havoc #t~post7; {31749#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:37,828 INFO L272 TraceCheckUtils]: 67: Hoare triple {31749#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {31749#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:37,828 INFO L290 TraceCheckUtils]: 68: Hoare triple {31749#(<= ~counter~0 7)} ~cond := #in~cond; {31749#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:37,828 INFO L290 TraceCheckUtils]: 69: Hoare triple {31749#(<= ~counter~0 7)} assume !(0 == ~cond); {31749#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:37,829 INFO L290 TraceCheckUtils]: 70: Hoare triple {31749#(<= ~counter~0 7)} assume true; {31749#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:37,829 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {31749#(<= ~counter~0 7)} {31749#(<= ~counter~0 7)} #96#return; {31749#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:37,829 INFO L290 TraceCheckUtils]: 72: Hoare triple {31749#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {31749#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:37,830 INFO L290 TraceCheckUtils]: 73: Hoare triple {31749#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {31774#(<= ~counter~0 8)} is VALID [2022-04-28 05:58:37,830 INFO L290 TraceCheckUtils]: 74: Hoare triple {31774#(<= ~counter~0 8)} assume !!(#t~post7 < 20);havoc #t~post7; {31774#(<= ~counter~0 8)} is VALID [2022-04-28 05:58:37,831 INFO L272 TraceCheckUtils]: 75: Hoare triple {31774#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {31774#(<= ~counter~0 8)} is VALID [2022-04-28 05:58:37,831 INFO L290 TraceCheckUtils]: 76: Hoare triple {31774#(<= ~counter~0 8)} ~cond := #in~cond; {31774#(<= ~counter~0 8)} is VALID [2022-04-28 05:58:37,831 INFO L290 TraceCheckUtils]: 77: Hoare triple {31774#(<= ~counter~0 8)} assume !(0 == ~cond); {31774#(<= ~counter~0 8)} is VALID [2022-04-28 05:58:37,832 INFO L290 TraceCheckUtils]: 78: Hoare triple {31774#(<= ~counter~0 8)} assume true; {31774#(<= ~counter~0 8)} is VALID [2022-04-28 05:58:37,832 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {31774#(<= ~counter~0 8)} {31774#(<= ~counter~0 8)} #96#return; {31774#(<= ~counter~0 8)} is VALID [2022-04-28 05:58:37,832 INFO L290 TraceCheckUtils]: 80: Hoare triple {31774#(<= ~counter~0 8)} assume !(~r~0 > 0); {31774#(<= ~counter~0 8)} is VALID [2022-04-28 05:58:37,833 INFO L290 TraceCheckUtils]: 81: Hoare triple {31774#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {31799#(<= ~counter~0 9)} is VALID [2022-04-28 05:58:37,833 INFO L290 TraceCheckUtils]: 82: Hoare triple {31799#(<= ~counter~0 9)} assume !!(#t~post8 < 20);havoc #t~post8; {31799#(<= ~counter~0 9)} is VALID [2022-04-28 05:58:37,834 INFO L272 TraceCheckUtils]: 83: Hoare triple {31799#(<= ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {31799#(<= ~counter~0 9)} is VALID [2022-04-28 05:58:37,834 INFO L290 TraceCheckUtils]: 84: Hoare triple {31799#(<= ~counter~0 9)} ~cond := #in~cond; {31799#(<= ~counter~0 9)} is VALID [2022-04-28 05:58:37,834 INFO L290 TraceCheckUtils]: 85: Hoare triple {31799#(<= ~counter~0 9)} assume !(0 == ~cond); {31799#(<= ~counter~0 9)} is VALID [2022-04-28 05:58:37,834 INFO L290 TraceCheckUtils]: 86: Hoare triple {31799#(<= ~counter~0 9)} assume true; {31799#(<= ~counter~0 9)} is VALID [2022-04-28 05:58:37,835 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {31799#(<= ~counter~0 9)} {31799#(<= ~counter~0 9)} #98#return; {31799#(<= ~counter~0 9)} is VALID [2022-04-28 05:58:37,835 INFO L290 TraceCheckUtils]: 88: Hoare triple {31799#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {31799#(<= ~counter~0 9)} is VALID [2022-04-28 05:58:37,836 INFO L290 TraceCheckUtils]: 89: Hoare triple {31799#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {31824#(<= |main_#t~post8| 9)} is VALID [2022-04-28 05:58:37,836 INFO L290 TraceCheckUtils]: 90: Hoare triple {31824#(<= |main_#t~post8| 9)} assume !(#t~post8 < 20);havoc #t~post8; {31543#false} is VALID [2022-04-28 05:58:37,836 INFO L290 TraceCheckUtils]: 91: Hoare triple {31543#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31543#false} is VALID [2022-04-28 05:58:37,836 INFO L290 TraceCheckUtils]: 92: Hoare triple {31543#false} assume !(#t~post6 < 20);havoc #t~post6; {31543#false} is VALID [2022-04-28 05:58:37,836 INFO L272 TraceCheckUtils]: 93: Hoare triple {31543#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {31543#false} is VALID [2022-04-28 05:58:37,836 INFO L290 TraceCheckUtils]: 94: Hoare triple {31543#false} ~cond := #in~cond; {31543#false} is VALID [2022-04-28 05:58:37,836 INFO L290 TraceCheckUtils]: 95: Hoare triple {31543#false} assume 0 == ~cond; {31543#false} is VALID [2022-04-28 05:58:37,836 INFO L290 TraceCheckUtils]: 96: Hoare triple {31543#false} assume !false; {31543#false} is VALID [2022-04-28 05:58:37,837 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 22 proven. 190 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 05:58:37,837 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:58:38,363 INFO L290 TraceCheckUtils]: 96: Hoare triple {31543#false} assume !false; {31543#false} is VALID [2022-04-28 05:58:38,364 INFO L290 TraceCheckUtils]: 95: Hoare triple {31543#false} assume 0 == ~cond; {31543#false} is VALID [2022-04-28 05:58:38,364 INFO L290 TraceCheckUtils]: 94: Hoare triple {31543#false} ~cond := #in~cond; {31543#false} is VALID [2022-04-28 05:58:38,364 INFO L272 TraceCheckUtils]: 93: Hoare triple {31543#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {31543#false} is VALID [2022-04-28 05:58:38,364 INFO L290 TraceCheckUtils]: 92: Hoare triple {31543#false} assume !(#t~post6 < 20);havoc #t~post6; {31543#false} is VALID [2022-04-28 05:58:38,364 INFO L290 TraceCheckUtils]: 91: Hoare triple {31543#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31543#false} is VALID [2022-04-28 05:58:38,364 INFO L290 TraceCheckUtils]: 90: Hoare triple {31864#(< |main_#t~post8| 20)} assume !(#t~post8 < 20);havoc #t~post8; {31543#false} is VALID [2022-04-28 05:58:38,365 INFO L290 TraceCheckUtils]: 89: Hoare triple {31868#(< ~counter~0 20)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {31864#(< |main_#t~post8| 20)} is VALID [2022-04-28 05:58:38,365 INFO L290 TraceCheckUtils]: 88: Hoare triple {31868#(< ~counter~0 20)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {31868#(< ~counter~0 20)} is VALID [2022-04-28 05:58:38,365 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {31542#true} {31868#(< ~counter~0 20)} #98#return; {31868#(< ~counter~0 20)} is VALID [2022-04-28 05:58:38,365 INFO L290 TraceCheckUtils]: 86: Hoare triple {31542#true} assume true; {31542#true} is VALID [2022-04-28 05:58:38,366 INFO L290 TraceCheckUtils]: 85: Hoare triple {31542#true} assume !(0 == ~cond); {31542#true} is VALID [2022-04-28 05:58:38,366 INFO L290 TraceCheckUtils]: 84: Hoare triple {31542#true} ~cond := #in~cond; {31542#true} is VALID [2022-04-28 05:58:38,366 INFO L272 TraceCheckUtils]: 83: Hoare triple {31868#(< ~counter~0 20)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {31542#true} is VALID [2022-04-28 05:58:38,366 INFO L290 TraceCheckUtils]: 82: Hoare triple {31868#(< ~counter~0 20)} assume !!(#t~post8 < 20);havoc #t~post8; {31868#(< ~counter~0 20)} is VALID [2022-04-28 05:58:38,367 INFO L290 TraceCheckUtils]: 81: Hoare triple {31893#(< ~counter~0 19)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {31868#(< ~counter~0 20)} is VALID [2022-04-28 05:58:38,367 INFO L290 TraceCheckUtils]: 80: Hoare triple {31893#(< ~counter~0 19)} assume !(~r~0 > 0); {31893#(< ~counter~0 19)} is VALID [2022-04-28 05:58:38,368 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {31542#true} {31893#(< ~counter~0 19)} #96#return; {31893#(< ~counter~0 19)} is VALID [2022-04-28 05:58:38,368 INFO L290 TraceCheckUtils]: 78: Hoare triple {31542#true} assume true; {31542#true} is VALID [2022-04-28 05:58:38,368 INFO L290 TraceCheckUtils]: 77: Hoare triple {31542#true} assume !(0 == ~cond); {31542#true} is VALID [2022-04-28 05:58:38,368 INFO L290 TraceCheckUtils]: 76: Hoare triple {31542#true} ~cond := #in~cond; {31542#true} is VALID [2022-04-28 05:58:38,368 INFO L272 TraceCheckUtils]: 75: Hoare triple {31893#(< ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {31542#true} is VALID [2022-04-28 05:58:38,368 INFO L290 TraceCheckUtils]: 74: Hoare triple {31893#(< ~counter~0 19)} assume !!(#t~post7 < 20);havoc #t~post7; {31893#(< ~counter~0 19)} is VALID [2022-04-28 05:58:38,369 INFO L290 TraceCheckUtils]: 73: Hoare triple {31918#(< ~counter~0 18)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {31893#(< ~counter~0 19)} is VALID [2022-04-28 05:58:38,369 INFO L290 TraceCheckUtils]: 72: Hoare triple {31918#(< ~counter~0 18)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {31918#(< ~counter~0 18)} is VALID [2022-04-28 05:58:38,369 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {31542#true} {31918#(< ~counter~0 18)} #96#return; {31918#(< ~counter~0 18)} is VALID [2022-04-28 05:58:38,369 INFO L290 TraceCheckUtils]: 70: Hoare triple {31542#true} assume true; {31542#true} is VALID [2022-04-28 05:58:38,370 INFO L290 TraceCheckUtils]: 69: Hoare triple {31542#true} assume !(0 == ~cond); {31542#true} is VALID [2022-04-28 05:58:38,370 INFO L290 TraceCheckUtils]: 68: Hoare triple {31542#true} ~cond := #in~cond; {31542#true} is VALID [2022-04-28 05:58:38,370 INFO L272 TraceCheckUtils]: 67: Hoare triple {31918#(< ~counter~0 18)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {31542#true} is VALID [2022-04-28 05:58:38,370 INFO L290 TraceCheckUtils]: 66: Hoare triple {31918#(< ~counter~0 18)} assume !!(#t~post7 < 20);havoc #t~post7; {31918#(< ~counter~0 18)} is VALID [2022-04-28 05:58:38,370 INFO L290 TraceCheckUtils]: 65: Hoare triple {31943#(< ~counter~0 17)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {31918#(< ~counter~0 18)} is VALID [2022-04-28 05:58:38,371 INFO L290 TraceCheckUtils]: 64: Hoare triple {31943#(< ~counter~0 17)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {31943#(< ~counter~0 17)} is VALID [2022-04-28 05:58:38,371 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {31542#true} {31943#(< ~counter~0 17)} #96#return; {31943#(< ~counter~0 17)} is VALID [2022-04-28 05:58:38,371 INFO L290 TraceCheckUtils]: 62: Hoare triple {31542#true} assume true; {31542#true} is VALID [2022-04-28 05:58:38,371 INFO L290 TraceCheckUtils]: 61: Hoare triple {31542#true} assume !(0 == ~cond); {31542#true} is VALID [2022-04-28 05:58:38,371 INFO L290 TraceCheckUtils]: 60: Hoare triple {31542#true} ~cond := #in~cond; {31542#true} is VALID [2022-04-28 05:58:38,371 INFO L272 TraceCheckUtils]: 59: Hoare triple {31943#(< ~counter~0 17)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {31542#true} is VALID [2022-04-28 05:58:38,372 INFO L290 TraceCheckUtils]: 58: Hoare triple {31943#(< ~counter~0 17)} assume !!(#t~post7 < 20);havoc #t~post7; {31943#(< ~counter~0 17)} is VALID [2022-04-28 05:58:38,372 INFO L290 TraceCheckUtils]: 57: Hoare triple {31968#(< ~counter~0 16)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {31943#(< ~counter~0 17)} is VALID [2022-04-28 05:58:38,372 INFO L290 TraceCheckUtils]: 56: Hoare triple {31968#(< ~counter~0 16)} assume !!(0 != ~r~0); {31968#(< ~counter~0 16)} is VALID [2022-04-28 05:58:38,373 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {31542#true} {31968#(< ~counter~0 16)} #94#return; {31968#(< ~counter~0 16)} is VALID [2022-04-28 05:58:38,373 INFO L290 TraceCheckUtils]: 54: Hoare triple {31542#true} assume true; {31542#true} is VALID [2022-04-28 05:58:38,373 INFO L290 TraceCheckUtils]: 53: Hoare triple {31542#true} assume !(0 == ~cond); {31542#true} is VALID [2022-04-28 05:58:38,373 INFO L290 TraceCheckUtils]: 52: Hoare triple {31542#true} ~cond := #in~cond; {31542#true} is VALID [2022-04-28 05:58:38,373 INFO L272 TraceCheckUtils]: 51: Hoare triple {31968#(< ~counter~0 16)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {31542#true} is VALID [2022-04-28 05:58:38,373 INFO L290 TraceCheckUtils]: 50: Hoare triple {31968#(< ~counter~0 16)} assume !!(#t~post6 < 20);havoc #t~post6; {31968#(< ~counter~0 16)} is VALID [2022-04-28 05:58:38,374 INFO L290 TraceCheckUtils]: 49: Hoare triple {31993#(< ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31968#(< ~counter~0 16)} is VALID [2022-04-28 05:58:38,374 INFO L290 TraceCheckUtils]: 48: Hoare triple {31993#(< ~counter~0 15)} assume !(~r~0 < 0); {31993#(< ~counter~0 15)} is VALID [2022-04-28 05:58:38,375 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {31542#true} {31993#(< ~counter~0 15)} #98#return; {31993#(< ~counter~0 15)} is VALID [2022-04-28 05:58:38,375 INFO L290 TraceCheckUtils]: 46: Hoare triple {31542#true} assume true; {31542#true} is VALID [2022-04-28 05:58:38,375 INFO L290 TraceCheckUtils]: 45: Hoare triple {31542#true} assume !(0 == ~cond); {31542#true} is VALID [2022-04-28 05:58:38,375 INFO L290 TraceCheckUtils]: 44: Hoare triple {31542#true} ~cond := #in~cond; {31542#true} is VALID [2022-04-28 05:58:38,375 INFO L272 TraceCheckUtils]: 43: Hoare triple {31993#(< ~counter~0 15)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {31542#true} is VALID [2022-04-28 05:58:38,375 INFO L290 TraceCheckUtils]: 42: Hoare triple {31993#(< ~counter~0 15)} assume !!(#t~post8 < 20);havoc #t~post8; {31993#(< ~counter~0 15)} is VALID [2022-04-28 05:58:38,376 INFO L290 TraceCheckUtils]: 41: Hoare triple {32018#(< ~counter~0 14)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {31993#(< ~counter~0 15)} is VALID [2022-04-28 05:58:38,376 INFO L290 TraceCheckUtils]: 40: Hoare triple {32018#(< ~counter~0 14)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {32018#(< ~counter~0 14)} is VALID [2022-04-28 05:58:38,377 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {31542#true} {32018#(< ~counter~0 14)} #98#return; {32018#(< ~counter~0 14)} is VALID [2022-04-28 05:58:38,377 INFO L290 TraceCheckUtils]: 38: Hoare triple {31542#true} assume true; {31542#true} is VALID [2022-04-28 05:58:38,377 INFO L290 TraceCheckUtils]: 37: Hoare triple {31542#true} assume !(0 == ~cond); {31542#true} is VALID [2022-04-28 05:58:38,377 INFO L290 TraceCheckUtils]: 36: Hoare triple {31542#true} ~cond := #in~cond; {31542#true} is VALID [2022-04-28 05:58:38,377 INFO L272 TraceCheckUtils]: 35: Hoare triple {32018#(< ~counter~0 14)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {31542#true} is VALID [2022-04-28 05:58:38,377 INFO L290 TraceCheckUtils]: 34: Hoare triple {32018#(< ~counter~0 14)} assume !!(#t~post8 < 20);havoc #t~post8; {32018#(< ~counter~0 14)} is VALID [2022-04-28 05:58:38,378 INFO L290 TraceCheckUtils]: 33: Hoare triple {32043#(< ~counter~0 13)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {32018#(< ~counter~0 14)} is VALID [2022-04-28 05:58:38,378 INFO L290 TraceCheckUtils]: 32: Hoare triple {32043#(< ~counter~0 13)} assume !(~r~0 > 0); {32043#(< ~counter~0 13)} is VALID [2022-04-28 05:58:38,378 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {31542#true} {32043#(< ~counter~0 13)} #96#return; {32043#(< ~counter~0 13)} is VALID [2022-04-28 05:58:38,378 INFO L290 TraceCheckUtils]: 30: Hoare triple {31542#true} assume true; {31542#true} is VALID [2022-04-28 05:58:38,378 INFO L290 TraceCheckUtils]: 29: Hoare triple {31542#true} assume !(0 == ~cond); {31542#true} is VALID [2022-04-28 05:58:38,379 INFO L290 TraceCheckUtils]: 28: Hoare triple {31542#true} ~cond := #in~cond; {31542#true} is VALID [2022-04-28 05:58:38,379 INFO L272 TraceCheckUtils]: 27: Hoare triple {32043#(< ~counter~0 13)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {31542#true} is VALID [2022-04-28 05:58:38,379 INFO L290 TraceCheckUtils]: 26: Hoare triple {32043#(< ~counter~0 13)} assume !!(#t~post7 < 20);havoc #t~post7; {32043#(< ~counter~0 13)} is VALID [2022-04-28 05:58:38,379 INFO L290 TraceCheckUtils]: 25: Hoare triple {32068#(< ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {32043#(< ~counter~0 13)} is VALID [2022-04-28 05:58:38,380 INFO L290 TraceCheckUtils]: 24: Hoare triple {32068#(< ~counter~0 12)} assume !!(0 != ~r~0); {32068#(< ~counter~0 12)} is VALID [2022-04-28 05:58:38,380 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {31542#true} {32068#(< ~counter~0 12)} #94#return; {32068#(< ~counter~0 12)} is VALID [2022-04-28 05:58:38,380 INFO L290 TraceCheckUtils]: 22: Hoare triple {31542#true} assume true; {31542#true} is VALID [2022-04-28 05:58:38,380 INFO L290 TraceCheckUtils]: 21: Hoare triple {31542#true} assume !(0 == ~cond); {31542#true} is VALID [2022-04-28 05:58:38,380 INFO L290 TraceCheckUtils]: 20: Hoare triple {31542#true} ~cond := #in~cond; {31542#true} is VALID [2022-04-28 05:58:38,380 INFO L272 TraceCheckUtils]: 19: Hoare triple {32068#(< ~counter~0 12)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {31542#true} is VALID [2022-04-28 05:58:38,381 INFO L290 TraceCheckUtils]: 18: Hoare triple {32068#(< ~counter~0 12)} assume !!(#t~post6 < 20);havoc #t~post6; {32068#(< ~counter~0 12)} is VALID [2022-04-28 05:58:38,381 INFO L290 TraceCheckUtils]: 17: Hoare triple {32093#(< ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32068#(< ~counter~0 12)} is VALID [2022-04-28 05:58:38,381 INFO L290 TraceCheckUtils]: 16: Hoare triple {32093#(< ~counter~0 11)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {32093#(< ~counter~0 11)} is VALID [2022-04-28 05:58:38,382 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {31542#true} {32093#(< ~counter~0 11)} #92#return; {32093#(< ~counter~0 11)} is VALID [2022-04-28 05:58:38,382 INFO L290 TraceCheckUtils]: 14: Hoare triple {31542#true} assume true; {31542#true} is VALID [2022-04-28 05:58:38,382 INFO L290 TraceCheckUtils]: 13: Hoare triple {31542#true} assume !(0 == ~cond); {31542#true} is VALID [2022-04-28 05:58:38,382 INFO L290 TraceCheckUtils]: 12: Hoare triple {31542#true} ~cond := #in~cond; {31542#true} is VALID [2022-04-28 05:58:38,382 INFO L272 TraceCheckUtils]: 11: Hoare triple {32093#(< ~counter~0 11)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {31542#true} is VALID [2022-04-28 05:58:38,383 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {31542#true} {32093#(< ~counter~0 11)} #90#return; {32093#(< ~counter~0 11)} is VALID [2022-04-28 05:58:38,383 INFO L290 TraceCheckUtils]: 9: Hoare triple {31542#true} assume true; {31542#true} is VALID [2022-04-28 05:58:38,383 INFO L290 TraceCheckUtils]: 8: Hoare triple {31542#true} assume !(0 == ~cond); {31542#true} is VALID [2022-04-28 05:58:38,383 INFO L290 TraceCheckUtils]: 7: Hoare triple {31542#true} ~cond := #in~cond; {31542#true} is VALID [2022-04-28 05:58:38,383 INFO L272 TraceCheckUtils]: 6: Hoare triple {32093#(< ~counter~0 11)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {31542#true} is VALID [2022-04-28 05:58:38,383 INFO L290 TraceCheckUtils]: 5: Hoare triple {32093#(< ~counter~0 11)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {32093#(< ~counter~0 11)} is VALID [2022-04-28 05:58:38,383 INFO L272 TraceCheckUtils]: 4: Hoare triple {32093#(< ~counter~0 11)} call #t~ret9 := main(); {32093#(< ~counter~0 11)} is VALID [2022-04-28 05:58:38,384 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32093#(< ~counter~0 11)} {31542#true} #102#return; {32093#(< ~counter~0 11)} is VALID [2022-04-28 05:58:38,384 INFO L290 TraceCheckUtils]: 2: Hoare triple {32093#(< ~counter~0 11)} assume true; {32093#(< ~counter~0 11)} is VALID [2022-04-28 05:58:38,384 INFO L290 TraceCheckUtils]: 1: Hoare triple {31542#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {32093#(< ~counter~0 11)} is VALID [2022-04-28 05:58:38,384 INFO L272 TraceCheckUtils]: 0: Hoare triple {31542#true} call ULTIMATE.init(); {31542#true} is VALID [2022-04-28 05:58:38,385 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 22 proven. 46 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-04-28 05:58:38,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:58:38,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955939059] [2022-04-28 05:58:38,385 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:58:38,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1690719716] [2022-04-28 05:58:38,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1690719716] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:58:38,385 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:58:38,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2022-04-28 05:58:38,385 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:58:38,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [575920763] [2022-04-28 05:58:38,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [575920763] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:58:38,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:58:38,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 05:58:38,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101278495] [2022-04-28 05:58:38,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:58:38,386 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) Word has length 97 [2022-04-28 05:58:38,386 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:58:38,386 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-28 05:58:38,463 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:58:38,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 05:58:38,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:58:38,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 05:58:38,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-28 05:58:38,464 INFO L87 Difference]: Start difference. First operand 342 states and 456 transitions. Second operand has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-28 05:58:39,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:58:39,644 INFO L93 Difference]: Finished difference Result 467 states and 640 transitions. [2022-04-28 05:58:39,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-28 05:58:39,645 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) Word has length 97 [2022-04-28 05:58:39,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:58:39,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-28 05:58:39,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 218 transitions. [2022-04-28 05:58:39,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-28 05:58:39,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 218 transitions. [2022-04-28 05:58:39,649 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 218 transitions. [2022-04-28 05:58:39,847 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 218 edges. 218 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:58:39,856 INFO L225 Difference]: With dead ends: 467 [2022-04-28 05:58:39,857 INFO L226 Difference]: Without dead ends: 352 [2022-04-28 05:58:39,857 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=383, Invalid=547, Unknown=0, NotChecked=0, Total=930 [2022-04-28 05:58:39,858 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 112 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 05:58:39,858 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 249 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 05:58:39,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2022-04-28 05:58:40,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 344. [2022-04-28 05:58:40,435 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:58:40,435 INFO L82 GeneralOperation]: Start isEquivalent. First operand 352 states. Second operand has 344 states, 257 states have (on average 1.2101167315175096) internal successors, (311), 261 states have internal predecessors, (311), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-28 05:58:40,436 INFO L74 IsIncluded]: Start isIncluded. First operand 352 states. Second operand has 344 states, 257 states have (on average 1.2101167315175096) internal successors, (311), 261 states have internal predecessors, (311), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-28 05:58:40,436 INFO L87 Difference]: Start difference. First operand 352 states. Second operand has 344 states, 257 states have (on average 1.2101167315175096) internal successors, (311), 261 states have internal predecessors, (311), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-28 05:58:40,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:58:40,447 INFO L93 Difference]: Finished difference Result 352 states and 465 transitions. [2022-04-28 05:58:40,449 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 465 transitions. [2022-04-28 05:58:40,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:58:40,450 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:58:40,451 INFO L74 IsIncluded]: Start isIncluded. First operand has 344 states, 257 states have (on average 1.2101167315175096) internal successors, (311), 261 states have internal predecessors, (311), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) Second operand 352 states. [2022-04-28 05:58:40,451 INFO L87 Difference]: Start difference. First operand has 344 states, 257 states have (on average 1.2101167315175096) internal successors, (311), 261 states have internal predecessors, (311), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) Second operand 352 states. [2022-04-28 05:58:40,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:58:40,460 INFO L93 Difference]: Finished difference Result 352 states and 465 transitions. [2022-04-28 05:58:40,460 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 465 transitions. [2022-04-28 05:58:40,461 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:58:40,461 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:58:40,461 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:58:40,461 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:58:40,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 257 states have (on average 1.2101167315175096) internal successors, (311), 261 states have internal predecessors, (311), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-28 05:58:40,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 457 transitions. [2022-04-28 05:58:40,472 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 457 transitions. Word has length 97 [2022-04-28 05:58:40,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:58:40,472 INFO L495 AbstractCegarLoop]: Abstraction has 344 states and 457 transitions. [2022-04-28 05:58:40,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-28 05:58:40,472 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 344 states and 457 transitions. [2022-04-28 05:58:42,745 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 457 edges. 457 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:58:42,745 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 457 transitions. [2022-04-28 05:58:42,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-04-28 05:58:42,746 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:58:42,746 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:58:42,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-04-28 05:58:42,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-04-28 05:58:42,946 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:58:42,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:58:42,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1020733748, now seen corresponding path program 7 times [2022-04-28 05:58:42,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:58:42,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [542146031] [2022-04-28 05:58:42,947 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:58:42,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1020733748, now seen corresponding path program 8 times [2022-04-28 05:58:42,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:58:42,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650617036] [2022-04-28 05:58:42,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:58:42,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:58:42,958 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:58:42,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1005956698] [2022-04-28 05:58:42,959 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:58:42,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:58:42,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:58:42,960 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:58:42,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-04-28 05:58:43,010 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:58:43,010 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:58:43,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-28 05:58:43,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:58:43,033 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:58:43,328 INFO L272 TraceCheckUtils]: 0: Hoare triple {34487#true} call ULTIMATE.init(); {34487#true} is VALID [2022-04-28 05:58:43,328 INFO L290 TraceCheckUtils]: 1: Hoare triple {34487#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {34487#true} is VALID [2022-04-28 05:58:43,328 INFO L290 TraceCheckUtils]: 2: Hoare triple {34487#true} assume true; {34487#true} is VALID [2022-04-28 05:58:43,328 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34487#true} {34487#true} #102#return; {34487#true} is VALID [2022-04-28 05:58:43,328 INFO L272 TraceCheckUtils]: 4: Hoare triple {34487#true} call #t~ret9 := main(); {34487#true} is VALID [2022-04-28 05:58:43,329 INFO L290 TraceCheckUtils]: 5: Hoare triple {34487#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {34487#true} is VALID [2022-04-28 05:58:43,329 INFO L272 TraceCheckUtils]: 6: Hoare triple {34487#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {34487#true} is VALID [2022-04-28 05:58:43,329 INFO L290 TraceCheckUtils]: 7: Hoare triple {34487#true} ~cond := #in~cond; {34487#true} is VALID [2022-04-28 05:58:43,329 INFO L290 TraceCheckUtils]: 8: Hoare triple {34487#true} assume !(0 == ~cond); {34487#true} is VALID [2022-04-28 05:58:43,329 INFO L290 TraceCheckUtils]: 9: Hoare triple {34487#true} assume true; {34487#true} is VALID [2022-04-28 05:58:43,329 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {34487#true} {34487#true} #90#return; {34487#true} is VALID [2022-04-28 05:58:43,329 INFO L272 TraceCheckUtils]: 11: Hoare triple {34487#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {34487#true} is VALID [2022-04-28 05:58:43,329 INFO L290 TraceCheckUtils]: 12: Hoare triple {34487#true} ~cond := #in~cond; {34487#true} is VALID [2022-04-28 05:58:43,329 INFO L290 TraceCheckUtils]: 13: Hoare triple {34487#true} assume !(0 == ~cond); {34487#true} is VALID [2022-04-28 05:58:43,329 INFO L290 TraceCheckUtils]: 14: Hoare triple {34487#true} assume true; {34487#true} is VALID [2022-04-28 05:58:43,329 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {34487#true} {34487#true} #92#return; {34487#true} is VALID [2022-04-28 05:58:43,329 INFO L290 TraceCheckUtils]: 16: Hoare triple {34487#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {34487#true} is VALID [2022-04-28 05:58:43,329 INFO L290 TraceCheckUtils]: 17: Hoare triple {34487#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34487#true} is VALID [2022-04-28 05:58:43,329 INFO L290 TraceCheckUtils]: 18: Hoare triple {34487#true} assume !!(#t~post6 < 20);havoc #t~post6; {34487#true} is VALID [2022-04-28 05:58:43,330 INFO L272 TraceCheckUtils]: 19: Hoare triple {34487#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {34487#true} is VALID [2022-04-28 05:58:43,330 INFO L290 TraceCheckUtils]: 20: Hoare triple {34487#true} ~cond := #in~cond; {34487#true} is VALID [2022-04-28 05:58:43,330 INFO L290 TraceCheckUtils]: 21: Hoare triple {34487#true} assume !(0 == ~cond); {34487#true} is VALID [2022-04-28 05:58:43,330 INFO L290 TraceCheckUtils]: 22: Hoare triple {34487#true} assume true; {34487#true} is VALID [2022-04-28 05:58:43,330 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {34487#true} {34487#true} #94#return; {34487#true} is VALID [2022-04-28 05:58:43,330 INFO L290 TraceCheckUtils]: 24: Hoare triple {34487#true} assume !!(0 != ~r~0); {34487#true} is VALID [2022-04-28 05:58:43,330 INFO L290 TraceCheckUtils]: 25: Hoare triple {34487#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {34487#true} is VALID [2022-04-28 05:58:43,330 INFO L290 TraceCheckUtils]: 26: Hoare triple {34487#true} assume !!(#t~post7 < 20);havoc #t~post7; {34487#true} is VALID [2022-04-28 05:58:43,330 INFO L272 TraceCheckUtils]: 27: Hoare triple {34487#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {34487#true} is VALID [2022-04-28 05:58:43,330 INFO L290 TraceCheckUtils]: 28: Hoare triple {34487#true} ~cond := #in~cond; {34487#true} is VALID [2022-04-28 05:58:43,330 INFO L290 TraceCheckUtils]: 29: Hoare triple {34487#true} assume !(0 == ~cond); {34487#true} is VALID [2022-04-28 05:58:43,330 INFO L290 TraceCheckUtils]: 30: Hoare triple {34487#true} assume true; {34487#true} is VALID [2022-04-28 05:58:43,330 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {34487#true} {34487#true} #96#return; {34487#true} is VALID [2022-04-28 05:58:43,330 INFO L290 TraceCheckUtils]: 32: Hoare triple {34487#true} assume !(~r~0 > 0); {34487#true} is VALID [2022-04-28 05:58:43,331 INFO L290 TraceCheckUtils]: 33: Hoare triple {34487#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {34487#true} is VALID [2022-04-28 05:58:43,331 INFO L290 TraceCheckUtils]: 34: Hoare triple {34487#true} assume !!(#t~post8 < 20);havoc #t~post8; {34487#true} is VALID [2022-04-28 05:58:43,331 INFO L272 TraceCheckUtils]: 35: Hoare triple {34487#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {34487#true} is VALID [2022-04-28 05:58:43,331 INFO L290 TraceCheckUtils]: 36: Hoare triple {34487#true} ~cond := #in~cond; {34487#true} is VALID [2022-04-28 05:58:43,331 INFO L290 TraceCheckUtils]: 37: Hoare triple {34487#true} assume !(0 == ~cond); {34487#true} is VALID [2022-04-28 05:58:43,331 INFO L290 TraceCheckUtils]: 38: Hoare triple {34487#true} assume true; {34487#true} is VALID [2022-04-28 05:58:43,331 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {34487#true} {34487#true} #98#return; {34487#true} is VALID [2022-04-28 05:58:43,331 INFO L290 TraceCheckUtils]: 40: Hoare triple {34487#true} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {34487#true} is VALID [2022-04-28 05:58:43,331 INFO L290 TraceCheckUtils]: 41: Hoare triple {34487#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {34487#true} is VALID [2022-04-28 05:58:43,331 INFO L290 TraceCheckUtils]: 42: Hoare triple {34487#true} assume !!(#t~post8 < 20);havoc #t~post8; {34487#true} is VALID [2022-04-28 05:58:43,331 INFO L272 TraceCheckUtils]: 43: Hoare triple {34487#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {34487#true} is VALID [2022-04-28 05:58:43,331 INFO L290 TraceCheckUtils]: 44: Hoare triple {34487#true} ~cond := #in~cond; {34487#true} is VALID [2022-04-28 05:58:43,331 INFO L290 TraceCheckUtils]: 45: Hoare triple {34487#true} assume !(0 == ~cond); {34487#true} is VALID [2022-04-28 05:58:43,332 INFO L290 TraceCheckUtils]: 46: Hoare triple {34487#true} assume true; {34487#true} is VALID [2022-04-28 05:58:43,332 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {34487#true} {34487#true} #98#return; {34487#true} is VALID [2022-04-28 05:58:43,332 INFO L290 TraceCheckUtils]: 48: Hoare triple {34487#true} assume !(~r~0 < 0); {34487#true} is VALID [2022-04-28 05:58:43,332 INFO L290 TraceCheckUtils]: 49: Hoare triple {34487#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34487#true} is VALID [2022-04-28 05:58:43,332 INFO L290 TraceCheckUtils]: 50: Hoare triple {34487#true} assume !!(#t~post6 < 20);havoc #t~post6; {34487#true} is VALID [2022-04-28 05:58:43,332 INFO L272 TraceCheckUtils]: 51: Hoare triple {34487#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {34487#true} is VALID [2022-04-28 05:58:43,332 INFO L290 TraceCheckUtils]: 52: Hoare triple {34487#true} ~cond := #in~cond; {34487#true} is VALID [2022-04-28 05:58:43,332 INFO L290 TraceCheckUtils]: 53: Hoare triple {34487#true} assume !(0 == ~cond); {34487#true} is VALID [2022-04-28 05:58:43,332 INFO L290 TraceCheckUtils]: 54: Hoare triple {34487#true} assume true; {34487#true} is VALID [2022-04-28 05:58:43,332 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {34487#true} {34487#true} #94#return; {34487#true} is VALID [2022-04-28 05:58:43,332 INFO L290 TraceCheckUtils]: 56: Hoare triple {34487#true} assume !!(0 != ~r~0); {34487#true} is VALID [2022-04-28 05:58:43,332 INFO L290 TraceCheckUtils]: 57: Hoare triple {34487#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {34487#true} is VALID [2022-04-28 05:58:43,332 INFO L290 TraceCheckUtils]: 58: Hoare triple {34487#true} assume !!(#t~post7 < 20);havoc #t~post7; {34487#true} is VALID [2022-04-28 05:58:43,332 INFO L272 TraceCheckUtils]: 59: Hoare triple {34487#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {34487#true} is VALID [2022-04-28 05:58:43,333 INFO L290 TraceCheckUtils]: 60: Hoare triple {34487#true} ~cond := #in~cond; {34487#true} is VALID [2022-04-28 05:58:43,333 INFO L290 TraceCheckUtils]: 61: Hoare triple {34487#true} assume !(0 == ~cond); {34487#true} is VALID [2022-04-28 05:58:43,333 INFO L290 TraceCheckUtils]: 62: Hoare triple {34487#true} assume true; {34487#true} is VALID [2022-04-28 05:58:43,333 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {34487#true} {34487#true} #96#return; {34487#true} is VALID [2022-04-28 05:58:43,333 INFO L290 TraceCheckUtils]: 64: Hoare triple {34487#true} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {34487#true} is VALID [2022-04-28 05:58:43,333 INFO L290 TraceCheckUtils]: 65: Hoare triple {34487#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {34487#true} is VALID [2022-04-28 05:58:43,333 INFO L290 TraceCheckUtils]: 66: Hoare triple {34487#true} assume !!(#t~post7 < 20);havoc #t~post7; {34487#true} is VALID [2022-04-28 05:58:43,333 INFO L272 TraceCheckUtils]: 67: Hoare triple {34487#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {34487#true} is VALID [2022-04-28 05:58:43,333 INFO L290 TraceCheckUtils]: 68: Hoare triple {34487#true} ~cond := #in~cond; {34487#true} is VALID [2022-04-28 05:58:43,333 INFO L290 TraceCheckUtils]: 69: Hoare triple {34487#true} assume !(0 == ~cond); {34487#true} is VALID [2022-04-28 05:58:43,333 INFO L290 TraceCheckUtils]: 70: Hoare triple {34487#true} assume true; {34487#true} is VALID [2022-04-28 05:58:43,333 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {34487#true} {34487#true} #96#return; {34487#true} is VALID [2022-04-28 05:58:43,334 INFO L290 TraceCheckUtils]: 72: Hoare triple {34487#true} assume !(~r~0 > 0); {34708#(not (< 0 main_~r~0))} is VALID [2022-04-28 05:58:43,334 INFO L290 TraceCheckUtils]: 73: Hoare triple {34708#(not (< 0 main_~r~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {34708#(not (< 0 main_~r~0))} is VALID [2022-04-28 05:58:43,335 INFO L290 TraceCheckUtils]: 74: Hoare triple {34708#(not (< 0 main_~r~0))} assume !!(#t~post8 < 20);havoc #t~post8; {34708#(not (< 0 main_~r~0))} is VALID [2022-04-28 05:58:43,335 INFO L272 TraceCheckUtils]: 75: Hoare triple {34708#(not (< 0 main_~r~0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {34487#true} is VALID [2022-04-28 05:58:43,335 INFO L290 TraceCheckUtils]: 76: Hoare triple {34487#true} ~cond := #in~cond; {34487#true} is VALID [2022-04-28 05:58:43,335 INFO L290 TraceCheckUtils]: 77: Hoare triple {34487#true} assume !(0 == ~cond); {34487#true} is VALID [2022-04-28 05:58:43,335 INFO L290 TraceCheckUtils]: 78: Hoare triple {34487#true} assume true; {34487#true} is VALID [2022-04-28 05:58:43,336 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {34487#true} {34708#(not (< 0 main_~r~0))} #98#return; {34708#(not (< 0 main_~r~0))} is VALID [2022-04-28 05:58:43,336 INFO L290 TraceCheckUtils]: 80: Hoare triple {34708#(not (< 0 main_~r~0))} assume !(~r~0 < 0); {34733#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} is VALID [2022-04-28 05:58:43,337 INFO L290 TraceCheckUtils]: 81: Hoare triple {34733#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34733#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} is VALID [2022-04-28 05:58:43,337 INFO L290 TraceCheckUtils]: 82: Hoare triple {34733#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} assume !!(#t~post6 < 20);havoc #t~post6; {34733#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} is VALID [2022-04-28 05:58:43,337 INFO L272 TraceCheckUtils]: 83: Hoare triple {34733#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {34487#true} is VALID [2022-04-28 05:58:43,337 INFO L290 TraceCheckUtils]: 84: Hoare triple {34487#true} ~cond := #in~cond; {34487#true} is VALID [2022-04-28 05:58:43,337 INFO L290 TraceCheckUtils]: 85: Hoare triple {34487#true} assume !(0 == ~cond); {34487#true} is VALID [2022-04-28 05:58:43,337 INFO L290 TraceCheckUtils]: 86: Hoare triple {34487#true} assume true; {34487#true} is VALID [2022-04-28 05:58:43,338 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {34487#true} {34733#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} #94#return; {34733#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} is VALID [2022-04-28 05:58:43,339 INFO L290 TraceCheckUtils]: 88: Hoare triple {34733#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} assume !!(0 != ~r~0); {34488#false} is VALID [2022-04-28 05:58:43,339 INFO L290 TraceCheckUtils]: 89: Hoare triple {34488#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {34488#false} is VALID [2022-04-28 05:58:43,339 INFO L290 TraceCheckUtils]: 90: Hoare triple {34488#false} assume !(#t~post7 < 20);havoc #t~post7; {34488#false} is VALID [2022-04-28 05:58:43,339 INFO L290 TraceCheckUtils]: 91: Hoare triple {34488#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {34488#false} is VALID [2022-04-28 05:58:43,339 INFO L290 TraceCheckUtils]: 92: Hoare triple {34488#false} assume !(#t~post8 < 20);havoc #t~post8; {34488#false} is VALID [2022-04-28 05:58:43,339 INFO L290 TraceCheckUtils]: 93: Hoare triple {34488#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34488#false} is VALID [2022-04-28 05:58:43,339 INFO L290 TraceCheckUtils]: 94: Hoare triple {34488#false} assume !(#t~post6 < 20);havoc #t~post6; {34488#false} is VALID [2022-04-28 05:58:43,339 INFO L272 TraceCheckUtils]: 95: Hoare triple {34488#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {34488#false} is VALID [2022-04-28 05:58:43,339 INFO L290 TraceCheckUtils]: 96: Hoare triple {34488#false} ~cond := #in~cond; {34488#false} is VALID [2022-04-28 05:58:43,339 INFO L290 TraceCheckUtils]: 97: Hoare triple {34488#false} assume 0 == ~cond; {34488#false} is VALID [2022-04-28 05:58:43,339 INFO L290 TraceCheckUtils]: 98: Hoare triple {34488#false} assume !false; {34488#false} is VALID [2022-04-28 05:58:43,340 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2022-04-28 05:58:43,340 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 05:58:43,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:58:43,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650617036] [2022-04-28 05:58:43,340 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:58:43,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1005956698] [2022-04-28 05:58:43,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1005956698] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:58:43,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:58:43,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 05:58:43,341 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:58:43,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [542146031] [2022-04-28 05:58:43,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [542146031] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:58:43,341 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:58:43,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 05:58:43,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464611034] [2022-04-28 05:58:43,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:58:43,341 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 99 [2022-04-28 05:58:43,342 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:58:43,342 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 05:58:43,392 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:58:43,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 05:58:43,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:58:43,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 05:58:43,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-28 05:58:43,395 INFO L87 Difference]: Start difference. First operand 344 states and 457 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 05:58:44,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:58:44,170 INFO L93 Difference]: Finished difference Result 504 states and 675 transitions. [2022-04-28 05:58:44,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 05:58:44,170 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 99 [2022-04-28 05:58:44,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:58:44,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 05:58:44,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2022-04-28 05:58:44,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 05:58:44,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2022-04-28 05:58:44,172 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 94 transitions. [2022-04-28 05:58:44,236 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:58:44,244 INFO L225 Difference]: With dead ends: 504 [2022-04-28 05:58:44,244 INFO L226 Difference]: Without dead ends: 362 [2022-04-28 05:58:44,244 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-28 05:58:44,245 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 12 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 05:58:44,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 122 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 05:58:44,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2022-04-28 05:58:44,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 352. [2022-04-28 05:58:44,781 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:58:44,782 INFO L82 GeneralOperation]: Start isEquivalent. First operand 362 states. Second operand has 352 states, 265 states have (on average 1.2150943396226415) internal successors, (322), 269 states have internal predecessors, (322), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-28 05:58:44,782 INFO L74 IsIncluded]: Start isIncluded. First operand 362 states. Second operand has 352 states, 265 states have (on average 1.2150943396226415) internal successors, (322), 269 states have internal predecessors, (322), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-28 05:58:44,783 INFO L87 Difference]: Start difference. First operand 362 states. Second operand has 352 states, 265 states have (on average 1.2150943396226415) internal successors, (322), 269 states have internal predecessors, (322), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-28 05:58:44,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:58:44,791 INFO L93 Difference]: Finished difference Result 362 states and 481 transitions. [2022-04-28 05:58:44,791 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 481 transitions. [2022-04-28 05:58:44,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:58:44,792 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:58:44,792 INFO L74 IsIncluded]: Start isIncluded. First operand has 352 states, 265 states have (on average 1.2150943396226415) internal successors, (322), 269 states have internal predecessors, (322), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) Second operand 362 states. [2022-04-28 05:58:44,792 INFO L87 Difference]: Start difference. First operand has 352 states, 265 states have (on average 1.2150943396226415) internal successors, (322), 269 states have internal predecessors, (322), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) Second operand 362 states. [2022-04-28 05:58:44,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:58:44,801 INFO L93 Difference]: Finished difference Result 362 states and 481 transitions. [2022-04-28 05:58:44,801 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 481 transitions. [2022-04-28 05:58:44,801 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:58:44,802 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:58:44,802 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:58:44,802 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:58:44,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 265 states have (on average 1.2150943396226415) internal successors, (322), 269 states have internal predecessors, (322), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-28 05:58:44,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 468 transitions. [2022-04-28 05:58:44,810 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 468 transitions. Word has length 99 [2022-04-28 05:58:44,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:58:44,810 INFO L495 AbstractCegarLoop]: Abstraction has 352 states and 468 transitions. [2022-04-28 05:58:44,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 05:58:44,811 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 352 states and 468 transitions. [2022-04-28 05:58:46,074 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 468 edges. 468 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:58:46,075 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 468 transitions. [2022-04-28 05:58:46,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-04-28 05:58:46,076 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:58:46,076 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 6, 5, 5, 5, 4, 3, 3, 2, 2, 2, 2, 2, 2, 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-04-28 05:58:46,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-04-28 05:58:46,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-04-28 05:58:46,276 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:58:46,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:58:46,276 INFO L85 PathProgramCache]: Analyzing trace with hash 359487094, now seen corresponding path program 9 times [2022-04-28 05:58:46,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:58:46,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1599226972] [2022-04-28 05:58:46,277 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:58:46,277 INFO L85 PathProgramCache]: Analyzing trace with hash 359487094, now seen corresponding path program 10 times [2022-04-28 05:58:46,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:58:46,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258599521] [2022-04-28 05:58:46,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:58:46,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:58:46,292 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:58:46,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1394772699] [2022-04-28 05:58:46,293 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 05:58:46,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:58:46,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:58:46,294 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:58:46,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-04-28 05:58:46,447 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 05:58:46,448 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:58:46,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-28 05:58:46,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:58:46,468 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:58:46,937 INFO L272 TraceCheckUtils]: 0: Hoare triple {37223#true} call ULTIMATE.init(); {37223#true} is VALID [2022-04-28 05:58:46,937 INFO L290 TraceCheckUtils]: 1: Hoare triple {37223#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {37231#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:46,938 INFO L290 TraceCheckUtils]: 2: Hoare triple {37231#(<= ~counter~0 0)} assume true; {37231#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:46,938 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37231#(<= ~counter~0 0)} {37223#true} #102#return; {37231#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:46,938 INFO L272 TraceCheckUtils]: 4: Hoare triple {37231#(<= ~counter~0 0)} call #t~ret9 := main(); {37231#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:46,939 INFO L290 TraceCheckUtils]: 5: Hoare triple {37231#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {37231#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:46,939 INFO L272 TraceCheckUtils]: 6: Hoare triple {37231#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {37231#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:46,939 INFO L290 TraceCheckUtils]: 7: Hoare triple {37231#(<= ~counter~0 0)} ~cond := #in~cond; {37231#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:46,940 INFO L290 TraceCheckUtils]: 8: Hoare triple {37231#(<= ~counter~0 0)} assume !(0 == ~cond); {37231#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:46,940 INFO L290 TraceCheckUtils]: 9: Hoare triple {37231#(<= ~counter~0 0)} assume true; {37231#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:46,940 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {37231#(<= ~counter~0 0)} {37231#(<= ~counter~0 0)} #90#return; {37231#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:46,941 INFO L272 TraceCheckUtils]: 11: Hoare triple {37231#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {37231#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:46,941 INFO L290 TraceCheckUtils]: 12: Hoare triple {37231#(<= ~counter~0 0)} ~cond := #in~cond; {37231#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:46,941 INFO L290 TraceCheckUtils]: 13: Hoare triple {37231#(<= ~counter~0 0)} assume !(0 == ~cond); {37231#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:46,941 INFO L290 TraceCheckUtils]: 14: Hoare triple {37231#(<= ~counter~0 0)} assume true; {37231#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:46,942 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {37231#(<= ~counter~0 0)} {37231#(<= ~counter~0 0)} #92#return; {37231#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:46,942 INFO L290 TraceCheckUtils]: 16: Hoare triple {37231#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {37231#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:46,943 INFO L290 TraceCheckUtils]: 17: Hoare triple {37231#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {37280#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:46,943 INFO L290 TraceCheckUtils]: 18: Hoare triple {37280#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {37280#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:46,944 INFO L272 TraceCheckUtils]: 19: Hoare triple {37280#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {37280#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:46,944 INFO L290 TraceCheckUtils]: 20: Hoare triple {37280#(<= ~counter~0 1)} ~cond := #in~cond; {37280#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:46,944 INFO L290 TraceCheckUtils]: 21: Hoare triple {37280#(<= ~counter~0 1)} assume !(0 == ~cond); {37280#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:46,945 INFO L290 TraceCheckUtils]: 22: Hoare triple {37280#(<= ~counter~0 1)} assume true; {37280#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:46,945 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {37280#(<= ~counter~0 1)} {37280#(<= ~counter~0 1)} #94#return; {37280#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:46,945 INFO L290 TraceCheckUtils]: 24: Hoare triple {37280#(<= ~counter~0 1)} assume !!(0 != ~r~0); {37280#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:46,946 INFO L290 TraceCheckUtils]: 25: Hoare triple {37280#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {37305#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:46,946 INFO L290 TraceCheckUtils]: 26: Hoare triple {37305#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {37305#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:46,947 INFO L272 TraceCheckUtils]: 27: Hoare triple {37305#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {37305#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:46,947 INFO L290 TraceCheckUtils]: 28: Hoare triple {37305#(<= ~counter~0 2)} ~cond := #in~cond; {37305#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:46,947 INFO L290 TraceCheckUtils]: 29: Hoare triple {37305#(<= ~counter~0 2)} assume !(0 == ~cond); {37305#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:46,947 INFO L290 TraceCheckUtils]: 30: Hoare triple {37305#(<= ~counter~0 2)} assume true; {37305#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:46,948 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {37305#(<= ~counter~0 2)} {37305#(<= ~counter~0 2)} #96#return; {37305#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:46,948 INFO L290 TraceCheckUtils]: 32: Hoare triple {37305#(<= ~counter~0 2)} assume !(~r~0 > 0); {37305#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:46,949 INFO L290 TraceCheckUtils]: 33: Hoare triple {37305#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {37330#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:46,949 INFO L290 TraceCheckUtils]: 34: Hoare triple {37330#(<= ~counter~0 3)} assume !!(#t~post8 < 20);havoc #t~post8; {37330#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:46,950 INFO L272 TraceCheckUtils]: 35: Hoare triple {37330#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {37330#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:46,950 INFO L290 TraceCheckUtils]: 36: Hoare triple {37330#(<= ~counter~0 3)} ~cond := #in~cond; {37330#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:46,950 INFO L290 TraceCheckUtils]: 37: Hoare triple {37330#(<= ~counter~0 3)} assume !(0 == ~cond); {37330#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:46,950 INFO L290 TraceCheckUtils]: 38: Hoare triple {37330#(<= ~counter~0 3)} assume true; {37330#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:46,951 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {37330#(<= ~counter~0 3)} {37330#(<= ~counter~0 3)} #98#return; {37330#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:46,951 INFO L290 TraceCheckUtils]: 40: Hoare triple {37330#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {37330#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:46,952 INFO L290 TraceCheckUtils]: 41: Hoare triple {37330#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {37355#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:46,952 INFO L290 TraceCheckUtils]: 42: Hoare triple {37355#(<= ~counter~0 4)} assume !!(#t~post8 < 20);havoc #t~post8; {37355#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:46,952 INFO L272 TraceCheckUtils]: 43: Hoare triple {37355#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {37355#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:46,953 INFO L290 TraceCheckUtils]: 44: Hoare triple {37355#(<= ~counter~0 4)} ~cond := #in~cond; {37355#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:46,953 INFO L290 TraceCheckUtils]: 45: Hoare triple {37355#(<= ~counter~0 4)} assume !(0 == ~cond); {37355#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:46,953 INFO L290 TraceCheckUtils]: 46: Hoare triple {37355#(<= ~counter~0 4)} assume true; {37355#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:46,954 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {37355#(<= ~counter~0 4)} {37355#(<= ~counter~0 4)} #98#return; {37355#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:46,954 INFO L290 TraceCheckUtils]: 48: Hoare triple {37355#(<= ~counter~0 4)} assume !(~r~0 < 0); {37355#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:46,954 INFO L290 TraceCheckUtils]: 49: Hoare triple {37355#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {37380#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:46,955 INFO L290 TraceCheckUtils]: 50: Hoare triple {37380#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {37380#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:46,955 INFO L272 TraceCheckUtils]: 51: Hoare triple {37380#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {37380#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:46,956 INFO L290 TraceCheckUtils]: 52: Hoare triple {37380#(<= ~counter~0 5)} ~cond := #in~cond; {37380#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:46,956 INFO L290 TraceCheckUtils]: 53: Hoare triple {37380#(<= ~counter~0 5)} assume !(0 == ~cond); {37380#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:46,956 INFO L290 TraceCheckUtils]: 54: Hoare triple {37380#(<= ~counter~0 5)} assume true; {37380#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:46,957 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {37380#(<= ~counter~0 5)} {37380#(<= ~counter~0 5)} #94#return; {37380#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:46,957 INFO L290 TraceCheckUtils]: 56: Hoare triple {37380#(<= ~counter~0 5)} assume !!(0 != ~r~0); {37380#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:46,957 INFO L290 TraceCheckUtils]: 57: Hoare triple {37380#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {37405#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:46,958 INFO L290 TraceCheckUtils]: 58: Hoare triple {37405#(<= ~counter~0 6)} assume !!(#t~post7 < 20);havoc #t~post7; {37405#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:46,958 INFO L272 TraceCheckUtils]: 59: Hoare triple {37405#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {37405#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:46,958 INFO L290 TraceCheckUtils]: 60: Hoare triple {37405#(<= ~counter~0 6)} ~cond := #in~cond; {37405#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:46,959 INFO L290 TraceCheckUtils]: 61: Hoare triple {37405#(<= ~counter~0 6)} assume !(0 == ~cond); {37405#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:46,959 INFO L290 TraceCheckUtils]: 62: Hoare triple {37405#(<= ~counter~0 6)} assume true; {37405#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:46,959 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {37405#(<= ~counter~0 6)} {37405#(<= ~counter~0 6)} #96#return; {37405#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:46,960 INFO L290 TraceCheckUtils]: 64: Hoare triple {37405#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {37405#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:46,960 INFO L290 TraceCheckUtils]: 65: Hoare triple {37405#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {37430#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:46,960 INFO L290 TraceCheckUtils]: 66: Hoare triple {37430#(<= ~counter~0 7)} assume !!(#t~post7 < 20);havoc #t~post7; {37430#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:46,961 INFO L272 TraceCheckUtils]: 67: Hoare triple {37430#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {37430#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:46,961 INFO L290 TraceCheckUtils]: 68: Hoare triple {37430#(<= ~counter~0 7)} ~cond := #in~cond; {37430#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:46,961 INFO L290 TraceCheckUtils]: 69: Hoare triple {37430#(<= ~counter~0 7)} assume !(0 == ~cond); {37430#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:46,962 INFO L290 TraceCheckUtils]: 70: Hoare triple {37430#(<= ~counter~0 7)} assume true; {37430#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:46,962 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {37430#(<= ~counter~0 7)} {37430#(<= ~counter~0 7)} #96#return; {37430#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:46,962 INFO L290 TraceCheckUtils]: 72: Hoare triple {37430#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {37430#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:46,963 INFO L290 TraceCheckUtils]: 73: Hoare triple {37430#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {37455#(<= ~counter~0 8)} is VALID [2022-04-28 05:58:46,963 INFO L290 TraceCheckUtils]: 74: Hoare triple {37455#(<= ~counter~0 8)} assume !!(#t~post7 < 20);havoc #t~post7; {37455#(<= ~counter~0 8)} is VALID [2022-04-28 05:58:46,964 INFO L272 TraceCheckUtils]: 75: Hoare triple {37455#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {37455#(<= ~counter~0 8)} is VALID [2022-04-28 05:58:46,964 INFO L290 TraceCheckUtils]: 76: Hoare triple {37455#(<= ~counter~0 8)} ~cond := #in~cond; {37455#(<= ~counter~0 8)} is VALID [2022-04-28 05:58:46,964 INFO L290 TraceCheckUtils]: 77: Hoare triple {37455#(<= ~counter~0 8)} assume !(0 == ~cond); {37455#(<= ~counter~0 8)} is VALID [2022-04-28 05:58:46,965 INFO L290 TraceCheckUtils]: 78: Hoare triple {37455#(<= ~counter~0 8)} assume true; {37455#(<= ~counter~0 8)} is VALID [2022-04-28 05:58:46,965 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {37455#(<= ~counter~0 8)} {37455#(<= ~counter~0 8)} #96#return; {37455#(<= ~counter~0 8)} is VALID [2022-04-28 05:58:46,965 INFO L290 TraceCheckUtils]: 80: Hoare triple {37455#(<= ~counter~0 8)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {37455#(<= ~counter~0 8)} is VALID [2022-04-28 05:58:46,966 INFO L290 TraceCheckUtils]: 81: Hoare triple {37455#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {37480#(<= ~counter~0 9)} is VALID [2022-04-28 05:58:46,966 INFO L290 TraceCheckUtils]: 82: Hoare triple {37480#(<= ~counter~0 9)} assume !!(#t~post7 < 20);havoc #t~post7; {37480#(<= ~counter~0 9)} is VALID [2022-04-28 05:58:46,967 INFO L272 TraceCheckUtils]: 83: Hoare triple {37480#(<= ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {37480#(<= ~counter~0 9)} is VALID [2022-04-28 05:58:46,967 INFO L290 TraceCheckUtils]: 84: Hoare triple {37480#(<= ~counter~0 9)} ~cond := #in~cond; {37480#(<= ~counter~0 9)} is VALID [2022-04-28 05:58:46,967 INFO L290 TraceCheckUtils]: 85: Hoare triple {37480#(<= ~counter~0 9)} assume !(0 == ~cond); {37480#(<= ~counter~0 9)} is VALID [2022-04-28 05:58:46,967 INFO L290 TraceCheckUtils]: 86: Hoare triple {37480#(<= ~counter~0 9)} assume true; {37480#(<= ~counter~0 9)} is VALID [2022-04-28 05:58:46,968 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {37480#(<= ~counter~0 9)} {37480#(<= ~counter~0 9)} #96#return; {37480#(<= ~counter~0 9)} is VALID [2022-04-28 05:58:46,975 INFO L290 TraceCheckUtils]: 88: Hoare triple {37480#(<= ~counter~0 9)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {37480#(<= ~counter~0 9)} is VALID [2022-04-28 05:58:46,976 INFO L290 TraceCheckUtils]: 89: Hoare triple {37480#(<= ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {37505#(<= |main_#t~post7| 9)} is VALID [2022-04-28 05:58:46,976 INFO L290 TraceCheckUtils]: 90: Hoare triple {37505#(<= |main_#t~post7| 9)} assume !(#t~post7 < 20);havoc #t~post7; {37224#false} is VALID [2022-04-28 05:58:46,976 INFO L290 TraceCheckUtils]: 91: Hoare triple {37224#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {37224#false} is VALID [2022-04-28 05:58:46,976 INFO L290 TraceCheckUtils]: 92: Hoare triple {37224#false} assume !(#t~post8 < 20);havoc #t~post8; {37224#false} is VALID [2022-04-28 05:58:46,977 INFO L290 TraceCheckUtils]: 93: Hoare triple {37224#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {37224#false} is VALID [2022-04-28 05:58:46,977 INFO L290 TraceCheckUtils]: 94: Hoare triple {37224#false} assume !(#t~post6 < 20);havoc #t~post6; {37224#false} is VALID [2022-04-28 05:58:46,977 INFO L272 TraceCheckUtils]: 95: Hoare triple {37224#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {37224#false} is VALID [2022-04-28 05:58:46,977 INFO L290 TraceCheckUtils]: 96: Hoare triple {37224#false} ~cond := #in~cond; {37224#false} is VALID [2022-04-28 05:58:46,977 INFO L290 TraceCheckUtils]: 97: Hoare triple {37224#false} assume 0 == ~cond; {37224#false} is VALID [2022-04-28 05:58:46,977 INFO L290 TraceCheckUtils]: 98: Hoare triple {37224#false} assume !false; {37224#false} is VALID [2022-04-28 05:58:46,977 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 26 proven. 202 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 05:58:46,977 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:58:47,547 INFO L290 TraceCheckUtils]: 98: Hoare triple {37224#false} assume !false; {37224#false} is VALID [2022-04-28 05:58:47,547 INFO L290 TraceCheckUtils]: 97: Hoare triple {37224#false} assume 0 == ~cond; {37224#false} is VALID [2022-04-28 05:58:47,548 INFO L290 TraceCheckUtils]: 96: Hoare triple {37224#false} ~cond := #in~cond; {37224#false} is VALID [2022-04-28 05:58:47,548 INFO L272 TraceCheckUtils]: 95: Hoare triple {37224#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {37224#false} is VALID [2022-04-28 05:58:47,548 INFO L290 TraceCheckUtils]: 94: Hoare triple {37224#false} assume !(#t~post6 < 20);havoc #t~post6; {37224#false} is VALID [2022-04-28 05:58:47,548 INFO L290 TraceCheckUtils]: 93: Hoare triple {37224#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {37224#false} is VALID [2022-04-28 05:58:47,548 INFO L290 TraceCheckUtils]: 92: Hoare triple {37224#false} assume !(#t~post8 < 20);havoc #t~post8; {37224#false} is VALID [2022-04-28 05:58:47,548 INFO L290 TraceCheckUtils]: 91: Hoare triple {37224#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {37224#false} is VALID [2022-04-28 05:58:47,550 INFO L290 TraceCheckUtils]: 90: Hoare triple {37557#(< |main_#t~post7| 20)} assume !(#t~post7 < 20);havoc #t~post7; {37224#false} is VALID [2022-04-28 05:58:47,550 INFO L290 TraceCheckUtils]: 89: Hoare triple {37561#(< ~counter~0 20)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {37557#(< |main_#t~post7| 20)} is VALID [2022-04-28 05:58:47,551 INFO L290 TraceCheckUtils]: 88: Hoare triple {37561#(< ~counter~0 20)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {37561#(< ~counter~0 20)} is VALID [2022-04-28 05:58:47,551 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {37223#true} {37561#(< ~counter~0 20)} #96#return; {37561#(< ~counter~0 20)} is VALID [2022-04-28 05:58:47,551 INFO L290 TraceCheckUtils]: 86: Hoare triple {37223#true} assume true; {37223#true} is VALID [2022-04-28 05:58:47,551 INFO L290 TraceCheckUtils]: 85: Hoare triple {37223#true} assume !(0 == ~cond); {37223#true} is VALID [2022-04-28 05:58:47,551 INFO L290 TraceCheckUtils]: 84: Hoare triple {37223#true} ~cond := #in~cond; {37223#true} is VALID [2022-04-28 05:58:47,551 INFO L272 TraceCheckUtils]: 83: Hoare triple {37561#(< ~counter~0 20)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {37223#true} is VALID [2022-04-28 05:58:47,552 INFO L290 TraceCheckUtils]: 82: Hoare triple {37561#(< ~counter~0 20)} assume !!(#t~post7 < 20);havoc #t~post7; {37561#(< ~counter~0 20)} is VALID [2022-04-28 05:58:47,553 INFO L290 TraceCheckUtils]: 81: Hoare triple {37586#(< ~counter~0 19)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {37561#(< ~counter~0 20)} is VALID [2022-04-28 05:58:47,553 INFO L290 TraceCheckUtils]: 80: Hoare triple {37586#(< ~counter~0 19)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {37586#(< ~counter~0 19)} is VALID [2022-04-28 05:58:47,553 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {37223#true} {37586#(< ~counter~0 19)} #96#return; {37586#(< ~counter~0 19)} is VALID [2022-04-28 05:58:47,553 INFO L290 TraceCheckUtils]: 78: Hoare triple {37223#true} assume true; {37223#true} is VALID [2022-04-28 05:58:47,553 INFO L290 TraceCheckUtils]: 77: Hoare triple {37223#true} assume !(0 == ~cond); {37223#true} is VALID [2022-04-28 05:58:47,553 INFO L290 TraceCheckUtils]: 76: Hoare triple {37223#true} ~cond := #in~cond; {37223#true} is VALID [2022-04-28 05:58:47,554 INFO L272 TraceCheckUtils]: 75: Hoare triple {37586#(< ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {37223#true} is VALID [2022-04-28 05:58:47,554 INFO L290 TraceCheckUtils]: 74: Hoare triple {37586#(< ~counter~0 19)} assume !!(#t~post7 < 20);havoc #t~post7; {37586#(< ~counter~0 19)} is VALID [2022-04-28 05:58:47,554 INFO L290 TraceCheckUtils]: 73: Hoare triple {37611#(< ~counter~0 18)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {37586#(< ~counter~0 19)} is VALID [2022-04-28 05:58:47,555 INFO L290 TraceCheckUtils]: 72: Hoare triple {37611#(< ~counter~0 18)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {37611#(< ~counter~0 18)} is VALID [2022-04-28 05:58:47,555 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {37223#true} {37611#(< ~counter~0 18)} #96#return; {37611#(< ~counter~0 18)} is VALID [2022-04-28 05:58:47,555 INFO L290 TraceCheckUtils]: 70: Hoare triple {37223#true} assume true; {37223#true} is VALID [2022-04-28 05:58:47,555 INFO L290 TraceCheckUtils]: 69: Hoare triple {37223#true} assume !(0 == ~cond); {37223#true} is VALID [2022-04-28 05:58:47,555 INFO L290 TraceCheckUtils]: 68: Hoare triple {37223#true} ~cond := #in~cond; {37223#true} is VALID [2022-04-28 05:58:47,555 INFO L272 TraceCheckUtils]: 67: Hoare triple {37611#(< ~counter~0 18)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {37223#true} is VALID [2022-04-28 05:58:47,556 INFO L290 TraceCheckUtils]: 66: Hoare triple {37611#(< ~counter~0 18)} assume !!(#t~post7 < 20);havoc #t~post7; {37611#(< ~counter~0 18)} is VALID [2022-04-28 05:58:47,556 INFO L290 TraceCheckUtils]: 65: Hoare triple {37636#(< ~counter~0 17)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {37611#(< ~counter~0 18)} is VALID [2022-04-28 05:58:47,556 INFO L290 TraceCheckUtils]: 64: Hoare triple {37636#(< ~counter~0 17)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {37636#(< ~counter~0 17)} is VALID [2022-04-28 05:58:47,557 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {37223#true} {37636#(< ~counter~0 17)} #96#return; {37636#(< ~counter~0 17)} is VALID [2022-04-28 05:58:47,557 INFO L290 TraceCheckUtils]: 62: Hoare triple {37223#true} assume true; {37223#true} is VALID [2022-04-28 05:58:47,557 INFO L290 TraceCheckUtils]: 61: Hoare triple {37223#true} assume !(0 == ~cond); {37223#true} is VALID [2022-04-28 05:58:47,557 INFO L290 TraceCheckUtils]: 60: Hoare triple {37223#true} ~cond := #in~cond; {37223#true} is VALID [2022-04-28 05:58:47,557 INFO L272 TraceCheckUtils]: 59: Hoare triple {37636#(< ~counter~0 17)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {37223#true} is VALID [2022-04-28 05:58:47,557 INFO L290 TraceCheckUtils]: 58: Hoare triple {37636#(< ~counter~0 17)} assume !!(#t~post7 < 20);havoc #t~post7; {37636#(< ~counter~0 17)} is VALID [2022-04-28 05:58:47,558 INFO L290 TraceCheckUtils]: 57: Hoare triple {37661#(< ~counter~0 16)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {37636#(< ~counter~0 17)} is VALID [2022-04-28 05:58:47,558 INFO L290 TraceCheckUtils]: 56: Hoare triple {37661#(< ~counter~0 16)} assume !!(0 != ~r~0); {37661#(< ~counter~0 16)} is VALID [2022-04-28 05:58:47,559 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {37223#true} {37661#(< ~counter~0 16)} #94#return; {37661#(< ~counter~0 16)} is VALID [2022-04-28 05:58:47,559 INFO L290 TraceCheckUtils]: 54: Hoare triple {37223#true} assume true; {37223#true} is VALID [2022-04-28 05:58:47,559 INFO L290 TraceCheckUtils]: 53: Hoare triple {37223#true} assume !(0 == ~cond); {37223#true} is VALID [2022-04-28 05:58:47,559 INFO L290 TraceCheckUtils]: 52: Hoare triple {37223#true} ~cond := #in~cond; {37223#true} is VALID [2022-04-28 05:58:47,559 INFO L272 TraceCheckUtils]: 51: Hoare triple {37661#(< ~counter~0 16)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {37223#true} is VALID [2022-04-28 05:58:47,559 INFO L290 TraceCheckUtils]: 50: Hoare triple {37661#(< ~counter~0 16)} assume !!(#t~post6 < 20);havoc #t~post6; {37661#(< ~counter~0 16)} is VALID [2022-04-28 05:58:47,560 INFO L290 TraceCheckUtils]: 49: Hoare triple {37686#(< ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {37661#(< ~counter~0 16)} is VALID [2022-04-28 05:58:47,560 INFO L290 TraceCheckUtils]: 48: Hoare triple {37686#(< ~counter~0 15)} assume !(~r~0 < 0); {37686#(< ~counter~0 15)} is VALID [2022-04-28 05:58:47,560 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {37223#true} {37686#(< ~counter~0 15)} #98#return; {37686#(< ~counter~0 15)} is VALID [2022-04-28 05:58:47,561 INFO L290 TraceCheckUtils]: 46: Hoare triple {37223#true} assume true; {37223#true} is VALID [2022-04-28 05:58:47,561 INFO L290 TraceCheckUtils]: 45: Hoare triple {37223#true} assume !(0 == ~cond); {37223#true} is VALID [2022-04-28 05:58:47,561 INFO L290 TraceCheckUtils]: 44: Hoare triple {37223#true} ~cond := #in~cond; {37223#true} is VALID [2022-04-28 05:58:47,561 INFO L272 TraceCheckUtils]: 43: Hoare triple {37686#(< ~counter~0 15)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {37223#true} is VALID [2022-04-28 05:58:47,561 INFO L290 TraceCheckUtils]: 42: Hoare triple {37686#(< ~counter~0 15)} assume !!(#t~post8 < 20);havoc #t~post8; {37686#(< ~counter~0 15)} is VALID [2022-04-28 05:58:47,561 INFO L290 TraceCheckUtils]: 41: Hoare triple {37711#(< ~counter~0 14)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {37686#(< ~counter~0 15)} is VALID [2022-04-28 05:58:47,562 INFO L290 TraceCheckUtils]: 40: Hoare triple {37711#(< ~counter~0 14)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {37711#(< ~counter~0 14)} is VALID [2022-04-28 05:58:47,562 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {37223#true} {37711#(< ~counter~0 14)} #98#return; {37711#(< ~counter~0 14)} is VALID [2022-04-28 05:58:47,562 INFO L290 TraceCheckUtils]: 38: Hoare triple {37223#true} assume true; {37223#true} is VALID [2022-04-28 05:58:47,562 INFO L290 TraceCheckUtils]: 37: Hoare triple {37223#true} assume !(0 == ~cond); {37223#true} is VALID [2022-04-28 05:58:47,562 INFO L290 TraceCheckUtils]: 36: Hoare triple {37223#true} ~cond := #in~cond; {37223#true} is VALID [2022-04-28 05:58:47,562 INFO L272 TraceCheckUtils]: 35: Hoare triple {37711#(< ~counter~0 14)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {37223#true} is VALID [2022-04-28 05:58:47,563 INFO L290 TraceCheckUtils]: 34: Hoare triple {37711#(< ~counter~0 14)} assume !!(#t~post8 < 20);havoc #t~post8; {37711#(< ~counter~0 14)} is VALID [2022-04-28 05:58:47,563 INFO L290 TraceCheckUtils]: 33: Hoare triple {37736#(< ~counter~0 13)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {37711#(< ~counter~0 14)} is VALID [2022-04-28 05:58:47,564 INFO L290 TraceCheckUtils]: 32: Hoare triple {37736#(< ~counter~0 13)} assume !(~r~0 > 0); {37736#(< ~counter~0 13)} is VALID [2022-04-28 05:58:47,564 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {37223#true} {37736#(< ~counter~0 13)} #96#return; {37736#(< ~counter~0 13)} is VALID [2022-04-28 05:58:47,564 INFO L290 TraceCheckUtils]: 30: Hoare triple {37223#true} assume true; {37223#true} is VALID [2022-04-28 05:58:47,564 INFO L290 TraceCheckUtils]: 29: Hoare triple {37223#true} assume !(0 == ~cond); {37223#true} is VALID [2022-04-28 05:58:47,564 INFO L290 TraceCheckUtils]: 28: Hoare triple {37223#true} ~cond := #in~cond; {37223#true} is VALID [2022-04-28 05:58:47,564 INFO L272 TraceCheckUtils]: 27: Hoare triple {37736#(< ~counter~0 13)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {37223#true} is VALID [2022-04-28 05:58:47,564 INFO L290 TraceCheckUtils]: 26: Hoare triple {37736#(< ~counter~0 13)} assume !!(#t~post7 < 20);havoc #t~post7; {37736#(< ~counter~0 13)} is VALID [2022-04-28 05:58:47,565 INFO L290 TraceCheckUtils]: 25: Hoare triple {37761#(< ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {37736#(< ~counter~0 13)} is VALID [2022-04-28 05:58:47,565 INFO L290 TraceCheckUtils]: 24: Hoare triple {37761#(< ~counter~0 12)} assume !!(0 != ~r~0); {37761#(< ~counter~0 12)} is VALID [2022-04-28 05:58:47,566 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {37223#true} {37761#(< ~counter~0 12)} #94#return; {37761#(< ~counter~0 12)} is VALID [2022-04-28 05:58:47,566 INFO L290 TraceCheckUtils]: 22: Hoare triple {37223#true} assume true; {37223#true} is VALID [2022-04-28 05:58:47,566 INFO L290 TraceCheckUtils]: 21: Hoare triple {37223#true} assume !(0 == ~cond); {37223#true} is VALID [2022-04-28 05:58:47,566 INFO L290 TraceCheckUtils]: 20: Hoare triple {37223#true} ~cond := #in~cond; {37223#true} is VALID [2022-04-28 05:58:47,566 INFO L272 TraceCheckUtils]: 19: Hoare triple {37761#(< ~counter~0 12)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {37223#true} is VALID [2022-04-28 05:58:47,566 INFO L290 TraceCheckUtils]: 18: Hoare triple {37761#(< ~counter~0 12)} assume !!(#t~post6 < 20);havoc #t~post6; {37761#(< ~counter~0 12)} is VALID [2022-04-28 05:58:47,567 INFO L290 TraceCheckUtils]: 17: Hoare triple {37786#(< ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {37761#(< ~counter~0 12)} is VALID [2022-04-28 05:58:47,567 INFO L290 TraceCheckUtils]: 16: Hoare triple {37786#(< ~counter~0 11)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {37786#(< ~counter~0 11)} is VALID [2022-04-28 05:58:47,567 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {37223#true} {37786#(< ~counter~0 11)} #92#return; {37786#(< ~counter~0 11)} is VALID [2022-04-28 05:58:47,568 INFO L290 TraceCheckUtils]: 14: Hoare triple {37223#true} assume true; {37223#true} is VALID [2022-04-28 05:58:47,568 INFO L290 TraceCheckUtils]: 13: Hoare triple {37223#true} assume !(0 == ~cond); {37223#true} is VALID [2022-04-28 05:58:47,568 INFO L290 TraceCheckUtils]: 12: Hoare triple {37223#true} ~cond := #in~cond; {37223#true} is VALID [2022-04-28 05:58:47,568 INFO L272 TraceCheckUtils]: 11: Hoare triple {37786#(< ~counter~0 11)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {37223#true} is VALID [2022-04-28 05:58:47,568 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {37223#true} {37786#(< ~counter~0 11)} #90#return; {37786#(< ~counter~0 11)} is VALID [2022-04-28 05:58:47,568 INFO L290 TraceCheckUtils]: 9: Hoare triple {37223#true} assume true; {37223#true} is VALID [2022-04-28 05:58:47,568 INFO L290 TraceCheckUtils]: 8: Hoare triple {37223#true} assume !(0 == ~cond); {37223#true} is VALID [2022-04-28 05:58:47,568 INFO L290 TraceCheckUtils]: 7: Hoare triple {37223#true} ~cond := #in~cond; {37223#true} is VALID [2022-04-28 05:58:47,568 INFO L272 TraceCheckUtils]: 6: Hoare triple {37786#(< ~counter~0 11)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {37223#true} is VALID [2022-04-28 05:58:47,569 INFO L290 TraceCheckUtils]: 5: Hoare triple {37786#(< ~counter~0 11)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {37786#(< ~counter~0 11)} is VALID [2022-04-28 05:58:47,569 INFO L272 TraceCheckUtils]: 4: Hoare triple {37786#(< ~counter~0 11)} call #t~ret9 := main(); {37786#(< ~counter~0 11)} is VALID [2022-04-28 05:58:47,569 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37786#(< ~counter~0 11)} {37223#true} #102#return; {37786#(< ~counter~0 11)} is VALID [2022-04-28 05:58:47,569 INFO L290 TraceCheckUtils]: 2: Hoare triple {37786#(< ~counter~0 11)} assume true; {37786#(< ~counter~0 11)} is VALID [2022-04-28 05:58:47,570 INFO L290 TraceCheckUtils]: 1: Hoare triple {37223#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {37786#(< ~counter~0 11)} is VALID [2022-04-28 05:58:47,570 INFO L272 TraceCheckUtils]: 0: Hoare triple {37223#true} call ULTIMATE.init(); {37223#true} is VALID [2022-04-28 05:58:47,570 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 26 proven. 58 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-04-28 05:58:47,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:58:47,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258599521] [2022-04-28 05:58:47,570 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:58:47,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394772699] [2022-04-28 05:58:47,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394772699] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:58:47,571 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:58:47,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2022-04-28 05:58:47,571 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:58:47,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1599226972] [2022-04-28 05:58:47,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1599226972] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:58:47,571 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:58:47,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 05:58:47,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358757523] [2022-04-28 05:58:47,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:58:47,571 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 12 states have internal predecessors, (70), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) Word has length 99 [2022-04-28 05:58:47,572 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:58:47,572 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 12 states have internal predecessors, (70), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-28 05:58:47,646 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:58:47,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 05:58:47,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:58:47,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 05:58:47,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-28 05:58:47,647 INFO L87 Difference]: Start difference. First operand 352 states and 468 transitions. Second operand has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 12 states have internal predecessors, (70), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-28 05:58:48,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:58:48,768 INFO L93 Difference]: Finished difference Result 471 states and 642 transitions. [2022-04-28 05:58:48,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-28 05:58:48,768 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 12 states have internal predecessors, (70), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) Word has length 99 [2022-04-28 05:58:48,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:58:48,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 12 states have internal predecessors, (70), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-28 05:58:48,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 216 transitions. [2022-04-28 05:58:48,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 12 states have internal predecessors, (70), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-28 05:58:48,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 216 transitions. [2022-04-28 05:58:48,773 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 216 transitions. [2022-04-28 05:58:48,982 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 216 edges. 216 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:58:48,996 INFO L225 Difference]: With dead ends: 471 [2022-04-28 05:58:48,996 INFO L226 Difference]: Without dead ends: 364 [2022-04-28 05:58:48,997 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=412, Invalid=580, Unknown=0, NotChecked=0, Total=992 [2022-04-28 05:58:48,998 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 110 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 05:58:48,998 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 238 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 05:58:48,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2022-04-28 05:58:49,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 364. [2022-04-28 05:58:49,603 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:58:49,604 INFO L82 GeneralOperation]: Start isEquivalent. First operand 364 states. Second operand has 364 states, 277 states have (on average 1.2057761732851986) internal successors, (334), 277 states have internal predecessors, (334), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-28 05:58:49,604 INFO L74 IsIncluded]: Start isIncluded. First operand 364 states. Second operand has 364 states, 277 states have (on average 1.2057761732851986) internal successors, (334), 277 states have internal predecessors, (334), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-28 05:58:49,605 INFO L87 Difference]: Start difference. First operand 364 states. Second operand has 364 states, 277 states have (on average 1.2057761732851986) internal successors, (334), 277 states have internal predecessors, (334), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-28 05:58:49,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:58:49,613 INFO L93 Difference]: Finished difference Result 364 states and 480 transitions. [2022-04-28 05:58:49,613 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 480 transitions. [2022-04-28 05:58:49,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:58:49,614 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:58:49,614 INFO L74 IsIncluded]: Start isIncluded. First operand has 364 states, 277 states have (on average 1.2057761732851986) internal successors, (334), 277 states have internal predecessors, (334), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) Second operand 364 states. [2022-04-28 05:58:49,615 INFO L87 Difference]: Start difference. First operand has 364 states, 277 states have (on average 1.2057761732851986) internal successors, (334), 277 states have internal predecessors, (334), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) Second operand 364 states. [2022-04-28 05:58:49,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:58:49,623 INFO L93 Difference]: Finished difference Result 364 states and 480 transitions. [2022-04-28 05:58:49,623 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 480 transitions. [2022-04-28 05:58:49,623 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:58:49,623 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:58:49,623 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:58:49,624 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:58:49,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 277 states have (on average 1.2057761732851986) internal successors, (334), 277 states have internal predecessors, (334), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-28 05:58:49,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 480 transitions. [2022-04-28 05:58:49,634 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 480 transitions. Word has length 99 [2022-04-28 05:58:49,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:58:49,634 INFO L495 AbstractCegarLoop]: Abstraction has 364 states and 480 transitions. [2022-04-28 05:58:49,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 12 states have internal predecessors, (70), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-28 05:58:49,634 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 364 states and 480 transitions. [2022-04-28 05:58:51,485 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 480 edges. 480 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:58:51,485 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 480 transitions. [2022-04-28 05:58:51,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-04-28 05:58:51,486 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:58:51,486 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:58:51,502 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-04-28 05:58:51,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:58:51,687 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:58:51,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:58:51,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1761003221, now seen corresponding path program 3 times [2022-04-28 05:58:51,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:58:51,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [210932375] [2022-04-28 05:58:51,687 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:58:51,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1761003221, now seen corresponding path program 4 times [2022-04-28 05:58:51,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:58:51,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791030274] [2022-04-28 05:58:51,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:58:51,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:58:51,699 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:58:51,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [569394808] [2022-04-28 05:58:51,699 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 05:58:51,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:58:51,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:58:51,700 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:58:51,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-04-28 05:58:51,802 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 05:58:51,802 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:58:51,803 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-28 05:58:51,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:58:51,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:58:52,319 INFO L272 TraceCheckUtils]: 0: Hoare triple {40254#true} call ULTIMATE.init(); {40254#true} is VALID [2022-04-28 05:58:52,319 INFO L290 TraceCheckUtils]: 1: Hoare triple {40254#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {40262#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:52,319 INFO L290 TraceCheckUtils]: 2: Hoare triple {40262#(<= ~counter~0 0)} assume true; {40262#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:52,320 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40262#(<= ~counter~0 0)} {40254#true} #102#return; {40262#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:52,320 INFO L272 TraceCheckUtils]: 4: Hoare triple {40262#(<= ~counter~0 0)} call #t~ret9 := main(); {40262#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:52,320 INFO L290 TraceCheckUtils]: 5: Hoare triple {40262#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {40262#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:52,321 INFO L272 TraceCheckUtils]: 6: Hoare triple {40262#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {40262#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:52,321 INFO L290 TraceCheckUtils]: 7: Hoare triple {40262#(<= ~counter~0 0)} ~cond := #in~cond; {40262#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:52,321 INFO L290 TraceCheckUtils]: 8: Hoare triple {40262#(<= ~counter~0 0)} assume !(0 == ~cond); {40262#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:52,322 INFO L290 TraceCheckUtils]: 9: Hoare triple {40262#(<= ~counter~0 0)} assume true; {40262#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:52,322 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {40262#(<= ~counter~0 0)} {40262#(<= ~counter~0 0)} #90#return; {40262#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:52,322 INFO L272 TraceCheckUtils]: 11: Hoare triple {40262#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {40262#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:52,323 INFO L290 TraceCheckUtils]: 12: Hoare triple {40262#(<= ~counter~0 0)} ~cond := #in~cond; {40262#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:52,323 INFO L290 TraceCheckUtils]: 13: Hoare triple {40262#(<= ~counter~0 0)} assume !(0 == ~cond); {40262#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:52,323 INFO L290 TraceCheckUtils]: 14: Hoare triple {40262#(<= ~counter~0 0)} assume true; {40262#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:52,324 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {40262#(<= ~counter~0 0)} {40262#(<= ~counter~0 0)} #92#return; {40262#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:52,324 INFO L290 TraceCheckUtils]: 16: Hoare triple {40262#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {40262#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:52,325 INFO L290 TraceCheckUtils]: 17: Hoare triple {40262#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {40311#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:52,325 INFO L290 TraceCheckUtils]: 18: Hoare triple {40311#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {40311#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:52,326 INFO L272 TraceCheckUtils]: 19: Hoare triple {40311#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {40311#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:52,326 INFO L290 TraceCheckUtils]: 20: Hoare triple {40311#(<= ~counter~0 1)} ~cond := #in~cond; {40311#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:52,327 INFO L290 TraceCheckUtils]: 21: Hoare triple {40311#(<= ~counter~0 1)} assume !(0 == ~cond); {40311#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:52,327 INFO L290 TraceCheckUtils]: 22: Hoare triple {40311#(<= ~counter~0 1)} assume true; {40311#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:52,327 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {40311#(<= ~counter~0 1)} {40311#(<= ~counter~0 1)} #94#return; {40311#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:52,328 INFO L290 TraceCheckUtils]: 24: Hoare triple {40311#(<= ~counter~0 1)} assume !!(0 != ~r~0); {40311#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:52,328 INFO L290 TraceCheckUtils]: 25: Hoare triple {40311#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {40336#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:52,329 INFO L290 TraceCheckUtils]: 26: Hoare triple {40336#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {40336#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:52,329 INFO L272 TraceCheckUtils]: 27: Hoare triple {40336#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {40336#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:52,329 INFO L290 TraceCheckUtils]: 28: Hoare triple {40336#(<= ~counter~0 2)} ~cond := #in~cond; {40336#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:52,330 INFO L290 TraceCheckUtils]: 29: Hoare triple {40336#(<= ~counter~0 2)} assume !(0 == ~cond); {40336#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:52,330 INFO L290 TraceCheckUtils]: 30: Hoare triple {40336#(<= ~counter~0 2)} assume true; {40336#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:52,330 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {40336#(<= ~counter~0 2)} {40336#(<= ~counter~0 2)} #96#return; {40336#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:52,331 INFO L290 TraceCheckUtils]: 32: Hoare triple {40336#(<= ~counter~0 2)} assume !(~r~0 > 0); {40336#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:52,331 INFO L290 TraceCheckUtils]: 33: Hoare triple {40336#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {40361#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:52,332 INFO L290 TraceCheckUtils]: 34: Hoare triple {40361#(<= ~counter~0 3)} assume !!(#t~post8 < 20);havoc #t~post8; {40361#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:52,332 INFO L272 TraceCheckUtils]: 35: Hoare triple {40361#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {40361#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:52,332 INFO L290 TraceCheckUtils]: 36: Hoare triple {40361#(<= ~counter~0 3)} ~cond := #in~cond; {40361#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:52,333 INFO L290 TraceCheckUtils]: 37: Hoare triple {40361#(<= ~counter~0 3)} assume !(0 == ~cond); {40361#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:52,333 INFO L290 TraceCheckUtils]: 38: Hoare triple {40361#(<= ~counter~0 3)} assume true; {40361#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:52,333 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {40361#(<= ~counter~0 3)} {40361#(<= ~counter~0 3)} #98#return; {40361#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:52,334 INFO L290 TraceCheckUtils]: 40: Hoare triple {40361#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {40361#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:52,334 INFO L290 TraceCheckUtils]: 41: Hoare triple {40361#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {40386#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:52,334 INFO L290 TraceCheckUtils]: 42: Hoare triple {40386#(<= ~counter~0 4)} assume !!(#t~post8 < 20);havoc #t~post8; {40386#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:52,335 INFO L272 TraceCheckUtils]: 43: Hoare triple {40386#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {40386#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:52,335 INFO L290 TraceCheckUtils]: 44: Hoare triple {40386#(<= ~counter~0 4)} ~cond := #in~cond; {40386#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:52,335 INFO L290 TraceCheckUtils]: 45: Hoare triple {40386#(<= ~counter~0 4)} assume !(0 == ~cond); {40386#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:52,336 INFO L290 TraceCheckUtils]: 46: Hoare triple {40386#(<= ~counter~0 4)} assume true; {40386#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:52,336 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {40386#(<= ~counter~0 4)} {40386#(<= ~counter~0 4)} #98#return; {40386#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:52,336 INFO L290 TraceCheckUtils]: 48: Hoare triple {40386#(<= ~counter~0 4)} assume !(~r~0 < 0); {40386#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:52,337 INFO L290 TraceCheckUtils]: 49: Hoare triple {40386#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {40411#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:52,337 INFO L290 TraceCheckUtils]: 50: Hoare triple {40411#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {40411#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:52,338 INFO L272 TraceCheckUtils]: 51: Hoare triple {40411#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {40411#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:52,338 INFO L290 TraceCheckUtils]: 52: Hoare triple {40411#(<= ~counter~0 5)} ~cond := #in~cond; {40411#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:52,338 INFO L290 TraceCheckUtils]: 53: Hoare triple {40411#(<= ~counter~0 5)} assume !(0 == ~cond); {40411#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:52,339 INFO L290 TraceCheckUtils]: 54: Hoare triple {40411#(<= ~counter~0 5)} assume true; {40411#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:52,339 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {40411#(<= ~counter~0 5)} {40411#(<= ~counter~0 5)} #94#return; {40411#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:52,340 INFO L290 TraceCheckUtils]: 56: Hoare triple {40411#(<= ~counter~0 5)} assume !!(0 != ~r~0); {40411#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:52,340 INFO L290 TraceCheckUtils]: 57: Hoare triple {40411#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {40436#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:52,340 INFO L290 TraceCheckUtils]: 58: Hoare triple {40436#(<= ~counter~0 6)} assume !!(#t~post7 < 20);havoc #t~post7; {40436#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:52,341 INFO L272 TraceCheckUtils]: 59: Hoare triple {40436#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {40436#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:52,341 INFO L290 TraceCheckUtils]: 60: Hoare triple {40436#(<= ~counter~0 6)} ~cond := #in~cond; {40436#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:52,341 INFO L290 TraceCheckUtils]: 61: Hoare triple {40436#(<= ~counter~0 6)} assume !(0 == ~cond); {40436#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:52,342 INFO L290 TraceCheckUtils]: 62: Hoare triple {40436#(<= ~counter~0 6)} assume true; {40436#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:52,342 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {40436#(<= ~counter~0 6)} {40436#(<= ~counter~0 6)} #96#return; {40436#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:52,342 INFO L290 TraceCheckUtils]: 64: Hoare triple {40436#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {40436#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:52,343 INFO L290 TraceCheckUtils]: 65: Hoare triple {40436#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {40461#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:52,343 INFO L290 TraceCheckUtils]: 66: Hoare triple {40461#(<= ~counter~0 7)} assume !!(#t~post7 < 20);havoc #t~post7; {40461#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:52,344 INFO L272 TraceCheckUtils]: 67: Hoare triple {40461#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {40461#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:52,344 INFO L290 TraceCheckUtils]: 68: Hoare triple {40461#(<= ~counter~0 7)} ~cond := #in~cond; {40461#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:52,344 INFO L290 TraceCheckUtils]: 69: Hoare triple {40461#(<= ~counter~0 7)} assume !(0 == ~cond); {40461#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:52,345 INFO L290 TraceCheckUtils]: 70: Hoare triple {40461#(<= ~counter~0 7)} assume true; {40461#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:52,345 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {40461#(<= ~counter~0 7)} {40461#(<= ~counter~0 7)} #96#return; {40461#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:52,345 INFO L290 TraceCheckUtils]: 72: Hoare triple {40461#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {40461#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:52,346 INFO L290 TraceCheckUtils]: 73: Hoare triple {40461#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {40486#(<= ~counter~0 8)} is VALID [2022-04-28 05:58:52,346 INFO L290 TraceCheckUtils]: 74: Hoare triple {40486#(<= ~counter~0 8)} assume !!(#t~post7 < 20);havoc #t~post7; {40486#(<= ~counter~0 8)} is VALID [2022-04-28 05:58:52,347 INFO L272 TraceCheckUtils]: 75: Hoare triple {40486#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {40486#(<= ~counter~0 8)} is VALID [2022-04-28 05:58:52,347 INFO L290 TraceCheckUtils]: 76: Hoare triple {40486#(<= ~counter~0 8)} ~cond := #in~cond; {40486#(<= ~counter~0 8)} is VALID [2022-04-28 05:58:52,347 INFO L290 TraceCheckUtils]: 77: Hoare triple {40486#(<= ~counter~0 8)} assume !(0 == ~cond); {40486#(<= ~counter~0 8)} is VALID [2022-04-28 05:58:52,348 INFO L290 TraceCheckUtils]: 78: Hoare triple {40486#(<= ~counter~0 8)} assume true; {40486#(<= ~counter~0 8)} is VALID [2022-04-28 05:58:52,348 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {40486#(<= ~counter~0 8)} {40486#(<= ~counter~0 8)} #96#return; {40486#(<= ~counter~0 8)} is VALID [2022-04-28 05:58:52,348 INFO L290 TraceCheckUtils]: 80: Hoare triple {40486#(<= ~counter~0 8)} assume !(~r~0 > 0); {40486#(<= ~counter~0 8)} is VALID [2022-04-28 05:58:52,349 INFO L290 TraceCheckUtils]: 81: Hoare triple {40486#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {40511#(<= ~counter~0 9)} is VALID [2022-04-28 05:58:52,349 INFO L290 TraceCheckUtils]: 82: Hoare triple {40511#(<= ~counter~0 9)} assume !!(#t~post8 < 20);havoc #t~post8; {40511#(<= ~counter~0 9)} is VALID [2022-04-28 05:58:52,350 INFO L272 TraceCheckUtils]: 83: Hoare triple {40511#(<= ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {40511#(<= ~counter~0 9)} is VALID [2022-04-28 05:58:52,350 INFO L290 TraceCheckUtils]: 84: Hoare triple {40511#(<= ~counter~0 9)} ~cond := #in~cond; {40511#(<= ~counter~0 9)} is VALID [2022-04-28 05:58:52,350 INFO L290 TraceCheckUtils]: 85: Hoare triple {40511#(<= ~counter~0 9)} assume !(0 == ~cond); {40511#(<= ~counter~0 9)} is VALID [2022-04-28 05:58:52,351 INFO L290 TraceCheckUtils]: 86: Hoare triple {40511#(<= ~counter~0 9)} assume true; {40511#(<= ~counter~0 9)} is VALID [2022-04-28 05:58:52,351 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {40511#(<= ~counter~0 9)} {40511#(<= ~counter~0 9)} #98#return; {40511#(<= ~counter~0 9)} is VALID [2022-04-28 05:58:52,351 INFO L290 TraceCheckUtils]: 88: Hoare triple {40511#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {40511#(<= ~counter~0 9)} is VALID [2022-04-28 05:58:52,352 INFO L290 TraceCheckUtils]: 89: Hoare triple {40511#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {40536#(<= ~counter~0 10)} is VALID [2022-04-28 05:58:52,352 INFO L290 TraceCheckUtils]: 90: Hoare triple {40536#(<= ~counter~0 10)} assume !!(#t~post8 < 20);havoc #t~post8; {40536#(<= ~counter~0 10)} is VALID [2022-04-28 05:58:52,353 INFO L272 TraceCheckUtils]: 91: Hoare triple {40536#(<= ~counter~0 10)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {40536#(<= ~counter~0 10)} is VALID [2022-04-28 05:58:52,353 INFO L290 TraceCheckUtils]: 92: Hoare triple {40536#(<= ~counter~0 10)} ~cond := #in~cond; {40536#(<= ~counter~0 10)} is VALID [2022-04-28 05:58:52,353 INFO L290 TraceCheckUtils]: 93: Hoare triple {40536#(<= ~counter~0 10)} assume !(0 == ~cond); {40536#(<= ~counter~0 10)} is VALID [2022-04-28 05:58:52,354 INFO L290 TraceCheckUtils]: 94: Hoare triple {40536#(<= ~counter~0 10)} assume true; {40536#(<= ~counter~0 10)} is VALID [2022-04-28 05:58:52,354 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {40536#(<= ~counter~0 10)} {40536#(<= ~counter~0 10)} #98#return; {40536#(<= ~counter~0 10)} is VALID [2022-04-28 05:58:52,354 INFO L290 TraceCheckUtils]: 96: Hoare triple {40536#(<= ~counter~0 10)} assume !(~r~0 < 0); {40536#(<= ~counter~0 10)} is VALID [2022-04-28 05:58:52,355 INFO L290 TraceCheckUtils]: 97: Hoare triple {40536#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {40561#(<= |main_#t~post6| 10)} is VALID [2022-04-28 05:58:52,355 INFO L290 TraceCheckUtils]: 98: Hoare triple {40561#(<= |main_#t~post6| 10)} assume !(#t~post6 < 20);havoc #t~post6; {40255#false} is VALID [2022-04-28 05:58:52,355 INFO L272 TraceCheckUtils]: 99: Hoare triple {40255#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {40255#false} is VALID [2022-04-28 05:58:52,355 INFO L290 TraceCheckUtils]: 100: Hoare triple {40255#false} ~cond := #in~cond; {40255#false} is VALID [2022-04-28 05:58:52,355 INFO L290 TraceCheckUtils]: 101: Hoare triple {40255#false} assume 0 == ~cond; {40255#false} is VALID [2022-04-28 05:58:52,355 INFO L290 TraceCheckUtils]: 102: Hoare triple {40255#false} assume !false; {40255#false} is VALID [2022-04-28 05:58:52,356 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 20 proven. 236 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 05:58:52,356 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:58:52,950 INFO L290 TraceCheckUtils]: 102: Hoare triple {40255#false} assume !false; {40255#false} is VALID [2022-04-28 05:58:52,951 INFO L290 TraceCheckUtils]: 101: Hoare triple {40255#false} assume 0 == ~cond; {40255#false} is VALID [2022-04-28 05:58:52,951 INFO L290 TraceCheckUtils]: 100: Hoare triple {40255#false} ~cond := #in~cond; {40255#false} is VALID [2022-04-28 05:58:52,951 INFO L272 TraceCheckUtils]: 99: Hoare triple {40255#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {40255#false} is VALID [2022-04-28 05:58:52,951 INFO L290 TraceCheckUtils]: 98: Hoare triple {40589#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {40255#false} is VALID [2022-04-28 05:58:52,951 INFO L290 TraceCheckUtils]: 97: Hoare triple {40593#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {40589#(< |main_#t~post6| 20)} is VALID [2022-04-28 05:58:52,952 INFO L290 TraceCheckUtils]: 96: Hoare triple {40593#(< ~counter~0 20)} assume !(~r~0 < 0); {40593#(< ~counter~0 20)} is VALID [2022-04-28 05:58:52,952 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {40254#true} {40593#(< ~counter~0 20)} #98#return; {40593#(< ~counter~0 20)} is VALID [2022-04-28 05:58:52,952 INFO L290 TraceCheckUtils]: 94: Hoare triple {40254#true} assume true; {40254#true} is VALID [2022-04-28 05:58:52,952 INFO L290 TraceCheckUtils]: 93: Hoare triple {40254#true} assume !(0 == ~cond); {40254#true} is VALID [2022-04-28 05:58:52,952 INFO L290 TraceCheckUtils]: 92: Hoare triple {40254#true} ~cond := #in~cond; {40254#true} is VALID [2022-04-28 05:58:52,952 INFO L272 TraceCheckUtils]: 91: Hoare triple {40593#(< ~counter~0 20)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {40254#true} is VALID [2022-04-28 05:58:52,953 INFO L290 TraceCheckUtils]: 90: Hoare triple {40593#(< ~counter~0 20)} assume !!(#t~post8 < 20);havoc #t~post8; {40593#(< ~counter~0 20)} is VALID [2022-04-28 05:58:52,954 INFO L290 TraceCheckUtils]: 89: Hoare triple {40618#(< ~counter~0 19)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {40593#(< ~counter~0 20)} is VALID [2022-04-28 05:58:52,954 INFO L290 TraceCheckUtils]: 88: Hoare triple {40618#(< ~counter~0 19)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {40618#(< ~counter~0 19)} is VALID [2022-04-28 05:58:52,954 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {40254#true} {40618#(< ~counter~0 19)} #98#return; {40618#(< ~counter~0 19)} is VALID [2022-04-28 05:58:52,954 INFO L290 TraceCheckUtils]: 86: Hoare triple {40254#true} assume true; {40254#true} is VALID [2022-04-28 05:58:52,954 INFO L290 TraceCheckUtils]: 85: Hoare triple {40254#true} assume !(0 == ~cond); {40254#true} is VALID [2022-04-28 05:58:52,955 INFO L290 TraceCheckUtils]: 84: Hoare triple {40254#true} ~cond := #in~cond; {40254#true} is VALID [2022-04-28 05:58:52,955 INFO L272 TraceCheckUtils]: 83: Hoare triple {40618#(< ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {40254#true} is VALID [2022-04-28 05:58:52,955 INFO L290 TraceCheckUtils]: 82: Hoare triple {40618#(< ~counter~0 19)} assume !!(#t~post8 < 20);havoc #t~post8; {40618#(< ~counter~0 19)} is VALID [2022-04-28 05:58:52,955 INFO L290 TraceCheckUtils]: 81: Hoare triple {40643#(< ~counter~0 18)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {40618#(< ~counter~0 19)} is VALID [2022-04-28 05:58:52,956 INFO L290 TraceCheckUtils]: 80: Hoare triple {40643#(< ~counter~0 18)} assume !(~r~0 > 0); {40643#(< ~counter~0 18)} is VALID [2022-04-28 05:58:52,956 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {40254#true} {40643#(< ~counter~0 18)} #96#return; {40643#(< ~counter~0 18)} is VALID [2022-04-28 05:58:52,956 INFO L290 TraceCheckUtils]: 78: Hoare triple {40254#true} assume true; {40254#true} is VALID [2022-04-28 05:58:52,956 INFO L290 TraceCheckUtils]: 77: Hoare triple {40254#true} assume !(0 == ~cond); {40254#true} is VALID [2022-04-28 05:58:52,956 INFO L290 TraceCheckUtils]: 76: Hoare triple {40254#true} ~cond := #in~cond; {40254#true} is VALID [2022-04-28 05:58:52,956 INFO L272 TraceCheckUtils]: 75: Hoare triple {40643#(< ~counter~0 18)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {40254#true} is VALID [2022-04-28 05:58:52,957 INFO L290 TraceCheckUtils]: 74: Hoare triple {40643#(< ~counter~0 18)} assume !!(#t~post7 < 20);havoc #t~post7; {40643#(< ~counter~0 18)} is VALID [2022-04-28 05:58:52,957 INFO L290 TraceCheckUtils]: 73: Hoare triple {40668#(< ~counter~0 17)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {40643#(< ~counter~0 18)} is VALID [2022-04-28 05:58:52,958 INFO L290 TraceCheckUtils]: 72: Hoare triple {40668#(< ~counter~0 17)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {40668#(< ~counter~0 17)} is VALID [2022-04-28 05:58:52,958 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {40254#true} {40668#(< ~counter~0 17)} #96#return; {40668#(< ~counter~0 17)} is VALID [2022-04-28 05:58:52,958 INFO L290 TraceCheckUtils]: 70: Hoare triple {40254#true} assume true; {40254#true} is VALID [2022-04-28 05:58:52,958 INFO L290 TraceCheckUtils]: 69: Hoare triple {40254#true} assume !(0 == ~cond); {40254#true} is VALID [2022-04-28 05:58:52,958 INFO L290 TraceCheckUtils]: 68: Hoare triple {40254#true} ~cond := #in~cond; {40254#true} is VALID [2022-04-28 05:58:52,958 INFO L272 TraceCheckUtils]: 67: Hoare triple {40668#(< ~counter~0 17)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {40254#true} is VALID [2022-04-28 05:58:52,959 INFO L290 TraceCheckUtils]: 66: Hoare triple {40668#(< ~counter~0 17)} assume !!(#t~post7 < 20);havoc #t~post7; {40668#(< ~counter~0 17)} is VALID [2022-04-28 05:58:52,959 INFO L290 TraceCheckUtils]: 65: Hoare triple {40693#(< ~counter~0 16)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {40668#(< ~counter~0 17)} is VALID [2022-04-28 05:58:52,959 INFO L290 TraceCheckUtils]: 64: Hoare triple {40693#(< ~counter~0 16)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {40693#(< ~counter~0 16)} is VALID [2022-04-28 05:58:52,960 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {40254#true} {40693#(< ~counter~0 16)} #96#return; {40693#(< ~counter~0 16)} is VALID [2022-04-28 05:58:52,960 INFO L290 TraceCheckUtils]: 62: Hoare triple {40254#true} assume true; {40254#true} is VALID [2022-04-28 05:58:52,960 INFO L290 TraceCheckUtils]: 61: Hoare triple {40254#true} assume !(0 == ~cond); {40254#true} is VALID [2022-04-28 05:58:52,960 INFO L290 TraceCheckUtils]: 60: Hoare triple {40254#true} ~cond := #in~cond; {40254#true} is VALID [2022-04-28 05:58:52,960 INFO L272 TraceCheckUtils]: 59: Hoare triple {40693#(< ~counter~0 16)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {40254#true} is VALID [2022-04-28 05:58:52,960 INFO L290 TraceCheckUtils]: 58: Hoare triple {40693#(< ~counter~0 16)} assume !!(#t~post7 < 20);havoc #t~post7; {40693#(< ~counter~0 16)} is VALID [2022-04-28 05:58:52,961 INFO L290 TraceCheckUtils]: 57: Hoare triple {40718#(< ~counter~0 15)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {40693#(< ~counter~0 16)} is VALID [2022-04-28 05:58:52,961 INFO L290 TraceCheckUtils]: 56: Hoare triple {40718#(< ~counter~0 15)} assume !!(0 != ~r~0); {40718#(< ~counter~0 15)} is VALID [2022-04-28 05:58:52,962 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {40254#true} {40718#(< ~counter~0 15)} #94#return; {40718#(< ~counter~0 15)} is VALID [2022-04-28 05:58:52,962 INFO L290 TraceCheckUtils]: 54: Hoare triple {40254#true} assume true; {40254#true} is VALID [2022-04-28 05:58:52,962 INFO L290 TraceCheckUtils]: 53: Hoare triple {40254#true} assume !(0 == ~cond); {40254#true} is VALID [2022-04-28 05:58:52,962 INFO L290 TraceCheckUtils]: 52: Hoare triple {40254#true} ~cond := #in~cond; {40254#true} is VALID [2022-04-28 05:58:52,962 INFO L272 TraceCheckUtils]: 51: Hoare triple {40718#(< ~counter~0 15)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {40254#true} is VALID [2022-04-28 05:58:52,962 INFO L290 TraceCheckUtils]: 50: Hoare triple {40718#(< ~counter~0 15)} assume !!(#t~post6 < 20);havoc #t~post6; {40718#(< ~counter~0 15)} is VALID [2022-04-28 05:58:52,963 INFO L290 TraceCheckUtils]: 49: Hoare triple {40743#(< ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {40718#(< ~counter~0 15)} is VALID [2022-04-28 05:58:52,963 INFO L290 TraceCheckUtils]: 48: Hoare triple {40743#(< ~counter~0 14)} assume !(~r~0 < 0); {40743#(< ~counter~0 14)} is VALID [2022-04-28 05:58:52,964 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {40254#true} {40743#(< ~counter~0 14)} #98#return; {40743#(< ~counter~0 14)} is VALID [2022-04-28 05:58:52,964 INFO L290 TraceCheckUtils]: 46: Hoare triple {40254#true} assume true; {40254#true} is VALID [2022-04-28 05:58:52,964 INFO L290 TraceCheckUtils]: 45: Hoare triple {40254#true} assume !(0 == ~cond); {40254#true} is VALID [2022-04-28 05:58:52,964 INFO L290 TraceCheckUtils]: 44: Hoare triple {40254#true} ~cond := #in~cond; {40254#true} is VALID [2022-04-28 05:58:52,964 INFO L272 TraceCheckUtils]: 43: Hoare triple {40743#(< ~counter~0 14)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {40254#true} is VALID [2022-04-28 05:58:52,964 INFO L290 TraceCheckUtils]: 42: Hoare triple {40743#(< ~counter~0 14)} assume !!(#t~post8 < 20);havoc #t~post8; {40743#(< ~counter~0 14)} is VALID [2022-04-28 05:58:52,965 INFO L290 TraceCheckUtils]: 41: Hoare triple {40768#(< ~counter~0 13)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {40743#(< ~counter~0 14)} is VALID [2022-04-28 05:58:52,965 INFO L290 TraceCheckUtils]: 40: Hoare triple {40768#(< ~counter~0 13)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {40768#(< ~counter~0 13)} is VALID [2022-04-28 05:58:52,965 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {40254#true} {40768#(< ~counter~0 13)} #98#return; {40768#(< ~counter~0 13)} is VALID [2022-04-28 05:58:52,966 INFO L290 TraceCheckUtils]: 38: Hoare triple {40254#true} assume true; {40254#true} is VALID [2022-04-28 05:58:52,966 INFO L290 TraceCheckUtils]: 37: Hoare triple {40254#true} assume !(0 == ~cond); {40254#true} is VALID [2022-04-28 05:58:52,966 INFO L290 TraceCheckUtils]: 36: Hoare triple {40254#true} ~cond := #in~cond; {40254#true} is VALID [2022-04-28 05:58:52,966 INFO L272 TraceCheckUtils]: 35: Hoare triple {40768#(< ~counter~0 13)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {40254#true} is VALID [2022-04-28 05:58:52,966 INFO L290 TraceCheckUtils]: 34: Hoare triple {40768#(< ~counter~0 13)} assume !!(#t~post8 < 20);havoc #t~post8; {40768#(< ~counter~0 13)} is VALID [2022-04-28 05:58:52,967 INFO L290 TraceCheckUtils]: 33: Hoare triple {40793#(< ~counter~0 12)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {40768#(< ~counter~0 13)} is VALID [2022-04-28 05:58:52,967 INFO L290 TraceCheckUtils]: 32: Hoare triple {40793#(< ~counter~0 12)} assume !(~r~0 > 0); {40793#(< ~counter~0 12)} is VALID [2022-04-28 05:58:52,967 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {40254#true} {40793#(< ~counter~0 12)} #96#return; {40793#(< ~counter~0 12)} is VALID [2022-04-28 05:58:52,967 INFO L290 TraceCheckUtils]: 30: Hoare triple {40254#true} assume true; {40254#true} is VALID [2022-04-28 05:58:52,967 INFO L290 TraceCheckUtils]: 29: Hoare triple {40254#true} assume !(0 == ~cond); {40254#true} is VALID [2022-04-28 05:58:52,968 INFO L290 TraceCheckUtils]: 28: Hoare triple {40254#true} ~cond := #in~cond; {40254#true} is VALID [2022-04-28 05:58:52,968 INFO L272 TraceCheckUtils]: 27: Hoare triple {40793#(< ~counter~0 12)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {40254#true} is VALID [2022-04-28 05:58:52,968 INFO L290 TraceCheckUtils]: 26: Hoare triple {40793#(< ~counter~0 12)} assume !!(#t~post7 < 20);havoc #t~post7; {40793#(< ~counter~0 12)} is VALID [2022-04-28 05:58:52,969 INFO L290 TraceCheckUtils]: 25: Hoare triple {40536#(<= ~counter~0 10)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {40793#(< ~counter~0 12)} is VALID [2022-04-28 05:58:52,969 INFO L290 TraceCheckUtils]: 24: Hoare triple {40536#(<= ~counter~0 10)} assume !!(0 != ~r~0); {40536#(<= ~counter~0 10)} is VALID [2022-04-28 05:58:52,969 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {40254#true} {40536#(<= ~counter~0 10)} #94#return; {40536#(<= ~counter~0 10)} is VALID [2022-04-28 05:58:52,969 INFO L290 TraceCheckUtils]: 22: Hoare triple {40254#true} assume true; {40254#true} is VALID [2022-04-28 05:58:52,969 INFO L290 TraceCheckUtils]: 21: Hoare triple {40254#true} assume !(0 == ~cond); {40254#true} is VALID [2022-04-28 05:58:52,970 INFO L290 TraceCheckUtils]: 20: Hoare triple {40254#true} ~cond := #in~cond; {40254#true} is VALID [2022-04-28 05:58:52,970 INFO L272 TraceCheckUtils]: 19: Hoare triple {40536#(<= ~counter~0 10)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {40254#true} is VALID [2022-04-28 05:58:52,970 INFO L290 TraceCheckUtils]: 18: Hoare triple {40536#(<= ~counter~0 10)} assume !!(#t~post6 < 20);havoc #t~post6; {40536#(<= ~counter~0 10)} is VALID [2022-04-28 05:58:52,971 INFO L290 TraceCheckUtils]: 17: Hoare triple {40511#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {40536#(<= ~counter~0 10)} is VALID [2022-04-28 05:58:52,972 INFO L290 TraceCheckUtils]: 16: Hoare triple {40511#(<= ~counter~0 9)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {40511#(<= ~counter~0 9)} is VALID [2022-04-28 05:58:52,972 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {40254#true} {40511#(<= ~counter~0 9)} #92#return; {40511#(<= ~counter~0 9)} is VALID [2022-04-28 05:58:52,972 INFO L290 TraceCheckUtils]: 14: Hoare triple {40254#true} assume true; {40254#true} is VALID [2022-04-28 05:58:52,972 INFO L290 TraceCheckUtils]: 13: Hoare triple {40254#true} assume !(0 == ~cond); {40254#true} is VALID [2022-04-28 05:58:52,972 INFO L290 TraceCheckUtils]: 12: Hoare triple {40254#true} ~cond := #in~cond; {40254#true} is VALID [2022-04-28 05:58:52,972 INFO L272 TraceCheckUtils]: 11: Hoare triple {40511#(<= ~counter~0 9)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {40254#true} is VALID [2022-04-28 05:58:52,973 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {40254#true} {40511#(<= ~counter~0 9)} #90#return; {40511#(<= ~counter~0 9)} is VALID [2022-04-28 05:58:52,973 INFO L290 TraceCheckUtils]: 9: Hoare triple {40254#true} assume true; {40254#true} is VALID [2022-04-28 05:58:52,973 INFO L290 TraceCheckUtils]: 8: Hoare triple {40254#true} assume !(0 == ~cond); {40254#true} is VALID [2022-04-28 05:58:52,973 INFO L290 TraceCheckUtils]: 7: Hoare triple {40254#true} ~cond := #in~cond; {40254#true} is VALID [2022-04-28 05:58:52,973 INFO L272 TraceCheckUtils]: 6: Hoare triple {40511#(<= ~counter~0 9)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {40254#true} is VALID [2022-04-28 05:58:52,973 INFO L290 TraceCheckUtils]: 5: Hoare triple {40511#(<= ~counter~0 9)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {40511#(<= ~counter~0 9)} is VALID [2022-04-28 05:58:52,974 INFO L272 TraceCheckUtils]: 4: Hoare triple {40511#(<= ~counter~0 9)} call #t~ret9 := main(); {40511#(<= ~counter~0 9)} is VALID [2022-04-28 05:58:52,974 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40511#(<= ~counter~0 9)} {40254#true} #102#return; {40511#(<= ~counter~0 9)} is VALID [2022-04-28 05:58:52,974 INFO L290 TraceCheckUtils]: 2: Hoare triple {40511#(<= ~counter~0 9)} assume true; {40511#(<= ~counter~0 9)} is VALID [2022-04-28 05:58:52,975 INFO L290 TraceCheckUtils]: 1: Hoare triple {40254#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {40511#(<= ~counter~0 9)} is VALID [2022-04-28 05:58:52,975 INFO L272 TraceCheckUtils]: 0: Hoare triple {40254#true} call ULTIMATE.init(); {40254#true} is VALID [2022-04-28 05:58:52,975 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 20 proven. 56 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2022-04-28 05:58:52,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:58:52,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791030274] [2022-04-28 05:58:52,975 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:58:52,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [569394808] [2022-04-28 05:58:52,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [569394808] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:58:52,975 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:58:52,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2022-04-28 05:58:52,976 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:58:52,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [210932375] [2022-04-28 05:58:52,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [210932375] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:58:52,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:58:52,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 05:58:52,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012749462] [2022-04-28 05:58:52,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:58:52,976 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.142857142857143) internal successors, (72), 13 states have internal predecessors, (72), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) Word has length 103 [2022-04-28 05:58:52,976 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:58:52,977 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 5.142857142857143) internal successors, (72), 13 states have internal predecessors, (72), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-28 05:58:53,063 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:58:53,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 05:58:53,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:58:53,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 05:58:53,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-28 05:58:53,064 INFO L87 Difference]: Start difference. First operand 364 states and 480 transitions. Second operand has 14 states, 14 states have (on average 5.142857142857143) internal successors, (72), 13 states have internal predecessors, (72), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-28 05:58:54,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:58:54,465 INFO L93 Difference]: Finished difference Result 407 states and 538 transitions. [2022-04-28 05:58:54,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-28 05:58:54,465 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.142857142857143) internal successors, (72), 13 states have internal predecessors, (72), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) Word has length 103 [2022-04-28 05:58:54,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:58:54,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 5.142857142857143) internal successors, (72), 13 states have internal predecessors, (72), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-28 05:58:54,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 214 transitions. [2022-04-28 05:58:54,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 5.142857142857143) internal successors, (72), 13 states have internal predecessors, (72), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-28 05:58:54,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 214 transitions. [2022-04-28 05:58:54,469 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 214 transitions. [2022-04-28 05:58:54,629 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 214 edges. 214 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:58:54,637 INFO L225 Difference]: With dead ends: 407 [2022-04-28 05:58:54,637 INFO L226 Difference]: Without dead ends: 396 [2022-04-28 05:58:54,637 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 182 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=379, Invalid=551, Unknown=0, NotChecked=0, Total=930 [2022-04-28 05:58:54,637 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 146 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 05:58:54,638 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 250 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 05:58:54,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2022-04-28 05:58:55,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 377. [2022-04-28 05:58:55,244 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:58:55,245 INFO L82 GeneralOperation]: Start isEquivalent. First operand 396 states. Second operand has 377 states, 281 states have (on average 1.206405693950178) internal successors, (339), 288 states have internal predecessors, (339), 82 states have call successors, (82), 15 states have call predecessors, (82), 13 states have return successors, (80), 73 states have call predecessors, (80), 80 states have call successors, (80) [2022-04-28 05:58:55,245 INFO L74 IsIncluded]: Start isIncluded. First operand 396 states. Second operand has 377 states, 281 states have (on average 1.206405693950178) internal successors, (339), 288 states have internal predecessors, (339), 82 states have call successors, (82), 15 states have call predecessors, (82), 13 states have return successors, (80), 73 states have call predecessors, (80), 80 states have call successors, (80) [2022-04-28 05:58:55,246 INFO L87 Difference]: Start difference. First operand 396 states. Second operand has 377 states, 281 states have (on average 1.206405693950178) internal successors, (339), 288 states have internal predecessors, (339), 82 states have call successors, (82), 15 states have call predecessors, (82), 13 states have return successors, (80), 73 states have call predecessors, (80), 80 states have call successors, (80) [2022-04-28 05:58:55,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:58:55,256 INFO L93 Difference]: Finished difference Result 396 states and 523 transitions. [2022-04-28 05:58:55,256 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 523 transitions. [2022-04-28 05:58:55,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:58:55,257 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:58:55,257 INFO L74 IsIncluded]: Start isIncluded. First operand has 377 states, 281 states have (on average 1.206405693950178) internal successors, (339), 288 states have internal predecessors, (339), 82 states have call successors, (82), 15 states have call predecessors, (82), 13 states have return successors, (80), 73 states have call predecessors, (80), 80 states have call successors, (80) Second operand 396 states. [2022-04-28 05:58:55,258 INFO L87 Difference]: Start difference. First operand has 377 states, 281 states have (on average 1.206405693950178) internal successors, (339), 288 states have internal predecessors, (339), 82 states have call successors, (82), 15 states have call predecessors, (82), 13 states have return successors, (80), 73 states have call predecessors, (80), 80 states have call successors, (80) Second operand 396 states. [2022-04-28 05:58:55,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:58:55,267 INFO L93 Difference]: Finished difference Result 396 states and 523 transitions. [2022-04-28 05:58:55,267 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 523 transitions. [2022-04-28 05:58:55,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:58:55,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:58:55,268 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:58:55,268 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:58:55,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 281 states have (on average 1.206405693950178) internal successors, (339), 288 states have internal predecessors, (339), 82 states have call successors, (82), 15 states have call predecessors, (82), 13 states have return successors, (80), 73 states have call predecessors, (80), 80 states have call successors, (80) [2022-04-28 05:58:55,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 501 transitions. [2022-04-28 05:58:55,279 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 501 transitions. Word has length 103 [2022-04-28 05:58:55,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:58:55,280 INFO L495 AbstractCegarLoop]: Abstraction has 377 states and 501 transitions. [2022-04-28 05:58:55,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.142857142857143) internal successors, (72), 13 states have internal predecessors, (72), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-28 05:58:55,280 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 377 states and 501 transitions. [2022-04-28 05:58:58,085 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 501 edges. 500 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 05:58:58,086 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 501 transitions. [2022-04-28 05:58:58,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-04-28 05:58:58,087 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:58:58,087 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:58:58,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-04-28 05:58:58,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:58:58,291 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:58:58,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:58:58,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1733340336, now seen corresponding path program 9 times [2022-04-28 05:58:58,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:58:58,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1025599175] [2022-04-28 05:58:58,292 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:58:58,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1733340336, now seen corresponding path program 10 times [2022-04-28 05:58:58,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:58:58,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77271400] [2022-04-28 05:58:58,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:58:58,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:58:58,305 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:58:58,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1742056815] [2022-04-28 05:58:58,305 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 05:58:58,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:58:58,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:58:58,306 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:58:58,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-04-28 05:58:58,365 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 05:58:58,365 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:58:58,366 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 05:58:58,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:58:58,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:58:59,236 INFO L272 TraceCheckUtils]: 0: Hoare triple {43269#true} call ULTIMATE.init(); {43269#true} is VALID [2022-04-28 05:58:59,237 INFO L290 TraceCheckUtils]: 1: Hoare triple {43269#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {43269#true} is VALID [2022-04-28 05:58:59,237 INFO L290 TraceCheckUtils]: 2: Hoare triple {43269#true} assume true; {43269#true} is VALID [2022-04-28 05:58:59,237 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43269#true} {43269#true} #102#return; {43269#true} is VALID [2022-04-28 05:58:59,237 INFO L272 TraceCheckUtils]: 4: Hoare triple {43269#true} call #t~ret9 := main(); {43269#true} is VALID [2022-04-28 05:58:59,237 INFO L290 TraceCheckUtils]: 5: Hoare triple {43269#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {43269#true} is VALID [2022-04-28 05:58:59,237 INFO L272 TraceCheckUtils]: 6: Hoare triple {43269#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {43269#true} is VALID [2022-04-28 05:58:59,237 INFO L290 TraceCheckUtils]: 7: Hoare triple {43269#true} ~cond := #in~cond; {43269#true} is VALID [2022-04-28 05:58:59,237 INFO L290 TraceCheckUtils]: 8: Hoare triple {43269#true} assume !(0 == ~cond); {43269#true} is VALID [2022-04-28 05:58:59,237 INFO L290 TraceCheckUtils]: 9: Hoare triple {43269#true} assume true; {43269#true} is VALID [2022-04-28 05:58:59,237 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {43269#true} {43269#true} #90#return; {43269#true} is VALID [2022-04-28 05:58:59,237 INFO L272 TraceCheckUtils]: 11: Hoare triple {43269#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {43269#true} is VALID [2022-04-28 05:58:59,237 INFO L290 TraceCheckUtils]: 12: Hoare triple {43269#true} ~cond := #in~cond; {43269#true} is VALID [2022-04-28 05:58:59,237 INFO L290 TraceCheckUtils]: 13: Hoare triple {43269#true} assume !(0 == ~cond); {43269#true} is VALID [2022-04-28 05:58:59,237 INFO L290 TraceCheckUtils]: 14: Hoare triple {43269#true} assume true; {43269#true} is VALID [2022-04-28 05:58:59,237 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {43269#true} {43269#true} #92#return; {43269#true} is VALID [2022-04-28 05:58:59,237 INFO L290 TraceCheckUtils]: 16: Hoare triple {43269#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {43269#true} is VALID [2022-04-28 05:58:59,237 INFO L290 TraceCheckUtils]: 17: Hoare triple {43269#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {43269#true} is VALID [2022-04-28 05:58:59,237 INFO L290 TraceCheckUtils]: 18: Hoare triple {43269#true} assume !!(#t~post6 < 20);havoc #t~post6; {43269#true} is VALID [2022-04-28 05:58:59,238 INFO L272 TraceCheckUtils]: 19: Hoare triple {43269#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {43269#true} is VALID [2022-04-28 05:58:59,238 INFO L290 TraceCheckUtils]: 20: Hoare triple {43269#true} ~cond := #in~cond; {43269#true} is VALID [2022-04-28 05:58:59,238 INFO L290 TraceCheckUtils]: 21: Hoare triple {43269#true} assume !(0 == ~cond); {43269#true} is VALID [2022-04-28 05:58:59,238 INFO L290 TraceCheckUtils]: 22: Hoare triple {43269#true} assume true; {43269#true} is VALID [2022-04-28 05:58:59,238 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {43269#true} {43269#true} #94#return; {43269#true} is VALID [2022-04-28 05:58:59,238 INFO L290 TraceCheckUtils]: 24: Hoare triple {43269#true} assume !!(0 != ~r~0); {43269#true} is VALID [2022-04-28 05:58:59,238 INFO L290 TraceCheckUtils]: 25: Hoare triple {43269#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {43269#true} is VALID [2022-04-28 05:58:59,238 INFO L290 TraceCheckUtils]: 26: Hoare triple {43269#true} assume !!(#t~post7 < 20);havoc #t~post7; {43269#true} is VALID [2022-04-28 05:58:59,238 INFO L272 TraceCheckUtils]: 27: Hoare triple {43269#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {43269#true} is VALID [2022-04-28 05:58:59,238 INFO L290 TraceCheckUtils]: 28: Hoare triple {43269#true} ~cond := #in~cond; {43269#true} is VALID [2022-04-28 05:58:59,238 INFO L290 TraceCheckUtils]: 29: Hoare triple {43269#true} assume !(0 == ~cond); {43269#true} is VALID [2022-04-28 05:58:59,238 INFO L290 TraceCheckUtils]: 30: Hoare triple {43269#true} assume true; {43269#true} is VALID [2022-04-28 05:58:59,238 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {43269#true} {43269#true} #96#return; {43269#true} is VALID [2022-04-28 05:58:59,238 INFO L290 TraceCheckUtils]: 32: Hoare triple {43269#true} assume !(~r~0 > 0); {43269#true} is VALID [2022-04-28 05:58:59,238 INFO L290 TraceCheckUtils]: 33: Hoare triple {43269#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {43269#true} is VALID [2022-04-28 05:58:59,238 INFO L290 TraceCheckUtils]: 34: Hoare triple {43269#true} assume !!(#t~post8 < 20);havoc #t~post8; {43269#true} is VALID [2022-04-28 05:58:59,238 INFO L272 TraceCheckUtils]: 35: Hoare triple {43269#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {43269#true} is VALID [2022-04-28 05:58:59,238 INFO L290 TraceCheckUtils]: 36: Hoare triple {43269#true} ~cond := #in~cond; {43269#true} is VALID [2022-04-28 05:58:59,238 INFO L290 TraceCheckUtils]: 37: Hoare triple {43269#true} assume !(0 == ~cond); {43269#true} is VALID [2022-04-28 05:58:59,238 INFO L290 TraceCheckUtils]: 38: Hoare triple {43269#true} assume true; {43269#true} is VALID [2022-04-28 05:58:59,239 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {43269#true} {43269#true} #98#return; {43269#true} is VALID [2022-04-28 05:58:59,240 INFO L290 TraceCheckUtils]: 40: Hoare triple {43269#true} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {43394#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-28 05:58:59,240 INFO L290 TraceCheckUtils]: 41: Hoare triple {43394#(< (+ main_~r~0 2) main_~u~0)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {43394#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-28 05:58:59,240 INFO L290 TraceCheckUtils]: 42: Hoare triple {43394#(< (+ main_~r~0 2) main_~u~0)} assume !!(#t~post8 < 20);havoc #t~post8; {43394#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-28 05:58:59,240 INFO L272 TraceCheckUtils]: 43: Hoare triple {43394#(< (+ main_~r~0 2) main_~u~0)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {43269#true} is VALID [2022-04-28 05:58:59,240 INFO L290 TraceCheckUtils]: 44: Hoare triple {43269#true} ~cond := #in~cond; {43269#true} is VALID [2022-04-28 05:58:59,241 INFO L290 TraceCheckUtils]: 45: Hoare triple {43269#true} assume !(0 == ~cond); {43269#true} is VALID [2022-04-28 05:58:59,241 INFO L290 TraceCheckUtils]: 46: Hoare triple {43269#true} assume true; {43269#true} is VALID [2022-04-28 05:58:59,241 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {43269#true} {43394#(< (+ main_~r~0 2) main_~u~0)} #98#return; {43394#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-28 05:58:59,241 INFO L290 TraceCheckUtils]: 48: Hoare triple {43394#(< (+ main_~r~0 2) main_~u~0)} assume !(~r~0 < 0); {43394#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-28 05:58:59,243 INFO L290 TraceCheckUtils]: 49: Hoare triple {43394#(< (+ main_~r~0 2) main_~u~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {43394#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-28 05:58:59,244 INFO L290 TraceCheckUtils]: 50: Hoare triple {43394#(< (+ main_~r~0 2) main_~u~0)} assume !!(#t~post6 < 20);havoc #t~post6; {43394#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-28 05:58:59,244 INFO L272 TraceCheckUtils]: 51: Hoare triple {43394#(< (+ main_~r~0 2) main_~u~0)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {43269#true} is VALID [2022-04-28 05:58:59,244 INFO L290 TraceCheckUtils]: 52: Hoare triple {43269#true} ~cond := #in~cond; {43269#true} is VALID [2022-04-28 05:58:59,244 INFO L290 TraceCheckUtils]: 53: Hoare triple {43269#true} assume !(0 == ~cond); {43269#true} is VALID [2022-04-28 05:58:59,244 INFO L290 TraceCheckUtils]: 54: Hoare triple {43269#true} assume true; {43269#true} is VALID [2022-04-28 05:58:59,244 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {43269#true} {43394#(< (+ main_~r~0 2) main_~u~0)} #94#return; {43394#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-28 05:58:59,245 INFO L290 TraceCheckUtils]: 56: Hoare triple {43394#(< (+ main_~r~0 2) main_~u~0)} assume !!(0 != ~r~0); {43394#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-28 05:58:59,246 INFO L290 TraceCheckUtils]: 57: Hoare triple {43394#(< (+ main_~r~0 2) main_~u~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {43394#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-28 05:58:59,246 INFO L290 TraceCheckUtils]: 58: Hoare triple {43394#(< (+ main_~r~0 2) main_~u~0)} assume !!(#t~post7 < 20);havoc #t~post7; {43394#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-28 05:58:59,246 INFO L272 TraceCheckUtils]: 59: Hoare triple {43394#(< (+ main_~r~0 2) main_~u~0)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {43269#true} is VALID [2022-04-28 05:58:59,246 INFO L290 TraceCheckUtils]: 60: Hoare triple {43269#true} ~cond := #in~cond; {43269#true} is VALID [2022-04-28 05:58:59,246 INFO L290 TraceCheckUtils]: 61: Hoare triple {43269#true} assume !(0 == ~cond); {43269#true} is VALID [2022-04-28 05:58:59,246 INFO L290 TraceCheckUtils]: 62: Hoare triple {43269#true} assume true; {43269#true} is VALID [2022-04-28 05:58:59,247 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {43269#true} {43394#(< (+ main_~r~0 2) main_~u~0)} #96#return; {43394#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-28 05:58:59,247 INFO L290 TraceCheckUtils]: 64: Hoare triple {43394#(< (+ main_~r~0 2) main_~u~0)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {43467#(< (+ main_~v~0 main_~r~0) main_~u~0)} is VALID [2022-04-28 05:58:59,248 INFO L290 TraceCheckUtils]: 65: Hoare triple {43467#(< (+ main_~v~0 main_~r~0) main_~u~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {43467#(< (+ main_~v~0 main_~r~0) main_~u~0)} is VALID [2022-04-28 05:58:59,248 INFO L290 TraceCheckUtils]: 66: Hoare triple {43467#(< (+ main_~v~0 main_~r~0) main_~u~0)} assume !!(#t~post7 < 20);havoc #t~post7; {43467#(< (+ main_~v~0 main_~r~0) main_~u~0)} is VALID [2022-04-28 05:58:59,248 INFO L272 TraceCheckUtils]: 67: Hoare triple {43467#(< (+ main_~v~0 main_~r~0) main_~u~0)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {43269#true} is VALID [2022-04-28 05:58:59,248 INFO L290 TraceCheckUtils]: 68: Hoare triple {43269#true} ~cond := #in~cond; {43269#true} is VALID [2022-04-28 05:58:59,248 INFO L290 TraceCheckUtils]: 69: Hoare triple {43269#true} assume !(0 == ~cond); {43269#true} is VALID [2022-04-28 05:58:59,248 INFO L290 TraceCheckUtils]: 70: Hoare triple {43269#true} assume true; {43269#true} is VALID [2022-04-28 05:58:59,249 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {43269#true} {43467#(< (+ main_~v~0 main_~r~0) main_~u~0)} #96#return; {43467#(< (+ main_~v~0 main_~r~0) main_~u~0)} is VALID [2022-04-28 05:58:59,249 INFO L290 TraceCheckUtils]: 72: Hoare triple {43467#(< (+ main_~v~0 main_~r~0) main_~u~0)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {43492#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} is VALID [2022-04-28 05:58:59,249 INFO L290 TraceCheckUtils]: 73: Hoare triple {43492#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {43492#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} is VALID [2022-04-28 05:58:59,250 INFO L290 TraceCheckUtils]: 74: Hoare triple {43492#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} assume !!(#t~post7 < 20);havoc #t~post7; {43492#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} is VALID [2022-04-28 05:58:59,250 INFO L272 TraceCheckUtils]: 75: Hoare triple {43492#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {43269#true} is VALID [2022-04-28 05:58:59,250 INFO L290 TraceCheckUtils]: 76: Hoare triple {43269#true} ~cond := #in~cond; {43269#true} is VALID [2022-04-28 05:58:59,250 INFO L290 TraceCheckUtils]: 77: Hoare triple {43269#true} assume !(0 == ~cond); {43269#true} is VALID [2022-04-28 05:58:59,250 INFO L290 TraceCheckUtils]: 78: Hoare triple {43269#true} assume true; {43269#true} is VALID [2022-04-28 05:58:59,250 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {43269#true} {43492#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} #96#return; {43492#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} is VALID [2022-04-28 05:58:59,251 INFO L290 TraceCheckUtils]: 80: Hoare triple {43492#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} assume !(~r~0 > 0); {43492#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} is VALID [2022-04-28 05:58:59,251 INFO L290 TraceCheckUtils]: 81: Hoare triple {43492#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {43492#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} is VALID [2022-04-28 05:58:59,251 INFO L290 TraceCheckUtils]: 82: Hoare triple {43492#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} assume !!(#t~post8 < 20);havoc #t~post8; {43492#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} is VALID [2022-04-28 05:58:59,251 INFO L272 TraceCheckUtils]: 83: Hoare triple {43492#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {43269#true} is VALID [2022-04-28 05:58:59,251 INFO L290 TraceCheckUtils]: 84: Hoare triple {43269#true} ~cond := #in~cond; {43269#true} is VALID [2022-04-28 05:58:59,251 INFO L290 TraceCheckUtils]: 85: Hoare triple {43269#true} assume !(0 == ~cond); {43269#true} is VALID [2022-04-28 05:58:59,251 INFO L290 TraceCheckUtils]: 86: Hoare triple {43269#true} assume true; {43269#true} is VALID [2022-04-28 05:58:59,252 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {43269#true} {43492#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} #98#return; {43492#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} is VALID [2022-04-28 05:58:59,252 INFO L290 TraceCheckUtils]: 88: Hoare triple {43492#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {43541#(< 0 (div (+ (- 1) main_~r~0) 2))} is VALID [2022-04-28 05:58:59,253 INFO L290 TraceCheckUtils]: 89: Hoare triple {43541#(< 0 (div (+ (- 1) main_~r~0) 2))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {43541#(< 0 (div (+ (- 1) main_~r~0) 2))} is VALID [2022-04-28 05:58:59,253 INFO L290 TraceCheckUtils]: 90: Hoare triple {43541#(< 0 (div (+ (- 1) main_~r~0) 2))} assume !!(#t~post8 < 20);havoc #t~post8; {43541#(< 0 (div (+ (- 1) main_~r~0) 2))} is VALID [2022-04-28 05:58:59,253 INFO L272 TraceCheckUtils]: 91: Hoare triple {43541#(< 0 (div (+ (- 1) main_~r~0) 2))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {43269#true} is VALID [2022-04-28 05:58:59,253 INFO L290 TraceCheckUtils]: 92: Hoare triple {43269#true} ~cond := #in~cond; {43269#true} is VALID [2022-04-28 05:58:59,253 INFO L290 TraceCheckUtils]: 93: Hoare triple {43269#true} assume !(0 == ~cond); {43269#true} is VALID [2022-04-28 05:58:59,253 INFO L290 TraceCheckUtils]: 94: Hoare triple {43269#true} assume true; {43269#true} is VALID [2022-04-28 05:58:59,254 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {43269#true} {43541#(< 0 (div (+ (- 1) main_~r~0) 2))} #98#return; {43541#(< 0 (div (+ (- 1) main_~r~0) 2))} is VALID [2022-04-28 05:58:59,254 INFO L290 TraceCheckUtils]: 96: Hoare triple {43541#(< 0 (div (+ (- 1) main_~r~0) 2))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {43270#false} is VALID [2022-04-28 05:58:59,254 INFO L290 TraceCheckUtils]: 97: Hoare triple {43270#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {43270#false} is VALID [2022-04-28 05:58:59,254 INFO L290 TraceCheckUtils]: 98: Hoare triple {43270#false} assume !(#t~post8 < 20);havoc #t~post8; {43270#false} is VALID [2022-04-28 05:58:59,255 INFO L290 TraceCheckUtils]: 99: Hoare triple {43270#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {43270#false} is VALID [2022-04-28 05:58:59,255 INFO L290 TraceCheckUtils]: 100: Hoare triple {43270#false} assume !(#t~post6 < 20);havoc #t~post6; {43270#false} is VALID [2022-04-28 05:58:59,255 INFO L272 TraceCheckUtils]: 101: Hoare triple {43270#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {43270#false} is VALID [2022-04-28 05:58:59,255 INFO L290 TraceCheckUtils]: 102: Hoare triple {43270#false} ~cond := #in~cond; {43270#false} is VALID [2022-04-28 05:58:59,255 INFO L290 TraceCheckUtils]: 103: Hoare triple {43270#false} assume 0 == ~cond; {43270#false} is VALID [2022-04-28 05:58:59,255 INFO L290 TraceCheckUtils]: 104: Hoare triple {43270#false} assume !false; {43270#false} is VALID [2022-04-28 05:58:59,255 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 60 proven. 24 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2022-04-28 05:58:59,255 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:58:59,696 INFO L290 TraceCheckUtils]: 104: Hoare triple {43270#false} assume !false; {43270#false} is VALID [2022-04-28 05:58:59,697 INFO L290 TraceCheckUtils]: 103: Hoare triple {43270#false} assume 0 == ~cond; {43270#false} is VALID [2022-04-28 05:58:59,697 INFO L290 TraceCheckUtils]: 102: Hoare triple {43270#false} ~cond := #in~cond; {43270#false} is VALID [2022-04-28 05:58:59,697 INFO L272 TraceCheckUtils]: 101: Hoare triple {43270#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {43270#false} is VALID [2022-04-28 05:58:59,697 INFO L290 TraceCheckUtils]: 100: Hoare triple {43270#false} assume !(#t~post6 < 20);havoc #t~post6; {43270#false} is VALID [2022-04-28 05:58:59,697 INFO L290 TraceCheckUtils]: 99: Hoare triple {43270#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {43270#false} is VALID [2022-04-28 05:58:59,697 INFO L290 TraceCheckUtils]: 98: Hoare triple {43270#false} assume !(#t~post8 < 20);havoc #t~post8; {43270#false} is VALID [2022-04-28 05:58:59,697 INFO L290 TraceCheckUtils]: 97: Hoare triple {43270#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {43270#false} is VALID [2022-04-28 05:58:59,698 INFO L290 TraceCheckUtils]: 96: Hoare triple {43614#(not (< main_~r~0 0))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {43270#false} is VALID [2022-04-28 05:58:59,698 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {43269#true} {43614#(not (< main_~r~0 0))} #98#return; {43614#(not (< main_~r~0 0))} is VALID [2022-04-28 05:58:59,698 INFO L290 TraceCheckUtils]: 94: Hoare triple {43269#true} assume true; {43269#true} is VALID [2022-04-28 05:58:59,699 INFO L290 TraceCheckUtils]: 93: Hoare triple {43269#true} assume !(0 == ~cond); {43269#true} is VALID [2022-04-28 05:58:59,699 INFO L290 TraceCheckUtils]: 92: Hoare triple {43269#true} ~cond := #in~cond; {43269#true} is VALID [2022-04-28 05:58:59,699 INFO L272 TraceCheckUtils]: 91: Hoare triple {43614#(not (< main_~r~0 0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {43269#true} is VALID [2022-04-28 05:58:59,699 INFO L290 TraceCheckUtils]: 90: Hoare triple {43614#(not (< main_~r~0 0))} assume !!(#t~post8 < 20);havoc #t~post8; {43614#(not (< main_~r~0 0))} is VALID [2022-04-28 05:58:59,699 INFO L290 TraceCheckUtils]: 89: Hoare triple {43614#(not (< main_~r~0 0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {43614#(not (< main_~r~0 0))} is VALID [2022-04-28 05:58:59,700 INFO L290 TraceCheckUtils]: 88: Hoare triple {43639#(<= 0 (+ main_~u~0 main_~r~0))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {43614#(not (< main_~r~0 0))} is VALID [2022-04-28 05:58:59,701 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {43269#true} {43639#(<= 0 (+ main_~u~0 main_~r~0))} #98#return; {43639#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-28 05:58:59,701 INFO L290 TraceCheckUtils]: 86: Hoare triple {43269#true} assume true; {43269#true} is VALID [2022-04-28 05:58:59,701 INFO L290 TraceCheckUtils]: 85: Hoare triple {43269#true} assume !(0 == ~cond); {43269#true} is VALID [2022-04-28 05:58:59,701 INFO L290 TraceCheckUtils]: 84: Hoare triple {43269#true} ~cond := #in~cond; {43269#true} is VALID [2022-04-28 05:58:59,701 INFO L272 TraceCheckUtils]: 83: Hoare triple {43639#(<= 0 (+ main_~u~0 main_~r~0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {43269#true} is VALID [2022-04-28 05:58:59,701 INFO L290 TraceCheckUtils]: 82: Hoare triple {43639#(<= 0 (+ main_~u~0 main_~r~0))} assume !!(#t~post8 < 20);havoc #t~post8; {43639#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-28 05:58:59,701 INFO L290 TraceCheckUtils]: 81: Hoare triple {43639#(<= 0 (+ main_~u~0 main_~r~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {43639#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-28 05:58:59,702 INFO L290 TraceCheckUtils]: 80: Hoare triple {43639#(<= 0 (+ main_~u~0 main_~r~0))} assume !(~r~0 > 0); {43639#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-28 05:58:59,702 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {43269#true} {43639#(<= 0 (+ main_~u~0 main_~r~0))} #96#return; {43639#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-28 05:58:59,702 INFO L290 TraceCheckUtils]: 78: Hoare triple {43269#true} assume true; {43269#true} is VALID [2022-04-28 05:58:59,702 INFO L290 TraceCheckUtils]: 77: Hoare triple {43269#true} assume !(0 == ~cond); {43269#true} is VALID [2022-04-28 05:58:59,702 INFO L290 TraceCheckUtils]: 76: Hoare triple {43269#true} ~cond := #in~cond; {43269#true} is VALID [2022-04-28 05:58:59,702 INFO L272 TraceCheckUtils]: 75: Hoare triple {43639#(<= 0 (+ main_~u~0 main_~r~0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {43269#true} is VALID [2022-04-28 05:58:59,703 INFO L290 TraceCheckUtils]: 74: Hoare triple {43639#(<= 0 (+ main_~u~0 main_~r~0))} assume !!(#t~post7 < 20);havoc #t~post7; {43639#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-28 05:58:59,703 INFO L290 TraceCheckUtils]: 73: Hoare triple {43639#(<= 0 (+ main_~u~0 main_~r~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {43639#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-28 05:58:59,703 INFO L290 TraceCheckUtils]: 72: Hoare triple {43688#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {43639#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-28 05:58:59,704 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {43269#true} {43688#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} #96#return; {43688#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} is VALID [2022-04-28 05:58:59,704 INFO L290 TraceCheckUtils]: 70: Hoare triple {43269#true} assume true; {43269#true} is VALID [2022-04-28 05:58:59,704 INFO L290 TraceCheckUtils]: 69: Hoare triple {43269#true} assume !(0 == ~cond); {43269#true} is VALID [2022-04-28 05:58:59,704 INFO L290 TraceCheckUtils]: 68: Hoare triple {43269#true} ~cond := #in~cond; {43269#true} is VALID [2022-04-28 05:58:59,704 INFO L272 TraceCheckUtils]: 67: Hoare triple {43688#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {43269#true} is VALID [2022-04-28 05:58:59,704 INFO L290 TraceCheckUtils]: 66: Hoare triple {43688#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} assume !!(#t~post7 < 20);havoc #t~post7; {43688#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} is VALID [2022-04-28 05:58:59,705 INFO L290 TraceCheckUtils]: 65: Hoare triple {43688#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {43688#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} is VALID [2022-04-28 05:58:59,706 INFO L290 TraceCheckUtils]: 64: Hoare triple {43713#(<= main_~r~0 main_~u~0)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {43688#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} is VALID [2022-04-28 05:58:59,706 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {43269#true} {43713#(<= main_~r~0 main_~u~0)} #96#return; {43713#(<= main_~r~0 main_~u~0)} is VALID [2022-04-28 05:58:59,706 INFO L290 TraceCheckUtils]: 62: Hoare triple {43269#true} assume true; {43269#true} is VALID [2022-04-28 05:58:59,706 INFO L290 TraceCheckUtils]: 61: Hoare triple {43269#true} assume !(0 == ~cond); {43269#true} is VALID [2022-04-28 05:58:59,706 INFO L290 TraceCheckUtils]: 60: Hoare triple {43269#true} ~cond := #in~cond; {43269#true} is VALID [2022-04-28 05:58:59,706 INFO L272 TraceCheckUtils]: 59: Hoare triple {43713#(<= main_~r~0 main_~u~0)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {43269#true} is VALID [2022-04-28 05:58:59,707 INFO L290 TraceCheckUtils]: 58: Hoare triple {43713#(<= main_~r~0 main_~u~0)} assume !!(#t~post7 < 20);havoc #t~post7; {43713#(<= main_~r~0 main_~u~0)} is VALID [2022-04-28 05:58:59,707 INFO L290 TraceCheckUtils]: 57: Hoare triple {43713#(<= main_~r~0 main_~u~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {43713#(<= main_~r~0 main_~u~0)} is VALID [2022-04-28 05:58:59,707 INFO L290 TraceCheckUtils]: 56: Hoare triple {43713#(<= main_~r~0 main_~u~0)} assume !!(0 != ~r~0); {43713#(<= main_~r~0 main_~u~0)} is VALID [2022-04-28 05:58:59,708 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {43269#true} {43713#(<= main_~r~0 main_~u~0)} #94#return; {43713#(<= main_~r~0 main_~u~0)} is VALID [2022-04-28 05:58:59,708 INFO L290 TraceCheckUtils]: 54: Hoare triple {43269#true} assume true; {43269#true} is VALID [2022-04-28 05:58:59,708 INFO L290 TraceCheckUtils]: 53: Hoare triple {43269#true} assume !(0 == ~cond); {43269#true} is VALID [2022-04-28 05:58:59,708 INFO L290 TraceCheckUtils]: 52: Hoare triple {43269#true} ~cond := #in~cond; {43269#true} is VALID [2022-04-28 05:58:59,708 INFO L272 TraceCheckUtils]: 51: Hoare triple {43713#(<= main_~r~0 main_~u~0)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {43269#true} is VALID [2022-04-28 05:58:59,708 INFO L290 TraceCheckUtils]: 50: Hoare triple {43713#(<= main_~r~0 main_~u~0)} assume !!(#t~post6 < 20);havoc #t~post6; {43713#(<= main_~r~0 main_~u~0)} is VALID [2022-04-28 05:58:59,708 INFO L290 TraceCheckUtils]: 49: Hoare triple {43713#(<= main_~r~0 main_~u~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {43713#(<= main_~r~0 main_~u~0)} is VALID [2022-04-28 05:58:59,709 INFO L290 TraceCheckUtils]: 48: Hoare triple {43713#(<= main_~r~0 main_~u~0)} assume !(~r~0 < 0); {43713#(<= main_~r~0 main_~u~0)} is VALID [2022-04-28 05:58:59,709 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {43269#true} {43713#(<= main_~r~0 main_~u~0)} #98#return; {43713#(<= main_~r~0 main_~u~0)} is VALID [2022-04-28 05:58:59,709 INFO L290 TraceCheckUtils]: 46: Hoare triple {43269#true} assume true; {43269#true} is VALID [2022-04-28 05:58:59,709 INFO L290 TraceCheckUtils]: 45: Hoare triple {43269#true} assume !(0 == ~cond); {43269#true} is VALID [2022-04-28 05:58:59,709 INFO L290 TraceCheckUtils]: 44: Hoare triple {43269#true} ~cond := #in~cond; {43269#true} is VALID [2022-04-28 05:58:59,709 INFO L272 TraceCheckUtils]: 43: Hoare triple {43713#(<= main_~r~0 main_~u~0)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {43269#true} is VALID [2022-04-28 05:58:59,710 INFO L290 TraceCheckUtils]: 42: Hoare triple {43713#(<= main_~r~0 main_~u~0)} assume !!(#t~post8 < 20);havoc #t~post8; {43713#(<= main_~r~0 main_~u~0)} is VALID [2022-04-28 05:58:59,710 INFO L290 TraceCheckUtils]: 41: Hoare triple {43713#(<= main_~r~0 main_~u~0)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {43713#(<= main_~r~0 main_~u~0)} is VALID [2022-04-28 05:58:59,711 INFO L290 TraceCheckUtils]: 40: Hoare triple {43269#true} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {43713#(<= main_~r~0 main_~u~0)} is VALID [2022-04-28 05:58:59,711 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {43269#true} {43269#true} #98#return; {43269#true} is VALID [2022-04-28 05:58:59,711 INFO L290 TraceCheckUtils]: 38: Hoare triple {43269#true} assume true; {43269#true} is VALID [2022-04-28 05:58:59,711 INFO L290 TraceCheckUtils]: 37: Hoare triple {43269#true} assume !(0 == ~cond); {43269#true} is VALID [2022-04-28 05:58:59,711 INFO L290 TraceCheckUtils]: 36: Hoare triple {43269#true} ~cond := #in~cond; {43269#true} is VALID [2022-04-28 05:58:59,711 INFO L272 TraceCheckUtils]: 35: Hoare triple {43269#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {43269#true} is VALID [2022-04-28 05:58:59,711 INFO L290 TraceCheckUtils]: 34: Hoare triple {43269#true} assume !!(#t~post8 < 20);havoc #t~post8; {43269#true} is VALID [2022-04-28 05:58:59,711 INFO L290 TraceCheckUtils]: 33: Hoare triple {43269#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {43269#true} is VALID [2022-04-28 05:58:59,711 INFO L290 TraceCheckUtils]: 32: Hoare triple {43269#true} assume !(~r~0 > 0); {43269#true} is VALID [2022-04-28 05:58:59,711 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {43269#true} {43269#true} #96#return; {43269#true} is VALID [2022-04-28 05:58:59,711 INFO L290 TraceCheckUtils]: 30: Hoare triple {43269#true} assume true; {43269#true} is VALID [2022-04-28 05:58:59,711 INFO L290 TraceCheckUtils]: 29: Hoare triple {43269#true} assume !(0 == ~cond); {43269#true} is VALID [2022-04-28 05:58:59,712 INFO L290 TraceCheckUtils]: 28: Hoare triple {43269#true} ~cond := #in~cond; {43269#true} is VALID [2022-04-28 05:58:59,712 INFO L272 TraceCheckUtils]: 27: Hoare triple {43269#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {43269#true} is VALID [2022-04-28 05:58:59,712 INFO L290 TraceCheckUtils]: 26: Hoare triple {43269#true} assume !!(#t~post7 < 20);havoc #t~post7; {43269#true} is VALID [2022-04-28 05:58:59,712 INFO L290 TraceCheckUtils]: 25: Hoare triple {43269#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {43269#true} is VALID [2022-04-28 05:58:59,712 INFO L290 TraceCheckUtils]: 24: Hoare triple {43269#true} assume !!(0 != ~r~0); {43269#true} is VALID [2022-04-28 05:58:59,712 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {43269#true} {43269#true} #94#return; {43269#true} is VALID [2022-04-28 05:58:59,712 INFO L290 TraceCheckUtils]: 22: Hoare triple {43269#true} assume true; {43269#true} is VALID [2022-04-28 05:58:59,712 INFO L290 TraceCheckUtils]: 21: Hoare triple {43269#true} assume !(0 == ~cond); {43269#true} is VALID [2022-04-28 05:58:59,712 INFO L290 TraceCheckUtils]: 20: Hoare triple {43269#true} ~cond := #in~cond; {43269#true} is VALID [2022-04-28 05:58:59,712 INFO L272 TraceCheckUtils]: 19: Hoare triple {43269#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {43269#true} is VALID [2022-04-28 05:58:59,712 INFO L290 TraceCheckUtils]: 18: Hoare triple {43269#true} assume !!(#t~post6 < 20);havoc #t~post6; {43269#true} is VALID [2022-04-28 05:58:59,712 INFO L290 TraceCheckUtils]: 17: Hoare triple {43269#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {43269#true} is VALID [2022-04-28 05:58:59,712 INFO L290 TraceCheckUtils]: 16: Hoare triple {43269#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {43269#true} is VALID [2022-04-28 05:58:59,713 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {43269#true} {43269#true} #92#return; {43269#true} is VALID [2022-04-28 05:58:59,713 INFO L290 TraceCheckUtils]: 14: Hoare triple {43269#true} assume true; {43269#true} is VALID [2022-04-28 05:58:59,713 INFO L290 TraceCheckUtils]: 13: Hoare triple {43269#true} assume !(0 == ~cond); {43269#true} is VALID [2022-04-28 05:58:59,713 INFO L290 TraceCheckUtils]: 12: Hoare triple {43269#true} ~cond := #in~cond; {43269#true} is VALID [2022-04-28 05:58:59,713 INFO L272 TraceCheckUtils]: 11: Hoare triple {43269#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {43269#true} is VALID [2022-04-28 05:58:59,713 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {43269#true} {43269#true} #90#return; {43269#true} is VALID [2022-04-28 05:58:59,713 INFO L290 TraceCheckUtils]: 9: Hoare triple {43269#true} assume true; {43269#true} is VALID [2022-04-28 05:58:59,713 INFO L290 TraceCheckUtils]: 8: Hoare triple {43269#true} assume !(0 == ~cond); {43269#true} is VALID [2022-04-28 05:58:59,713 INFO L290 TraceCheckUtils]: 7: Hoare triple {43269#true} ~cond := #in~cond; {43269#true} is VALID [2022-04-28 05:58:59,713 INFO L272 TraceCheckUtils]: 6: Hoare triple {43269#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {43269#true} is VALID [2022-04-28 05:58:59,713 INFO L290 TraceCheckUtils]: 5: Hoare triple {43269#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {43269#true} is VALID [2022-04-28 05:58:59,713 INFO L272 TraceCheckUtils]: 4: Hoare triple {43269#true} call #t~ret9 := main(); {43269#true} is VALID [2022-04-28 05:58:59,714 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43269#true} {43269#true} #102#return; {43269#true} is VALID [2022-04-28 05:58:59,714 INFO L290 TraceCheckUtils]: 2: Hoare triple {43269#true} assume true; {43269#true} is VALID [2022-04-28 05:58:59,714 INFO L290 TraceCheckUtils]: 1: Hoare triple {43269#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {43269#true} is VALID [2022-04-28 05:58:59,714 INFO L272 TraceCheckUtils]: 0: Hoare triple {43269#true} call ULTIMATE.init(); {43269#true} is VALID [2022-04-28 05:58:59,714 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 60 proven. 24 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2022-04-28 05:58:59,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:58:59,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77271400] [2022-04-28 05:58:59,714 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:58:59,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1742056815] [2022-04-28 05:58:59,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1742056815] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:58:59,715 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:58:59,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-28 05:58:59,715 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:58:59,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1025599175] [2022-04-28 05:58:59,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1025599175] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:58:59,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:58:59,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 05:58:59,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61472526] [2022-04-28 05:58:59,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:58:59,717 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 6 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 105 [2022-04-28 05:58:59,717 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:58:59,718 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 6 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-28 05:58:59,777 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:58:59,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 05:58:59,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:58:59,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 05:58:59,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-28 05:58:59,778 INFO L87 Difference]: Start difference. First operand 377 states and 501 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 6 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-28 05:59:01,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:59:01,664 INFO L93 Difference]: Finished difference Result 649 states and 907 transitions. [2022-04-28 05:59:01,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 05:59:01,664 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 6 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 105 [2022-04-28 05:59:01,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:59:01,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 6 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-28 05:59:01,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 171 transitions. [2022-04-28 05:59:01,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 6 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-28 05:59:01,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 171 transitions. [2022-04-28 05:59:01,668 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 171 transitions. [2022-04-28 05:59:01,854 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:59:01,877 INFO L225 Difference]: With dead ends: 649 [2022-04-28 05:59:01,877 INFO L226 Difference]: Without dead ends: 588 [2022-04-28 05:59:01,881 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-28 05:59:01,881 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 39 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 05:59:01,882 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 274 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 05:59:01,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2022-04-28 05:59:02,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 504. [2022-04-28 05:59:02,922 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:59:02,923 INFO L82 GeneralOperation]: Start isEquivalent. First operand 588 states. Second operand has 504 states, 376 states have (on average 1.247340425531915) internal successors, (469), 386 states have internal predecessors, (469), 114 states have call successors, (114), 15 states have call predecessors, (114), 13 states have return successors, (112), 102 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-28 05:59:02,924 INFO L74 IsIncluded]: Start isIncluded. First operand 588 states. Second operand has 504 states, 376 states have (on average 1.247340425531915) internal successors, (469), 386 states have internal predecessors, (469), 114 states have call successors, (114), 15 states have call predecessors, (114), 13 states have return successors, (112), 102 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-28 05:59:02,924 INFO L87 Difference]: Start difference. First operand 588 states. Second operand has 504 states, 376 states have (on average 1.247340425531915) internal successors, (469), 386 states have internal predecessors, (469), 114 states have call successors, (114), 15 states have call predecessors, (114), 13 states have return successors, (112), 102 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-28 05:59:02,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:59:02,945 INFO L93 Difference]: Finished difference Result 588 states and 816 transitions. [2022-04-28 05:59:02,945 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 816 transitions. [2022-04-28 05:59:02,946 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:59:02,946 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:59:02,947 INFO L74 IsIncluded]: Start isIncluded. First operand has 504 states, 376 states have (on average 1.247340425531915) internal successors, (469), 386 states have internal predecessors, (469), 114 states have call successors, (114), 15 states have call predecessors, (114), 13 states have return successors, (112), 102 states have call predecessors, (112), 112 states have call successors, (112) Second operand 588 states. [2022-04-28 05:59:02,947 INFO L87 Difference]: Start difference. First operand has 504 states, 376 states have (on average 1.247340425531915) internal successors, (469), 386 states have internal predecessors, (469), 114 states have call successors, (114), 15 states have call predecessors, (114), 13 states have return successors, (112), 102 states have call predecessors, (112), 112 states have call successors, (112) Second operand 588 states. [2022-04-28 05:59:02,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:59:02,969 INFO L93 Difference]: Finished difference Result 588 states and 816 transitions. [2022-04-28 05:59:02,969 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 816 transitions. [2022-04-28 05:59:02,970 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:59:02,970 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:59:02,970 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:59:02,970 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:59:02,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 376 states have (on average 1.247340425531915) internal successors, (469), 386 states have internal predecessors, (469), 114 states have call successors, (114), 15 states have call predecessors, (114), 13 states have return successors, (112), 102 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-28 05:59:02,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 695 transitions. [2022-04-28 05:59:02,995 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 695 transitions. Word has length 105 [2022-04-28 05:59:02,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:59:02,995 INFO L495 AbstractCegarLoop]: Abstraction has 504 states and 695 transitions. [2022-04-28 05:59:02,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 6 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-28 05:59:02,996 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 504 states and 695 transitions. [2022-04-28 05:59:06,261 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 695 edges. 694 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 05:59:06,262 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 695 transitions. [2022-04-28 05:59:06,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-04-28 05:59:06,263 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:59:06,263 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:59:06,279 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-04-28 05:59:06,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:59:06,463 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:59:06,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:59:06,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1666981150, now seen corresponding path program 11 times [2022-04-28 05:59:06,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:59:06,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1171325923] [2022-04-28 05:59:06,464 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:59:06,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1666981150, now seen corresponding path program 12 times [2022-04-28 05:59:06,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:59:06,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654262856] [2022-04-28 05:59:06,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:59:06,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:59:06,476 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:59:06,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [703858071] [2022-04-28 05:59:06,477 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 05:59:06,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:59:06,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:59:06,478 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:59:06,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-04-28 05:59:06,606 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 05:59:06,606 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:59:06,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-28 05:59:06,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:59:06,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:59:07,125 INFO L272 TraceCheckUtils]: 0: Hoare triple {47396#true} call ULTIMATE.init(); {47396#true} is VALID [2022-04-28 05:59:07,126 INFO L290 TraceCheckUtils]: 1: Hoare triple {47396#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {47404#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:07,126 INFO L290 TraceCheckUtils]: 2: Hoare triple {47404#(<= ~counter~0 0)} assume true; {47404#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:07,127 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {47404#(<= ~counter~0 0)} {47396#true} #102#return; {47404#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:07,127 INFO L272 TraceCheckUtils]: 4: Hoare triple {47404#(<= ~counter~0 0)} call #t~ret9 := main(); {47404#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:07,127 INFO L290 TraceCheckUtils]: 5: Hoare triple {47404#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {47404#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:07,128 INFO L272 TraceCheckUtils]: 6: Hoare triple {47404#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {47404#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:07,128 INFO L290 TraceCheckUtils]: 7: Hoare triple {47404#(<= ~counter~0 0)} ~cond := #in~cond; {47404#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:07,128 INFO L290 TraceCheckUtils]: 8: Hoare triple {47404#(<= ~counter~0 0)} assume !(0 == ~cond); {47404#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:07,128 INFO L290 TraceCheckUtils]: 9: Hoare triple {47404#(<= ~counter~0 0)} assume true; {47404#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:07,129 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {47404#(<= ~counter~0 0)} {47404#(<= ~counter~0 0)} #90#return; {47404#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:07,129 INFO L272 TraceCheckUtils]: 11: Hoare triple {47404#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {47404#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:07,129 INFO L290 TraceCheckUtils]: 12: Hoare triple {47404#(<= ~counter~0 0)} ~cond := #in~cond; {47404#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:07,130 INFO L290 TraceCheckUtils]: 13: Hoare triple {47404#(<= ~counter~0 0)} assume !(0 == ~cond); {47404#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:07,130 INFO L290 TraceCheckUtils]: 14: Hoare triple {47404#(<= ~counter~0 0)} assume true; {47404#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:07,130 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {47404#(<= ~counter~0 0)} {47404#(<= ~counter~0 0)} #92#return; {47404#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:07,130 INFO L290 TraceCheckUtils]: 16: Hoare triple {47404#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {47404#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:07,132 INFO L290 TraceCheckUtils]: 17: Hoare triple {47404#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {47453#(<= ~counter~0 1)} is VALID [2022-04-28 05:59:07,132 INFO L290 TraceCheckUtils]: 18: Hoare triple {47453#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {47453#(<= ~counter~0 1)} is VALID [2022-04-28 05:59:07,132 INFO L272 TraceCheckUtils]: 19: Hoare triple {47453#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {47453#(<= ~counter~0 1)} is VALID [2022-04-28 05:59:07,133 INFO L290 TraceCheckUtils]: 20: Hoare triple {47453#(<= ~counter~0 1)} ~cond := #in~cond; {47453#(<= ~counter~0 1)} is VALID [2022-04-28 05:59:07,133 INFO L290 TraceCheckUtils]: 21: Hoare triple {47453#(<= ~counter~0 1)} assume !(0 == ~cond); {47453#(<= ~counter~0 1)} is VALID [2022-04-28 05:59:07,133 INFO L290 TraceCheckUtils]: 22: Hoare triple {47453#(<= ~counter~0 1)} assume true; {47453#(<= ~counter~0 1)} is VALID [2022-04-28 05:59:07,134 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {47453#(<= ~counter~0 1)} {47453#(<= ~counter~0 1)} #94#return; {47453#(<= ~counter~0 1)} is VALID [2022-04-28 05:59:07,134 INFO L290 TraceCheckUtils]: 24: Hoare triple {47453#(<= ~counter~0 1)} assume !!(0 != ~r~0); {47453#(<= ~counter~0 1)} is VALID [2022-04-28 05:59:07,134 INFO L290 TraceCheckUtils]: 25: Hoare triple {47453#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {47478#(<= ~counter~0 2)} is VALID [2022-04-28 05:59:07,135 INFO L290 TraceCheckUtils]: 26: Hoare triple {47478#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {47478#(<= ~counter~0 2)} is VALID [2022-04-28 05:59:07,135 INFO L272 TraceCheckUtils]: 27: Hoare triple {47478#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {47478#(<= ~counter~0 2)} is VALID [2022-04-28 05:59:07,135 INFO L290 TraceCheckUtils]: 28: Hoare triple {47478#(<= ~counter~0 2)} ~cond := #in~cond; {47478#(<= ~counter~0 2)} is VALID [2022-04-28 05:59:07,136 INFO L290 TraceCheckUtils]: 29: Hoare triple {47478#(<= ~counter~0 2)} assume !(0 == ~cond); {47478#(<= ~counter~0 2)} is VALID [2022-04-28 05:59:07,136 INFO L290 TraceCheckUtils]: 30: Hoare triple {47478#(<= ~counter~0 2)} assume true; {47478#(<= ~counter~0 2)} is VALID [2022-04-28 05:59:07,136 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {47478#(<= ~counter~0 2)} {47478#(<= ~counter~0 2)} #96#return; {47478#(<= ~counter~0 2)} is VALID [2022-04-28 05:59:07,137 INFO L290 TraceCheckUtils]: 32: Hoare triple {47478#(<= ~counter~0 2)} assume !(~r~0 > 0); {47478#(<= ~counter~0 2)} is VALID [2022-04-28 05:59:07,137 INFO L290 TraceCheckUtils]: 33: Hoare triple {47478#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {47503#(<= ~counter~0 3)} is VALID [2022-04-28 05:59:07,138 INFO L290 TraceCheckUtils]: 34: Hoare triple {47503#(<= ~counter~0 3)} assume !!(#t~post8 < 20);havoc #t~post8; {47503#(<= ~counter~0 3)} is VALID [2022-04-28 05:59:07,138 INFO L272 TraceCheckUtils]: 35: Hoare triple {47503#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {47503#(<= ~counter~0 3)} is VALID [2022-04-28 05:59:07,138 INFO L290 TraceCheckUtils]: 36: Hoare triple {47503#(<= ~counter~0 3)} ~cond := #in~cond; {47503#(<= ~counter~0 3)} is VALID [2022-04-28 05:59:07,139 INFO L290 TraceCheckUtils]: 37: Hoare triple {47503#(<= ~counter~0 3)} assume !(0 == ~cond); {47503#(<= ~counter~0 3)} is VALID [2022-04-28 05:59:07,139 INFO L290 TraceCheckUtils]: 38: Hoare triple {47503#(<= ~counter~0 3)} assume true; {47503#(<= ~counter~0 3)} is VALID [2022-04-28 05:59:07,139 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {47503#(<= ~counter~0 3)} {47503#(<= ~counter~0 3)} #98#return; {47503#(<= ~counter~0 3)} is VALID [2022-04-28 05:59:07,140 INFO L290 TraceCheckUtils]: 40: Hoare triple {47503#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {47503#(<= ~counter~0 3)} is VALID [2022-04-28 05:59:07,140 INFO L290 TraceCheckUtils]: 41: Hoare triple {47503#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {47528#(<= ~counter~0 4)} is VALID [2022-04-28 05:59:07,140 INFO L290 TraceCheckUtils]: 42: Hoare triple {47528#(<= ~counter~0 4)} assume !!(#t~post8 < 20);havoc #t~post8; {47528#(<= ~counter~0 4)} is VALID [2022-04-28 05:59:07,141 INFO L272 TraceCheckUtils]: 43: Hoare triple {47528#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {47528#(<= ~counter~0 4)} is VALID [2022-04-28 05:59:07,141 INFO L290 TraceCheckUtils]: 44: Hoare triple {47528#(<= ~counter~0 4)} ~cond := #in~cond; {47528#(<= ~counter~0 4)} is VALID [2022-04-28 05:59:07,141 INFO L290 TraceCheckUtils]: 45: Hoare triple {47528#(<= ~counter~0 4)} assume !(0 == ~cond); {47528#(<= ~counter~0 4)} is VALID [2022-04-28 05:59:07,142 INFO L290 TraceCheckUtils]: 46: Hoare triple {47528#(<= ~counter~0 4)} assume true; {47528#(<= ~counter~0 4)} is VALID [2022-04-28 05:59:07,142 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {47528#(<= ~counter~0 4)} {47528#(<= ~counter~0 4)} #98#return; {47528#(<= ~counter~0 4)} is VALID [2022-04-28 05:59:07,142 INFO L290 TraceCheckUtils]: 48: Hoare triple {47528#(<= ~counter~0 4)} assume !(~r~0 < 0); {47528#(<= ~counter~0 4)} is VALID [2022-04-28 05:59:07,143 INFO L290 TraceCheckUtils]: 49: Hoare triple {47528#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {47553#(<= ~counter~0 5)} is VALID [2022-04-28 05:59:07,143 INFO L290 TraceCheckUtils]: 50: Hoare triple {47553#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {47553#(<= ~counter~0 5)} is VALID [2022-04-28 05:59:07,144 INFO L272 TraceCheckUtils]: 51: Hoare triple {47553#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {47553#(<= ~counter~0 5)} is VALID [2022-04-28 05:59:07,144 INFO L290 TraceCheckUtils]: 52: Hoare triple {47553#(<= ~counter~0 5)} ~cond := #in~cond; {47553#(<= ~counter~0 5)} is VALID [2022-04-28 05:59:07,144 INFO L290 TraceCheckUtils]: 53: Hoare triple {47553#(<= ~counter~0 5)} assume !(0 == ~cond); {47553#(<= ~counter~0 5)} is VALID [2022-04-28 05:59:07,145 INFO L290 TraceCheckUtils]: 54: Hoare triple {47553#(<= ~counter~0 5)} assume true; {47553#(<= ~counter~0 5)} is VALID [2022-04-28 05:59:07,145 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {47553#(<= ~counter~0 5)} {47553#(<= ~counter~0 5)} #94#return; {47553#(<= ~counter~0 5)} is VALID [2022-04-28 05:59:07,145 INFO L290 TraceCheckUtils]: 56: Hoare triple {47553#(<= ~counter~0 5)} assume !!(0 != ~r~0); {47553#(<= ~counter~0 5)} is VALID [2022-04-28 05:59:07,146 INFO L290 TraceCheckUtils]: 57: Hoare triple {47553#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {47578#(<= ~counter~0 6)} is VALID [2022-04-28 05:59:07,146 INFO L290 TraceCheckUtils]: 58: Hoare triple {47578#(<= ~counter~0 6)} assume !!(#t~post7 < 20);havoc #t~post7; {47578#(<= ~counter~0 6)} is VALID [2022-04-28 05:59:07,147 INFO L272 TraceCheckUtils]: 59: Hoare triple {47578#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {47578#(<= ~counter~0 6)} is VALID [2022-04-28 05:59:07,147 INFO L290 TraceCheckUtils]: 60: Hoare triple {47578#(<= ~counter~0 6)} ~cond := #in~cond; {47578#(<= ~counter~0 6)} is VALID [2022-04-28 05:59:07,147 INFO L290 TraceCheckUtils]: 61: Hoare triple {47578#(<= ~counter~0 6)} assume !(0 == ~cond); {47578#(<= ~counter~0 6)} is VALID [2022-04-28 05:59:07,147 INFO L290 TraceCheckUtils]: 62: Hoare triple {47578#(<= ~counter~0 6)} assume true; {47578#(<= ~counter~0 6)} is VALID [2022-04-28 05:59:07,148 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {47578#(<= ~counter~0 6)} {47578#(<= ~counter~0 6)} #96#return; {47578#(<= ~counter~0 6)} is VALID [2022-04-28 05:59:07,148 INFO L290 TraceCheckUtils]: 64: Hoare triple {47578#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {47578#(<= ~counter~0 6)} is VALID [2022-04-28 05:59:07,149 INFO L290 TraceCheckUtils]: 65: Hoare triple {47578#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {47603#(<= ~counter~0 7)} is VALID [2022-04-28 05:59:07,149 INFO L290 TraceCheckUtils]: 66: Hoare triple {47603#(<= ~counter~0 7)} assume !!(#t~post7 < 20);havoc #t~post7; {47603#(<= ~counter~0 7)} is VALID [2022-04-28 05:59:07,150 INFO L272 TraceCheckUtils]: 67: Hoare triple {47603#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {47603#(<= ~counter~0 7)} is VALID [2022-04-28 05:59:07,150 INFO L290 TraceCheckUtils]: 68: Hoare triple {47603#(<= ~counter~0 7)} ~cond := #in~cond; {47603#(<= ~counter~0 7)} is VALID [2022-04-28 05:59:07,150 INFO L290 TraceCheckUtils]: 69: Hoare triple {47603#(<= ~counter~0 7)} assume !(0 == ~cond); {47603#(<= ~counter~0 7)} is VALID [2022-04-28 05:59:07,150 INFO L290 TraceCheckUtils]: 70: Hoare triple {47603#(<= ~counter~0 7)} assume true; {47603#(<= ~counter~0 7)} is VALID [2022-04-28 05:59:07,151 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {47603#(<= ~counter~0 7)} {47603#(<= ~counter~0 7)} #96#return; {47603#(<= ~counter~0 7)} is VALID [2022-04-28 05:59:07,151 INFO L290 TraceCheckUtils]: 72: Hoare triple {47603#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {47603#(<= ~counter~0 7)} is VALID [2022-04-28 05:59:07,152 INFO L290 TraceCheckUtils]: 73: Hoare triple {47603#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {47628#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:07,152 INFO L290 TraceCheckUtils]: 74: Hoare triple {47628#(<= ~counter~0 8)} assume !!(#t~post7 < 20);havoc #t~post7; {47628#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:07,152 INFO L272 TraceCheckUtils]: 75: Hoare triple {47628#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {47628#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:07,153 INFO L290 TraceCheckUtils]: 76: Hoare triple {47628#(<= ~counter~0 8)} ~cond := #in~cond; {47628#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:07,153 INFO L290 TraceCheckUtils]: 77: Hoare triple {47628#(<= ~counter~0 8)} assume !(0 == ~cond); {47628#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:07,153 INFO L290 TraceCheckUtils]: 78: Hoare triple {47628#(<= ~counter~0 8)} assume true; {47628#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:07,154 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {47628#(<= ~counter~0 8)} {47628#(<= ~counter~0 8)} #96#return; {47628#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:07,154 INFO L290 TraceCheckUtils]: 80: Hoare triple {47628#(<= ~counter~0 8)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {47628#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:07,154 INFO L290 TraceCheckUtils]: 81: Hoare triple {47628#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {47653#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:07,155 INFO L290 TraceCheckUtils]: 82: Hoare triple {47653#(<= ~counter~0 9)} assume !!(#t~post7 < 20);havoc #t~post7; {47653#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:07,155 INFO L272 TraceCheckUtils]: 83: Hoare triple {47653#(<= ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {47653#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:07,155 INFO L290 TraceCheckUtils]: 84: Hoare triple {47653#(<= ~counter~0 9)} ~cond := #in~cond; {47653#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:07,156 INFO L290 TraceCheckUtils]: 85: Hoare triple {47653#(<= ~counter~0 9)} assume !(0 == ~cond); {47653#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:07,156 INFO L290 TraceCheckUtils]: 86: Hoare triple {47653#(<= ~counter~0 9)} assume true; {47653#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:07,156 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {47653#(<= ~counter~0 9)} {47653#(<= ~counter~0 9)} #96#return; {47653#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:07,157 INFO L290 TraceCheckUtils]: 88: Hoare triple {47653#(<= ~counter~0 9)} assume !(~r~0 > 0); {47653#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:07,157 INFO L290 TraceCheckUtils]: 89: Hoare triple {47653#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {47678#(<= ~counter~0 10)} is VALID [2022-04-28 05:59:07,158 INFO L290 TraceCheckUtils]: 90: Hoare triple {47678#(<= ~counter~0 10)} assume !!(#t~post8 < 20);havoc #t~post8; {47678#(<= ~counter~0 10)} is VALID [2022-04-28 05:59:07,158 INFO L272 TraceCheckUtils]: 91: Hoare triple {47678#(<= ~counter~0 10)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {47678#(<= ~counter~0 10)} is VALID [2022-04-28 05:59:07,158 INFO L290 TraceCheckUtils]: 92: Hoare triple {47678#(<= ~counter~0 10)} ~cond := #in~cond; {47678#(<= ~counter~0 10)} is VALID [2022-04-28 05:59:07,159 INFO L290 TraceCheckUtils]: 93: Hoare triple {47678#(<= ~counter~0 10)} assume !(0 == ~cond); {47678#(<= ~counter~0 10)} is VALID [2022-04-28 05:59:07,159 INFO L290 TraceCheckUtils]: 94: Hoare triple {47678#(<= ~counter~0 10)} assume true; {47678#(<= ~counter~0 10)} is VALID [2022-04-28 05:59:07,159 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {47678#(<= ~counter~0 10)} {47678#(<= ~counter~0 10)} #98#return; {47678#(<= ~counter~0 10)} is VALID [2022-04-28 05:59:07,160 INFO L290 TraceCheckUtils]: 96: Hoare triple {47678#(<= ~counter~0 10)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {47678#(<= ~counter~0 10)} is VALID [2022-04-28 05:59:07,160 INFO L290 TraceCheckUtils]: 97: Hoare triple {47678#(<= ~counter~0 10)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {47703#(<= |main_#t~post8| 10)} is VALID [2022-04-28 05:59:07,160 INFO L290 TraceCheckUtils]: 98: Hoare triple {47703#(<= |main_#t~post8| 10)} assume !(#t~post8 < 20);havoc #t~post8; {47397#false} is VALID [2022-04-28 05:59:07,160 INFO L290 TraceCheckUtils]: 99: Hoare triple {47397#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {47397#false} is VALID [2022-04-28 05:59:07,160 INFO L290 TraceCheckUtils]: 100: Hoare triple {47397#false} assume !(#t~post6 < 20);havoc #t~post6; {47397#false} is VALID [2022-04-28 05:59:07,160 INFO L272 TraceCheckUtils]: 101: Hoare triple {47397#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {47397#false} is VALID [2022-04-28 05:59:07,160 INFO L290 TraceCheckUtils]: 102: Hoare triple {47397#false} ~cond := #in~cond; {47397#false} is VALID [2022-04-28 05:59:07,160 INFO L290 TraceCheckUtils]: 103: Hoare triple {47397#false} assume 0 == ~cond; {47397#false} is VALID [2022-04-28 05:59:07,161 INFO L290 TraceCheckUtils]: 104: Hoare triple {47397#false} assume !false; {47397#false} is VALID [2022-04-28 05:59:07,161 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 24 proven. 242 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 05:59:07,161 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:59:07,690 INFO L290 TraceCheckUtils]: 104: Hoare triple {47397#false} assume !false; {47397#false} is VALID [2022-04-28 05:59:07,690 INFO L290 TraceCheckUtils]: 103: Hoare triple {47397#false} assume 0 == ~cond; {47397#false} is VALID [2022-04-28 05:59:07,690 INFO L290 TraceCheckUtils]: 102: Hoare triple {47397#false} ~cond := #in~cond; {47397#false} is VALID [2022-04-28 05:59:07,690 INFO L272 TraceCheckUtils]: 101: Hoare triple {47397#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {47397#false} is VALID [2022-04-28 05:59:07,690 INFO L290 TraceCheckUtils]: 100: Hoare triple {47397#false} assume !(#t~post6 < 20);havoc #t~post6; {47397#false} is VALID [2022-04-28 05:59:07,690 INFO L290 TraceCheckUtils]: 99: Hoare triple {47397#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {47397#false} is VALID [2022-04-28 05:59:07,691 INFO L290 TraceCheckUtils]: 98: Hoare triple {47743#(< |main_#t~post8| 20)} assume !(#t~post8 < 20);havoc #t~post8; {47397#false} is VALID [2022-04-28 05:59:07,691 INFO L290 TraceCheckUtils]: 97: Hoare triple {47747#(< ~counter~0 20)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {47743#(< |main_#t~post8| 20)} is VALID [2022-04-28 05:59:07,691 INFO L290 TraceCheckUtils]: 96: Hoare triple {47747#(< ~counter~0 20)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {47747#(< ~counter~0 20)} is VALID [2022-04-28 05:59:07,692 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {47396#true} {47747#(< ~counter~0 20)} #98#return; {47747#(< ~counter~0 20)} is VALID [2022-04-28 05:59:07,692 INFO L290 TraceCheckUtils]: 94: Hoare triple {47396#true} assume true; {47396#true} is VALID [2022-04-28 05:59:07,692 INFO L290 TraceCheckUtils]: 93: Hoare triple {47396#true} assume !(0 == ~cond); {47396#true} is VALID [2022-04-28 05:59:07,692 INFO L290 TraceCheckUtils]: 92: Hoare triple {47396#true} ~cond := #in~cond; {47396#true} is VALID [2022-04-28 05:59:07,692 INFO L272 TraceCheckUtils]: 91: Hoare triple {47747#(< ~counter~0 20)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {47396#true} is VALID [2022-04-28 05:59:07,692 INFO L290 TraceCheckUtils]: 90: Hoare triple {47747#(< ~counter~0 20)} assume !!(#t~post8 < 20);havoc #t~post8; {47747#(< ~counter~0 20)} is VALID [2022-04-28 05:59:07,693 INFO L290 TraceCheckUtils]: 89: Hoare triple {47772#(< ~counter~0 19)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {47747#(< ~counter~0 20)} is VALID [2022-04-28 05:59:07,694 INFO L290 TraceCheckUtils]: 88: Hoare triple {47772#(< ~counter~0 19)} assume !(~r~0 > 0); {47772#(< ~counter~0 19)} is VALID [2022-04-28 05:59:07,694 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {47396#true} {47772#(< ~counter~0 19)} #96#return; {47772#(< ~counter~0 19)} is VALID [2022-04-28 05:59:07,694 INFO L290 TraceCheckUtils]: 86: Hoare triple {47396#true} assume true; {47396#true} is VALID [2022-04-28 05:59:07,694 INFO L290 TraceCheckUtils]: 85: Hoare triple {47396#true} assume !(0 == ~cond); {47396#true} is VALID [2022-04-28 05:59:07,694 INFO L290 TraceCheckUtils]: 84: Hoare triple {47396#true} ~cond := #in~cond; {47396#true} is VALID [2022-04-28 05:59:07,694 INFO L272 TraceCheckUtils]: 83: Hoare triple {47772#(< ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {47396#true} is VALID [2022-04-28 05:59:07,695 INFO L290 TraceCheckUtils]: 82: Hoare triple {47772#(< ~counter~0 19)} assume !!(#t~post7 < 20);havoc #t~post7; {47772#(< ~counter~0 19)} is VALID [2022-04-28 05:59:07,695 INFO L290 TraceCheckUtils]: 81: Hoare triple {47797#(< ~counter~0 18)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {47772#(< ~counter~0 19)} is VALID [2022-04-28 05:59:07,695 INFO L290 TraceCheckUtils]: 80: Hoare triple {47797#(< ~counter~0 18)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {47797#(< ~counter~0 18)} is VALID [2022-04-28 05:59:07,696 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {47396#true} {47797#(< ~counter~0 18)} #96#return; {47797#(< ~counter~0 18)} is VALID [2022-04-28 05:59:07,696 INFO L290 TraceCheckUtils]: 78: Hoare triple {47396#true} assume true; {47396#true} is VALID [2022-04-28 05:59:07,696 INFO L290 TraceCheckUtils]: 77: Hoare triple {47396#true} assume !(0 == ~cond); {47396#true} is VALID [2022-04-28 05:59:07,696 INFO L290 TraceCheckUtils]: 76: Hoare triple {47396#true} ~cond := #in~cond; {47396#true} is VALID [2022-04-28 05:59:07,696 INFO L272 TraceCheckUtils]: 75: Hoare triple {47797#(< ~counter~0 18)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {47396#true} is VALID [2022-04-28 05:59:07,696 INFO L290 TraceCheckUtils]: 74: Hoare triple {47797#(< ~counter~0 18)} assume !!(#t~post7 < 20);havoc #t~post7; {47797#(< ~counter~0 18)} is VALID [2022-04-28 05:59:07,697 INFO L290 TraceCheckUtils]: 73: Hoare triple {47822#(< ~counter~0 17)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {47797#(< ~counter~0 18)} is VALID [2022-04-28 05:59:07,697 INFO L290 TraceCheckUtils]: 72: Hoare triple {47822#(< ~counter~0 17)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {47822#(< ~counter~0 17)} is VALID [2022-04-28 05:59:07,698 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {47396#true} {47822#(< ~counter~0 17)} #96#return; {47822#(< ~counter~0 17)} is VALID [2022-04-28 05:59:07,698 INFO L290 TraceCheckUtils]: 70: Hoare triple {47396#true} assume true; {47396#true} is VALID [2022-04-28 05:59:07,698 INFO L290 TraceCheckUtils]: 69: Hoare triple {47396#true} assume !(0 == ~cond); {47396#true} is VALID [2022-04-28 05:59:07,698 INFO L290 TraceCheckUtils]: 68: Hoare triple {47396#true} ~cond := #in~cond; {47396#true} is VALID [2022-04-28 05:59:07,698 INFO L272 TraceCheckUtils]: 67: Hoare triple {47822#(< ~counter~0 17)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {47396#true} is VALID [2022-04-28 05:59:07,698 INFO L290 TraceCheckUtils]: 66: Hoare triple {47822#(< ~counter~0 17)} assume !!(#t~post7 < 20);havoc #t~post7; {47822#(< ~counter~0 17)} is VALID [2022-04-28 05:59:07,699 INFO L290 TraceCheckUtils]: 65: Hoare triple {47847#(< ~counter~0 16)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {47822#(< ~counter~0 17)} is VALID [2022-04-28 05:59:07,699 INFO L290 TraceCheckUtils]: 64: Hoare triple {47847#(< ~counter~0 16)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {47847#(< ~counter~0 16)} is VALID [2022-04-28 05:59:07,700 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {47396#true} {47847#(< ~counter~0 16)} #96#return; {47847#(< ~counter~0 16)} is VALID [2022-04-28 05:59:07,700 INFO L290 TraceCheckUtils]: 62: Hoare triple {47396#true} assume true; {47396#true} is VALID [2022-04-28 05:59:07,700 INFO L290 TraceCheckUtils]: 61: Hoare triple {47396#true} assume !(0 == ~cond); {47396#true} is VALID [2022-04-28 05:59:07,700 INFO L290 TraceCheckUtils]: 60: Hoare triple {47396#true} ~cond := #in~cond; {47396#true} is VALID [2022-04-28 05:59:07,700 INFO L272 TraceCheckUtils]: 59: Hoare triple {47847#(< ~counter~0 16)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {47396#true} is VALID [2022-04-28 05:59:07,700 INFO L290 TraceCheckUtils]: 58: Hoare triple {47847#(< ~counter~0 16)} assume !!(#t~post7 < 20);havoc #t~post7; {47847#(< ~counter~0 16)} is VALID [2022-04-28 05:59:07,701 INFO L290 TraceCheckUtils]: 57: Hoare triple {47872#(< ~counter~0 15)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {47847#(< ~counter~0 16)} is VALID [2022-04-28 05:59:07,701 INFO L290 TraceCheckUtils]: 56: Hoare triple {47872#(< ~counter~0 15)} assume !!(0 != ~r~0); {47872#(< ~counter~0 15)} is VALID [2022-04-28 05:59:07,701 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {47396#true} {47872#(< ~counter~0 15)} #94#return; {47872#(< ~counter~0 15)} is VALID [2022-04-28 05:59:07,702 INFO L290 TraceCheckUtils]: 54: Hoare triple {47396#true} assume true; {47396#true} is VALID [2022-04-28 05:59:07,702 INFO L290 TraceCheckUtils]: 53: Hoare triple {47396#true} assume !(0 == ~cond); {47396#true} is VALID [2022-04-28 05:59:07,702 INFO L290 TraceCheckUtils]: 52: Hoare triple {47396#true} ~cond := #in~cond; {47396#true} is VALID [2022-04-28 05:59:07,702 INFO L272 TraceCheckUtils]: 51: Hoare triple {47872#(< ~counter~0 15)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {47396#true} is VALID [2022-04-28 05:59:07,702 INFO L290 TraceCheckUtils]: 50: Hoare triple {47872#(< ~counter~0 15)} assume !!(#t~post6 < 20);havoc #t~post6; {47872#(< ~counter~0 15)} is VALID [2022-04-28 05:59:07,703 INFO L290 TraceCheckUtils]: 49: Hoare triple {47897#(< ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {47872#(< ~counter~0 15)} is VALID [2022-04-28 05:59:07,703 INFO L290 TraceCheckUtils]: 48: Hoare triple {47897#(< ~counter~0 14)} assume !(~r~0 < 0); {47897#(< ~counter~0 14)} is VALID [2022-04-28 05:59:07,703 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {47396#true} {47897#(< ~counter~0 14)} #98#return; {47897#(< ~counter~0 14)} is VALID [2022-04-28 05:59:07,703 INFO L290 TraceCheckUtils]: 46: Hoare triple {47396#true} assume true; {47396#true} is VALID [2022-04-28 05:59:07,703 INFO L290 TraceCheckUtils]: 45: Hoare triple {47396#true} assume !(0 == ~cond); {47396#true} is VALID [2022-04-28 05:59:07,704 INFO L290 TraceCheckUtils]: 44: Hoare triple {47396#true} ~cond := #in~cond; {47396#true} is VALID [2022-04-28 05:59:07,704 INFO L272 TraceCheckUtils]: 43: Hoare triple {47897#(< ~counter~0 14)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {47396#true} is VALID [2022-04-28 05:59:07,704 INFO L290 TraceCheckUtils]: 42: Hoare triple {47897#(< ~counter~0 14)} assume !!(#t~post8 < 20);havoc #t~post8; {47897#(< ~counter~0 14)} is VALID [2022-04-28 05:59:07,704 INFO L290 TraceCheckUtils]: 41: Hoare triple {47922#(< ~counter~0 13)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {47897#(< ~counter~0 14)} is VALID [2022-04-28 05:59:07,705 INFO L290 TraceCheckUtils]: 40: Hoare triple {47922#(< ~counter~0 13)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {47922#(< ~counter~0 13)} is VALID [2022-04-28 05:59:07,705 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {47396#true} {47922#(< ~counter~0 13)} #98#return; {47922#(< ~counter~0 13)} is VALID [2022-04-28 05:59:07,705 INFO L290 TraceCheckUtils]: 38: Hoare triple {47396#true} assume true; {47396#true} is VALID [2022-04-28 05:59:07,705 INFO L290 TraceCheckUtils]: 37: Hoare triple {47396#true} assume !(0 == ~cond); {47396#true} is VALID [2022-04-28 05:59:07,705 INFO L290 TraceCheckUtils]: 36: Hoare triple {47396#true} ~cond := #in~cond; {47396#true} is VALID [2022-04-28 05:59:07,705 INFO L272 TraceCheckUtils]: 35: Hoare triple {47922#(< ~counter~0 13)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {47396#true} is VALID [2022-04-28 05:59:07,706 INFO L290 TraceCheckUtils]: 34: Hoare triple {47922#(< ~counter~0 13)} assume !!(#t~post8 < 20);havoc #t~post8; {47922#(< ~counter~0 13)} is VALID [2022-04-28 05:59:07,706 INFO L290 TraceCheckUtils]: 33: Hoare triple {47947#(< ~counter~0 12)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {47922#(< ~counter~0 13)} is VALID [2022-04-28 05:59:07,707 INFO L290 TraceCheckUtils]: 32: Hoare triple {47947#(< ~counter~0 12)} assume !(~r~0 > 0); {47947#(< ~counter~0 12)} is VALID [2022-04-28 05:59:07,707 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {47396#true} {47947#(< ~counter~0 12)} #96#return; {47947#(< ~counter~0 12)} is VALID [2022-04-28 05:59:07,707 INFO L290 TraceCheckUtils]: 30: Hoare triple {47396#true} assume true; {47396#true} is VALID [2022-04-28 05:59:07,707 INFO L290 TraceCheckUtils]: 29: Hoare triple {47396#true} assume !(0 == ~cond); {47396#true} is VALID [2022-04-28 05:59:07,707 INFO L290 TraceCheckUtils]: 28: Hoare triple {47396#true} ~cond := #in~cond; {47396#true} is VALID [2022-04-28 05:59:07,707 INFO L272 TraceCheckUtils]: 27: Hoare triple {47947#(< ~counter~0 12)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {47396#true} is VALID [2022-04-28 05:59:07,707 INFO L290 TraceCheckUtils]: 26: Hoare triple {47947#(< ~counter~0 12)} assume !!(#t~post7 < 20);havoc #t~post7; {47947#(< ~counter~0 12)} is VALID [2022-04-28 05:59:07,708 INFO L290 TraceCheckUtils]: 25: Hoare triple {47678#(<= ~counter~0 10)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {47947#(< ~counter~0 12)} is VALID [2022-04-28 05:59:07,708 INFO L290 TraceCheckUtils]: 24: Hoare triple {47678#(<= ~counter~0 10)} assume !!(0 != ~r~0); {47678#(<= ~counter~0 10)} is VALID [2022-04-28 05:59:07,709 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {47396#true} {47678#(<= ~counter~0 10)} #94#return; {47678#(<= ~counter~0 10)} is VALID [2022-04-28 05:59:07,709 INFO L290 TraceCheckUtils]: 22: Hoare triple {47396#true} assume true; {47396#true} is VALID [2022-04-28 05:59:07,709 INFO L290 TraceCheckUtils]: 21: Hoare triple {47396#true} assume !(0 == ~cond); {47396#true} is VALID [2022-04-28 05:59:07,709 INFO L290 TraceCheckUtils]: 20: Hoare triple {47396#true} ~cond := #in~cond; {47396#true} is VALID [2022-04-28 05:59:07,709 INFO L272 TraceCheckUtils]: 19: Hoare triple {47678#(<= ~counter~0 10)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {47396#true} is VALID [2022-04-28 05:59:07,709 INFO L290 TraceCheckUtils]: 18: Hoare triple {47678#(<= ~counter~0 10)} assume !!(#t~post6 < 20);havoc #t~post6; {47678#(<= ~counter~0 10)} is VALID [2022-04-28 05:59:07,710 INFO L290 TraceCheckUtils]: 17: Hoare triple {47653#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {47678#(<= ~counter~0 10)} is VALID [2022-04-28 05:59:07,710 INFO L290 TraceCheckUtils]: 16: Hoare triple {47653#(<= ~counter~0 9)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {47653#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:07,711 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {47396#true} {47653#(<= ~counter~0 9)} #92#return; {47653#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:07,711 INFO L290 TraceCheckUtils]: 14: Hoare triple {47396#true} assume true; {47396#true} is VALID [2022-04-28 05:59:07,711 INFO L290 TraceCheckUtils]: 13: Hoare triple {47396#true} assume !(0 == ~cond); {47396#true} is VALID [2022-04-28 05:59:07,711 INFO L290 TraceCheckUtils]: 12: Hoare triple {47396#true} ~cond := #in~cond; {47396#true} is VALID [2022-04-28 05:59:07,711 INFO L272 TraceCheckUtils]: 11: Hoare triple {47653#(<= ~counter~0 9)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {47396#true} is VALID [2022-04-28 05:59:07,711 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {47396#true} {47653#(<= ~counter~0 9)} #90#return; {47653#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:07,711 INFO L290 TraceCheckUtils]: 9: Hoare triple {47396#true} assume true; {47396#true} is VALID [2022-04-28 05:59:07,711 INFO L290 TraceCheckUtils]: 8: Hoare triple {47396#true} assume !(0 == ~cond); {47396#true} is VALID [2022-04-28 05:59:07,711 INFO L290 TraceCheckUtils]: 7: Hoare triple {47396#true} ~cond := #in~cond; {47396#true} is VALID [2022-04-28 05:59:07,711 INFO L272 TraceCheckUtils]: 6: Hoare triple {47653#(<= ~counter~0 9)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {47396#true} is VALID [2022-04-28 05:59:07,712 INFO L290 TraceCheckUtils]: 5: Hoare triple {47653#(<= ~counter~0 9)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {47653#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:07,712 INFO L272 TraceCheckUtils]: 4: Hoare triple {47653#(<= ~counter~0 9)} call #t~ret9 := main(); {47653#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:07,712 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {47653#(<= ~counter~0 9)} {47396#true} #102#return; {47653#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:07,712 INFO L290 TraceCheckUtils]: 2: Hoare triple {47653#(<= ~counter~0 9)} assume true; {47653#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:07,713 INFO L290 TraceCheckUtils]: 1: Hoare triple {47396#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {47653#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:07,713 INFO L272 TraceCheckUtils]: 0: Hoare triple {47396#true} call ULTIMATE.init(); {47396#true} is VALID [2022-04-28 05:59:07,713 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 24 proven. 62 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2022-04-28 05:59:07,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:59:07,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654262856] [2022-04-28 05:59:07,713 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:59:07,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [703858071] [2022-04-28 05:59:07,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [703858071] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:59:07,714 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:59:07,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2022-04-28 05:59:07,714 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:59:07,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1171325923] [2022-04-28 05:59:07,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1171325923] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:59:07,714 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:59:07,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 05:59:07,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805179042] [2022-04-28 05:59:07,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:59:07,714 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 13 states have internal predecessors, (74), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) Word has length 105 [2022-04-28 05:59:07,715 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:59:07,715 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 13 states have internal predecessors, (74), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-28 05:59:07,787 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:59:07,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 05:59:07,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:59:07,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 05:59:07,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-28 05:59:07,788 INFO L87 Difference]: Start difference. First operand 504 states and 695 transitions. Second operand has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 13 states have internal predecessors, (74), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-28 05:59:09,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:59:09,522 INFO L93 Difference]: Finished difference Result 753 states and 1073 transitions. [2022-04-28 05:59:09,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-28 05:59:09,522 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 13 states have internal predecessors, (74), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) Word has length 105 [2022-04-28 05:59:09,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:59:09,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 13 states have internal predecessors, (74), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-28 05:59:09,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 236 transitions. [2022-04-28 05:59:09,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 13 states have internal predecessors, (74), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-28 05:59:09,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 236 transitions. [2022-04-28 05:59:09,526 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 236 transitions. [2022-04-28 05:59:09,704 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 236 edges. 236 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:59:09,722 INFO L225 Difference]: With dead ends: 753 [2022-04-28 05:59:09,723 INFO L226 Difference]: Without dead ends: 532 [2022-04-28 05:59:09,723 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 186 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=404, Invalid=588, Unknown=0, NotChecked=0, Total=992 [2022-04-28 05:59:09,724 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 113 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 05:59:09,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 263 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 05:59:09,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2022-04-28 05:59:10,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 522. [2022-04-28 05:59:10,836 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:59:10,837 INFO L82 GeneralOperation]: Start isEquivalent. First operand 532 states. Second operand has 522 states, 394 states have (on average 1.2461928934010151) internal successors, (491), 398 states have internal predecessors, (491), 114 states have call successors, (114), 15 states have call predecessors, (114), 13 states have return successors, (112), 108 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-28 05:59:10,837 INFO L74 IsIncluded]: Start isIncluded. First operand 532 states. Second operand has 522 states, 394 states have (on average 1.2461928934010151) internal successors, (491), 398 states have internal predecessors, (491), 114 states have call successors, (114), 15 states have call predecessors, (114), 13 states have return successors, (112), 108 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-28 05:59:10,838 INFO L87 Difference]: Start difference. First operand 532 states. Second operand has 522 states, 394 states have (on average 1.2461928934010151) internal successors, (491), 398 states have internal predecessors, (491), 114 states have call successors, (114), 15 states have call predecessors, (114), 13 states have return successors, (112), 108 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-28 05:59:10,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:59:10,854 INFO L93 Difference]: Finished difference Result 532 states and 727 transitions. [2022-04-28 05:59:10,854 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 727 transitions. [2022-04-28 05:59:10,855 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:59:10,855 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:59:10,856 INFO L74 IsIncluded]: Start isIncluded. First operand has 522 states, 394 states have (on average 1.2461928934010151) internal successors, (491), 398 states have internal predecessors, (491), 114 states have call successors, (114), 15 states have call predecessors, (114), 13 states have return successors, (112), 108 states have call predecessors, (112), 112 states have call successors, (112) Second operand 532 states. [2022-04-28 05:59:10,856 INFO L87 Difference]: Start difference. First operand has 522 states, 394 states have (on average 1.2461928934010151) internal successors, (491), 398 states have internal predecessors, (491), 114 states have call successors, (114), 15 states have call predecessors, (114), 13 states have return successors, (112), 108 states have call predecessors, (112), 112 states have call successors, (112) Second operand 532 states. [2022-04-28 05:59:10,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:59:10,873 INFO L93 Difference]: Finished difference Result 532 states and 727 transitions. [2022-04-28 05:59:10,873 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 727 transitions. [2022-04-28 05:59:10,874 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:59:10,874 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:59:10,874 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:59:10,874 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:59:10,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 394 states have (on average 1.2461928934010151) internal successors, (491), 398 states have internal predecessors, (491), 114 states have call successors, (114), 15 states have call predecessors, (114), 13 states have return successors, (112), 108 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-28 05:59:10,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 717 transitions. [2022-04-28 05:59:10,895 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 717 transitions. Word has length 105 [2022-04-28 05:59:10,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:59:10,895 INFO L495 AbstractCegarLoop]: Abstraction has 522 states and 717 transitions. [2022-04-28 05:59:10,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 13 states have internal predecessors, (74), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-28 05:59:10,896 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 522 states and 717 transitions. [2022-04-28 05:59:13,332 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 717 edges. 717 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:59:13,333 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 717 transitions. [2022-04-28 05:59:13,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-04-28 05:59:13,334 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:59:13,334 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 7, 6, 6, 6, 5, 3, 3, 2, 2, 2, 2, 2, 2, 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-04-28 05:59:13,351 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2022-04-28 05:59:13,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-04-28 05:59:13,539 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:59:13,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:59:13,539 INFO L85 PathProgramCache]: Analyzing trace with hash -2132095591, now seen corresponding path program 11 times [2022-04-28 05:59:13,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:59:13,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1100081323] [2022-04-28 05:59:13,540 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:59:13,540 INFO L85 PathProgramCache]: Analyzing trace with hash -2132095591, now seen corresponding path program 12 times [2022-04-28 05:59:13,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:59:13,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361871887] [2022-04-28 05:59:13,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:59:13,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:59:13,551 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:59:13,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [545246589] [2022-04-28 05:59:13,551 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 05:59:13,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:59:13,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:59:13,552 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:59:13,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-04-28 05:59:13,668 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 05:59:13,668 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:59:13,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-28 05:59:13,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:59:13,690 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:59:14,193 INFO L272 TraceCheckUtils]: 0: Hoare triple {51679#true} call ULTIMATE.init(); {51679#true} is VALID [2022-04-28 05:59:14,194 INFO L290 TraceCheckUtils]: 1: Hoare triple {51679#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {51687#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:14,194 INFO L290 TraceCheckUtils]: 2: Hoare triple {51687#(<= ~counter~0 0)} assume true; {51687#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:14,195 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {51687#(<= ~counter~0 0)} {51679#true} #102#return; {51687#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:14,195 INFO L272 TraceCheckUtils]: 4: Hoare triple {51687#(<= ~counter~0 0)} call #t~ret9 := main(); {51687#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:14,195 INFO L290 TraceCheckUtils]: 5: Hoare triple {51687#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {51687#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:14,196 INFO L272 TraceCheckUtils]: 6: Hoare triple {51687#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {51687#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:14,196 INFO L290 TraceCheckUtils]: 7: Hoare triple {51687#(<= ~counter~0 0)} ~cond := #in~cond; {51687#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:14,196 INFO L290 TraceCheckUtils]: 8: Hoare triple {51687#(<= ~counter~0 0)} assume !(0 == ~cond); {51687#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:14,196 INFO L290 TraceCheckUtils]: 9: Hoare triple {51687#(<= ~counter~0 0)} assume true; {51687#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:14,197 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {51687#(<= ~counter~0 0)} {51687#(<= ~counter~0 0)} #90#return; {51687#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:14,197 INFO L272 TraceCheckUtils]: 11: Hoare triple {51687#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {51687#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:14,197 INFO L290 TraceCheckUtils]: 12: Hoare triple {51687#(<= ~counter~0 0)} ~cond := #in~cond; {51687#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:14,198 INFO L290 TraceCheckUtils]: 13: Hoare triple {51687#(<= ~counter~0 0)} assume !(0 == ~cond); {51687#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:14,198 INFO L290 TraceCheckUtils]: 14: Hoare triple {51687#(<= ~counter~0 0)} assume true; {51687#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:14,198 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {51687#(<= ~counter~0 0)} {51687#(<= ~counter~0 0)} #92#return; {51687#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:14,199 INFO L290 TraceCheckUtils]: 16: Hoare triple {51687#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {51687#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:14,200 INFO L290 TraceCheckUtils]: 17: Hoare triple {51687#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {51736#(<= ~counter~0 1)} is VALID [2022-04-28 05:59:14,200 INFO L290 TraceCheckUtils]: 18: Hoare triple {51736#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {51736#(<= ~counter~0 1)} is VALID [2022-04-28 05:59:14,201 INFO L272 TraceCheckUtils]: 19: Hoare triple {51736#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {51736#(<= ~counter~0 1)} is VALID [2022-04-28 05:59:14,201 INFO L290 TraceCheckUtils]: 20: Hoare triple {51736#(<= ~counter~0 1)} ~cond := #in~cond; {51736#(<= ~counter~0 1)} is VALID [2022-04-28 05:59:14,201 INFO L290 TraceCheckUtils]: 21: Hoare triple {51736#(<= ~counter~0 1)} assume !(0 == ~cond); {51736#(<= ~counter~0 1)} is VALID [2022-04-28 05:59:14,201 INFO L290 TraceCheckUtils]: 22: Hoare triple {51736#(<= ~counter~0 1)} assume true; {51736#(<= ~counter~0 1)} is VALID [2022-04-28 05:59:14,202 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {51736#(<= ~counter~0 1)} {51736#(<= ~counter~0 1)} #94#return; {51736#(<= ~counter~0 1)} is VALID [2022-04-28 05:59:14,202 INFO L290 TraceCheckUtils]: 24: Hoare triple {51736#(<= ~counter~0 1)} assume !!(0 != ~r~0); {51736#(<= ~counter~0 1)} is VALID [2022-04-28 05:59:14,203 INFO L290 TraceCheckUtils]: 25: Hoare triple {51736#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {51761#(<= ~counter~0 2)} is VALID [2022-04-28 05:59:14,203 INFO L290 TraceCheckUtils]: 26: Hoare triple {51761#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {51761#(<= ~counter~0 2)} is VALID [2022-04-28 05:59:14,203 INFO L272 TraceCheckUtils]: 27: Hoare triple {51761#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {51761#(<= ~counter~0 2)} is VALID [2022-04-28 05:59:14,204 INFO L290 TraceCheckUtils]: 28: Hoare triple {51761#(<= ~counter~0 2)} ~cond := #in~cond; {51761#(<= ~counter~0 2)} is VALID [2022-04-28 05:59:14,204 INFO L290 TraceCheckUtils]: 29: Hoare triple {51761#(<= ~counter~0 2)} assume !(0 == ~cond); {51761#(<= ~counter~0 2)} is VALID [2022-04-28 05:59:14,204 INFO L290 TraceCheckUtils]: 30: Hoare triple {51761#(<= ~counter~0 2)} assume true; {51761#(<= ~counter~0 2)} is VALID [2022-04-28 05:59:14,205 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {51761#(<= ~counter~0 2)} {51761#(<= ~counter~0 2)} #96#return; {51761#(<= ~counter~0 2)} is VALID [2022-04-28 05:59:14,205 INFO L290 TraceCheckUtils]: 32: Hoare triple {51761#(<= ~counter~0 2)} assume !(~r~0 > 0); {51761#(<= ~counter~0 2)} is VALID [2022-04-28 05:59:14,206 INFO L290 TraceCheckUtils]: 33: Hoare triple {51761#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {51786#(<= ~counter~0 3)} is VALID [2022-04-28 05:59:14,206 INFO L290 TraceCheckUtils]: 34: Hoare triple {51786#(<= ~counter~0 3)} assume !!(#t~post8 < 20);havoc #t~post8; {51786#(<= ~counter~0 3)} is VALID [2022-04-28 05:59:14,206 INFO L272 TraceCheckUtils]: 35: Hoare triple {51786#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {51786#(<= ~counter~0 3)} is VALID [2022-04-28 05:59:14,207 INFO L290 TraceCheckUtils]: 36: Hoare triple {51786#(<= ~counter~0 3)} ~cond := #in~cond; {51786#(<= ~counter~0 3)} is VALID [2022-04-28 05:59:14,207 INFO L290 TraceCheckUtils]: 37: Hoare triple {51786#(<= ~counter~0 3)} assume !(0 == ~cond); {51786#(<= ~counter~0 3)} is VALID [2022-04-28 05:59:14,207 INFO L290 TraceCheckUtils]: 38: Hoare triple {51786#(<= ~counter~0 3)} assume true; {51786#(<= ~counter~0 3)} is VALID [2022-04-28 05:59:14,208 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {51786#(<= ~counter~0 3)} {51786#(<= ~counter~0 3)} #98#return; {51786#(<= ~counter~0 3)} is VALID [2022-04-28 05:59:14,208 INFO L290 TraceCheckUtils]: 40: Hoare triple {51786#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {51786#(<= ~counter~0 3)} is VALID [2022-04-28 05:59:14,208 INFO L290 TraceCheckUtils]: 41: Hoare triple {51786#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {51811#(<= ~counter~0 4)} is VALID [2022-04-28 05:59:14,209 INFO L290 TraceCheckUtils]: 42: Hoare triple {51811#(<= ~counter~0 4)} assume !!(#t~post8 < 20);havoc #t~post8; {51811#(<= ~counter~0 4)} is VALID [2022-04-28 05:59:14,209 INFO L272 TraceCheckUtils]: 43: Hoare triple {51811#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {51811#(<= ~counter~0 4)} is VALID [2022-04-28 05:59:14,209 INFO L290 TraceCheckUtils]: 44: Hoare triple {51811#(<= ~counter~0 4)} ~cond := #in~cond; {51811#(<= ~counter~0 4)} is VALID [2022-04-28 05:59:14,210 INFO L290 TraceCheckUtils]: 45: Hoare triple {51811#(<= ~counter~0 4)} assume !(0 == ~cond); {51811#(<= ~counter~0 4)} is VALID [2022-04-28 05:59:14,210 INFO L290 TraceCheckUtils]: 46: Hoare triple {51811#(<= ~counter~0 4)} assume true; {51811#(<= ~counter~0 4)} is VALID [2022-04-28 05:59:14,210 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {51811#(<= ~counter~0 4)} {51811#(<= ~counter~0 4)} #98#return; {51811#(<= ~counter~0 4)} is VALID [2022-04-28 05:59:14,211 INFO L290 TraceCheckUtils]: 48: Hoare triple {51811#(<= ~counter~0 4)} assume !(~r~0 < 0); {51811#(<= ~counter~0 4)} is VALID [2022-04-28 05:59:14,211 INFO L290 TraceCheckUtils]: 49: Hoare triple {51811#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {51836#(<= ~counter~0 5)} is VALID [2022-04-28 05:59:14,212 INFO L290 TraceCheckUtils]: 50: Hoare triple {51836#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {51836#(<= ~counter~0 5)} is VALID [2022-04-28 05:59:14,212 INFO L272 TraceCheckUtils]: 51: Hoare triple {51836#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {51836#(<= ~counter~0 5)} is VALID [2022-04-28 05:59:14,212 INFO L290 TraceCheckUtils]: 52: Hoare triple {51836#(<= ~counter~0 5)} ~cond := #in~cond; {51836#(<= ~counter~0 5)} is VALID [2022-04-28 05:59:14,213 INFO L290 TraceCheckUtils]: 53: Hoare triple {51836#(<= ~counter~0 5)} assume !(0 == ~cond); {51836#(<= ~counter~0 5)} is VALID [2022-04-28 05:59:14,213 INFO L290 TraceCheckUtils]: 54: Hoare triple {51836#(<= ~counter~0 5)} assume true; {51836#(<= ~counter~0 5)} is VALID [2022-04-28 05:59:14,213 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {51836#(<= ~counter~0 5)} {51836#(<= ~counter~0 5)} #94#return; {51836#(<= ~counter~0 5)} is VALID [2022-04-28 05:59:14,214 INFO L290 TraceCheckUtils]: 56: Hoare triple {51836#(<= ~counter~0 5)} assume !!(0 != ~r~0); {51836#(<= ~counter~0 5)} is VALID [2022-04-28 05:59:14,214 INFO L290 TraceCheckUtils]: 57: Hoare triple {51836#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {51861#(<= ~counter~0 6)} is VALID [2022-04-28 05:59:14,215 INFO L290 TraceCheckUtils]: 58: Hoare triple {51861#(<= ~counter~0 6)} assume !!(#t~post7 < 20);havoc #t~post7; {51861#(<= ~counter~0 6)} is VALID [2022-04-28 05:59:14,215 INFO L272 TraceCheckUtils]: 59: Hoare triple {51861#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {51861#(<= ~counter~0 6)} is VALID [2022-04-28 05:59:14,215 INFO L290 TraceCheckUtils]: 60: Hoare triple {51861#(<= ~counter~0 6)} ~cond := #in~cond; {51861#(<= ~counter~0 6)} is VALID [2022-04-28 05:59:14,216 INFO L290 TraceCheckUtils]: 61: Hoare triple {51861#(<= ~counter~0 6)} assume !(0 == ~cond); {51861#(<= ~counter~0 6)} is VALID [2022-04-28 05:59:14,216 INFO L290 TraceCheckUtils]: 62: Hoare triple {51861#(<= ~counter~0 6)} assume true; {51861#(<= ~counter~0 6)} is VALID [2022-04-28 05:59:14,216 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {51861#(<= ~counter~0 6)} {51861#(<= ~counter~0 6)} #96#return; {51861#(<= ~counter~0 6)} is VALID [2022-04-28 05:59:14,217 INFO L290 TraceCheckUtils]: 64: Hoare triple {51861#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {51861#(<= ~counter~0 6)} is VALID [2022-04-28 05:59:14,217 INFO L290 TraceCheckUtils]: 65: Hoare triple {51861#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {51886#(<= ~counter~0 7)} is VALID [2022-04-28 05:59:14,217 INFO L290 TraceCheckUtils]: 66: Hoare triple {51886#(<= ~counter~0 7)} assume !!(#t~post7 < 20);havoc #t~post7; {51886#(<= ~counter~0 7)} is VALID [2022-04-28 05:59:14,218 INFO L272 TraceCheckUtils]: 67: Hoare triple {51886#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {51886#(<= ~counter~0 7)} is VALID [2022-04-28 05:59:14,218 INFO L290 TraceCheckUtils]: 68: Hoare triple {51886#(<= ~counter~0 7)} ~cond := #in~cond; {51886#(<= ~counter~0 7)} is VALID [2022-04-28 05:59:14,218 INFO L290 TraceCheckUtils]: 69: Hoare triple {51886#(<= ~counter~0 7)} assume !(0 == ~cond); {51886#(<= ~counter~0 7)} is VALID [2022-04-28 05:59:14,219 INFO L290 TraceCheckUtils]: 70: Hoare triple {51886#(<= ~counter~0 7)} assume true; {51886#(<= ~counter~0 7)} is VALID [2022-04-28 05:59:14,219 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {51886#(<= ~counter~0 7)} {51886#(<= ~counter~0 7)} #96#return; {51886#(<= ~counter~0 7)} is VALID [2022-04-28 05:59:14,219 INFO L290 TraceCheckUtils]: 72: Hoare triple {51886#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {51886#(<= ~counter~0 7)} is VALID [2022-04-28 05:59:14,220 INFO L290 TraceCheckUtils]: 73: Hoare triple {51886#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {51911#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:14,220 INFO L290 TraceCheckUtils]: 74: Hoare triple {51911#(<= ~counter~0 8)} assume !!(#t~post7 < 20);havoc #t~post7; {51911#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:14,221 INFO L272 TraceCheckUtils]: 75: Hoare triple {51911#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {51911#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:14,221 INFO L290 TraceCheckUtils]: 76: Hoare triple {51911#(<= ~counter~0 8)} ~cond := #in~cond; {51911#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:14,221 INFO L290 TraceCheckUtils]: 77: Hoare triple {51911#(<= ~counter~0 8)} assume !(0 == ~cond); {51911#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:14,222 INFO L290 TraceCheckUtils]: 78: Hoare triple {51911#(<= ~counter~0 8)} assume true; {51911#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:14,222 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {51911#(<= ~counter~0 8)} {51911#(<= ~counter~0 8)} #96#return; {51911#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:14,222 INFO L290 TraceCheckUtils]: 80: Hoare triple {51911#(<= ~counter~0 8)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {51911#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:14,223 INFO L290 TraceCheckUtils]: 81: Hoare triple {51911#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {51936#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:14,223 INFO L290 TraceCheckUtils]: 82: Hoare triple {51936#(<= ~counter~0 9)} assume !!(#t~post7 < 20);havoc #t~post7; {51936#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:14,224 INFO L272 TraceCheckUtils]: 83: Hoare triple {51936#(<= ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {51936#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:14,224 INFO L290 TraceCheckUtils]: 84: Hoare triple {51936#(<= ~counter~0 9)} ~cond := #in~cond; {51936#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:14,224 INFO L290 TraceCheckUtils]: 85: Hoare triple {51936#(<= ~counter~0 9)} assume !(0 == ~cond); {51936#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:14,224 INFO L290 TraceCheckUtils]: 86: Hoare triple {51936#(<= ~counter~0 9)} assume true; {51936#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:14,225 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {51936#(<= ~counter~0 9)} {51936#(<= ~counter~0 9)} #96#return; {51936#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:14,225 INFO L290 TraceCheckUtils]: 88: Hoare triple {51936#(<= ~counter~0 9)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {51936#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:14,226 INFO L290 TraceCheckUtils]: 89: Hoare triple {51936#(<= ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {51961#(<= ~counter~0 10)} is VALID [2022-04-28 05:59:14,226 INFO L290 TraceCheckUtils]: 90: Hoare triple {51961#(<= ~counter~0 10)} assume !!(#t~post7 < 20);havoc #t~post7; {51961#(<= ~counter~0 10)} is VALID [2022-04-28 05:59:14,227 INFO L272 TraceCheckUtils]: 91: Hoare triple {51961#(<= ~counter~0 10)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {51961#(<= ~counter~0 10)} is VALID [2022-04-28 05:59:14,227 INFO L290 TraceCheckUtils]: 92: Hoare triple {51961#(<= ~counter~0 10)} ~cond := #in~cond; {51961#(<= ~counter~0 10)} is VALID [2022-04-28 05:59:14,227 INFO L290 TraceCheckUtils]: 93: Hoare triple {51961#(<= ~counter~0 10)} assume !(0 == ~cond); {51961#(<= ~counter~0 10)} is VALID [2022-04-28 05:59:14,227 INFO L290 TraceCheckUtils]: 94: Hoare triple {51961#(<= ~counter~0 10)} assume true; {51961#(<= ~counter~0 10)} is VALID [2022-04-28 05:59:14,228 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {51961#(<= ~counter~0 10)} {51961#(<= ~counter~0 10)} #96#return; {51961#(<= ~counter~0 10)} is VALID [2022-04-28 05:59:14,228 INFO L290 TraceCheckUtils]: 96: Hoare triple {51961#(<= ~counter~0 10)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {51961#(<= ~counter~0 10)} is VALID [2022-04-28 05:59:14,228 INFO L290 TraceCheckUtils]: 97: Hoare triple {51961#(<= ~counter~0 10)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {51986#(<= |main_#t~post7| 10)} is VALID [2022-04-28 05:59:14,229 INFO L290 TraceCheckUtils]: 98: Hoare triple {51986#(<= |main_#t~post7| 10)} assume !(#t~post7 < 20);havoc #t~post7; {51680#false} is VALID [2022-04-28 05:59:14,229 INFO L290 TraceCheckUtils]: 99: Hoare triple {51680#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {51680#false} is VALID [2022-04-28 05:59:14,229 INFO L290 TraceCheckUtils]: 100: Hoare triple {51680#false} assume !(#t~post8 < 20);havoc #t~post8; {51680#false} is VALID [2022-04-28 05:59:14,229 INFO L290 TraceCheckUtils]: 101: Hoare triple {51680#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {51680#false} is VALID [2022-04-28 05:59:14,229 INFO L290 TraceCheckUtils]: 102: Hoare triple {51680#false} assume !(#t~post6 < 20);havoc #t~post6; {51680#false} is VALID [2022-04-28 05:59:14,229 INFO L272 TraceCheckUtils]: 103: Hoare triple {51680#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {51680#false} is VALID [2022-04-28 05:59:14,229 INFO L290 TraceCheckUtils]: 104: Hoare triple {51680#false} ~cond := #in~cond; {51680#false} is VALID [2022-04-28 05:59:14,229 INFO L290 TraceCheckUtils]: 105: Hoare triple {51680#false} assume 0 == ~cond; {51680#false} is VALID [2022-04-28 05:59:14,229 INFO L290 TraceCheckUtils]: 106: Hoare triple {51680#false} assume !false; {51680#false} is VALID [2022-04-28 05:59:14,230 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 28 proven. 260 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 05:59:14,230 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:59:14,812 INFO L290 TraceCheckUtils]: 106: Hoare triple {51680#false} assume !false; {51680#false} is VALID [2022-04-28 05:59:14,812 INFO L290 TraceCheckUtils]: 105: Hoare triple {51680#false} assume 0 == ~cond; {51680#false} is VALID [2022-04-28 05:59:14,812 INFO L290 TraceCheckUtils]: 104: Hoare triple {51680#false} ~cond := #in~cond; {51680#false} is VALID [2022-04-28 05:59:14,812 INFO L272 TraceCheckUtils]: 103: Hoare triple {51680#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {51680#false} is VALID [2022-04-28 05:59:14,812 INFO L290 TraceCheckUtils]: 102: Hoare triple {51680#false} assume !(#t~post6 < 20);havoc #t~post6; {51680#false} is VALID [2022-04-28 05:59:14,812 INFO L290 TraceCheckUtils]: 101: Hoare triple {51680#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {51680#false} is VALID [2022-04-28 05:59:14,813 INFO L290 TraceCheckUtils]: 100: Hoare triple {51680#false} assume !(#t~post8 < 20);havoc #t~post8; {51680#false} is VALID [2022-04-28 05:59:14,813 INFO L290 TraceCheckUtils]: 99: Hoare triple {51680#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {51680#false} is VALID [2022-04-28 05:59:14,813 INFO L290 TraceCheckUtils]: 98: Hoare triple {52038#(< |main_#t~post7| 20)} assume !(#t~post7 < 20);havoc #t~post7; {51680#false} is VALID [2022-04-28 05:59:14,813 INFO L290 TraceCheckUtils]: 97: Hoare triple {52042#(< ~counter~0 20)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {52038#(< |main_#t~post7| 20)} is VALID [2022-04-28 05:59:14,814 INFO L290 TraceCheckUtils]: 96: Hoare triple {52042#(< ~counter~0 20)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {52042#(< ~counter~0 20)} is VALID [2022-04-28 05:59:14,814 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {51679#true} {52042#(< ~counter~0 20)} #96#return; {52042#(< ~counter~0 20)} is VALID [2022-04-28 05:59:14,814 INFO L290 TraceCheckUtils]: 94: Hoare triple {51679#true} assume true; {51679#true} is VALID [2022-04-28 05:59:14,815 INFO L290 TraceCheckUtils]: 93: Hoare triple {51679#true} assume !(0 == ~cond); {51679#true} is VALID [2022-04-28 05:59:14,815 INFO L290 TraceCheckUtils]: 92: Hoare triple {51679#true} ~cond := #in~cond; {51679#true} is VALID [2022-04-28 05:59:14,815 INFO L272 TraceCheckUtils]: 91: Hoare triple {52042#(< ~counter~0 20)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {51679#true} is VALID [2022-04-28 05:59:14,815 INFO L290 TraceCheckUtils]: 90: Hoare triple {52042#(< ~counter~0 20)} assume !!(#t~post7 < 20);havoc #t~post7; {52042#(< ~counter~0 20)} is VALID [2022-04-28 05:59:14,816 INFO L290 TraceCheckUtils]: 89: Hoare triple {52067#(< ~counter~0 19)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {52042#(< ~counter~0 20)} is VALID [2022-04-28 05:59:14,817 INFO L290 TraceCheckUtils]: 88: Hoare triple {52067#(< ~counter~0 19)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {52067#(< ~counter~0 19)} is VALID [2022-04-28 05:59:14,817 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {51679#true} {52067#(< ~counter~0 19)} #96#return; {52067#(< ~counter~0 19)} is VALID [2022-04-28 05:59:14,817 INFO L290 TraceCheckUtils]: 86: Hoare triple {51679#true} assume true; {51679#true} is VALID [2022-04-28 05:59:14,817 INFO L290 TraceCheckUtils]: 85: Hoare triple {51679#true} assume !(0 == ~cond); {51679#true} is VALID [2022-04-28 05:59:14,818 INFO L290 TraceCheckUtils]: 84: Hoare triple {51679#true} ~cond := #in~cond; {51679#true} is VALID [2022-04-28 05:59:14,818 INFO L272 TraceCheckUtils]: 83: Hoare triple {52067#(< ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {51679#true} is VALID [2022-04-28 05:59:14,818 INFO L290 TraceCheckUtils]: 82: Hoare triple {52067#(< ~counter~0 19)} assume !!(#t~post7 < 20);havoc #t~post7; {52067#(< ~counter~0 19)} is VALID [2022-04-28 05:59:14,819 INFO L290 TraceCheckUtils]: 81: Hoare triple {52092#(< ~counter~0 18)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {52067#(< ~counter~0 19)} is VALID [2022-04-28 05:59:14,819 INFO L290 TraceCheckUtils]: 80: Hoare triple {52092#(< ~counter~0 18)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {52092#(< ~counter~0 18)} is VALID [2022-04-28 05:59:14,820 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {51679#true} {52092#(< ~counter~0 18)} #96#return; {52092#(< ~counter~0 18)} is VALID [2022-04-28 05:59:14,820 INFO L290 TraceCheckUtils]: 78: Hoare triple {51679#true} assume true; {51679#true} is VALID [2022-04-28 05:59:14,820 INFO L290 TraceCheckUtils]: 77: Hoare triple {51679#true} assume !(0 == ~cond); {51679#true} is VALID [2022-04-28 05:59:14,820 INFO L290 TraceCheckUtils]: 76: Hoare triple {51679#true} ~cond := #in~cond; {51679#true} is VALID [2022-04-28 05:59:14,820 INFO L272 TraceCheckUtils]: 75: Hoare triple {52092#(< ~counter~0 18)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {51679#true} is VALID [2022-04-28 05:59:14,820 INFO L290 TraceCheckUtils]: 74: Hoare triple {52092#(< ~counter~0 18)} assume !!(#t~post7 < 20);havoc #t~post7; {52092#(< ~counter~0 18)} is VALID [2022-04-28 05:59:14,821 INFO L290 TraceCheckUtils]: 73: Hoare triple {52117#(< ~counter~0 17)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {52092#(< ~counter~0 18)} is VALID [2022-04-28 05:59:14,821 INFO L290 TraceCheckUtils]: 72: Hoare triple {52117#(< ~counter~0 17)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {52117#(< ~counter~0 17)} is VALID [2022-04-28 05:59:14,822 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {51679#true} {52117#(< ~counter~0 17)} #96#return; {52117#(< ~counter~0 17)} is VALID [2022-04-28 05:59:14,822 INFO L290 TraceCheckUtils]: 70: Hoare triple {51679#true} assume true; {51679#true} is VALID [2022-04-28 05:59:14,822 INFO L290 TraceCheckUtils]: 69: Hoare triple {51679#true} assume !(0 == ~cond); {51679#true} is VALID [2022-04-28 05:59:14,822 INFO L290 TraceCheckUtils]: 68: Hoare triple {51679#true} ~cond := #in~cond; {51679#true} is VALID [2022-04-28 05:59:14,822 INFO L272 TraceCheckUtils]: 67: Hoare triple {52117#(< ~counter~0 17)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {51679#true} is VALID [2022-04-28 05:59:14,823 INFO L290 TraceCheckUtils]: 66: Hoare triple {52117#(< ~counter~0 17)} assume !!(#t~post7 < 20);havoc #t~post7; {52117#(< ~counter~0 17)} is VALID [2022-04-28 05:59:14,824 INFO L290 TraceCheckUtils]: 65: Hoare triple {52142#(< ~counter~0 16)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {52117#(< ~counter~0 17)} is VALID [2022-04-28 05:59:14,824 INFO L290 TraceCheckUtils]: 64: Hoare triple {52142#(< ~counter~0 16)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {52142#(< ~counter~0 16)} is VALID [2022-04-28 05:59:14,825 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {51679#true} {52142#(< ~counter~0 16)} #96#return; {52142#(< ~counter~0 16)} is VALID [2022-04-28 05:59:14,825 INFO L290 TraceCheckUtils]: 62: Hoare triple {51679#true} assume true; {51679#true} is VALID [2022-04-28 05:59:14,825 INFO L290 TraceCheckUtils]: 61: Hoare triple {51679#true} assume !(0 == ~cond); {51679#true} is VALID [2022-04-28 05:59:14,825 INFO L290 TraceCheckUtils]: 60: Hoare triple {51679#true} ~cond := #in~cond; {51679#true} is VALID [2022-04-28 05:59:14,825 INFO L272 TraceCheckUtils]: 59: Hoare triple {52142#(< ~counter~0 16)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {51679#true} is VALID [2022-04-28 05:59:14,825 INFO L290 TraceCheckUtils]: 58: Hoare triple {52142#(< ~counter~0 16)} assume !!(#t~post7 < 20);havoc #t~post7; {52142#(< ~counter~0 16)} is VALID [2022-04-28 05:59:14,826 INFO L290 TraceCheckUtils]: 57: Hoare triple {52167#(< ~counter~0 15)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {52142#(< ~counter~0 16)} is VALID [2022-04-28 05:59:14,827 INFO L290 TraceCheckUtils]: 56: Hoare triple {52167#(< ~counter~0 15)} assume !!(0 != ~r~0); {52167#(< ~counter~0 15)} is VALID [2022-04-28 05:59:14,827 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {51679#true} {52167#(< ~counter~0 15)} #94#return; {52167#(< ~counter~0 15)} is VALID [2022-04-28 05:59:14,827 INFO L290 TraceCheckUtils]: 54: Hoare triple {51679#true} assume true; {51679#true} is VALID [2022-04-28 05:59:14,827 INFO L290 TraceCheckUtils]: 53: Hoare triple {51679#true} assume !(0 == ~cond); {51679#true} is VALID [2022-04-28 05:59:14,828 INFO L290 TraceCheckUtils]: 52: Hoare triple {51679#true} ~cond := #in~cond; {51679#true} is VALID [2022-04-28 05:59:14,828 INFO L272 TraceCheckUtils]: 51: Hoare triple {52167#(< ~counter~0 15)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {51679#true} is VALID [2022-04-28 05:59:14,828 INFO L290 TraceCheckUtils]: 50: Hoare triple {52167#(< ~counter~0 15)} assume !!(#t~post6 < 20);havoc #t~post6; {52167#(< ~counter~0 15)} is VALID [2022-04-28 05:59:14,829 INFO L290 TraceCheckUtils]: 49: Hoare triple {52192#(< ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {52167#(< ~counter~0 15)} is VALID [2022-04-28 05:59:14,829 INFO L290 TraceCheckUtils]: 48: Hoare triple {52192#(< ~counter~0 14)} assume !(~r~0 < 0); {52192#(< ~counter~0 14)} is VALID [2022-04-28 05:59:14,830 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {51679#true} {52192#(< ~counter~0 14)} #98#return; {52192#(< ~counter~0 14)} is VALID [2022-04-28 05:59:14,830 INFO L290 TraceCheckUtils]: 46: Hoare triple {51679#true} assume true; {51679#true} is VALID [2022-04-28 05:59:14,830 INFO L290 TraceCheckUtils]: 45: Hoare triple {51679#true} assume !(0 == ~cond); {51679#true} is VALID [2022-04-28 05:59:14,830 INFO L290 TraceCheckUtils]: 44: Hoare triple {51679#true} ~cond := #in~cond; {51679#true} is VALID [2022-04-28 05:59:14,830 INFO L272 TraceCheckUtils]: 43: Hoare triple {52192#(< ~counter~0 14)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {51679#true} is VALID [2022-04-28 05:59:14,831 INFO L290 TraceCheckUtils]: 42: Hoare triple {52192#(< ~counter~0 14)} assume !!(#t~post8 < 20);havoc #t~post8; {52192#(< ~counter~0 14)} is VALID [2022-04-28 05:59:14,831 INFO L290 TraceCheckUtils]: 41: Hoare triple {52217#(< ~counter~0 13)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {52192#(< ~counter~0 14)} is VALID [2022-04-28 05:59:14,832 INFO L290 TraceCheckUtils]: 40: Hoare triple {52217#(< ~counter~0 13)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {52217#(< ~counter~0 13)} is VALID [2022-04-28 05:59:14,833 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {51679#true} {52217#(< ~counter~0 13)} #98#return; {52217#(< ~counter~0 13)} is VALID [2022-04-28 05:59:14,833 INFO L290 TraceCheckUtils]: 38: Hoare triple {51679#true} assume true; {51679#true} is VALID [2022-04-28 05:59:14,833 INFO L290 TraceCheckUtils]: 37: Hoare triple {51679#true} assume !(0 == ~cond); {51679#true} is VALID [2022-04-28 05:59:14,833 INFO L290 TraceCheckUtils]: 36: Hoare triple {51679#true} ~cond := #in~cond; {51679#true} is VALID [2022-04-28 05:59:14,833 INFO L272 TraceCheckUtils]: 35: Hoare triple {52217#(< ~counter~0 13)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {51679#true} is VALID [2022-04-28 05:59:14,833 INFO L290 TraceCheckUtils]: 34: Hoare triple {52217#(< ~counter~0 13)} assume !!(#t~post8 < 20);havoc #t~post8; {52217#(< ~counter~0 13)} is VALID [2022-04-28 05:59:14,834 INFO L290 TraceCheckUtils]: 33: Hoare triple {52242#(< ~counter~0 12)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {52217#(< ~counter~0 13)} is VALID [2022-04-28 05:59:14,834 INFO L290 TraceCheckUtils]: 32: Hoare triple {52242#(< ~counter~0 12)} assume !(~r~0 > 0); {52242#(< ~counter~0 12)} is VALID [2022-04-28 05:59:14,834 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {51679#true} {52242#(< ~counter~0 12)} #96#return; {52242#(< ~counter~0 12)} is VALID [2022-04-28 05:59:14,834 INFO L290 TraceCheckUtils]: 30: Hoare triple {51679#true} assume true; {51679#true} is VALID [2022-04-28 05:59:14,835 INFO L290 TraceCheckUtils]: 29: Hoare triple {51679#true} assume !(0 == ~cond); {51679#true} is VALID [2022-04-28 05:59:14,835 INFO L290 TraceCheckUtils]: 28: Hoare triple {51679#true} ~cond := #in~cond; {51679#true} is VALID [2022-04-28 05:59:14,835 INFO L272 TraceCheckUtils]: 27: Hoare triple {52242#(< ~counter~0 12)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {51679#true} is VALID [2022-04-28 05:59:14,835 INFO L290 TraceCheckUtils]: 26: Hoare triple {52242#(< ~counter~0 12)} assume !!(#t~post7 < 20);havoc #t~post7; {52242#(< ~counter~0 12)} is VALID [2022-04-28 05:59:14,836 INFO L290 TraceCheckUtils]: 25: Hoare triple {51961#(<= ~counter~0 10)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {52242#(< ~counter~0 12)} is VALID [2022-04-28 05:59:14,836 INFO L290 TraceCheckUtils]: 24: Hoare triple {51961#(<= ~counter~0 10)} assume !!(0 != ~r~0); {51961#(<= ~counter~0 10)} is VALID [2022-04-28 05:59:14,836 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {51679#true} {51961#(<= ~counter~0 10)} #94#return; {51961#(<= ~counter~0 10)} is VALID [2022-04-28 05:59:14,836 INFO L290 TraceCheckUtils]: 22: Hoare triple {51679#true} assume true; {51679#true} is VALID [2022-04-28 05:59:14,836 INFO L290 TraceCheckUtils]: 21: Hoare triple {51679#true} assume !(0 == ~cond); {51679#true} is VALID [2022-04-28 05:59:14,836 INFO L290 TraceCheckUtils]: 20: Hoare triple {51679#true} ~cond := #in~cond; {51679#true} is VALID [2022-04-28 05:59:14,837 INFO L272 TraceCheckUtils]: 19: Hoare triple {51961#(<= ~counter~0 10)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {51679#true} is VALID [2022-04-28 05:59:14,837 INFO L290 TraceCheckUtils]: 18: Hoare triple {51961#(<= ~counter~0 10)} assume !!(#t~post6 < 20);havoc #t~post6; {51961#(<= ~counter~0 10)} is VALID [2022-04-28 05:59:14,837 INFO L290 TraceCheckUtils]: 17: Hoare triple {51936#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {51961#(<= ~counter~0 10)} is VALID [2022-04-28 05:59:14,838 INFO L290 TraceCheckUtils]: 16: Hoare triple {51936#(<= ~counter~0 9)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {51936#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:14,838 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {51679#true} {51936#(<= ~counter~0 9)} #92#return; {51936#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:14,838 INFO L290 TraceCheckUtils]: 14: Hoare triple {51679#true} assume true; {51679#true} is VALID [2022-04-28 05:59:14,838 INFO L290 TraceCheckUtils]: 13: Hoare triple {51679#true} assume !(0 == ~cond); {51679#true} is VALID [2022-04-28 05:59:14,838 INFO L290 TraceCheckUtils]: 12: Hoare triple {51679#true} ~cond := #in~cond; {51679#true} is VALID [2022-04-28 05:59:14,838 INFO L272 TraceCheckUtils]: 11: Hoare triple {51936#(<= ~counter~0 9)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {51679#true} is VALID [2022-04-28 05:59:14,839 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {51679#true} {51936#(<= ~counter~0 9)} #90#return; {51936#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:14,839 INFO L290 TraceCheckUtils]: 9: Hoare triple {51679#true} assume true; {51679#true} is VALID [2022-04-28 05:59:14,839 INFO L290 TraceCheckUtils]: 8: Hoare triple {51679#true} assume !(0 == ~cond); {51679#true} is VALID [2022-04-28 05:59:14,839 INFO L290 TraceCheckUtils]: 7: Hoare triple {51679#true} ~cond := #in~cond; {51679#true} is VALID [2022-04-28 05:59:14,839 INFO L272 TraceCheckUtils]: 6: Hoare triple {51936#(<= ~counter~0 9)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {51679#true} is VALID [2022-04-28 05:59:14,839 INFO L290 TraceCheckUtils]: 5: Hoare triple {51936#(<= ~counter~0 9)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {51936#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:14,839 INFO L272 TraceCheckUtils]: 4: Hoare triple {51936#(<= ~counter~0 9)} call #t~ret9 := main(); {51936#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:14,840 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {51936#(<= ~counter~0 9)} {51679#true} #102#return; {51936#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:14,840 INFO L290 TraceCheckUtils]: 2: Hoare triple {51936#(<= ~counter~0 9)} assume true; {51936#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:14,840 INFO L290 TraceCheckUtils]: 1: Hoare triple {51679#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {51936#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:14,840 INFO L272 TraceCheckUtils]: 0: Hoare triple {51679#true} call ULTIMATE.init(); {51679#true} is VALID [2022-04-28 05:59:14,841 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 28 proven. 80 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2022-04-28 05:59:14,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:59:14,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361871887] [2022-04-28 05:59:14,841 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:59:14,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [545246589] [2022-04-28 05:59:14,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [545246589] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:59:14,841 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:59:14,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2022-04-28 05:59:14,842 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:59:14,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1100081323] [2022-04-28 05:59:14,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1100081323] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:59:14,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:59:14,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 05:59:14,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770693341] [2022-04-28 05:59:14,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:59:14,843 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 13 states have internal predecessors, (76), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) Word has length 107 [2022-04-28 05:59:14,843 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:59:14,843 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 13 states have internal predecessors, (76), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-28 05:59:14,923 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:59:14,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 05:59:14,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:59:14,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 05:59:14,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-28 05:59:14,924 INFO L87 Difference]: Start difference. First operand 522 states and 717 transitions. Second operand has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 13 states have internal predecessors, (76), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-28 05:59:16,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:59:16,766 INFO L93 Difference]: Finished difference Result 735 states and 1041 transitions. [2022-04-28 05:59:16,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-28 05:59:16,766 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 13 states have internal predecessors, (76), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) Word has length 107 [2022-04-28 05:59:16,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:59:16,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 13 states have internal predecessors, (76), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-28 05:59:16,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 236 transitions. [2022-04-28 05:59:16,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 13 states have internal predecessors, (76), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-28 05:59:16,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 236 transitions. [2022-04-28 05:59:16,771 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 236 transitions. [2022-04-28 05:59:16,964 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 236 edges. 236 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:59:16,978 INFO L225 Difference]: With dead ends: 735 [2022-04-28 05:59:16,978 INFO L226 Difference]: Without dead ends: 538 [2022-04-28 05:59:16,979 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 190 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=434, Invalid=622, Unknown=0, NotChecked=0, Total=1056 [2022-04-28 05:59:16,979 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 104 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 05:59:16,979 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 284 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 05:59:16,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2022-04-28 05:59:18,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 538. [2022-04-28 05:59:18,101 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:59:18,102 INFO L82 GeneralOperation]: Start isEquivalent. First operand 538 states. Second operand has 538 states, 410 states have (on average 1.2365853658536585) internal successors, (507), 410 states have internal predecessors, (507), 114 states have call successors, (114), 15 states have call predecessors, (114), 13 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-28 05:59:18,102 INFO L74 IsIncluded]: Start isIncluded. First operand 538 states. Second operand has 538 states, 410 states have (on average 1.2365853658536585) internal successors, (507), 410 states have internal predecessors, (507), 114 states have call successors, (114), 15 states have call predecessors, (114), 13 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-28 05:59:18,103 INFO L87 Difference]: Start difference. First operand 538 states. Second operand has 538 states, 410 states have (on average 1.2365853658536585) internal successors, (507), 410 states have internal predecessors, (507), 114 states have call successors, (114), 15 states have call predecessors, (114), 13 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-28 05:59:18,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:59:18,118 INFO L93 Difference]: Finished difference Result 538 states and 733 transitions. [2022-04-28 05:59:18,118 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 733 transitions. [2022-04-28 05:59:18,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:59:18,119 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:59:18,119 INFO L74 IsIncluded]: Start isIncluded. First operand has 538 states, 410 states have (on average 1.2365853658536585) internal successors, (507), 410 states have internal predecessors, (507), 114 states have call successors, (114), 15 states have call predecessors, (114), 13 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) Second operand 538 states. [2022-04-28 05:59:18,120 INFO L87 Difference]: Start difference. First operand has 538 states, 410 states have (on average 1.2365853658536585) internal successors, (507), 410 states have internal predecessors, (507), 114 states have call successors, (114), 15 states have call predecessors, (114), 13 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) Second operand 538 states. [2022-04-28 05:59:18,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:59:18,131 INFO L93 Difference]: Finished difference Result 538 states and 733 transitions. [2022-04-28 05:59:18,131 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 733 transitions. [2022-04-28 05:59:18,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:59:18,132 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:59:18,132 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:59:18,132 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:59:18,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 410 states have (on average 1.2365853658536585) internal successors, (507), 410 states have internal predecessors, (507), 114 states have call successors, (114), 15 states have call predecessors, (114), 13 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-28 05:59:18,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 733 transitions. [2022-04-28 05:59:18,146 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 733 transitions. Word has length 107 [2022-04-28 05:59:18,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:59:18,146 INFO L495 AbstractCegarLoop]: Abstraction has 538 states and 733 transitions. [2022-04-28 05:59:18,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 13 states have internal predecessors, (76), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-28 05:59:18,146 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 538 states and 733 transitions. [2022-04-28 05:59:21,576 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 733 edges. 732 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 05:59:21,576 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 733 transitions. [2022-04-28 05:59:21,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-04-28 05:59:21,577 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:59:21,577 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:59:21,583 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-04-28 05:59:21,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:59:21,778 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:59:21,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:59:21,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1965005106, now seen corresponding path program 5 times [2022-04-28 05:59:21,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:59:21,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [155945163] [2022-04-28 05:59:21,778 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:59:21,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1965005106, now seen corresponding path program 6 times [2022-04-28 05:59:21,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:59:21,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024311689] [2022-04-28 05:59:21,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:59:21,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:59:21,790 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:59:21,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [649070369] [2022-04-28 05:59:21,790 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 05:59:21,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:59:21,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:59:21,791 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:59:21,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-04-28 05:59:21,932 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-04-28 05:59:21,932 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:59:21,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-28 05:59:21,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:59:21,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:59:22,529 INFO L272 TraceCheckUtils]: 0: Hoare triple {55984#true} call ULTIMATE.init(); {55984#true} is VALID [2022-04-28 05:59:22,530 INFO L290 TraceCheckUtils]: 1: Hoare triple {55984#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {55992#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:22,530 INFO L290 TraceCheckUtils]: 2: Hoare triple {55992#(<= ~counter~0 0)} assume true; {55992#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:22,530 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55992#(<= ~counter~0 0)} {55984#true} #102#return; {55992#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:22,531 INFO L272 TraceCheckUtils]: 4: Hoare triple {55992#(<= ~counter~0 0)} call #t~ret9 := main(); {55992#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:22,531 INFO L290 TraceCheckUtils]: 5: Hoare triple {55992#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {55992#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:22,531 INFO L272 TraceCheckUtils]: 6: Hoare triple {55992#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {55992#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:22,532 INFO L290 TraceCheckUtils]: 7: Hoare triple {55992#(<= ~counter~0 0)} ~cond := #in~cond; {55992#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:22,532 INFO L290 TraceCheckUtils]: 8: Hoare triple {55992#(<= ~counter~0 0)} assume !(0 == ~cond); {55992#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:22,532 INFO L290 TraceCheckUtils]: 9: Hoare triple {55992#(<= ~counter~0 0)} assume true; {55992#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:22,533 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {55992#(<= ~counter~0 0)} {55992#(<= ~counter~0 0)} #90#return; {55992#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:22,533 INFO L272 TraceCheckUtils]: 11: Hoare triple {55992#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {55992#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:22,533 INFO L290 TraceCheckUtils]: 12: Hoare triple {55992#(<= ~counter~0 0)} ~cond := #in~cond; {55992#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:22,533 INFO L290 TraceCheckUtils]: 13: Hoare triple {55992#(<= ~counter~0 0)} assume !(0 == ~cond); {55992#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:22,534 INFO L290 TraceCheckUtils]: 14: Hoare triple {55992#(<= ~counter~0 0)} assume true; {55992#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:22,534 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {55992#(<= ~counter~0 0)} {55992#(<= ~counter~0 0)} #92#return; {55992#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:22,534 INFO L290 TraceCheckUtils]: 16: Hoare triple {55992#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {55992#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:22,536 INFO L290 TraceCheckUtils]: 17: Hoare triple {55992#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {56041#(<= ~counter~0 1)} is VALID [2022-04-28 05:59:22,536 INFO L290 TraceCheckUtils]: 18: Hoare triple {56041#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {56041#(<= ~counter~0 1)} is VALID [2022-04-28 05:59:22,536 INFO L272 TraceCheckUtils]: 19: Hoare triple {56041#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {56041#(<= ~counter~0 1)} is VALID [2022-04-28 05:59:22,537 INFO L290 TraceCheckUtils]: 20: Hoare triple {56041#(<= ~counter~0 1)} ~cond := #in~cond; {56041#(<= ~counter~0 1)} is VALID [2022-04-28 05:59:22,537 INFO L290 TraceCheckUtils]: 21: Hoare triple {56041#(<= ~counter~0 1)} assume !(0 == ~cond); {56041#(<= ~counter~0 1)} is VALID [2022-04-28 05:59:22,537 INFO L290 TraceCheckUtils]: 22: Hoare triple {56041#(<= ~counter~0 1)} assume true; {56041#(<= ~counter~0 1)} is VALID [2022-04-28 05:59:22,538 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {56041#(<= ~counter~0 1)} {56041#(<= ~counter~0 1)} #94#return; {56041#(<= ~counter~0 1)} is VALID [2022-04-28 05:59:22,538 INFO L290 TraceCheckUtils]: 24: Hoare triple {56041#(<= ~counter~0 1)} assume !!(0 != ~r~0); {56041#(<= ~counter~0 1)} is VALID [2022-04-28 05:59:22,539 INFO L290 TraceCheckUtils]: 25: Hoare triple {56041#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {56066#(<= ~counter~0 2)} is VALID [2022-04-28 05:59:22,539 INFO L290 TraceCheckUtils]: 26: Hoare triple {56066#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {56066#(<= ~counter~0 2)} is VALID [2022-04-28 05:59:22,539 INFO L272 TraceCheckUtils]: 27: Hoare triple {56066#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {56066#(<= ~counter~0 2)} is VALID [2022-04-28 05:59:22,540 INFO L290 TraceCheckUtils]: 28: Hoare triple {56066#(<= ~counter~0 2)} ~cond := #in~cond; {56066#(<= ~counter~0 2)} is VALID [2022-04-28 05:59:22,540 INFO L290 TraceCheckUtils]: 29: Hoare triple {56066#(<= ~counter~0 2)} assume !(0 == ~cond); {56066#(<= ~counter~0 2)} is VALID [2022-04-28 05:59:22,540 INFO L290 TraceCheckUtils]: 30: Hoare triple {56066#(<= ~counter~0 2)} assume true; {56066#(<= ~counter~0 2)} is VALID [2022-04-28 05:59:22,541 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {56066#(<= ~counter~0 2)} {56066#(<= ~counter~0 2)} #96#return; {56066#(<= ~counter~0 2)} is VALID [2022-04-28 05:59:22,541 INFO L290 TraceCheckUtils]: 32: Hoare triple {56066#(<= ~counter~0 2)} assume !(~r~0 > 0); {56066#(<= ~counter~0 2)} is VALID [2022-04-28 05:59:22,541 INFO L290 TraceCheckUtils]: 33: Hoare triple {56066#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {56091#(<= ~counter~0 3)} is VALID [2022-04-28 05:59:22,542 INFO L290 TraceCheckUtils]: 34: Hoare triple {56091#(<= ~counter~0 3)} assume !!(#t~post8 < 20);havoc #t~post8; {56091#(<= ~counter~0 3)} is VALID [2022-04-28 05:59:22,542 INFO L272 TraceCheckUtils]: 35: Hoare triple {56091#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {56091#(<= ~counter~0 3)} is VALID [2022-04-28 05:59:22,542 INFO L290 TraceCheckUtils]: 36: Hoare triple {56091#(<= ~counter~0 3)} ~cond := #in~cond; {56091#(<= ~counter~0 3)} is VALID [2022-04-28 05:59:22,543 INFO L290 TraceCheckUtils]: 37: Hoare triple {56091#(<= ~counter~0 3)} assume !(0 == ~cond); {56091#(<= ~counter~0 3)} is VALID [2022-04-28 05:59:22,543 INFO L290 TraceCheckUtils]: 38: Hoare triple {56091#(<= ~counter~0 3)} assume true; {56091#(<= ~counter~0 3)} is VALID [2022-04-28 05:59:22,543 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {56091#(<= ~counter~0 3)} {56091#(<= ~counter~0 3)} #98#return; {56091#(<= ~counter~0 3)} is VALID [2022-04-28 05:59:22,544 INFO L290 TraceCheckUtils]: 40: Hoare triple {56091#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {56091#(<= ~counter~0 3)} is VALID [2022-04-28 05:59:22,544 INFO L290 TraceCheckUtils]: 41: Hoare triple {56091#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {56116#(<= ~counter~0 4)} is VALID [2022-04-28 05:59:22,545 INFO L290 TraceCheckUtils]: 42: Hoare triple {56116#(<= ~counter~0 4)} assume !!(#t~post8 < 20);havoc #t~post8; {56116#(<= ~counter~0 4)} is VALID [2022-04-28 05:59:22,545 INFO L272 TraceCheckUtils]: 43: Hoare triple {56116#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {56116#(<= ~counter~0 4)} is VALID [2022-04-28 05:59:22,545 INFO L290 TraceCheckUtils]: 44: Hoare triple {56116#(<= ~counter~0 4)} ~cond := #in~cond; {56116#(<= ~counter~0 4)} is VALID [2022-04-28 05:59:22,546 INFO L290 TraceCheckUtils]: 45: Hoare triple {56116#(<= ~counter~0 4)} assume !(0 == ~cond); {56116#(<= ~counter~0 4)} is VALID [2022-04-28 05:59:22,546 INFO L290 TraceCheckUtils]: 46: Hoare triple {56116#(<= ~counter~0 4)} assume true; {56116#(<= ~counter~0 4)} is VALID [2022-04-28 05:59:22,546 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {56116#(<= ~counter~0 4)} {56116#(<= ~counter~0 4)} #98#return; {56116#(<= ~counter~0 4)} is VALID [2022-04-28 05:59:22,547 INFO L290 TraceCheckUtils]: 48: Hoare triple {56116#(<= ~counter~0 4)} assume !(~r~0 < 0); {56116#(<= ~counter~0 4)} is VALID [2022-04-28 05:59:22,547 INFO L290 TraceCheckUtils]: 49: Hoare triple {56116#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {56141#(<= ~counter~0 5)} is VALID [2022-04-28 05:59:22,548 INFO L290 TraceCheckUtils]: 50: Hoare triple {56141#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {56141#(<= ~counter~0 5)} is VALID [2022-04-28 05:59:22,548 INFO L272 TraceCheckUtils]: 51: Hoare triple {56141#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {56141#(<= ~counter~0 5)} is VALID [2022-04-28 05:59:22,548 INFO L290 TraceCheckUtils]: 52: Hoare triple {56141#(<= ~counter~0 5)} ~cond := #in~cond; {56141#(<= ~counter~0 5)} is VALID [2022-04-28 05:59:22,549 INFO L290 TraceCheckUtils]: 53: Hoare triple {56141#(<= ~counter~0 5)} assume !(0 == ~cond); {56141#(<= ~counter~0 5)} is VALID [2022-04-28 05:59:22,549 INFO L290 TraceCheckUtils]: 54: Hoare triple {56141#(<= ~counter~0 5)} assume true; {56141#(<= ~counter~0 5)} is VALID [2022-04-28 05:59:22,549 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {56141#(<= ~counter~0 5)} {56141#(<= ~counter~0 5)} #94#return; {56141#(<= ~counter~0 5)} is VALID [2022-04-28 05:59:22,550 INFO L290 TraceCheckUtils]: 56: Hoare triple {56141#(<= ~counter~0 5)} assume !!(0 != ~r~0); {56141#(<= ~counter~0 5)} is VALID [2022-04-28 05:59:22,550 INFO L290 TraceCheckUtils]: 57: Hoare triple {56141#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {56166#(<= ~counter~0 6)} is VALID [2022-04-28 05:59:22,550 INFO L290 TraceCheckUtils]: 58: Hoare triple {56166#(<= ~counter~0 6)} assume !!(#t~post7 < 20);havoc #t~post7; {56166#(<= ~counter~0 6)} is VALID [2022-04-28 05:59:22,551 INFO L272 TraceCheckUtils]: 59: Hoare triple {56166#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {56166#(<= ~counter~0 6)} is VALID [2022-04-28 05:59:22,551 INFO L290 TraceCheckUtils]: 60: Hoare triple {56166#(<= ~counter~0 6)} ~cond := #in~cond; {56166#(<= ~counter~0 6)} is VALID [2022-04-28 05:59:22,551 INFO L290 TraceCheckUtils]: 61: Hoare triple {56166#(<= ~counter~0 6)} assume !(0 == ~cond); {56166#(<= ~counter~0 6)} is VALID [2022-04-28 05:59:22,552 INFO L290 TraceCheckUtils]: 62: Hoare triple {56166#(<= ~counter~0 6)} assume true; {56166#(<= ~counter~0 6)} is VALID [2022-04-28 05:59:22,552 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {56166#(<= ~counter~0 6)} {56166#(<= ~counter~0 6)} #96#return; {56166#(<= ~counter~0 6)} is VALID [2022-04-28 05:59:22,552 INFO L290 TraceCheckUtils]: 64: Hoare triple {56166#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {56166#(<= ~counter~0 6)} is VALID [2022-04-28 05:59:22,553 INFO L290 TraceCheckUtils]: 65: Hoare triple {56166#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {56191#(<= ~counter~0 7)} is VALID [2022-04-28 05:59:22,553 INFO L290 TraceCheckUtils]: 66: Hoare triple {56191#(<= ~counter~0 7)} assume !!(#t~post7 < 20);havoc #t~post7; {56191#(<= ~counter~0 7)} is VALID [2022-04-28 05:59:22,554 INFO L272 TraceCheckUtils]: 67: Hoare triple {56191#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {56191#(<= ~counter~0 7)} is VALID [2022-04-28 05:59:22,554 INFO L290 TraceCheckUtils]: 68: Hoare triple {56191#(<= ~counter~0 7)} ~cond := #in~cond; {56191#(<= ~counter~0 7)} is VALID [2022-04-28 05:59:22,554 INFO L290 TraceCheckUtils]: 69: Hoare triple {56191#(<= ~counter~0 7)} assume !(0 == ~cond); {56191#(<= ~counter~0 7)} is VALID [2022-04-28 05:59:22,555 INFO L290 TraceCheckUtils]: 70: Hoare triple {56191#(<= ~counter~0 7)} assume true; {56191#(<= ~counter~0 7)} is VALID [2022-04-28 05:59:22,555 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {56191#(<= ~counter~0 7)} {56191#(<= ~counter~0 7)} #96#return; {56191#(<= ~counter~0 7)} is VALID [2022-04-28 05:59:22,555 INFO L290 TraceCheckUtils]: 72: Hoare triple {56191#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {56191#(<= ~counter~0 7)} is VALID [2022-04-28 05:59:22,556 INFO L290 TraceCheckUtils]: 73: Hoare triple {56191#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {56216#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:22,556 INFO L290 TraceCheckUtils]: 74: Hoare triple {56216#(<= ~counter~0 8)} assume !!(#t~post7 < 20);havoc #t~post7; {56216#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:22,557 INFO L272 TraceCheckUtils]: 75: Hoare triple {56216#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {56216#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:22,557 INFO L290 TraceCheckUtils]: 76: Hoare triple {56216#(<= ~counter~0 8)} ~cond := #in~cond; {56216#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:22,557 INFO L290 TraceCheckUtils]: 77: Hoare triple {56216#(<= ~counter~0 8)} assume !(0 == ~cond); {56216#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:22,558 INFO L290 TraceCheckUtils]: 78: Hoare triple {56216#(<= ~counter~0 8)} assume true; {56216#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:22,558 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {56216#(<= ~counter~0 8)} {56216#(<= ~counter~0 8)} #96#return; {56216#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:22,558 INFO L290 TraceCheckUtils]: 80: Hoare triple {56216#(<= ~counter~0 8)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {56216#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:22,559 INFO L290 TraceCheckUtils]: 81: Hoare triple {56216#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {56241#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:22,559 INFO L290 TraceCheckUtils]: 82: Hoare triple {56241#(<= ~counter~0 9)} assume !!(#t~post7 < 20);havoc #t~post7; {56241#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:22,560 INFO L272 TraceCheckUtils]: 83: Hoare triple {56241#(<= ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {56241#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:22,560 INFO L290 TraceCheckUtils]: 84: Hoare triple {56241#(<= ~counter~0 9)} ~cond := #in~cond; {56241#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:22,560 INFO L290 TraceCheckUtils]: 85: Hoare triple {56241#(<= ~counter~0 9)} assume !(0 == ~cond); {56241#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:22,560 INFO L290 TraceCheckUtils]: 86: Hoare triple {56241#(<= ~counter~0 9)} assume true; {56241#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:22,561 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {56241#(<= ~counter~0 9)} {56241#(<= ~counter~0 9)} #96#return; {56241#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:22,561 INFO L290 TraceCheckUtils]: 88: Hoare triple {56241#(<= ~counter~0 9)} assume !(~r~0 > 0); {56241#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:22,562 INFO L290 TraceCheckUtils]: 89: Hoare triple {56241#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {56266#(<= ~counter~0 10)} is VALID [2022-04-28 05:59:22,562 INFO L290 TraceCheckUtils]: 90: Hoare triple {56266#(<= ~counter~0 10)} assume !!(#t~post8 < 20);havoc #t~post8; {56266#(<= ~counter~0 10)} is VALID [2022-04-28 05:59:22,563 INFO L272 TraceCheckUtils]: 91: Hoare triple {56266#(<= ~counter~0 10)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {56266#(<= ~counter~0 10)} is VALID [2022-04-28 05:59:22,563 INFO L290 TraceCheckUtils]: 92: Hoare triple {56266#(<= ~counter~0 10)} ~cond := #in~cond; {56266#(<= ~counter~0 10)} is VALID [2022-04-28 05:59:22,563 INFO L290 TraceCheckUtils]: 93: Hoare triple {56266#(<= ~counter~0 10)} assume !(0 == ~cond); {56266#(<= ~counter~0 10)} is VALID [2022-04-28 05:59:22,563 INFO L290 TraceCheckUtils]: 94: Hoare triple {56266#(<= ~counter~0 10)} assume true; {56266#(<= ~counter~0 10)} is VALID [2022-04-28 05:59:22,564 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {56266#(<= ~counter~0 10)} {56266#(<= ~counter~0 10)} #98#return; {56266#(<= ~counter~0 10)} is VALID [2022-04-28 05:59:22,564 INFO L290 TraceCheckUtils]: 96: Hoare triple {56266#(<= ~counter~0 10)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {56266#(<= ~counter~0 10)} is VALID [2022-04-28 05:59:22,565 INFO L290 TraceCheckUtils]: 97: Hoare triple {56266#(<= ~counter~0 10)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {56291#(<= ~counter~0 11)} is VALID [2022-04-28 05:59:22,565 INFO L290 TraceCheckUtils]: 98: Hoare triple {56291#(<= ~counter~0 11)} assume !!(#t~post8 < 20);havoc #t~post8; {56291#(<= ~counter~0 11)} is VALID [2022-04-28 05:59:22,566 INFO L272 TraceCheckUtils]: 99: Hoare triple {56291#(<= ~counter~0 11)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {56291#(<= ~counter~0 11)} is VALID [2022-04-28 05:59:22,566 INFO L290 TraceCheckUtils]: 100: Hoare triple {56291#(<= ~counter~0 11)} ~cond := #in~cond; {56291#(<= ~counter~0 11)} is VALID [2022-04-28 05:59:22,566 INFO L290 TraceCheckUtils]: 101: Hoare triple {56291#(<= ~counter~0 11)} assume !(0 == ~cond); {56291#(<= ~counter~0 11)} is VALID [2022-04-28 05:59:22,566 INFO L290 TraceCheckUtils]: 102: Hoare triple {56291#(<= ~counter~0 11)} assume true; {56291#(<= ~counter~0 11)} is VALID [2022-04-28 05:59:22,567 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {56291#(<= ~counter~0 11)} {56291#(<= ~counter~0 11)} #98#return; {56291#(<= ~counter~0 11)} is VALID [2022-04-28 05:59:22,567 INFO L290 TraceCheckUtils]: 104: Hoare triple {56291#(<= ~counter~0 11)} assume !(~r~0 < 0); {56291#(<= ~counter~0 11)} is VALID [2022-04-28 05:59:22,567 INFO L290 TraceCheckUtils]: 105: Hoare triple {56291#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {56316#(<= |main_#t~post6| 11)} is VALID [2022-04-28 05:59:22,568 INFO L290 TraceCheckUtils]: 106: Hoare triple {56316#(<= |main_#t~post6| 11)} assume !(#t~post6 < 20);havoc #t~post6; {55985#false} is VALID [2022-04-28 05:59:22,568 INFO L272 TraceCheckUtils]: 107: Hoare triple {55985#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {55985#false} is VALID [2022-04-28 05:59:22,568 INFO L290 TraceCheckUtils]: 108: Hoare triple {55985#false} ~cond := #in~cond; {55985#false} is VALID [2022-04-28 05:59:22,568 INFO L290 TraceCheckUtils]: 109: Hoare triple {55985#false} assume 0 == ~cond; {55985#false} is VALID [2022-04-28 05:59:22,568 INFO L290 TraceCheckUtils]: 110: Hoare triple {55985#false} assume !false; {55985#false} is VALID [2022-04-28 05:59:22,568 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 22 proven. 292 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 05:59:22,568 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:59:23,205 INFO L290 TraceCheckUtils]: 110: Hoare triple {55985#false} assume !false; {55985#false} is VALID [2022-04-28 05:59:23,205 INFO L290 TraceCheckUtils]: 109: Hoare triple {55985#false} assume 0 == ~cond; {55985#false} is VALID [2022-04-28 05:59:23,205 INFO L290 TraceCheckUtils]: 108: Hoare triple {55985#false} ~cond := #in~cond; {55985#false} is VALID [2022-04-28 05:59:23,205 INFO L272 TraceCheckUtils]: 107: Hoare triple {55985#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {55985#false} is VALID [2022-04-28 05:59:23,206 INFO L290 TraceCheckUtils]: 106: Hoare triple {56344#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {55985#false} is VALID [2022-04-28 05:59:23,206 INFO L290 TraceCheckUtils]: 105: Hoare triple {56348#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {56344#(< |main_#t~post6| 20)} is VALID [2022-04-28 05:59:23,206 INFO L290 TraceCheckUtils]: 104: Hoare triple {56348#(< ~counter~0 20)} assume !(~r~0 < 0); {56348#(< ~counter~0 20)} is VALID [2022-04-28 05:59:23,207 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {55984#true} {56348#(< ~counter~0 20)} #98#return; {56348#(< ~counter~0 20)} is VALID [2022-04-28 05:59:23,207 INFO L290 TraceCheckUtils]: 102: Hoare triple {55984#true} assume true; {55984#true} is VALID [2022-04-28 05:59:23,207 INFO L290 TraceCheckUtils]: 101: Hoare triple {55984#true} assume !(0 == ~cond); {55984#true} is VALID [2022-04-28 05:59:23,207 INFO L290 TraceCheckUtils]: 100: Hoare triple {55984#true} ~cond := #in~cond; {55984#true} is VALID [2022-04-28 05:59:23,207 INFO L272 TraceCheckUtils]: 99: Hoare triple {56348#(< ~counter~0 20)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {55984#true} is VALID [2022-04-28 05:59:23,207 INFO L290 TraceCheckUtils]: 98: Hoare triple {56348#(< ~counter~0 20)} assume !!(#t~post8 < 20);havoc #t~post8; {56348#(< ~counter~0 20)} is VALID [2022-04-28 05:59:23,209 INFO L290 TraceCheckUtils]: 97: Hoare triple {56373#(< ~counter~0 19)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {56348#(< ~counter~0 20)} is VALID [2022-04-28 05:59:23,209 INFO L290 TraceCheckUtils]: 96: Hoare triple {56373#(< ~counter~0 19)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {56373#(< ~counter~0 19)} is VALID [2022-04-28 05:59:23,209 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {55984#true} {56373#(< ~counter~0 19)} #98#return; {56373#(< ~counter~0 19)} is VALID [2022-04-28 05:59:23,209 INFO L290 TraceCheckUtils]: 94: Hoare triple {55984#true} assume true; {55984#true} is VALID [2022-04-28 05:59:23,210 INFO L290 TraceCheckUtils]: 93: Hoare triple {55984#true} assume !(0 == ~cond); {55984#true} is VALID [2022-04-28 05:59:23,210 INFO L290 TraceCheckUtils]: 92: Hoare triple {55984#true} ~cond := #in~cond; {55984#true} is VALID [2022-04-28 05:59:23,210 INFO L272 TraceCheckUtils]: 91: Hoare triple {56373#(< ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {55984#true} is VALID [2022-04-28 05:59:23,210 INFO L290 TraceCheckUtils]: 90: Hoare triple {56373#(< ~counter~0 19)} assume !!(#t~post8 < 20);havoc #t~post8; {56373#(< ~counter~0 19)} is VALID [2022-04-28 05:59:23,211 INFO L290 TraceCheckUtils]: 89: Hoare triple {56398#(< ~counter~0 18)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {56373#(< ~counter~0 19)} is VALID [2022-04-28 05:59:23,211 INFO L290 TraceCheckUtils]: 88: Hoare triple {56398#(< ~counter~0 18)} assume !(~r~0 > 0); {56398#(< ~counter~0 18)} is VALID [2022-04-28 05:59:23,211 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {55984#true} {56398#(< ~counter~0 18)} #96#return; {56398#(< ~counter~0 18)} is VALID [2022-04-28 05:59:23,212 INFO L290 TraceCheckUtils]: 86: Hoare triple {55984#true} assume true; {55984#true} is VALID [2022-04-28 05:59:23,212 INFO L290 TraceCheckUtils]: 85: Hoare triple {55984#true} assume !(0 == ~cond); {55984#true} is VALID [2022-04-28 05:59:23,212 INFO L290 TraceCheckUtils]: 84: Hoare triple {55984#true} ~cond := #in~cond; {55984#true} is VALID [2022-04-28 05:59:23,212 INFO L272 TraceCheckUtils]: 83: Hoare triple {56398#(< ~counter~0 18)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {55984#true} is VALID [2022-04-28 05:59:23,212 INFO L290 TraceCheckUtils]: 82: Hoare triple {56398#(< ~counter~0 18)} assume !!(#t~post7 < 20);havoc #t~post7; {56398#(< ~counter~0 18)} is VALID [2022-04-28 05:59:23,213 INFO L290 TraceCheckUtils]: 81: Hoare triple {56423#(< ~counter~0 17)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {56398#(< ~counter~0 18)} is VALID [2022-04-28 05:59:23,213 INFO L290 TraceCheckUtils]: 80: Hoare triple {56423#(< ~counter~0 17)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {56423#(< ~counter~0 17)} is VALID [2022-04-28 05:59:23,214 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {55984#true} {56423#(< ~counter~0 17)} #96#return; {56423#(< ~counter~0 17)} is VALID [2022-04-28 05:59:23,214 INFO L290 TraceCheckUtils]: 78: Hoare triple {55984#true} assume true; {55984#true} is VALID [2022-04-28 05:59:23,214 INFO L290 TraceCheckUtils]: 77: Hoare triple {55984#true} assume !(0 == ~cond); {55984#true} is VALID [2022-04-28 05:59:23,214 INFO L290 TraceCheckUtils]: 76: Hoare triple {55984#true} ~cond := #in~cond; {55984#true} is VALID [2022-04-28 05:59:23,214 INFO L272 TraceCheckUtils]: 75: Hoare triple {56423#(< ~counter~0 17)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {55984#true} is VALID [2022-04-28 05:59:23,214 INFO L290 TraceCheckUtils]: 74: Hoare triple {56423#(< ~counter~0 17)} assume !!(#t~post7 < 20);havoc #t~post7; {56423#(< ~counter~0 17)} is VALID [2022-04-28 05:59:23,215 INFO L290 TraceCheckUtils]: 73: Hoare triple {56448#(< ~counter~0 16)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {56423#(< ~counter~0 17)} is VALID [2022-04-28 05:59:23,215 INFO L290 TraceCheckUtils]: 72: Hoare triple {56448#(< ~counter~0 16)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {56448#(< ~counter~0 16)} is VALID [2022-04-28 05:59:23,216 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {55984#true} {56448#(< ~counter~0 16)} #96#return; {56448#(< ~counter~0 16)} is VALID [2022-04-28 05:59:23,216 INFO L290 TraceCheckUtils]: 70: Hoare triple {55984#true} assume true; {55984#true} is VALID [2022-04-28 05:59:23,216 INFO L290 TraceCheckUtils]: 69: Hoare triple {55984#true} assume !(0 == ~cond); {55984#true} is VALID [2022-04-28 05:59:23,216 INFO L290 TraceCheckUtils]: 68: Hoare triple {55984#true} ~cond := #in~cond; {55984#true} is VALID [2022-04-28 05:59:23,216 INFO L272 TraceCheckUtils]: 67: Hoare triple {56448#(< ~counter~0 16)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {55984#true} is VALID [2022-04-28 05:59:23,216 INFO L290 TraceCheckUtils]: 66: Hoare triple {56448#(< ~counter~0 16)} assume !!(#t~post7 < 20);havoc #t~post7; {56448#(< ~counter~0 16)} is VALID [2022-04-28 05:59:23,217 INFO L290 TraceCheckUtils]: 65: Hoare triple {56473#(< ~counter~0 15)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {56448#(< ~counter~0 16)} is VALID [2022-04-28 05:59:23,217 INFO L290 TraceCheckUtils]: 64: Hoare triple {56473#(< ~counter~0 15)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {56473#(< ~counter~0 15)} is VALID [2022-04-28 05:59:23,218 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {55984#true} {56473#(< ~counter~0 15)} #96#return; {56473#(< ~counter~0 15)} is VALID [2022-04-28 05:59:23,218 INFO L290 TraceCheckUtils]: 62: Hoare triple {55984#true} assume true; {55984#true} is VALID [2022-04-28 05:59:23,218 INFO L290 TraceCheckUtils]: 61: Hoare triple {55984#true} assume !(0 == ~cond); {55984#true} is VALID [2022-04-28 05:59:23,218 INFO L290 TraceCheckUtils]: 60: Hoare triple {55984#true} ~cond := #in~cond; {55984#true} is VALID [2022-04-28 05:59:23,218 INFO L272 TraceCheckUtils]: 59: Hoare triple {56473#(< ~counter~0 15)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {55984#true} is VALID [2022-04-28 05:59:23,218 INFO L290 TraceCheckUtils]: 58: Hoare triple {56473#(< ~counter~0 15)} assume !!(#t~post7 < 20);havoc #t~post7; {56473#(< ~counter~0 15)} is VALID [2022-04-28 05:59:23,219 INFO L290 TraceCheckUtils]: 57: Hoare triple {56498#(< ~counter~0 14)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {56473#(< ~counter~0 15)} is VALID [2022-04-28 05:59:23,219 INFO L290 TraceCheckUtils]: 56: Hoare triple {56498#(< ~counter~0 14)} assume !!(0 != ~r~0); {56498#(< ~counter~0 14)} is VALID [2022-04-28 05:59:23,220 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {55984#true} {56498#(< ~counter~0 14)} #94#return; {56498#(< ~counter~0 14)} is VALID [2022-04-28 05:59:23,220 INFO L290 TraceCheckUtils]: 54: Hoare triple {55984#true} assume true; {55984#true} is VALID [2022-04-28 05:59:23,220 INFO L290 TraceCheckUtils]: 53: Hoare triple {55984#true} assume !(0 == ~cond); {55984#true} is VALID [2022-04-28 05:59:23,220 INFO L290 TraceCheckUtils]: 52: Hoare triple {55984#true} ~cond := #in~cond; {55984#true} is VALID [2022-04-28 05:59:23,220 INFO L272 TraceCheckUtils]: 51: Hoare triple {56498#(< ~counter~0 14)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {55984#true} is VALID [2022-04-28 05:59:23,220 INFO L290 TraceCheckUtils]: 50: Hoare triple {56498#(< ~counter~0 14)} assume !!(#t~post6 < 20);havoc #t~post6; {56498#(< ~counter~0 14)} is VALID [2022-04-28 05:59:23,221 INFO L290 TraceCheckUtils]: 49: Hoare triple {56523#(< ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {56498#(< ~counter~0 14)} is VALID [2022-04-28 05:59:23,222 INFO L290 TraceCheckUtils]: 48: Hoare triple {56523#(< ~counter~0 13)} assume !(~r~0 < 0); {56523#(< ~counter~0 13)} is VALID [2022-04-28 05:59:23,222 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {55984#true} {56523#(< ~counter~0 13)} #98#return; {56523#(< ~counter~0 13)} is VALID [2022-04-28 05:59:23,222 INFO L290 TraceCheckUtils]: 46: Hoare triple {55984#true} assume true; {55984#true} is VALID [2022-04-28 05:59:23,222 INFO L290 TraceCheckUtils]: 45: Hoare triple {55984#true} assume !(0 == ~cond); {55984#true} is VALID [2022-04-28 05:59:23,222 INFO L290 TraceCheckUtils]: 44: Hoare triple {55984#true} ~cond := #in~cond; {55984#true} is VALID [2022-04-28 05:59:23,222 INFO L272 TraceCheckUtils]: 43: Hoare triple {56523#(< ~counter~0 13)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {55984#true} is VALID [2022-04-28 05:59:23,223 INFO L290 TraceCheckUtils]: 42: Hoare triple {56523#(< ~counter~0 13)} assume !!(#t~post8 < 20);havoc #t~post8; {56523#(< ~counter~0 13)} is VALID [2022-04-28 05:59:23,224 INFO L290 TraceCheckUtils]: 41: Hoare triple {56291#(<= ~counter~0 11)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {56523#(< ~counter~0 13)} is VALID [2022-04-28 05:59:23,224 INFO L290 TraceCheckUtils]: 40: Hoare triple {56291#(<= ~counter~0 11)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {56291#(<= ~counter~0 11)} is VALID [2022-04-28 05:59:23,224 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {55984#true} {56291#(<= ~counter~0 11)} #98#return; {56291#(<= ~counter~0 11)} is VALID [2022-04-28 05:59:23,224 INFO L290 TraceCheckUtils]: 38: Hoare triple {55984#true} assume true; {55984#true} is VALID [2022-04-28 05:59:23,225 INFO L290 TraceCheckUtils]: 37: Hoare triple {55984#true} assume !(0 == ~cond); {55984#true} is VALID [2022-04-28 05:59:23,225 INFO L290 TraceCheckUtils]: 36: Hoare triple {55984#true} ~cond := #in~cond; {55984#true} is VALID [2022-04-28 05:59:23,225 INFO L272 TraceCheckUtils]: 35: Hoare triple {56291#(<= ~counter~0 11)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {55984#true} is VALID [2022-04-28 05:59:23,225 INFO L290 TraceCheckUtils]: 34: Hoare triple {56291#(<= ~counter~0 11)} assume !!(#t~post8 < 20);havoc #t~post8; {56291#(<= ~counter~0 11)} is VALID [2022-04-28 05:59:23,226 INFO L290 TraceCheckUtils]: 33: Hoare triple {56266#(<= ~counter~0 10)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {56291#(<= ~counter~0 11)} is VALID [2022-04-28 05:59:23,226 INFO L290 TraceCheckUtils]: 32: Hoare triple {56266#(<= ~counter~0 10)} assume !(~r~0 > 0); {56266#(<= ~counter~0 10)} is VALID [2022-04-28 05:59:23,227 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {55984#true} {56266#(<= ~counter~0 10)} #96#return; {56266#(<= ~counter~0 10)} is VALID [2022-04-28 05:59:23,227 INFO L290 TraceCheckUtils]: 30: Hoare triple {55984#true} assume true; {55984#true} is VALID [2022-04-28 05:59:23,227 INFO L290 TraceCheckUtils]: 29: Hoare triple {55984#true} assume !(0 == ~cond); {55984#true} is VALID [2022-04-28 05:59:23,227 INFO L290 TraceCheckUtils]: 28: Hoare triple {55984#true} ~cond := #in~cond; {55984#true} is VALID [2022-04-28 05:59:23,227 INFO L272 TraceCheckUtils]: 27: Hoare triple {56266#(<= ~counter~0 10)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {55984#true} is VALID [2022-04-28 05:59:23,227 INFO L290 TraceCheckUtils]: 26: Hoare triple {56266#(<= ~counter~0 10)} assume !!(#t~post7 < 20);havoc #t~post7; {56266#(<= ~counter~0 10)} is VALID [2022-04-28 05:59:23,228 INFO L290 TraceCheckUtils]: 25: Hoare triple {56241#(<= ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {56266#(<= ~counter~0 10)} is VALID [2022-04-28 05:59:23,228 INFO L290 TraceCheckUtils]: 24: Hoare triple {56241#(<= ~counter~0 9)} assume !!(0 != ~r~0); {56241#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:23,229 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {55984#true} {56241#(<= ~counter~0 9)} #94#return; {56241#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:23,229 INFO L290 TraceCheckUtils]: 22: Hoare triple {55984#true} assume true; {55984#true} is VALID [2022-04-28 05:59:23,229 INFO L290 TraceCheckUtils]: 21: Hoare triple {55984#true} assume !(0 == ~cond); {55984#true} is VALID [2022-04-28 05:59:23,229 INFO L290 TraceCheckUtils]: 20: Hoare triple {55984#true} ~cond := #in~cond; {55984#true} is VALID [2022-04-28 05:59:23,229 INFO L272 TraceCheckUtils]: 19: Hoare triple {56241#(<= ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {55984#true} is VALID [2022-04-28 05:59:23,229 INFO L290 TraceCheckUtils]: 18: Hoare triple {56241#(<= ~counter~0 9)} assume !!(#t~post6 < 20);havoc #t~post6; {56241#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:23,230 INFO L290 TraceCheckUtils]: 17: Hoare triple {56216#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {56241#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:23,230 INFO L290 TraceCheckUtils]: 16: Hoare triple {56216#(<= ~counter~0 8)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {56216#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:23,231 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {55984#true} {56216#(<= ~counter~0 8)} #92#return; {56216#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:23,231 INFO L290 TraceCheckUtils]: 14: Hoare triple {55984#true} assume true; {55984#true} is VALID [2022-04-28 05:59:23,231 INFO L290 TraceCheckUtils]: 13: Hoare triple {55984#true} assume !(0 == ~cond); {55984#true} is VALID [2022-04-28 05:59:23,231 INFO L290 TraceCheckUtils]: 12: Hoare triple {55984#true} ~cond := #in~cond; {55984#true} is VALID [2022-04-28 05:59:23,231 INFO L272 TraceCheckUtils]: 11: Hoare triple {56216#(<= ~counter~0 8)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {55984#true} is VALID [2022-04-28 05:59:23,231 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {55984#true} {56216#(<= ~counter~0 8)} #90#return; {56216#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:23,231 INFO L290 TraceCheckUtils]: 9: Hoare triple {55984#true} assume true; {55984#true} is VALID [2022-04-28 05:59:23,232 INFO L290 TraceCheckUtils]: 8: Hoare triple {55984#true} assume !(0 == ~cond); {55984#true} is VALID [2022-04-28 05:59:23,232 INFO L290 TraceCheckUtils]: 7: Hoare triple {55984#true} ~cond := #in~cond; {55984#true} is VALID [2022-04-28 05:59:23,232 INFO L272 TraceCheckUtils]: 6: Hoare triple {56216#(<= ~counter~0 8)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {55984#true} is VALID [2022-04-28 05:59:23,232 INFO L290 TraceCheckUtils]: 5: Hoare triple {56216#(<= ~counter~0 8)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {56216#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:23,232 INFO L272 TraceCheckUtils]: 4: Hoare triple {56216#(<= ~counter~0 8)} call #t~ret9 := main(); {56216#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:23,232 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {56216#(<= ~counter~0 8)} {55984#true} #102#return; {56216#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:23,233 INFO L290 TraceCheckUtils]: 2: Hoare triple {56216#(<= ~counter~0 8)} assume true; {56216#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:23,233 INFO L290 TraceCheckUtils]: 1: Hoare triple {55984#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {56216#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:23,233 INFO L272 TraceCheckUtils]: 0: Hoare triple {55984#true} call ULTIMATE.init(); {55984#true} is VALID [2022-04-28 05:59:23,234 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 22 proven. 72 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2022-04-28 05:59:23,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:59:23,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024311689] [2022-04-28 05:59:23,234 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:59:23,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [649070369] [2022-04-28 05:59:23,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [649070369] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:59:23,234 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:59:23,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 24 [2022-04-28 05:59:23,234 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:59:23,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [155945163] [2022-04-28 05:59:23,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [155945163] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:59:23,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:59:23,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 05:59:23,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836583646] [2022-04-28 05:59:23,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:59:23,235 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.2) internal successors, (78), 14 states have internal predecessors, (78), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) Word has length 111 [2022-04-28 05:59:23,235 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:59:23,235 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 5.2) internal successors, (78), 14 states have internal predecessors, (78), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-28 05:59:23,331 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:59:23,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 05:59:23,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:59:23,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 05:59:23,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-28 05:59:23,332 INFO L87 Difference]: Start difference. First operand 538 states and 733 transitions. Second operand has 15 states, 15 states have (on average 5.2) internal successors, (78), 14 states have internal predecessors, (78), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-28 05:59:25,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:59:25,560 INFO L93 Difference]: Finished difference Result 593 states and 810 transitions. [2022-04-28 05:59:25,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-28 05:59:25,561 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.2) internal successors, (78), 14 states have internal predecessors, (78), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) Word has length 111 [2022-04-28 05:59:25,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:59:25,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 5.2) internal successors, (78), 14 states have internal predecessors, (78), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-28 05:59:25,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 234 transitions. [2022-04-28 05:59:25,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 5.2) internal successors, (78), 14 states have internal predecessors, (78), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-28 05:59:25,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 234 transitions. [2022-04-28 05:59:25,566 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 234 transitions. [2022-04-28 05:59:25,779 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 234 edges. 234 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:59:25,802 INFO L225 Difference]: With dead ends: 593 [2022-04-28 05:59:25,802 INFO L226 Difference]: Without dead ends: 582 [2022-04-28 05:59:25,802 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 198 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=399, Invalid=593, Unknown=0, NotChecked=0, Total=992 [2022-04-28 05:59:25,803 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 154 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 05:59:25,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 279 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 05:59:25,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2022-04-28 05:59:27,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 560. [2022-04-28 05:59:27,013 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:59:27,013 INFO L82 GeneralOperation]: Start isEquivalent. First operand 582 states. Second operand has 560 states, 418 states have (on average 1.2344497607655502) internal successors, (516), 428 states have internal predecessors, (516), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 115 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-28 05:59:27,014 INFO L74 IsIncluded]: Start isIncluded. First operand 582 states. Second operand has 560 states, 418 states have (on average 1.2344497607655502) internal successors, (516), 428 states have internal predecessors, (516), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 115 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-28 05:59:27,014 INFO L87 Difference]: Start difference. First operand 582 states. Second operand has 560 states, 418 states have (on average 1.2344497607655502) internal successors, (516), 428 states have internal predecessors, (516), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 115 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-28 05:59:27,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:59:27,036 INFO L93 Difference]: Finished difference Result 582 states and 794 transitions. [2022-04-28 05:59:27,036 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 794 transitions. [2022-04-28 05:59:27,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:59:27,037 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:59:27,038 INFO L74 IsIncluded]: Start isIncluded. First operand has 560 states, 418 states have (on average 1.2344497607655502) internal successors, (516), 428 states have internal predecessors, (516), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 115 states have call predecessors, (125), 125 states have call successors, (125) Second operand 582 states. [2022-04-28 05:59:27,038 INFO L87 Difference]: Start difference. First operand has 560 states, 418 states have (on average 1.2344497607655502) internal successors, (516), 428 states have internal predecessors, (516), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 115 states have call predecessors, (125), 125 states have call successors, (125) Second operand 582 states. [2022-04-28 05:59:27,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:59:27,057 INFO L93 Difference]: Finished difference Result 582 states and 794 transitions. [2022-04-28 05:59:27,057 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 794 transitions. [2022-04-28 05:59:27,058 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:59:27,058 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:59:27,058 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:59:27,058 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:59:27,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 418 states have (on average 1.2344497607655502) internal successors, (516), 428 states have internal predecessors, (516), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 115 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-28 05:59:27,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 768 transitions. [2022-04-28 05:59:27,083 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 768 transitions. Word has length 111 [2022-04-28 05:59:27,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:59:27,083 INFO L495 AbstractCegarLoop]: Abstraction has 560 states and 768 transitions. [2022-04-28 05:59:27,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.2) internal successors, (78), 14 states have internal predecessors, (78), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-28 05:59:27,084 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 560 states and 768 transitions. [2022-04-28 05:59:28,917 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 768 edges. 768 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:59:28,918 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 768 transitions. [2022-04-28 05:59:28,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-04-28 05:59:28,918 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:59:28,919 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:59:28,924 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-04-28 05:59:29,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-04-28 05:59:29,124 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:59:29,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:59:29,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1038942829, now seen corresponding path program 13 times [2022-04-28 05:59:29,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:59:29,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1452545083] [2022-04-28 05:59:29,125 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:59:29,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1038942829, now seen corresponding path program 14 times [2022-04-28 05:59:29,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:59:29,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945924614] [2022-04-28 05:59:29,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:59:29,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:59:29,141 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:59:29,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [67375478] [2022-04-28 05:59:29,142 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:59:29,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:59:29,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:59:29,143 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:59:29,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-04-28 05:59:29,197 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:59:29,197 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:59:29,198 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 05:59:29,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:59:29,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:59:30,110 INFO L272 TraceCheckUtils]: 0: Hoare triple {60159#true} call ULTIMATE.init(); {60159#true} is VALID [2022-04-28 05:59:30,111 INFO L290 TraceCheckUtils]: 1: Hoare triple {60159#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {60159#true} is VALID [2022-04-28 05:59:30,111 INFO L290 TraceCheckUtils]: 2: Hoare triple {60159#true} assume true; {60159#true} is VALID [2022-04-28 05:59:30,111 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {60159#true} {60159#true} #102#return; {60159#true} is VALID [2022-04-28 05:59:30,111 INFO L272 TraceCheckUtils]: 4: Hoare triple {60159#true} call #t~ret9 := main(); {60159#true} is VALID [2022-04-28 05:59:30,111 INFO L290 TraceCheckUtils]: 5: Hoare triple {60159#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {60159#true} is VALID [2022-04-28 05:59:30,111 INFO L272 TraceCheckUtils]: 6: Hoare triple {60159#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {60159#true} is VALID [2022-04-28 05:59:30,111 INFO L290 TraceCheckUtils]: 7: Hoare triple {60159#true} ~cond := #in~cond; {60159#true} is VALID [2022-04-28 05:59:30,111 INFO L290 TraceCheckUtils]: 8: Hoare triple {60159#true} assume !(0 == ~cond); {60159#true} is VALID [2022-04-28 05:59:30,111 INFO L290 TraceCheckUtils]: 9: Hoare triple {60159#true} assume true; {60159#true} is VALID [2022-04-28 05:59:30,111 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {60159#true} {60159#true} #90#return; {60159#true} is VALID [2022-04-28 05:59:30,111 INFO L272 TraceCheckUtils]: 11: Hoare triple {60159#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {60159#true} is VALID [2022-04-28 05:59:30,111 INFO L290 TraceCheckUtils]: 12: Hoare triple {60159#true} ~cond := #in~cond; {60159#true} is VALID [2022-04-28 05:59:30,112 INFO L290 TraceCheckUtils]: 13: Hoare triple {60159#true} assume !(0 == ~cond); {60159#true} is VALID [2022-04-28 05:59:30,112 INFO L290 TraceCheckUtils]: 14: Hoare triple {60159#true} assume true; {60159#true} is VALID [2022-04-28 05:59:30,112 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {60159#true} {60159#true} #92#return; {60159#true} is VALID [2022-04-28 05:59:30,112 INFO L290 TraceCheckUtils]: 16: Hoare triple {60159#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {60212#(<= 1 main_~v~0)} is VALID [2022-04-28 05:59:30,112 INFO L290 TraceCheckUtils]: 17: Hoare triple {60212#(<= 1 main_~v~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {60212#(<= 1 main_~v~0)} is VALID [2022-04-28 05:59:30,113 INFO L290 TraceCheckUtils]: 18: Hoare triple {60212#(<= 1 main_~v~0)} assume !!(#t~post6 < 20);havoc #t~post6; {60212#(<= 1 main_~v~0)} is VALID [2022-04-28 05:59:30,113 INFO L272 TraceCheckUtils]: 19: Hoare triple {60212#(<= 1 main_~v~0)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {60159#true} is VALID [2022-04-28 05:59:30,113 INFO L290 TraceCheckUtils]: 20: Hoare triple {60159#true} ~cond := #in~cond; {60159#true} is VALID [2022-04-28 05:59:30,113 INFO L290 TraceCheckUtils]: 21: Hoare triple {60159#true} assume !(0 == ~cond); {60159#true} is VALID [2022-04-28 05:59:30,113 INFO L290 TraceCheckUtils]: 22: Hoare triple {60159#true} assume true; {60159#true} is VALID [2022-04-28 05:59:30,113 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {60159#true} {60212#(<= 1 main_~v~0)} #94#return; {60212#(<= 1 main_~v~0)} is VALID [2022-04-28 05:59:30,114 INFO L290 TraceCheckUtils]: 24: Hoare triple {60212#(<= 1 main_~v~0)} assume !!(0 != ~r~0); {60212#(<= 1 main_~v~0)} is VALID [2022-04-28 05:59:30,114 INFO L290 TraceCheckUtils]: 25: Hoare triple {60212#(<= 1 main_~v~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {60212#(<= 1 main_~v~0)} is VALID [2022-04-28 05:59:30,114 INFO L290 TraceCheckUtils]: 26: Hoare triple {60212#(<= 1 main_~v~0)} assume !!(#t~post7 < 20);havoc #t~post7; {60212#(<= 1 main_~v~0)} is VALID [2022-04-28 05:59:30,114 INFO L272 TraceCheckUtils]: 27: Hoare triple {60212#(<= 1 main_~v~0)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {60159#true} is VALID [2022-04-28 05:59:30,114 INFO L290 TraceCheckUtils]: 28: Hoare triple {60159#true} ~cond := #in~cond; {60159#true} is VALID [2022-04-28 05:59:30,114 INFO L290 TraceCheckUtils]: 29: Hoare triple {60159#true} assume !(0 == ~cond); {60159#true} is VALID [2022-04-28 05:59:30,114 INFO L290 TraceCheckUtils]: 30: Hoare triple {60159#true} assume true; {60159#true} is VALID [2022-04-28 05:59:30,115 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {60159#true} {60212#(<= 1 main_~v~0)} #96#return; {60212#(<= 1 main_~v~0)} is VALID [2022-04-28 05:59:30,115 INFO L290 TraceCheckUtils]: 32: Hoare triple {60212#(<= 1 main_~v~0)} assume !(~r~0 > 0); {60212#(<= 1 main_~v~0)} is VALID [2022-04-28 05:59:30,115 INFO L290 TraceCheckUtils]: 33: Hoare triple {60212#(<= 1 main_~v~0)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {60212#(<= 1 main_~v~0)} is VALID [2022-04-28 05:59:30,115 INFO L290 TraceCheckUtils]: 34: Hoare triple {60212#(<= 1 main_~v~0)} assume !!(#t~post8 < 20);havoc #t~post8; {60212#(<= 1 main_~v~0)} is VALID [2022-04-28 05:59:30,116 INFO L272 TraceCheckUtils]: 35: Hoare triple {60212#(<= 1 main_~v~0)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {60159#true} is VALID [2022-04-28 05:59:30,116 INFO L290 TraceCheckUtils]: 36: Hoare triple {60159#true} ~cond := #in~cond; {60159#true} is VALID [2022-04-28 05:59:30,116 INFO L290 TraceCheckUtils]: 37: Hoare triple {60159#true} assume !(0 == ~cond); {60159#true} is VALID [2022-04-28 05:59:30,116 INFO L290 TraceCheckUtils]: 38: Hoare triple {60159#true} assume true; {60159#true} is VALID [2022-04-28 05:59:30,116 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {60159#true} {60212#(<= 1 main_~v~0)} #98#return; {60212#(<= 1 main_~v~0)} is VALID [2022-04-28 05:59:30,118 INFO L290 TraceCheckUtils]: 40: Hoare triple {60212#(<= 1 main_~v~0)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {60285#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-28 05:59:30,118 INFO L290 TraceCheckUtils]: 41: Hoare triple {60285#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {60285#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-28 05:59:30,119 INFO L290 TraceCheckUtils]: 42: Hoare triple {60285#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} assume !!(#t~post8 < 20);havoc #t~post8; {60285#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-28 05:59:30,119 INFO L272 TraceCheckUtils]: 43: Hoare triple {60285#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {60159#true} is VALID [2022-04-28 05:59:30,119 INFO L290 TraceCheckUtils]: 44: Hoare triple {60159#true} ~cond := #in~cond; {60159#true} is VALID [2022-04-28 05:59:30,119 INFO L290 TraceCheckUtils]: 45: Hoare triple {60159#true} assume !(0 == ~cond); {60159#true} is VALID [2022-04-28 05:59:30,119 INFO L290 TraceCheckUtils]: 46: Hoare triple {60159#true} assume true; {60159#true} is VALID [2022-04-28 05:59:30,119 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {60159#true} {60285#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} #98#return; {60285#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-28 05:59:30,120 INFO L290 TraceCheckUtils]: 48: Hoare triple {60285#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} assume !(~r~0 < 0); {60285#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-28 05:59:30,120 INFO L290 TraceCheckUtils]: 49: Hoare triple {60285#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {60285#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-28 05:59:30,120 INFO L290 TraceCheckUtils]: 50: Hoare triple {60285#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} assume !!(#t~post6 < 20);havoc #t~post6; {60285#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-28 05:59:30,120 INFO L272 TraceCheckUtils]: 51: Hoare triple {60285#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {60159#true} is VALID [2022-04-28 05:59:30,120 INFO L290 TraceCheckUtils]: 52: Hoare triple {60159#true} ~cond := #in~cond; {60159#true} is VALID [2022-04-28 05:59:30,120 INFO L290 TraceCheckUtils]: 53: Hoare triple {60159#true} assume !(0 == ~cond); {60159#true} is VALID [2022-04-28 05:59:30,120 INFO L290 TraceCheckUtils]: 54: Hoare triple {60159#true} assume true; {60159#true} is VALID [2022-04-28 05:59:30,121 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {60159#true} {60285#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} #94#return; {60285#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-28 05:59:30,121 INFO L290 TraceCheckUtils]: 56: Hoare triple {60285#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} assume !!(0 != ~r~0); {60285#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-28 05:59:30,122 INFO L290 TraceCheckUtils]: 57: Hoare triple {60285#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {60285#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-28 05:59:30,122 INFO L290 TraceCheckUtils]: 58: Hoare triple {60285#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} assume !!(#t~post7 < 20);havoc #t~post7; {60285#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-28 05:59:30,122 INFO L272 TraceCheckUtils]: 59: Hoare triple {60285#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {60159#true} is VALID [2022-04-28 05:59:30,122 INFO L290 TraceCheckUtils]: 60: Hoare triple {60159#true} ~cond := #in~cond; {60159#true} is VALID [2022-04-28 05:59:30,122 INFO L290 TraceCheckUtils]: 61: Hoare triple {60159#true} assume !(0 == ~cond); {60159#true} is VALID [2022-04-28 05:59:30,122 INFO L290 TraceCheckUtils]: 62: Hoare triple {60159#true} assume true; {60159#true} is VALID [2022-04-28 05:59:30,123 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {60159#true} {60285#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} #96#return; {60285#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-28 05:59:30,124 INFO L290 TraceCheckUtils]: 64: Hoare triple {60285#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {60358#(< (+ main_~r~0 3) main_~u~0)} is VALID [2022-04-28 05:59:30,124 INFO L290 TraceCheckUtils]: 65: Hoare triple {60358#(< (+ main_~r~0 3) main_~u~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {60358#(< (+ main_~r~0 3) main_~u~0)} is VALID [2022-04-28 05:59:30,124 INFO L290 TraceCheckUtils]: 66: Hoare triple {60358#(< (+ main_~r~0 3) main_~u~0)} assume !!(#t~post7 < 20);havoc #t~post7; {60358#(< (+ main_~r~0 3) main_~u~0)} is VALID [2022-04-28 05:59:30,124 INFO L272 TraceCheckUtils]: 67: Hoare triple {60358#(< (+ main_~r~0 3) main_~u~0)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {60159#true} is VALID [2022-04-28 05:59:30,124 INFO L290 TraceCheckUtils]: 68: Hoare triple {60159#true} ~cond := #in~cond; {60159#true} is VALID [2022-04-28 05:59:30,124 INFO L290 TraceCheckUtils]: 69: Hoare triple {60159#true} assume !(0 == ~cond); {60159#true} is VALID [2022-04-28 05:59:30,124 INFO L290 TraceCheckUtils]: 70: Hoare triple {60159#true} assume true; {60159#true} is VALID [2022-04-28 05:59:30,125 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {60159#true} {60358#(< (+ main_~r~0 3) main_~u~0)} #96#return; {60358#(< (+ main_~r~0 3) main_~u~0)} is VALID [2022-04-28 05:59:30,125 INFO L290 TraceCheckUtils]: 72: Hoare triple {60358#(< (+ main_~r~0 3) main_~u~0)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {60383#(< (+ main_~v~0 main_~r~0 1) main_~u~0)} is VALID [2022-04-28 05:59:30,126 INFO L290 TraceCheckUtils]: 73: Hoare triple {60383#(< (+ main_~v~0 main_~r~0 1) main_~u~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {60383#(< (+ main_~v~0 main_~r~0 1) main_~u~0)} is VALID [2022-04-28 05:59:30,126 INFO L290 TraceCheckUtils]: 74: Hoare triple {60383#(< (+ main_~v~0 main_~r~0 1) main_~u~0)} assume !!(#t~post7 < 20);havoc #t~post7; {60383#(< (+ main_~v~0 main_~r~0 1) main_~u~0)} is VALID [2022-04-28 05:59:30,126 INFO L272 TraceCheckUtils]: 75: Hoare triple {60383#(< (+ main_~v~0 main_~r~0 1) main_~u~0)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {60159#true} is VALID [2022-04-28 05:59:30,126 INFO L290 TraceCheckUtils]: 76: Hoare triple {60159#true} ~cond := #in~cond; {60159#true} is VALID [2022-04-28 05:59:30,126 INFO L290 TraceCheckUtils]: 77: Hoare triple {60159#true} assume !(0 == ~cond); {60159#true} is VALID [2022-04-28 05:59:30,126 INFO L290 TraceCheckUtils]: 78: Hoare triple {60159#true} assume true; {60159#true} is VALID [2022-04-28 05:59:30,127 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {60159#true} {60383#(< (+ main_~v~0 main_~r~0 1) main_~u~0)} #96#return; {60383#(< (+ main_~v~0 main_~r~0 1) main_~u~0)} is VALID [2022-04-28 05:59:30,127 INFO L290 TraceCheckUtils]: 80: Hoare triple {60383#(< (+ main_~v~0 main_~r~0 1) main_~u~0)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {60408#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} is VALID [2022-04-28 05:59:30,127 INFO L290 TraceCheckUtils]: 81: Hoare triple {60408#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {60408#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} is VALID [2022-04-28 05:59:30,128 INFO L290 TraceCheckUtils]: 82: Hoare triple {60408#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} assume !!(#t~post7 < 20);havoc #t~post7; {60408#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} is VALID [2022-04-28 05:59:30,128 INFO L272 TraceCheckUtils]: 83: Hoare triple {60408#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {60159#true} is VALID [2022-04-28 05:59:30,128 INFO L290 TraceCheckUtils]: 84: Hoare triple {60159#true} ~cond := #in~cond; {60159#true} is VALID [2022-04-28 05:59:30,128 INFO L290 TraceCheckUtils]: 85: Hoare triple {60159#true} assume !(0 == ~cond); {60159#true} is VALID [2022-04-28 05:59:30,128 INFO L290 TraceCheckUtils]: 86: Hoare triple {60159#true} assume true; {60159#true} is VALID [2022-04-28 05:59:30,128 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {60159#true} {60408#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} #96#return; {60408#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} is VALID [2022-04-28 05:59:30,129 INFO L290 TraceCheckUtils]: 88: Hoare triple {60408#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} assume !(~r~0 > 0); {60408#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} is VALID [2022-04-28 05:59:30,129 INFO L290 TraceCheckUtils]: 89: Hoare triple {60408#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {60408#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} is VALID [2022-04-28 05:59:30,129 INFO L290 TraceCheckUtils]: 90: Hoare triple {60408#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} assume !!(#t~post8 < 20);havoc #t~post8; {60408#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} is VALID [2022-04-28 05:59:30,129 INFO L272 TraceCheckUtils]: 91: Hoare triple {60408#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {60159#true} is VALID [2022-04-28 05:59:30,129 INFO L290 TraceCheckUtils]: 92: Hoare triple {60159#true} ~cond := #in~cond; {60159#true} is VALID [2022-04-28 05:59:30,129 INFO L290 TraceCheckUtils]: 93: Hoare triple {60159#true} assume !(0 == ~cond); {60159#true} is VALID [2022-04-28 05:59:30,129 INFO L290 TraceCheckUtils]: 94: Hoare triple {60159#true} assume true; {60159#true} is VALID [2022-04-28 05:59:30,130 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {60159#true} {60408#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} #98#return; {60408#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} is VALID [2022-04-28 05:59:30,131 INFO L290 TraceCheckUtils]: 96: Hoare triple {60408#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {60457#(< 0 (div (+ (- 2) main_~r~0) 2))} is VALID [2022-04-28 05:59:30,132 INFO L290 TraceCheckUtils]: 97: Hoare triple {60457#(< 0 (div (+ (- 2) main_~r~0) 2))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {60457#(< 0 (div (+ (- 2) main_~r~0) 2))} is VALID [2022-04-28 05:59:30,132 INFO L290 TraceCheckUtils]: 98: Hoare triple {60457#(< 0 (div (+ (- 2) main_~r~0) 2))} assume !!(#t~post8 < 20);havoc #t~post8; {60457#(< 0 (div (+ (- 2) main_~r~0) 2))} is VALID [2022-04-28 05:59:30,132 INFO L272 TraceCheckUtils]: 99: Hoare triple {60457#(< 0 (div (+ (- 2) main_~r~0) 2))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {60159#true} is VALID [2022-04-28 05:59:30,132 INFO L290 TraceCheckUtils]: 100: Hoare triple {60159#true} ~cond := #in~cond; {60159#true} is VALID [2022-04-28 05:59:30,132 INFO L290 TraceCheckUtils]: 101: Hoare triple {60159#true} assume !(0 == ~cond); {60159#true} is VALID [2022-04-28 05:59:30,132 INFO L290 TraceCheckUtils]: 102: Hoare triple {60159#true} assume true; {60159#true} is VALID [2022-04-28 05:59:30,133 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {60159#true} {60457#(< 0 (div (+ (- 2) main_~r~0) 2))} #98#return; {60457#(< 0 (div (+ (- 2) main_~r~0) 2))} is VALID [2022-04-28 05:59:30,133 INFO L290 TraceCheckUtils]: 104: Hoare triple {60457#(< 0 (div (+ (- 2) main_~r~0) 2))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {60160#false} is VALID [2022-04-28 05:59:30,133 INFO L290 TraceCheckUtils]: 105: Hoare triple {60160#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {60160#false} is VALID [2022-04-28 05:59:30,133 INFO L290 TraceCheckUtils]: 106: Hoare triple {60160#false} assume !(#t~post8 < 20);havoc #t~post8; {60160#false} is VALID [2022-04-28 05:59:30,133 INFO L290 TraceCheckUtils]: 107: Hoare triple {60160#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {60160#false} is VALID [2022-04-28 05:59:30,133 INFO L290 TraceCheckUtils]: 108: Hoare triple {60160#false} assume !(#t~post6 < 20);havoc #t~post6; {60160#false} is VALID [2022-04-28 05:59:30,134 INFO L272 TraceCheckUtils]: 109: Hoare triple {60160#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {60160#false} is VALID [2022-04-28 05:59:30,134 INFO L290 TraceCheckUtils]: 110: Hoare triple {60160#false} ~cond := #in~cond; {60160#false} is VALID [2022-04-28 05:59:30,134 INFO L290 TraceCheckUtils]: 111: Hoare triple {60160#false} assume 0 == ~cond; {60160#false} is VALID [2022-04-28 05:59:30,134 INFO L290 TraceCheckUtils]: 112: Hoare triple {60160#false} assume !false; {60160#false} is VALID [2022-04-28 05:59:30,134 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 46 proven. 56 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2022-04-28 05:59:30,134 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:59:30,663 INFO L290 TraceCheckUtils]: 112: Hoare triple {60160#false} assume !false; {60160#false} is VALID [2022-04-28 05:59:30,664 INFO L290 TraceCheckUtils]: 111: Hoare triple {60160#false} assume 0 == ~cond; {60160#false} is VALID [2022-04-28 05:59:30,664 INFO L290 TraceCheckUtils]: 110: Hoare triple {60160#false} ~cond := #in~cond; {60160#false} is VALID [2022-04-28 05:59:30,664 INFO L272 TraceCheckUtils]: 109: Hoare triple {60160#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {60160#false} is VALID [2022-04-28 05:59:30,664 INFO L290 TraceCheckUtils]: 108: Hoare triple {60160#false} assume !(#t~post6 < 20);havoc #t~post6; {60160#false} is VALID [2022-04-28 05:59:30,664 INFO L290 TraceCheckUtils]: 107: Hoare triple {60160#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {60160#false} is VALID [2022-04-28 05:59:30,664 INFO L290 TraceCheckUtils]: 106: Hoare triple {60160#false} assume !(#t~post8 < 20);havoc #t~post8; {60160#false} is VALID [2022-04-28 05:59:30,664 INFO L290 TraceCheckUtils]: 105: Hoare triple {60160#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {60160#false} is VALID [2022-04-28 05:59:30,664 INFO L290 TraceCheckUtils]: 104: Hoare triple {60530#(not (< main_~r~0 0))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {60160#false} is VALID [2022-04-28 05:59:30,665 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {60159#true} {60530#(not (< main_~r~0 0))} #98#return; {60530#(not (< main_~r~0 0))} is VALID [2022-04-28 05:59:30,665 INFO L290 TraceCheckUtils]: 102: Hoare triple {60159#true} assume true; {60159#true} is VALID [2022-04-28 05:59:30,665 INFO L290 TraceCheckUtils]: 101: Hoare triple {60159#true} assume !(0 == ~cond); {60159#true} is VALID [2022-04-28 05:59:30,665 INFO L290 TraceCheckUtils]: 100: Hoare triple {60159#true} ~cond := #in~cond; {60159#true} is VALID [2022-04-28 05:59:30,665 INFO L272 TraceCheckUtils]: 99: Hoare triple {60530#(not (< main_~r~0 0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {60159#true} is VALID [2022-04-28 05:59:30,665 INFO L290 TraceCheckUtils]: 98: Hoare triple {60530#(not (< main_~r~0 0))} assume !!(#t~post8 < 20);havoc #t~post8; {60530#(not (< main_~r~0 0))} is VALID [2022-04-28 05:59:30,665 INFO L290 TraceCheckUtils]: 97: Hoare triple {60530#(not (< main_~r~0 0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {60530#(not (< main_~r~0 0))} is VALID [2022-04-28 05:59:30,666 INFO L290 TraceCheckUtils]: 96: Hoare triple {60555#(<= 0 (+ main_~u~0 main_~r~0))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {60530#(not (< main_~r~0 0))} is VALID [2022-04-28 05:59:30,666 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {60159#true} {60555#(<= 0 (+ main_~u~0 main_~r~0))} #98#return; {60555#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-28 05:59:30,666 INFO L290 TraceCheckUtils]: 94: Hoare triple {60159#true} assume true; {60159#true} is VALID [2022-04-28 05:59:30,667 INFO L290 TraceCheckUtils]: 93: Hoare triple {60159#true} assume !(0 == ~cond); {60159#true} is VALID [2022-04-28 05:59:30,667 INFO L290 TraceCheckUtils]: 92: Hoare triple {60159#true} ~cond := #in~cond; {60159#true} is VALID [2022-04-28 05:59:30,667 INFO L272 TraceCheckUtils]: 91: Hoare triple {60555#(<= 0 (+ main_~u~0 main_~r~0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {60159#true} is VALID [2022-04-28 05:59:30,667 INFO L290 TraceCheckUtils]: 90: Hoare triple {60555#(<= 0 (+ main_~u~0 main_~r~0))} assume !!(#t~post8 < 20);havoc #t~post8; {60555#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-28 05:59:30,667 INFO L290 TraceCheckUtils]: 89: Hoare triple {60555#(<= 0 (+ main_~u~0 main_~r~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {60555#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-28 05:59:30,667 INFO L290 TraceCheckUtils]: 88: Hoare triple {60555#(<= 0 (+ main_~u~0 main_~r~0))} assume !(~r~0 > 0); {60555#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-28 05:59:30,668 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {60159#true} {60555#(<= 0 (+ main_~u~0 main_~r~0))} #96#return; {60555#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-28 05:59:30,668 INFO L290 TraceCheckUtils]: 86: Hoare triple {60159#true} assume true; {60159#true} is VALID [2022-04-28 05:59:30,668 INFO L290 TraceCheckUtils]: 85: Hoare triple {60159#true} assume !(0 == ~cond); {60159#true} is VALID [2022-04-28 05:59:30,668 INFO L290 TraceCheckUtils]: 84: Hoare triple {60159#true} ~cond := #in~cond; {60159#true} is VALID [2022-04-28 05:59:30,668 INFO L272 TraceCheckUtils]: 83: Hoare triple {60555#(<= 0 (+ main_~u~0 main_~r~0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {60159#true} is VALID [2022-04-28 05:59:30,668 INFO L290 TraceCheckUtils]: 82: Hoare triple {60555#(<= 0 (+ main_~u~0 main_~r~0))} assume !!(#t~post7 < 20);havoc #t~post7; {60555#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-28 05:59:30,669 INFO L290 TraceCheckUtils]: 81: Hoare triple {60555#(<= 0 (+ main_~u~0 main_~r~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {60555#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-28 05:59:30,669 INFO L290 TraceCheckUtils]: 80: Hoare triple {60604#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {60555#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-28 05:59:30,670 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {60159#true} {60604#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} #96#return; {60604#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} is VALID [2022-04-28 05:59:30,670 INFO L290 TraceCheckUtils]: 78: Hoare triple {60159#true} assume true; {60159#true} is VALID [2022-04-28 05:59:30,670 INFO L290 TraceCheckUtils]: 77: Hoare triple {60159#true} assume !(0 == ~cond); {60159#true} is VALID [2022-04-28 05:59:30,670 INFO L290 TraceCheckUtils]: 76: Hoare triple {60159#true} ~cond := #in~cond; {60159#true} is VALID [2022-04-28 05:59:30,670 INFO L272 TraceCheckUtils]: 75: Hoare triple {60604#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {60159#true} is VALID [2022-04-28 05:59:30,670 INFO L290 TraceCheckUtils]: 74: Hoare triple {60604#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} assume !!(#t~post7 < 20);havoc #t~post7; {60604#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} is VALID [2022-04-28 05:59:30,670 INFO L290 TraceCheckUtils]: 73: Hoare triple {60604#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {60604#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} is VALID [2022-04-28 05:59:30,672 INFO L290 TraceCheckUtils]: 72: Hoare triple {60629#(<= main_~r~0 main_~u~0)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {60604#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} is VALID [2022-04-28 05:59:30,672 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {60159#true} {60629#(<= main_~r~0 main_~u~0)} #96#return; {60629#(<= main_~r~0 main_~u~0)} is VALID [2022-04-28 05:59:30,672 INFO L290 TraceCheckUtils]: 70: Hoare triple {60159#true} assume true; {60159#true} is VALID [2022-04-28 05:59:30,672 INFO L290 TraceCheckUtils]: 69: Hoare triple {60159#true} assume !(0 == ~cond); {60159#true} is VALID [2022-04-28 05:59:30,672 INFO L290 TraceCheckUtils]: 68: Hoare triple {60159#true} ~cond := #in~cond; {60159#true} is VALID [2022-04-28 05:59:30,672 INFO L272 TraceCheckUtils]: 67: Hoare triple {60629#(<= main_~r~0 main_~u~0)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {60159#true} is VALID [2022-04-28 05:59:30,673 INFO L290 TraceCheckUtils]: 66: Hoare triple {60629#(<= main_~r~0 main_~u~0)} assume !!(#t~post7 < 20);havoc #t~post7; {60629#(<= main_~r~0 main_~u~0)} is VALID [2022-04-28 05:59:30,673 INFO L290 TraceCheckUtils]: 65: Hoare triple {60629#(<= main_~r~0 main_~u~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {60629#(<= main_~r~0 main_~u~0)} is VALID [2022-04-28 05:59:30,673 INFO L290 TraceCheckUtils]: 64: Hoare triple {60654#(<= main_~r~0 (+ main_~v~0 main_~u~0))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {60629#(<= main_~r~0 main_~u~0)} is VALID [2022-04-28 05:59:30,674 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {60159#true} {60654#(<= main_~r~0 (+ main_~v~0 main_~u~0))} #96#return; {60654#(<= main_~r~0 (+ main_~v~0 main_~u~0))} is VALID [2022-04-28 05:59:30,674 INFO L290 TraceCheckUtils]: 62: Hoare triple {60159#true} assume true; {60159#true} is VALID [2022-04-28 05:59:30,674 INFO L290 TraceCheckUtils]: 61: Hoare triple {60159#true} assume !(0 == ~cond); {60159#true} is VALID [2022-04-28 05:59:30,674 INFO L290 TraceCheckUtils]: 60: Hoare triple {60159#true} ~cond := #in~cond; {60159#true} is VALID [2022-04-28 05:59:30,674 INFO L272 TraceCheckUtils]: 59: Hoare triple {60654#(<= main_~r~0 (+ main_~v~0 main_~u~0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {60159#true} is VALID [2022-04-28 05:59:30,674 INFO L290 TraceCheckUtils]: 58: Hoare triple {60654#(<= main_~r~0 (+ main_~v~0 main_~u~0))} assume !!(#t~post7 < 20);havoc #t~post7; {60654#(<= main_~r~0 (+ main_~v~0 main_~u~0))} is VALID [2022-04-28 05:59:30,675 INFO L290 TraceCheckUtils]: 57: Hoare triple {60654#(<= main_~r~0 (+ main_~v~0 main_~u~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {60654#(<= main_~r~0 (+ main_~v~0 main_~u~0))} is VALID [2022-04-28 05:59:30,675 INFO L290 TraceCheckUtils]: 56: Hoare triple {60654#(<= main_~r~0 (+ main_~v~0 main_~u~0))} assume !!(0 != ~r~0); {60654#(<= main_~r~0 (+ main_~v~0 main_~u~0))} is VALID [2022-04-28 05:59:30,675 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {60159#true} {60654#(<= main_~r~0 (+ main_~v~0 main_~u~0))} #94#return; {60654#(<= main_~r~0 (+ main_~v~0 main_~u~0))} is VALID [2022-04-28 05:59:30,676 INFO L290 TraceCheckUtils]: 54: Hoare triple {60159#true} assume true; {60159#true} is VALID [2022-04-28 05:59:30,676 INFO L290 TraceCheckUtils]: 53: Hoare triple {60159#true} assume !(0 == ~cond); {60159#true} is VALID [2022-04-28 05:59:30,676 INFO L290 TraceCheckUtils]: 52: Hoare triple {60159#true} ~cond := #in~cond; {60159#true} is VALID [2022-04-28 05:59:30,676 INFO L272 TraceCheckUtils]: 51: Hoare triple {60654#(<= main_~r~0 (+ main_~v~0 main_~u~0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {60159#true} is VALID [2022-04-28 05:59:30,676 INFO L290 TraceCheckUtils]: 50: Hoare triple {60654#(<= main_~r~0 (+ main_~v~0 main_~u~0))} assume !!(#t~post6 < 20);havoc #t~post6; {60654#(<= main_~r~0 (+ main_~v~0 main_~u~0))} is VALID [2022-04-28 05:59:30,676 INFO L290 TraceCheckUtils]: 49: Hoare triple {60654#(<= main_~r~0 (+ main_~v~0 main_~u~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {60654#(<= main_~r~0 (+ main_~v~0 main_~u~0))} is VALID [2022-04-28 05:59:30,677 INFO L290 TraceCheckUtils]: 48: Hoare triple {60654#(<= main_~r~0 (+ main_~v~0 main_~u~0))} assume !(~r~0 < 0); {60654#(<= main_~r~0 (+ main_~v~0 main_~u~0))} is VALID [2022-04-28 05:59:30,677 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {60159#true} {60654#(<= main_~r~0 (+ main_~v~0 main_~u~0))} #98#return; {60654#(<= main_~r~0 (+ main_~v~0 main_~u~0))} is VALID [2022-04-28 05:59:30,677 INFO L290 TraceCheckUtils]: 46: Hoare triple {60159#true} assume true; {60159#true} is VALID [2022-04-28 05:59:30,677 INFO L290 TraceCheckUtils]: 45: Hoare triple {60159#true} assume !(0 == ~cond); {60159#true} is VALID [2022-04-28 05:59:30,677 INFO L290 TraceCheckUtils]: 44: Hoare triple {60159#true} ~cond := #in~cond; {60159#true} is VALID [2022-04-28 05:59:30,677 INFO L272 TraceCheckUtils]: 43: Hoare triple {60654#(<= main_~r~0 (+ main_~v~0 main_~u~0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {60159#true} is VALID [2022-04-28 05:59:30,677 INFO L290 TraceCheckUtils]: 42: Hoare triple {60654#(<= main_~r~0 (+ main_~v~0 main_~u~0))} assume !!(#t~post8 < 20);havoc #t~post8; {60654#(<= main_~r~0 (+ main_~v~0 main_~u~0))} is VALID [2022-04-28 05:59:30,678 INFO L290 TraceCheckUtils]: 41: Hoare triple {60654#(<= main_~r~0 (+ main_~v~0 main_~u~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {60654#(<= main_~r~0 (+ main_~v~0 main_~u~0))} is VALID [2022-04-28 05:59:30,678 INFO L290 TraceCheckUtils]: 40: Hoare triple {60727#(<= 0 (+ main_~v~0 3))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {60654#(<= main_~r~0 (+ main_~v~0 main_~u~0))} is VALID [2022-04-28 05:59:30,679 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {60159#true} {60727#(<= 0 (+ main_~v~0 3))} #98#return; {60727#(<= 0 (+ main_~v~0 3))} is VALID [2022-04-28 05:59:30,679 INFO L290 TraceCheckUtils]: 38: Hoare triple {60159#true} assume true; {60159#true} is VALID [2022-04-28 05:59:30,679 INFO L290 TraceCheckUtils]: 37: Hoare triple {60159#true} assume !(0 == ~cond); {60159#true} is VALID [2022-04-28 05:59:30,679 INFO L290 TraceCheckUtils]: 36: Hoare triple {60159#true} ~cond := #in~cond; {60159#true} is VALID [2022-04-28 05:59:30,679 INFO L272 TraceCheckUtils]: 35: Hoare triple {60727#(<= 0 (+ main_~v~0 3))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {60159#true} is VALID [2022-04-28 05:59:30,679 INFO L290 TraceCheckUtils]: 34: Hoare triple {60727#(<= 0 (+ main_~v~0 3))} assume !!(#t~post8 < 20);havoc #t~post8; {60727#(<= 0 (+ main_~v~0 3))} is VALID [2022-04-28 05:59:30,680 INFO L290 TraceCheckUtils]: 33: Hoare triple {60727#(<= 0 (+ main_~v~0 3))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {60727#(<= 0 (+ main_~v~0 3))} is VALID [2022-04-28 05:59:30,680 INFO L290 TraceCheckUtils]: 32: Hoare triple {60727#(<= 0 (+ main_~v~0 3))} assume !(~r~0 > 0); {60727#(<= 0 (+ main_~v~0 3))} is VALID [2022-04-28 05:59:30,680 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {60159#true} {60727#(<= 0 (+ main_~v~0 3))} #96#return; {60727#(<= 0 (+ main_~v~0 3))} is VALID [2022-04-28 05:59:30,680 INFO L290 TraceCheckUtils]: 30: Hoare triple {60159#true} assume true; {60159#true} is VALID [2022-04-28 05:59:30,680 INFO L290 TraceCheckUtils]: 29: Hoare triple {60159#true} assume !(0 == ~cond); {60159#true} is VALID [2022-04-28 05:59:30,680 INFO L290 TraceCheckUtils]: 28: Hoare triple {60159#true} ~cond := #in~cond; {60159#true} is VALID [2022-04-28 05:59:30,681 INFO L272 TraceCheckUtils]: 27: Hoare triple {60727#(<= 0 (+ main_~v~0 3))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {60159#true} is VALID [2022-04-28 05:59:30,681 INFO L290 TraceCheckUtils]: 26: Hoare triple {60727#(<= 0 (+ main_~v~0 3))} assume !!(#t~post7 < 20);havoc #t~post7; {60727#(<= 0 (+ main_~v~0 3))} is VALID [2022-04-28 05:59:30,681 INFO L290 TraceCheckUtils]: 25: Hoare triple {60727#(<= 0 (+ main_~v~0 3))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {60727#(<= 0 (+ main_~v~0 3))} is VALID [2022-04-28 05:59:30,681 INFO L290 TraceCheckUtils]: 24: Hoare triple {60727#(<= 0 (+ main_~v~0 3))} assume !!(0 != ~r~0); {60727#(<= 0 (+ main_~v~0 3))} is VALID [2022-04-28 05:59:30,682 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {60159#true} {60727#(<= 0 (+ main_~v~0 3))} #94#return; {60727#(<= 0 (+ main_~v~0 3))} is VALID [2022-04-28 05:59:30,682 INFO L290 TraceCheckUtils]: 22: Hoare triple {60159#true} assume true; {60159#true} is VALID [2022-04-28 05:59:30,682 INFO L290 TraceCheckUtils]: 21: Hoare triple {60159#true} assume !(0 == ~cond); {60159#true} is VALID [2022-04-28 05:59:30,682 INFO L290 TraceCheckUtils]: 20: Hoare triple {60159#true} ~cond := #in~cond; {60159#true} is VALID [2022-04-28 05:59:30,682 INFO L272 TraceCheckUtils]: 19: Hoare triple {60727#(<= 0 (+ main_~v~0 3))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {60159#true} is VALID [2022-04-28 05:59:30,682 INFO L290 TraceCheckUtils]: 18: Hoare triple {60727#(<= 0 (+ main_~v~0 3))} assume !!(#t~post6 < 20);havoc #t~post6; {60727#(<= 0 (+ main_~v~0 3))} is VALID [2022-04-28 05:59:30,683 INFO L290 TraceCheckUtils]: 17: Hoare triple {60727#(<= 0 (+ main_~v~0 3))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {60727#(<= 0 (+ main_~v~0 3))} is VALID [2022-04-28 05:59:30,683 INFO L290 TraceCheckUtils]: 16: Hoare triple {60159#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {60727#(<= 0 (+ main_~v~0 3))} is VALID [2022-04-28 05:59:30,683 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {60159#true} {60159#true} #92#return; {60159#true} is VALID [2022-04-28 05:59:30,683 INFO L290 TraceCheckUtils]: 14: Hoare triple {60159#true} assume true; {60159#true} is VALID [2022-04-28 05:59:30,683 INFO L290 TraceCheckUtils]: 13: Hoare triple {60159#true} assume !(0 == ~cond); {60159#true} is VALID [2022-04-28 05:59:30,683 INFO L290 TraceCheckUtils]: 12: Hoare triple {60159#true} ~cond := #in~cond; {60159#true} is VALID [2022-04-28 05:59:30,683 INFO L272 TraceCheckUtils]: 11: Hoare triple {60159#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {60159#true} is VALID [2022-04-28 05:59:30,683 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {60159#true} {60159#true} #90#return; {60159#true} is VALID [2022-04-28 05:59:30,683 INFO L290 TraceCheckUtils]: 9: Hoare triple {60159#true} assume true; {60159#true} is VALID [2022-04-28 05:59:30,683 INFO L290 TraceCheckUtils]: 8: Hoare triple {60159#true} assume !(0 == ~cond); {60159#true} is VALID [2022-04-28 05:59:30,683 INFO L290 TraceCheckUtils]: 7: Hoare triple {60159#true} ~cond := #in~cond; {60159#true} is VALID [2022-04-28 05:59:30,684 INFO L272 TraceCheckUtils]: 6: Hoare triple {60159#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {60159#true} is VALID [2022-04-28 05:59:30,684 INFO L290 TraceCheckUtils]: 5: Hoare triple {60159#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {60159#true} is VALID [2022-04-28 05:59:30,684 INFO L272 TraceCheckUtils]: 4: Hoare triple {60159#true} call #t~ret9 := main(); {60159#true} is VALID [2022-04-28 05:59:30,684 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {60159#true} {60159#true} #102#return; {60159#true} is VALID [2022-04-28 05:59:30,684 INFO L290 TraceCheckUtils]: 2: Hoare triple {60159#true} assume true; {60159#true} is VALID [2022-04-28 05:59:30,684 INFO L290 TraceCheckUtils]: 1: Hoare triple {60159#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {60159#true} is VALID [2022-04-28 05:59:30,684 INFO L272 TraceCheckUtils]: 0: Hoare triple {60159#true} call ULTIMATE.init(); {60159#true} is VALID [2022-04-28 05:59:30,684 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 34 proven. 68 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2022-04-28 05:59:30,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:59:30,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945924614] [2022-04-28 05:59:30,684 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:59:30,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [67375478] [2022-04-28 05:59:30,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [67375478] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:59:30,685 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:59:30,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-28 05:59:30,685 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:59:30,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1452545083] [2022-04-28 05:59:30,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1452545083] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:59:30,685 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:59:30,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 05:59:30,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841478532] [2022-04-28 05:59:30,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:59:30,685 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 8 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) Word has length 113 [2022-04-28 05:59:30,685 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:59:30,686 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 8 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2022-04-28 05:59:30,756 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:59:30,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 05:59:30,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:59:30,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 05:59:30,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-04-28 05:59:30,756 INFO L87 Difference]: Start difference. First operand 560 states and 768 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 8 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2022-04-28 05:59:34,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:59:34,005 INFO L93 Difference]: Finished difference Result 862 states and 1224 transitions. [2022-04-28 05:59:34,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 05:59:34,005 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 8 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) Word has length 113 [2022-04-28 05:59:34,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:59:34,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 8 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2022-04-28 05:59:34,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 190 transitions. [2022-04-28 05:59:34,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 8 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2022-04-28 05:59:34,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 190 transitions. [2022-04-28 05:59:34,008 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 190 transitions. [2022-04-28 05:59:34,178 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 190 edges. 190 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:59:34,199 INFO L225 Difference]: With dead ends: 862 [2022-04-28 05:59:34,199 INFO L226 Difference]: Without dead ends: 711 [2022-04-28 05:59:34,199 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2022-04-28 05:59:34,200 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 73 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 05:59:34,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 340 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 05:59:34,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2022-04-28 05:59:35,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 560. [2022-04-28 05:59:35,755 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:59:35,756 INFO L82 GeneralOperation]: Start isEquivalent. First operand 711 states. Second operand has 560 states, 418 states have (on average 1.2344497607655502) internal successors, (516), 428 states have internal predecessors, (516), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 115 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-28 05:59:35,757 INFO L74 IsIncluded]: Start isIncluded. First operand 711 states. Second operand has 560 states, 418 states have (on average 1.2344497607655502) internal successors, (516), 428 states have internal predecessors, (516), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 115 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-28 05:59:35,757 INFO L87 Difference]: Start difference. First operand 711 states. Second operand has 560 states, 418 states have (on average 1.2344497607655502) internal successors, (516), 428 states have internal predecessors, (516), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 115 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-28 05:59:35,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:59:35,785 INFO L93 Difference]: Finished difference Result 711 states and 989 transitions. [2022-04-28 05:59:35,785 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 989 transitions. [2022-04-28 05:59:35,786 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:59:35,786 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:59:35,787 INFO L74 IsIncluded]: Start isIncluded. First operand has 560 states, 418 states have (on average 1.2344497607655502) internal successors, (516), 428 states have internal predecessors, (516), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 115 states have call predecessors, (125), 125 states have call successors, (125) Second operand 711 states. [2022-04-28 05:59:35,787 INFO L87 Difference]: Start difference. First operand has 560 states, 418 states have (on average 1.2344497607655502) internal successors, (516), 428 states have internal predecessors, (516), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 115 states have call predecessors, (125), 125 states have call successors, (125) Second operand 711 states. [2022-04-28 05:59:35,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:59:35,821 INFO L93 Difference]: Finished difference Result 711 states and 989 transitions. [2022-04-28 05:59:35,821 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 989 transitions. [2022-04-28 05:59:35,823 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:59:35,823 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:59:35,823 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:59:35,823 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:59:35,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 418 states have (on average 1.2344497607655502) internal successors, (516), 428 states have internal predecessors, (516), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 115 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-28 05:59:35,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 768 transitions. [2022-04-28 05:59:35,846 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 768 transitions. Word has length 113 [2022-04-28 05:59:35,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:59:35,847 INFO L495 AbstractCegarLoop]: Abstraction has 560 states and 768 transitions. [2022-04-28 05:59:35,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 8 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2022-04-28 05:59:35,847 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 560 states and 768 transitions. [2022-04-28 05:59:39,454 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 768 edges. 767 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 05:59:39,455 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 768 transitions. [2022-04-28 05:59:39,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-04-28 05:59:39,456 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:59:39,456 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:59:39,475 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-04-28 05:59:39,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:59:39,667 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:59:39,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:59:39,668 INFO L85 PathProgramCache]: Analyzing trace with hash -144297019, now seen corresponding path program 15 times [2022-04-28 05:59:39,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:59:39,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [687801788] [2022-04-28 05:59:39,668 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:59:39,668 INFO L85 PathProgramCache]: Analyzing trace with hash -144297019, now seen corresponding path program 16 times [2022-04-28 05:59:39,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:59:39,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157425460] [2022-04-28 05:59:39,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:59:39,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:59:39,683 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:59:39,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [829259090] [2022-04-28 05:59:39,683 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 05:59:39,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:59:39,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:59:39,684 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:59:39,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-04-28 05:59:40,065 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 05:59:40,065 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:59:40,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-28 05:59:40,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:59:40,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:59:40,634 INFO L272 TraceCheckUtils]: 0: Hoare triple {65126#true} call ULTIMATE.init(); {65126#true} is VALID [2022-04-28 05:59:40,635 INFO L290 TraceCheckUtils]: 1: Hoare triple {65126#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {65134#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:40,635 INFO L290 TraceCheckUtils]: 2: Hoare triple {65134#(<= ~counter~0 0)} assume true; {65134#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:40,636 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {65134#(<= ~counter~0 0)} {65126#true} #102#return; {65134#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:40,636 INFO L272 TraceCheckUtils]: 4: Hoare triple {65134#(<= ~counter~0 0)} call #t~ret9 := main(); {65134#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:40,636 INFO L290 TraceCheckUtils]: 5: Hoare triple {65134#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {65134#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:40,637 INFO L272 TraceCheckUtils]: 6: Hoare triple {65134#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {65134#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:40,637 INFO L290 TraceCheckUtils]: 7: Hoare triple {65134#(<= ~counter~0 0)} ~cond := #in~cond; {65134#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:40,637 INFO L290 TraceCheckUtils]: 8: Hoare triple {65134#(<= ~counter~0 0)} assume !(0 == ~cond); {65134#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:40,637 INFO L290 TraceCheckUtils]: 9: Hoare triple {65134#(<= ~counter~0 0)} assume true; {65134#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:40,638 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {65134#(<= ~counter~0 0)} {65134#(<= ~counter~0 0)} #90#return; {65134#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:40,638 INFO L272 TraceCheckUtils]: 11: Hoare triple {65134#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {65134#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:40,638 INFO L290 TraceCheckUtils]: 12: Hoare triple {65134#(<= ~counter~0 0)} ~cond := #in~cond; {65134#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:40,639 INFO L290 TraceCheckUtils]: 13: Hoare triple {65134#(<= ~counter~0 0)} assume !(0 == ~cond); {65134#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:40,639 INFO L290 TraceCheckUtils]: 14: Hoare triple {65134#(<= ~counter~0 0)} assume true; {65134#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:40,639 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {65134#(<= ~counter~0 0)} {65134#(<= ~counter~0 0)} #92#return; {65134#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:40,640 INFO L290 TraceCheckUtils]: 16: Hoare triple {65134#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {65134#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:40,641 INFO L290 TraceCheckUtils]: 17: Hoare triple {65134#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {65183#(<= ~counter~0 1)} is VALID [2022-04-28 05:59:40,641 INFO L290 TraceCheckUtils]: 18: Hoare triple {65183#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {65183#(<= ~counter~0 1)} is VALID [2022-04-28 05:59:40,642 INFO L272 TraceCheckUtils]: 19: Hoare triple {65183#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {65183#(<= ~counter~0 1)} is VALID [2022-04-28 05:59:40,642 INFO L290 TraceCheckUtils]: 20: Hoare triple {65183#(<= ~counter~0 1)} ~cond := #in~cond; {65183#(<= ~counter~0 1)} is VALID [2022-04-28 05:59:40,642 INFO L290 TraceCheckUtils]: 21: Hoare triple {65183#(<= ~counter~0 1)} assume !(0 == ~cond); {65183#(<= ~counter~0 1)} is VALID [2022-04-28 05:59:40,643 INFO L290 TraceCheckUtils]: 22: Hoare triple {65183#(<= ~counter~0 1)} assume true; {65183#(<= ~counter~0 1)} is VALID [2022-04-28 05:59:40,643 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {65183#(<= ~counter~0 1)} {65183#(<= ~counter~0 1)} #94#return; {65183#(<= ~counter~0 1)} is VALID [2022-04-28 05:59:40,643 INFO L290 TraceCheckUtils]: 24: Hoare triple {65183#(<= ~counter~0 1)} assume !!(0 != ~r~0); {65183#(<= ~counter~0 1)} is VALID [2022-04-28 05:59:40,644 INFO L290 TraceCheckUtils]: 25: Hoare triple {65183#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {65208#(<= ~counter~0 2)} is VALID [2022-04-28 05:59:40,644 INFO L290 TraceCheckUtils]: 26: Hoare triple {65208#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {65208#(<= ~counter~0 2)} is VALID [2022-04-28 05:59:40,645 INFO L272 TraceCheckUtils]: 27: Hoare triple {65208#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {65208#(<= ~counter~0 2)} is VALID [2022-04-28 05:59:40,645 INFO L290 TraceCheckUtils]: 28: Hoare triple {65208#(<= ~counter~0 2)} ~cond := #in~cond; {65208#(<= ~counter~0 2)} is VALID [2022-04-28 05:59:40,645 INFO L290 TraceCheckUtils]: 29: Hoare triple {65208#(<= ~counter~0 2)} assume !(0 == ~cond); {65208#(<= ~counter~0 2)} is VALID [2022-04-28 05:59:40,645 INFO L290 TraceCheckUtils]: 30: Hoare triple {65208#(<= ~counter~0 2)} assume true; {65208#(<= ~counter~0 2)} is VALID [2022-04-28 05:59:40,646 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {65208#(<= ~counter~0 2)} {65208#(<= ~counter~0 2)} #96#return; {65208#(<= ~counter~0 2)} is VALID [2022-04-28 05:59:40,646 INFO L290 TraceCheckUtils]: 32: Hoare triple {65208#(<= ~counter~0 2)} assume !(~r~0 > 0); {65208#(<= ~counter~0 2)} is VALID [2022-04-28 05:59:40,647 INFO L290 TraceCheckUtils]: 33: Hoare triple {65208#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {65233#(<= ~counter~0 3)} is VALID [2022-04-28 05:59:40,647 INFO L290 TraceCheckUtils]: 34: Hoare triple {65233#(<= ~counter~0 3)} assume !!(#t~post8 < 20);havoc #t~post8; {65233#(<= ~counter~0 3)} is VALID [2022-04-28 05:59:40,648 INFO L272 TraceCheckUtils]: 35: Hoare triple {65233#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {65233#(<= ~counter~0 3)} is VALID [2022-04-28 05:59:40,648 INFO L290 TraceCheckUtils]: 36: Hoare triple {65233#(<= ~counter~0 3)} ~cond := #in~cond; {65233#(<= ~counter~0 3)} is VALID [2022-04-28 05:59:40,648 INFO L290 TraceCheckUtils]: 37: Hoare triple {65233#(<= ~counter~0 3)} assume !(0 == ~cond); {65233#(<= ~counter~0 3)} is VALID [2022-04-28 05:59:40,648 INFO L290 TraceCheckUtils]: 38: Hoare triple {65233#(<= ~counter~0 3)} assume true; {65233#(<= ~counter~0 3)} is VALID [2022-04-28 05:59:40,649 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {65233#(<= ~counter~0 3)} {65233#(<= ~counter~0 3)} #98#return; {65233#(<= ~counter~0 3)} is VALID [2022-04-28 05:59:40,649 INFO L290 TraceCheckUtils]: 40: Hoare triple {65233#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {65233#(<= ~counter~0 3)} is VALID [2022-04-28 05:59:40,650 INFO L290 TraceCheckUtils]: 41: Hoare triple {65233#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {65258#(<= ~counter~0 4)} is VALID [2022-04-28 05:59:40,650 INFO L290 TraceCheckUtils]: 42: Hoare triple {65258#(<= ~counter~0 4)} assume !!(#t~post8 < 20);havoc #t~post8; {65258#(<= ~counter~0 4)} is VALID [2022-04-28 05:59:40,651 INFO L272 TraceCheckUtils]: 43: Hoare triple {65258#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {65258#(<= ~counter~0 4)} is VALID [2022-04-28 05:59:40,651 INFO L290 TraceCheckUtils]: 44: Hoare triple {65258#(<= ~counter~0 4)} ~cond := #in~cond; {65258#(<= ~counter~0 4)} is VALID [2022-04-28 05:59:40,651 INFO L290 TraceCheckUtils]: 45: Hoare triple {65258#(<= ~counter~0 4)} assume !(0 == ~cond); {65258#(<= ~counter~0 4)} is VALID [2022-04-28 05:59:40,651 INFO L290 TraceCheckUtils]: 46: Hoare triple {65258#(<= ~counter~0 4)} assume true; {65258#(<= ~counter~0 4)} is VALID [2022-04-28 05:59:40,652 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {65258#(<= ~counter~0 4)} {65258#(<= ~counter~0 4)} #98#return; {65258#(<= ~counter~0 4)} is VALID [2022-04-28 05:59:40,652 INFO L290 TraceCheckUtils]: 48: Hoare triple {65258#(<= ~counter~0 4)} assume !(~r~0 < 0); {65258#(<= ~counter~0 4)} is VALID [2022-04-28 05:59:40,653 INFO L290 TraceCheckUtils]: 49: Hoare triple {65258#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {65283#(<= ~counter~0 5)} is VALID [2022-04-28 05:59:40,653 INFO L290 TraceCheckUtils]: 50: Hoare triple {65283#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {65283#(<= ~counter~0 5)} is VALID [2022-04-28 05:59:40,654 INFO L272 TraceCheckUtils]: 51: Hoare triple {65283#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {65283#(<= ~counter~0 5)} is VALID [2022-04-28 05:59:40,654 INFO L290 TraceCheckUtils]: 52: Hoare triple {65283#(<= ~counter~0 5)} ~cond := #in~cond; {65283#(<= ~counter~0 5)} is VALID [2022-04-28 05:59:40,654 INFO L290 TraceCheckUtils]: 53: Hoare triple {65283#(<= ~counter~0 5)} assume !(0 == ~cond); {65283#(<= ~counter~0 5)} is VALID [2022-04-28 05:59:40,654 INFO L290 TraceCheckUtils]: 54: Hoare triple {65283#(<= ~counter~0 5)} assume true; {65283#(<= ~counter~0 5)} is VALID [2022-04-28 05:59:40,655 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {65283#(<= ~counter~0 5)} {65283#(<= ~counter~0 5)} #94#return; {65283#(<= ~counter~0 5)} is VALID [2022-04-28 05:59:40,655 INFO L290 TraceCheckUtils]: 56: Hoare triple {65283#(<= ~counter~0 5)} assume !!(0 != ~r~0); {65283#(<= ~counter~0 5)} is VALID [2022-04-28 05:59:40,656 INFO L290 TraceCheckUtils]: 57: Hoare triple {65283#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {65308#(<= ~counter~0 6)} is VALID [2022-04-28 05:59:40,656 INFO L290 TraceCheckUtils]: 58: Hoare triple {65308#(<= ~counter~0 6)} assume !!(#t~post7 < 20);havoc #t~post7; {65308#(<= ~counter~0 6)} is VALID [2022-04-28 05:59:40,657 INFO L272 TraceCheckUtils]: 59: Hoare triple {65308#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {65308#(<= ~counter~0 6)} is VALID [2022-04-28 05:59:40,657 INFO L290 TraceCheckUtils]: 60: Hoare triple {65308#(<= ~counter~0 6)} ~cond := #in~cond; {65308#(<= ~counter~0 6)} is VALID [2022-04-28 05:59:40,657 INFO L290 TraceCheckUtils]: 61: Hoare triple {65308#(<= ~counter~0 6)} assume !(0 == ~cond); {65308#(<= ~counter~0 6)} is VALID [2022-04-28 05:59:40,657 INFO L290 TraceCheckUtils]: 62: Hoare triple {65308#(<= ~counter~0 6)} assume true; {65308#(<= ~counter~0 6)} is VALID [2022-04-28 05:59:40,658 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {65308#(<= ~counter~0 6)} {65308#(<= ~counter~0 6)} #96#return; {65308#(<= ~counter~0 6)} is VALID [2022-04-28 05:59:40,658 INFO L290 TraceCheckUtils]: 64: Hoare triple {65308#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {65308#(<= ~counter~0 6)} is VALID [2022-04-28 05:59:40,659 INFO L290 TraceCheckUtils]: 65: Hoare triple {65308#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {65333#(<= ~counter~0 7)} is VALID [2022-04-28 05:59:40,659 INFO L290 TraceCheckUtils]: 66: Hoare triple {65333#(<= ~counter~0 7)} assume !!(#t~post7 < 20);havoc #t~post7; {65333#(<= ~counter~0 7)} is VALID [2022-04-28 05:59:40,659 INFO L272 TraceCheckUtils]: 67: Hoare triple {65333#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {65333#(<= ~counter~0 7)} is VALID [2022-04-28 05:59:40,660 INFO L290 TraceCheckUtils]: 68: Hoare triple {65333#(<= ~counter~0 7)} ~cond := #in~cond; {65333#(<= ~counter~0 7)} is VALID [2022-04-28 05:59:40,660 INFO L290 TraceCheckUtils]: 69: Hoare triple {65333#(<= ~counter~0 7)} assume !(0 == ~cond); {65333#(<= ~counter~0 7)} is VALID [2022-04-28 05:59:40,660 INFO L290 TraceCheckUtils]: 70: Hoare triple {65333#(<= ~counter~0 7)} assume true; {65333#(<= ~counter~0 7)} is VALID [2022-04-28 05:59:40,661 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {65333#(<= ~counter~0 7)} {65333#(<= ~counter~0 7)} #96#return; {65333#(<= ~counter~0 7)} is VALID [2022-04-28 05:59:40,661 INFO L290 TraceCheckUtils]: 72: Hoare triple {65333#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {65333#(<= ~counter~0 7)} is VALID [2022-04-28 05:59:40,662 INFO L290 TraceCheckUtils]: 73: Hoare triple {65333#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {65358#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:40,662 INFO L290 TraceCheckUtils]: 74: Hoare triple {65358#(<= ~counter~0 8)} assume !!(#t~post7 < 20);havoc #t~post7; {65358#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:40,662 INFO L272 TraceCheckUtils]: 75: Hoare triple {65358#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {65358#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:40,663 INFO L290 TraceCheckUtils]: 76: Hoare triple {65358#(<= ~counter~0 8)} ~cond := #in~cond; {65358#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:40,663 INFO L290 TraceCheckUtils]: 77: Hoare triple {65358#(<= ~counter~0 8)} assume !(0 == ~cond); {65358#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:40,663 INFO L290 TraceCheckUtils]: 78: Hoare triple {65358#(<= ~counter~0 8)} assume true; {65358#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:40,664 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {65358#(<= ~counter~0 8)} {65358#(<= ~counter~0 8)} #96#return; {65358#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:40,664 INFO L290 TraceCheckUtils]: 80: Hoare triple {65358#(<= ~counter~0 8)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {65358#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:40,665 INFO L290 TraceCheckUtils]: 81: Hoare triple {65358#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {65383#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:40,665 INFO L290 TraceCheckUtils]: 82: Hoare triple {65383#(<= ~counter~0 9)} assume !!(#t~post7 < 20);havoc #t~post7; {65383#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:40,665 INFO L272 TraceCheckUtils]: 83: Hoare triple {65383#(<= ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {65383#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:40,666 INFO L290 TraceCheckUtils]: 84: Hoare triple {65383#(<= ~counter~0 9)} ~cond := #in~cond; {65383#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:40,666 INFO L290 TraceCheckUtils]: 85: Hoare triple {65383#(<= ~counter~0 9)} assume !(0 == ~cond); {65383#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:40,666 INFO L290 TraceCheckUtils]: 86: Hoare triple {65383#(<= ~counter~0 9)} assume true; {65383#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:40,667 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {65383#(<= ~counter~0 9)} {65383#(<= ~counter~0 9)} #96#return; {65383#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:40,667 INFO L290 TraceCheckUtils]: 88: Hoare triple {65383#(<= ~counter~0 9)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {65383#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:40,668 INFO L290 TraceCheckUtils]: 89: Hoare triple {65383#(<= ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {65408#(<= ~counter~0 10)} is VALID [2022-04-28 05:59:40,668 INFO L290 TraceCheckUtils]: 90: Hoare triple {65408#(<= ~counter~0 10)} assume !!(#t~post7 < 20);havoc #t~post7; {65408#(<= ~counter~0 10)} is VALID [2022-04-28 05:59:40,668 INFO L272 TraceCheckUtils]: 91: Hoare triple {65408#(<= ~counter~0 10)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {65408#(<= ~counter~0 10)} is VALID [2022-04-28 05:59:40,669 INFO L290 TraceCheckUtils]: 92: Hoare triple {65408#(<= ~counter~0 10)} ~cond := #in~cond; {65408#(<= ~counter~0 10)} is VALID [2022-04-28 05:59:40,669 INFO L290 TraceCheckUtils]: 93: Hoare triple {65408#(<= ~counter~0 10)} assume !(0 == ~cond); {65408#(<= ~counter~0 10)} is VALID [2022-04-28 05:59:40,669 INFO L290 TraceCheckUtils]: 94: Hoare triple {65408#(<= ~counter~0 10)} assume true; {65408#(<= ~counter~0 10)} is VALID [2022-04-28 05:59:40,670 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {65408#(<= ~counter~0 10)} {65408#(<= ~counter~0 10)} #96#return; {65408#(<= ~counter~0 10)} is VALID [2022-04-28 05:59:40,670 INFO L290 TraceCheckUtils]: 96: Hoare triple {65408#(<= ~counter~0 10)} assume !(~r~0 > 0); {65408#(<= ~counter~0 10)} is VALID [2022-04-28 05:59:40,671 INFO L290 TraceCheckUtils]: 97: Hoare triple {65408#(<= ~counter~0 10)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {65433#(<= ~counter~0 11)} is VALID [2022-04-28 05:59:40,671 INFO L290 TraceCheckUtils]: 98: Hoare triple {65433#(<= ~counter~0 11)} assume !!(#t~post8 < 20);havoc #t~post8; {65433#(<= ~counter~0 11)} is VALID [2022-04-28 05:59:40,671 INFO L272 TraceCheckUtils]: 99: Hoare triple {65433#(<= ~counter~0 11)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {65433#(<= ~counter~0 11)} is VALID [2022-04-28 05:59:40,672 INFO L290 TraceCheckUtils]: 100: Hoare triple {65433#(<= ~counter~0 11)} ~cond := #in~cond; {65433#(<= ~counter~0 11)} is VALID [2022-04-28 05:59:40,672 INFO L290 TraceCheckUtils]: 101: Hoare triple {65433#(<= ~counter~0 11)} assume !(0 == ~cond); {65433#(<= ~counter~0 11)} is VALID [2022-04-28 05:59:40,672 INFO L290 TraceCheckUtils]: 102: Hoare triple {65433#(<= ~counter~0 11)} assume true; {65433#(<= ~counter~0 11)} is VALID [2022-04-28 05:59:40,673 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {65433#(<= ~counter~0 11)} {65433#(<= ~counter~0 11)} #98#return; {65433#(<= ~counter~0 11)} is VALID [2022-04-28 05:59:40,673 INFO L290 TraceCheckUtils]: 104: Hoare triple {65433#(<= ~counter~0 11)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {65433#(<= ~counter~0 11)} is VALID [2022-04-28 05:59:40,673 INFO L290 TraceCheckUtils]: 105: Hoare triple {65433#(<= ~counter~0 11)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {65458#(<= |main_#t~post8| 11)} is VALID [2022-04-28 05:59:40,673 INFO L290 TraceCheckUtils]: 106: Hoare triple {65458#(<= |main_#t~post8| 11)} assume !(#t~post8 < 20);havoc #t~post8; {65127#false} is VALID [2022-04-28 05:59:40,674 INFO L290 TraceCheckUtils]: 107: Hoare triple {65127#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {65127#false} is VALID [2022-04-28 05:59:40,674 INFO L290 TraceCheckUtils]: 108: Hoare triple {65127#false} assume !(#t~post6 < 20);havoc #t~post6; {65127#false} is VALID [2022-04-28 05:59:40,674 INFO L272 TraceCheckUtils]: 109: Hoare triple {65127#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {65127#false} is VALID [2022-04-28 05:59:40,674 INFO L290 TraceCheckUtils]: 110: Hoare triple {65127#false} ~cond := #in~cond; {65127#false} is VALID [2022-04-28 05:59:40,674 INFO L290 TraceCheckUtils]: 111: Hoare triple {65127#false} assume 0 == ~cond; {65127#false} is VALID [2022-04-28 05:59:40,674 INFO L290 TraceCheckUtils]: 112: Hoare triple {65127#false} assume !false; {65127#false} is VALID [2022-04-28 05:59:40,674 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 26 proven. 302 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 05:59:40,674 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:59:41,236 INFO L290 TraceCheckUtils]: 112: Hoare triple {65127#false} assume !false; {65127#false} is VALID [2022-04-28 05:59:41,236 INFO L290 TraceCheckUtils]: 111: Hoare triple {65127#false} assume 0 == ~cond; {65127#false} is VALID [2022-04-28 05:59:41,236 INFO L290 TraceCheckUtils]: 110: Hoare triple {65127#false} ~cond := #in~cond; {65127#false} is VALID [2022-04-28 05:59:41,236 INFO L272 TraceCheckUtils]: 109: Hoare triple {65127#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {65127#false} is VALID [2022-04-28 05:59:41,236 INFO L290 TraceCheckUtils]: 108: Hoare triple {65127#false} assume !(#t~post6 < 20);havoc #t~post6; {65127#false} is VALID [2022-04-28 05:59:41,236 INFO L290 TraceCheckUtils]: 107: Hoare triple {65127#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {65127#false} is VALID [2022-04-28 05:59:41,236 INFO L290 TraceCheckUtils]: 106: Hoare triple {65498#(< |main_#t~post8| 20)} assume !(#t~post8 < 20);havoc #t~post8; {65127#false} is VALID [2022-04-28 05:59:41,237 INFO L290 TraceCheckUtils]: 105: Hoare triple {65502#(< ~counter~0 20)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {65498#(< |main_#t~post8| 20)} is VALID [2022-04-28 05:59:41,237 INFO L290 TraceCheckUtils]: 104: Hoare triple {65502#(< ~counter~0 20)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {65502#(< ~counter~0 20)} is VALID [2022-04-28 05:59:41,237 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {65126#true} {65502#(< ~counter~0 20)} #98#return; {65502#(< ~counter~0 20)} is VALID [2022-04-28 05:59:41,237 INFO L290 TraceCheckUtils]: 102: Hoare triple {65126#true} assume true; {65126#true} is VALID [2022-04-28 05:59:41,237 INFO L290 TraceCheckUtils]: 101: Hoare triple {65126#true} assume !(0 == ~cond); {65126#true} is VALID [2022-04-28 05:59:41,237 INFO L290 TraceCheckUtils]: 100: Hoare triple {65126#true} ~cond := #in~cond; {65126#true} is VALID [2022-04-28 05:59:41,238 INFO L272 TraceCheckUtils]: 99: Hoare triple {65502#(< ~counter~0 20)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {65126#true} is VALID [2022-04-28 05:59:41,238 INFO L290 TraceCheckUtils]: 98: Hoare triple {65502#(< ~counter~0 20)} assume !!(#t~post8 < 20);havoc #t~post8; {65502#(< ~counter~0 20)} is VALID [2022-04-28 05:59:41,239 INFO L290 TraceCheckUtils]: 97: Hoare triple {65527#(< ~counter~0 19)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {65502#(< ~counter~0 20)} is VALID [2022-04-28 05:59:41,239 INFO L290 TraceCheckUtils]: 96: Hoare triple {65527#(< ~counter~0 19)} assume !(~r~0 > 0); {65527#(< ~counter~0 19)} is VALID [2022-04-28 05:59:41,240 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {65126#true} {65527#(< ~counter~0 19)} #96#return; {65527#(< ~counter~0 19)} is VALID [2022-04-28 05:59:41,240 INFO L290 TraceCheckUtils]: 94: Hoare triple {65126#true} assume true; {65126#true} is VALID [2022-04-28 05:59:41,240 INFO L290 TraceCheckUtils]: 93: Hoare triple {65126#true} assume !(0 == ~cond); {65126#true} is VALID [2022-04-28 05:59:41,240 INFO L290 TraceCheckUtils]: 92: Hoare triple {65126#true} ~cond := #in~cond; {65126#true} is VALID [2022-04-28 05:59:41,240 INFO L272 TraceCheckUtils]: 91: Hoare triple {65527#(< ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {65126#true} is VALID [2022-04-28 05:59:41,240 INFO L290 TraceCheckUtils]: 90: Hoare triple {65527#(< ~counter~0 19)} assume !!(#t~post7 < 20);havoc #t~post7; {65527#(< ~counter~0 19)} is VALID [2022-04-28 05:59:41,241 INFO L290 TraceCheckUtils]: 89: Hoare triple {65552#(< ~counter~0 18)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {65527#(< ~counter~0 19)} is VALID [2022-04-28 05:59:41,241 INFO L290 TraceCheckUtils]: 88: Hoare triple {65552#(< ~counter~0 18)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {65552#(< ~counter~0 18)} is VALID [2022-04-28 05:59:41,242 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {65126#true} {65552#(< ~counter~0 18)} #96#return; {65552#(< ~counter~0 18)} is VALID [2022-04-28 05:59:41,242 INFO L290 TraceCheckUtils]: 86: Hoare triple {65126#true} assume true; {65126#true} is VALID [2022-04-28 05:59:41,242 INFO L290 TraceCheckUtils]: 85: Hoare triple {65126#true} assume !(0 == ~cond); {65126#true} is VALID [2022-04-28 05:59:41,242 INFO L290 TraceCheckUtils]: 84: Hoare triple {65126#true} ~cond := #in~cond; {65126#true} is VALID [2022-04-28 05:59:41,242 INFO L272 TraceCheckUtils]: 83: Hoare triple {65552#(< ~counter~0 18)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {65126#true} is VALID [2022-04-28 05:59:41,242 INFO L290 TraceCheckUtils]: 82: Hoare triple {65552#(< ~counter~0 18)} assume !!(#t~post7 < 20);havoc #t~post7; {65552#(< ~counter~0 18)} is VALID [2022-04-28 05:59:41,243 INFO L290 TraceCheckUtils]: 81: Hoare triple {65577#(< ~counter~0 17)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {65552#(< ~counter~0 18)} is VALID [2022-04-28 05:59:41,243 INFO L290 TraceCheckUtils]: 80: Hoare triple {65577#(< ~counter~0 17)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {65577#(< ~counter~0 17)} is VALID [2022-04-28 05:59:41,244 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {65126#true} {65577#(< ~counter~0 17)} #96#return; {65577#(< ~counter~0 17)} is VALID [2022-04-28 05:59:41,244 INFO L290 TraceCheckUtils]: 78: Hoare triple {65126#true} assume true; {65126#true} is VALID [2022-04-28 05:59:41,244 INFO L290 TraceCheckUtils]: 77: Hoare triple {65126#true} assume !(0 == ~cond); {65126#true} is VALID [2022-04-28 05:59:41,244 INFO L290 TraceCheckUtils]: 76: Hoare triple {65126#true} ~cond := #in~cond; {65126#true} is VALID [2022-04-28 05:59:41,244 INFO L272 TraceCheckUtils]: 75: Hoare triple {65577#(< ~counter~0 17)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {65126#true} is VALID [2022-04-28 05:59:41,244 INFO L290 TraceCheckUtils]: 74: Hoare triple {65577#(< ~counter~0 17)} assume !!(#t~post7 < 20);havoc #t~post7; {65577#(< ~counter~0 17)} is VALID [2022-04-28 05:59:41,245 INFO L290 TraceCheckUtils]: 73: Hoare triple {65602#(< ~counter~0 16)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {65577#(< ~counter~0 17)} is VALID [2022-04-28 05:59:41,245 INFO L290 TraceCheckUtils]: 72: Hoare triple {65602#(< ~counter~0 16)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {65602#(< ~counter~0 16)} is VALID [2022-04-28 05:59:41,246 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {65126#true} {65602#(< ~counter~0 16)} #96#return; {65602#(< ~counter~0 16)} is VALID [2022-04-28 05:59:41,246 INFO L290 TraceCheckUtils]: 70: Hoare triple {65126#true} assume true; {65126#true} is VALID [2022-04-28 05:59:41,246 INFO L290 TraceCheckUtils]: 69: Hoare triple {65126#true} assume !(0 == ~cond); {65126#true} is VALID [2022-04-28 05:59:41,246 INFO L290 TraceCheckUtils]: 68: Hoare triple {65126#true} ~cond := #in~cond; {65126#true} is VALID [2022-04-28 05:59:41,246 INFO L272 TraceCheckUtils]: 67: Hoare triple {65602#(< ~counter~0 16)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {65126#true} is VALID [2022-04-28 05:59:41,246 INFO L290 TraceCheckUtils]: 66: Hoare triple {65602#(< ~counter~0 16)} assume !!(#t~post7 < 20);havoc #t~post7; {65602#(< ~counter~0 16)} is VALID [2022-04-28 05:59:41,247 INFO L290 TraceCheckUtils]: 65: Hoare triple {65627#(< ~counter~0 15)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {65602#(< ~counter~0 16)} is VALID [2022-04-28 05:59:41,247 INFO L290 TraceCheckUtils]: 64: Hoare triple {65627#(< ~counter~0 15)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {65627#(< ~counter~0 15)} is VALID [2022-04-28 05:59:41,248 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {65126#true} {65627#(< ~counter~0 15)} #96#return; {65627#(< ~counter~0 15)} is VALID [2022-04-28 05:59:41,248 INFO L290 TraceCheckUtils]: 62: Hoare triple {65126#true} assume true; {65126#true} is VALID [2022-04-28 05:59:41,248 INFO L290 TraceCheckUtils]: 61: Hoare triple {65126#true} assume !(0 == ~cond); {65126#true} is VALID [2022-04-28 05:59:41,248 INFO L290 TraceCheckUtils]: 60: Hoare triple {65126#true} ~cond := #in~cond; {65126#true} is VALID [2022-04-28 05:59:41,248 INFO L272 TraceCheckUtils]: 59: Hoare triple {65627#(< ~counter~0 15)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {65126#true} is VALID [2022-04-28 05:59:41,248 INFO L290 TraceCheckUtils]: 58: Hoare triple {65627#(< ~counter~0 15)} assume !!(#t~post7 < 20);havoc #t~post7; {65627#(< ~counter~0 15)} is VALID [2022-04-28 05:59:41,249 INFO L290 TraceCheckUtils]: 57: Hoare triple {65652#(< ~counter~0 14)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {65627#(< ~counter~0 15)} is VALID [2022-04-28 05:59:41,249 INFO L290 TraceCheckUtils]: 56: Hoare triple {65652#(< ~counter~0 14)} assume !!(0 != ~r~0); {65652#(< ~counter~0 14)} is VALID [2022-04-28 05:59:41,250 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {65126#true} {65652#(< ~counter~0 14)} #94#return; {65652#(< ~counter~0 14)} is VALID [2022-04-28 05:59:41,250 INFO L290 TraceCheckUtils]: 54: Hoare triple {65126#true} assume true; {65126#true} is VALID [2022-04-28 05:59:41,250 INFO L290 TraceCheckUtils]: 53: Hoare triple {65126#true} assume !(0 == ~cond); {65126#true} is VALID [2022-04-28 05:59:41,250 INFO L290 TraceCheckUtils]: 52: Hoare triple {65126#true} ~cond := #in~cond; {65126#true} is VALID [2022-04-28 05:59:41,250 INFO L272 TraceCheckUtils]: 51: Hoare triple {65652#(< ~counter~0 14)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {65126#true} is VALID [2022-04-28 05:59:41,250 INFO L290 TraceCheckUtils]: 50: Hoare triple {65652#(< ~counter~0 14)} assume !!(#t~post6 < 20);havoc #t~post6; {65652#(< ~counter~0 14)} is VALID [2022-04-28 05:59:41,251 INFO L290 TraceCheckUtils]: 49: Hoare triple {65677#(< ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {65652#(< ~counter~0 14)} is VALID [2022-04-28 05:59:41,251 INFO L290 TraceCheckUtils]: 48: Hoare triple {65677#(< ~counter~0 13)} assume !(~r~0 < 0); {65677#(< ~counter~0 13)} is VALID [2022-04-28 05:59:41,252 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {65126#true} {65677#(< ~counter~0 13)} #98#return; {65677#(< ~counter~0 13)} is VALID [2022-04-28 05:59:41,252 INFO L290 TraceCheckUtils]: 46: Hoare triple {65126#true} assume true; {65126#true} is VALID [2022-04-28 05:59:41,252 INFO L290 TraceCheckUtils]: 45: Hoare triple {65126#true} assume !(0 == ~cond); {65126#true} is VALID [2022-04-28 05:59:41,252 INFO L290 TraceCheckUtils]: 44: Hoare triple {65126#true} ~cond := #in~cond; {65126#true} is VALID [2022-04-28 05:59:41,252 INFO L272 TraceCheckUtils]: 43: Hoare triple {65677#(< ~counter~0 13)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {65126#true} is VALID [2022-04-28 05:59:41,252 INFO L290 TraceCheckUtils]: 42: Hoare triple {65677#(< ~counter~0 13)} assume !!(#t~post8 < 20);havoc #t~post8; {65677#(< ~counter~0 13)} is VALID [2022-04-28 05:59:41,253 INFO L290 TraceCheckUtils]: 41: Hoare triple {65433#(<= ~counter~0 11)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {65677#(< ~counter~0 13)} is VALID [2022-04-28 05:59:41,253 INFO L290 TraceCheckUtils]: 40: Hoare triple {65433#(<= ~counter~0 11)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {65433#(<= ~counter~0 11)} is VALID [2022-04-28 05:59:41,253 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {65126#true} {65433#(<= ~counter~0 11)} #98#return; {65433#(<= ~counter~0 11)} is VALID [2022-04-28 05:59:41,254 INFO L290 TraceCheckUtils]: 38: Hoare triple {65126#true} assume true; {65126#true} is VALID [2022-04-28 05:59:41,254 INFO L290 TraceCheckUtils]: 37: Hoare triple {65126#true} assume !(0 == ~cond); {65126#true} is VALID [2022-04-28 05:59:41,254 INFO L290 TraceCheckUtils]: 36: Hoare triple {65126#true} ~cond := #in~cond; {65126#true} is VALID [2022-04-28 05:59:41,254 INFO L272 TraceCheckUtils]: 35: Hoare triple {65433#(<= ~counter~0 11)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {65126#true} is VALID [2022-04-28 05:59:41,254 INFO L290 TraceCheckUtils]: 34: Hoare triple {65433#(<= ~counter~0 11)} assume !!(#t~post8 < 20);havoc #t~post8; {65433#(<= ~counter~0 11)} is VALID [2022-04-28 05:59:41,255 INFO L290 TraceCheckUtils]: 33: Hoare triple {65408#(<= ~counter~0 10)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {65433#(<= ~counter~0 11)} is VALID [2022-04-28 05:59:41,255 INFO L290 TraceCheckUtils]: 32: Hoare triple {65408#(<= ~counter~0 10)} assume !(~r~0 > 0); {65408#(<= ~counter~0 10)} is VALID [2022-04-28 05:59:41,255 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {65126#true} {65408#(<= ~counter~0 10)} #96#return; {65408#(<= ~counter~0 10)} is VALID [2022-04-28 05:59:41,255 INFO L290 TraceCheckUtils]: 30: Hoare triple {65126#true} assume true; {65126#true} is VALID [2022-04-28 05:59:41,255 INFO L290 TraceCheckUtils]: 29: Hoare triple {65126#true} assume !(0 == ~cond); {65126#true} is VALID [2022-04-28 05:59:41,256 INFO L290 TraceCheckUtils]: 28: Hoare triple {65126#true} ~cond := #in~cond; {65126#true} is VALID [2022-04-28 05:59:41,256 INFO L272 TraceCheckUtils]: 27: Hoare triple {65408#(<= ~counter~0 10)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {65126#true} is VALID [2022-04-28 05:59:41,256 INFO L290 TraceCheckUtils]: 26: Hoare triple {65408#(<= ~counter~0 10)} assume !!(#t~post7 < 20);havoc #t~post7; {65408#(<= ~counter~0 10)} is VALID [2022-04-28 05:59:41,257 INFO L290 TraceCheckUtils]: 25: Hoare triple {65383#(<= ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {65408#(<= ~counter~0 10)} is VALID [2022-04-28 05:59:41,257 INFO L290 TraceCheckUtils]: 24: Hoare triple {65383#(<= ~counter~0 9)} assume !!(0 != ~r~0); {65383#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:41,257 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {65126#true} {65383#(<= ~counter~0 9)} #94#return; {65383#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:41,257 INFO L290 TraceCheckUtils]: 22: Hoare triple {65126#true} assume true; {65126#true} is VALID [2022-04-28 05:59:41,257 INFO L290 TraceCheckUtils]: 21: Hoare triple {65126#true} assume !(0 == ~cond); {65126#true} is VALID [2022-04-28 05:59:41,257 INFO L290 TraceCheckUtils]: 20: Hoare triple {65126#true} ~cond := #in~cond; {65126#true} is VALID [2022-04-28 05:59:41,257 INFO L272 TraceCheckUtils]: 19: Hoare triple {65383#(<= ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {65126#true} is VALID [2022-04-28 05:59:41,258 INFO L290 TraceCheckUtils]: 18: Hoare triple {65383#(<= ~counter~0 9)} assume !!(#t~post6 < 20);havoc #t~post6; {65383#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:41,258 INFO L290 TraceCheckUtils]: 17: Hoare triple {65358#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {65383#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:41,259 INFO L290 TraceCheckUtils]: 16: Hoare triple {65358#(<= ~counter~0 8)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {65358#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:41,259 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {65126#true} {65358#(<= ~counter~0 8)} #92#return; {65358#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:41,259 INFO L290 TraceCheckUtils]: 14: Hoare triple {65126#true} assume true; {65126#true} is VALID [2022-04-28 05:59:41,259 INFO L290 TraceCheckUtils]: 13: Hoare triple {65126#true} assume !(0 == ~cond); {65126#true} is VALID [2022-04-28 05:59:41,259 INFO L290 TraceCheckUtils]: 12: Hoare triple {65126#true} ~cond := #in~cond; {65126#true} is VALID [2022-04-28 05:59:41,259 INFO L272 TraceCheckUtils]: 11: Hoare triple {65358#(<= ~counter~0 8)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {65126#true} is VALID [2022-04-28 05:59:41,260 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {65126#true} {65358#(<= ~counter~0 8)} #90#return; {65358#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:41,260 INFO L290 TraceCheckUtils]: 9: Hoare triple {65126#true} assume true; {65126#true} is VALID [2022-04-28 05:59:41,260 INFO L290 TraceCheckUtils]: 8: Hoare triple {65126#true} assume !(0 == ~cond); {65126#true} is VALID [2022-04-28 05:59:41,260 INFO L290 TraceCheckUtils]: 7: Hoare triple {65126#true} ~cond := #in~cond; {65126#true} is VALID [2022-04-28 05:59:41,260 INFO L272 TraceCheckUtils]: 6: Hoare triple {65358#(<= ~counter~0 8)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {65126#true} is VALID [2022-04-28 05:59:41,260 INFO L290 TraceCheckUtils]: 5: Hoare triple {65358#(<= ~counter~0 8)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {65358#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:41,260 INFO L272 TraceCheckUtils]: 4: Hoare triple {65358#(<= ~counter~0 8)} call #t~ret9 := main(); {65358#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:41,261 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {65358#(<= ~counter~0 8)} {65126#true} #102#return; {65358#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:41,261 INFO L290 TraceCheckUtils]: 2: Hoare triple {65358#(<= ~counter~0 8)} assume true; {65358#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:41,261 INFO L290 TraceCheckUtils]: 1: Hoare triple {65126#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {65358#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:41,261 INFO L272 TraceCheckUtils]: 0: Hoare triple {65126#true} call ULTIMATE.init(); {65126#true} is VALID [2022-04-28 05:59:41,262 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 26 proven. 82 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2022-04-28 05:59:41,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:59:41,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157425460] [2022-04-28 05:59:41,262 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:59:41,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [829259090] [2022-04-28 05:59:41,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [829259090] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:59:41,262 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:59:41,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 24 [2022-04-28 05:59:41,262 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:59:41,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [687801788] [2022-04-28 05:59:41,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [687801788] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:59:41,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:59:41,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 05:59:41,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683434301] [2022-04-28 05:59:41,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:59:41,263 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 14 states have internal predecessors, (80), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) Word has length 113 [2022-04-28 05:59:41,263 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:59:41,263 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 14 states have internal predecessors, (80), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-28 05:59:41,351 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:59:41,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 05:59:41,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:59:41,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 05:59:41,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-28 05:59:41,352 INFO L87 Difference]: Start difference. First operand 560 states and 768 transitions. Second operand has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 14 states have internal predecessors, (80), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-28 05:59:43,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:59:43,914 INFO L93 Difference]: Finished difference Result 781 states and 1101 transitions. [2022-04-28 05:59:43,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-28 05:59:43,914 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 14 states have internal predecessors, (80), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) Word has length 113 [2022-04-28 05:59:43,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:59:43,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 14 states have internal predecessors, (80), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-28 05:59:43,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 256 transitions. [2022-04-28 05:59:43,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 14 states have internal predecessors, (80), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-28 05:59:43,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 256 transitions. [2022-04-28 05:59:43,918 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 256 transitions. [2022-04-28 05:59:44,123 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 256 edges. 256 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:59:44,138 INFO L225 Difference]: With dead ends: 781 [2022-04-28 05:59:44,138 INFO L226 Difference]: Without dead ends: 588 [2022-04-28 05:59:44,139 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 202 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=425, Invalid=631, Unknown=0, NotChecked=0, Total=1056 [2022-04-28 05:59:44,139 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 203 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 05:59:44,140 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 250 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 05:59:44,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2022-04-28 05:59:45,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 578. [2022-04-28 05:59:45,766 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:59:45,767 INFO L82 GeneralOperation]: Start isEquivalent. First operand 588 states. Second operand has 578 states, 436 states have (on average 1.2339449541284404) internal successors, (538), 440 states have internal predecessors, (538), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 121 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-28 05:59:45,767 INFO L74 IsIncluded]: Start isIncluded. First operand 588 states. Second operand has 578 states, 436 states have (on average 1.2339449541284404) internal successors, (538), 440 states have internal predecessors, (538), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 121 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-28 05:59:45,767 INFO L87 Difference]: Start difference. First operand 588 states. Second operand has 578 states, 436 states have (on average 1.2339449541284404) internal successors, (538), 440 states have internal predecessors, (538), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 121 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-28 05:59:45,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:59:45,780 INFO L93 Difference]: Finished difference Result 588 states and 800 transitions. [2022-04-28 05:59:45,780 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 800 transitions. [2022-04-28 05:59:45,781 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:59:45,781 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:59:45,781 INFO L74 IsIncluded]: Start isIncluded. First operand has 578 states, 436 states have (on average 1.2339449541284404) internal successors, (538), 440 states have internal predecessors, (538), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 121 states have call predecessors, (125), 125 states have call successors, (125) Second operand 588 states. [2022-04-28 05:59:45,782 INFO L87 Difference]: Start difference. First operand has 578 states, 436 states have (on average 1.2339449541284404) internal successors, (538), 440 states have internal predecessors, (538), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 121 states have call predecessors, (125), 125 states have call successors, (125) Second operand 588 states. [2022-04-28 05:59:45,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:59:45,801 INFO L93 Difference]: Finished difference Result 588 states and 800 transitions. [2022-04-28 05:59:45,801 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 800 transitions. [2022-04-28 05:59:45,801 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:59:45,801 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:59:45,801 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:59:45,801 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:59:45,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 578 states, 436 states have (on average 1.2339449541284404) internal successors, (538), 440 states have internal predecessors, (538), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 121 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-28 05:59:45,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 790 transitions. [2022-04-28 05:59:45,818 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 790 transitions. Word has length 113 [2022-04-28 05:59:45,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:59:45,818 INFO L495 AbstractCegarLoop]: Abstraction has 578 states and 790 transitions. [2022-04-28 05:59:45,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 14 states have internal predecessors, (80), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-28 05:59:45,818 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 578 states and 790 transitions. [2022-04-28 05:59:49,528 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 790 edges. 789 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 05:59:49,528 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 790 transitions. [2022-04-28 05:59:49,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-04-28 05:59:49,529 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:59:49,529 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:59:49,536 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-04-28 05:59:49,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-04-28 05:59:49,730 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:59:49,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:59:49,730 INFO L85 PathProgramCache]: Analyzing trace with hash 533963976, now seen corresponding path program 13 times [2022-04-28 05:59:49,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:59:49,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1975178946] [2022-04-28 05:59:49,731 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:59:49,731 INFO L85 PathProgramCache]: Analyzing trace with hash 533963976, now seen corresponding path program 14 times [2022-04-28 05:59:49,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:59:49,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287171189] [2022-04-28 05:59:49,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:59:49,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:59:49,745 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:59:49,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1203296083] [2022-04-28 05:59:49,745 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:59:49,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:59:49,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:59:49,746 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:59:49,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-04-28 05:59:49,813 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:59:49,813 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:59:49,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-28 05:59:49,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:59:49,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:59:50,377 INFO L272 TraceCheckUtils]: 0: Hoare triple {69739#true} call ULTIMATE.init(); {69739#true} is VALID [2022-04-28 05:59:50,378 INFO L290 TraceCheckUtils]: 1: Hoare triple {69739#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {69747#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:50,378 INFO L290 TraceCheckUtils]: 2: Hoare triple {69747#(<= ~counter~0 0)} assume true; {69747#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:50,379 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {69747#(<= ~counter~0 0)} {69739#true} #102#return; {69747#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:50,379 INFO L272 TraceCheckUtils]: 4: Hoare triple {69747#(<= ~counter~0 0)} call #t~ret9 := main(); {69747#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:50,379 INFO L290 TraceCheckUtils]: 5: Hoare triple {69747#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {69747#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:50,380 INFO L272 TraceCheckUtils]: 6: Hoare triple {69747#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {69747#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:50,380 INFO L290 TraceCheckUtils]: 7: Hoare triple {69747#(<= ~counter~0 0)} ~cond := #in~cond; {69747#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:50,380 INFO L290 TraceCheckUtils]: 8: Hoare triple {69747#(<= ~counter~0 0)} assume !(0 == ~cond); {69747#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:50,381 INFO L290 TraceCheckUtils]: 9: Hoare triple {69747#(<= ~counter~0 0)} assume true; {69747#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:50,381 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {69747#(<= ~counter~0 0)} {69747#(<= ~counter~0 0)} #90#return; {69747#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:50,381 INFO L272 TraceCheckUtils]: 11: Hoare triple {69747#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {69747#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:50,382 INFO L290 TraceCheckUtils]: 12: Hoare triple {69747#(<= ~counter~0 0)} ~cond := #in~cond; {69747#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:50,382 INFO L290 TraceCheckUtils]: 13: Hoare triple {69747#(<= ~counter~0 0)} assume !(0 == ~cond); {69747#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:50,382 INFO L290 TraceCheckUtils]: 14: Hoare triple {69747#(<= ~counter~0 0)} assume true; {69747#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:50,382 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {69747#(<= ~counter~0 0)} {69747#(<= ~counter~0 0)} #92#return; {69747#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:50,383 INFO L290 TraceCheckUtils]: 16: Hoare triple {69747#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {69747#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:50,384 INFO L290 TraceCheckUtils]: 17: Hoare triple {69747#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {69796#(<= ~counter~0 1)} is VALID [2022-04-28 05:59:50,385 INFO L290 TraceCheckUtils]: 18: Hoare triple {69796#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {69796#(<= ~counter~0 1)} is VALID [2022-04-28 05:59:50,385 INFO L272 TraceCheckUtils]: 19: Hoare triple {69796#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {69796#(<= ~counter~0 1)} is VALID [2022-04-28 05:59:50,385 INFO L290 TraceCheckUtils]: 20: Hoare triple {69796#(<= ~counter~0 1)} ~cond := #in~cond; {69796#(<= ~counter~0 1)} is VALID [2022-04-28 05:59:50,386 INFO L290 TraceCheckUtils]: 21: Hoare triple {69796#(<= ~counter~0 1)} assume !(0 == ~cond); {69796#(<= ~counter~0 1)} is VALID [2022-04-28 05:59:50,386 INFO L290 TraceCheckUtils]: 22: Hoare triple {69796#(<= ~counter~0 1)} assume true; {69796#(<= ~counter~0 1)} is VALID [2022-04-28 05:59:50,386 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {69796#(<= ~counter~0 1)} {69796#(<= ~counter~0 1)} #94#return; {69796#(<= ~counter~0 1)} is VALID [2022-04-28 05:59:50,387 INFO L290 TraceCheckUtils]: 24: Hoare triple {69796#(<= ~counter~0 1)} assume !!(0 != ~r~0); {69796#(<= ~counter~0 1)} is VALID [2022-04-28 05:59:50,387 INFO L290 TraceCheckUtils]: 25: Hoare triple {69796#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {69821#(<= ~counter~0 2)} is VALID [2022-04-28 05:59:50,388 INFO L290 TraceCheckUtils]: 26: Hoare triple {69821#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {69821#(<= ~counter~0 2)} is VALID [2022-04-28 05:59:50,388 INFO L272 TraceCheckUtils]: 27: Hoare triple {69821#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {69821#(<= ~counter~0 2)} is VALID [2022-04-28 05:59:50,388 INFO L290 TraceCheckUtils]: 28: Hoare triple {69821#(<= ~counter~0 2)} ~cond := #in~cond; {69821#(<= ~counter~0 2)} is VALID [2022-04-28 05:59:50,389 INFO L290 TraceCheckUtils]: 29: Hoare triple {69821#(<= ~counter~0 2)} assume !(0 == ~cond); {69821#(<= ~counter~0 2)} is VALID [2022-04-28 05:59:50,389 INFO L290 TraceCheckUtils]: 30: Hoare triple {69821#(<= ~counter~0 2)} assume true; {69821#(<= ~counter~0 2)} is VALID [2022-04-28 05:59:50,389 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {69821#(<= ~counter~0 2)} {69821#(<= ~counter~0 2)} #96#return; {69821#(<= ~counter~0 2)} is VALID [2022-04-28 05:59:50,390 INFO L290 TraceCheckUtils]: 32: Hoare triple {69821#(<= ~counter~0 2)} assume !(~r~0 > 0); {69821#(<= ~counter~0 2)} is VALID [2022-04-28 05:59:50,391 INFO L290 TraceCheckUtils]: 33: Hoare triple {69821#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {69846#(<= ~counter~0 3)} is VALID [2022-04-28 05:59:50,391 INFO L290 TraceCheckUtils]: 34: Hoare triple {69846#(<= ~counter~0 3)} assume !!(#t~post8 < 20);havoc #t~post8; {69846#(<= ~counter~0 3)} is VALID [2022-04-28 05:59:50,391 INFO L272 TraceCheckUtils]: 35: Hoare triple {69846#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {69846#(<= ~counter~0 3)} is VALID [2022-04-28 05:59:50,392 INFO L290 TraceCheckUtils]: 36: Hoare triple {69846#(<= ~counter~0 3)} ~cond := #in~cond; {69846#(<= ~counter~0 3)} is VALID [2022-04-28 05:59:50,392 INFO L290 TraceCheckUtils]: 37: Hoare triple {69846#(<= ~counter~0 3)} assume !(0 == ~cond); {69846#(<= ~counter~0 3)} is VALID [2022-04-28 05:59:50,392 INFO L290 TraceCheckUtils]: 38: Hoare triple {69846#(<= ~counter~0 3)} assume true; {69846#(<= ~counter~0 3)} is VALID [2022-04-28 05:59:50,393 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {69846#(<= ~counter~0 3)} {69846#(<= ~counter~0 3)} #98#return; {69846#(<= ~counter~0 3)} is VALID [2022-04-28 05:59:50,393 INFO L290 TraceCheckUtils]: 40: Hoare triple {69846#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {69846#(<= ~counter~0 3)} is VALID [2022-04-28 05:59:50,394 INFO L290 TraceCheckUtils]: 41: Hoare triple {69846#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {69871#(<= ~counter~0 4)} is VALID [2022-04-28 05:59:50,394 INFO L290 TraceCheckUtils]: 42: Hoare triple {69871#(<= ~counter~0 4)} assume !!(#t~post8 < 20);havoc #t~post8; {69871#(<= ~counter~0 4)} is VALID [2022-04-28 05:59:50,395 INFO L272 TraceCheckUtils]: 43: Hoare triple {69871#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {69871#(<= ~counter~0 4)} is VALID [2022-04-28 05:59:50,395 INFO L290 TraceCheckUtils]: 44: Hoare triple {69871#(<= ~counter~0 4)} ~cond := #in~cond; {69871#(<= ~counter~0 4)} is VALID [2022-04-28 05:59:50,395 INFO L290 TraceCheckUtils]: 45: Hoare triple {69871#(<= ~counter~0 4)} assume !(0 == ~cond); {69871#(<= ~counter~0 4)} is VALID [2022-04-28 05:59:50,395 INFO L290 TraceCheckUtils]: 46: Hoare triple {69871#(<= ~counter~0 4)} assume true; {69871#(<= ~counter~0 4)} is VALID [2022-04-28 05:59:50,396 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {69871#(<= ~counter~0 4)} {69871#(<= ~counter~0 4)} #98#return; {69871#(<= ~counter~0 4)} is VALID [2022-04-28 05:59:50,396 INFO L290 TraceCheckUtils]: 48: Hoare triple {69871#(<= ~counter~0 4)} assume !(~r~0 < 0); {69871#(<= ~counter~0 4)} is VALID [2022-04-28 05:59:50,397 INFO L290 TraceCheckUtils]: 49: Hoare triple {69871#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {69896#(<= ~counter~0 5)} is VALID [2022-04-28 05:59:50,397 INFO L290 TraceCheckUtils]: 50: Hoare triple {69896#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {69896#(<= ~counter~0 5)} is VALID [2022-04-28 05:59:50,398 INFO L272 TraceCheckUtils]: 51: Hoare triple {69896#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {69896#(<= ~counter~0 5)} is VALID [2022-04-28 05:59:50,398 INFO L290 TraceCheckUtils]: 52: Hoare triple {69896#(<= ~counter~0 5)} ~cond := #in~cond; {69896#(<= ~counter~0 5)} is VALID [2022-04-28 05:59:50,398 INFO L290 TraceCheckUtils]: 53: Hoare triple {69896#(<= ~counter~0 5)} assume !(0 == ~cond); {69896#(<= ~counter~0 5)} is VALID [2022-04-28 05:59:50,398 INFO L290 TraceCheckUtils]: 54: Hoare triple {69896#(<= ~counter~0 5)} assume true; {69896#(<= ~counter~0 5)} is VALID [2022-04-28 05:59:50,399 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {69896#(<= ~counter~0 5)} {69896#(<= ~counter~0 5)} #94#return; {69896#(<= ~counter~0 5)} is VALID [2022-04-28 05:59:50,399 INFO L290 TraceCheckUtils]: 56: Hoare triple {69896#(<= ~counter~0 5)} assume !!(0 != ~r~0); {69896#(<= ~counter~0 5)} is VALID [2022-04-28 05:59:50,400 INFO L290 TraceCheckUtils]: 57: Hoare triple {69896#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {69921#(<= ~counter~0 6)} is VALID [2022-04-28 05:59:50,400 INFO L290 TraceCheckUtils]: 58: Hoare triple {69921#(<= ~counter~0 6)} assume !!(#t~post7 < 20);havoc #t~post7; {69921#(<= ~counter~0 6)} is VALID [2022-04-28 05:59:50,401 INFO L272 TraceCheckUtils]: 59: Hoare triple {69921#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {69921#(<= ~counter~0 6)} is VALID [2022-04-28 05:59:50,401 INFO L290 TraceCheckUtils]: 60: Hoare triple {69921#(<= ~counter~0 6)} ~cond := #in~cond; {69921#(<= ~counter~0 6)} is VALID [2022-04-28 05:59:50,401 INFO L290 TraceCheckUtils]: 61: Hoare triple {69921#(<= ~counter~0 6)} assume !(0 == ~cond); {69921#(<= ~counter~0 6)} is VALID [2022-04-28 05:59:50,401 INFO L290 TraceCheckUtils]: 62: Hoare triple {69921#(<= ~counter~0 6)} assume true; {69921#(<= ~counter~0 6)} is VALID [2022-04-28 05:59:50,402 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {69921#(<= ~counter~0 6)} {69921#(<= ~counter~0 6)} #96#return; {69921#(<= ~counter~0 6)} is VALID [2022-04-28 05:59:50,402 INFO L290 TraceCheckUtils]: 64: Hoare triple {69921#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {69921#(<= ~counter~0 6)} is VALID [2022-04-28 05:59:50,403 INFO L290 TraceCheckUtils]: 65: Hoare triple {69921#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {69946#(<= ~counter~0 7)} is VALID [2022-04-28 05:59:50,403 INFO L290 TraceCheckUtils]: 66: Hoare triple {69946#(<= ~counter~0 7)} assume !!(#t~post7 < 20);havoc #t~post7; {69946#(<= ~counter~0 7)} is VALID [2022-04-28 05:59:50,404 INFO L272 TraceCheckUtils]: 67: Hoare triple {69946#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {69946#(<= ~counter~0 7)} is VALID [2022-04-28 05:59:50,404 INFO L290 TraceCheckUtils]: 68: Hoare triple {69946#(<= ~counter~0 7)} ~cond := #in~cond; {69946#(<= ~counter~0 7)} is VALID [2022-04-28 05:59:50,404 INFO L290 TraceCheckUtils]: 69: Hoare triple {69946#(<= ~counter~0 7)} assume !(0 == ~cond); {69946#(<= ~counter~0 7)} is VALID [2022-04-28 05:59:50,404 INFO L290 TraceCheckUtils]: 70: Hoare triple {69946#(<= ~counter~0 7)} assume true; {69946#(<= ~counter~0 7)} is VALID [2022-04-28 05:59:50,405 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {69946#(<= ~counter~0 7)} {69946#(<= ~counter~0 7)} #96#return; {69946#(<= ~counter~0 7)} is VALID [2022-04-28 05:59:50,405 INFO L290 TraceCheckUtils]: 72: Hoare triple {69946#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {69946#(<= ~counter~0 7)} is VALID [2022-04-28 05:59:50,406 INFO L290 TraceCheckUtils]: 73: Hoare triple {69946#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {69971#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:50,406 INFO L290 TraceCheckUtils]: 74: Hoare triple {69971#(<= ~counter~0 8)} assume !!(#t~post7 < 20);havoc #t~post7; {69971#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:50,407 INFO L272 TraceCheckUtils]: 75: Hoare triple {69971#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {69971#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:50,407 INFO L290 TraceCheckUtils]: 76: Hoare triple {69971#(<= ~counter~0 8)} ~cond := #in~cond; {69971#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:50,407 INFO L290 TraceCheckUtils]: 77: Hoare triple {69971#(<= ~counter~0 8)} assume !(0 == ~cond); {69971#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:50,407 INFO L290 TraceCheckUtils]: 78: Hoare triple {69971#(<= ~counter~0 8)} assume true; {69971#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:50,408 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {69971#(<= ~counter~0 8)} {69971#(<= ~counter~0 8)} #96#return; {69971#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:50,408 INFO L290 TraceCheckUtils]: 80: Hoare triple {69971#(<= ~counter~0 8)} assume !(~r~0 > 0); {69971#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:50,409 INFO L290 TraceCheckUtils]: 81: Hoare triple {69971#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {69996#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:50,409 INFO L290 TraceCheckUtils]: 82: Hoare triple {69996#(<= ~counter~0 9)} assume !!(#t~post8 < 20);havoc #t~post8; {69996#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:50,410 INFO L272 TraceCheckUtils]: 83: Hoare triple {69996#(<= ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {69996#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:50,410 INFO L290 TraceCheckUtils]: 84: Hoare triple {69996#(<= ~counter~0 9)} ~cond := #in~cond; {69996#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:50,410 INFO L290 TraceCheckUtils]: 85: Hoare triple {69996#(<= ~counter~0 9)} assume !(0 == ~cond); {69996#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:50,410 INFO L290 TraceCheckUtils]: 86: Hoare triple {69996#(<= ~counter~0 9)} assume true; {69996#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:50,411 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {69996#(<= ~counter~0 9)} {69996#(<= ~counter~0 9)} #98#return; {69996#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:50,411 INFO L290 TraceCheckUtils]: 88: Hoare triple {69996#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {69996#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:50,412 INFO L290 TraceCheckUtils]: 89: Hoare triple {69996#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {70021#(<= ~counter~0 10)} is VALID [2022-04-28 05:59:50,412 INFO L290 TraceCheckUtils]: 90: Hoare triple {70021#(<= ~counter~0 10)} assume !!(#t~post8 < 20);havoc #t~post8; {70021#(<= ~counter~0 10)} is VALID [2022-04-28 05:59:50,413 INFO L272 TraceCheckUtils]: 91: Hoare triple {70021#(<= ~counter~0 10)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {70021#(<= ~counter~0 10)} is VALID [2022-04-28 05:59:50,413 INFO L290 TraceCheckUtils]: 92: Hoare triple {70021#(<= ~counter~0 10)} ~cond := #in~cond; {70021#(<= ~counter~0 10)} is VALID [2022-04-28 05:59:50,413 INFO L290 TraceCheckUtils]: 93: Hoare triple {70021#(<= ~counter~0 10)} assume !(0 == ~cond); {70021#(<= ~counter~0 10)} is VALID [2022-04-28 05:59:50,413 INFO L290 TraceCheckUtils]: 94: Hoare triple {70021#(<= ~counter~0 10)} assume true; {70021#(<= ~counter~0 10)} is VALID [2022-04-28 05:59:50,414 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {70021#(<= ~counter~0 10)} {70021#(<= ~counter~0 10)} #98#return; {70021#(<= ~counter~0 10)} is VALID [2022-04-28 05:59:50,414 INFO L290 TraceCheckUtils]: 96: Hoare triple {70021#(<= ~counter~0 10)} assume !(~r~0 < 0); {70021#(<= ~counter~0 10)} is VALID [2022-04-28 05:59:50,415 INFO L290 TraceCheckUtils]: 97: Hoare triple {70021#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {70046#(<= ~counter~0 11)} is VALID [2022-04-28 05:59:50,415 INFO L290 TraceCheckUtils]: 98: Hoare triple {70046#(<= ~counter~0 11)} assume !!(#t~post6 < 20);havoc #t~post6; {70046#(<= ~counter~0 11)} is VALID [2022-04-28 05:59:50,416 INFO L272 TraceCheckUtils]: 99: Hoare triple {70046#(<= ~counter~0 11)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {70046#(<= ~counter~0 11)} is VALID [2022-04-28 05:59:50,416 INFO L290 TraceCheckUtils]: 100: Hoare triple {70046#(<= ~counter~0 11)} ~cond := #in~cond; {70046#(<= ~counter~0 11)} is VALID [2022-04-28 05:59:50,416 INFO L290 TraceCheckUtils]: 101: Hoare triple {70046#(<= ~counter~0 11)} assume !(0 == ~cond); {70046#(<= ~counter~0 11)} is VALID [2022-04-28 05:59:50,416 INFO L290 TraceCheckUtils]: 102: Hoare triple {70046#(<= ~counter~0 11)} assume true; {70046#(<= ~counter~0 11)} is VALID [2022-04-28 05:59:50,417 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {70046#(<= ~counter~0 11)} {70046#(<= ~counter~0 11)} #94#return; {70046#(<= ~counter~0 11)} is VALID [2022-04-28 05:59:50,417 INFO L290 TraceCheckUtils]: 104: Hoare triple {70046#(<= ~counter~0 11)} assume !!(0 != ~r~0); {70046#(<= ~counter~0 11)} is VALID [2022-04-28 05:59:50,417 INFO L290 TraceCheckUtils]: 105: Hoare triple {70046#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {70071#(<= |main_#t~post7| 11)} is VALID [2022-04-28 05:59:50,418 INFO L290 TraceCheckUtils]: 106: Hoare triple {70071#(<= |main_#t~post7| 11)} assume !(#t~post7 < 20);havoc #t~post7; {69740#false} is VALID [2022-04-28 05:59:50,418 INFO L290 TraceCheckUtils]: 107: Hoare triple {69740#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {69740#false} is VALID [2022-04-28 05:59:50,418 INFO L290 TraceCheckUtils]: 108: Hoare triple {69740#false} assume !(#t~post8 < 20);havoc #t~post8; {69740#false} is VALID [2022-04-28 05:59:50,418 INFO L290 TraceCheckUtils]: 109: Hoare triple {69740#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {69740#false} is VALID [2022-04-28 05:59:50,418 INFO L290 TraceCheckUtils]: 110: Hoare triple {69740#false} assume !(#t~post6 < 20);havoc #t~post6; {69740#false} is VALID [2022-04-28 05:59:50,418 INFO L272 TraceCheckUtils]: 111: Hoare triple {69740#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {69740#false} is VALID [2022-04-28 05:59:50,418 INFO L290 TraceCheckUtils]: 112: Hoare triple {69740#false} ~cond := #in~cond; {69740#false} is VALID [2022-04-28 05:59:50,418 INFO L290 TraceCheckUtils]: 113: Hoare triple {69740#false} assume 0 == ~cond; {69740#false} is VALID [2022-04-28 05:59:50,418 INFO L290 TraceCheckUtils]: 114: Hoare triple {69740#false} assume !false; {69740#false} is VALID [2022-04-28 05:59:50,419 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 36 proven. 288 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 05:59:50,419 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:59:51,009 INFO L290 TraceCheckUtils]: 114: Hoare triple {69740#false} assume !false; {69740#false} is VALID [2022-04-28 05:59:51,009 INFO L290 TraceCheckUtils]: 113: Hoare triple {69740#false} assume 0 == ~cond; {69740#false} is VALID [2022-04-28 05:59:51,009 INFO L290 TraceCheckUtils]: 112: Hoare triple {69740#false} ~cond := #in~cond; {69740#false} is VALID [2022-04-28 05:59:51,010 INFO L272 TraceCheckUtils]: 111: Hoare triple {69740#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {69740#false} is VALID [2022-04-28 05:59:51,010 INFO L290 TraceCheckUtils]: 110: Hoare triple {69740#false} assume !(#t~post6 < 20);havoc #t~post6; {69740#false} is VALID [2022-04-28 05:59:51,010 INFO L290 TraceCheckUtils]: 109: Hoare triple {69740#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {69740#false} is VALID [2022-04-28 05:59:51,010 INFO L290 TraceCheckUtils]: 108: Hoare triple {69740#false} assume !(#t~post8 < 20);havoc #t~post8; {69740#false} is VALID [2022-04-28 05:59:51,010 INFO L290 TraceCheckUtils]: 107: Hoare triple {69740#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {69740#false} is VALID [2022-04-28 05:59:51,010 INFO L290 TraceCheckUtils]: 106: Hoare triple {70123#(< |main_#t~post7| 20)} assume !(#t~post7 < 20);havoc #t~post7; {69740#false} is VALID [2022-04-28 05:59:51,010 INFO L290 TraceCheckUtils]: 105: Hoare triple {70127#(< ~counter~0 20)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {70123#(< |main_#t~post7| 20)} is VALID [2022-04-28 05:59:51,011 INFO L290 TraceCheckUtils]: 104: Hoare triple {70127#(< ~counter~0 20)} assume !!(0 != ~r~0); {70127#(< ~counter~0 20)} is VALID [2022-04-28 05:59:51,011 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {69739#true} {70127#(< ~counter~0 20)} #94#return; {70127#(< ~counter~0 20)} is VALID [2022-04-28 05:59:51,011 INFO L290 TraceCheckUtils]: 102: Hoare triple {69739#true} assume true; {69739#true} is VALID [2022-04-28 05:59:51,011 INFO L290 TraceCheckUtils]: 101: Hoare triple {69739#true} assume !(0 == ~cond); {69739#true} is VALID [2022-04-28 05:59:51,011 INFO L290 TraceCheckUtils]: 100: Hoare triple {69739#true} ~cond := #in~cond; {69739#true} is VALID [2022-04-28 05:59:51,011 INFO L272 TraceCheckUtils]: 99: Hoare triple {70127#(< ~counter~0 20)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {69739#true} is VALID [2022-04-28 05:59:51,012 INFO L290 TraceCheckUtils]: 98: Hoare triple {70127#(< ~counter~0 20)} assume !!(#t~post6 < 20);havoc #t~post6; {70127#(< ~counter~0 20)} is VALID [2022-04-28 05:59:51,013 INFO L290 TraceCheckUtils]: 97: Hoare triple {70152#(< ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {70127#(< ~counter~0 20)} is VALID [2022-04-28 05:59:51,014 INFO L290 TraceCheckUtils]: 96: Hoare triple {70152#(< ~counter~0 19)} assume !(~r~0 < 0); {70152#(< ~counter~0 19)} is VALID [2022-04-28 05:59:51,014 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {69739#true} {70152#(< ~counter~0 19)} #98#return; {70152#(< ~counter~0 19)} is VALID [2022-04-28 05:59:51,014 INFO L290 TraceCheckUtils]: 94: Hoare triple {69739#true} assume true; {69739#true} is VALID [2022-04-28 05:59:51,014 INFO L290 TraceCheckUtils]: 93: Hoare triple {69739#true} assume !(0 == ~cond); {69739#true} is VALID [2022-04-28 05:59:51,014 INFO L290 TraceCheckUtils]: 92: Hoare triple {69739#true} ~cond := #in~cond; {69739#true} is VALID [2022-04-28 05:59:51,014 INFO L272 TraceCheckUtils]: 91: Hoare triple {70152#(< ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {69739#true} is VALID [2022-04-28 05:59:51,015 INFO L290 TraceCheckUtils]: 90: Hoare triple {70152#(< ~counter~0 19)} assume !!(#t~post8 < 20);havoc #t~post8; {70152#(< ~counter~0 19)} is VALID [2022-04-28 05:59:51,015 INFO L290 TraceCheckUtils]: 89: Hoare triple {70177#(< ~counter~0 18)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {70152#(< ~counter~0 19)} is VALID [2022-04-28 05:59:51,016 INFO L290 TraceCheckUtils]: 88: Hoare triple {70177#(< ~counter~0 18)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {70177#(< ~counter~0 18)} is VALID [2022-04-28 05:59:51,016 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {69739#true} {70177#(< ~counter~0 18)} #98#return; {70177#(< ~counter~0 18)} is VALID [2022-04-28 05:59:51,016 INFO L290 TraceCheckUtils]: 86: Hoare triple {69739#true} assume true; {69739#true} is VALID [2022-04-28 05:59:51,016 INFO L290 TraceCheckUtils]: 85: Hoare triple {69739#true} assume !(0 == ~cond); {69739#true} is VALID [2022-04-28 05:59:51,016 INFO L290 TraceCheckUtils]: 84: Hoare triple {69739#true} ~cond := #in~cond; {69739#true} is VALID [2022-04-28 05:59:51,016 INFO L272 TraceCheckUtils]: 83: Hoare triple {70177#(< ~counter~0 18)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {69739#true} is VALID [2022-04-28 05:59:51,017 INFO L290 TraceCheckUtils]: 82: Hoare triple {70177#(< ~counter~0 18)} assume !!(#t~post8 < 20);havoc #t~post8; {70177#(< ~counter~0 18)} is VALID [2022-04-28 05:59:51,017 INFO L290 TraceCheckUtils]: 81: Hoare triple {70202#(< ~counter~0 17)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {70177#(< ~counter~0 18)} is VALID [2022-04-28 05:59:51,018 INFO L290 TraceCheckUtils]: 80: Hoare triple {70202#(< ~counter~0 17)} assume !(~r~0 > 0); {70202#(< ~counter~0 17)} is VALID [2022-04-28 05:59:51,018 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {69739#true} {70202#(< ~counter~0 17)} #96#return; {70202#(< ~counter~0 17)} is VALID [2022-04-28 05:59:51,018 INFO L290 TraceCheckUtils]: 78: Hoare triple {69739#true} assume true; {69739#true} is VALID [2022-04-28 05:59:51,018 INFO L290 TraceCheckUtils]: 77: Hoare triple {69739#true} assume !(0 == ~cond); {69739#true} is VALID [2022-04-28 05:59:51,018 INFO L290 TraceCheckUtils]: 76: Hoare triple {69739#true} ~cond := #in~cond; {69739#true} is VALID [2022-04-28 05:59:51,018 INFO L272 TraceCheckUtils]: 75: Hoare triple {70202#(< ~counter~0 17)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {69739#true} is VALID [2022-04-28 05:59:51,019 INFO L290 TraceCheckUtils]: 74: Hoare triple {70202#(< ~counter~0 17)} assume !!(#t~post7 < 20);havoc #t~post7; {70202#(< ~counter~0 17)} is VALID [2022-04-28 05:59:51,019 INFO L290 TraceCheckUtils]: 73: Hoare triple {70227#(< ~counter~0 16)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {70202#(< ~counter~0 17)} is VALID [2022-04-28 05:59:51,020 INFO L290 TraceCheckUtils]: 72: Hoare triple {70227#(< ~counter~0 16)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {70227#(< ~counter~0 16)} is VALID [2022-04-28 05:59:51,020 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {69739#true} {70227#(< ~counter~0 16)} #96#return; {70227#(< ~counter~0 16)} is VALID [2022-04-28 05:59:51,020 INFO L290 TraceCheckUtils]: 70: Hoare triple {69739#true} assume true; {69739#true} is VALID [2022-04-28 05:59:51,020 INFO L290 TraceCheckUtils]: 69: Hoare triple {69739#true} assume !(0 == ~cond); {69739#true} is VALID [2022-04-28 05:59:51,020 INFO L290 TraceCheckUtils]: 68: Hoare triple {69739#true} ~cond := #in~cond; {69739#true} is VALID [2022-04-28 05:59:51,020 INFO L272 TraceCheckUtils]: 67: Hoare triple {70227#(< ~counter~0 16)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {69739#true} is VALID [2022-04-28 05:59:51,021 INFO L290 TraceCheckUtils]: 66: Hoare triple {70227#(< ~counter~0 16)} assume !!(#t~post7 < 20);havoc #t~post7; {70227#(< ~counter~0 16)} is VALID [2022-04-28 05:59:51,022 INFO L290 TraceCheckUtils]: 65: Hoare triple {70252#(< ~counter~0 15)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {70227#(< ~counter~0 16)} is VALID [2022-04-28 05:59:51,022 INFO L290 TraceCheckUtils]: 64: Hoare triple {70252#(< ~counter~0 15)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {70252#(< ~counter~0 15)} is VALID [2022-04-28 05:59:51,022 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {69739#true} {70252#(< ~counter~0 15)} #96#return; {70252#(< ~counter~0 15)} is VALID [2022-04-28 05:59:51,022 INFO L290 TraceCheckUtils]: 62: Hoare triple {69739#true} assume true; {69739#true} is VALID [2022-04-28 05:59:51,022 INFO L290 TraceCheckUtils]: 61: Hoare triple {69739#true} assume !(0 == ~cond); {69739#true} is VALID [2022-04-28 05:59:51,023 INFO L290 TraceCheckUtils]: 60: Hoare triple {69739#true} ~cond := #in~cond; {69739#true} is VALID [2022-04-28 05:59:51,023 INFO L272 TraceCheckUtils]: 59: Hoare triple {70252#(< ~counter~0 15)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {69739#true} is VALID [2022-04-28 05:59:51,023 INFO L290 TraceCheckUtils]: 58: Hoare triple {70252#(< ~counter~0 15)} assume !!(#t~post7 < 20);havoc #t~post7; {70252#(< ~counter~0 15)} is VALID [2022-04-28 05:59:51,024 INFO L290 TraceCheckUtils]: 57: Hoare triple {70277#(< ~counter~0 14)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {70252#(< ~counter~0 15)} is VALID [2022-04-28 05:59:51,024 INFO L290 TraceCheckUtils]: 56: Hoare triple {70277#(< ~counter~0 14)} assume !!(0 != ~r~0); {70277#(< ~counter~0 14)} is VALID [2022-04-28 05:59:51,024 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {69739#true} {70277#(< ~counter~0 14)} #94#return; {70277#(< ~counter~0 14)} is VALID [2022-04-28 05:59:51,024 INFO L290 TraceCheckUtils]: 54: Hoare triple {69739#true} assume true; {69739#true} is VALID [2022-04-28 05:59:51,025 INFO L290 TraceCheckUtils]: 53: Hoare triple {69739#true} assume !(0 == ~cond); {69739#true} is VALID [2022-04-28 05:59:51,025 INFO L290 TraceCheckUtils]: 52: Hoare triple {69739#true} ~cond := #in~cond; {69739#true} is VALID [2022-04-28 05:59:51,025 INFO L272 TraceCheckUtils]: 51: Hoare triple {70277#(< ~counter~0 14)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {69739#true} is VALID [2022-04-28 05:59:51,025 INFO L290 TraceCheckUtils]: 50: Hoare triple {70277#(< ~counter~0 14)} assume !!(#t~post6 < 20);havoc #t~post6; {70277#(< ~counter~0 14)} is VALID [2022-04-28 05:59:51,026 INFO L290 TraceCheckUtils]: 49: Hoare triple {70302#(< ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {70277#(< ~counter~0 14)} is VALID [2022-04-28 05:59:51,026 INFO L290 TraceCheckUtils]: 48: Hoare triple {70302#(< ~counter~0 13)} assume !(~r~0 < 0); {70302#(< ~counter~0 13)} is VALID [2022-04-28 05:59:51,026 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {69739#true} {70302#(< ~counter~0 13)} #98#return; {70302#(< ~counter~0 13)} is VALID [2022-04-28 05:59:51,027 INFO L290 TraceCheckUtils]: 46: Hoare triple {69739#true} assume true; {69739#true} is VALID [2022-04-28 05:59:51,027 INFO L290 TraceCheckUtils]: 45: Hoare triple {69739#true} assume !(0 == ~cond); {69739#true} is VALID [2022-04-28 05:59:51,027 INFO L290 TraceCheckUtils]: 44: Hoare triple {69739#true} ~cond := #in~cond; {69739#true} is VALID [2022-04-28 05:59:51,027 INFO L272 TraceCheckUtils]: 43: Hoare triple {70302#(< ~counter~0 13)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {69739#true} is VALID [2022-04-28 05:59:51,027 INFO L290 TraceCheckUtils]: 42: Hoare triple {70302#(< ~counter~0 13)} assume !!(#t~post8 < 20);havoc #t~post8; {70302#(< ~counter~0 13)} is VALID [2022-04-28 05:59:51,028 INFO L290 TraceCheckUtils]: 41: Hoare triple {70046#(<= ~counter~0 11)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {70302#(< ~counter~0 13)} is VALID [2022-04-28 05:59:51,028 INFO L290 TraceCheckUtils]: 40: Hoare triple {70046#(<= ~counter~0 11)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {70046#(<= ~counter~0 11)} is VALID [2022-04-28 05:59:51,029 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {69739#true} {70046#(<= ~counter~0 11)} #98#return; {70046#(<= ~counter~0 11)} is VALID [2022-04-28 05:59:51,029 INFO L290 TraceCheckUtils]: 38: Hoare triple {69739#true} assume true; {69739#true} is VALID [2022-04-28 05:59:51,029 INFO L290 TraceCheckUtils]: 37: Hoare triple {69739#true} assume !(0 == ~cond); {69739#true} is VALID [2022-04-28 05:59:51,029 INFO L290 TraceCheckUtils]: 36: Hoare triple {69739#true} ~cond := #in~cond; {69739#true} is VALID [2022-04-28 05:59:51,029 INFO L272 TraceCheckUtils]: 35: Hoare triple {70046#(<= ~counter~0 11)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {69739#true} is VALID [2022-04-28 05:59:51,029 INFO L290 TraceCheckUtils]: 34: Hoare triple {70046#(<= ~counter~0 11)} assume !!(#t~post8 < 20);havoc #t~post8; {70046#(<= ~counter~0 11)} is VALID [2022-04-28 05:59:51,030 INFO L290 TraceCheckUtils]: 33: Hoare triple {70021#(<= ~counter~0 10)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {70046#(<= ~counter~0 11)} is VALID [2022-04-28 05:59:51,030 INFO L290 TraceCheckUtils]: 32: Hoare triple {70021#(<= ~counter~0 10)} assume !(~r~0 > 0); {70021#(<= ~counter~0 10)} is VALID [2022-04-28 05:59:51,031 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {69739#true} {70021#(<= ~counter~0 10)} #96#return; {70021#(<= ~counter~0 10)} is VALID [2022-04-28 05:59:51,031 INFO L290 TraceCheckUtils]: 30: Hoare triple {69739#true} assume true; {69739#true} is VALID [2022-04-28 05:59:51,031 INFO L290 TraceCheckUtils]: 29: Hoare triple {69739#true} assume !(0 == ~cond); {69739#true} is VALID [2022-04-28 05:59:51,031 INFO L290 TraceCheckUtils]: 28: Hoare triple {69739#true} ~cond := #in~cond; {69739#true} is VALID [2022-04-28 05:59:51,031 INFO L272 TraceCheckUtils]: 27: Hoare triple {70021#(<= ~counter~0 10)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {69739#true} is VALID [2022-04-28 05:59:51,031 INFO L290 TraceCheckUtils]: 26: Hoare triple {70021#(<= ~counter~0 10)} assume !!(#t~post7 < 20);havoc #t~post7; {70021#(<= ~counter~0 10)} is VALID [2022-04-28 05:59:51,032 INFO L290 TraceCheckUtils]: 25: Hoare triple {69996#(<= ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {70021#(<= ~counter~0 10)} is VALID [2022-04-28 05:59:51,032 INFO L290 TraceCheckUtils]: 24: Hoare triple {69996#(<= ~counter~0 9)} assume !!(0 != ~r~0); {69996#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:51,033 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {69739#true} {69996#(<= ~counter~0 9)} #94#return; {69996#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:51,033 INFO L290 TraceCheckUtils]: 22: Hoare triple {69739#true} assume true; {69739#true} is VALID [2022-04-28 05:59:51,033 INFO L290 TraceCheckUtils]: 21: Hoare triple {69739#true} assume !(0 == ~cond); {69739#true} is VALID [2022-04-28 05:59:51,033 INFO L290 TraceCheckUtils]: 20: Hoare triple {69739#true} ~cond := #in~cond; {69739#true} is VALID [2022-04-28 05:59:51,033 INFO L272 TraceCheckUtils]: 19: Hoare triple {69996#(<= ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {69739#true} is VALID [2022-04-28 05:59:51,033 INFO L290 TraceCheckUtils]: 18: Hoare triple {69996#(<= ~counter~0 9)} assume !!(#t~post6 < 20);havoc #t~post6; {69996#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:51,034 INFO L290 TraceCheckUtils]: 17: Hoare triple {69971#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {69996#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:51,034 INFO L290 TraceCheckUtils]: 16: Hoare triple {69971#(<= ~counter~0 8)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {69971#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:51,035 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {69739#true} {69971#(<= ~counter~0 8)} #92#return; {69971#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:51,035 INFO L290 TraceCheckUtils]: 14: Hoare triple {69739#true} assume true; {69739#true} is VALID [2022-04-28 05:59:51,035 INFO L290 TraceCheckUtils]: 13: Hoare triple {69739#true} assume !(0 == ~cond); {69739#true} is VALID [2022-04-28 05:59:51,035 INFO L290 TraceCheckUtils]: 12: Hoare triple {69739#true} ~cond := #in~cond; {69739#true} is VALID [2022-04-28 05:59:51,035 INFO L272 TraceCheckUtils]: 11: Hoare triple {69971#(<= ~counter~0 8)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {69739#true} is VALID [2022-04-28 05:59:51,035 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {69739#true} {69971#(<= ~counter~0 8)} #90#return; {69971#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:51,035 INFO L290 TraceCheckUtils]: 9: Hoare triple {69739#true} assume true; {69739#true} is VALID [2022-04-28 05:59:51,035 INFO L290 TraceCheckUtils]: 8: Hoare triple {69739#true} assume !(0 == ~cond); {69739#true} is VALID [2022-04-28 05:59:51,036 INFO L290 TraceCheckUtils]: 7: Hoare triple {69739#true} ~cond := #in~cond; {69739#true} is VALID [2022-04-28 05:59:51,036 INFO L272 TraceCheckUtils]: 6: Hoare triple {69971#(<= ~counter~0 8)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {69739#true} is VALID [2022-04-28 05:59:51,051 INFO L290 TraceCheckUtils]: 5: Hoare triple {69971#(<= ~counter~0 8)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {69971#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:51,052 INFO L272 TraceCheckUtils]: 4: Hoare triple {69971#(<= ~counter~0 8)} call #t~ret9 := main(); {69971#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:51,052 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {69971#(<= ~counter~0 8)} {69739#true} #102#return; {69971#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:51,052 INFO L290 TraceCheckUtils]: 2: Hoare triple {69971#(<= ~counter~0 8)} assume true; {69971#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:51,053 INFO L290 TraceCheckUtils]: 1: Hoare triple {69739#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {69971#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:51,053 INFO L272 TraceCheckUtils]: 0: Hoare triple {69739#true} call ULTIMATE.init(); {69739#true} is VALID [2022-04-28 05:59:51,053 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 36 proven. 68 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2022-04-28 05:59:51,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:59:51,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287171189] [2022-04-28 05:59:51,053 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:59:51,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1203296083] [2022-04-28 05:59:51,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1203296083] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:59:51,054 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:59:51,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 24 [2022-04-28 05:59:51,054 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:59:51,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1975178946] [2022-04-28 05:59:51,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1975178946] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:59:51,054 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:59:51,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 05:59:51,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667631924] [2022-04-28 05:59:51,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:59:51,054 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.466666666666667) internal successors, (82), 14 states have internal predecessors, (82), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) Word has length 115 [2022-04-28 05:59:51,054 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:59:51,055 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 5.466666666666667) internal successors, (82), 14 states have internal predecessors, (82), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-28 05:59:51,161 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:59:51,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 05:59:51,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:59:51,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 05:59:51,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-28 05:59:51,161 INFO L87 Difference]: Start difference. First operand 578 states and 790 transitions. Second operand has 15 states, 15 states have (on average 5.466666666666667) internal successors, (82), 14 states have internal predecessors, (82), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-28 05:59:53,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:59:53,955 INFO L93 Difference]: Finished difference Result 791 states and 1114 transitions. [2022-04-28 05:59:53,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-28 05:59:53,955 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.466666666666667) internal successors, (82), 14 states have internal predecessors, (82), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) Word has length 115 [2022-04-28 05:59:53,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:59:53,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 5.466666666666667) internal successors, (82), 14 states have internal predecessors, (82), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-28 05:59:53,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 256 transitions. [2022-04-28 05:59:53,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 5.466666666666667) internal successors, (82), 14 states have internal predecessors, (82), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-28 05:59:53,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 256 transitions. [2022-04-28 05:59:53,960 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 256 transitions. [2022-04-28 05:59:54,197 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 256 edges. 256 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:59:54,214 INFO L225 Difference]: With dead ends: 791 [2022-04-28 05:59:54,215 INFO L226 Difference]: Without dead ends: 594 [2022-04-28 05:59:54,216 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 206 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=456, Invalid=666, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 05:59:54,216 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 137 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 05:59:54,216 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 290 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 05:59:54,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2022-04-28 05:59:55,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 594. [2022-04-28 05:59:55,986 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:59:55,986 INFO L82 GeneralOperation]: Start isEquivalent. First operand 594 states. Second operand has 594 states, 452 states have (on average 1.2256637168141593) internal successors, (554), 452 states have internal predecessors, (554), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 125 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-28 05:59:55,987 INFO L74 IsIncluded]: Start isIncluded. First operand 594 states. Second operand has 594 states, 452 states have (on average 1.2256637168141593) internal successors, (554), 452 states have internal predecessors, (554), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 125 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-28 05:59:55,987 INFO L87 Difference]: Start difference. First operand 594 states. Second operand has 594 states, 452 states have (on average 1.2256637168141593) internal successors, (554), 452 states have internal predecessors, (554), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 125 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-28 05:59:56,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:59:56,001 INFO L93 Difference]: Finished difference Result 594 states and 806 transitions. [2022-04-28 05:59:56,001 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 806 transitions. [2022-04-28 05:59:56,001 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:59:56,002 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:59:56,002 INFO L74 IsIncluded]: Start isIncluded. First operand has 594 states, 452 states have (on average 1.2256637168141593) internal successors, (554), 452 states have internal predecessors, (554), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 125 states have call predecessors, (125), 125 states have call successors, (125) Second operand 594 states. [2022-04-28 05:59:56,003 INFO L87 Difference]: Start difference. First operand has 594 states, 452 states have (on average 1.2256637168141593) internal successors, (554), 452 states have internal predecessors, (554), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 125 states have call predecessors, (125), 125 states have call successors, (125) Second operand 594 states. [2022-04-28 05:59:56,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:59:56,016 INFO L93 Difference]: Finished difference Result 594 states and 806 transitions. [2022-04-28 05:59:56,016 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 806 transitions. [2022-04-28 05:59:56,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:59:56,017 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:59:56,017 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:59:56,017 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:59:56,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 594 states, 452 states have (on average 1.2256637168141593) internal successors, (554), 452 states have internal predecessors, (554), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 125 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-28 05:59:56,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 806 transitions. [2022-04-28 05:59:56,036 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 806 transitions. Word has length 115 [2022-04-28 05:59:56,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:59:56,037 INFO L495 AbstractCegarLoop]: Abstraction has 594 states and 806 transitions. [2022-04-28 05:59:56,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.466666666666667) internal successors, (82), 14 states have internal predecessors, (82), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-28 05:59:56,037 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 594 states and 806 transitions. [2022-04-28 05:59:58,838 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 806 edges. 806 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:59:58,838 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 806 transitions. [2022-04-28 05:59:58,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-04-28 05:59:58,839 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:59:58,839 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 6, 6, 6, 6, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:59:58,843 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-04-28 05:59:59,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-04-28 05:59:59,040 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:59:59,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:59:59,040 INFO L85 PathProgramCache]: Analyzing trace with hash 650985841, now seen corresponding path program 7 times [2022-04-28 05:59:59,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:59:59,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [14902345] [2022-04-28 05:59:59,040 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:59:59,040 INFO L85 PathProgramCache]: Analyzing trace with hash 650985841, now seen corresponding path program 8 times [2022-04-28 05:59:59,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:59:59,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536116503] [2022-04-28 05:59:59,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:59:59,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:59:59,052 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:59:59,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1681973731] [2022-04-28 05:59:59,053 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:59:59,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:59:59,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:59:59,054 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:59:59,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-04-28 05:59:59,118 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:59:59,118 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:59:59,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-28 05:59:59,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:59:59,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:59:59,808 INFO L272 TraceCheckUtils]: 0: Hoare triple {74430#true} call ULTIMATE.init(); {74430#true} is VALID [2022-04-28 05:59:59,809 INFO L290 TraceCheckUtils]: 1: Hoare triple {74430#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {74438#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:59,809 INFO L290 TraceCheckUtils]: 2: Hoare triple {74438#(<= ~counter~0 0)} assume true; {74438#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:59,809 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {74438#(<= ~counter~0 0)} {74430#true} #102#return; {74438#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:59,810 INFO L272 TraceCheckUtils]: 4: Hoare triple {74438#(<= ~counter~0 0)} call #t~ret9 := main(); {74438#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:59,810 INFO L290 TraceCheckUtils]: 5: Hoare triple {74438#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {74438#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:59,810 INFO L272 TraceCheckUtils]: 6: Hoare triple {74438#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {74438#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:59,811 INFO L290 TraceCheckUtils]: 7: Hoare triple {74438#(<= ~counter~0 0)} ~cond := #in~cond; {74438#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:59,811 INFO L290 TraceCheckUtils]: 8: Hoare triple {74438#(<= ~counter~0 0)} assume !(0 == ~cond); {74438#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:59,811 INFO L290 TraceCheckUtils]: 9: Hoare triple {74438#(<= ~counter~0 0)} assume true; {74438#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:59,811 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {74438#(<= ~counter~0 0)} {74438#(<= ~counter~0 0)} #90#return; {74438#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:59,812 INFO L272 TraceCheckUtils]: 11: Hoare triple {74438#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {74438#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:59,812 INFO L290 TraceCheckUtils]: 12: Hoare triple {74438#(<= ~counter~0 0)} ~cond := #in~cond; {74438#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:59,812 INFO L290 TraceCheckUtils]: 13: Hoare triple {74438#(<= ~counter~0 0)} assume !(0 == ~cond); {74438#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:59,813 INFO L290 TraceCheckUtils]: 14: Hoare triple {74438#(<= ~counter~0 0)} assume true; {74438#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:59,813 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {74438#(<= ~counter~0 0)} {74438#(<= ~counter~0 0)} #92#return; {74438#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:59,813 INFO L290 TraceCheckUtils]: 16: Hoare triple {74438#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {74438#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:59,815 INFO L290 TraceCheckUtils]: 17: Hoare triple {74438#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {74487#(<= ~counter~0 1)} is VALID [2022-04-28 05:59:59,815 INFO L290 TraceCheckUtils]: 18: Hoare triple {74487#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {74487#(<= ~counter~0 1)} is VALID [2022-04-28 05:59:59,816 INFO L272 TraceCheckUtils]: 19: Hoare triple {74487#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {74487#(<= ~counter~0 1)} is VALID [2022-04-28 05:59:59,831 INFO L290 TraceCheckUtils]: 20: Hoare triple {74487#(<= ~counter~0 1)} ~cond := #in~cond; {74487#(<= ~counter~0 1)} is VALID [2022-04-28 05:59:59,832 INFO L290 TraceCheckUtils]: 21: Hoare triple {74487#(<= ~counter~0 1)} assume !(0 == ~cond); {74487#(<= ~counter~0 1)} is VALID [2022-04-28 05:59:59,832 INFO L290 TraceCheckUtils]: 22: Hoare triple {74487#(<= ~counter~0 1)} assume true; {74487#(<= ~counter~0 1)} is VALID [2022-04-28 05:59:59,833 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {74487#(<= ~counter~0 1)} {74487#(<= ~counter~0 1)} #94#return; {74487#(<= ~counter~0 1)} is VALID [2022-04-28 05:59:59,834 INFO L290 TraceCheckUtils]: 24: Hoare triple {74487#(<= ~counter~0 1)} assume !!(0 != ~r~0); {74487#(<= ~counter~0 1)} is VALID [2022-04-28 05:59:59,835 INFO L290 TraceCheckUtils]: 25: Hoare triple {74487#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {74512#(<= ~counter~0 2)} is VALID [2022-04-28 05:59:59,836 INFO L290 TraceCheckUtils]: 26: Hoare triple {74512#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {74512#(<= ~counter~0 2)} is VALID [2022-04-28 05:59:59,837 INFO L272 TraceCheckUtils]: 27: Hoare triple {74512#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {74512#(<= ~counter~0 2)} is VALID [2022-04-28 05:59:59,838 INFO L290 TraceCheckUtils]: 28: Hoare triple {74512#(<= ~counter~0 2)} ~cond := #in~cond; {74512#(<= ~counter~0 2)} is VALID [2022-04-28 05:59:59,838 INFO L290 TraceCheckUtils]: 29: Hoare triple {74512#(<= ~counter~0 2)} assume !(0 == ~cond); {74512#(<= ~counter~0 2)} is VALID [2022-04-28 05:59:59,839 INFO L290 TraceCheckUtils]: 30: Hoare triple {74512#(<= ~counter~0 2)} assume true; {74512#(<= ~counter~0 2)} is VALID [2022-04-28 05:59:59,840 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {74512#(<= ~counter~0 2)} {74512#(<= ~counter~0 2)} #96#return; {74512#(<= ~counter~0 2)} is VALID [2022-04-28 05:59:59,840 INFO L290 TraceCheckUtils]: 32: Hoare triple {74512#(<= ~counter~0 2)} assume !(~r~0 > 0); {74512#(<= ~counter~0 2)} is VALID [2022-04-28 05:59:59,841 INFO L290 TraceCheckUtils]: 33: Hoare triple {74512#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {74537#(<= ~counter~0 3)} is VALID [2022-04-28 05:59:59,842 INFO L290 TraceCheckUtils]: 34: Hoare triple {74537#(<= ~counter~0 3)} assume !!(#t~post8 < 20);havoc #t~post8; {74537#(<= ~counter~0 3)} is VALID [2022-04-28 05:59:59,843 INFO L272 TraceCheckUtils]: 35: Hoare triple {74537#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {74537#(<= ~counter~0 3)} is VALID [2022-04-28 05:59:59,843 INFO L290 TraceCheckUtils]: 36: Hoare triple {74537#(<= ~counter~0 3)} ~cond := #in~cond; {74537#(<= ~counter~0 3)} is VALID [2022-04-28 05:59:59,844 INFO L290 TraceCheckUtils]: 37: Hoare triple {74537#(<= ~counter~0 3)} assume !(0 == ~cond); {74537#(<= ~counter~0 3)} is VALID [2022-04-28 05:59:59,844 INFO L290 TraceCheckUtils]: 38: Hoare triple {74537#(<= ~counter~0 3)} assume true; {74537#(<= ~counter~0 3)} is VALID [2022-04-28 05:59:59,845 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {74537#(<= ~counter~0 3)} {74537#(<= ~counter~0 3)} #98#return; {74537#(<= ~counter~0 3)} is VALID [2022-04-28 05:59:59,846 INFO L290 TraceCheckUtils]: 40: Hoare triple {74537#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {74537#(<= ~counter~0 3)} is VALID [2022-04-28 05:59:59,847 INFO L290 TraceCheckUtils]: 41: Hoare triple {74537#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {74562#(<= ~counter~0 4)} is VALID [2022-04-28 05:59:59,847 INFO L290 TraceCheckUtils]: 42: Hoare triple {74562#(<= ~counter~0 4)} assume !!(#t~post8 < 20);havoc #t~post8; {74562#(<= ~counter~0 4)} is VALID [2022-04-28 05:59:59,848 INFO L272 TraceCheckUtils]: 43: Hoare triple {74562#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {74562#(<= ~counter~0 4)} is VALID [2022-04-28 05:59:59,849 INFO L290 TraceCheckUtils]: 44: Hoare triple {74562#(<= ~counter~0 4)} ~cond := #in~cond; {74562#(<= ~counter~0 4)} is VALID [2022-04-28 05:59:59,849 INFO L290 TraceCheckUtils]: 45: Hoare triple {74562#(<= ~counter~0 4)} assume !(0 == ~cond); {74562#(<= ~counter~0 4)} is VALID [2022-04-28 05:59:59,850 INFO L290 TraceCheckUtils]: 46: Hoare triple {74562#(<= ~counter~0 4)} assume true; {74562#(<= ~counter~0 4)} is VALID [2022-04-28 05:59:59,851 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {74562#(<= ~counter~0 4)} {74562#(<= ~counter~0 4)} #98#return; {74562#(<= ~counter~0 4)} is VALID [2022-04-28 05:59:59,851 INFO L290 TraceCheckUtils]: 48: Hoare triple {74562#(<= ~counter~0 4)} assume !(~r~0 < 0); {74562#(<= ~counter~0 4)} is VALID [2022-04-28 05:59:59,853 INFO L290 TraceCheckUtils]: 49: Hoare triple {74562#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {74587#(<= ~counter~0 5)} is VALID [2022-04-28 05:59:59,853 INFO L290 TraceCheckUtils]: 50: Hoare triple {74587#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {74587#(<= ~counter~0 5)} is VALID [2022-04-28 05:59:59,854 INFO L272 TraceCheckUtils]: 51: Hoare triple {74587#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {74587#(<= ~counter~0 5)} is VALID [2022-04-28 05:59:59,855 INFO L290 TraceCheckUtils]: 52: Hoare triple {74587#(<= ~counter~0 5)} ~cond := #in~cond; {74587#(<= ~counter~0 5)} is VALID [2022-04-28 05:59:59,855 INFO L290 TraceCheckUtils]: 53: Hoare triple {74587#(<= ~counter~0 5)} assume !(0 == ~cond); {74587#(<= ~counter~0 5)} is VALID [2022-04-28 05:59:59,856 INFO L290 TraceCheckUtils]: 54: Hoare triple {74587#(<= ~counter~0 5)} assume true; {74587#(<= ~counter~0 5)} is VALID [2022-04-28 05:59:59,857 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {74587#(<= ~counter~0 5)} {74587#(<= ~counter~0 5)} #94#return; {74587#(<= ~counter~0 5)} is VALID [2022-04-28 05:59:59,857 INFO L290 TraceCheckUtils]: 56: Hoare triple {74587#(<= ~counter~0 5)} assume !!(0 != ~r~0); {74587#(<= ~counter~0 5)} is VALID [2022-04-28 05:59:59,859 INFO L290 TraceCheckUtils]: 57: Hoare triple {74587#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {74612#(<= ~counter~0 6)} is VALID [2022-04-28 05:59:59,859 INFO L290 TraceCheckUtils]: 58: Hoare triple {74612#(<= ~counter~0 6)} assume !!(#t~post7 < 20);havoc #t~post7; {74612#(<= ~counter~0 6)} is VALID [2022-04-28 05:59:59,860 INFO L272 TraceCheckUtils]: 59: Hoare triple {74612#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {74612#(<= ~counter~0 6)} is VALID [2022-04-28 05:59:59,860 INFO L290 TraceCheckUtils]: 60: Hoare triple {74612#(<= ~counter~0 6)} ~cond := #in~cond; {74612#(<= ~counter~0 6)} is VALID [2022-04-28 05:59:59,860 INFO L290 TraceCheckUtils]: 61: Hoare triple {74612#(<= ~counter~0 6)} assume !(0 == ~cond); {74612#(<= ~counter~0 6)} is VALID [2022-04-28 05:59:59,861 INFO L290 TraceCheckUtils]: 62: Hoare triple {74612#(<= ~counter~0 6)} assume true; {74612#(<= ~counter~0 6)} is VALID [2022-04-28 05:59:59,861 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {74612#(<= ~counter~0 6)} {74612#(<= ~counter~0 6)} #96#return; {74612#(<= ~counter~0 6)} is VALID [2022-04-28 05:59:59,862 INFO L290 TraceCheckUtils]: 64: Hoare triple {74612#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {74612#(<= ~counter~0 6)} is VALID [2022-04-28 05:59:59,863 INFO L290 TraceCheckUtils]: 65: Hoare triple {74612#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {74637#(<= ~counter~0 7)} is VALID [2022-04-28 05:59:59,863 INFO L290 TraceCheckUtils]: 66: Hoare triple {74637#(<= ~counter~0 7)} assume !!(#t~post7 < 20);havoc #t~post7; {74637#(<= ~counter~0 7)} is VALID [2022-04-28 05:59:59,864 INFO L272 TraceCheckUtils]: 67: Hoare triple {74637#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {74637#(<= ~counter~0 7)} is VALID [2022-04-28 05:59:59,864 INFO L290 TraceCheckUtils]: 68: Hoare triple {74637#(<= ~counter~0 7)} ~cond := #in~cond; {74637#(<= ~counter~0 7)} is VALID [2022-04-28 05:59:59,864 INFO L290 TraceCheckUtils]: 69: Hoare triple {74637#(<= ~counter~0 7)} assume !(0 == ~cond); {74637#(<= ~counter~0 7)} is VALID [2022-04-28 05:59:59,865 INFO L290 TraceCheckUtils]: 70: Hoare triple {74637#(<= ~counter~0 7)} assume true; {74637#(<= ~counter~0 7)} is VALID [2022-04-28 05:59:59,865 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {74637#(<= ~counter~0 7)} {74637#(<= ~counter~0 7)} #96#return; {74637#(<= ~counter~0 7)} is VALID [2022-04-28 05:59:59,866 INFO L290 TraceCheckUtils]: 72: Hoare triple {74637#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {74637#(<= ~counter~0 7)} is VALID [2022-04-28 05:59:59,866 INFO L290 TraceCheckUtils]: 73: Hoare triple {74637#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {74662#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:59,867 INFO L290 TraceCheckUtils]: 74: Hoare triple {74662#(<= ~counter~0 8)} assume !!(#t~post7 < 20);havoc #t~post7; {74662#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:59,867 INFO L272 TraceCheckUtils]: 75: Hoare triple {74662#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {74662#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:59,868 INFO L290 TraceCheckUtils]: 76: Hoare triple {74662#(<= ~counter~0 8)} ~cond := #in~cond; {74662#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:59,868 INFO L290 TraceCheckUtils]: 77: Hoare triple {74662#(<= ~counter~0 8)} assume !(0 == ~cond); {74662#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:59,868 INFO L290 TraceCheckUtils]: 78: Hoare triple {74662#(<= ~counter~0 8)} assume true; {74662#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:59,869 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {74662#(<= ~counter~0 8)} {74662#(<= ~counter~0 8)} #96#return; {74662#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:59,869 INFO L290 TraceCheckUtils]: 80: Hoare triple {74662#(<= ~counter~0 8)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {74662#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:59,870 INFO L290 TraceCheckUtils]: 81: Hoare triple {74662#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {74687#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:59,871 INFO L290 TraceCheckUtils]: 82: Hoare triple {74687#(<= ~counter~0 9)} assume !!(#t~post7 < 20);havoc #t~post7; {74687#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:59,871 INFO L272 TraceCheckUtils]: 83: Hoare triple {74687#(<= ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {74687#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:59,872 INFO L290 TraceCheckUtils]: 84: Hoare triple {74687#(<= ~counter~0 9)} ~cond := #in~cond; {74687#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:59,872 INFO L290 TraceCheckUtils]: 85: Hoare triple {74687#(<= ~counter~0 9)} assume !(0 == ~cond); {74687#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:59,872 INFO L290 TraceCheckUtils]: 86: Hoare triple {74687#(<= ~counter~0 9)} assume true; {74687#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:59,873 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {74687#(<= ~counter~0 9)} {74687#(<= ~counter~0 9)} #96#return; {74687#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:59,873 INFO L290 TraceCheckUtils]: 88: Hoare triple {74687#(<= ~counter~0 9)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {74687#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:59,874 INFO L290 TraceCheckUtils]: 89: Hoare triple {74687#(<= ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {74712#(<= ~counter~0 10)} is VALID [2022-04-28 05:59:59,874 INFO L290 TraceCheckUtils]: 90: Hoare triple {74712#(<= ~counter~0 10)} assume !!(#t~post7 < 20);havoc #t~post7; {74712#(<= ~counter~0 10)} is VALID [2022-04-28 05:59:59,875 INFO L272 TraceCheckUtils]: 91: Hoare triple {74712#(<= ~counter~0 10)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {74712#(<= ~counter~0 10)} is VALID [2022-04-28 05:59:59,875 INFO L290 TraceCheckUtils]: 92: Hoare triple {74712#(<= ~counter~0 10)} ~cond := #in~cond; {74712#(<= ~counter~0 10)} is VALID [2022-04-28 05:59:59,876 INFO L290 TraceCheckUtils]: 93: Hoare triple {74712#(<= ~counter~0 10)} assume !(0 == ~cond); {74712#(<= ~counter~0 10)} is VALID [2022-04-28 05:59:59,876 INFO L290 TraceCheckUtils]: 94: Hoare triple {74712#(<= ~counter~0 10)} assume true; {74712#(<= ~counter~0 10)} is VALID [2022-04-28 05:59:59,877 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {74712#(<= ~counter~0 10)} {74712#(<= ~counter~0 10)} #96#return; {74712#(<= ~counter~0 10)} is VALID [2022-04-28 05:59:59,877 INFO L290 TraceCheckUtils]: 96: Hoare triple {74712#(<= ~counter~0 10)} assume !(~r~0 > 0); {74712#(<= ~counter~0 10)} is VALID [2022-04-28 05:59:59,878 INFO L290 TraceCheckUtils]: 97: Hoare triple {74712#(<= ~counter~0 10)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {74737#(<= ~counter~0 11)} is VALID [2022-04-28 05:59:59,878 INFO L290 TraceCheckUtils]: 98: Hoare triple {74737#(<= ~counter~0 11)} assume !!(#t~post8 < 20);havoc #t~post8; {74737#(<= ~counter~0 11)} is VALID [2022-04-28 05:59:59,879 INFO L272 TraceCheckUtils]: 99: Hoare triple {74737#(<= ~counter~0 11)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {74737#(<= ~counter~0 11)} is VALID [2022-04-28 05:59:59,879 INFO L290 TraceCheckUtils]: 100: Hoare triple {74737#(<= ~counter~0 11)} ~cond := #in~cond; {74737#(<= ~counter~0 11)} is VALID [2022-04-28 05:59:59,879 INFO L290 TraceCheckUtils]: 101: Hoare triple {74737#(<= ~counter~0 11)} assume !(0 == ~cond); {74737#(<= ~counter~0 11)} is VALID [2022-04-28 05:59:59,880 INFO L290 TraceCheckUtils]: 102: Hoare triple {74737#(<= ~counter~0 11)} assume true; {74737#(<= ~counter~0 11)} is VALID [2022-04-28 05:59:59,880 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {74737#(<= ~counter~0 11)} {74737#(<= ~counter~0 11)} #98#return; {74737#(<= ~counter~0 11)} is VALID [2022-04-28 05:59:59,881 INFO L290 TraceCheckUtils]: 104: Hoare triple {74737#(<= ~counter~0 11)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {74737#(<= ~counter~0 11)} is VALID [2022-04-28 05:59:59,882 INFO L290 TraceCheckUtils]: 105: Hoare triple {74737#(<= ~counter~0 11)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {74762#(<= ~counter~0 12)} is VALID [2022-04-28 05:59:59,882 INFO L290 TraceCheckUtils]: 106: Hoare triple {74762#(<= ~counter~0 12)} assume !!(#t~post8 < 20);havoc #t~post8; {74762#(<= ~counter~0 12)} is VALID [2022-04-28 05:59:59,883 INFO L272 TraceCheckUtils]: 107: Hoare triple {74762#(<= ~counter~0 12)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {74762#(<= ~counter~0 12)} is VALID [2022-04-28 05:59:59,883 INFO L290 TraceCheckUtils]: 108: Hoare triple {74762#(<= ~counter~0 12)} ~cond := #in~cond; {74762#(<= ~counter~0 12)} is VALID [2022-04-28 05:59:59,883 INFO L290 TraceCheckUtils]: 109: Hoare triple {74762#(<= ~counter~0 12)} assume !(0 == ~cond); {74762#(<= ~counter~0 12)} is VALID [2022-04-28 05:59:59,884 INFO L290 TraceCheckUtils]: 110: Hoare triple {74762#(<= ~counter~0 12)} assume true; {74762#(<= ~counter~0 12)} is VALID [2022-04-28 05:59:59,884 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {74762#(<= ~counter~0 12)} {74762#(<= ~counter~0 12)} #98#return; {74762#(<= ~counter~0 12)} is VALID [2022-04-28 05:59:59,884 INFO L290 TraceCheckUtils]: 112: Hoare triple {74762#(<= ~counter~0 12)} assume !(~r~0 < 0); {74762#(<= ~counter~0 12)} is VALID [2022-04-28 05:59:59,885 INFO L290 TraceCheckUtils]: 113: Hoare triple {74762#(<= ~counter~0 12)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {74787#(<= |main_#t~post6| 12)} is VALID [2022-04-28 05:59:59,885 INFO L290 TraceCheckUtils]: 114: Hoare triple {74787#(<= |main_#t~post6| 12)} assume !(#t~post6 < 20);havoc #t~post6; {74431#false} is VALID [2022-04-28 05:59:59,885 INFO L272 TraceCheckUtils]: 115: Hoare triple {74431#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {74431#false} is VALID [2022-04-28 05:59:59,885 INFO L290 TraceCheckUtils]: 116: Hoare triple {74431#false} ~cond := #in~cond; {74431#false} is VALID [2022-04-28 05:59:59,886 INFO L290 TraceCheckUtils]: 117: Hoare triple {74431#false} assume 0 == ~cond; {74431#false} is VALID [2022-04-28 05:59:59,886 INFO L290 TraceCheckUtils]: 118: Hoare triple {74431#false} assume !false; {74431#false} is VALID [2022-04-28 05:59:59,886 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 24 proven. 356 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 05:59:59,886 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 06:00:00,535 INFO L290 TraceCheckUtils]: 118: Hoare triple {74431#false} assume !false; {74431#false} is VALID [2022-04-28 06:00:00,536 INFO L290 TraceCheckUtils]: 117: Hoare triple {74431#false} assume 0 == ~cond; {74431#false} is VALID [2022-04-28 06:00:00,536 INFO L290 TraceCheckUtils]: 116: Hoare triple {74431#false} ~cond := #in~cond; {74431#false} is VALID [2022-04-28 06:00:00,536 INFO L272 TraceCheckUtils]: 115: Hoare triple {74431#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {74431#false} is VALID [2022-04-28 06:00:00,536 INFO L290 TraceCheckUtils]: 114: Hoare triple {74815#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {74431#false} is VALID [2022-04-28 06:00:00,537 INFO L290 TraceCheckUtils]: 113: Hoare triple {74819#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {74815#(< |main_#t~post6| 20)} is VALID [2022-04-28 06:00:00,537 INFO L290 TraceCheckUtils]: 112: Hoare triple {74819#(< ~counter~0 20)} assume !(~r~0 < 0); {74819#(< ~counter~0 20)} is VALID [2022-04-28 06:00:00,538 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {74430#true} {74819#(< ~counter~0 20)} #98#return; {74819#(< ~counter~0 20)} is VALID [2022-04-28 06:00:00,538 INFO L290 TraceCheckUtils]: 110: Hoare triple {74430#true} assume true; {74430#true} is VALID [2022-04-28 06:00:00,538 INFO L290 TraceCheckUtils]: 109: Hoare triple {74430#true} assume !(0 == ~cond); {74430#true} is VALID [2022-04-28 06:00:00,538 INFO L290 TraceCheckUtils]: 108: Hoare triple {74430#true} ~cond := #in~cond; {74430#true} is VALID [2022-04-28 06:00:00,538 INFO L272 TraceCheckUtils]: 107: Hoare triple {74819#(< ~counter~0 20)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {74430#true} is VALID [2022-04-28 06:00:00,538 INFO L290 TraceCheckUtils]: 106: Hoare triple {74819#(< ~counter~0 20)} assume !!(#t~post8 < 20);havoc #t~post8; {74819#(< ~counter~0 20)} is VALID [2022-04-28 06:00:00,540 INFO L290 TraceCheckUtils]: 105: Hoare triple {74844#(< ~counter~0 19)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {74819#(< ~counter~0 20)} is VALID [2022-04-28 06:00:00,540 INFO L290 TraceCheckUtils]: 104: Hoare triple {74844#(< ~counter~0 19)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {74844#(< ~counter~0 19)} is VALID [2022-04-28 06:00:00,541 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {74430#true} {74844#(< ~counter~0 19)} #98#return; {74844#(< ~counter~0 19)} is VALID [2022-04-28 06:00:00,541 INFO L290 TraceCheckUtils]: 102: Hoare triple {74430#true} assume true; {74430#true} is VALID [2022-04-28 06:00:00,541 INFO L290 TraceCheckUtils]: 101: Hoare triple {74430#true} assume !(0 == ~cond); {74430#true} is VALID [2022-04-28 06:00:00,541 INFO L290 TraceCheckUtils]: 100: Hoare triple {74430#true} ~cond := #in~cond; {74430#true} is VALID [2022-04-28 06:00:00,541 INFO L272 TraceCheckUtils]: 99: Hoare triple {74844#(< ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {74430#true} is VALID [2022-04-28 06:00:00,542 INFO L290 TraceCheckUtils]: 98: Hoare triple {74844#(< ~counter~0 19)} assume !!(#t~post8 < 20);havoc #t~post8; {74844#(< ~counter~0 19)} is VALID [2022-04-28 06:00:00,543 INFO L290 TraceCheckUtils]: 97: Hoare triple {74869#(< ~counter~0 18)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {74844#(< ~counter~0 19)} is VALID [2022-04-28 06:00:00,543 INFO L290 TraceCheckUtils]: 96: Hoare triple {74869#(< ~counter~0 18)} assume !(~r~0 > 0); {74869#(< ~counter~0 18)} is VALID [2022-04-28 06:00:00,544 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {74430#true} {74869#(< ~counter~0 18)} #96#return; {74869#(< ~counter~0 18)} is VALID [2022-04-28 06:00:00,544 INFO L290 TraceCheckUtils]: 94: Hoare triple {74430#true} assume true; {74430#true} is VALID [2022-04-28 06:00:00,544 INFO L290 TraceCheckUtils]: 93: Hoare triple {74430#true} assume !(0 == ~cond); {74430#true} is VALID [2022-04-28 06:00:00,544 INFO L290 TraceCheckUtils]: 92: Hoare triple {74430#true} ~cond := #in~cond; {74430#true} is VALID [2022-04-28 06:00:00,544 INFO L272 TraceCheckUtils]: 91: Hoare triple {74869#(< ~counter~0 18)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {74430#true} is VALID [2022-04-28 06:00:00,544 INFO L290 TraceCheckUtils]: 90: Hoare triple {74869#(< ~counter~0 18)} assume !!(#t~post7 < 20);havoc #t~post7; {74869#(< ~counter~0 18)} is VALID [2022-04-28 06:00:00,545 INFO L290 TraceCheckUtils]: 89: Hoare triple {74894#(< ~counter~0 17)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {74869#(< ~counter~0 18)} is VALID [2022-04-28 06:00:00,545 INFO L290 TraceCheckUtils]: 88: Hoare triple {74894#(< ~counter~0 17)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {74894#(< ~counter~0 17)} is VALID [2022-04-28 06:00:00,546 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {74430#true} {74894#(< ~counter~0 17)} #96#return; {74894#(< ~counter~0 17)} is VALID [2022-04-28 06:00:00,546 INFO L290 TraceCheckUtils]: 86: Hoare triple {74430#true} assume true; {74430#true} is VALID [2022-04-28 06:00:00,546 INFO L290 TraceCheckUtils]: 85: Hoare triple {74430#true} assume !(0 == ~cond); {74430#true} is VALID [2022-04-28 06:00:00,546 INFO L290 TraceCheckUtils]: 84: Hoare triple {74430#true} ~cond := #in~cond; {74430#true} is VALID [2022-04-28 06:00:00,546 INFO L272 TraceCheckUtils]: 83: Hoare triple {74894#(< ~counter~0 17)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {74430#true} is VALID [2022-04-28 06:00:00,547 INFO L290 TraceCheckUtils]: 82: Hoare triple {74894#(< ~counter~0 17)} assume !!(#t~post7 < 20);havoc #t~post7; {74894#(< ~counter~0 17)} is VALID [2022-04-28 06:00:00,548 INFO L290 TraceCheckUtils]: 81: Hoare triple {74919#(< ~counter~0 16)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {74894#(< ~counter~0 17)} is VALID [2022-04-28 06:00:00,548 INFO L290 TraceCheckUtils]: 80: Hoare triple {74919#(< ~counter~0 16)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {74919#(< ~counter~0 16)} is VALID [2022-04-28 06:00:00,549 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {74430#true} {74919#(< ~counter~0 16)} #96#return; {74919#(< ~counter~0 16)} is VALID [2022-04-28 06:00:00,549 INFO L290 TraceCheckUtils]: 78: Hoare triple {74430#true} assume true; {74430#true} is VALID [2022-04-28 06:00:00,549 INFO L290 TraceCheckUtils]: 77: Hoare triple {74430#true} assume !(0 == ~cond); {74430#true} is VALID [2022-04-28 06:00:00,549 INFO L290 TraceCheckUtils]: 76: Hoare triple {74430#true} ~cond := #in~cond; {74430#true} is VALID [2022-04-28 06:00:00,549 INFO L272 TraceCheckUtils]: 75: Hoare triple {74919#(< ~counter~0 16)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {74430#true} is VALID [2022-04-28 06:00:00,549 INFO L290 TraceCheckUtils]: 74: Hoare triple {74919#(< ~counter~0 16)} assume !!(#t~post7 < 20);havoc #t~post7; {74919#(< ~counter~0 16)} is VALID [2022-04-28 06:00:00,550 INFO L290 TraceCheckUtils]: 73: Hoare triple {74944#(< ~counter~0 15)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {74919#(< ~counter~0 16)} is VALID [2022-04-28 06:00:00,551 INFO L290 TraceCheckUtils]: 72: Hoare triple {74944#(< ~counter~0 15)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {74944#(< ~counter~0 15)} is VALID [2022-04-28 06:00:00,551 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {74430#true} {74944#(< ~counter~0 15)} #96#return; {74944#(< ~counter~0 15)} is VALID [2022-04-28 06:00:00,551 INFO L290 TraceCheckUtils]: 70: Hoare triple {74430#true} assume true; {74430#true} is VALID [2022-04-28 06:00:00,551 INFO L290 TraceCheckUtils]: 69: Hoare triple {74430#true} assume !(0 == ~cond); {74430#true} is VALID [2022-04-28 06:00:00,552 INFO L290 TraceCheckUtils]: 68: Hoare triple {74430#true} ~cond := #in~cond; {74430#true} is VALID [2022-04-28 06:00:00,552 INFO L272 TraceCheckUtils]: 67: Hoare triple {74944#(< ~counter~0 15)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {74430#true} is VALID [2022-04-28 06:00:00,552 INFO L290 TraceCheckUtils]: 66: Hoare triple {74944#(< ~counter~0 15)} assume !!(#t~post7 < 20);havoc #t~post7; {74944#(< ~counter~0 15)} is VALID [2022-04-28 06:00:00,553 INFO L290 TraceCheckUtils]: 65: Hoare triple {74969#(< ~counter~0 14)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {74944#(< ~counter~0 15)} is VALID [2022-04-28 06:00:00,553 INFO L290 TraceCheckUtils]: 64: Hoare triple {74969#(< ~counter~0 14)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {74969#(< ~counter~0 14)} is VALID [2022-04-28 06:00:00,554 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {74430#true} {74969#(< ~counter~0 14)} #96#return; {74969#(< ~counter~0 14)} is VALID [2022-04-28 06:00:00,554 INFO L290 TraceCheckUtils]: 62: Hoare triple {74430#true} assume true; {74430#true} is VALID [2022-04-28 06:00:00,554 INFO L290 TraceCheckUtils]: 61: Hoare triple {74430#true} assume !(0 == ~cond); {74430#true} is VALID [2022-04-28 06:00:00,554 INFO L290 TraceCheckUtils]: 60: Hoare triple {74430#true} ~cond := #in~cond; {74430#true} is VALID [2022-04-28 06:00:00,554 INFO L272 TraceCheckUtils]: 59: Hoare triple {74969#(< ~counter~0 14)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {74430#true} is VALID [2022-04-28 06:00:00,555 INFO L290 TraceCheckUtils]: 58: Hoare triple {74969#(< ~counter~0 14)} assume !!(#t~post7 < 20);havoc #t~post7; {74969#(< ~counter~0 14)} is VALID [2022-04-28 06:00:00,556 INFO L290 TraceCheckUtils]: 57: Hoare triple {74762#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {74969#(< ~counter~0 14)} is VALID [2022-04-28 06:00:00,556 INFO L290 TraceCheckUtils]: 56: Hoare triple {74762#(<= ~counter~0 12)} assume !!(0 != ~r~0); {74762#(<= ~counter~0 12)} is VALID [2022-04-28 06:00:00,557 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {74430#true} {74762#(<= ~counter~0 12)} #94#return; {74762#(<= ~counter~0 12)} is VALID [2022-04-28 06:00:00,557 INFO L290 TraceCheckUtils]: 54: Hoare triple {74430#true} assume true; {74430#true} is VALID [2022-04-28 06:00:00,557 INFO L290 TraceCheckUtils]: 53: Hoare triple {74430#true} assume !(0 == ~cond); {74430#true} is VALID [2022-04-28 06:00:00,557 INFO L290 TraceCheckUtils]: 52: Hoare triple {74430#true} ~cond := #in~cond; {74430#true} is VALID [2022-04-28 06:00:00,557 INFO L272 TraceCheckUtils]: 51: Hoare triple {74762#(<= ~counter~0 12)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {74430#true} is VALID [2022-04-28 06:00:00,557 INFO L290 TraceCheckUtils]: 50: Hoare triple {74762#(<= ~counter~0 12)} assume !!(#t~post6 < 20);havoc #t~post6; {74762#(<= ~counter~0 12)} is VALID [2022-04-28 06:00:00,558 INFO L290 TraceCheckUtils]: 49: Hoare triple {74737#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {74762#(<= ~counter~0 12)} is VALID [2022-04-28 06:00:00,559 INFO L290 TraceCheckUtils]: 48: Hoare triple {74737#(<= ~counter~0 11)} assume !(~r~0 < 0); {74737#(<= ~counter~0 11)} is VALID [2022-04-28 06:00:00,559 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {74430#true} {74737#(<= ~counter~0 11)} #98#return; {74737#(<= ~counter~0 11)} is VALID [2022-04-28 06:00:00,560 INFO L290 TraceCheckUtils]: 46: Hoare triple {74430#true} assume true; {74430#true} is VALID [2022-04-28 06:00:00,560 INFO L290 TraceCheckUtils]: 45: Hoare triple {74430#true} assume !(0 == ~cond); {74430#true} is VALID [2022-04-28 06:00:00,560 INFO L290 TraceCheckUtils]: 44: Hoare triple {74430#true} ~cond := #in~cond; {74430#true} is VALID [2022-04-28 06:00:00,560 INFO L272 TraceCheckUtils]: 43: Hoare triple {74737#(<= ~counter~0 11)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {74430#true} is VALID [2022-04-28 06:00:00,560 INFO L290 TraceCheckUtils]: 42: Hoare triple {74737#(<= ~counter~0 11)} assume !!(#t~post8 < 20);havoc #t~post8; {74737#(<= ~counter~0 11)} is VALID [2022-04-28 06:00:00,561 INFO L290 TraceCheckUtils]: 41: Hoare triple {74712#(<= ~counter~0 10)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {74737#(<= ~counter~0 11)} is VALID [2022-04-28 06:00:00,561 INFO L290 TraceCheckUtils]: 40: Hoare triple {74712#(<= ~counter~0 10)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {74712#(<= ~counter~0 10)} is VALID [2022-04-28 06:00:00,563 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {74430#true} {74712#(<= ~counter~0 10)} #98#return; {74712#(<= ~counter~0 10)} is VALID [2022-04-28 06:00:00,563 INFO L290 TraceCheckUtils]: 38: Hoare triple {74430#true} assume true; {74430#true} is VALID [2022-04-28 06:00:00,563 INFO L290 TraceCheckUtils]: 37: Hoare triple {74430#true} assume !(0 == ~cond); {74430#true} is VALID [2022-04-28 06:00:00,563 INFO L290 TraceCheckUtils]: 36: Hoare triple {74430#true} ~cond := #in~cond; {74430#true} is VALID [2022-04-28 06:00:00,563 INFO L272 TraceCheckUtils]: 35: Hoare triple {74712#(<= ~counter~0 10)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {74430#true} is VALID [2022-04-28 06:00:00,563 INFO L290 TraceCheckUtils]: 34: Hoare triple {74712#(<= ~counter~0 10)} assume !!(#t~post8 < 20);havoc #t~post8; {74712#(<= ~counter~0 10)} is VALID [2022-04-28 06:00:00,564 INFO L290 TraceCheckUtils]: 33: Hoare triple {74687#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {74712#(<= ~counter~0 10)} is VALID [2022-04-28 06:00:00,565 INFO L290 TraceCheckUtils]: 32: Hoare triple {74687#(<= ~counter~0 9)} assume !(~r~0 > 0); {74687#(<= ~counter~0 9)} is VALID [2022-04-28 06:00:00,565 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {74430#true} {74687#(<= ~counter~0 9)} #96#return; {74687#(<= ~counter~0 9)} is VALID [2022-04-28 06:00:00,566 INFO L290 TraceCheckUtils]: 30: Hoare triple {74430#true} assume true; {74430#true} is VALID [2022-04-28 06:00:00,566 INFO L290 TraceCheckUtils]: 29: Hoare triple {74430#true} assume !(0 == ~cond); {74430#true} is VALID [2022-04-28 06:00:00,566 INFO L290 TraceCheckUtils]: 28: Hoare triple {74430#true} ~cond := #in~cond; {74430#true} is VALID [2022-04-28 06:00:00,566 INFO L272 TraceCheckUtils]: 27: Hoare triple {74687#(<= ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {74430#true} is VALID [2022-04-28 06:00:00,566 INFO L290 TraceCheckUtils]: 26: Hoare triple {74687#(<= ~counter~0 9)} assume !!(#t~post7 < 20);havoc #t~post7; {74687#(<= ~counter~0 9)} is VALID [2022-04-28 06:00:00,567 INFO L290 TraceCheckUtils]: 25: Hoare triple {74662#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {74687#(<= ~counter~0 9)} is VALID [2022-04-28 06:00:00,567 INFO L290 TraceCheckUtils]: 24: Hoare triple {74662#(<= ~counter~0 8)} assume !!(0 != ~r~0); {74662#(<= ~counter~0 8)} is VALID [2022-04-28 06:00:00,568 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {74430#true} {74662#(<= ~counter~0 8)} #94#return; {74662#(<= ~counter~0 8)} is VALID [2022-04-28 06:00:00,568 INFO L290 TraceCheckUtils]: 22: Hoare triple {74430#true} assume true; {74430#true} is VALID [2022-04-28 06:00:00,568 INFO L290 TraceCheckUtils]: 21: Hoare triple {74430#true} assume !(0 == ~cond); {74430#true} is VALID [2022-04-28 06:00:00,568 INFO L290 TraceCheckUtils]: 20: Hoare triple {74430#true} ~cond := #in~cond; {74430#true} is VALID [2022-04-28 06:00:00,569 INFO L272 TraceCheckUtils]: 19: Hoare triple {74662#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {74430#true} is VALID [2022-04-28 06:00:00,569 INFO L290 TraceCheckUtils]: 18: Hoare triple {74662#(<= ~counter~0 8)} assume !!(#t~post6 < 20);havoc #t~post6; {74662#(<= ~counter~0 8)} is VALID [2022-04-28 06:00:00,570 INFO L290 TraceCheckUtils]: 17: Hoare triple {74637#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {74662#(<= ~counter~0 8)} is VALID [2022-04-28 06:00:00,570 INFO L290 TraceCheckUtils]: 16: Hoare triple {74637#(<= ~counter~0 7)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {74637#(<= ~counter~0 7)} is VALID [2022-04-28 06:00:00,571 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {74430#true} {74637#(<= ~counter~0 7)} #92#return; {74637#(<= ~counter~0 7)} is VALID [2022-04-28 06:00:00,571 INFO L290 TraceCheckUtils]: 14: Hoare triple {74430#true} assume true; {74430#true} is VALID [2022-04-28 06:00:00,571 INFO L290 TraceCheckUtils]: 13: Hoare triple {74430#true} assume !(0 == ~cond); {74430#true} is VALID [2022-04-28 06:00:00,571 INFO L290 TraceCheckUtils]: 12: Hoare triple {74430#true} ~cond := #in~cond; {74430#true} is VALID [2022-04-28 06:00:00,571 INFO L272 TraceCheckUtils]: 11: Hoare triple {74637#(<= ~counter~0 7)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {74430#true} is VALID [2022-04-28 06:00:00,572 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {74430#true} {74637#(<= ~counter~0 7)} #90#return; {74637#(<= ~counter~0 7)} is VALID [2022-04-28 06:00:00,572 INFO L290 TraceCheckUtils]: 9: Hoare triple {74430#true} assume true; {74430#true} is VALID [2022-04-28 06:00:00,572 INFO L290 TraceCheckUtils]: 8: Hoare triple {74430#true} assume !(0 == ~cond); {74430#true} is VALID [2022-04-28 06:00:00,572 INFO L290 TraceCheckUtils]: 7: Hoare triple {74430#true} ~cond := #in~cond; {74430#true} is VALID [2022-04-28 06:00:00,572 INFO L272 TraceCheckUtils]: 6: Hoare triple {74637#(<= ~counter~0 7)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {74430#true} is VALID [2022-04-28 06:00:00,572 INFO L290 TraceCheckUtils]: 5: Hoare triple {74637#(<= ~counter~0 7)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {74637#(<= ~counter~0 7)} is VALID [2022-04-28 06:00:00,573 INFO L272 TraceCheckUtils]: 4: Hoare triple {74637#(<= ~counter~0 7)} call #t~ret9 := main(); {74637#(<= ~counter~0 7)} is VALID [2022-04-28 06:00:00,573 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {74637#(<= ~counter~0 7)} {74430#true} #102#return; {74637#(<= ~counter~0 7)} is VALID [2022-04-28 06:00:00,574 INFO L290 TraceCheckUtils]: 2: Hoare triple {74637#(<= ~counter~0 7)} assume true; {74637#(<= ~counter~0 7)} is VALID [2022-04-28 06:00:00,574 INFO L290 TraceCheckUtils]: 1: Hoare triple {74430#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {74637#(<= ~counter~0 7)} is VALID [2022-04-28 06:00:00,574 INFO L272 TraceCheckUtils]: 0: Hoare triple {74430#true} call ULTIMATE.init(); {74430#true} is VALID [2022-04-28 06:00:00,575 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 24 proven. 92 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2022-04-28 06:00:00,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:00:00,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536116503] [2022-04-28 06:00:00,575 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:00:00,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1681973731] [2022-04-28 06:00:00,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1681973731] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 06:00:00,575 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 06:00:00,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 24 [2022-04-28 06:00:00,576 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:00:00,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [14902345] [2022-04-28 06:00:00,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [14902345] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:00:00,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:00:00,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 06:00:00,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917872226] [2022-04-28 06:00:00,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:00:00,579 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.25) internal successors, (84), 15 states have internal predecessors, (84), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) Word has length 119 [2022-04-28 06:00:00,579 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:00:00,579 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 5.25) internal successors, (84), 15 states have internal predecessors, (84), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-28 06:00:00,717 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:00:00,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 06:00:00,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:00:00,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 06:00:00,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-28 06:00:00,718 INFO L87 Difference]: Start difference. First operand 594 states and 806 transitions. Second operand has 16 states, 16 states have (on average 5.25) internal successors, (84), 15 states have internal predecessors, (84), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-28 06:00:03,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:00:03,754 INFO L93 Difference]: Finished difference Result 649 states and 883 transitions. [2022-04-28 06:00:03,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-28 06:00:03,754 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.25) internal successors, (84), 15 states have internal predecessors, (84), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) Word has length 119 [2022-04-28 06:00:03,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:00:03,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 5.25) internal successors, (84), 15 states have internal predecessors, (84), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-28 06:00:03,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 254 transitions. [2022-04-28 06:00:03,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 5.25) internal successors, (84), 15 states have internal predecessors, (84), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-28 06:00:03,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 254 transitions. [2022-04-28 06:00:03,758 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 254 transitions. [2022-04-28 06:00:03,983 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 254 edges. 254 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:00:04,003 INFO L225 Difference]: With dead ends: 649 [2022-04-28 06:00:04,003 INFO L226 Difference]: Without dead ends: 638 [2022-04-28 06:00:04,004 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 214 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=419, Invalid=637, Unknown=0, NotChecked=0, Total=1056 [2022-04-28 06:00:04,004 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 212 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 192 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 192 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 06:00:04,004 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 274 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [192 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 06:00:04,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2022-04-28 06:00:05,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 616. [2022-04-28 06:00:05,834 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:00:05,835 INFO L82 GeneralOperation]: Start isEquivalent. First operand 638 states. Second operand has 616 states, 460 states have (on average 1.2239130434782608) internal successors, (563), 470 states have internal predecessors, (563), 140 states have call successors, (140), 17 states have call predecessors, (140), 15 states have return successors, (138), 128 states have call predecessors, (138), 138 states have call successors, (138) [2022-04-28 06:00:05,835 INFO L74 IsIncluded]: Start isIncluded. First operand 638 states. Second operand has 616 states, 460 states have (on average 1.2239130434782608) internal successors, (563), 470 states have internal predecessors, (563), 140 states have call successors, (140), 17 states have call predecessors, (140), 15 states have return successors, (138), 128 states have call predecessors, (138), 138 states have call successors, (138) [2022-04-28 06:00:05,836 INFO L87 Difference]: Start difference. First operand 638 states. Second operand has 616 states, 460 states have (on average 1.2239130434782608) internal successors, (563), 470 states have internal predecessors, (563), 140 states have call successors, (140), 17 states have call predecessors, (140), 15 states have return successors, (138), 128 states have call predecessors, (138), 138 states have call successors, (138) [2022-04-28 06:00:05,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:00:05,851 INFO L93 Difference]: Finished difference Result 638 states and 867 transitions. [2022-04-28 06:00:05,851 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 867 transitions. [2022-04-28 06:00:05,852 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:00:05,852 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:00:05,852 INFO L74 IsIncluded]: Start isIncluded. First operand has 616 states, 460 states have (on average 1.2239130434782608) internal successors, (563), 470 states have internal predecessors, (563), 140 states have call successors, (140), 17 states have call predecessors, (140), 15 states have return successors, (138), 128 states have call predecessors, (138), 138 states have call successors, (138) Second operand 638 states. [2022-04-28 06:00:05,853 INFO L87 Difference]: Start difference. First operand has 616 states, 460 states have (on average 1.2239130434782608) internal successors, (563), 470 states have internal predecessors, (563), 140 states have call successors, (140), 17 states have call predecessors, (140), 15 states have return successors, (138), 128 states have call predecessors, (138), 138 states have call successors, (138) Second operand 638 states. [2022-04-28 06:00:05,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:00:05,867 INFO L93 Difference]: Finished difference Result 638 states and 867 transitions. [2022-04-28 06:00:05,867 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 867 transitions. [2022-04-28 06:00:05,868 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:00:05,868 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:00:05,868 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:00:05,868 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:00:05,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 616 states, 460 states have (on average 1.2239130434782608) internal successors, (563), 470 states have internal predecessors, (563), 140 states have call successors, (140), 17 states have call predecessors, (140), 15 states have return successors, (138), 128 states have call predecessors, (138), 138 states have call successors, (138) [2022-04-28 06:00:05,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 841 transitions. [2022-04-28 06:00:05,886 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 841 transitions. Word has length 119 [2022-04-28 06:00:05,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:00:05,887 INFO L495 AbstractCegarLoop]: Abstraction has 616 states and 841 transitions. [2022-04-28 06:00:05,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.25) internal successors, (84), 15 states have internal predecessors, (84), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-28 06:00:05,887 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 616 states and 841 transitions. [2022-04-28 06:00:10,376 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 841 edges. 840 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 06:00:10,376 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 841 transitions. [2022-04-28 06:00:10,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-04-28 06:00:10,377 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:00:10,377 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 7, 7, 7, 7, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:00:10,403 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-04-28 06:00:10,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-04-28 06:00:10,578 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:00:10,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:00:10,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1267134888, now seen corresponding path program 17 times [2022-04-28 06:00:10,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:00:10,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [690029241] [2022-04-28 06:00:10,580 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 06:00:10,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1267134888, now seen corresponding path program 18 times [2022-04-28 06:00:10,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:00:10,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694841660] [2022-04-28 06:00:10,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:00:10,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:00:10,613 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:00:10,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1305620616] [2022-04-28 06:00:10,613 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 06:00:10,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:00:10,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:00:10,639 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:00:10,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-04-28 06:00:11,480 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2022-04-28 06:00:11,480 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:00:11,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-28 06:00:11,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:00:11,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:00:12,214 INFO L272 TraceCheckUtils]: 0: Hoare triple {78991#true} call ULTIMATE.init(); {78991#true} is VALID [2022-04-28 06:00:12,214 INFO L290 TraceCheckUtils]: 1: Hoare triple {78991#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {78999#(<= ~counter~0 0)} is VALID [2022-04-28 06:00:12,215 INFO L290 TraceCheckUtils]: 2: Hoare triple {78999#(<= ~counter~0 0)} assume true; {78999#(<= ~counter~0 0)} is VALID [2022-04-28 06:00:12,215 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {78999#(<= ~counter~0 0)} {78991#true} #102#return; {78999#(<= ~counter~0 0)} is VALID [2022-04-28 06:00:12,216 INFO L272 TraceCheckUtils]: 4: Hoare triple {78999#(<= ~counter~0 0)} call #t~ret9 := main(); {78999#(<= ~counter~0 0)} is VALID [2022-04-28 06:00:12,216 INFO L290 TraceCheckUtils]: 5: Hoare triple {78999#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {78999#(<= ~counter~0 0)} is VALID [2022-04-28 06:00:12,216 INFO L272 TraceCheckUtils]: 6: Hoare triple {78999#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {78999#(<= ~counter~0 0)} is VALID [2022-04-28 06:00:12,217 INFO L290 TraceCheckUtils]: 7: Hoare triple {78999#(<= ~counter~0 0)} ~cond := #in~cond; {78999#(<= ~counter~0 0)} is VALID [2022-04-28 06:00:12,217 INFO L290 TraceCheckUtils]: 8: Hoare triple {78999#(<= ~counter~0 0)} assume !(0 == ~cond); {78999#(<= ~counter~0 0)} is VALID [2022-04-28 06:00:12,217 INFO L290 TraceCheckUtils]: 9: Hoare triple {78999#(<= ~counter~0 0)} assume true; {78999#(<= ~counter~0 0)} is VALID [2022-04-28 06:00:12,218 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {78999#(<= ~counter~0 0)} {78999#(<= ~counter~0 0)} #90#return; {78999#(<= ~counter~0 0)} is VALID [2022-04-28 06:00:12,218 INFO L272 TraceCheckUtils]: 11: Hoare triple {78999#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {78999#(<= ~counter~0 0)} is VALID [2022-04-28 06:00:12,219 INFO L290 TraceCheckUtils]: 12: Hoare triple {78999#(<= ~counter~0 0)} ~cond := #in~cond; {78999#(<= ~counter~0 0)} is VALID [2022-04-28 06:00:12,219 INFO L290 TraceCheckUtils]: 13: Hoare triple {78999#(<= ~counter~0 0)} assume !(0 == ~cond); {78999#(<= ~counter~0 0)} is VALID [2022-04-28 06:00:12,219 INFO L290 TraceCheckUtils]: 14: Hoare triple {78999#(<= ~counter~0 0)} assume true; {78999#(<= ~counter~0 0)} is VALID [2022-04-28 06:00:12,220 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {78999#(<= ~counter~0 0)} {78999#(<= ~counter~0 0)} #92#return; {78999#(<= ~counter~0 0)} is VALID [2022-04-28 06:00:12,220 INFO L290 TraceCheckUtils]: 16: Hoare triple {78999#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {78999#(<= ~counter~0 0)} is VALID [2022-04-28 06:00:12,222 INFO L290 TraceCheckUtils]: 17: Hoare triple {78999#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {79048#(<= ~counter~0 1)} is VALID [2022-04-28 06:00:12,222 INFO L290 TraceCheckUtils]: 18: Hoare triple {79048#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {79048#(<= ~counter~0 1)} is VALID [2022-04-28 06:00:12,223 INFO L272 TraceCheckUtils]: 19: Hoare triple {79048#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79048#(<= ~counter~0 1)} is VALID [2022-04-28 06:00:12,223 INFO L290 TraceCheckUtils]: 20: Hoare triple {79048#(<= ~counter~0 1)} ~cond := #in~cond; {79048#(<= ~counter~0 1)} is VALID [2022-04-28 06:00:12,223 INFO L290 TraceCheckUtils]: 21: Hoare triple {79048#(<= ~counter~0 1)} assume !(0 == ~cond); {79048#(<= ~counter~0 1)} is VALID [2022-04-28 06:00:12,224 INFO L290 TraceCheckUtils]: 22: Hoare triple {79048#(<= ~counter~0 1)} assume true; {79048#(<= ~counter~0 1)} is VALID [2022-04-28 06:00:12,224 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {79048#(<= ~counter~0 1)} {79048#(<= ~counter~0 1)} #94#return; {79048#(<= ~counter~0 1)} is VALID [2022-04-28 06:00:12,224 INFO L290 TraceCheckUtils]: 24: Hoare triple {79048#(<= ~counter~0 1)} assume !!(0 != ~r~0); {79048#(<= ~counter~0 1)} is VALID [2022-04-28 06:00:12,225 INFO L290 TraceCheckUtils]: 25: Hoare triple {79048#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79073#(<= ~counter~0 2)} is VALID [2022-04-28 06:00:12,226 INFO L290 TraceCheckUtils]: 26: Hoare triple {79073#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {79073#(<= ~counter~0 2)} is VALID [2022-04-28 06:00:12,226 INFO L272 TraceCheckUtils]: 27: Hoare triple {79073#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79073#(<= ~counter~0 2)} is VALID [2022-04-28 06:00:12,227 INFO L290 TraceCheckUtils]: 28: Hoare triple {79073#(<= ~counter~0 2)} ~cond := #in~cond; {79073#(<= ~counter~0 2)} is VALID [2022-04-28 06:00:12,227 INFO L290 TraceCheckUtils]: 29: Hoare triple {79073#(<= ~counter~0 2)} assume !(0 == ~cond); {79073#(<= ~counter~0 2)} is VALID [2022-04-28 06:00:12,227 INFO L290 TraceCheckUtils]: 30: Hoare triple {79073#(<= ~counter~0 2)} assume true; {79073#(<= ~counter~0 2)} is VALID [2022-04-28 06:00:12,228 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {79073#(<= ~counter~0 2)} {79073#(<= ~counter~0 2)} #96#return; {79073#(<= ~counter~0 2)} is VALID [2022-04-28 06:00:12,228 INFO L290 TraceCheckUtils]: 32: Hoare triple {79073#(<= ~counter~0 2)} assume !(~r~0 > 0); {79073#(<= ~counter~0 2)} is VALID [2022-04-28 06:00:12,229 INFO L290 TraceCheckUtils]: 33: Hoare triple {79073#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {79098#(<= ~counter~0 3)} is VALID [2022-04-28 06:00:12,230 INFO L290 TraceCheckUtils]: 34: Hoare triple {79098#(<= ~counter~0 3)} assume !!(#t~post8 < 20);havoc #t~post8; {79098#(<= ~counter~0 3)} is VALID [2022-04-28 06:00:12,230 INFO L272 TraceCheckUtils]: 35: Hoare triple {79098#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79098#(<= ~counter~0 3)} is VALID [2022-04-28 06:00:12,231 INFO L290 TraceCheckUtils]: 36: Hoare triple {79098#(<= ~counter~0 3)} ~cond := #in~cond; {79098#(<= ~counter~0 3)} is VALID [2022-04-28 06:00:12,231 INFO L290 TraceCheckUtils]: 37: Hoare triple {79098#(<= ~counter~0 3)} assume !(0 == ~cond); {79098#(<= ~counter~0 3)} is VALID [2022-04-28 06:00:12,231 INFO L290 TraceCheckUtils]: 38: Hoare triple {79098#(<= ~counter~0 3)} assume true; {79098#(<= ~counter~0 3)} is VALID [2022-04-28 06:00:12,232 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {79098#(<= ~counter~0 3)} {79098#(<= ~counter~0 3)} #98#return; {79098#(<= ~counter~0 3)} is VALID [2022-04-28 06:00:12,232 INFO L290 TraceCheckUtils]: 40: Hoare triple {79098#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {79098#(<= ~counter~0 3)} is VALID [2022-04-28 06:00:12,233 INFO L290 TraceCheckUtils]: 41: Hoare triple {79098#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {79123#(<= ~counter~0 4)} is VALID [2022-04-28 06:00:12,233 INFO L290 TraceCheckUtils]: 42: Hoare triple {79123#(<= ~counter~0 4)} assume !!(#t~post8 < 20);havoc #t~post8; {79123#(<= ~counter~0 4)} is VALID [2022-04-28 06:00:12,234 INFO L272 TraceCheckUtils]: 43: Hoare triple {79123#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79123#(<= ~counter~0 4)} is VALID [2022-04-28 06:00:12,234 INFO L290 TraceCheckUtils]: 44: Hoare triple {79123#(<= ~counter~0 4)} ~cond := #in~cond; {79123#(<= ~counter~0 4)} is VALID [2022-04-28 06:00:12,235 INFO L290 TraceCheckUtils]: 45: Hoare triple {79123#(<= ~counter~0 4)} assume !(0 == ~cond); {79123#(<= ~counter~0 4)} is VALID [2022-04-28 06:00:12,235 INFO L290 TraceCheckUtils]: 46: Hoare triple {79123#(<= ~counter~0 4)} assume true; {79123#(<= ~counter~0 4)} is VALID [2022-04-28 06:00:12,236 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {79123#(<= ~counter~0 4)} {79123#(<= ~counter~0 4)} #98#return; {79123#(<= ~counter~0 4)} is VALID [2022-04-28 06:00:12,236 INFO L290 TraceCheckUtils]: 48: Hoare triple {79123#(<= ~counter~0 4)} assume !(~r~0 < 0); {79123#(<= ~counter~0 4)} is VALID [2022-04-28 06:00:12,237 INFO L290 TraceCheckUtils]: 49: Hoare triple {79123#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {79148#(<= ~counter~0 5)} is VALID [2022-04-28 06:00:12,237 INFO L290 TraceCheckUtils]: 50: Hoare triple {79148#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {79148#(<= ~counter~0 5)} is VALID [2022-04-28 06:00:12,238 INFO L272 TraceCheckUtils]: 51: Hoare triple {79148#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79148#(<= ~counter~0 5)} is VALID [2022-04-28 06:00:12,238 INFO L290 TraceCheckUtils]: 52: Hoare triple {79148#(<= ~counter~0 5)} ~cond := #in~cond; {79148#(<= ~counter~0 5)} is VALID [2022-04-28 06:00:12,238 INFO L290 TraceCheckUtils]: 53: Hoare triple {79148#(<= ~counter~0 5)} assume !(0 == ~cond); {79148#(<= ~counter~0 5)} is VALID [2022-04-28 06:00:12,239 INFO L290 TraceCheckUtils]: 54: Hoare triple {79148#(<= ~counter~0 5)} assume true; {79148#(<= ~counter~0 5)} is VALID [2022-04-28 06:00:12,239 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {79148#(<= ~counter~0 5)} {79148#(<= ~counter~0 5)} #94#return; {79148#(<= ~counter~0 5)} is VALID [2022-04-28 06:00:12,239 INFO L290 TraceCheckUtils]: 56: Hoare triple {79148#(<= ~counter~0 5)} assume !!(0 != ~r~0); {79148#(<= ~counter~0 5)} is VALID [2022-04-28 06:00:12,240 INFO L290 TraceCheckUtils]: 57: Hoare triple {79148#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79173#(<= ~counter~0 6)} is VALID [2022-04-28 06:00:12,241 INFO L290 TraceCheckUtils]: 58: Hoare triple {79173#(<= ~counter~0 6)} assume !!(#t~post7 < 20);havoc #t~post7; {79173#(<= ~counter~0 6)} is VALID [2022-04-28 06:00:12,241 INFO L272 TraceCheckUtils]: 59: Hoare triple {79173#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79173#(<= ~counter~0 6)} is VALID [2022-04-28 06:00:12,242 INFO L290 TraceCheckUtils]: 60: Hoare triple {79173#(<= ~counter~0 6)} ~cond := #in~cond; {79173#(<= ~counter~0 6)} is VALID [2022-04-28 06:00:12,242 INFO L290 TraceCheckUtils]: 61: Hoare triple {79173#(<= ~counter~0 6)} assume !(0 == ~cond); {79173#(<= ~counter~0 6)} is VALID [2022-04-28 06:00:12,242 INFO L290 TraceCheckUtils]: 62: Hoare triple {79173#(<= ~counter~0 6)} assume true; {79173#(<= ~counter~0 6)} is VALID [2022-04-28 06:00:12,243 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {79173#(<= ~counter~0 6)} {79173#(<= ~counter~0 6)} #96#return; {79173#(<= ~counter~0 6)} is VALID [2022-04-28 06:00:12,243 INFO L290 TraceCheckUtils]: 64: Hoare triple {79173#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {79173#(<= ~counter~0 6)} is VALID [2022-04-28 06:00:12,244 INFO L290 TraceCheckUtils]: 65: Hoare triple {79173#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79198#(<= ~counter~0 7)} is VALID [2022-04-28 06:00:12,245 INFO L290 TraceCheckUtils]: 66: Hoare triple {79198#(<= ~counter~0 7)} assume !!(#t~post7 < 20);havoc #t~post7; {79198#(<= ~counter~0 7)} is VALID [2022-04-28 06:00:12,245 INFO L272 TraceCheckUtils]: 67: Hoare triple {79198#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79198#(<= ~counter~0 7)} is VALID [2022-04-28 06:00:12,245 INFO L290 TraceCheckUtils]: 68: Hoare triple {79198#(<= ~counter~0 7)} ~cond := #in~cond; {79198#(<= ~counter~0 7)} is VALID [2022-04-28 06:00:12,246 INFO L290 TraceCheckUtils]: 69: Hoare triple {79198#(<= ~counter~0 7)} assume !(0 == ~cond); {79198#(<= ~counter~0 7)} is VALID [2022-04-28 06:00:12,246 INFO L290 TraceCheckUtils]: 70: Hoare triple {79198#(<= ~counter~0 7)} assume true; {79198#(<= ~counter~0 7)} is VALID [2022-04-28 06:00:12,247 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {79198#(<= ~counter~0 7)} {79198#(<= ~counter~0 7)} #96#return; {79198#(<= ~counter~0 7)} is VALID [2022-04-28 06:00:12,247 INFO L290 TraceCheckUtils]: 72: Hoare triple {79198#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {79198#(<= ~counter~0 7)} is VALID [2022-04-28 06:00:12,248 INFO L290 TraceCheckUtils]: 73: Hoare triple {79198#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79223#(<= ~counter~0 8)} is VALID [2022-04-28 06:00:12,249 INFO L290 TraceCheckUtils]: 74: Hoare triple {79223#(<= ~counter~0 8)} assume !!(#t~post7 < 20);havoc #t~post7; {79223#(<= ~counter~0 8)} is VALID [2022-04-28 06:00:12,249 INFO L272 TraceCheckUtils]: 75: Hoare triple {79223#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79223#(<= ~counter~0 8)} is VALID [2022-04-28 06:00:12,249 INFO L290 TraceCheckUtils]: 76: Hoare triple {79223#(<= ~counter~0 8)} ~cond := #in~cond; {79223#(<= ~counter~0 8)} is VALID [2022-04-28 06:00:12,250 INFO L290 TraceCheckUtils]: 77: Hoare triple {79223#(<= ~counter~0 8)} assume !(0 == ~cond); {79223#(<= ~counter~0 8)} is VALID [2022-04-28 06:00:12,250 INFO L290 TraceCheckUtils]: 78: Hoare triple {79223#(<= ~counter~0 8)} assume true; {79223#(<= ~counter~0 8)} is VALID [2022-04-28 06:00:12,251 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {79223#(<= ~counter~0 8)} {79223#(<= ~counter~0 8)} #96#return; {79223#(<= ~counter~0 8)} is VALID [2022-04-28 06:00:12,251 INFO L290 TraceCheckUtils]: 80: Hoare triple {79223#(<= ~counter~0 8)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {79223#(<= ~counter~0 8)} is VALID [2022-04-28 06:00:12,252 INFO L290 TraceCheckUtils]: 81: Hoare triple {79223#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79248#(<= ~counter~0 9)} is VALID [2022-04-28 06:00:12,252 INFO L290 TraceCheckUtils]: 82: Hoare triple {79248#(<= ~counter~0 9)} assume !!(#t~post7 < 20);havoc #t~post7; {79248#(<= ~counter~0 9)} is VALID [2022-04-28 06:00:12,253 INFO L272 TraceCheckUtils]: 83: Hoare triple {79248#(<= ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79248#(<= ~counter~0 9)} is VALID [2022-04-28 06:00:12,253 INFO L290 TraceCheckUtils]: 84: Hoare triple {79248#(<= ~counter~0 9)} ~cond := #in~cond; {79248#(<= ~counter~0 9)} is VALID [2022-04-28 06:00:12,253 INFO L290 TraceCheckUtils]: 85: Hoare triple {79248#(<= ~counter~0 9)} assume !(0 == ~cond); {79248#(<= ~counter~0 9)} is VALID [2022-04-28 06:00:12,254 INFO L290 TraceCheckUtils]: 86: Hoare triple {79248#(<= ~counter~0 9)} assume true; {79248#(<= ~counter~0 9)} is VALID [2022-04-28 06:00:12,254 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {79248#(<= ~counter~0 9)} {79248#(<= ~counter~0 9)} #96#return; {79248#(<= ~counter~0 9)} is VALID [2022-04-28 06:00:12,255 INFO L290 TraceCheckUtils]: 88: Hoare triple {79248#(<= ~counter~0 9)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {79248#(<= ~counter~0 9)} is VALID [2022-04-28 06:00:12,256 INFO L290 TraceCheckUtils]: 89: Hoare triple {79248#(<= ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79273#(<= ~counter~0 10)} is VALID [2022-04-28 06:00:12,256 INFO L290 TraceCheckUtils]: 90: Hoare triple {79273#(<= ~counter~0 10)} assume !!(#t~post7 < 20);havoc #t~post7; {79273#(<= ~counter~0 10)} is VALID [2022-04-28 06:00:12,256 INFO L272 TraceCheckUtils]: 91: Hoare triple {79273#(<= ~counter~0 10)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79273#(<= ~counter~0 10)} is VALID [2022-04-28 06:00:12,257 INFO L290 TraceCheckUtils]: 92: Hoare triple {79273#(<= ~counter~0 10)} ~cond := #in~cond; {79273#(<= ~counter~0 10)} is VALID [2022-04-28 06:00:12,257 INFO L290 TraceCheckUtils]: 93: Hoare triple {79273#(<= ~counter~0 10)} assume !(0 == ~cond); {79273#(<= ~counter~0 10)} is VALID [2022-04-28 06:00:12,257 INFO L290 TraceCheckUtils]: 94: Hoare triple {79273#(<= ~counter~0 10)} assume true; {79273#(<= ~counter~0 10)} is VALID [2022-04-28 06:00:12,258 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {79273#(<= ~counter~0 10)} {79273#(<= ~counter~0 10)} #96#return; {79273#(<= ~counter~0 10)} is VALID [2022-04-28 06:00:12,258 INFO L290 TraceCheckUtils]: 96: Hoare triple {79273#(<= ~counter~0 10)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {79273#(<= ~counter~0 10)} is VALID [2022-04-28 06:00:12,259 INFO L290 TraceCheckUtils]: 97: Hoare triple {79273#(<= ~counter~0 10)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79298#(<= ~counter~0 11)} is VALID [2022-04-28 06:00:12,260 INFO L290 TraceCheckUtils]: 98: Hoare triple {79298#(<= ~counter~0 11)} assume !!(#t~post7 < 20);havoc #t~post7; {79298#(<= ~counter~0 11)} is VALID [2022-04-28 06:00:12,260 INFO L272 TraceCheckUtils]: 99: Hoare triple {79298#(<= ~counter~0 11)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79298#(<= ~counter~0 11)} is VALID [2022-04-28 06:00:12,261 INFO L290 TraceCheckUtils]: 100: Hoare triple {79298#(<= ~counter~0 11)} ~cond := #in~cond; {79298#(<= ~counter~0 11)} is VALID [2022-04-28 06:00:12,261 INFO L290 TraceCheckUtils]: 101: Hoare triple {79298#(<= ~counter~0 11)} assume !(0 == ~cond); {79298#(<= ~counter~0 11)} is VALID [2022-04-28 06:00:12,261 INFO L290 TraceCheckUtils]: 102: Hoare triple {79298#(<= ~counter~0 11)} assume true; {79298#(<= ~counter~0 11)} is VALID [2022-04-28 06:00:12,262 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {79298#(<= ~counter~0 11)} {79298#(<= ~counter~0 11)} #96#return; {79298#(<= ~counter~0 11)} is VALID [2022-04-28 06:00:12,262 INFO L290 TraceCheckUtils]: 104: Hoare triple {79298#(<= ~counter~0 11)} assume !(~r~0 > 0); {79298#(<= ~counter~0 11)} is VALID [2022-04-28 06:00:12,263 INFO L290 TraceCheckUtils]: 105: Hoare triple {79298#(<= ~counter~0 11)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {79323#(<= ~counter~0 12)} is VALID [2022-04-28 06:00:12,264 INFO L290 TraceCheckUtils]: 106: Hoare triple {79323#(<= ~counter~0 12)} assume !!(#t~post8 < 20);havoc #t~post8; {79323#(<= ~counter~0 12)} is VALID [2022-04-28 06:00:12,264 INFO L272 TraceCheckUtils]: 107: Hoare triple {79323#(<= ~counter~0 12)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79323#(<= ~counter~0 12)} is VALID [2022-04-28 06:00:12,264 INFO L290 TraceCheckUtils]: 108: Hoare triple {79323#(<= ~counter~0 12)} ~cond := #in~cond; {79323#(<= ~counter~0 12)} is VALID [2022-04-28 06:00:12,265 INFO L290 TraceCheckUtils]: 109: Hoare triple {79323#(<= ~counter~0 12)} assume !(0 == ~cond); {79323#(<= ~counter~0 12)} is VALID [2022-04-28 06:00:12,265 INFO L290 TraceCheckUtils]: 110: Hoare triple {79323#(<= ~counter~0 12)} assume true; {79323#(<= ~counter~0 12)} is VALID [2022-04-28 06:00:12,266 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {79323#(<= ~counter~0 12)} {79323#(<= ~counter~0 12)} #98#return; {79323#(<= ~counter~0 12)} is VALID [2022-04-28 06:00:12,266 INFO L290 TraceCheckUtils]: 112: Hoare triple {79323#(<= ~counter~0 12)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {79323#(<= ~counter~0 12)} is VALID [2022-04-28 06:00:12,266 INFO L290 TraceCheckUtils]: 113: Hoare triple {79323#(<= ~counter~0 12)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {79348#(<= |main_#t~post8| 12)} is VALID [2022-04-28 06:00:12,267 INFO L290 TraceCheckUtils]: 114: Hoare triple {79348#(<= |main_#t~post8| 12)} assume !(#t~post8 < 20);havoc #t~post8; {78992#false} is VALID [2022-04-28 06:00:12,267 INFO L290 TraceCheckUtils]: 115: Hoare triple {78992#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {78992#false} is VALID [2022-04-28 06:00:12,267 INFO L290 TraceCheckUtils]: 116: Hoare triple {78992#false} assume !(#t~post6 < 20);havoc #t~post6; {78992#false} is VALID [2022-04-28 06:00:12,267 INFO L272 TraceCheckUtils]: 117: Hoare triple {78992#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {78992#false} is VALID [2022-04-28 06:00:12,267 INFO L290 TraceCheckUtils]: 118: Hoare triple {78992#false} ~cond := #in~cond; {78992#false} is VALID [2022-04-28 06:00:12,267 INFO L290 TraceCheckUtils]: 119: Hoare triple {78992#false} assume 0 == ~cond; {78992#false} is VALID [2022-04-28 06:00:12,267 INFO L290 TraceCheckUtils]: 120: Hoare triple {78992#false} assume !false; {78992#false} is VALID [2022-04-28 06:00:12,268 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 28 proven. 370 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 06:00:12,268 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 06:00:12,997 INFO L290 TraceCheckUtils]: 120: Hoare triple {78992#false} assume !false; {78992#false} is VALID [2022-04-28 06:00:12,997 INFO L290 TraceCheckUtils]: 119: Hoare triple {78992#false} assume 0 == ~cond; {78992#false} is VALID [2022-04-28 06:00:12,997 INFO L290 TraceCheckUtils]: 118: Hoare triple {78992#false} ~cond := #in~cond; {78992#false} is VALID [2022-04-28 06:00:12,997 INFO L272 TraceCheckUtils]: 117: Hoare triple {78992#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {78992#false} is VALID [2022-04-28 06:00:12,997 INFO L290 TraceCheckUtils]: 116: Hoare triple {78992#false} assume !(#t~post6 < 20);havoc #t~post6; {78992#false} is VALID [2022-04-28 06:00:12,997 INFO L290 TraceCheckUtils]: 115: Hoare triple {78992#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {78992#false} is VALID [2022-04-28 06:00:12,998 INFO L290 TraceCheckUtils]: 114: Hoare triple {79388#(< |main_#t~post8| 20)} assume !(#t~post8 < 20);havoc #t~post8; {78992#false} is VALID [2022-04-28 06:00:12,998 INFO L290 TraceCheckUtils]: 113: Hoare triple {79392#(< ~counter~0 20)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {79388#(< |main_#t~post8| 20)} is VALID [2022-04-28 06:00:12,998 INFO L290 TraceCheckUtils]: 112: Hoare triple {79392#(< ~counter~0 20)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {79392#(< ~counter~0 20)} is VALID [2022-04-28 06:00:12,999 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {78991#true} {79392#(< ~counter~0 20)} #98#return; {79392#(< ~counter~0 20)} is VALID [2022-04-28 06:00:12,999 INFO L290 TraceCheckUtils]: 110: Hoare triple {78991#true} assume true; {78991#true} is VALID [2022-04-28 06:00:12,999 INFO L290 TraceCheckUtils]: 109: Hoare triple {78991#true} assume !(0 == ~cond); {78991#true} is VALID [2022-04-28 06:00:12,999 INFO L290 TraceCheckUtils]: 108: Hoare triple {78991#true} ~cond := #in~cond; {78991#true} is VALID [2022-04-28 06:00:12,999 INFO L272 TraceCheckUtils]: 107: Hoare triple {79392#(< ~counter~0 20)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {78991#true} is VALID [2022-04-28 06:00:13,000 INFO L290 TraceCheckUtils]: 106: Hoare triple {79392#(< ~counter~0 20)} assume !!(#t~post8 < 20);havoc #t~post8; {79392#(< ~counter~0 20)} is VALID [2022-04-28 06:00:13,002 INFO L290 TraceCheckUtils]: 105: Hoare triple {79417#(< ~counter~0 19)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {79392#(< ~counter~0 20)} is VALID [2022-04-28 06:00:13,002 INFO L290 TraceCheckUtils]: 104: Hoare triple {79417#(< ~counter~0 19)} assume !(~r~0 > 0); {79417#(< ~counter~0 19)} is VALID [2022-04-28 06:00:13,003 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {78991#true} {79417#(< ~counter~0 19)} #96#return; {79417#(< ~counter~0 19)} is VALID [2022-04-28 06:00:13,003 INFO L290 TraceCheckUtils]: 102: Hoare triple {78991#true} assume true; {78991#true} is VALID [2022-04-28 06:00:13,003 INFO L290 TraceCheckUtils]: 101: Hoare triple {78991#true} assume !(0 == ~cond); {78991#true} is VALID [2022-04-28 06:00:13,003 INFO L290 TraceCheckUtils]: 100: Hoare triple {78991#true} ~cond := #in~cond; {78991#true} is VALID [2022-04-28 06:00:13,003 INFO L272 TraceCheckUtils]: 99: Hoare triple {79417#(< ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {78991#true} is VALID [2022-04-28 06:00:13,003 INFO L290 TraceCheckUtils]: 98: Hoare triple {79417#(< ~counter~0 19)} assume !!(#t~post7 < 20);havoc #t~post7; {79417#(< ~counter~0 19)} is VALID [2022-04-28 06:00:13,004 INFO L290 TraceCheckUtils]: 97: Hoare triple {79442#(< ~counter~0 18)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79417#(< ~counter~0 19)} is VALID [2022-04-28 06:00:13,005 INFO L290 TraceCheckUtils]: 96: Hoare triple {79442#(< ~counter~0 18)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {79442#(< ~counter~0 18)} is VALID [2022-04-28 06:00:13,005 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {78991#true} {79442#(< ~counter~0 18)} #96#return; {79442#(< ~counter~0 18)} is VALID [2022-04-28 06:00:13,005 INFO L290 TraceCheckUtils]: 94: Hoare triple {78991#true} assume true; {78991#true} is VALID [2022-04-28 06:00:13,005 INFO L290 TraceCheckUtils]: 93: Hoare triple {78991#true} assume !(0 == ~cond); {78991#true} is VALID [2022-04-28 06:00:13,005 INFO L290 TraceCheckUtils]: 92: Hoare triple {78991#true} ~cond := #in~cond; {78991#true} is VALID [2022-04-28 06:00:13,006 INFO L272 TraceCheckUtils]: 91: Hoare triple {79442#(< ~counter~0 18)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {78991#true} is VALID [2022-04-28 06:00:13,006 INFO L290 TraceCheckUtils]: 90: Hoare triple {79442#(< ~counter~0 18)} assume !!(#t~post7 < 20);havoc #t~post7; {79442#(< ~counter~0 18)} is VALID [2022-04-28 06:00:13,007 INFO L290 TraceCheckUtils]: 89: Hoare triple {79467#(< ~counter~0 17)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79442#(< ~counter~0 18)} is VALID [2022-04-28 06:00:13,007 INFO L290 TraceCheckUtils]: 88: Hoare triple {79467#(< ~counter~0 17)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {79467#(< ~counter~0 17)} is VALID [2022-04-28 06:00:13,008 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {78991#true} {79467#(< ~counter~0 17)} #96#return; {79467#(< ~counter~0 17)} is VALID [2022-04-28 06:00:13,008 INFO L290 TraceCheckUtils]: 86: Hoare triple {78991#true} assume true; {78991#true} is VALID [2022-04-28 06:00:13,008 INFO L290 TraceCheckUtils]: 85: Hoare triple {78991#true} assume !(0 == ~cond); {78991#true} is VALID [2022-04-28 06:00:13,008 INFO L290 TraceCheckUtils]: 84: Hoare triple {78991#true} ~cond := #in~cond; {78991#true} is VALID [2022-04-28 06:00:13,008 INFO L272 TraceCheckUtils]: 83: Hoare triple {79467#(< ~counter~0 17)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {78991#true} is VALID [2022-04-28 06:00:13,008 INFO L290 TraceCheckUtils]: 82: Hoare triple {79467#(< ~counter~0 17)} assume !!(#t~post7 < 20);havoc #t~post7; {79467#(< ~counter~0 17)} is VALID [2022-04-28 06:00:13,009 INFO L290 TraceCheckUtils]: 81: Hoare triple {79492#(< ~counter~0 16)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79467#(< ~counter~0 17)} is VALID [2022-04-28 06:00:13,010 INFO L290 TraceCheckUtils]: 80: Hoare triple {79492#(< ~counter~0 16)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {79492#(< ~counter~0 16)} is VALID [2022-04-28 06:00:13,010 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {78991#true} {79492#(< ~counter~0 16)} #96#return; {79492#(< ~counter~0 16)} is VALID [2022-04-28 06:00:13,010 INFO L290 TraceCheckUtils]: 78: Hoare triple {78991#true} assume true; {78991#true} is VALID [2022-04-28 06:00:13,010 INFO L290 TraceCheckUtils]: 77: Hoare triple {78991#true} assume !(0 == ~cond); {78991#true} is VALID [2022-04-28 06:00:13,010 INFO L290 TraceCheckUtils]: 76: Hoare triple {78991#true} ~cond := #in~cond; {78991#true} is VALID [2022-04-28 06:00:13,010 INFO L272 TraceCheckUtils]: 75: Hoare triple {79492#(< ~counter~0 16)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {78991#true} is VALID [2022-04-28 06:00:13,011 INFO L290 TraceCheckUtils]: 74: Hoare triple {79492#(< ~counter~0 16)} assume !!(#t~post7 < 20);havoc #t~post7; {79492#(< ~counter~0 16)} is VALID [2022-04-28 06:00:13,012 INFO L290 TraceCheckUtils]: 73: Hoare triple {79517#(< ~counter~0 15)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79492#(< ~counter~0 16)} is VALID [2022-04-28 06:00:13,012 INFO L290 TraceCheckUtils]: 72: Hoare triple {79517#(< ~counter~0 15)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {79517#(< ~counter~0 15)} is VALID [2022-04-28 06:00:13,013 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {78991#true} {79517#(< ~counter~0 15)} #96#return; {79517#(< ~counter~0 15)} is VALID [2022-04-28 06:00:13,013 INFO L290 TraceCheckUtils]: 70: Hoare triple {78991#true} assume true; {78991#true} is VALID [2022-04-28 06:00:13,013 INFO L290 TraceCheckUtils]: 69: Hoare triple {78991#true} assume !(0 == ~cond); {78991#true} is VALID [2022-04-28 06:00:13,013 INFO L290 TraceCheckUtils]: 68: Hoare triple {78991#true} ~cond := #in~cond; {78991#true} is VALID [2022-04-28 06:00:13,013 INFO L272 TraceCheckUtils]: 67: Hoare triple {79517#(< ~counter~0 15)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {78991#true} is VALID [2022-04-28 06:00:13,013 INFO L290 TraceCheckUtils]: 66: Hoare triple {79517#(< ~counter~0 15)} assume !!(#t~post7 < 20);havoc #t~post7; {79517#(< ~counter~0 15)} is VALID [2022-04-28 06:00:13,014 INFO L290 TraceCheckUtils]: 65: Hoare triple {79542#(< ~counter~0 14)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79517#(< ~counter~0 15)} is VALID [2022-04-28 06:00:13,014 INFO L290 TraceCheckUtils]: 64: Hoare triple {79542#(< ~counter~0 14)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {79542#(< ~counter~0 14)} is VALID [2022-04-28 06:00:13,015 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {78991#true} {79542#(< ~counter~0 14)} #96#return; {79542#(< ~counter~0 14)} is VALID [2022-04-28 06:00:13,015 INFO L290 TraceCheckUtils]: 62: Hoare triple {78991#true} assume true; {78991#true} is VALID [2022-04-28 06:00:13,015 INFO L290 TraceCheckUtils]: 61: Hoare triple {78991#true} assume !(0 == ~cond); {78991#true} is VALID [2022-04-28 06:00:13,015 INFO L290 TraceCheckUtils]: 60: Hoare triple {78991#true} ~cond := #in~cond; {78991#true} is VALID [2022-04-28 06:00:13,015 INFO L272 TraceCheckUtils]: 59: Hoare triple {79542#(< ~counter~0 14)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {78991#true} is VALID [2022-04-28 06:00:13,016 INFO L290 TraceCheckUtils]: 58: Hoare triple {79542#(< ~counter~0 14)} assume !!(#t~post7 < 20);havoc #t~post7; {79542#(< ~counter~0 14)} is VALID [2022-04-28 06:00:13,016 INFO L290 TraceCheckUtils]: 57: Hoare triple {79323#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79542#(< ~counter~0 14)} is VALID [2022-04-28 06:00:13,017 INFO L290 TraceCheckUtils]: 56: Hoare triple {79323#(<= ~counter~0 12)} assume !!(0 != ~r~0); {79323#(<= ~counter~0 12)} is VALID [2022-04-28 06:00:13,017 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {78991#true} {79323#(<= ~counter~0 12)} #94#return; {79323#(<= ~counter~0 12)} is VALID [2022-04-28 06:00:13,017 INFO L290 TraceCheckUtils]: 54: Hoare triple {78991#true} assume true; {78991#true} is VALID [2022-04-28 06:00:13,018 INFO L290 TraceCheckUtils]: 53: Hoare triple {78991#true} assume !(0 == ~cond); {78991#true} is VALID [2022-04-28 06:00:13,018 INFO L290 TraceCheckUtils]: 52: Hoare triple {78991#true} ~cond := #in~cond; {78991#true} is VALID [2022-04-28 06:00:13,018 INFO L272 TraceCheckUtils]: 51: Hoare triple {79323#(<= ~counter~0 12)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {78991#true} is VALID [2022-04-28 06:00:13,018 INFO L290 TraceCheckUtils]: 50: Hoare triple {79323#(<= ~counter~0 12)} assume !!(#t~post6 < 20);havoc #t~post6; {79323#(<= ~counter~0 12)} is VALID [2022-04-28 06:00:13,019 INFO L290 TraceCheckUtils]: 49: Hoare triple {79298#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {79323#(<= ~counter~0 12)} is VALID [2022-04-28 06:00:13,019 INFO L290 TraceCheckUtils]: 48: Hoare triple {79298#(<= ~counter~0 11)} assume !(~r~0 < 0); {79298#(<= ~counter~0 11)} is VALID [2022-04-28 06:00:13,020 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {78991#true} {79298#(<= ~counter~0 11)} #98#return; {79298#(<= ~counter~0 11)} is VALID [2022-04-28 06:00:13,020 INFO L290 TraceCheckUtils]: 46: Hoare triple {78991#true} assume true; {78991#true} is VALID [2022-04-28 06:00:13,020 INFO L290 TraceCheckUtils]: 45: Hoare triple {78991#true} assume !(0 == ~cond); {78991#true} is VALID [2022-04-28 06:00:13,020 INFO L290 TraceCheckUtils]: 44: Hoare triple {78991#true} ~cond := #in~cond; {78991#true} is VALID [2022-04-28 06:00:13,020 INFO L272 TraceCheckUtils]: 43: Hoare triple {79298#(<= ~counter~0 11)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {78991#true} is VALID [2022-04-28 06:00:13,020 INFO L290 TraceCheckUtils]: 42: Hoare triple {79298#(<= ~counter~0 11)} assume !!(#t~post8 < 20);havoc #t~post8; {79298#(<= ~counter~0 11)} is VALID [2022-04-28 06:00:13,021 INFO L290 TraceCheckUtils]: 41: Hoare triple {79273#(<= ~counter~0 10)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {79298#(<= ~counter~0 11)} is VALID [2022-04-28 06:00:13,022 INFO L290 TraceCheckUtils]: 40: Hoare triple {79273#(<= ~counter~0 10)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {79273#(<= ~counter~0 10)} is VALID [2022-04-28 06:00:13,022 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {78991#true} {79273#(<= ~counter~0 10)} #98#return; {79273#(<= ~counter~0 10)} is VALID [2022-04-28 06:00:13,022 INFO L290 TraceCheckUtils]: 38: Hoare triple {78991#true} assume true; {78991#true} is VALID [2022-04-28 06:00:13,023 INFO L290 TraceCheckUtils]: 37: Hoare triple {78991#true} assume !(0 == ~cond); {78991#true} is VALID [2022-04-28 06:00:13,023 INFO L290 TraceCheckUtils]: 36: Hoare triple {78991#true} ~cond := #in~cond; {78991#true} is VALID [2022-04-28 06:00:13,023 INFO L272 TraceCheckUtils]: 35: Hoare triple {79273#(<= ~counter~0 10)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {78991#true} is VALID [2022-04-28 06:00:13,023 INFO L290 TraceCheckUtils]: 34: Hoare triple {79273#(<= ~counter~0 10)} assume !!(#t~post8 < 20);havoc #t~post8; {79273#(<= ~counter~0 10)} is VALID [2022-04-28 06:00:13,024 INFO L290 TraceCheckUtils]: 33: Hoare triple {79248#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {79273#(<= ~counter~0 10)} is VALID [2022-04-28 06:00:13,024 INFO L290 TraceCheckUtils]: 32: Hoare triple {79248#(<= ~counter~0 9)} assume !(~r~0 > 0); {79248#(<= ~counter~0 9)} is VALID [2022-04-28 06:00:13,025 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {78991#true} {79248#(<= ~counter~0 9)} #96#return; {79248#(<= ~counter~0 9)} is VALID [2022-04-28 06:00:13,025 INFO L290 TraceCheckUtils]: 30: Hoare triple {78991#true} assume true; {78991#true} is VALID [2022-04-28 06:00:13,025 INFO L290 TraceCheckUtils]: 29: Hoare triple {78991#true} assume !(0 == ~cond); {78991#true} is VALID [2022-04-28 06:00:13,025 INFO L290 TraceCheckUtils]: 28: Hoare triple {78991#true} ~cond := #in~cond; {78991#true} is VALID [2022-04-28 06:00:13,025 INFO L272 TraceCheckUtils]: 27: Hoare triple {79248#(<= ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {78991#true} is VALID [2022-04-28 06:00:13,026 INFO L290 TraceCheckUtils]: 26: Hoare triple {79248#(<= ~counter~0 9)} assume !!(#t~post7 < 20);havoc #t~post7; {79248#(<= ~counter~0 9)} is VALID [2022-04-28 06:00:13,026 INFO L290 TraceCheckUtils]: 25: Hoare triple {79223#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79248#(<= ~counter~0 9)} is VALID [2022-04-28 06:00:13,027 INFO L290 TraceCheckUtils]: 24: Hoare triple {79223#(<= ~counter~0 8)} assume !!(0 != ~r~0); {79223#(<= ~counter~0 8)} is VALID [2022-04-28 06:00:13,027 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {78991#true} {79223#(<= ~counter~0 8)} #94#return; {79223#(<= ~counter~0 8)} is VALID [2022-04-28 06:00:13,028 INFO L290 TraceCheckUtils]: 22: Hoare triple {78991#true} assume true; {78991#true} is VALID [2022-04-28 06:00:13,028 INFO L290 TraceCheckUtils]: 21: Hoare triple {78991#true} assume !(0 == ~cond); {78991#true} is VALID [2022-04-28 06:00:13,028 INFO L290 TraceCheckUtils]: 20: Hoare triple {78991#true} ~cond := #in~cond; {78991#true} is VALID [2022-04-28 06:00:13,028 INFO L272 TraceCheckUtils]: 19: Hoare triple {79223#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {78991#true} is VALID [2022-04-28 06:00:13,028 INFO L290 TraceCheckUtils]: 18: Hoare triple {79223#(<= ~counter~0 8)} assume !!(#t~post6 < 20);havoc #t~post6; {79223#(<= ~counter~0 8)} is VALID [2022-04-28 06:00:13,029 INFO L290 TraceCheckUtils]: 17: Hoare triple {79198#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {79223#(<= ~counter~0 8)} is VALID [2022-04-28 06:00:13,029 INFO L290 TraceCheckUtils]: 16: Hoare triple {79198#(<= ~counter~0 7)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {79198#(<= ~counter~0 7)} is VALID [2022-04-28 06:00:13,030 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {78991#true} {79198#(<= ~counter~0 7)} #92#return; {79198#(<= ~counter~0 7)} is VALID [2022-04-28 06:00:13,030 INFO L290 TraceCheckUtils]: 14: Hoare triple {78991#true} assume true; {78991#true} is VALID [2022-04-28 06:00:13,030 INFO L290 TraceCheckUtils]: 13: Hoare triple {78991#true} assume !(0 == ~cond); {78991#true} is VALID [2022-04-28 06:00:13,030 INFO L290 TraceCheckUtils]: 12: Hoare triple {78991#true} ~cond := #in~cond; {78991#true} is VALID [2022-04-28 06:00:13,030 INFO L272 TraceCheckUtils]: 11: Hoare triple {79198#(<= ~counter~0 7)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {78991#true} is VALID [2022-04-28 06:00:13,030 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {78991#true} {79198#(<= ~counter~0 7)} #90#return; {79198#(<= ~counter~0 7)} is VALID [2022-04-28 06:00:13,031 INFO L290 TraceCheckUtils]: 9: Hoare triple {78991#true} assume true; {78991#true} is VALID [2022-04-28 06:00:13,031 INFO L290 TraceCheckUtils]: 8: Hoare triple {78991#true} assume !(0 == ~cond); {78991#true} is VALID [2022-04-28 06:00:13,031 INFO L290 TraceCheckUtils]: 7: Hoare triple {78991#true} ~cond := #in~cond; {78991#true} is VALID [2022-04-28 06:00:13,031 INFO L272 TraceCheckUtils]: 6: Hoare triple {79198#(<= ~counter~0 7)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {78991#true} is VALID [2022-04-28 06:00:13,031 INFO L290 TraceCheckUtils]: 5: Hoare triple {79198#(<= ~counter~0 7)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {79198#(<= ~counter~0 7)} is VALID [2022-04-28 06:00:13,031 INFO L272 TraceCheckUtils]: 4: Hoare triple {79198#(<= ~counter~0 7)} call #t~ret9 := main(); {79198#(<= ~counter~0 7)} is VALID [2022-04-28 06:00:13,032 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {79198#(<= ~counter~0 7)} {78991#true} #102#return; {79198#(<= ~counter~0 7)} is VALID [2022-04-28 06:00:13,032 INFO L290 TraceCheckUtils]: 2: Hoare triple {79198#(<= ~counter~0 7)} assume true; {79198#(<= ~counter~0 7)} is VALID [2022-04-28 06:00:13,033 INFO L290 TraceCheckUtils]: 1: Hoare triple {78991#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {79198#(<= ~counter~0 7)} is VALID [2022-04-28 06:00:13,033 INFO L272 TraceCheckUtils]: 0: Hoare triple {78991#true} call ULTIMATE.init(); {78991#true} is VALID [2022-04-28 06:00:13,033 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 28 proven. 106 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2022-04-28 06:00:13,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:00:13,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694841660] [2022-04-28 06:00:13,033 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:00:13,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305620616] [2022-04-28 06:00:13,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1305620616] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 06:00:13,034 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 06:00:13,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 24 [2022-04-28 06:00:13,034 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:00:13,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [690029241] [2022-04-28 06:00:13,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [690029241] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:00:13,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:00:13,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 06:00:13,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140030017] [2022-04-28 06:00:13,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:00:13,035 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.375) internal successors, (86), 15 states have internal predecessors, (86), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) Word has length 121 [2022-04-28 06:00:13,035 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:00:13,035 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 5.375) internal successors, (86), 15 states have internal predecessors, (86), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-28 06:00:13,144 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:00:13,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 06:00:13,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:00:13,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 06:00:13,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-28 06:00:13,144 INFO L87 Difference]: Start difference. First operand 616 states and 841 transitions. Second operand has 16 states, 16 states have (on average 5.375) internal successors, (86), 15 states have internal predecessors, (86), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-28 06:00:16,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:00:16,203 INFO L93 Difference]: Finished difference Result 837 states and 1174 transitions. [2022-04-28 06:00:16,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-28 06:00:16,203 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.375) internal successors, (86), 15 states have internal predecessors, (86), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) Word has length 121 [2022-04-28 06:00:16,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:00:16,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 5.375) internal successors, (86), 15 states have internal predecessors, (86), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-28 06:00:16,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 276 transitions. [2022-04-28 06:00:16,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 5.375) internal successors, (86), 15 states have internal predecessors, (86), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-28 06:00:16,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 276 transitions. [2022-04-28 06:00:16,209 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 276 transitions. [2022-04-28 06:00:16,462 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 276 edges. 276 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:00:16,479 INFO L225 Difference]: With dead ends: 837 [2022-04-28 06:00:16,479 INFO L226 Difference]: Without dead ends: 644 [2022-04-28 06:00:16,480 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 218 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=446, Invalid=676, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 06:00:16,480 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 184 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 06:00:16,480 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 278 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 06:00:16,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2022-04-28 06:00:18,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 634. [2022-04-28 06:00:18,412 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:00:18,412 INFO L82 GeneralOperation]: Start isEquivalent. First operand 644 states. Second operand has 634 states, 478 states have (on average 1.2238493723849373) internal successors, (585), 482 states have internal predecessors, (585), 140 states have call successors, (140), 17 states have call predecessors, (140), 15 states have return successors, (138), 134 states have call predecessors, (138), 138 states have call successors, (138) [2022-04-28 06:00:18,413 INFO L74 IsIncluded]: Start isIncluded. First operand 644 states. Second operand has 634 states, 478 states have (on average 1.2238493723849373) internal successors, (585), 482 states have internal predecessors, (585), 140 states have call successors, (140), 17 states have call predecessors, (140), 15 states have return successors, (138), 134 states have call predecessors, (138), 138 states have call successors, (138) [2022-04-28 06:00:18,413 INFO L87 Difference]: Start difference. First operand 644 states. Second operand has 634 states, 478 states have (on average 1.2238493723849373) internal successors, (585), 482 states have internal predecessors, (585), 140 states have call successors, (140), 17 states have call predecessors, (140), 15 states have return successors, (138), 134 states have call predecessors, (138), 138 states have call successors, (138) [2022-04-28 06:00:18,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:00:18,435 INFO L93 Difference]: Finished difference Result 644 states and 873 transitions. [2022-04-28 06:00:18,435 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 873 transitions. [2022-04-28 06:00:18,436 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:00:18,436 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:00:18,437 INFO L74 IsIncluded]: Start isIncluded. First operand has 634 states, 478 states have (on average 1.2238493723849373) internal successors, (585), 482 states have internal predecessors, (585), 140 states have call successors, (140), 17 states have call predecessors, (140), 15 states have return successors, (138), 134 states have call predecessors, (138), 138 states have call successors, (138) Second operand 644 states. [2022-04-28 06:00:18,437 INFO L87 Difference]: Start difference. First operand has 634 states, 478 states have (on average 1.2238493723849373) internal successors, (585), 482 states have internal predecessors, (585), 140 states have call successors, (140), 17 states have call predecessors, (140), 15 states have return successors, (138), 134 states have call predecessors, (138), 138 states have call successors, (138) Second operand 644 states. [2022-04-28 06:00:18,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:00:18,459 INFO L93 Difference]: Finished difference Result 644 states and 873 transitions. [2022-04-28 06:00:18,459 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 873 transitions. [2022-04-28 06:00:18,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:00:18,460 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:00:18,460 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:00:18,460 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:00:18,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 478 states have (on average 1.2238493723849373) internal successors, (585), 482 states have internal predecessors, (585), 140 states have call successors, (140), 17 states have call predecessors, (140), 15 states have return successors, (138), 134 states have call predecessors, (138), 138 states have call successors, (138) [2022-04-28 06:00:18,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 863 transitions. [2022-04-28 06:00:18,483 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 863 transitions. Word has length 121 [2022-04-28 06:00:18,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:00:18,483 INFO L495 AbstractCegarLoop]: Abstraction has 634 states and 863 transitions. [2022-04-28 06:00:18,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.375) internal successors, (86), 15 states have internal predecessors, (86), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-28 06:00:18,483 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 634 states and 863 transitions. [2022-04-28 06:00:22,163 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 863 edges. 863 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:00:22,164 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 863 transitions. [2022-04-28 06:00:22,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-04-28 06:00:22,165 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:00:22,165 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:00:22,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2022-04-28 06:00:22,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-04-28 06:00:22,366 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:00:22,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:00:22,366 INFO L85 PathProgramCache]: Analyzing trace with hash 487500267, now seen corresponding path program 15 times [2022-04-28 06:00:22,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:00:22,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1429034765] [2022-04-28 06:00:22,367 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 06:00:22,367 INFO L85 PathProgramCache]: Analyzing trace with hash 487500267, now seen corresponding path program 16 times [2022-04-28 06:00:22,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:00:22,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861703063] [2022-04-28 06:00:22,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:00:22,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:00:22,382 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:00:22,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1467180160] [2022-04-28 06:00:22,382 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 06:00:22,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:00:22,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:00:22,383 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:00:22,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-04-28 06:00:22,554 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 06:00:22,554 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:00:22,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-28 06:00:22,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:00:22,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:00:23,291 INFO L272 TraceCheckUtils]: 0: Hoare triple {83990#true} call ULTIMATE.init(); {83990#true} is VALID [2022-04-28 06:00:23,292 INFO L290 TraceCheckUtils]: 1: Hoare triple {83990#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {83998#(<= ~counter~0 0)} is VALID [2022-04-28 06:00:23,292 INFO L290 TraceCheckUtils]: 2: Hoare triple {83998#(<= ~counter~0 0)} assume true; {83998#(<= ~counter~0 0)} is VALID [2022-04-28 06:00:23,292 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {83998#(<= ~counter~0 0)} {83990#true} #102#return; {83998#(<= ~counter~0 0)} is VALID [2022-04-28 06:00:23,293 INFO L272 TraceCheckUtils]: 4: Hoare triple {83998#(<= ~counter~0 0)} call #t~ret9 := main(); {83998#(<= ~counter~0 0)} is VALID [2022-04-28 06:00:23,293 INFO L290 TraceCheckUtils]: 5: Hoare triple {83998#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {83998#(<= ~counter~0 0)} is VALID [2022-04-28 06:00:23,293 INFO L272 TraceCheckUtils]: 6: Hoare triple {83998#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {83998#(<= ~counter~0 0)} is VALID [2022-04-28 06:00:23,294 INFO L290 TraceCheckUtils]: 7: Hoare triple {83998#(<= ~counter~0 0)} ~cond := #in~cond; {83998#(<= ~counter~0 0)} is VALID [2022-04-28 06:00:23,294 INFO L290 TraceCheckUtils]: 8: Hoare triple {83998#(<= ~counter~0 0)} assume !(0 == ~cond); {83998#(<= ~counter~0 0)} is VALID [2022-04-28 06:00:23,294 INFO L290 TraceCheckUtils]: 9: Hoare triple {83998#(<= ~counter~0 0)} assume true; {83998#(<= ~counter~0 0)} is VALID [2022-04-28 06:00:23,295 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {83998#(<= ~counter~0 0)} {83998#(<= ~counter~0 0)} #90#return; {83998#(<= ~counter~0 0)} is VALID [2022-04-28 06:00:23,295 INFO L272 TraceCheckUtils]: 11: Hoare triple {83998#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {83998#(<= ~counter~0 0)} is VALID [2022-04-28 06:00:23,296 INFO L290 TraceCheckUtils]: 12: Hoare triple {83998#(<= ~counter~0 0)} ~cond := #in~cond; {83998#(<= ~counter~0 0)} is VALID [2022-04-28 06:00:23,296 INFO L290 TraceCheckUtils]: 13: Hoare triple {83998#(<= ~counter~0 0)} assume !(0 == ~cond); {83998#(<= ~counter~0 0)} is VALID [2022-04-28 06:00:23,296 INFO L290 TraceCheckUtils]: 14: Hoare triple {83998#(<= ~counter~0 0)} assume true; {83998#(<= ~counter~0 0)} is VALID [2022-04-28 06:00:23,297 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {83998#(<= ~counter~0 0)} {83998#(<= ~counter~0 0)} #92#return; {83998#(<= ~counter~0 0)} is VALID [2022-04-28 06:00:23,297 INFO L290 TraceCheckUtils]: 16: Hoare triple {83998#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {83998#(<= ~counter~0 0)} is VALID [2022-04-28 06:00:23,299 INFO L290 TraceCheckUtils]: 17: Hoare triple {83998#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {84047#(<= ~counter~0 1)} is VALID [2022-04-28 06:00:23,299 INFO L290 TraceCheckUtils]: 18: Hoare triple {84047#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {84047#(<= ~counter~0 1)} is VALID [2022-04-28 06:00:23,300 INFO L272 TraceCheckUtils]: 19: Hoare triple {84047#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {84047#(<= ~counter~0 1)} is VALID [2022-04-28 06:00:23,300 INFO L290 TraceCheckUtils]: 20: Hoare triple {84047#(<= ~counter~0 1)} ~cond := #in~cond; {84047#(<= ~counter~0 1)} is VALID [2022-04-28 06:00:23,300 INFO L290 TraceCheckUtils]: 21: Hoare triple {84047#(<= ~counter~0 1)} assume !(0 == ~cond); {84047#(<= ~counter~0 1)} is VALID [2022-04-28 06:00:23,301 INFO L290 TraceCheckUtils]: 22: Hoare triple {84047#(<= ~counter~0 1)} assume true; {84047#(<= ~counter~0 1)} is VALID [2022-04-28 06:00:23,301 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {84047#(<= ~counter~0 1)} {84047#(<= ~counter~0 1)} #94#return; {84047#(<= ~counter~0 1)} is VALID [2022-04-28 06:00:23,302 INFO L290 TraceCheckUtils]: 24: Hoare triple {84047#(<= ~counter~0 1)} assume !!(0 != ~r~0); {84047#(<= ~counter~0 1)} is VALID [2022-04-28 06:00:23,303 INFO L290 TraceCheckUtils]: 25: Hoare triple {84047#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {84072#(<= ~counter~0 2)} is VALID [2022-04-28 06:00:23,303 INFO L290 TraceCheckUtils]: 26: Hoare triple {84072#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {84072#(<= ~counter~0 2)} is VALID [2022-04-28 06:00:23,303 INFO L272 TraceCheckUtils]: 27: Hoare triple {84072#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {84072#(<= ~counter~0 2)} is VALID [2022-04-28 06:00:23,304 INFO L290 TraceCheckUtils]: 28: Hoare triple {84072#(<= ~counter~0 2)} ~cond := #in~cond; {84072#(<= ~counter~0 2)} is VALID [2022-04-28 06:00:23,304 INFO L290 TraceCheckUtils]: 29: Hoare triple {84072#(<= ~counter~0 2)} assume !(0 == ~cond); {84072#(<= ~counter~0 2)} is VALID [2022-04-28 06:00:23,304 INFO L290 TraceCheckUtils]: 30: Hoare triple {84072#(<= ~counter~0 2)} assume true; {84072#(<= ~counter~0 2)} is VALID [2022-04-28 06:00:23,305 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {84072#(<= ~counter~0 2)} {84072#(<= ~counter~0 2)} #96#return; {84072#(<= ~counter~0 2)} is VALID [2022-04-28 06:00:23,305 INFO L290 TraceCheckUtils]: 32: Hoare triple {84072#(<= ~counter~0 2)} assume !(~r~0 > 0); {84072#(<= ~counter~0 2)} is VALID [2022-04-28 06:00:23,306 INFO L290 TraceCheckUtils]: 33: Hoare triple {84072#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {84097#(<= ~counter~0 3)} is VALID [2022-04-28 06:00:23,306 INFO L290 TraceCheckUtils]: 34: Hoare triple {84097#(<= ~counter~0 3)} assume !!(#t~post8 < 20);havoc #t~post8; {84097#(<= ~counter~0 3)} is VALID [2022-04-28 06:00:23,307 INFO L272 TraceCheckUtils]: 35: Hoare triple {84097#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {84097#(<= ~counter~0 3)} is VALID [2022-04-28 06:00:23,307 INFO L290 TraceCheckUtils]: 36: Hoare triple {84097#(<= ~counter~0 3)} ~cond := #in~cond; {84097#(<= ~counter~0 3)} is VALID [2022-04-28 06:00:23,308 INFO L290 TraceCheckUtils]: 37: Hoare triple {84097#(<= ~counter~0 3)} assume !(0 == ~cond); {84097#(<= ~counter~0 3)} is VALID [2022-04-28 06:00:23,308 INFO L290 TraceCheckUtils]: 38: Hoare triple {84097#(<= ~counter~0 3)} assume true; {84097#(<= ~counter~0 3)} is VALID [2022-04-28 06:00:23,309 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {84097#(<= ~counter~0 3)} {84097#(<= ~counter~0 3)} #98#return; {84097#(<= ~counter~0 3)} is VALID [2022-04-28 06:00:23,309 INFO L290 TraceCheckUtils]: 40: Hoare triple {84097#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {84097#(<= ~counter~0 3)} is VALID [2022-04-28 06:00:23,310 INFO L290 TraceCheckUtils]: 41: Hoare triple {84097#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {84122#(<= ~counter~0 4)} is VALID [2022-04-28 06:00:23,310 INFO L290 TraceCheckUtils]: 42: Hoare triple {84122#(<= ~counter~0 4)} assume !!(#t~post8 < 20);havoc #t~post8; {84122#(<= ~counter~0 4)} is VALID [2022-04-28 06:00:23,311 INFO L272 TraceCheckUtils]: 43: Hoare triple {84122#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {84122#(<= ~counter~0 4)} is VALID [2022-04-28 06:00:23,311 INFO L290 TraceCheckUtils]: 44: Hoare triple {84122#(<= ~counter~0 4)} ~cond := #in~cond; {84122#(<= ~counter~0 4)} is VALID [2022-04-28 06:00:23,311 INFO L290 TraceCheckUtils]: 45: Hoare triple {84122#(<= ~counter~0 4)} assume !(0 == ~cond); {84122#(<= ~counter~0 4)} is VALID [2022-04-28 06:00:23,312 INFO L290 TraceCheckUtils]: 46: Hoare triple {84122#(<= ~counter~0 4)} assume true; {84122#(<= ~counter~0 4)} is VALID [2022-04-28 06:00:23,312 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {84122#(<= ~counter~0 4)} {84122#(<= ~counter~0 4)} #98#return; {84122#(<= ~counter~0 4)} is VALID [2022-04-28 06:00:23,312 INFO L290 TraceCheckUtils]: 48: Hoare triple {84122#(<= ~counter~0 4)} assume !(~r~0 < 0); {84122#(<= ~counter~0 4)} is VALID [2022-04-28 06:00:23,313 INFO L290 TraceCheckUtils]: 49: Hoare triple {84122#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {84147#(<= ~counter~0 5)} is VALID [2022-04-28 06:00:23,314 INFO L290 TraceCheckUtils]: 50: Hoare triple {84147#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {84147#(<= ~counter~0 5)} is VALID [2022-04-28 06:00:23,314 INFO L272 TraceCheckUtils]: 51: Hoare triple {84147#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {84147#(<= ~counter~0 5)} is VALID [2022-04-28 06:00:23,314 INFO L290 TraceCheckUtils]: 52: Hoare triple {84147#(<= ~counter~0 5)} ~cond := #in~cond; {84147#(<= ~counter~0 5)} is VALID [2022-04-28 06:00:23,315 INFO L290 TraceCheckUtils]: 53: Hoare triple {84147#(<= ~counter~0 5)} assume !(0 == ~cond); {84147#(<= ~counter~0 5)} is VALID [2022-04-28 06:00:23,315 INFO L290 TraceCheckUtils]: 54: Hoare triple {84147#(<= ~counter~0 5)} assume true; {84147#(<= ~counter~0 5)} is VALID [2022-04-28 06:00:23,316 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {84147#(<= ~counter~0 5)} {84147#(<= ~counter~0 5)} #94#return; {84147#(<= ~counter~0 5)} is VALID [2022-04-28 06:00:23,316 INFO L290 TraceCheckUtils]: 56: Hoare triple {84147#(<= ~counter~0 5)} assume !!(0 != ~r~0); {84147#(<= ~counter~0 5)} is VALID [2022-04-28 06:00:23,317 INFO L290 TraceCheckUtils]: 57: Hoare triple {84147#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {84172#(<= ~counter~0 6)} is VALID [2022-04-28 06:00:23,317 INFO L290 TraceCheckUtils]: 58: Hoare triple {84172#(<= ~counter~0 6)} assume !!(#t~post7 < 20);havoc #t~post7; {84172#(<= ~counter~0 6)} is VALID [2022-04-28 06:00:23,318 INFO L272 TraceCheckUtils]: 59: Hoare triple {84172#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {84172#(<= ~counter~0 6)} is VALID [2022-04-28 06:00:23,318 INFO L290 TraceCheckUtils]: 60: Hoare triple {84172#(<= ~counter~0 6)} ~cond := #in~cond; {84172#(<= ~counter~0 6)} is VALID [2022-04-28 06:00:23,318 INFO L290 TraceCheckUtils]: 61: Hoare triple {84172#(<= ~counter~0 6)} assume !(0 == ~cond); {84172#(<= ~counter~0 6)} is VALID [2022-04-28 06:00:23,319 INFO L290 TraceCheckUtils]: 62: Hoare triple {84172#(<= ~counter~0 6)} assume true; {84172#(<= ~counter~0 6)} is VALID [2022-04-28 06:00:23,319 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {84172#(<= ~counter~0 6)} {84172#(<= ~counter~0 6)} #96#return; {84172#(<= ~counter~0 6)} is VALID [2022-04-28 06:00:23,319 INFO L290 TraceCheckUtils]: 64: Hoare triple {84172#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {84172#(<= ~counter~0 6)} is VALID [2022-04-28 06:00:23,321 INFO L290 TraceCheckUtils]: 65: Hoare triple {84172#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {84197#(<= ~counter~0 7)} is VALID [2022-04-28 06:00:23,321 INFO L290 TraceCheckUtils]: 66: Hoare triple {84197#(<= ~counter~0 7)} assume !!(#t~post7 < 20);havoc #t~post7; {84197#(<= ~counter~0 7)} is VALID [2022-04-28 06:00:23,322 INFO L272 TraceCheckUtils]: 67: Hoare triple {84197#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {84197#(<= ~counter~0 7)} is VALID [2022-04-28 06:00:23,322 INFO L290 TraceCheckUtils]: 68: Hoare triple {84197#(<= ~counter~0 7)} ~cond := #in~cond; {84197#(<= ~counter~0 7)} is VALID [2022-04-28 06:00:23,322 INFO L290 TraceCheckUtils]: 69: Hoare triple {84197#(<= ~counter~0 7)} assume !(0 == ~cond); {84197#(<= ~counter~0 7)} is VALID [2022-04-28 06:00:23,322 INFO L290 TraceCheckUtils]: 70: Hoare triple {84197#(<= ~counter~0 7)} assume true; {84197#(<= ~counter~0 7)} is VALID [2022-04-28 06:00:23,323 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {84197#(<= ~counter~0 7)} {84197#(<= ~counter~0 7)} #96#return; {84197#(<= ~counter~0 7)} is VALID [2022-04-28 06:00:23,323 INFO L290 TraceCheckUtils]: 72: Hoare triple {84197#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {84197#(<= ~counter~0 7)} is VALID [2022-04-28 06:00:23,324 INFO L290 TraceCheckUtils]: 73: Hoare triple {84197#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {84222#(<= ~counter~0 8)} is VALID [2022-04-28 06:00:23,325 INFO L290 TraceCheckUtils]: 74: Hoare triple {84222#(<= ~counter~0 8)} assume !!(#t~post7 < 20);havoc #t~post7; {84222#(<= ~counter~0 8)} is VALID [2022-04-28 06:00:23,325 INFO L272 TraceCheckUtils]: 75: Hoare triple {84222#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {84222#(<= ~counter~0 8)} is VALID [2022-04-28 06:00:23,326 INFO L290 TraceCheckUtils]: 76: Hoare triple {84222#(<= ~counter~0 8)} ~cond := #in~cond; {84222#(<= ~counter~0 8)} is VALID [2022-04-28 06:00:23,326 INFO L290 TraceCheckUtils]: 77: Hoare triple {84222#(<= ~counter~0 8)} assume !(0 == ~cond); {84222#(<= ~counter~0 8)} is VALID [2022-04-28 06:00:23,326 INFO L290 TraceCheckUtils]: 78: Hoare triple {84222#(<= ~counter~0 8)} assume true; {84222#(<= ~counter~0 8)} is VALID [2022-04-28 06:00:23,327 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {84222#(<= ~counter~0 8)} {84222#(<= ~counter~0 8)} #96#return; {84222#(<= ~counter~0 8)} is VALID [2022-04-28 06:00:23,327 INFO L290 TraceCheckUtils]: 80: Hoare triple {84222#(<= ~counter~0 8)} assume !(~r~0 > 0); {84222#(<= ~counter~0 8)} is VALID [2022-04-28 06:00:23,328 INFO L290 TraceCheckUtils]: 81: Hoare triple {84222#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {84247#(<= ~counter~0 9)} is VALID [2022-04-28 06:00:23,328 INFO L290 TraceCheckUtils]: 82: Hoare triple {84247#(<= ~counter~0 9)} assume !!(#t~post8 < 20);havoc #t~post8; {84247#(<= ~counter~0 9)} is VALID [2022-04-28 06:00:23,329 INFO L272 TraceCheckUtils]: 83: Hoare triple {84247#(<= ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {84247#(<= ~counter~0 9)} is VALID [2022-04-28 06:00:23,329 INFO L290 TraceCheckUtils]: 84: Hoare triple {84247#(<= ~counter~0 9)} ~cond := #in~cond; {84247#(<= ~counter~0 9)} is VALID [2022-04-28 06:00:23,329 INFO L290 TraceCheckUtils]: 85: Hoare triple {84247#(<= ~counter~0 9)} assume !(0 == ~cond); {84247#(<= ~counter~0 9)} is VALID [2022-04-28 06:00:23,330 INFO L290 TraceCheckUtils]: 86: Hoare triple {84247#(<= ~counter~0 9)} assume true; {84247#(<= ~counter~0 9)} is VALID [2022-04-28 06:00:23,330 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {84247#(<= ~counter~0 9)} {84247#(<= ~counter~0 9)} #98#return; {84247#(<= ~counter~0 9)} is VALID [2022-04-28 06:00:23,331 INFO L290 TraceCheckUtils]: 88: Hoare triple {84247#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {84247#(<= ~counter~0 9)} is VALID [2022-04-28 06:00:23,332 INFO L290 TraceCheckUtils]: 89: Hoare triple {84247#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {84272#(<= ~counter~0 10)} is VALID [2022-04-28 06:00:23,332 INFO L290 TraceCheckUtils]: 90: Hoare triple {84272#(<= ~counter~0 10)} assume !!(#t~post8 < 20);havoc #t~post8; {84272#(<= ~counter~0 10)} is VALID [2022-04-28 06:00:23,332 INFO L272 TraceCheckUtils]: 91: Hoare triple {84272#(<= ~counter~0 10)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {84272#(<= ~counter~0 10)} is VALID [2022-04-28 06:00:23,333 INFO L290 TraceCheckUtils]: 92: Hoare triple {84272#(<= ~counter~0 10)} ~cond := #in~cond; {84272#(<= ~counter~0 10)} is VALID [2022-04-28 06:00:23,333 INFO L290 TraceCheckUtils]: 93: Hoare triple {84272#(<= ~counter~0 10)} assume !(0 == ~cond); {84272#(<= ~counter~0 10)} is VALID [2022-04-28 06:00:23,333 INFO L290 TraceCheckUtils]: 94: Hoare triple {84272#(<= ~counter~0 10)} assume true; {84272#(<= ~counter~0 10)} is VALID [2022-04-28 06:00:23,334 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {84272#(<= ~counter~0 10)} {84272#(<= ~counter~0 10)} #98#return; {84272#(<= ~counter~0 10)} is VALID [2022-04-28 06:00:23,334 INFO L290 TraceCheckUtils]: 96: Hoare triple {84272#(<= ~counter~0 10)} assume !(~r~0 < 0); {84272#(<= ~counter~0 10)} is VALID [2022-04-28 06:00:23,335 INFO L290 TraceCheckUtils]: 97: Hoare triple {84272#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {84297#(<= ~counter~0 11)} is VALID [2022-04-28 06:00:23,335 INFO L290 TraceCheckUtils]: 98: Hoare triple {84297#(<= ~counter~0 11)} assume !!(#t~post6 < 20);havoc #t~post6; {84297#(<= ~counter~0 11)} is VALID [2022-04-28 06:00:23,336 INFO L272 TraceCheckUtils]: 99: Hoare triple {84297#(<= ~counter~0 11)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {84297#(<= ~counter~0 11)} is VALID [2022-04-28 06:00:23,336 INFO L290 TraceCheckUtils]: 100: Hoare triple {84297#(<= ~counter~0 11)} ~cond := #in~cond; {84297#(<= ~counter~0 11)} is VALID [2022-04-28 06:00:23,337 INFO L290 TraceCheckUtils]: 101: Hoare triple {84297#(<= ~counter~0 11)} assume !(0 == ~cond); {84297#(<= ~counter~0 11)} is VALID [2022-04-28 06:00:23,337 INFO L290 TraceCheckUtils]: 102: Hoare triple {84297#(<= ~counter~0 11)} assume true; {84297#(<= ~counter~0 11)} is VALID [2022-04-28 06:00:23,337 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {84297#(<= ~counter~0 11)} {84297#(<= ~counter~0 11)} #94#return; {84297#(<= ~counter~0 11)} is VALID [2022-04-28 06:00:23,338 INFO L290 TraceCheckUtils]: 104: Hoare triple {84297#(<= ~counter~0 11)} assume !!(0 != ~r~0); {84297#(<= ~counter~0 11)} is VALID [2022-04-28 06:00:23,339 INFO L290 TraceCheckUtils]: 105: Hoare triple {84297#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {84322#(<= ~counter~0 12)} is VALID [2022-04-28 06:00:23,339 INFO L290 TraceCheckUtils]: 106: Hoare triple {84322#(<= ~counter~0 12)} assume !!(#t~post7 < 20);havoc #t~post7; {84322#(<= ~counter~0 12)} is VALID [2022-04-28 06:00:23,340 INFO L272 TraceCheckUtils]: 107: Hoare triple {84322#(<= ~counter~0 12)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {84322#(<= ~counter~0 12)} is VALID [2022-04-28 06:00:23,340 INFO L290 TraceCheckUtils]: 108: Hoare triple {84322#(<= ~counter~0 12)} ~cond := #in~cond; {84322#(<= ~counter~0 12)} is VALID [2022-04-28 06:00:23,340 INFO L290 TraceCheckUtils]: 109: Hoare triple {84322#(<= ~counter~0 12)} assume !(0 == ~cond); {84322#(<= ~counter~0 12)} is VALID [2022-04-28 06:00:23,341 INFO L290 TraceCheckUtils]: 110: Hoare triple {84322#(<= ~counter~0 12)} assume true; {84322#(<= ~counter~0 12)} is VALID [2022-04-28 06:00:23,341 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {84322#(<= ~counter~0 12)} {84322#(<= ~counter~0 12)} #96#return; {84322#(<= ~counter~0 12)} is VALID [2022-04-28 06:00:23,341 INFO L290 TraceCheckUtils]: 112: Hoare triple {84322#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {84322#(<= ~counter~0 12)} is VALID [2022-04-28 06:00:23,342 INFO L290 TraceCheckUtils]: 113: Hoare triple {84322#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {84347#(<= |main_#t~post7| 12)} is VALID [2022-04-28 06:00:23,342 INFO L290 TraceCheckUtils]: 114: Hoare triple {84347#(<= |main_#t~post7| 12)} assume !(#t~post7 < 20);havoc #t~post7; {83991#false} is VALID [2022-04-28 06:00:23,342 INFO L290 TraceCheckUtils]: 115: Hoare triple {83991#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {83991#false} is VALID [2022-04-28 06:00:23,342 INFO L290 TraceCheckUtils]: 116: Hoare triple {83991#false} assume !(#t~post8 < 20);havoc #t~post8; {83991#false} is VALID [2022-04-28 06:00:23,342 INFO L290 TraceCheckUtils]: 117: Hoare triple {83991#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {83991#false} is VALID [2022-04-28 06:00:23,342 INFO L290 TraceCheckUtils]: 118: Hoare triple {83991#false} assume !(#t~post6 < 20);havoc #t~post6; {83991#false} is VALID [2022-04-28 06:00:23,343 INFO L272 TraceCheckUtils]: 119: Hoare triple {83991#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {83991#false} is VALID [2022-04-28 06:00:23,343 INFO L290 TraceCheckUtils]: 120: Hoare triple {83991#false} ~cond := #in~cond; {83991#false} is VALID [2022-04-28 06:00:23,343 INFO L290 TraceCheckUtils]: 121: Hoare triple {83991#false} assume 0 == ~cond; {83991#false} is VALID [2022-04-28 06:00:23,343 INFO L290 TraceCheckUtils]: 122: Hoare triple {83991#false} assume !false; {83991#false} is VALID [2022-04-28 06:00:23,343 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 38 proven. 350 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 06:00:23,343 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 06:00:24,046 INFO L290 TraceCheckUtils]: 122: Hoare triple {83991#false} assume !false; {83991#false} is VALID [2022-04-28 06:00:24,047 INFO L290 TraceCheckUtils]: 121: Hoare triple {83991#false} assume 0 == ~cond; {83991#false} is VALID [2022-04-28 06:00:24,047 INFO L290 TraceCheckUtils]: 120: Hoare triple {83991#false} ~cond := #in~cond; {83991#false} is VALID [2022-04-28 06:00:24,047 INFO L272 TraceCheckUtils]: 119: Hoare triple {83991#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {83991#false} is VALID [2022-04-28 06:00:24,047 INFO L290 TraceCheckUtils]: 118: Hoare triple {83991#false} assume !(#t~post6 < 20);havoc #t~post6; {83991#false} is VALID [2022-04-28 06:00:24,047 INFO L290 TraceCheckUtils]: 117: Hoare triple {83991#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {83991#false} is VALID [2022-04-28 06:00:24,047 INFO L290 TraceCheckUtils]: 116: Hoare triple {83991#false} assume !(#t~post8 < 20);havoc #t~post8; {83991#false} is VALID [2022-04-28 06:00:24,047 INFO L290 TraceCheckUtils]: 115: Hoare triple {83991#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {83991#false} is VALID [2022-04-28 06:00:24,047 INFO L290 TraceCheckUtils]: 114: Hoare triple {84399#(< |main_#t~post7| 20)} assume !(#t~post7 < 20);havoc #t~post7; {83991#false} is VALID [2022-04-28 06:00:24,048 INFO L290 TraceCheckUtils]: 113: Hoare triple {84403#(< ~counter~0 20)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {84399#(< |main_#t~post7| 20)} is VALID [2022-04-28 06:00:24,048 INFO L290 TraceCheckUtils]: 112: Hoare triple {84403#(< ~counter~0 20)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {84403#(< ~counter~0 20)} is VALID [2022-04-28 06:00:24,049 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {83990#true} {84403#(< ~counter~0 20)} #96#return; {84403#(< ~counter~0 20)} is VALID [2022-04-28 06:00:24,049 INFO L290 TraceCheckUtils]: 110: Hoare triple {83990#true} assume true; {83990#true} is VALID [2022-04-28 06:00:24,049 INFO L290 TraceCheckUtils]: 109: Hoare triple {83990#true} assume !(0 == ~cond); {83990#true} is VALID [2022-04-28 06:00:24,049 INFO L290 TraceCheckUtils]: 108: Hoare triple {83990#true} ~cond := #in~cond; {83990#true} is VALID [2022-04-28 06:00:24,049 INFO L272 TraceCheckUtils]: 107: Hoare triple {84403#(< ~counter~0 20)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {83990#true} is VALID [2022-04-28 06:00:24,049 INFO L290 TraceCheckUtils]: 106: Hoare triple {84403#(< ~counter~0 20)} assume !!(#t~post7 < 20);havoc #t~post7; {84403#(< ~counter~0 20)} is VALID [2022-04-28 06:00:24,051 INFO L290 TraceCheckUtils]: 105: Hoare triple {84428#(< ~counter~0 19)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {84403#(< ~counter~0 20)} is VALID [2022-04-28 06:00:24,052 INFO L290 TraceCheckUtils]: 104: Hoare triple {84428#(< ~counter~0 19)} assume !!(0 != ~r~0); {84428#(< ~counter~0 19)} is VALID [2022-04-28 06:00:24,052 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {83990#true} {84428#(< ~counter~0 19)} #94#return; {84428#(< ~counter~0 19)} is VALID [2022-04-28 06:00:24,052 INFO L290 TraceCheckUtils]: 102: Hoare triple {83990#true} assume true; {83990#true} is VALID [2022-04-28 06:00:24,052 INFO L290 TraceCheckUtils]: 101: Hoare triple {83990#true} assume !(0 == ~cond); {83990#true} is VALID [2022-04-28 06:00:24,052 INFO L290 TraceCheckUtils]: 100: Hoare triple {83990#true} ~cond := #in~cond; {83990#true} is VALID [2022-04-28 06:00:24,052 INFO L272 TraceCheckUtils]: 99: Hoare triple {84428#(< ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {83990#true} is VALID [2022-04-28 06:00:24,053 INFO L290 TraceCheckUtils]: 98: Hoare triple {84428#(< ~counter~0 19)} assume !!(#t~post6 < 20);havoc #t~post6; {84428#(< ~counter~0 19)} is VALID [2022-04-28 06:00:24,054 INFO L290 TraceCheckUtils]: 97: Hoare triple {84453#(< ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {84428#(< ~counter~0 19)} is VALID [2022-04-28 06:00:24,054 INFO L290 TraceCheckUtils]: 96: Hoare triple {84453#(< ~counter~0 18)} assume !(~r~0 < 0); {84453#(< ~counter~0 18)} is VALID [2022-04-28 06:00:24,055 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {83990#true} {84453#(< ~counter~0 18)} #98#return; {84453#(< ~counter~0 18)} is VALID [2022-04-28 06:00:24,055 INFO L290 TraceCheckUtils]: 94: Hoare triple {83990#true} assume true; {83990#true} is VALID [2022-04-28 06:00:24,055 INFO L290 TraceCheckUtils]: 93: Hoare triple {83990#true} assume !(0 == ~cond); {83990#true} is VALID [2022-04-28 06:00:24,055 INFO L290 TraceCheckUtils]: 92: Hoare triple {83990#true} ~cond := #in~cond; {83990#true} is VALID [2022-04-28 06:00:24,055 INFO L272 TraceCheckUtils]: 91: Hoare triple {84453#(< ~counter~0 18)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {83990#true} is VALID [2022-04-28 06:00:24,055 INFO L290 TraceCheckUtils]: 90: Hoare triple {84453#(< ~counter~0 18)} assume !!(#t~post8 < 20);havoc #t~post8; {84453#(< ~counter~0 18)} is VALID [2022-04-28 06:00:24,056 INFO L290 TraceCheckUtils]: 89: Hoare triple {84478#(< ~counter~0 17)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {84453#(< ~counter~0 18)} is VALID [2022-04-28 06:00:24,056 INFO L290 TraceCheckUtils]: 88: Hoare triple {84478#(< ~counter~0 17)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {84478#(< ~counter~0 17)} is VALID [2022-04-28 06:00:24,057 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {83990#true} {84478#(< ~counter~0 17)} #98#return; {84478#(< ~counter~0 17)} is VALID [2022-04-28 06:00:24,057 INFO L290 TraceCheckUtils]: 86: Hoare triple {83990#true} assume true; {83990#true} is VALID [2022-04-28 06:00:24,057 INFO L290 TraceCheckUtils]: 85: Hoare triple {83990#true} assume !(0 == ~cond); {83990#true} is VALID [2022-04-28 06:00:24,057 INFO L290 TraceCheckUtils]: 84: Hoare triple {83990#true} ~cond := #in~cond; {83990#true} is VALID [2022-04-28 06:00:24,057 INFO L272 TraceCheckUtils]: 83: Hoare triple {84478#(< ~counter~0 17)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {83990#true} is VALID [2022-04-28 06:00:24,058 INFO L290 TraceCheckUtils]: 82: Hoare triple {84478#(< ~counter~0 17)} assume !!(#t~post8 < 20);havoc #t~post8; {84478#(< ~counter~0 17)} is VALID [2022-04-28 06:00:24,059 INFO L290 TraceCheckUtils]: 81: Hoare triple {84503#(< ~counter~0 16)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {84478#(< ~counter~0 17)} is VALID [2022-04-28 06:00:24,059 INFO L290 TraceCheckUtils]: 80: Hoare triple {84503#(< ~counter~0 16)} assume !(~r~0 > 0); {84503#(< ~counter~0 16)} is VALID [2022-04-28 06:00:24,059 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {83990#true} {84503#(< ~counter~0 16)} #96#return; {84503#(< ~counter~0 16)} is VALID [2022-04-28 06:00:24,060 INFO L290 TraceCheckUtils]: 78: Hoare triple {83990#true} assume true; {83990#true} is VALID [2022-04-28 06:00:24,060 INFO L290 TraceCheckUtils]: 77: Hoare triple {83990#true} assume !(0 == ~cond); {83990#true} is VALID [2022-04-28 06:00:24,060 INFO L290 TraceCheckUtils]: 76: Hoare triple {83990#true} ~cond := #in~cond; {83990#true} is VALID [2022-04-28 06:00:24,060 INFO L272 TraceCheckUtils]: 75: Hoare triple {84503#(< ~counter~0 16)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {83990#true} is VALID [2022-04-28 06:00:24,060 INFO L290 TraceCheckUtils]: 74: Hoare triple {84503#(< ~counter~0 16)} assume !!(#t~post7 < 20);havoc #t~post7; {84503#(< ~counter~0 16)} is VALID [2022-04-28 06:00:24,061 INFO L290 TraceCheckUtils]: 73: Hoare triple {84528#(< ~counter~0 15)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {84503#(< ~counter~0 16)} is VALID [2022-04-28 06:00:24,061 INFO L290 TraceCheckUtils]: 72: Hoare triple {84528#(< ~counter~0 15)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {84528#(< ~counter~0 15)} is VALID [2022-04-28 06:00:24,062 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {83990#true} {84528#(< ~counter~0 15)} #96#return; {84528#(< ~counter~0 15)} is VALID [2022-04-28 06:00:24,062 INFO L290 TraceCheckUtils]: 70: Hoare triple {83990#true} assume true; {83990#true} is VALID [2022-04-28 06:00:24,062 INFO L290 TraceCheckUtils]: 69: Hoare triple {83990#true} assume !(0 == ~cond); {83990#true} is VALID [2022-04-28 06:00:24,062 INFO L290 TraceCheckUtils]: 68: Hoare triple {83990#true} ~cond := #in~cond; {83990#true} is VALID [2022-04-28 06:00:24,062 INFO L272 TraceCheckUtils]: 67: Hoare triple {84528#(< ~counter~0 15)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {83990#true} is VALID [2022-04-28 06:00:24,062 INFO L290 TraceCheckUtils]: 66: Hoare triple {84528#(< ~counter~0 15)} assume !!(#t~post7 < 20);havoc #t~post7; {84528#(< ~counter~0 15)} is VALID [2022-04-28 06:00:24,063 INFO L290 TraceCheckUtils]: 65: Hoare triple {84553#(< ~counter~0 14)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {84528#(< ~counter~0 15)} is VALID [2022-04-28 06:00:24,064 INFO L290 TraceCheckUtils]: 64: Hoare triple {84553#(< ~counter~0 14)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {84553#(< ~counter~0 14)} is VALID [2022-04-28 06:00:24,064 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {83990#true} {84553#(< ~counter~0 14)} #96#return; {84553#(< ~counter~0 14)} is VALID [2022-04-28 06:00:24,064 INFO L290 TraceCheckUtils]: 62: Hoare triple {83990#true} assume true; {83990#true} is VALID [2022-04-28 06:00:24,064 INFO L290 TraceCheckUtils]: 61: Hoare triple {83990#true} assume !(0 == ~cond); {83990#true} is VALID [2022-04-28 06:00:24,065 INFO L290 TraceCheckUtils]: 60: Hoare triple {83990#true} ~cond := #in~cond; {83990#true} is VALID [2022-04-28 06:00:24,065 INFO L272 TraceCheckUtils]: 59: Hoare triple {84553#(< ~counter~0 14)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {83990#true} is VALID [2022-04-28 06:00:24,065 INFO L290 TraceCheckUtils]: 58: Hoare triple {84553#(< ~counter~0 14)} assume !!(#t~post7 < 20);havoc #t~post7; {84553#(< ~counter~0 14)} is VALID [2022-04-28 06:00:24,066 INFO L290 TraceCheckUtils]: 57: Hoare triple {84322#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {84553#(< ~counter~0 14)} is VALID [2022-04-28 06:00:24,066 INFO L290 TraceCheckUtils]: 56: Hoare triple {84322#(<= ~counter~0 12)} assume !!(0 != ~r~0); {84322#(<= ~counter~0 12)} is VALID [2022-04-28 06:00:24,067 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {83990#true} {84322#(<= ~counter~0 12)} #94#return; {84322#(<= ~counter~0 12)} is VALID [2022-04-28 06:00:24,067 INFO L290 TraceCheckUtils]: 54: Hoare triple {83990#true} assume true; {83990#true} is VALID [2022-04-28 06:00:24,067 INFO L290 TraceCheckUtils]: 53: Hoare triple {83990#true} assume !(0 == ~cond); {83990#true} is VALID [2022-04-28 06:00:24,067 INFO L290 TraceCheckUtils]: 52: Hoare triple {83990#true} ~cond := #in~cond; {83990#true} is VALID [2022-04-28 06:00:24,067 INFO L272 TraceCheckUtils]: 51: Hoare triple {84322#(<= ~counter~0 12)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {83990#true} is VALID [2022-04-28 06:00:24,067 INFO L290 TraceCheckUtils]: 50: Hoare triple {84322#(<= ~counter~0 12)} assume !!(#t~post6 < 20);havoc #t~post6; {84322#(<= ~counter~0 12)} is VALID [2022-04-28 06:00:24,068 INFO L290 TraceCheckUtils]: 49: Hoare triple {84297#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {84322#(<= ~counter~0 12)} is VALID [2022-04-28 06:00:24,069 INFO L290 TraceCheckUtils]: 48: Hoare triple {84297#(<= ~counter~0 11)} assume !(~r~0 < 0); {84297#(<= ~counter~0 11)} is VALID [2022-04-28 06:00:24,069 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {83990#true} {84297#(<= ~counter~0 11)} #98#return; {84297#(<= ~counter~0 11)} is VALID [2022-04-28 06:00:24,069 INFO L290 TraceCheckUtils]: 46: Hoare triple {83990#true} assume true; {83990#true} is VALID [2022-04-28 06:00:24,069 INFO L290 TraceCheckUtils]: 45: Hoare triple {83990#true} assume !(0 == ~cond); {83990#true} is VALID [2022-04-28 06:00:24,069 INFO L290 TraceCheckUtils]: 44: Hoare triple {83990#true} ~cond := #in~cond; {83990#true} is VALID [2022-04-28 06:00:24,069 INFO L272 TraceCheckUtils]: 43: Hoare triple {84297#(<= ~counter~0 11)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {83990#true} is VALID [2022-04-28 06:00:24,070 INFO L290 TraceCheckUtils]: 42: Hoare triple {84297#(<= ~counter~0 11)} assume !!(#t~post8 < 20);havoc #t~post8; {84297#(<= ~counter~0 11)} is VALID [2022-04-28 06:00:24,071 INFO L290 TraceCheckUtils]: 41: Hoare triple {84272#(<= ~counter~0 10)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {84297#(<= ~counter~0 11)} is VALID [2022-04-28 06:00:24,071 INFO L290 TraceCheckUtils]: 40: Hoare triple {84272#(<= ~counter~0 10)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {84272#(<= ~counter~0 10)} is VALID [2022-04-28 06:00:24,071 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {83990#true} {84272#(<= ~counter~0 10)} #98#return; {84272#(<= ~counter~0 10)} is VALID [2022-04-28 06:00:24,072 INFO L290 TraceCheckUtils]: 38: Hoare triple {83990#true} assume true; {83990#true} is VALID [2022-04-28 06:00:24,072 INFO L290 TraceCheckUtils]: 37: Hoare triple {83990#true} assume !(0 == ~cond); {83990#true} is VALID [2022-04-28 06:00:24,072 INFO L290 TraceCheckUtils]: 36: Hoare triple {83990#true} ~cond := #in~cond; {83990#true} is VALID [2022-04-28 06:00:24,072 INFO L272 TraceCheckUtils]: 35: Hoare triple {84272#(<= ~counter~0 10)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {83990#true} is VALID [2022-04-28 06:00:24,072 INFO L290 TraceCheckUtils]: 34: Hoare triple {84272#(<= ~counter~0 10)} assume !!(#t~post8 < 20);havoc #t~post8; {84272#(<= ~counter~0 10)} is VALID [2022-04-28 06:00:24,073 INFO L290 TraceCheckUtils]: 33: Hoare triple {84247#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {84272#(<= ~counter~0 10)} is VALID [2022-04-28 06:00:24,073 INFO L290 TraceCheckUtils]: 32: Hoare triple {84247#(<= ~counter~0 9)} assume !(~r~0 > 0); {84247#(<= ~counter~0 9)} is VALID [2022-04-28 06:00:24,074 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {83990#true} {84247#(<= ~counter~0 9)} #96#return; {84247#(<= ~counter~0 9)} is VALID [2022-04-28 06:00:24,074 INFO L290 TraceCheckUtils]: 30: Hoare triple {83990#true} assume true; {83990#true} is VALID [2022-04-28 06:00:24,074 INFO L290 TraceCheckUtils]: 29: Hoare triple {83990#true} assume !(0 == ~cond); {83990#true} is VALID [2022-04-28 06:00:24,074 INFO L290 TraceCheckUtils]: 28: Hoare triple {83990#true} ~cond := #in~cond; {83990#true} is VALID [2022-04-28 06:00:24,074 INFO L272 TraceCheckUtils]: 27: Hoare triple {84247#(<= ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {83990#true} is VALID [2022-04-28 06:00:24,074 INFO L290 TraceCheckUtils]: 26: Hoare triple {84247#(<= ~counter~0 9)} assume !!(#t~post7 < 20);havoc #t~post7; {84247#(<= ~counter~0 9)} is VALID [2022-04-28 06:00:24,075 INFO L290 TraceCheckUtils]: 25: Hoare triple {84222#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {84247#(<= ~counter~0 9)} is VALID [2022-04-28 06:00:24,076 INFO L290 TraceCheckUtils]: 24: Hoare triple {84222#(<= ~counter~0 8)} assume !!(0 != ~r~0); {84222#(<= ~counter~0 8)} is VALID [2022-04-28 06:00:24,076 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {83990#true} {84222#(<= ~counter~0 8)} #94#return; {84222#(<= ~counter~0 8)} is VALID [2022-04-28 06:00:24,076 INFO L290 TraceCheckUtils]: 22: Hoare triple {83990#true} assume true; {83990#true} is VALID [2022-04-28 06:00:24,076 INFO L290 TraceCheckUtils]: 21: Hoare triple {83990#true} assume !(0 == ~cond); {83990#true} is VALID [2022-04-28 06:00:24,076 INFO L290 TraceCheckUtils]: 20: Hoare triple {83990#true} ~cond := #in~cond; {83990#true} is VALID [2022-04-28 06:00:24,077 INFO L272 TraceCheckUtils]: 19: Hoare triple {84222#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {83990#true} is VALID [2022-04-28 06:00:24,077 INFO L290 TraceCheckUtils]: 18: Hoare triple {84222#(<= ~counter~0 8)} assume !!(#t~post6 < 20);havoc #t~post6; {84222#(<= ~counter~0 8)} is VALID [2022-04-28 06:00:24,078 INFO L290 TraceCheckUtils]: 17: Hoare triple {84197#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {84222#(<= ~counter~0 8)} is VALID [2022-04-28 06:00:24,078 INFO L290 TraceCheckUtils]: 16: Hoare triple {84197#(<= ~counter~0 7)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {84197#(<= ~counter~0 7)} is VALID [2022-04-28 06:00:24,079 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {83990#true} {84197#(<= ~counter~0 7)} #92#return; {84197#(<= ~counter~0 7)} is VALID [2022-04-28 06:00:24,079 INFO L290 TraceCheckUtils]: 14: Hoare triple {83990#true} assume true; {83990#true} is VALID [2022-04-28 06:00:24,079 INFO L290 TraceCheckUtils]: 13: Hoare triple {83990#true} assume !(0 == ~cond); {83990#true} is VALID [2022-04-28 06:00:24,079 INFO L290 TraceCheckUtils]: 12: Hoare triple {83990#true} ~cond := #in~cond; {83990#true} is VALID [2022-04-28 06:00:24,079 INFO L272 TraceCheckUtils]: 11: Hoare triple {84197#(<= ~counter~0 7)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {83990#true} is VALID [2022-04-28 06:00:24,079 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {83990#true} {84197#(<= ~counter~0 7)} #90#return; {84197#(<= ~counter~0 7)} is VALID [2022-04-28 06:00:24,079 INFO L290 TraceCheckUtils]: 9: Hoare triple {83990#true} assume true; {83990#true} is VALID [2022-04-28 06:00:24,079 INFO L290 TraceCheckUtils]: 8: Hoare triple {83990#true} assume !(0 == ~cond); {83990#true} is VALID [2022-04-28 06:00:24,080 INFO L290 TraceCheckUtils]: 7: Hoare triple {83990#true} ~cond := #in~cond; {83990#true} is VALID [2022-04-28 06:00:24,080 INFO L272 TraceCheckUtils]: 6: Hoare triple {84197#(<= ~counter~0 7)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {83990#true} is VALID [2022-04-28 06:00:24,080 INFO L290 TraceCheckUtils]: 5: Hoare triple {84197#(<= ~counter~0 7)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {84197#(<= ~counter~0 7)} is VALID [2022-04-28 06:00:24,080 INFO L272 TraceCheckUtils]: 4: Hoare triple {84197#(<= ~counter~0 7)} call #t~ret9 := main(); {84197#(<= ~counter~0 7)} is VALID [2022-04-28 06:00:24,081 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {84197#(<= ~counter~0 7)} {83990#true} #102#return; {84197#(<= ~counter~0 7)} is VALID [2022-04-28 06:00:24,081 INFO L290 TraceCheckUtils]: 2: Hoare triple {84197#(<= ~counter~0 7)} assume true; {84197#(<= ~counter~0 7)} is VALID [2022-04-28 06:00:24,081 INFO L290 TraceCheckUtils]: 1: Hoare triple {83990#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {84197#(<= ~counter~0 7)} is VALID [2022-04-28 06:00:24,082 INFO L272 TraceCheckUtils]: 0: Hoare triple {83990#true} call ULTIMATE.init(); {83990#true} is VALID [2022-04-28 06:00:24,082 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 38 proven. 86 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2022-04-28 06:00:24,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:00:24,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861703063] [2022-04-28 06:00:24,082 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:00:24,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1467180160] [2022-04-28 06:00:24,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1467180160] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 06:00:24,082 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 06:00:24,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 24 [2022-04-28 06:00:24,083 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:00:24,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1429034765] [2022-04-28 06:00:24,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1429034765] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:00:24,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:00:24,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 06:00:24,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240856106] [2022-04-28 06:00:24,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:00:24,084 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.5) internal successors, (88), 15 states have internal predecessors, (88), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) Word has length 123 [2022-04-28 06:00:24,084 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:00:24,084 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 5.5) internal successors, (88), 15 states have internal predecessors, (88), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-28 06:00:24,203 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:00:24,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 06:00:24,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:00:24,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 06:00:24,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-28 06:00:24,204 INFO L87 Difference]: Start difference. First operand 634 states and 863 transitions. Second operand has 16 states, 16 states have (on average 5.5) internal successors, (88), 15 states have internal predecessors, (88), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-28 06:00:27,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:00:27,741 INFO L93 Difference]: Finished difference Result 847 states and 1187 transitions. [2022-04-28 06:00:27,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-28 06:00:27,741 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.5) internal successors, (88), 15 states have internal predecessors, (88), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) Word has length 123 [2022-04-28 06:00:27,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:00:27,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 5.5) internal successors, (88), 15 states have internal predecessors, (88), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-28 06:00:27,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 276 transitions. [2022-04-28 06:00:27,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 5.5) internal successors, (88), 15 states have internal predecessors, (88), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-28 06:00:27,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 276 transitions. [2022-04-28 06:00:27,745 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 276 transitions. [2022-04-28 06:00:27,980 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 276 edges. 276 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:00:28,001 INFO L225 Difference]: With dead ends: 847 [2022-04-28 06:00:28,001 INFO L226 Difference]: Without dead ends: 650 [2022-04-28 06:00:28,002 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 222 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=478, Invalid=712, Unknown=0, NotChecked=0, Total=1190 [2022-04-28 06:00:28,002 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 181 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 180 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 180 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 06:00:28,002 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 297 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [180 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 06:00:28,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2022-04-28 06:00:30,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 650. [2022-04-28 06:00:30,404 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:00:30,405 INFO L82 GeneralOperation]: Start isEquivalent. First operand 650 states. Second operand has 650 states, 494 states have (on average 1.2165991902834008) internal successors, (601), 494 states have internal predecessors, (601), 140 states have call successors, (140), 17 states have call predecessors, (140), 15 states have return successors, (138), 138 states have call predecessors, (138), 138 states have call successors, (138) [2022-04-28 06:00:30,406 INFO L74 IsIncluded]: Start isIncluded. First operand 650 states. Second operand has 650 states, 494 states have (on average 1.2165991902834008) internal successors, (601), 494 states have internal predecessors, (601), 140 states have call successors, (140), 17 states have call predecessors, (140), 15 states have return successors, (138), 138 states have call predecessors, (138), 138 states have call successors, (138) [2022-04-28 06:00:30,406 INFO L87 Difference]: Start difference. First operand 650 states. Second operand has 650 states, 494 states have (on average 1.2165991902834008) internal successors, (601), 494 states have internal predecessors, (601), 140 states have call successors, (140), 17 states have call predecessors, (140), 15 states have return successors, (138), 138 states have call predecessors, (138), 138 states have call successors, (138) [2022-04-28 06:00:30,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:00:30,421 INFO L93 Difference]: Finished difference Result 650 states and 879 transitions. [2022-04-28 06:00:30,421 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 879 transitions. [2022-04-28 06:00:30,421 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:00:30,421 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:00:30,422 INFO L74 IsIncluded]: Start isIncluded. First operand has 650 states, 494 states have (on average 1.2165991902834008) internal successors, (601), 494 states have internal predecessors, (601), 140 states have call successors, (140), 17 states have call predecessors, (140), 15 states have return successors, (138), 138 states have call predecessors, (138), 138 states have call successors, (138) Second operand 650 states. [2022-04-28 06:00:30,422 INFO L87 Difference]: Start difference. First operand has 650 states, 494 states have (on average 1.2165991902834008) internal successors, (601), 494 states have internal predecessors, (601), 140 states have call successors, (140), 17 states have call predecessors, (140), 15 states have return successors, (138), 138 states have call predecessors, (138), 138 states have call successors, (138) Second operand 650 states. [2022-04-28 06:00:30,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:00:30,440 INFO L93 Difference]: Finished difference Result 650 states and 879 transitions. [2022-04-28 06:00:30,440 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 879 transitions. [2022-04-28 06:00:30,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:00:30,441 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:00:30,441 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:00:30,441 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:00:30,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 494 states have (on average 1.2165991902834008) internal successors, (601), 494 states have internal predecessors, (601), 140 states have call successors, (140), 17 states have call predecessors, (140), 15 states have return successors, (138), 138 states have call predecessors, (138), 138 states have call successors, (138) [2022-04-28 06:00:30,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 879 transitions. [2022-04-28 06:00:30,478 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 879 transitions. Word has length 123 [2022-04-28 06:00:30,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:00:30,478 INFO L495 AbstractCegarLoop]: Abstraction has 650 states and 879 transitions. [2022-04-28 06:00:30,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.5) internal successors, (88), 15 states have internal predecessors, (88), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-28 06:00:30,479 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 650 states and 879 transitions. [2022-04-28 06:00:34,972 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 879 edges. 879 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:00:34,972 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 879 transitions. [2022-04-28 06:00:34,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-04-28 06:00:34,973 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:00:34,974 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 7, 7, 7, 7, 5, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:00:34,992 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2022-04-28 06:00:35,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:00:35,176 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:00:35,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:00:35,176 INFO L85 PathProgramCache]: Analyzing trace with hash -992818924, now seen corresponding path program 9 times [2022-04-28 06:00:35,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:00:35,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [866547237] [2022-04-28 06:00:35,176 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 06:00:35,177 INFO L85 PathProgramCache]: Analyzing trace with hash -992818924, now seen corresponding path program 10 times [2022-04-28 06:00:35,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:00:35,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318238224] [2022-04-28 06:00:35,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:00:35,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:00:35,204 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:00:35,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1645766223] [2022-04-28 06:00:35,204 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 06:00:35,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:00:35,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:00:35,206 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:00:35,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-04-28 06:00:35,281 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 06:00:35,281 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:00:35,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-28 06:00:35,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:00:35,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:00:35,943 INFO L272 TraceCheckUtils]: 0: Hoare triple {89067#true} call ULTIMATE.init(); {89067#true} is VALID [2022-04-28 06:00:35,944 INFO L290 TraceCheckUtils]: 1: Hoare triple {89067#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {89075#(<= ~counter~0 0)} is VALID [2022-04-28 06:00:35,944 INFO L290 TraceCheckUtils]: 2: Hoare triple {89075#(<= ~counter~0 0)} assume true; {89075#(<= ~counter~0 0)} is VALID [2022-04-28 06:00:35,944 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {89075#(<= ~counter~0 0)} {89067#true} #102#return; {89075#(<= ~counter~0 0)} is VALID [2022-04-28 06:00:35,945 INFO L272 TraceCheckUtils]: 4: Hoare triple {89075#(<= ~counter~0 0)} call #t~ret9 := main(); {89075#(<= ~counter~0 0)} is VALID [2022-04-28 06:00:35,945 INFO L290 TraceCheckUtils]: 5: Hoare triple {89075#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {89075#(<= ~counter~0 0)} is VALID [2022-04-28 06:00:35,945 INFO L272 TraceCheckUtils]: 6: Hoare triple {89075#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {89075#(<= ~counter~0 0)} is VALID [2022-04-28 06:00:35,946 INFO L290 TraceCheckUtils]: 7: Hoare triple {89075#(<= ~counter~0 0)} ~cond := #in~cond; {89075#(<= ~counter~0 0)} is VALID [2022-04-28 06:00:35,946 INFO L290 TraceCheckUtils]: 8: Hoare triple {89075#(<= ~counter~0 0)} assume !(0 == ~cond); {89075#(<= ~counter~0 0)} is VALID [2022-04-28 06:00:35,946 INFO L290 TraceCheckUtils]: 9: Hoare triple {89075#(<= ~counter~0 0)} assume true; {89075#(<= ~counter~0 0)} is VALID [2022-04-28 06:00:35,947 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {89075#(<= ~counter~0 0)} {89075#(<= ~counter~0 0)} #90#return; {89075#(<= ~counter~0 0)} is VALID [2022-04-28 06:00:35,947 INFO L272 TraceCheckUtils]: 11: Hoare triple {89075#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {89075#(<= ~counter~0 0)} is VALID [2022-04-28 06:00:35,947 INFO L290 TraceCheckUtils]: 12: Hoare triple {89075#(<= ~counter~0 0)} ~cond := #in~cond; {89075#(<= ~counter~0 0)} is VALID [2022-04-28 06:00:35,948 INFO L290 TraceCheckUtils]: 13: Hoare triple {89075#(<= ~counter~0 0)} assume !(0 == ~cond); {89075#(<= ~counter~0 0)} is VALID [2022-04-28 06:00:35,948 INFO L290 TraceCheckUtils]: 14: Hoare triple {89075#(<= ~counter~0 0)} assume true; {89075#(<= ~counter~0 0)} is VALID [2022-04-28 06:00:35,948 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {89075#(<= ~counter~0 0)} {89075#(<= ~counter~0 0)} #92#return; {89075#(<= ~counter~0 0)} is VALID [2022-04-28 06:00:35,948 INFO L290 TraceCheckUtils]: 16: Hoare triple {89075#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {89075#(<= ~counter~0 0)} is VALID [2022-04-28 06:00:35,950 INFO L290 TraceCheckUtils]: 17: Hoare triple {89075#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {89124#(<= ~counter~0 1)} is VALID [2022-04-28 06:00:35,951 INFO L290 TraceCheckUtils]: 18: Hoare triple {89124#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {89124#(<= ~counter~0 1)} is VALID [2022-04-28 06:00:35,951 INFO L272 TraceCheckUtils]: 19: Hoare triple {89124#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {89124#(<= ~counter~0 1)} is VALID [2022-04-28 06:00:35,951 INFO L290 TraceCheckUtils]: 20: Hoare triple {89124#(<= ~counter~0 1)} ~cond := #in~cond; {89124#(<= ~counter~0 1)} is VALID [2022-04-28 06:00:35,959 INFO L290 TraceCheckUtils]: 21: Hoare triple {89124#(<= ~counter~0 1)} assume !(0 == ~cond); {89124#(<= ~counter~0 1)} is VALID [2022-04-28 06:00:35,960 INFO L290 TraceCheckUtils]: 22: Hoare triple {89124#(<= ~counter~0 1)} assume true; {89124#(<= ~counter~0 1)} is VALID [2022-04-28 06:00:35,961 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {89124#(<= ~counter~0 1)} {89124#(<= ~counter~0 1)} #94#return; {89124#(<= ~counter~0 1)} is VALID [2022-04-28 06:00:35,961 INFO L290 TraceCheckUtils]: 24: Hoare triple {89124#(<= ~counter~0 1)} assume !!(0 != ~r~0); {89124#(<= ~counter~0 1)} is VALID [2022-04-28 06:00:35,963 INFO L290 TraceCheckUtils]: 25: Hoare triple {89124#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {89149#(<= ~counter~0 2)} is VALID [2022-04-28 06:00:35,963 INFO L290 TraceCheckUtils]: 26: Hoare triple {89149#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {89149#(<= ~counter~0 2)} is VALID [2022-04-28 06:00:35,964 INFO L272 TraceCheckUtils]: 27: Hoare triple {89149#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {89149#(<= ~counter~0 2)} is VALID [2022-04-28 06:00:35,964 INFO L290 TraceCheckUtils]: 28: Hoare triple {89149#(<= ~counter~0 2)} ~cond := #in~cond; {89149#(<= ~counter~0 2)} is VALID [2022-04-28 06:00:35,964 INFO L290 TraceCheckUtils]: 29: Hoare triple {89149#(<= ~counter~0 2)} assume !(0 == ~cond); {89149#(<= ~counter~0 2)} is VALID [2022-04-28 06:00:35,964 INFO L290 TraceCheckUtils]: 30: Hoare triple {89149#(<= ~counter~0 2)} assume true; {89149#(<= ~counter~0 2)} is VALID [2022-04-28 06:00:35,965 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {89149#(<= ~counter~0 2)} {89149#(<= ~counter~0 2)} #96#return; {89149#(<= ~counter~0 2)} is VALID [2022-04-28 06:00:35,965 INFO L290 TraceCheckUtils]: 32: Hoare triple {89149#(<= ~counter~0 2)} assume !(~r~0 > 0); {89149#(<= ~counter~0 2)} is VALID [2022-04-28 06:00:35,966 INFO L290 TraceCheckUtils]: 33: Hoare triple {89149#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {89174#(<= ~counter~0 3)} is VALID [2022-04-28 06:00:35,966 INFO L290 TraceCheckUtils]: 34: Hoare triple {89174#(<= ~counter~0 3)} assume !!(#t~post8 < 20);havoc #t~post8; {89174#(<= ~counter~0 3)} is VALID [2022-04-28 06:00:35,967 INFO L272 TraceCheckUtils]: 35: Hoare triple {89174#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {89174#(<= ~counter~0 3)} is VALID [2022-04-28 06:00:35,967 INFO L290 TraceCheckUtils]: 36: Hoare triple {89174#(<= ~counter~0 3)} ~cond := #in~cond; {89174#(<= ~counter~0 3)} is VALID [2022-04-28 06:00:35,967 INFO L290 TraceCheckUtils]: 37: Hoare triple {89174#(<= ~counter~0 3)} assume !(0 == ~cond); {89174#(<= ~counter~0 3)} is VALID [2022-04-28 06:00:35,968 INFO L290 TraceCheckUtils]: 38: Hoare triple {89174#(<= ~counter~0 3)} assume true; {89174#(<= ~counter~0 3)} is VALID [2022-04-28 06:00:35,968 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {89174#(<= ~counter~0 3)} {89174#(<= ~counter~0 3)} #98#return; {89174#(<= ~counter~0 3)} is VALID [2022-04-28 06:00:35,968 INFO L290 TraceCheckUtils]: 40: Hoare triple {89174#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {89174#(<= ~counter~0 3)} is VALID [2022-04-28 06:00:35,969 INFO L290 TraceCheckUtils]: 41: Hoare triple {89174#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {89199#(<= ~counter~0 4)} is VALID [2022-04-28 06:00:35,969 INFO L290 TraceCheckUtils]: 42: Hoare triple {89199#(<= ~counter~0 4)} assume !!(#t~post8 < 20);havoc #t~post8; {89199#(<= ~counter~0 4)} is VALID [2022-04-28 06:00:35,970 INFO L272 TraceCheckUtils]: 43: Hoare triple {89199#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {89199#(<= ~counter~0 4)} is VALID [2022-04-28 06:00:35,970 INFO L290 TraceCheckUtils]: 44: Hoare triple {89199#(<= ~counter~0 4)} ~cond := #in~cond; {89199#(<= ~counter~0 4)} is VALID [2022-04-28 06:00:35,970 INFO L290 TraceCheckUtils]: 45: Hoare triple {89199#(<= ~counter~0 4)} assume !(0 == ~cond); {89199#(<= ~counter~0 4)} is VALID [2022-04-28 06:00:35,971 INFO L290 TraceCheckUtils]: 46: Hoare triple {89199#(<= ~counter~0 4)} assume true; {89199#(<= ~counter~0 4)} is VALID [2022-04-28 06:00:35,971 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {89199#(<= ~counter~0 4)} {89199#(<= ~counter~0 4)} #98#return; {89199#(<= ~counter~0 4)} is VALID [2022-04-28 06:00:35,971 INFO L290 TraceCheckUtils]: 48: Hoare triple {89199#(<= ~counter~0 4)} assume !(~r~0 < 0); {89199#(<= ~counter~0 4)} is VALID [2022-04-28 06:00:35,972 INFO L290 TraceCheckUtils]: 49: Hoare triple {89199#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {89224#(<= ~counter~0 5)} is VALID [2022-04-28 06:00:35,973 INFO L290 TraceCheckUtils]: 50: Hoare triple {89224#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {89224#(<= ~counter~0 5)} is VALID [2022-04-28 06:00:35,973 INFO L272 TraceCheckUtils]: 51: Hoare triple {89224#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {89224#(<= ~counter~0 5)} is VALID [2022-04-28 06:00:35,973 INFO L290 TraceCheckUtils]: 52: Hoare triple {89224#(<= ~counter~0 5)} ~cond := #in~cond; {89224#(<= ~counter~0 5)} is VALID [2022-04-28 06:00:35,974 INFO L290 TraceCheckUtils]: 53: Hoare triple {89224#(<= ~counter~0 5)} assume !(0 == ~cond); {89224#(<= ~counter~0 5)} is VALID [2022-04-28 06:00:35,974 INFO L290 TraceCheckUtils]: 54: Hoare triple {89224#(<= ~counter~0 5)} assume true; {89224#(<= ~counter~0 5)} is VALID [2022-04-28 06:00:35,974 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {89224#(<= ~counter~0 5)} {89224#(<= ~counter~0 5)} #94#return; {89224#(<= ~counter~0 5)} is VALID [2022-04-28 06:00:35,975 INFO L290 TraceCheckUtils]: 56: Hoare triple {89224#(<= ~counter~0 5)} assume !!(0 != ~r~0); {89224#(<= ~counter~0 5)} is VALID [2022-04-28 06:00:35,975 INFO L290 TraceCheckUtils]: 57: Hoare triple {89224#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {89249#(<= ~counter~0 6)} is VALID [2022-04-28 06:00:35,976 INFO L290 TraceCheckUtils]: 58: Hoare triple {89249#(<= ~counter~0 6)} assume !!(#t~post7 < 20);havoc #t~post7; {89249#(<= ~counter~0 6)} is VALID [2022-04-28 06:00:35,976 INFO L272 TraceCheckUtils]: 59: Hoare triple {89249#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {89249#(<= ~counter~0 6)} is VALID [2022-04-28 06:00:35,976 INFO L290 TraceCheckUtils]: 60: Hoare triple {89249#(<= ~counter~0 6)} ~cond := #in~cond; {89249#(<= ~counter~0 6)} is VALID [2022-04-28 06:00:35,977 INFO L290 TraceCheckUtils]: 61: Hoare triple {89249#(<= ~counter~0 6)} assume !(0 == ~cond); {89249#(<= ~counter~0 6)} is VALID [2022-04-28 06:00:35,977 INFO L290 TraceCheckUtils]: 62: Hoare triple {89249#(<= ~counter~0 6)} assume true; {89249#(<= ~counter~0 6)} is VALID [2022-04-28 06:00:35,977 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {89249#(<= ~counter~0 6)} {89249#(<= ~counter~0 6)} #96#return; {89249#(<= ~counter~0 6)} is VALID [2022-04-28 06:00:35,978 INFO L290 TraceCheckUtils]: 64: Hoare triple {89249#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {89249#(<= ~counter~0 6)} is VALID [2022-04-28 06:00:35,979 INFO L290 TraceCheckUtils]: 65: Hoare triple {89249#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {89274#(<= ~counter~0 7)} is VALID [2022-04-28 06:00:35,979 INFO L290 TraceCheckUtils]: 66: Hoare triple {89274#(<= ~counter~0 7)} assume !!(#t~post7 < 20);havoc #t~post7; {89274#(<= ~counter~0 7)} is VALID [2022-04-28 06:00:35,979 INFO L272 TraceCheckUtils]: 67: Hoare triple {89274#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {89274#(<= ~counter~0 7)} is VALID [2022-04-28 06:00:35,980 INFO L290 TraceCheckUtils]: 68: Hoare triple {89274#(<= ~counter~0 7)} ~cond := #in~cond; {89274#(<= ~counter~0 7)} is VALID [2022-04-28 06:00:35,980 INFO L290 TraceCheckUtils]: 69: Hoare triple {89274#(<= ~counter~0 7)} assume !(0 == ~cond); {89274#(<= ~counter~0 7)} is VALID [2022-04-28 06:00:35,980 INFO L290 TraceCheckUtils]: 70: Hoare triple {89274#(<= ~counter~0 7)} assume true; {89274#(<= ~counter~0 7)} is VALID [2022-04-28 06:00:35,981 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {89274#(<= ~counter~0 7)} {89274#(<= ~counter~0 7)} #96#return; {89274#(<= ~counter~0 7)} is VALID [2022-04-28 06:00:35,981 INFO L290 TraceCheckUtils]: 72: Hoare triple {89274#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {89274#(<= ~counter~0 7)} is VALID [2022-04-28 06:00:35,982 INFO L290 TraceCheckUtils]: 73: Hoare triple {89274#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {89299#(<= ~counter~0 8)} is VALID [2022-04-28 06:00:35,982 INFO L290 TraceCheckUtils]: 74: Hoare triple {89299#(<= ~counter~0 8)} assume !!(#t~post7 < 20);havoc #t~post7; {89299#(<= ~counter~0 8)} is VALID [2022-04-28 06:00:35,982 INFO L272 TraceCheckUtils]: 75: Hoare triple {89299#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {89299#(<= ~counter~0 8)} is VALID [2022-04-28 06:00:35,983 INFO L290 TraceCheckUtils]: 76: Hoare triple {89299#(<= ~counter~0 8)} ~cond := #in~cond; {89299#(<= ~counter~0 8)} is VALID [2022-04-28 06:00:35,983 INFO L290 TraceCheckUtils]: 77: Hoare triple {89299#(<= ~counter~0 8)} assume !(0 == ~cond); {89299#(<= ~counter~0 8)} is VALID [2022-04-28 06:00:35,983 INFO L290 TraceCheckUtils]: 78: Hoare triple {89299#(<= ~counter~0 8)} assume true; {89299#(<= ~counter~0 8)} is VALID [2022-04-28 06:00:35,984 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {89299#(<= ~counter~0 8)} {89299#(<= ~counter~0 8)} #96#return; {89299#(<= ~counter~0 8)} is VALID [2022-04-28 06:00:35,984 INFO L290 TraceCheckUtils]: 80: Hoare triple {89299#(<= ~counter~0 8)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {89299#(<= ~counter~0 8)} is VALID [2022-04-28 06:00:35,985 INFO L290 TraceCheckUtils]: 81: Hoare triple {89299#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {89324#(<= ~counter~0 9)} is VALID [2022-04-28 06:00:35,985 INFO L290 TraceCheckUtils]: 82: Hoare triple {89324#(<= ~counter~0 9)} assume !!(#t~post7 < 20);havoc #t~post7; {89324#(<= ~counter~0 9)} is VALID [2022-04-28 06:00:35,986 INFO L272 TraceCheckUtils]: 83: Hoare triple {89324#(<= ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {89324#(<= ~counter~0 9)} is VALID [2022-04-28 06:00:35,986 INFO L290 TraceCheckUtils]: 84: Hoare triple {89324#(<= ~counter~0 9)} ~cond := #in~cond; {89324#(<= ~counter~0 9)} is VALID [2022-04-28 06:00:35,986 INFO L290 TraceCheckUtils]: 85: Hoare triple {89324#(<= ~counter~0 9)} assume !(0 == ~cond); {89324#(<= ~counter~0 9)} is VALID [2022-04-28 06:00:35,986 INFO L290 TraceCheckUtils]: 86: Hoare triple {89324#(<= ~counter~0 9)} assume true; {89324#(<= ~counter~0 9)} is VALID [2022-04-28 06:00:35,987 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {89324#(<= ~counter~0 9)} {89324#(<= ~counter~0 9)} #96#return; {89324#(<= ~counter~0 9)} is VALID [2022-04-28 06:00:35,987 INFO L290 TraceCheckUtils]: 88: Hoare triple {89324#(<= ~counter~0 9)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {89324#(<= ~counter~0 9)} is VALID [2022-04-28 06:00:35,988 INFO L290 TraceCheckUtils]: 89: Hoare triple {89324#(<= ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {89349#(<= ~counter~0 10)} is VALID [2022-04-28 06:00:35,988 INFO L290 TraceCheckUtils]: 90: Hoare triple {89349#(<= ~counter~0 10)} assume !!(#t~post7 < 20);havoc #t~post7; {89349#(<= ~counter~0 10)} is VALID [2022-04-28 06:00:35,989 INFO L272 TraceCheckUtils]: 91: Hoare triple {89349#(<= ~counter~0 10)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {89349#(<= ~counter~0 10)} is VALID [2022-04-28 06:00:35,989 INFO L290 TraceCheckUtils]: 92: Hoare triple {89349#(<= ~counter~0 10)} ~cond := #in~cond; {89349#(<= ~counter~0 10)} is VALID [2022-04-28 06:00:35,989 INFO L290 TraceCheckUtils]: 93: Hoare triple {89349#(<= ~counter~0 10)} assume !(0 == ~cond); {89349#(<= ~counter~0 10)} is VALID [2022-04-28 06:00:35,990 INFO L290 TraceCheckUtils]: 94: Hoare triple {89349#(<= ~counter~0 10)} assume true; {89349#(<= ~counter~0 10)} is VALID [2022-04-28 06:00:35,990 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {89349#(<= ~counter~0 10)} {89349#(<= ~counter~0 10)} #96#return; {89349#(<= ~counter~0 10)} is VALID [2022-04-28 06:00:35,990 INFO L290 TraceCheckUtils]: 96: Hoare triple {89349#(<= ~counter~0 10)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {89349#(<= ~counter~0 10)} is VALID [2022-04-28 06:00:35,991 INFO L290 TraceCheckUtils]: 97: Hoare triple {89349#(<= ~counter~0 10)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {89374#(<= ~counter~0 11)} is VALID [2022-04-28 06:00:35,991 INFO L290 TraceCheckUtils]: 98: Hoare triple {89374#(<= ~counter~0 11)} assume !!(#t~post7 < 20);havoc #t~post7; {89374#(<= ~counter~0 11)} is VALID [2022-04-28 06:00:35,992 INFO L272 TraceCheckUtils]: 99: Hoare triple {89374#(<= ~counter~0 11)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {89374#(<= ~counter~0 11)} is VALID [2022-04-28 06:00:35,992 INFO L290 TraceCheckUtils]: 100: Hoare triple {89374#(<= ~counter~0 11)} ~cond := #in~cond; {89374#(<= ~counter~0 11)} is VALID [2022-04-28 06:00:35,992 INFO L290 TraceCheckUtils]: 101: Hoare triple {89374#(<= ~counter~0 11)} assume !(0 == ~cond); {89374#(<= ~counter~0 11)} is VALID [2022-04-28 06:00:35,993 INFO L290 TraceCheckUtils]: 102: Hoare triple {89374#(<= ~counter~0 11)} assume true; {89374#(<= ~counter~0 11)} is VALID [2022-04-28 06:00:35,993 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {89374#(<= ~counter~0 11)} {89374#(<= ~counter~0 11)} #96#return; {89374#(<= ~counter~0 11)} is VALID [2022-04-28 06:00:35,993 INFO L290 TraceCheckUtils]: 104: Hoare triple {89374#(<= ~counter~0 11)} assume !(~r~0 > 0); {89374#(<= ~counter~0 11)} is VALID [2022-04-28 06:00:35,994 INFO L290 TraceCheckUtils]: 105: Hoare triple {89374#(<= ~counter~0 11)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {89399#(<= ~counter~0 12)} is VALID [2022-04-28 06:00:35,995 INFO L290 TraceCheckUtils]: 106: Hoare triple {89399#(<= ~counter~0 12)} assume !!(#t~post8 < 20);havoc #t~post8; {89399#(<= ~counter~0 12)} is VALID [2022-04-28 06:00:35,995 INFO L272 TraceCheckUtils]: 107: Hoare triple {89399#(<= ~counter~0 12)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {89399#(<= ~counter~0 12)} is VALID [2022-04-28 06:00:35,995 INFO L290 TraceCheckUtils]: 108: Hoare triple {89399#(<= ~counter~0 12)} ~cond := #in~cond; {89399#(<= ~counter~0 12)} is VALID [2022-04-28 06:00:35,996 INFO L290 TraceCheckUtils]: 109: Hoare triple {89399#(<= ~counter~0 12)} assume !(0 == ~cond); {89399#(<= ~counter~0 12)} is VALID [2022-04-28 06:00:35,996 INFO L290 TraceCheckUtils]: 110: Hoare triple {89399#(<= ~counter~0 12)} assume true; {89399#(<= ~counter~0 12)} is VALID [2022-04-28 06:00:35,996 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {89399#(<= ~counter~0 12)} {89399#(<= ~counter~0 12)} #98#return; {89399#(<= ~counter~0 12)} is VALID [2022-04-28 06:00:35,997 INFO L290 TraceCheckUtils]: 112: Hoare triple {89399#(<= ~counter~0 12)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {89399#(<= ~counter~0 12)} is VALID [2022-04-28 06:00:35,997 INFO L290 TraceCheckUtils]: 113: Hoare triple {89399#(<= ~counter~0 12)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {89424#(<= ~counter~0 13)} is VALID [2022-04-28 06:00:35,998 INFO L290 TraceCheckUtils]: 114: Hoare triple {89424#(<= ~counter~0 13)} assume !!(#t~post8 < 20);havoc #t~post8; {89424#(<= ~counter~0 13)} is VALID [2022-04-28 06:00:35,998 INFO L272 TraceCheckUtils]: 115: Hoare triple {89424#(<= ~counter~0 13)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {89424#(<= ~counter~0 13)} is VALID [2022-04-28 06:00:35,998 INFO L290 TraceCheckUtils]: 116: Hoare triple {89424#(<= ~counter~0 13)} ~cond := #in~cond; {89424#(<= ~counter~0 13)} is VALID [2022-04-28 06:00:35,999 INFO L290 TraceCheckUtils]: 117: Hoare triple {89424#(<= ~counter~0 13)} assume !(0 == ~cond); {89424#(<= ~counter~0 13)} is VALID [2022-04-28 06:00:35,999 INFO L290 TraceCheckUtils]: 118: Hoare triple {89424#(<= ~counter~0 13)} assume true; {89424#(<= ~counter~0 13)} is VALID [2022-04-28 06:00:35,999 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {89424#(<= ~counter~0 13)} {89424#(<= ~counter~0 13)} #98#return; {89424#(<= ~counter~0 13)} is VALID [2022-04-28 06:00:36,000 INFO L290 TraceCheckUtils]: 120: Hoare triple {89424#(<= ~counter~0 13)} assume !(~r~0 < 0); {89424#(<= ~counter~0 13)} is VALID [2022-04-28 06:00:36,000 INFO L290 TraceCheckUtils]: 121: Hoare triple {89424#(<= ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {89449#(<= |main_#t~post6| 13)} is VALID [2022-04-28 06:00:36,000 INFO L290 TraceCheckUtils]: 122: Hoare triple {89449#(<= |main_#t~post6| 13)} assume !(#t~post6 < 20);havoc #t~post6; {89068#false} is VALID [2022-04-28 06:00:36,000 INFO L272 TraceCheckUtils]: 123: Hoare triple {89068#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {89068#false} is VALID [2022-04-28 06:00:36,001 INFO L290 TraceCheckUtils]: 124: Hoare triple {89068#false} ~cond := #in~cond; {89068#false} is VALID [2022-04-28 06:00:36,001 INFO L290 TraceCheckUtils]: 125: Hoare triple {89068#false} assume 0 == ~cond; {89068#false} is VALID [2022-04-28 06:00:36,001 INFO L290 TraceCheckUtils]: 126: Hoare triple {89068#false} assume !false; {89068#false} is VALID [2022-04-28 06:00:36,001 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 26 proven. 428 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 06:00:36,001 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 06:00:36,695 INFO L290 TraceCheckUtils]: 126: Hoare triple {89068#false} assume !false; {89068#false} is VALID [2022-04-28 06:00:36,695 INFO L290 TraceCheckUtils]: 125: Hoare triple {89068#false} assume 0 == ~cond; {89068#false} is VALID [2022-04-28 06:00:36,695 INFO L290 TraceCheckUtils]: 124: Hoare triple {89068#false} ~cond := #in~cond; {89068#false} is VALID [2022-04-28 06:00:36,695 INFO L272 TraceCheckUtils]: 123: Hoare triple {89068#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {89068#false} is VALID [2022-04-28 06:00:36,696 INFO L290 TraceCheckUtils]: 122: Hoare triple {89477#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {89068#false} is VALID [2022-04-28 06:00:36,696 INFO L290 TraceCheckUtils]: 121: Hoare triple {89481#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {89477#(< |main_#t~post6| 20)} is VALID [2022-04-28 06:00:36,696 INFO L290 TraceCheckUtils]: 120: Hoare triple {89481#(< ~counter~0 20)} assume !(~r~0 < 0); {89481#(< ~counter~0 20)} is VALID [2022-04-28 06:00:36,697 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {89067#true} {89481#(< ~counter~0 20)} #98#return; {89481#(< ~counter~0 20)} is VALID [2022-04-28 06:00:36,697 INFO L290 TraceCheckUtils]: 118: Hoare triple {89067#true} assume true; {89067#true} is VALID [2022-04-28 06:00:36,697 INFO L290 TraceCheckUtils]: 117: Hoare triple {89067#true} assume !(0 == ~cond); {89067#true} is VALID [2022-04-28 06:00:36,697 INFO L290 TraceCheckUtils]: 116: Hoare triple {89067#true} ~cond := #in~cond; {89067#true} is VALID [2022-04-28 06:00:36,697 INFO L272 TraceCheckUtils]: 115: Hoare triple {89481#(< ~counter~0 20)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {89067#true} is VALID [2022-04-28 06:00:36,697 INFO L290 TraceCheckUtils]: 114: Hoare triple {89481#(< ~counter~0 20)} assume !!(#t~post8 < 20);havoc #t~post8; {89481#(< ~counter~0 20)} is VALID [2022-04-28 06:00:36,699 INFO L290 TraceCheckUtils]: 113: Hoare triple {89506#(< ~counter~0 19)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {89481#(< ~counter~0 20)} is VALID [2022-04-28 06:00:36,699 INFO L290 TraceCheckUtils]: 112: Hoare triple {89506#(< ~counter~0 19)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {89506#(< ~counter~0 19)} is VALID [2022-04-28 06:00:36,700 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {89067#true} {89506#(< ~counter~0 19)} #98#return; {89506#(< ~counter~0 19)} is VALID [2022-04-28 06:00:36,700 INFO L290 TraceCheckUtils]: 110: Hoare triple {89067#true} assume true; {89067#true} is VALID [2022-04-28 06:00:36,700 INFO L290 TraceCheckUtils]: 109: Hoare triple {89067#true} assume !(0 == ~cond); {89067#true} is VALID [2022-04-28 06:00:36,700 INFO L290 TraceCheckUtils]: 108: Hoare triple {89067#true} ~cond := #in~cond; {89067#true} is VALID [2022-04-28 06:00:36,700 INFO L272 TraceCheckUtils]: 107: Hoare triple {89506#(< ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {89067#true} is VALID [2022-04-28 06:00:36,700 INFO L290 TraceCheckUtils]: 106: Hoare triple {89506#(< ~counter~0 19)} assume !!(#t~post8 < 20);havoc #t~post8; {89506#(< ~counter~0 19)} is VALID [2022-04-28 06:00:36,701 INFO L290 TraceCheckUtils]: 105: Hoare triple {89531#(< ~counter~0 18)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {89506#(< ~counter~0 19)} is VALID [2022-04-28 06:00:36,702 INFO L290 TraceCheckUtils]: 104: Hoare triple {89531#(< ~counter~0 18)} assume !(~r~0 > 0); {89531#(< ~counter~0 18)} is VALID [2022-04-28 06:00:36,702 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {89067#true} {89531#(< ~counter~0 18)} #96#return; {89531#(< ~counter~0 18)} is VALID [2022-04-28 06:00:36,702 INFO L290 TraceCheckUtils]: 102: Hoare triple {89067#true} assume true; {89067#true} is VALID [2022-04-28 06:00:36,702 INFO L290 TraceCheckUtils]: 101: Hoare triple {89067#true} assume !(0 == ~cond); {89067#true} is VALID [2022-04-28 06:00:36,702 INFO L290 TraceCheckUtils]: 100: Hoare triple {89067#true} ~cond := #in~cond; {89067#true} is VALID [2022-04-28 06:00:36,702 INFO L272 TraceCheckUtils]: 99: Hoare triple {89531#(< ~counter~0 18)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {89067#true} is VALID [2022-04-28 06:00:36,703 INFO L290 TraceCheckUtils]: 98: Hoare triple {89531#(< ~counter~0 18)} assume !!(#t~post7 < 20);havoc #t~post7; {89531#(< ~counter~0 18)} is VALID [2022-04-28 06:00:36,703 INFO L290 TraceCheckUtils]: 97: Hoare triple {89556#(< ~counter~0 17)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {89531#(< ~counter~0 18)} is VALID [2022-04-28 06:00:36,704 INFO L290 TraceCheckUtils]: 96: Hoare triple {89556#(< ~counter~0 17)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {89556#(< ~counter~0 17)} is VALID [2022-04-28 06:00:36,704 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {89067#true} {89556#(< ~counter~0 17)} #96#return; {89556#(< ~counter~0 17)} is VALID [2022-04-28 06:00:36,704 INFO L290 TraceCheckUtils]: 94: Hoare triple {89067#true} assume true; {89067#true} is VALID [2022-04-28 06:00:36,704 INFO L290 TraceCheckUtils]: 93: Hoare triple {89067#true} assume !(0 == ~cond); {89067#true} is VALID [2022-04-28 06:00:36,704 INFO L290 TraceCheckUtils]: 92: Hoare triple {89067#true} ~cond := #in~cond; {89067#true} is VALID [2022-04-28 06:00:36,704 INFO L272 TraceCheckUtils]: 91: Hoare triple {89556#(< ~counter~0 17)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {89067#true} is VALID [2022-04-28 06:00:36,705 INFO L290 TraceCheckUtils]: 90: Hoare triple {89556#(< ~counter~0 17)} assume !!(#t~post7 < 20);havoc #t~post7; {89556#(< ~counter~0 17)} is VALID [2022-04-28 06:00:36,705 INFO L290 TraceCheckUtils]: 89: Hoare triple {89581#(< ~counter~0 16)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {89556#(< ~counter~0 17)} is VALID [2022-04-28 06:00:36,706 INFO L290 TraceCheckUtils]: 88: Hoare triple {89581#(< ~counter~0 16)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {89581#(< ~counter~0 16)} is VALID [2022-04-28 06:00:36,706 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {89067#true} {89581#(< ~counter~0 16)} #96#return; {89581#(< ~counter~0 16)} is VALID [2022-04-28 06:00:36,706 INFO L290 TraceCheckUtils]: 86: Hoare triple {89067#true} assume true; {89067#true} is VALID [2022-04-28 06:00:36,706 INFO L290 TraceCheckUtils]: 85: Hoare triple {89067#true} assume !(0 == ~cond); {89067#true} is VALID [2022-04-28 06:00:36,706 INFO L290 TraceCheckUtils]: 84: Hoare triple {89067#true} ~cond := #in~cond; {89067#true} is VALID [2022-04-28 06:00:36,706 INFO L272 TraceCheckUtils]: 83: Hoare triple {89581#(< ~counter~0 16)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {89067#true} is VALID [2022-04-28 06:00:36,707 INFO L290 TraceCheckUtils]: 82: Hoare triple {89581#(< ~counter~0 16)} assume !!(#t~post7 < 20);havoc #t~post7; {89581#(< ~counter~0 16)} is VALID [2022-04-28 06:00:36,708 INFO L290 TraceCheckUtils]: 81: Hoare triple {89606#(< ~counter~0 15)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {89581#(< ~counter~0 16)} is VALID [2022-04-28 06:00:36,708 INFO L290 TraceCheckUtils]: 80: Hoare triple {89606#(< ~counter~0 15)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {89606#(< ~counter~0 15)} is VALID [2022-04-28 06:00:36,708 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {89067#true} {89606#(< ~counter~0 15)} #96#return; {89606#(< ~counter~0 15)} is VALID [2022-04-28 06:00:36,708 INFO L290 TraceCheckUtils]: 78: Hoare triple {89067#true} assume true; {89067#true} is VALID [2022-04-28 06:00:36,708 INFO L290 TraceCheckUtils]: 77: Hoare triple {89067#true} assume !(0 == ~cond); {89067#true} is VALID [2022-04-28 06:00:36,708 INFO L290 TraceCheckUtils]: 76: Hoare triple {89067#true} ~cond := #in~cond; {89067#true} is VALID [2022-04-28 06:00:36,709 INFO L272 TraceCheckUtils]: 75: Hoare triple {89606#(< ~counter~0 15)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {89067#true} is VALID [2022-04-28 06:00:36,709 INFO L290 TraceCheckUtils]: 74: Hoare triple {89606#(< ~counter~0 15)} assume !!(#t~post7 < 20);havoc #t~post7; {89606#(< ~counter~0 15)} is VALID [2022-04-28 06:00:36,710 INFO L290 TraceCheckUtils]: 73: Hoare triple {89424#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {89606#(< ~counter~0 15)} is VALID [2022-04-28 06:00:36,710 INFO L290 TraceCheckUtils]: 72: Hoare triple {89424#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {89424#(<= ~counter~0 13)} is VALID [2022-04-28 06:00:36,710 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {89067#true} {89424#(<= ~counter~0 13)} #96#return; {89424#(<= ~counter~0 13)} is VALID [2022-04-28 06:00:36,710 INFO L290 TraceCheckUtils]: 70: Hoare triple {89067#true} assume true; {89067#true} is VALID [2022-04-28 06:00:36,710 INFO L290 TraceCheckUtils]: 69: Hoare triple {89067#true} assume !(0 == ~cond); {89067#true} is VALID [2022-04-28 06:00:36,711 INFO L290 TraceCheckUtils]: 68: Hoare triple {89067#true} ~cond := #in~cond; {89067#true} is VALID [2022-04-28 06:00:36,711 INFO L272 TraceCheckUtils]: 67: Hoare triple {89424#(<= ~counter~0 13)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {89067#true} is VALID [2022-04-28 06:00:36,711 INFO L290 TraceCheckUtils]: 66: Hoare triple {89424#(<= ~counter~0 13)} assume !!(#t~post7 < 20);havoc #t~post7; {89424#(<= ~counter~0 13)} is VALID [2022-04-28 06:00:36,712 INFO L290 TraceCheckUtils]: 65: Hoare triple {89399#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {89424#(<= ~counter~0 13)} is VALID [2022-04-28 06:00:36,712 INFO L290 TraceCheckUtils]: 64: Hoare triple {89399#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {89399#(<= ~counter~0 12)} is VALID [2022-04-28 06:00:36,712 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {89067#true} {89399#(<= ~counter~0 12)} #96#return; {89399#(<= ~counter~0 12)} is VALID [2022-04-28 06:00:36,712 INFO L290 TraceCheckUtils]: 62: Hoare triple {89067#true} assume true; {89067#true} is VALID [2022-04-28 06:00:36,713 INFO L290 TraceCheckUtils]: 61: Hoare triple {89067#true} assume !(0 == ~cond); {89067#true} is VALID [2022-04-28 06:00:36,713 INFO L290 TraceCheckUtils]: 60: Hoare triple {89067#true} ~cond := #in~cond; {89067#true} is VALID [2022-04-28 06:00:36,713 INFO L272 TraceCheckUtils]: 59: Hoare triple {89399#(<= ~counter~0 12)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {89067#true} is VALID [2022-04-28 06:00:36,713 INFO L290 TraceCheckUtils]: 58: Hoare triple {89399#(<= ~counter~0 12)} assume !!(#t~post7 < 20);havoc #t~post7; {89399#(<= ~counter~0 12)} is VALID [2022-04-28 06:00:36,714 INFO L290 TraceCheckUtils]: 57: Hoare triple {89374#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {89399#(<= ~counter~0 12)} is VALID [2022-04-28 06:00:36,714 INFO L290 TraceCheckUtils]: 56: Hoare triple {89374#(<= ~counter~0 11)} assume !!(0 != ~r~0); {89374#(<= ~counter~0 11)} is VALID [2022-04-28 06:00:36,714 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {89067#true} {89374#(<= ~counter~0 11)} #94#return; {89374#(<= ~counter~0 11)} is VALID [2022-04-28 06:00:36,715 INFO L290 TraceCheckUtils]: 54: Hoare triple {89067#true} assume true; {89067#true} is VALID [2022-04-28 06:00:36,715 INFO L290 TraceCheckUtils]: 53: Hoare triple {89067#true} assume !(0 == ~cond); {89067#true} is VALID [2022-04-28 06:00:36,715 INFO L290 TraceCheckUtils]: 52: Hoare triple {89067#true} ~cond := #in~cond; {89067#true} is VALID [2022-04-28 06:00:36,715 INFO L272 TraceCheckUtils]: 51: Hoare triple {89374#(<= ~counter~0 11)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {89067#true} is VALID [2022-04-28 06:00:36,715 INFO L290 TraceCheckUtils]: 50: Hoare triple {89374#(<= ~counter~0 11)} assume !!(#t~post6 < 20);havoc #t~post6; {89374#(<= ~counter~0 11)} is VALID [2022-04-28 06:00:36,716 INFO L290 TraceCheckUtils]: 49: Hoare triple {89349#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {89374#(<= ~counter~0 11)} is VALID [2022-04-28 06:00:36,716 INFO L290 TraceCheckUtils]: 48: Hoare triple {89349#(<= ~counter~0 10)} assume !(~r~0 < 0); {89349#(<= ~counter~0 10)} is VALID [2022-04-28 06:00:36,717 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {89067#true} {89349#(<= ~counter~0 10)} #98#return; {89349#(<= ~counter~0 10)} is VALID [2022-04-28 06:00:36,717 INFO L290 TraceCheckUtils]: 46: Hoare triple {89067#true} assume true; {89067#true} is VALID [2022-04-28 06:00:36,717 INFO L290 TraceCheckUtils]: 45: Hoare triple {89067#true} assume !(0 == ~cond); {89067#true} is VALID [2022-04-28 06:00:36,717 INFO L290 TraceCheckUtils]: 44: Hoare triple {89067#true} ~cond := #in~cond; {89067#true} is VALID [2022-04-28 06:00:36,717 INFO L272 TraceCheckUtils]: 43: Hoare triple {89349#(<= ~counter~0 10)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {89067#true} is VALID [2022-04-28 06:00:36,717 INFO L290 TraceCheckUtils]: 42: Hoare triple {89349#(<= ~counter~0 10)} assume !!(#t~post8 < 20);havoc #t~post8; {89349#(<= ~counter~0 10)} is VALID [2022-04-28 06:00:36,718 INFO L290 TraceCheckUtils]: 41: Hoare triple {89324#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {89349#(<= ~counter~0 10)} is VALID [2022-04-28 06:00:36,718 INFO L290 TraceCheckUtils]: 40: Hoare triple {89324#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {89324#(<= ~counter~0 9)} is VALID [2022-04-28 06:00:36,719 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {89067#true} {89324#(<= ~counter~0 9)} #98#return; {89324#(<= ~counter~0 9)} is VALID [2022-04-28 06:00:36,719 INFO L290 TraceCheckUtils]: 38: Hoare triple {89067#true} assume true; {89067#true} is VALID [2022-04-28 06:00:36,719 INFO L290 TraceCheckUtils]: 37: Hoare triple {89067#true} assume !(0 == ~cond); {89067#true} is VALID [2022-04-28 06:00:36,719 INFO L290 TraceCheckUtils]: 36: Hoare triple {89067#true} ~cond := #in~cond; {89067#true} is VALID [2022-04-28 06:00:36,719 INFO L272 TraceCheckUtils]: 35: Hoare triple {89324#(<= ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {89067#true} is VALID [2022-04-28 06:00:36,719 INFO L290 TraceCheckUtils]: 34: Hoare triple {89324#(<= ~counter~0 9)} assume !!(#t~post8 < 20);havoc #t~post8; {89324#(<= ~counter~0 9)} is VALID [2022-04-28 06:00:36,720 INFO L290 TraceCheckUtils]: 33: Hoare triple {89299#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {89324#(<= ~counter~0 9)} is VALID [2022-04-28 06:00:36,720 INFO L290 TraceCheckUtils]: 32: Hoare triple {89299#(<= ~counter~0 8)} assume !(~r~0 > 0); {89299#(<= ~counter~0 8)} is VALID [2022-04-28 06:00:36,721 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {89067#true} {89299#(<= ~counter~0 8)} #96#return; {89299#(<= ~counter~0 8)} is VALID [2022-04-28 06:00:36,721 INFO L290 TraceCheckUtils]: 30: Hoare triple {89067#true} assume true; {89067#true} is VALID [2022-04-28 06:00:36,721 INFO L290 TraceCheckUtils]: 29: Hoare triple {89067#true} assume !(0 == ~cond); {89067#true} is VALID [2022-04-28 06:00:36,721 INFO L290 TraceCheckUtils]: 28: Hoare triple {89067#true} ~cond := #in~cond; {89067#true} is VALID [2022-04-28 06:00:36,721 INFO L272 TraceCheckUtils]: 27: Hoare triple {89299#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {89067#true} is VALID [2022-04-28 06:00:36,721 INFO L290 TraceCheckUtils]: 26: Hoare triple {89299#(<= ~counter~0 8)} assume !!(#t~post7 < 20);havoc #t~post7; {89299#(<= ~counter~0 8)} is VALID [2022-04-28 06:00:36,722 INFO L290 TraceCheckUtils]: 25: Hoare triple {89274#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {89299#(<= ~counter~0 8)} is VALID [2022-04-28 06:00:36,722 INFO L290 TraceCheckUtils]: 24: Hoare triple {89274#(<= ~counter~0 7)} assume !!(0 != ~r~0); {89274#(<= ~counter~0 7)} is VALID [2022-04-28 06:00:36,723 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {89067#true} {89274#(<= ~counter~0 7)} #94#return; {89274#(<= ~counter~0 7)} is VALID [2022-04-28 06:00:36,723 INFO L290 TraceCheckUtils]: 22: Hoare triple {89067#true} assume true; {89067#true} is VALID [2022-04-28 06:00:36,723 INFO L290 TraceCheckUtils]: 21: Hoare triple {89067#true} assume !(0 == ~cond); {89067#true} is VALID [2022-04-28 06:00:36,723 INFO L290 TraceCheckUtils]: 20: Hoare triple {89067#true} ~cond := #in~cond; {89067#true} is VALID [2022-04-28 06:00:36,723 INFO L272 TraceCheckUtils]: 19: Hoare triple {89274#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {89067#true} is VALID [2022-04-28 06:00:36,723 INFO L290 TraceCheckUtils]: 18: Hoare triple {89274#(<= ~counter~0 7)} assume !!(#t~post6 < 20);havoc #t~post6; {89274#(<= ~counter~0 7)} is VALID [2022-04-28 06:00:36,724 INFO L290 TraceCheckUtils]: 17: Hoare triple {89249#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {89274#(<= ~counter~0 7)} is VALID [2022-04-28 06:00:36,724 INFO L290 TraceCheckUtils]: 16: Hoare triple {89249#(<= ~counter~0 6)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {89249#(<= ~counter~0 6)} is VALID [2022-04-28 06:00:36,725 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {89067#true} {89249#(<= ~counter~0 6)} #92#return; {89249#(<= ~counter~0 6)} is VALID [2022-04-28 06:00:36,725 INFO L290 TraceCheckUtils]: 14: Hoare triple {89067#true} assume true; {89067#true} is VALID [2022-04-28 06:00:36,725 INFO L290 TraceCheckUtils]: 13: Hoare triple {89067#true} assume !(0 == ~cond); {89067#true} is VALID [2022-04-28 06:00:36,725 INFO L290 TraceCheckUtils]: 12: Hoare triple {89067#true} ~cond := #in~cond; {89067#true} is VALID [2022-04-28 06:00:36,725 INFO L272 TraceCheckUtils]: 11: Hoare triple {89249#(<= ~counter~0 6)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {89067#true} is VALID [2022-04-28 06:00:36,725 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {89067#true} {89249#(<= ~counter~0 6)} #90#return; {89249#(<= ~counter~0 6)} is VALID [2022-04-28 06:00:36,725 INFO L290 TraceCheckUtils]: 9: Hoare triple {89067#true} assume true; {89067#true} is VALID [2022-04-28 06:00:36,725 INFO L290 TraceCheckUtils]: 8: Hoare triple {89067#true} assume !(0 == ~cond); {89067#true} is VALID [2022-04-28 06:00:36,725 INFO L290 TraceCheckUtils]: 7: Hoare triple {89067#true} ~cond := #in~cond; {89067#true} is VALID [2022-04-28 06:00:36,726 INFO L272 TraceCheckUtils]: 6: Hoare triple {89249#(<= ~counter~0 6)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {89067#true} is VALID [2022-04-28 06:00:36,726 INFO L290 TraceCheckUtils]: 5: Hoare triple {89249#(<= ~counter~0 6)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {89249#(<= ~counter~0 6)} is VALID [2022-04-28 06:00:36,726 INFO L272 TraceCheckUtils]: 4: Hoare triple {89249#(<= ~counter~0 6)} call #t~ret9 := main(); {89249#(<= ~counter~0 6)} is VALID [2022-04-28 06:00:36,726 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {89249#(<= ~counter~0 6)} {89067#true} #102#return; {89249#(<= ~counter~0 6)} is VALID [2022-04-28 06:00:36,727 INFO L290 TraceCheckUtils]: 2: Hoare triple {89249#(<= ~counter~0 6)} assume true; {89249#(<= ~counter~0 6)} is VALID [2022-04-28 06:00:36,727 INFO L290 TraceCheckUtils]: 1: Hoare triple {89067#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {89249#(<= ~counter~0 6)} is VALID [2022-04-28 06:00:36,727 INFO L272 TraceCheckUtils]: 0: Hoare triple {89067#true} call ULTIMATE.init(); {89067#true} is VALID [2022-04-28 06:00:36,727 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 26 proven. 116 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2022-04-28 06:00:36,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:00:36,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318238224] [2022-04-28 06:00:36,728 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:00:36,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1645766223] [2022-04-28 06:00:36,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1645766223] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 06:00:36,728 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 06:00:36,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 24 [2022-04-28 06:00:36,728 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:00:36,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [866547237] [2022-04-28 06:00:36,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [866547237] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:00:36,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:00:36,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 06:00:36,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242346738] [2022-04-28 06:00:36,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:00:36,729 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.294117647058823) internal successors, (90), 16 states have internal predecessors, (90), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) Word has length 127 [2022-04-28 06:00:36,729 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:00:36,729 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 5.294117647058823) internal successors, (90), 16 states have internal predecessors, (90), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-28 06:00:36,831 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:00:36,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 06:00:36,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:00:36,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 06:00:36,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-28 06:00:36,832 INFO L87 Difference]: Start difference. First operand 650 states and 879 transitions. Second operand has 17 states, 17 states have (on average 5.294117647058823) internal successors, (90), 16 states have internal predecessors, (90), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-28 06:00:40,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:00:40,194 INFO L93 Difference]: Finished difference Result 705 states and 956 transitions. [2022-04-28 06:00:40,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-28 06:00:40,194 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.294117647058823) internal successors, (90), 16 states have internal predecessors, (90), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) Word has length 127 [2022-04-28 06:00:40,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:00:40,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 5.294117647058823) internal successors, (90), 16 states have internal predecessors, (90), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-28 06:00:40,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 274 transitions. [2022-04-28 06:00:40,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 5.294117647058823) internal successors, (90), 16 states have internal predecessors, (90), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-28 06:00:40,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 274 transitions. [2022-04-28 06:00:40,198 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 274 transitions. [2022-04-28 06:00:40,446 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 274 edges. 274 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:00:40,466 INFO L225 Difference]: With dead ends: 705 [2022-04-28 06:00:40,466 INFO L226 Difference]: Without dead ends: 694 [2022-04-28 06:00:40,467 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 230 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=439, Invalid=683, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 06:00:40,467 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 231 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 222 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 222 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 06:00:40,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 305 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [222 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 06:00:40,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2022-04-28 06:00:42,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 672. [2022-04-28 06:00:42,918 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:00:42,919 INFO L82 GeneralOperation]: Start isEquivalent. First operand 694 states. Second operand has 672 states, 502 states have (on average 1.2151394422310757) internal successors, (610), 512 states have internal predecessors, (610), 153 states have call successors, (153), 18 states have call predecessors, (153), 16 states have return successors, (151), 141 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-28 06:00:42,919 INFO L74 IsIncluded]: Start isIncluded. First operand 694 states. Second operand has 672 states, 502 states have (on average 1.2151394422310757) internal successors, (610), 512 states have internal predecessors, (610), 153 states have call successors, (153), 18 states have call predecessors, (153), 16 states have return successors, (151), 141 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-28 06:00:42,920 INFO L87 Difference]: Start difference. First operand 694 states. Second operand has 672 states, 502 states have (on average 1.2151394422310757) internal successors, (610), 512 states have internal predecessors, (610), 153 states have call successors, (153), 18 states have call predecessors, (153), 16 states have return successors, (151), 141 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-28 06:00:42,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:00:42,949 INFO L93 Difference]: Finished difference Result 694 states and 940 transitions. [2022-04-28 06:00:42,949 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 940 transitions. [2022-04-28 06:00:42,950 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:00:42,950 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:00:42,951 INFO L74 IsIncluded]: Start isIncluded. First operand has 672 states, 502 states have (on average 1.2151394422310757) internal successors, (610), 512 states have internal predecessors, (610), 153 states have call successors, (153), 18 states have call predecessors, (153), 16 states have return successors, (151), 141 states have call predecessors, (151), 151 states have call successors, (151) Second operand 694 states. [2022-04-28 06:00:42,952 INFO L87 Difference]: Start difference. First operand has 672 states, 502 states have (on average 1.2151394422310757) internal successors, (610), 512 states have internal predecessors, (610), 153 states have call successors, (153), 18 states have call predecessors, (153), 16 states have return successors, (151), 141 states have call predecessors, (151), 151 states have call successors, (151) Second operand 694 states. [2022-04-28 06:00:42,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:00:42,990 INFO L93 Difference]: Finished difference Result 694 states and 940 transitions. [2022-04-28 06:00:42,990 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 940 transitions. [2022-04-28 06:00:42,991 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:00:42,991 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:00:42,991 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:00:42,991 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:00:42,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 502 states have (on average 1.2151394422310757) internal successors, (610), 512 states have internal predecessors, (610), 153 states have call successors, (153), 18 states have call predecessors, (153), 16 states have return successors, (151), 141 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-28 06:00:43,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 914 transitions. [2022-04-28 06:00:43,031 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 914 transitions. Word has length 127 [2022-04-28 06:00:43,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:00:43,031 INFO L495 AbstractCegarLoop]: Abstraction has 672 states and 914 transitions. [2022-04-28 06:00:43,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.294117647058823) internal successors, (90), 16 states have internal predecessors, (90), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-28 06:00:43,031 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 672 states and 914 transitions. [2022-04-28 06:00:48,061 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 914 edges. 913 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 06:00:48,061 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 914 transitions. [2022-04-28 06:00:48,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-04-28 06:00:48,062 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:00:48,062 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 6, 6, 6, 6, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:00:48,090 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2022-04-28 06:00:48,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:00:48,263 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:00:48,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:00:48,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1410231607, now seen corresponding path program 19 times [2022-04-28 06:00:48,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:00:48,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1888059345] [2022-04-28 06:00:48,264 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 06:00:48,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1410231607, now seen corresponding path program 20 times [2022-04-28 06:00:48,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:00:48,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055971504] [2022-04-28 06:00:48,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:00:48,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:00:48,296 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:00:48,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [990119166] [2022-04-28 06:00:48,296 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 06:00:48,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:00:48,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:00:48,298 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:00:48,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-04-28 06:00:48,368 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 06:00:48,368 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:00:48,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-28 06:00:48,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:00:48,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:00:49,298 INFO L272 TraceCheckUtils]: 0: Hoare triple {94014#true} call ULTIMATE.init(); {94014#true} is VALID [2022-04-28 06:00:49,299 INFO L290 TraceCheckUtils]: 1: Hoare triple {94014#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {94022#(<= ~counter~0 0)} is VALID [2022-04-28 06:00:49,299 INFO L290 TraceCheckUtils]: 2: Hoare triple {94022#(<= ~counter~0 0)} assume true; {94022#(<= ~counter~0 0)} is VALID [2022-04-28 06:00:49,300 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {94022#(<= ~counter~0 0)} {94014#true} #102#return; {94022#(<= ~counter~0 0)} is VALID [2022-04-28 06:00:49,300 INFO L272 TraceCheckUtils]: 4: Hoare triple {94022#(<= ~counter~0 0)} call #t~ret9 := main(); {94022#(<= ~counter~0 0)} is VALID [2022-04-28 06:00:49,300 INFO L290 TraceCheckUtils]: 5: Hoare triple {94022#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {94022#(<= ~counter~0 0)} is VALID [2022-04-28 06:00:49,301 INFO L272 TraceCheckUtils]: 6: Hoare triple {94022#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {94022#(<= ~counter~0 0)} is VALID [2022-04-28 06:00:49,301 INFO L290 TraceCheckUtils]: 7: Hoare triple {94022#(<= ~counter~0 0)} ~cond := #in~cond; {94022#(<= ~counter~0 0)} is VALID [2022-04-28 06:00:49,301 INFO L290 TraceCheckUtils]: 8: Hoare triple {94022#(<= ~counter~0 0)} assume !(0 == ~cond); {94022#(<= ~counter~0 0)} is VALID [2022-04-28 06:00:49,302 INFO L290 TraceCheckUtils]: 9: Hoare triple {94022#(<= ~counter~0 0)} assume true; {94022#(<= ~counter~0 0)} is VALID [2022-04-28 06:00:49,302 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {94022#(<= ~counter~0 0)} {94022#(<= ~counter~0 0)} #90#return; {94022#(<= ~counter~0 0)} is VALID [2022-04-28 06:00:49,303 INFO L272 TraceCheckUtils]: 11: Hoare triple {94022#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {94022#(<= ~counter~0 0)} is VALID [2022-04-28 06:00:49,303 INFO L290 TraceCheckUtils]: 12: Hoare triple {94022#(<= ~counter~0 0)} ~cond := #in~cond; {94022#(<= ~counter~0 0)} is VALID [2022-04-28 06:00:49,303 INFO L290 TraceCheckUtils]: 13: Hoare triple {94022#(<= ~counter~0 0)} assume !(0 == ~cond); {94022#(<= ~counter~0 0)} is VALID [2022-04-28 06:00:49,304 INFO L290 TraceCheckUtils]: 14: Hoare triple {94022#(<= ~counter~0 0)} assume true; {94022#(<= ~counter~0 0)} is VALID [2022-04-28 06:00:49,304 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {94022#(<= ~counter~0 0)} {94022#(<= ~counter~0 0)} #92#return; {94022#(<= ~counter~0 0)} is VALID [2022-04-28 06:00:49,304 INFO L290 TraceCheckUtils]: 16: Hoare triple {94022#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {94022#(<= ~counter~0 0)} is VALID [2022-04-28 06:00:49,307 INFO L290 TraceCheckUtils]: 17: Hoare triple {94022#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {94071#(<= ~counter~0 1)} is VALID [2022-04-28 06:00:49,307 INFO L290 TraceCheckUtils]: 18: Hoare triple {94071#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {94071#(<= ~counter~0 1)} is VALID [2022-04-28 06:00:49,308 INFO L272 TraceCheckUtils]: 19: Hoare triple {94071#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {94071#(<= ~counter~0 1)} is VALID [2022-04-28 06:00:49,308 INFO L290 TraceCheckUtils]: 20: Hoare triple {94071#(<= ~counter~0 1)} ~cond := #in~cond; {94071#(<= ~counter~0 1)} is VALID [2022-04-28 06:00:49,308 INFO L290 TraceCheckUtils]: 21: Hoare triple {94071#(<= ~counter~0 1)} assume !(0 == ~cond); {94071#(<= ~counter~0 1)} is VALID [2022-04-28 06:00:49,309 INFO L290 TraceCheckUtils]: 22: Hoare triple {94071#(<= ~counter~0 1)} assume true; {94071#(<= ~counter~0 1)} is VALID [2022-04-28 06:00:49,309 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {94071#(<= ~counter~0 1)} {94071#(<= ~counter~0 1)} #94#return; {94071#(<= ~counter~0 1)} is VALID [2022-04-28 06:00:49,310 INFO L290 TraceCheckUtils]: 24: Hoare triple {94071#(<= ~counter~0 1)} assume !!(0 != ~r~0); {94071#(<= ~counter~0 1)} is VALID [2022-04-28 06:00:49,311 INFO L290 TraceCheckUtils]: 25: Hoare triple {94071#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {94096#(<= ~counter~0 2)} is VALID [2022-04-28 06:00:49,311 INFO L290 TraceCheckUtils]: 26: Hoare triple {94096#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {94096#(<= ~counter~0 2)} is VALID [2022-04-28 06:00:49,312 INFO L272 TraceCheckUtils]: 27: Hoare triple {94096#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {94096#(<= ~counter~0 2)} is VALID [2022-04-28 06:00:49,312 INFO L290 TraceCheckUtils]: 28: Hoare triple {94096#(<= ~counter~0 2)} ~cond := #in~cond; {94096#(<= ~counter~0 2)} is VALID [2022-04-28 06:00:49,312 INFO L290 TraceCheckUtils]: 29: Hoare triple {94096#(<= ~counter~0 2)} assume !(0 == ~cond); {94096#(<= ~counter~0 2)} is VALID [2022-04-28 06:00:49,313 INFO L290 TraceCheckUtils]: 30: Hoare triple {94096#(<= ~counter~0 2)} assume true; {94096#(<= ~counter~0 2)} is VALID [2022-04-28 06:00:49,313 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {94096#(<= ~counter~0 2)} {94096#(<= ~counter~0 2)} #96#return; {94096#(<= ~counter~0 2)} is VALID [2022-04-28 06:00:49,314 INFO L290 TraceCheckUtils]: 32: Hoare triple {94096#(<= ~counter~0 2)} assume !(~r~0 > 0); {94096#(<= ~counter~0 2)} is VALID [2022-04-28 06:00:49,315 INFO L290 TraceCheckUtils]: 33: Hoare triple {94096#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {94121#(<= ~counter~0 3)} is VALID [2022-04-28 06:00:49,315 INFO L290 TraceCheckUtils]: 34: Hoare triple {94121#(<= ~counter~0 3)} assume !!(#t~post8 < 20);havoc #t~post8; {94121#(<= ~counter~0 3)} is VALID [2022-04-28 06:00:49,316 INFO L272 TraceCheckUtils]: 35: Hoare triple {94121#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {94121#(<= ~counter~0 3)} is VALID [2022-04-28 06:00:49,316 INFO L290 TraceCheckUtils]: 36: Hoare triple {94121#(<= ~counter~0 3)} ~cond := #in~cond; {94121#(<= ~counter~0 3)} is VALID [2022-04-28 06:00:49,316 INFO L290 TraceCheckUtils]: 37: Hoare triple {94121#(<= ~counter~0 3)} assume !(0 == ~cond); {94121#(<= ~counter~0 3)} is VALID [2022-04-28 06:00:49,317 INFO L290 TraceCheckUtils]: 38: Hoare triple {94121#(<= ~counter~0 3)} assume true; {94121#(<= ~counter~0 3)} is VALID [2022-04-28 06:00:49,317 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {94121#(<= ~counter~0 3)} {94121#(<= ~counter~0 3)} #98#return; {94121#(<= ~counter~0 3)} is VALID [2022-04-28 06:00:49,318 INFO L290 TraceCheckUtils]: 40: Hoare triple {94121#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {94121#(<= ~counter~0 3)} is VALID [2022-04-28 06:00:49,319 INFO L290 TraceCheckUtils]: 41: Hoare triple {94121#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {94146#(<= ~counter~0 4)} is VALID [2022-04-28 06:00:49,319 INFO L290 TraceCheckUtils]: 42: Hoare triple {94146#(<= ~counter~0 4)} assume !!(#t~post8 < 20);havoc #t~post8; {94146#(<= ~counter~0 4)} is VALID [2022-04-28 06:00:49,320 INFO L272 TraceCheckUtils]: 43: Hoare triple {94146#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {94146#(<= ~counter~0 4)} is VALID [2022-04-28 06:00:49,320 INFO L290 TraceCheckUtils]: 44: Hoare triple {94146#(<= ~counter~0 4)} ~cond := #in~cond; {94146#(<= ~counter~0 4)} is VALID [2022-04-28 06:00:49,321 INFO L290 TraceCheckUtils]: 45: Hoare triple {94146#(<= ~counter~0 4)} assume !(0 == ~cond); {94146#(<= ~counter~0 4)} is VALID [2022-04-28 06:00:49,321 INFO L290 TraceCheckUtils]: 46: Hoare triple {94146#(<= ~counter~0 4)} assume true; {94146#(<= ~counter~0 4)} is VALID [2022-04-28 06:00:49,321 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {94146#(<= ~counter~0 4)} {94146#(<= ~counter~0 4)} #98#return; {94146#(<= ~counter~0 4)} is VALID [2022-04-28 06:00:49,322 INFO L290 TraceCheckUtils]: 48: Hoare triple {94146#(<= ~counter~0 4)} assume !(~r~0 < 0); {94146#(<= ~counter~0 4)} is VALID [2022-04-28 06:00:49,323 INFO L290 TraceCheckUtils]: 49: Hoare triple {94146#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {94171#(<= ~counter~0 5)} is VALID [2022-04-28 06:00:49,323 INFO L290 TraceCheckUtils]: 50: Hoare triple {94171#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {94171#(<= ~counter~0 5)} is VALID [2022-04-28 06:00:49,324 INFO L272 TraceCheckUtils]: 51: Hoare triple {94171#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {94171#(<= ~counter~0 5)} is VALID [2022-04-28 06:00:49,324 INFO L290 TraceCheckUtils]: 52: Hoare triple {94171#(<= ~counter~0 5)} ~cond := #in~cond; {94171#(<= ~counter~0 5)} is VALID [2022-04-28 06:00:49,325 INFO L290 TraceCheckUtils]: 53: Hoare triple {94171#(<= ~counter~0 5)} assume !(0 == ~cond); {94171#(<= ~counter~0 5)} is VALID [2022-04-28 06:00:49,325 INFO L290 TraceCheckUtils]: 54: Hoare triple {94171#(<= ~counter~0 5)} assume true; {94171#(<= ~counter~0 5)} is VALID [2022-04-28 06:00:49,325 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {94171#(<= ~counter~0 5)} {94171#(<= ~counter~0 5)} #94#return; {94171#(<= ~counter~0 5)} is VALID [2022-04-28 06:00:49,326 INFO L290 TraceCheckUtils]: 56: Hoare triple {94171#(<= ~counter~0 5)} assume !!(0 != ~r~0); {94171#(<= ~counter~0 5)} is VALID [2022-04-28 06:00:49,327 INFO L290 TraceCheckUtils]: 57: Hoare triple {94171#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {94196#(<= ~counter~0 6)} is VALID [2022-04-28 06:00:49,327 INFO L290 TraceCheckUtils]: 58: Hoare triple {94196#(<= ~counter~0 6)} assume !!(#t~post7 < 20);havoc #t~post7; {94196#(<= ~counter~0 6)} is VALID [2022-04-28 06:00:49,328 INFO L272 TraceCheckUtils]: 59: Hoare triple {94196#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {94196#(<= ~counter~0 6)} is VALID [2022-04-28 06:00:49,328 INFO L290 TraceCheckUtils]: 60: Hoare triple {94196#(<= ~counter~0 6)} ~cond := #in~cond; {94196#(<= ~counter~0 6)} is VALID [2022-04-28 06:00:49,328 INFO L290 TraceCheckUtils]: 61: Hoare triple {94196#(<= ~counter~0 6)} assume !(0 == ~cond); {94196#(<= ~counter~0 6)} is VALID [2022-04-28 06:00:49,329 INFO L290 TraceCheckUtils]: 62: Hoare triple {94196#(<= ~counter~0 6)} assume true; {94196#(<= ~counter~0 6)} is VALID [2022-04-28 06:00:49,329 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {94196#(<= ~counter~0 6)} {94196#(<= ~counter~0 6)} #96#return; {94196#(<= ~counter~0 6)} is VALID [2022-04-28 06:00:49,330 INFO L290 TraceCheckUtils]: 64: Hoare triple {94196#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {94196#(<= ~counter~0 6)} is VALID [2022-04-28 06:00:49,331 INFO L290 TraceCheckUtils]: 65: Hoare triple {94196#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {94221#(<= ~counter~0 7)} is VALID [2022-04-28 06:00:49,332 INFO L290 TraceCheckUtils]: 66: Hoare triple {94221#(<= ~counter~0 7)} assume !!(#t~post7 < 20);havoc #t~post7; {94221#(<= ~counter~0 7)} is VALID [2022-04-28 06:00:49,332 INFO L272 TraceCheckUtils]: 67: Hoare triple {94221#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {94221#(<= ~counter~0 7)} is VALID [2022-04-28 06:00:49,332 INFO L290 TraceCheckUtils]: 68: Hoare triple {94221#(<= ~counter~0 7)} ~cond := #in~cond; {94221#(<= ~counter~0 7)} is VALID [2022-04-28 06:00:49,333 INFO L290 TraceCheckUtils]: 69: Hoare triple {94221#(<= ~counter~0 7)} assume !(0 == ~cond); {94221#(<= ~counter~0 7)} is VALID [2022-04-28 06:00:49,333 INFO L290 TraceCheckUtils]: 70: Hoare triple {94221#(<= ~counter~0 7)} assume true; {94221#(<= ~counter~0 7)} is VALID [2022-04-28 06:00:49,334 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {94221#(<= ~counter~0 7)} {94221#(<= ~counter~0 7)} #96#return; {94221#(<= ~counter~0 7)} is VALID [2022-04-28 06:00:49,334 INFO L290 TraceCheckUtils]: 72: Hoare triple {94221#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {94221#(<= ~counter~0 7)} is VALID [2022-04-28 06:00:49,335 INFO L290 TraceCheckUtils]: 73: Hoare triple {94221#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {94246#(<= ~counter~0 8)} is VALID [2022-04-28 06:00:49,335 INFO L290 TraceCheckUtils]: 74: Hoare triple {94246#(<= ~counter~0 8)} assume !!(#t~post7 < 20);havoc #t~post7; {94246#(<= ~counter~0 8)} is VALID [2022-04-28 06:00:49,336 INFO L272 TraceCheckUtils]: 75: Hoare triple {94246#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {94246#(<= ~counter~0 8)} is VALID [2022-04-28 06:00:49,336 INFO L290 TraceCheckUtils]: 76: Hoare triple {94246#(<= ~counter~0 8)} ~cond := #in~cond; {94246#(<= ~counter~0 8)} is VALID [2022-04-28 06:00:49,337 INFO L290 TraceCheckUtils]: 77: Hoare triple {94246#(<= ~counter~0 8)} assume !(0 == ~cond); {94246#(<= ~counter~0 8)} is VALID [2022-04-28 06:00:49,337 INFO L290 TraceCheckUtils]: 78: Hoare triple {94246#(<= ~counter~0 8)} assume true; {94246#(<= ~counter~0 8)} is VALID [2022-04-28 06:00:49,337 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {94246#(<= ~counter~0 8)} {94246#(<= ~counter~0 8)} #96#return; {94246#(<= ~counter~0 8)} is VALID [2022-04-28 06:00:49,338 INFO L290 TraceCheckUtils]: 80: Hoare triple {94246#(<= ~counter~0 8)} assume !(~r~0 > 0); {94246#(<= ~counter~0 8)} is VALID [2022-04-28 06:00:49,339 INFO L290 TraceCheckUtils]: 81: Hoare triple {94246#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {94271#(<= ~counter~0 9)} is VALID [2022-04-28 06:00:49,340 INFO L290 TraceCheckUtils]: 82: Hoare triple {94271#(<= ~counter~0 9)} assume !!(#t~post8 < 20);havoc #t~post8; {94271#(<= ~counter~0 9)} is VALID [2022-04-28 06:00:49,340 INFO L272 TraceCheckUtils]: 83: Hoare triple {94271#(<= ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {94271#(<= ~counter~0 9)} is VALID [2022-04-28 06:00:49,341 INFO L290 TraceCheckUtils]: 84: Hoare triple {94271#(<= ~counter~0 9)} ~cond := #in~cond; {94271#(<= ~counter~0 9)} is VALID [2022-04-28 06:00:49,341 INFO L290 TraceCheckUtils]: 85: Hoare triple {94271#(<= ~counter~0 9)} assume !(0 == ~cond); {94271#(<= ~counter~0 9)} is VALID [2022-04-28 06:00:49,341 INFO L290 TraceCheckUtils]: 86: Hoare triple {94271#(<= ~counter~0 9)} assume true; {94271#(<= ~counter~0 9)} is VALID [2022-04-28 06:00:49,342 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {94271#(<= ~counter~0 9)} {94271#(<= ~counter~0 9)} #98#return; {94271#(<= ~counter~0 9)} is VALID [2022-04-28 06:00:49,342 INFO L290 TraceCheckUtils]: 88: Hoare triple {94271#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {94271#(<= ~counter~0 9)} is VALID [2022-04-28 06:00:49,343 INFO L290 TraceCheckUtils]: 89: Hoare triple {94271#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {94296#(<= ~counter~0 10)} is VALID [2022-04-28 06:00:49,344 INFO L290 TraceCheckUtils]: 90: Hoare triple {94296#(<= ~counter~0 10)} assume !!(#t~post8 < 20);havoc #t~post8; {94296#(<= ~counter~0 10)} is VALID [2022-04-28 06:00:49,344 INFO L272 TraceCheckUtils]: 91: Hoare triple {94296#(<= ~counter~0 10)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {94296#(<= ~counter~0 10)} is VALID [2022-04-28 06:00:49,345 INFO L290 TraceCheckUtils]: 92: Hoare triple {94296#(<= ~counter~0 10)} ~cond := #in~cond; {94296#(<= ~counter~0 10)} is VALID [2022-04-28 06:00:49,345 INFO L290 TraceCheckUtils]: 93: Hoare triple {94296#(<= ~counter~0 10)} assume !(0 == ~cond); {94296#(<= ~counter~0 10)} is VALID [2022-04-28 06:00:49,345 INFO L290 TraceCheckUtils]: 94: Hoare triple {94296#(<= ~counter~0 10)} assume true; {94296#(<= ~counter~0 10)} is VALID [2022-04-28 06:00:49,346 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {94296#(<= ~counter~0 10)} {94296#(<= ~counter~0 10)} #98#return; {94296#(<= ~counter~0 10)} is VALID [2022-04-28 06:00:49,346 INFO L290 TraceCheckUtils]: 96: Hoare triple {94296#(<= ~counter~0 10)} assume !(~r~0 < 0); {94296#(<= ~counter~0 10)} is VALID [2022-04-28 06:00:49,347 INFO L290 TraceCheckUtils]: 97: Hoare triple {94296#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {94321#(<= ~counter~0 11)} is VALID [2022-04-28 06:00:49,348 INFO L290 TraceCheckUtils]: 98: Hoare triple {94321#(<= ~counter~0 11)} assume !!(#t~post6 < 20);havoc #t~post6; {94321#(<= ~counter~0 11)} is VALID [2022-04-28 06:00:49,348 INFO L272 TraceCheckUtils]: 99: Hoare triple {94321#(<= ~counter~0 11)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {94321#(<= ~counter~0 11)} is VALID [2022-04-28 06:00:49,349 INFO L290 TraceCheckUtils]: 100: Hoare triple {94321#(<= ~counter~0 11)} ~cond := #in~cond; {94321#(<= ~counter~0 11)} is VALID [2022-04-28 06:00:49,349 INFO L290 TraceCheckUtils]: 101: Hoare triple {94321#(<= ~counter~0 11)} assume !(0 == ~cond); {94321#(<= ~counter~0 11)} is VALID [2022-04-28 06:00:49,349 INFO L290 TraceCheckUtils]: 102: Hoare triple {94321#(<= ~counter~0 11)} assume true; {94321#(<= ~counter~0 11)} is VALID [2022-04-28 06:00:49,350 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {94321#(<= ~counter~0 11)} {94321#(<= ~counter~0 11)} #94#return; {94321#(<= ~counter~0 11)} is VALID [2022-04-28 06:00:49,350 INFO L290 TraceCheckUtils]: 104: Hoare triple {94321#(<= ~counter~0 11)} assume !!(0 != ~r~0); {94321#(<= ~counter~0 11)} is VALID [2022-04-28 06:00:49,352 INFO L290 TraceCheckUtils]: 105: Hoare triple {94321#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {94346#(<= ~counter~0 12)} is VALID [2022-04-28 06:00:49,352 INFO L290 TraceCheckUtils]: 106: Hoare triple {94346#(<= ~counter~0 12)} assume !!(#t~post7 < 20);havoc #t~post7; {94346#(<= ~counter~0 12)} is VALID [2022-04-28 06:00:49,353 INFO L272 TraceCheckUtils]: 107: Hoare triple {94346#(<= ~counter~0 12)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {94346#(<= ~counter~0 12)} is VALID [2022-04-28 06:00:49,353 INFO L290 TraceCheckUtils]: 108: Hoare triple {94346#(<= ~counter~0 12)} ~cond := #in~cond; {94346#(<= ~counter~0 12)} is VALID [2022-04-28 06:00:49,353 INFO L290 TraceCheckUtils]: 109: Hoare triple {94346#(<= ~counter~0 12)} assume !(0 == ~cond); {94346#(<= ~counter~0 12)} is VALID [2022-04-28 06:00:49,354 INFO L290 TraceCheckUtils]: 110: Hoare triple {94346#(<= ~counter~0 12)} assume true; {94346#(<= ~counter~0 12)} is VALID [2022-04-28 06:00:49,354 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {94346#(<= ~counter~0 12)} {94346#(<= ~counter~0 12)} #96#return; {94346#(<= ~counter~0 12)} is VALID [2022-04-28 06:00:49,355 INFO L290 TraceCheckUtils]: 112: Hoare triple {94346#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {94346#(<= ~counter~0 12)} is VALID [2022-04-28 06:00:49,356 INFO L290 TraceCheckUtils]: 113: Hoare triple {94346#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {94371#(<= ~counter~0 13)} is VALID [2022-04-28 06:00:49,356 INFO L290 TraceCheckUtils]: 114: Hoare triple {94371#(<= ~counter~0 13)} assume !!(#t~post7 < 20);havoc #t~post7; {94371#(<= ~counter~0 13)} is VALID [2022-04-28 06:00:49,357 INFO L272 TraceCheckUtils]: 115: Hoare triple {94371#(<= ~counter~0 13)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {94371#(<= ~counter~0 13)} is VALID [2022-04-28 06:00:49,357 INFO L290 TraceCheckUtils]: 116: Hoare triple {94371#(<= ~counter~0 13)} ~cond := #in~cond; {94371#(<= ~counter~0 13)} is VALID [2022-04-28 06:00:49,357 INFO L290 TraceCheckUtils]: 117: Hoare triple {94371#(<= ~counter~0 13)} assume !(0 == ~cond); {94371#(<= ~counter~0 13)} is VALID [2022-04-28 06:00:49,358 INFO L290 TraceCheckUtils]: 118: Hoare triple {94371#(<= ~counter~0 13)} assume true; {94371#(<= ~counter~0 13)} is VALID [2022-04-28 06:00:49,358 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {94371#(<= ~counter~0 13)} {94371#(<= ~counter~0 13)} #96#return; {94371#(<= ~counter~0 13)} is VALID [2022-04-28 06:00:49,359 INFO L290 TraceCheckUtils]: 120: Hoare triple {94371#(<= ~counter~0 13)} assume !(~r~0 > 0); {94371#(<= ~counter~0 13)} is VALID [2022-04-28 06:00:49,359 INFO L290 TraceCheckUtils]: 121: Hoare triple {94371#(<= ~counter~0 13)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {94396#(<= |main_#t~post8| 13)} is VALID [2022-04-28 06:00:49,359 INFO L290 TraceCheckUtils]: 122: Hoare triple {94396#(<= |main_#t~post8| 13)} assume !(#t~post8 < 20);havoc #t~post8; {94015#false} is VALID [2022-04-28 06:00:49,360 INFO L290 TraceCheckUtils]: 123: Hoare triple {94015#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {94015#false} is VALID [2022-04-28 06:00:49,360 INFO L290 TraceCheckUtils]: 124: Hoare triple {94015#false} assume !(#t~post6 < 20);havoc #t~post6; {94015#false} is VALID [2022-04-28 06:00:49,360 INFO L272 TraceCheckUtils]: 125: Hoare triple {94015#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {94015#false} is VALID [2022-04-28 06:00:49,360 INFO L290 TraceCheckUtils]: 126: Hoare triple {94015#false} ~cond := #in~cond; {94015#false} is VALID [2022-04-28 06:00:49,360 INFO L290 TraceCheckUtils]: 127: Hoare triple {94015#false} assume 0 == ~cond; {94015#false} is VALID [2022-04-28 06:00:49,360 INFO L290 TraceCheckUtils]: 128: Hoare triple {94015#false} assume !false; {94015#false} is VALID [2022-04-28 06:00:49,360 INFO L134 CoverageAnalysis]: Checked inductivity of 452 backedges. 32 proven. 416 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 06:00:49,360 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 06:00:50,093 INFO L290 TraceCheckUtils]: 128: Hoare triple {94015#false} assume !false; {94015#false} is VALID [2022-04-28 06:00:50,093 INFO L290 TraceCheckUtils]: 127: Hoare triple {94015#false} assume 0 == ~cond; {94015#false} is VALID [2022-04-28 06:00:50,093 INFO L290 TraceCheckUtils]: 126: Hoare triple {94015#false} ~cond := #in~cond; {94015#false} is VALID [2022-04-28 06:00:50,093 INFO L272 TraceCheckUtils]: 125: Hoare triple {94015#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {94015#false} is VALID [2022-04-28 06:00:50,093 INFO L290 TraceCheckUtils]: 124: Hoare triple {94015#false} assume !(#t~post6 < 20);havoc #t~post6; {94015#false} is VALID [2022-04-28 06:00:50,094 INFO L290 TraceCheckUtils]: 123: Hoare triple {94015#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {94015#false} is VALID [2022-04-28 06:00:50,094 INFO L290 TraceCheckUtils]: 122: Hoare triple {94436#(< |main_#t~post8| 20)} assume !(#t~post8 < 20);havoc #t~post8; {94015#false} is VALID [2022-04-28 06:00:50,094 INFO L290 TraceCheckUtils]: 121: Hoare triple {94440#(< ~counter~0 20)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {94436#(< |main_#t~post8| 20)} is VALID [2022-04-28 06:00:50,095 INFO L290 TraceCheckUtils]: 120: Hoare triple {94440#(< ~counter~0 20)} assume !(~r~0 > 0); {94440#(< ~counter~0 20)} is VALID [2022-04-28 06:00:50,095 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {94014#true} {94440#(< ~counter~0 20)} #96#return; {94440#(< ~counter~0 20)} is VALID [2022-04-28 06:00:50,095 INFO L290 TraceCheckUtils]: 118: Hoare triple {94014#true} assume true; {94014#true} is VALID [2022-04-28 06:00:50,095 INFO L290 TraceCheckUtils]: 117: Hoare triple {94014#true} assume !(0 == ~cond); {94014#true} is VALID [2022-04-28 06:00:50,095 INFO L290 TraceCheckUtils]: 116: Hoare triple {94014#true} ~cond := #in~cond; {94014#true} is VALID [2022-04-28 06:00:50,096 INFO L272 TraceCheckUtils]: 115: Hoare triple {94440#(< ~counter~0 20)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {94014#true} is VALID [2022-04-28 06:00:50,096 INFO L290 TraceCheckUtils]: 114: Hoare triple {94440#(< ~counter~0 20)} assume !!(#t~post7 < 20);havoc #t~post7; {94440#(< ~counter~0 20)} is VALID [2022-04-28 06:00:50,098 INFO L290 TraceCheckUtils]: 113: Hoare triple {94465#(< ~counter~0 19)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {94440#(< ~counter~0 20)} is VALID [2022-04-28 06:00:50,099 INFO L290 TraceCheckUtils]: 112: Hoare triple {94465#(< ~counter~0 19)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {94465#(< ~counter~0 19)} is VALID [2022-04-28 06:00:50,100 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {94014#true} {94465#(< ~counter~0 19)} #96#return; {94465#(< ~counter~0 19)} is VALID [2022-04-28 06:00:50,100 INFO L290 TraceCheckUtils]: 110: Hoare triple {94014#true} assume true; {94014#true} is VALID [2022-04-28 06:00:50,100 INFO L290 TraceCheckUtils]: 109: Hoare triple {94014#true} assume !(0 == ~cond); {94014#true} is VALID [2022-04-28 06:00:50,100 INFO L290 TraceCheckUtils]: 108: Hoare triple {94014#true} ~cond := #in~cond; {94014#true} is VALID [2022-04-28 06:00:50,100 INFO L272 TraceCheckUtils]: 107: Hoare triple {94465#(< ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {94014#true} is VALID [2022-04-28 06:00:50,101 INFO L290 TraceCheckUtils]: 106: Hoare triple {94465#(< ~counter~0 19)} assume !!(#t~post7 < 20);havoc #t~post7; {94465#(< ~counter~0 19)} is VALID [2022-04-28 06:00:50,102 INFO L290 TraceCheckUtils]: 105: Hoare triple {94490#(< ~counter~0 18)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {94465#(< ~counter~0 19)} is VALID [2022-04-28 06:00:50,102 INFO L290 TraceCheckUtils]: 104: Hoare triple {94490#(< ~counter~0 18)} assume !!(0 != ~r~0); {94490#(< ~counter~0 18)} is VALID [2022-04-28 06:00:50,103 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {94014#true} {94490#(< ~counter~0 18)} #94#return; {94490#(< ~counter~0 18)} is VALID [2022-04-28 06:00:50,103 INFO L290 TraceCheckUtils]: 102: Hoare triple {94014#true} assume true; {94014#true} is VALID [2022-04-28 06:00:50,103 INFO L290 TraceCheckUtils]: 101: Hoare triple {94014#true} assume !(0 == ~cond); {94014#true} is VALID [2022-04-28 06:00:50,103 INFO L290 TraceCheckUtils]: 100: Hoare triple {94014#true} ~cond := #in~cond; {94014#true} is VALID [2022-04-28 06:00:50,103 INFO L272 TraceCheckUtils]: 99: Hoare triple {94490#(< ~counter~0 18)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {94014#true} is VALID [2022-04-28 06:00:50,131 INFO L290 TraceCheckUtils]: 98: Hoare triple {94490#(< ~counter~0 18)} assume !!(#t~post6 < 20);havoc #t~post6; {94490#(< ~counter~0 18)} is VALID [2022-04-28 06:00:50,151 INFO L290 TraceCheckUtils]: 97: Hoare triple {94515#(< ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {94490#(< ~counter~0 18)} is VALID [2022-04-28 06:00:50,167 INFO L290 TraceCheckUtils]: 96: Hoare triple {94515#(< ~counter~0 17)} assume !(~r~0 < 0); {94515#(< ~counter~0 17)} is VALID [2022-04-28 06:00:50,173 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {94014#true} {94515#(< ~counter~0 17)} #98#return; {94515#(< ~counter~0 17)} is VALID [2022-04-28 06:00:50,173 INFO L290 TraceCheckUtils]: 94: Hoare triple {94014#true} assume true; {94014#true} is VALID [2022-04-28 06:00:50,173 INFO L290 TraceCheckUtils]: 93: Hoare triple {94014#true} assume !(0 == ~cond); {94014#true} is VALID [2022-04-28 06:00:50,174 INFO L290 TraceCheckUtils]: 92: Hoare triple {94014#true} ~cond := #in~cond; {94014#true} is VALID [2022-04-28 06:00:50,174 INFO L272 TraceCheckUtils]: 91: Hoare triple {94515#(< ~counter~0 17)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {94014#true} is VALID [2022-04-28 06:00:50,187 INFO L290 TraceCheckUtils]: 90: Hoare triple {94515#(< ~counter~0 17)} assume !!(#t~post8 < 20);havoc #t~post8; {94515#(< ~counter~0 17)} is VALID [2022-04-28 06:00:50,190 INFO L290 TraceCheckUtils]: 89: Hoare triple {94540#(< ~counter~0 16)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {94515#(< ~counter~0 17)} is VALID [2022-04-28 06:00:50,190 INFO L290 TraceCheckUtils]: 88: Hoare triple {94540#(< ~counter~0 16)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {94540#(< ~counter~0 16)} is VALID [2022-04-28 06:00:50,191 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {94014#true} {94540#(< ~counter~0 16)} #98#return; {94540#(< ~counter~0 16)} is VALID [2022-04-28 06:00:50,191 INFO L290 TraceCheckUtils]: 86: Hoare triple {94014#true} assume true; {94014#true} is VALID [2022-04-28 06:00:50,191 INFO L290 TraceCheckUtils]: 85: Hoare triple {94014#true} assume !(0 == ~cond); {94014#true} is VALID [2022-04-28 06:00:50,191 INFO L290 TraceCheckUtils]: 84: Hoare triple {94014#true} ~cond := #in~cond; {94014#true} is VALID [2022-04-28 06:00:50,191 INFO L272 TraceCheckUtils]: 83: Hoare triple {94540#(< ~counter~0 16)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {94014#true} is VALID [2022-04-28 06:00:50,191 INFO L290 TraceCheckUtils]: 82: Hoare triple {94540#(< ~counter~0 16)} assume !!(#t~post8 < 20);havoc #t~post8; {94540#(< ~counter~0 16)} is VALID [2022-04-28 06:00:50,192 INFO L290 TraceCheckUtils]: 81: Hoare triple {94565#(< ~counter~0 15)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {94540#(< ~counter~0 16)} is VALID [2022-04-28 06:00:50,193 INFO L290 TraceCheckUtils]: 80: Hoare triple {94565#(< ~counter~0 15)} assume !(~r~0 > 0); {94565#(< ~counter~0 15)} is VALID [2022-04-28 06:00:50,193 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {94014#true} {94565#(< ~counter~0 15)} #96#return; {94565#(< ~counter~0 15)} is VALID [2022-04-28 06:00:50,193 INFO L290 TraceCheckUtils]: 78: Hoare triple {94014#true} assume true; {94014#true} is VALID [2022-04-28 06:00:50,193 INFO L290 TraceCheckUtils]: 77: Hoare triple {94014#true} assume !(0 == ~cond); {94014#true} is VALID [2022-04-28 06:00:50,194 INFO L290 TraceCheckUtils]: 76: Hoare triple {94014#true} ~cond := #in~cond; {94014#true} is VALID [2022-04-28 06:00:50,194 INFO L272 TraceCheckUtils]: 75: Hoare triple {94565#(< ~counter~0 15)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {94014#true} is VALID [2022-04-28 06:00:50,194 INFO L290 TraceCheckUtils]: 74: Hoare triple {94565#(< ~counter~0 15)} assume !!(#t~post7 < 20);havoc #t~post7; {94565#(< ~counter~0 15)} is VALID [2022-04-28 06:00:50,195 INFO L290 TraceCheckUtils]: 73: Hoare triple {94371#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {94565#(< ~counter~0 15)} is VALID [2022-04-28 06:00:50,195 INFO L290 TraceCheckUtils]: 72: Hoare triple {94371#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {94371#(<= ~counter~0 13)} is VALID [2022-04-28 06:00:50,196 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {94014#true} {94371#(<= ~counter~0 13)} #96#return; {94371#(<= ~counter~0 13)} is VALID [2022-04-28 06:00:50,196 INFO L290 TraceCheckUtils]: 70: Hoare triple {94014#true} assume true; {94014#true} is VALID [2022-04-28 06:00:50,196 INFO L290 TraceCheckUtils]: 69: Hoare triple {94014#true} assume !(0 == ~cond); {94014#true} is VALID [2022-04-28 06:00:50,196 INFO L290 TraceCheckUtils]: 68: Hoare triple {94014#true} ~cond := #in~cond; {94014#true} is VALID [2022-04-28 06:00:50,196 INFO L272 TraceCheckUtils]: 67: Hoare triple {94371#(<= ~counter~0 13)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {94014#true} is VALID [2022-04-28 06:00:50,196 INFO L290 TraceCheckUtils]: 66: Hoare triple {94371#(<= ~counter~0 13)} assume !!(#t~post7 < 20);havoc #t~post7; {94371#(<= ~counter~0 13)} is VALID [2022-04-28 06:00:50,197 INFO L290 TraceCheckUtils]: 65: Hoare triple {94346#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {94371#(<= ~counter~0 13)} is VALID [2022-04-28 06:00:50,198 INFO L290 TraceCheckUtils]: 64: Hoare triple {94346#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {94346#(<= ~counter~0 12)} is VALID [2022-04-28 06:00:50,198 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {94014#true} {94346#(<= ~counter~0 12)} #96#return; {94346#(<= ~counter~0 12)} is VALID [2022-04-28 06:00:50,198 INFO L290 TraceCheckUtils]: 62: Hoare triple {94014#true} assume true; {94014#true} is VALID [2022-04-28 06:00:50,198 INFO L290 TraceCheckUtils]: 61: Hoare triple {94014#true} assume !(0 == ~cond); {94014#true} is VALID [2022-04-28 06:00:50,198 INFO L290 TraceCheckUtils]: 60: Hoare triple {94014#true} ~cond := #in~cond; {94014#true} is VALID [2022-04-28 06:00:50,199 INFO L272 TraceCheckUtils]: 59: Hoare triple {94346#(<= ~counter~0 12)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {94014#true} is VALID [2022-04-28 06:00:50,199 INFO L290 TraceCheckUtils]: 58: Hoare triple {94346#(<= ~counter~0 12)} assume !!(#t~post7 < 20);havoc #t~post7; {94346#(<= ~counter~0 12)} is VALID [2022-04-28 06:00:50,200 INFO L290 TraceCheckUtils]: 57: Hoare triple {94321#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {94346#(<= ~counter~0 12)} is VALID [2022-04-28 06:00:50,200 INFO L290 TraceCheckUtils]: 56: Hoare triple {94321#(<= ~counter~0 11)} assume !!(0 != ~r~0); {94321#(<= ~counter~0 11)} is VALID [2022-04-28 06:00:50,201 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {94014#true} {94321#(<= ~counter~0 11)} #94#return; {94321#(<= ~counter~0 11)} is VALID [2022-04-28 06:00:50,201 INFO L290 TraceCheckUtils]: 54: Hoare triple {94014#true} assume true; {94014#true} is VALID [2022-04-28 06:00:50,201 INFO L290 TraceCheckUtils]: 53: Hoare triple {94014#true} assume !(0 == ~cond); {94014#true} is VALID [2022-04-28 06:00:50,201 INFO L290 TraceCheckUtils]: 52: Hoare triple {94014#true} ~cond := #in~cond; {94014#true} is VALID [2022-04-28 06:00:50,201 INFO L272 TraceCheckUtils]: 51: Hoare triple {94321#(<= ~counter~0 11)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {94014#true} is VALID [2022-04-28 06:00:50,201 INFO L290 TraceCheckUtils]: 50: Hoare triple {94321#(<= ~counter~0 11)} assume !!(#t~post6 < 20);havoc #t~post6; {94321#(<= ~counter~0 11)} is VALID [2022-04-28 06:00:50,202 INFO L290 TraceCheckUtils]: 49: Hoare triple {94296#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {94321#(<= ~counter~0 11)} is VALID [2022-04-28 06:00:50,203 INFO L290 TraceCheckUtils]: 48: Hoare triple {94296#(<= ~counter~0 10)} assume !(~r~0 < 0); {94296#(<= ~counter~0 10)} is VALID [2022-04-28 06:00:50,203 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {94014#true} {94296#(<= ~counter~0 10)} #98#return; {94296#(<= ~counter~0 10)} is VALID [2022-04-28 06:00:50,203 INFO L290 TraceCheckUtils]: 46: Hoare triple {94014#true} assume true; {94014#true} is VALID [2022-04-28 06:00:50,203 INFO L290 TraceCheckUtils]: 45: Hoare triple {94014#true} assume !(0 == ~cond); {94014#true} is VALID [2022-04-28 06:00:50,203 INFO L290 TraceCheckUtils]: 44: Hoare triple {94014#true} ~cond := #in~cond; {94014#true} is VALID [2022-04-28 06:00:50,203 INFO L272 TraceCheckUtils]: 43: Hoare triple {94296#(<= ~counter~0 10)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {94014#true} is VALID [2022-04-28 06:00:50,204 INFO L290 TraceCheckUtils]: 42: Hoare triple {94296#(<= ~counter~0 10)} assume !!(#t~post8 < 20);havoc #t~post8; {94296#(<= ~counter~0 10)} is VALID [2022-04-28 06:00:50,205 INFO L290 TraceCheckUtils]: 41: Hoare triple {94271#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {94296#(<= ~counter~0 10)} is VALID [2022-04-28 06:00:50,205 INFO L290 TraceCheckUtils]: 40: Hoare triple {94271#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {94271#(<= ~counter~0 9)} is VALID [2022-04-28 06:00:50,206 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {94014#true} {94271#(<= ~counter~0 9)} #98#return; {94271#(<= ~counter~0 9)} is VALID [2022-04-28 06:00:50,206 INFO L290 TraceCheckUtils]: 38: Hoare triple {94014#true} assume true; {94014#true} is VALID [2022-04-28 06:00:50,206 INFO L290 TraceCheckUtils]: 37: Hoare triple {94014#true} assume !(0 == ~cond); {94014#true} is VALID [2022-04-28 06:00:50,206 INFO L290 TraceCheckUtils]: 36: Hoare triple {94014#true} ~cond := #in~cond; {94014#true} is VALID [2022-04-28 06:00:50,206 INFO L272 TraceCheckUtils]: 35: Hoare triple {94271#(<= ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {94014#true} is VALID [2022-04-28 06:00:50,206 INFO L290 TraceCheckUtils]: 34: Hoare triple {94271#(<= ~counter~0 9)} assume !!(#t~post8 < 20);havoc #t~post8; {94271#(<= ~counter~0 9)} is VALID [2022-04-28 06:00:50,207 INFO L290 TraceCheckUtils]: 33: Hoare triple {94246#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {94271#(<= ~counter~0 9)} is VALID [2022-04-28 06:00:50,207 INFO L290 TraceCheckUtils]: 32: Hoare triple {94246#(<= ~counter~0 8)} assume !(~r~0 > 0); {94246#(<= ~counter~0 8)} is VALID [2022-04-28 06:00:50,208 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {94014#true} {94246#(<= ~counter~0 8)} #96#return; {94246#(<= ~counter~0 8)} is VALID [2022-04-28 06:00:50,208 INFO L290 TraceCheckUtils]: 30: Hoare triple {94014#true} assume true; {94014#true} is VALID [2022-04-28 06:00:50,208 INFO L290 TraceCheckUtils]: 29: Hoare triple {94014#true} assume !(0 == ~cond); {94014#true} is VALID [2022-04-28 06:00:50,208 INFO L290 TraceCheckUtils]: 28: Hoare triple {94014#true} ~cond := #in~cond; {94014#true} is VALID [2022-04-28 06:00:50,208 INFO L272 TraceCheckUtils]: 27: Hoare triple {94246#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {94014#true} is VALID [2022-04-28 06:00:50,209 INFO L290 TraceCheckUtils]: 26: Hoare triple {94246#(<= ~counter~0 8)} assume !!(#t~post7 < 20);havoc #t~post7; {94246#(<= ~counter~0 8)} is VALID [2022-04-28 06:00:50,210 INFO L290 TraceCheckUtils]: 25: Hoare triple {94221#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {94246#(<= ~counter~0 8)} is VALID [2022-04-28 06:00:50,210 INFO L290 TraceCheckUtils]: 24: Hoare triple {94221#(<= ~counter~0 7)} assume !!(0 != ~r~0); {94221#(<= ~counter~0 7)} is VALID [2022-04-28 06:00:50,210 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {94014#true} {94221#(<= ~counter~0 7)} #94#return; {94221#(<= ~counter~0 7)} is VALID [2022-04-28 06:00:50,211 INFO L290 TraceCheckUtils]: 22: Hoare triple {94014#true} assume true; {94014#true} is VALID [2022-04-28 06:00:50,211 INFO L290 TraceCheckUtils]: 21: Hoare triple {94014#true} assume !(0 == ~cond); {94014#true} is VALID [2022-04-28 06:00:50,211 INFO L290 TraceCheckUtils]: 20: Hoare triple {94014#true} ~cond := #in~cond; {94014#true} is VALID [2022-04-28 06:00:50,211 INFO L272 TraceCheckUtils]: 19: Hoare triple {94221#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {94014#true} is VALID [2022-04-28 06:00:50,211 INFO L290 TraceCheckUtils]: 18: Hoare triple {94221#(<= ~counter~0 7)} assume !!(#t~post6 < 20);havoc #t~post6; {94221#(<= ~counter~0 7)} is VALID [2022-04-28 06:00:50,212 INFO L290 TraceCheckUtils]: 17: Hoare triple {94196#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {94221#(<= ~counter~0 7)} is VALID [2022-04-28 06:00:50,212 INFO L290 TraceCheckUtils]: 16: Hoare triple {94196#(<= ~counter~0 6)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {94196#(<= ~counter~0 6)} is VALID [2022-04-28 06:00:50,213 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {94014#true} {94196#(<= ~counter~0 6)} #92#return; {94196#(<= ~counter~0 6)} is VALID [2022-04-28 06:00:50,213 INFO L290 TraceCheckUtils]: 14: Hoare triple {94014#true} assume true; {94014#true} is VALID [2022-04-28 06:00:50,213 INFO L290 TraceCheckUtils]: 13: Hoare triple {94014#true} assume !(0 == ~cond); {94014#true} is VALID [2022-04-28 06:00:50,213 INFO L290 TraceCheckUtils]: 12: Hoare triple {94014#true} ~cond := #in~cond; {94014#true} is VALID [2022-04-28 06:00:50,213 INFO L272 TraceCheckUtils]: 11: Hoare triple {94196#(<= ~counter~0 6)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {94014#true} is VALID [2022-04-28 06:00:50,214 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {94014#true} {94196#(<= ~counter~0 6)} #90#return; {94196#(<= ~counter~0 6)} is VALID [2022-04-28 06:00:50,214 INFO L290 TraceCheckUtils]: 9: Hoare triple {94014#true} assume true; {94014#true} is VALID [2022-04-28 06:00:50,214 INFO L290 TraceCheckUtils]: 8: Hoare triple {94014#true} assume !(0 == ~cond); {94014#true} is VALID [2022-04-28 06:00:50,214 INFO L290 TraceCheckUtils]: 7: Hoare triple {94014#true} ~cond := #in~cond; {94014#true} is VALID [2022-04-28 06:00:50,214 INFO L272 TraceCheckUtils]: 6: Hoare triple {94196#(<= ~counter~0 6)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {94014#true} is VALID [2022-04-28 06:00:50,214 INFO L290 TraceCheckUtils]: 5: Hoare triple {94196#(<= ~counter~0 6)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {94196#(<= ~counter~0 6)} is VALID [2022-04-28 06:00:50,215 INFO L272 TraceCheckUtils]: 4: Hoare triple {94196#(<= ~counter~0 6)} call #t~ret9 := main(); {94196#(<= ~counter~0 6)} is VALID [2022-04-28 06:00:50,215 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {94196#(<= ~counter~0 6)} {94014#true} #102#return; {94196#(<= ~counter~0 6)} is VALID [2022-04-28 06:00:50,215 INFO L290 TraceCheckUtils]: 2: Hoare triple {94196#(<= ~counter~0 6)} assume true; {94196#(<= ~counter~0 6)} is VALID [2022-04-28 06:00:50,216 INFO L290 TraceCheckUtils]: 1: Hoare triple {94014#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {94196#(<= ~counter~0 6)} is VALID [2022-04-28 06:00:50,216 INFO L272 TraceCheckUtils]: 0: Hoare triple {94014#true} call ULTIMATE.init(); {94014#true} is VALID [2022-04-28 06:00:50,216 INFO L134 CoverageAnalysis]: Checked inductivity of 452 backedges. 32 proven. 104 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2022-04-28 06:00:50,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:00:50,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055971504] [2022-04-28 06:00:50,217 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:00:50,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [990119166] [2022-04-28 06:00:50,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [990119166] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 06:00:50,217 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 06:00:50,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 24 [2022-04-28 06:00:50,217 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:00:50,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1888059345] [2022-04-28 06:00:50,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1888059345] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:00:50,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:00:50,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 06:00:50,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610195756] [2022-04-28 06:00:50,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:00:50,218 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.411764705882353) internal successors, (92), 16 states have internal predecessors, (92), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) Word has length 129 [2022-04-28 06:00:50,218 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:00:50,218 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 5.411764705882353) internal successors, (92), 16 states have internal predecessors, (92), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-28 06:00:50,455 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:00:50,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 06:00:50,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:00:50,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 06:00:50,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-28 06:00:50,456 INFO L87 Difference]: Start difference. First operand 672 states and 914 transitions. Second operand has 17 states, 17 states have (on average 5.411764705882353) internal successors, (92), 16 states have internal predecessors, (92), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-28 06:00:54,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:00:54,876 INFO L93 Difference]: Finished difference Result 893 states and 1247 transitions. [2022-04-28 06:00:54,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-28 06:00:54,877 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.411764705882353) internal successors, (92), 16 states have internal predecessors, (92), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) Word has length 129 [2022-04-28 06:00:54,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:00:54,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 5.411764705882353) internal successors, (92), 16 states have internal predecessors, (92), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-28 06:00:54,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 296 transitions. [2022-04-28 06:00:54,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 5.411764705882353) internal successors, (92), 16 states have internal predecessors, (92), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-28 06:00:54,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 296 transitions. [2022-04-28 06:00:54,894 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 296 transitions. [2022-04-28 06:00:55,212 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 296 edges. 296 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:00:55,255 INFO L225 Difference]: With dead ends: 893 [2022-04-28 06:00:55,256 INFO L226 Difference]: Without dead ends: 700 [2022-04-28 06:00:55,259 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 234 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=467, Invalid=723, Unknown=0, NotChecked=0, Total=1190 [2022-04-28 06:00:55,260 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 249 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 242 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 242 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 06:00:55,262 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 291 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [242 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 06:00:55,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2022-04-28 06:00:57,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 690. [2022-04-28 06:00:57,460 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:00:57,461 INFO L82 GeneralOperation]: Start isEquivalent. First operand 700 states. Second operand has 690 states, 520 states have (on average 1.2153846153846153) internal successors, (632), 524 states have internal predecessors, (632), 153 states have call successors, (153), 18 states have call predecessors, (153), 16 states have return successors, (151), 147 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-28 06:00:57,462 INFO L74 IsIncluded]: Start isIncluded. First operand 700 states. Second operand has 690 states, 520 states have (on average 1.2153846153846153) internal successors, (632), 524 states have internal predecessors, (632), 153 states have call successors, (153), 18 states have call predecessors, (153), 16 states have return successors, (151), 147 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-28 06:00:57,462 INFO L87 Difference]: Start difference. First operand 700 states. Second operand has 690 states, 520 states have (on average 1.2153846153846153) internal successors, (632), 524 states have internal predecessors, (632), 153 states have call successors, (153), 18 states have call predecessors, (153), 16 states have return successors, (151), 147 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-28 06:00:57,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:00:57,479 INFO L93 Difference]: Finished difference Result 700 states and 946 transitions. [2022-04-28 06:00:57,479 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 946 transitions. [2022-04-28 06:00:57,480 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:00:57,480 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:00:57,480 INFO L74 IsIncluded]: Start isIncluded. First operand has 690 states, 520 states have (on average 1.2153846153846153) internal successors, (632), 524 states have internal predecessors, (632), 153 states have call successors, (153), 18 states have call predecessors, (153), 16 states have return successors, (151), 147 states have call predecessors, (151), 151 states have call successors, (151) Second operand 700 states. [2022-04-28 06:00:57,481 INFO L87 Difference]: Start difference. First operand has 690 states, 520 states have (on average 1.2153846153846153) internal successors, (632), 524 states have internal predecessors, (632), 153 states have call successors, (153), 18 states have call predecessors, (153), 16 states have return successors, (151), 147 states have call predecessors, (151), 151 states have call successors, (151) Second operand 700 states. [2022-04-28 06:00:57,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:00:57,503 INFO L93 Difference]: Finished difference Result 700 states and 946 transitions. [2022-04-28 06:00:57,503 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 946 transitions. [2022-04-28 06:00:57,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:00:57,504 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:00:57,504 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:00:57,504 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:00:57,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 690 states, 520 states have (on average 1.2153846153846153) internal successors, (632), 524 states have internal predecessors, (632), 153 states have call successors, (153), 18 states have call predecessors, (153), 16 states have return successors, (151), 147 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-28 06:00:57,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 936 transitions. [2022-04-28 06:00:57,526 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 936 transitions. Word has length 129 [2022-04-28 06:00:57,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:00:57,527 INFO L495 AbstractCegarLoop]: Abstraction has 690 states and 936 transitions. [2022-04-28 06:00:57,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.411764705882353) internal successors, (92), 16 states have internal predecessors, (92), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-28 06:00:57,527 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 690 states and 936 transitions. [2022-04-28 06:01:02,579 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 936 edges. 935 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 06:01:02,580 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 936 transitions. [2022-04-28 06:01:02,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-04-28 06:01:02,581 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:01:02,581 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 7, 6, 6, 6, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:01:02,598 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2022-04-28 06:01:02,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2022-04-28 06:01:02,781 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:01:02,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:01:02,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1255136270, now seen corresponding path program 17 times [2022-04-28 06:01:02,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:01:02,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [731806537] [2022-04-28 06:01:02,782 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 06:01:02,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1255136270, now seen corresponding path program 18 times [2022-04-28 06:01:02,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:01:02,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530232161] [2022-04-28 06:01:02,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:01:02,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:01:02,794 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:01:02,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [900259316] [2022-04-28 06:01:02,795 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 06:01:02,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:01:02,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:01:02,796 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:01:02,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2022-04-28 06:01:02,980 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-04-28 06:01:02,981 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:01:02,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-28 06:01:03,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:01:03,022 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:01:03,653 INFO L272 TraceCheckUtils]: 0: Hoare triple {99399#true} call ULTIMATE.init(); {99399#true} is VALID [2022-04-28 06:01:03,654 INFO L290 TraceCheckUtils]: 1: Hoare triple {99399#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {99407#(<= ~counter~0 0)} is VALID [2022-04-28 06:01:03,655 INFO L290 TraceCheckUtils]: 2: Hoare triple {99407#(<= ~counter~0 0)} assume true; {99407#(<= ~counter~0 0)} is VALID [2022-04-28 06:01:03,655 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {99407#(<= ~counter~0 0)} {99399#true} #102#return; {99407#(<= ~counter~0 0)} is VALID [2022-04-28 06:01:03,655 INFO L272 TraceCheckUtils]: 4: Hoare triple {99407#(<= ~counter~0 0)} call #t~ret9 := main(); {99407#(<= ~counter~0 0)} is VALID [2022-04-28 06:01:03,656 INFO L290 TraceCheckUtils]: 5: Hoare triple {99407#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {99407#(<= ~counter~0 0)} is VALID [2022-04-28 06:01:03,656 INFO L272 TraceCheckUtils]: 6: Hoare triple {99407#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {99407#(<= ~counter~0 0)} is VALID [2022-04-28 06:01:03,657 INFO L290 TraceCheckUtils]: 7: Hoare triple {99407#(<= ~counter~0 0)} ~cond := #in~cond; {99407#(<= ~counter~0 0)} is VALID [2022-04-28 06:01:03,657 INFO L290 TraceCheckUtils]: 8: Hoare triple {99407#(<= ~counter~0 0)} assume !(0 == ~cond); {99407#(<= ~counter~0 0)} is VALID [2022-04-28 06:01:03,657 INFO L290 TraceCheckUtils]: 9: Hoare triple {99407#(<= ~counter~0 0)} assume true; {99407#(<= ~counter~0 0)} is VALID [2022-04-28 06:01:03,658 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {99407#(<= ~counter~0 0)} {99407#(<= ~counter~0 0)} #90#return; {99407#(<= ~counter~0 0)} is VALID [2022-04-28 06:01:03,658 INFO L272 TraceCheckUtils]: 11: Hoare triple {99407#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {99407#(<= ~counter~0 0)} is VALID [2022-04-28 06:01:03,659 INFO L290 TraceCheckUtils]: 12: Hoare triple {99407#(<= ~counter~0 0)} ~cond := #in~cond; {99407#(<= ~counter~0 0)} is VALID [2022-04-28 06:01:03,659 INFO L290 TraceCheckUtils]: 13: Hoare triple {99407#(<= ~counter~0 0)} assume !(0 == ~cond); {99407#(<= ~counter~0 0)} is VALID [2022-04-28 06:01:03,659 INFO L290 TraceCheckUtils]: 14: Hoare triple {99407#(<= ~counter~0 0)} assume true; {99407#(<= ~counter~0 0)} is VALID [2022-04-28 06:01:03,660 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {99407#(<= ~counter~0 0)} {99407#(<= ~counter~0 0)} #92#return; {99407#(<= ~counter~0 0)} is VALID [2022-04-28 06:01:03,660 INFO L290 TraceCheckUtils]: 16: Hoare triple {99407#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {99407#(<= ~counter~0 0)} is VALID [2022-04-28 06:01:03,662 INFO L290 TraceCheckUtils]: 17: Hoare triple {99407#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {99456#(<= ~counter~0 1)} is VALID [2022-04-28 06:01:03,663 INFO L290 TraceCheckUtils]: 18: Hoare triple {99456#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {99456#(<= ~counter~0 1)} is VALID [2022-04-28 06:01:03,664 INFO L272 TraceCheckUtils]: 19: Hoare triple {99456#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {99456#(<= ~counter~0 1)} is VALID [2022-04-28 06:01:03,664 INFO L290 TraceCheckUtils]: 20: Hoare triple {99456#(<= ~counter~0 1)} ~cond := #in~cond; {99456#(<= ~counter~0 1)} is VALID [2022-04-28 06:01:03,664 INFO L290 TraceCheckUtils]: 21: Hoare triple {99456#(<= ~counter~0 1)} assume !(0 == ~cond); {99456#(<= ~counter~0 1)} is VALID [2022-04-28 06:01:03,665 INFO L290 TraceCheckUtils]: 22: Hoare triple {99456#(<= ~counter~0 1)} assume true; {99456#(<= ~counter~0 1)} is VALID [2022-04-28 06:01:03,665 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {99456#(<= ~counter~0 1)} {99456#(<= ~counter~0 1)} #94#return; {99456#(<= ~counter~0 1)} is VALID [2022-04-28 06:01:03,665 INFO L290 TraceCheckUtils]: 24: Hoare triple {99456#(<= ~counter~0 1)} assume !!(0 != ~r~0); {99456#(<= ~counter~0 1)} is VALID [2022-04-28 06:01:03,668 INFO L290 TraceCheckUtils]: 25: Hoare triple {99456#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {99481#(<= ~counter~0 2)} is VALID [2022-04-28 06:01:03,668 INFO L290 TraceCheckUtils]: 26: Hoare triple {99481#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {99481#(<= ~counter~0 2)} is VALID [2022-04-28 06:01:03,669 INFO L272 TraceCheckUtils]: 27: Hoare triple {99481#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {99481#(<= ~counter~0 2)} is VALID [2022-04-28 06:01:03,669 INFO L290 TraceCheckUtils]: 28: Hoare triple {99481#(<= ~counter~0 2)} ~cond := #in~cond; {99481#(<= ~counter~0 2)} is VALID [2022-04-28 06:01:03,669 INFO L290 TraceCheckUtils]: 29: Hoare triple {99481#(<= ~counter~0 2)} assume !(0 == ~cond); {99481#(<= ~counter~0 2)} is VALID [2022-04-28 06:01:03,670 INFO L290 TraceCheckUtils]: 30: Hoare triple {99481#(<= ~counter~0 2)} assume true; {99481#(<= ~counter~0 2)} is VALID [2022-04-28 06:01:03,670 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {99481#(<= ~counter~0 2)} {99481#(<= ~counter~0 2)} #96#return; {99481#(<= ~counter~0 2)} is VALID [2022-04-28 06:01:03,671 INFO L290 TraceCheckUtils]: 32: Hoare triple {99481#(<= ~counter~0 2)} assume !(~r~0 > 0); {99481#(<= ~counter~0 2)} is VALID [2022-04-28 06:01:03,673 INFO L290 TraceCheckUtils]: 33: Hoare triple {99481#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {99506#(<= ~counter~0 3)} is VALID [2022-04-28 06:01:03,673 INFO L290 TraceCheckUtils]: 34: Hoare triple {99506#(<= ~counter~0 3)} assume !!(#t~post8 < 20);havoc #t~post8; {99506#(<= ~counter~0 3)} is VALID [2022-04-28 06:01:03,674 INFO L272 TraceCheckUtils]: 35: Hoare triple {99506#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {99506#(<= ~counter~0 3)} is VALID [2022-04-28 06:01:03,674 INFO L290 TraceCheckUtils]: 36: Hoare triple {99506#(<= ~counter~0 3)} ~cond := #in~cond; {99506#(<= ~counter~0 3)} is VALID [2022-04-28 06:01:03,674 INFO L290 TraceCheckUtils]: 37: Hoare triple {99506#(<= ~counter~0 3)} assume !(0 == ~cond); {99506#(<= ~counter~0 3)} is VALID [2022-04-28 06:01:03,675 INFO L290 TraceCheckUtils]: 38: Hoare triple {99506#(<= ~counter~0 3)} assume true; {99506#(<= ~counter~0 3)} is VALID [2022-04-28 06:01:03,675 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {99506#(<= ~counter~0 3)} {99506#(<= ~counter~0 3)} #98#return; {99506#(<= ~counter~0 3)} is VALID [2022-04-28 06:01:03,676 INFO L290 TraceCheckUtils]: 40: Hoare triple {99506#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {99506#(<= ~counter~0 3)} is VALID [2022-04-28 06:01:03,677 INFO L290 TraceCheckUtils]: 41: Hoare triple {99506#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {99531#(<= ~counter~0 4)} is VALID [2022-04-28 06:01:03,678 INFO L290 TraceCheckUtils]: 42: Hoare triple {99531#(<= ~counter~0 4)} assume !!(#t~post8 < 20);havoc #t~post8; {99531#(<= ~counter~0 4)} is VALID [2022-04-28 06:01:03,678 INFO L272 TraceCheckUtils]: 43: Hoare triple {99531#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {99531#(<= ~counter~0 4)} is VALID [2022-04-28 06:01:03,679 INFO L290 TraceCheckUtils]: 44: Hoare triple {99531#(<= ~counter~0 4)} ~cond := #in~cond; {99531#(<= ~counter~0 4)} is VALID [2022-04-28 06:01:03,679 INFO L290 TraceCheckUtils]: 45: Hoare triple {99531#(<= ~counter~0 4)} assume !(0 == ~cond); {99531#(<= ~counter~0 4)} is VALID [2022-04-28 06:01:03,679 INFO L290 TraceCheckUtils]: 46: Hoare triple {99531#(<= ~counter~0 4)} assume true; {99531#(<= ~counter~0 4)} is VALID [2022-04-28 06:01:03,680 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {99531#(<= ~counter~0 4)} {99531#(<= ~counter~0 4)} #98#return; {99531#(<= ~counter~0 4)} is VALID [2022-04-28 06:01:03,680 INFO L290 TraceCheckUtils]: 48: Hoare triple {99531#(<= ~counter~0 4)} assume !(~r~0 < 0); {99531#(<= ~counter~0 4)} is VALID [2022-04-28 06:01:03,682 INFO L290 TraceCheckUtils]: 49: Hoare triple {99531#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {99556#(<= ~counter~0 5)} is VALID [2022-04-28 06:01:03,683 INFO L290 TraceCheckUtils]: 50: Hoare triple {99556#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {99556#(<= ~counter~0 5)} is VALID [2022-04-28 06:01:03,683 INFO L272 TraceCheckUtils]: 51: Hoare triple {99556#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {99556#(<= ~counter~0 5)} is VALID [2022-04-28 06:01:03,684 INFO L290 TraceCheckUtils]: 52: Hoare triple {99556#(<= ~counter~0 5)} ~cond := #in~cond; {99556#(<= ~counter~0 5)} is VALID [2022-04-28 06:01:03,684 INFO L290 TraceCheckUtils]: 53: Hoare triple {99556#(<= ~counter~0 5)} assume !(0 == ~cond); {99556#(<= ~counter~0 5)} is VALID [2022-04-28 06:01:03,684 INFO L290 TraceCheckUtils]: 54: Hoare triple {99556#(<= ~counter~0 5)} assume true; {99556#(<= ~counter~0 5)} is VALID [2022-04-28 06:01:03,685 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {99556#(<= ~counter~0 5)} {99556#(<= ~counter~0 5)} #94#return; {99556#(<= ~counter~0 5)} is VALID [2022-04-28 06:01:03,685 INFO L290 TraceCheckUtils]: 56: Hoare triple {99556#(<= ~counter~0 5)} assume !!(0 != ~r~0); {99556#(<= ~counter~0 5)} is VALID [2022-04-28 06:01:03,688 INFO L290 TraceCheckUtils]: 57: Hoare triple {99556#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {99581#(<= ~counter~0 6)} is VALID [2022-04-28 06:01:03,688 INFO L290 TraceCheckUtils]: 58: Hoare triple {99581#(<= ~counter~0 6)} assume !!(#t~post7 < 20);havoc #t~post7; {99581#(<= ~counter~0 6)} is VALID [2022-04-28 06:01:03,689 INFO L272 TraceCheckUtils]: 59: Hoare triple {99581#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {99581#(<= ~counter~0 6)} is VALID [2022-04-28 06:01:03,689 INFO L290 TraceCheckUtils]: 60: Hoare triple {99581#(<= ~counter~0 6)} ~cond := #in~cond; {99581#(<= ~counter~0 6)} is VALID [2022-04-28 06:01:03,690 INFO L290 TraceCheckUtils]: 61: Hoare triple {99581#(<= ~counter~0 6)} assume !(0 == ~cond); {99581#(<= ~counter~0 6)} is VALID [2022-04-28 06:01:03,690 INFO L290 TraceCheckUtils]: 62: Hoare triple {99581#(<= ~counter~0 6)} assume true; {99581#(<= ~counter~0 6)} is VALID [2022-04-28 06:01:03,690 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {99581#(<= ~counter~0 6)} {99581#(<= ~counter~0 6)} #96#return; {99581#(<= ~counter~0 6)} is VALID [2022-04-28 06:01:03,691 INFO L290 TraceCheckUtils]: 64: Hoare triple {99581#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {99581#(<= ~counter~0 6)} is VALID [2022-04-28 06:01:03,693 INFO L290 TraceCheckUtils]: 65: Hoare triple {99581#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {99606#(<= ~counter~0 7)} is VALID [2022-04-28 06:01:03,693 INFO L290 TraceCheckUtils]: 66: Hoare triple {99606#(<= ~counter~0 7)} assume !!(#t~post7 < 20);havoc #t~post7; {99606#(<= ~counter~0 7)} is VALID [2022-04-28 06:01:03,694 INFO L272 TraceCheckUtils]: 67: Hoare triple {99606#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {99606#(<= ~counter~0 7)} is VALID [2022-04-28 06:01:03,694 INFO L290 TraceCheckUtils]: 68: Hoare triple {99606#(<= ~counter~0 7)} ~cond := #in~cond; {99606#(<= ~counter~0 7)} is VALID [2022-04-28 06:01:03,695 INFO L290 TraceCheckUtils]: 69: Hoare triple {99606#(<= ~counter~0 7)} assume !(0 == ~cond); {99606#(<= ~counter~0 7)} is VALID [2022-04-28 06:01:03,695 INFO L290 TraceCheckUtils]: 70: Hoare triple {99606#(<= ~counter~0 7)} assume true; {99606#(<= ~counter~0 7)} is VALID [2022-04-28 06:01:03,696 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {99606#(<= ~counter~0 7)} {99606#(<= ~counter~0 7)} #96#return; {99606#(<= ~counter~0 7)} is VALID [2022-04-28 06:01:03,696 INFO L290 TraceCheckUtils]: 72: Hoare triple {99606#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {99606#(<= ~counter~0 7)} is VALID [2022-04-28 06:01:03,698 INFO L290 TraceCheckUtils]: 73: Hoare triple {99606#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {99631#(<= ~counter~0 8)} is VALID [2022-04-28 06:01:03,698 INFO L290 TraceCheckUtils]: 74: Hoare triple {99631#(<= ~counter~0 8)} assume !!(#t~post7 < 20);havoc #t~post7; {99631#(<= ~counter~0 8)} is VALID [2022-04-28 06:01:03,699 INFO L272 TraceCheckUtils]: 75: Hoare triple {99631#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {99631#(<= ~counter~0 8)} is VALID [2022-04-28 06:01:03,699 INFO L290 TraceCheckUtils]: 76: Hoare triple {99631#(<= ~counter~0 8)} ~cond := #in~cond; {99631#(<= ~counter~0 8)} is VALID [2022-04-28 06:01:03,700 INFO L290 TraceCheckUtils]: 77: Hoare triple {99631#(<= ~counter~0 8)} assume !(0 == ~cond); {99631#(<= ~counter~0 8)} is VALID [2022-04-28 06:01:03,700 INFO L290 TraceCheckUtils]: 78: Hoare triple {99631#(<= ~counter~0 8)} assume true; {99631#(<= ~counter~0 8)} is VALID [2022-04-28 06:01:03,701 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {99631#(<= ~counter~0 8)} {99631#(<= ~counter~0 8)} #96#return; {99631#(<= ~counter~0 8)} is VALID [2022-04-28 06:01:03,701 INFO L290 TraceCheckUtils]: 80: Hoare triple {99631#(<= ~counter~0 8)} assume !(~r~0 > 0); {99631#(<= ~counter~0 8)} is VALID [2022-04-28 06:01:03,703 INFO L290 TraceCheckUtils]: 81: Hoare triple {99631#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {99656#(<= ~counter~0 9)} is VALID [2022-04-28 06:01:03,703 INFO L290 TraceCheckUtils]: 82: Hoare triple {99656#(<= ~counter~0 9)} assume !!(#t~post8 < 20);havoc #t~post8; {99656#(<= ~counter~0 9)} is VALID [2022-04-28 06:01:03,704 INFO L272 TraceCheckUtils]: 83: Hoare triple {99656#(<= ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {99656#(<= ~counter~0 9)} is VALID [2022-04-28 06:01:03,704 INFO L290 TraceCheckUtils]: 84: Hoare triple {99656#(<= ~counter~0 9)} ~cond := #in~cond; {99656#(<= ~counter~0 9)} is VALID [2022-04-28 06:01:03,705 INFO L290 TraceCheckUtils]: 85: Hoare triple {99656#(<= ~counter~0 9)} assume !(0 == ~cond); {99656#(<= ~counter~0 9)} is VALID [2022-04-28 06:01:03,705 INFO L290 TraceCheckUtils]: 86: Hoare triple {99656#(<= ~counter~0 9)} assume true; {99656#(<= ~counter~0 9)} is VALID [2022-04-28 06:01:03,706 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {99656#(<= ~counter~0 9)} {99656#(<= ~counter~0 9)} #98#return; {99656#(<= ~counter~0 9)} is VALID [2022-04-28 06:01:03,706 INFO L290 TraceCheckUtils]: 88: Hoare triple {99656#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {99656#(<= ~counter~0 9)} is VALID [2022-04-28 06:01:03,708 INFO L290 TraceCheckUtils]: 89: Hoare triple {99656#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {99681#(<= ~counter~0 10)} is VALID [2022-04-28 06:01:03,708 INFO L290 TraceCheckUtils]: 90: Hoare triple {99681#(<= ~counter~0 10)} assume !!(#t~post8 < 20);havoc #t~post8; {99681#(<= ~counter~0 10)} is VALID [2022-04-28 06:01:03,709 INFO L272 TraceCheckUtils]: 91: Hoare triple {99681#(<= ~counter~0 10)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {99681#(<= ~counter~0 10)} is VALID [2022-04-28 06:01:03,709 INFO L290 TraceCheckUtils]: 92: Hoare triple {99681#(<= ~counter~0 10)} ~cond := #in~cond; {99681#(<= ~counter~0 10)} is VALID [2022-04-28 06:01:03,710 INFO L290 TraceCheckUtils]: 93: Hoare triple {99681#(<= ~counter~0 10)} assume !(0 == ~cond); {99681#(<= ~counter~0 10)} is VALID [2022-04-28 06:01:03,710 INFO L290 TraceCheckUtils]: 94: Hoare triple {99681#(<= ~counter~0 10)} assume true; {99681#(<= ~counter~0 10)} is VALID [2022-04-28 06:01:03,711 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {99681#(<= ~counter~0 10)} {99681#(<= ~counter~0 10)} #98#return; {99681#(<= ~counter~0 10)} is VALID [2022-04-28 06:01:03,711 INFO L290 TraceCheckUtils]: 96: Hoare triple {99681#(<= ~counter~0 10)} assume !(~r~0 < 0); {99681#(<= ~counter~0 10)} is VALID [2022-04-28 06:01:03,713 INFO L290 TraceCheckUtils]: 97: Hoare triple {99681#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {99706#(<= ~counter~0 11)} is VALID [2022-04-28 06:01:03,714 INFO L290 TraceCheckUtils]: 98: Hoare triple {99706#(<= ~counter~0 11)} assume !!(#t~post6 < 20);havoc #t~post6; {99706#(<= ~counter~0 11)} is VALID [2022-04-28 06:01:03,714 INFO L272 TraceCheckUtils]: 99: Hoare triple {99706#(<= ~counter~0 11)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {99706#(<= ~counter~0 11)} is VALID [2022-04-28 06:01:03,715 INFO L290 TraceCheckUtils]: 100: Hoare triple {99706#(<= ~counter~0 11)} ~cond := #in~cond; {99706#(<= ~counter~0 11)} is VALID [2022-04-28 06:01:03,715 INFO L290 TraceCheckUtils]: 101: Hoare triple {99706#(<= ~counter~0 11)} assume !(0 == ~cond); {99706#(<= ~counter~0 11)} is VALID [2022-04-28 06:01:03,715 INFO L290 TraceCheckUtils]: 102: Hoare triple {99706#(<= ~counter~0 11)} assume true; {99706#(<= ~counter~0 11)} is VALID [2022-04-28 06:01:03,716 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {99706#(<= ~counter~0 11)} {99706#(<= ~counter~0 11)} #94#return; {99706#(<= ~counter~0 11)} is VALID [2022-04-28 06:01:03,716 INFO L290 TraceCheckUtils]: 104: Hoare triple {99706#(<= ~counter~0 11)} assume !!(0 != ~r~0); {99706#(<= ~counter~0 11)} is VALID [2022-04-28 06:01:03,719 INFO L290 TraceCheckUtils]: 105: Hoare triple {99706#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {99731#(<= ~counter~0 12)} is VALID [2022-04-28 06:01:03,719 INFO L290 TraceCheckUtils]: 106: Hoare triple {99731#(<= ~counter~0 12)} assume !!(#t~post7 < 20);havoc #t~post7; {99731#(<= ~counter~0 12)} is VALID [2022-04-28 06:01:03,720 INFO L272 TraceCheckUtils]: 107: Hoare triple {99731#(<= ~counter~0 12)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {99731#(<= ~counter~0 12)} is VALID [2022-04-28 06:01:03,720 INFO L290 TraceCheckUtils]: 108: Hoare triple {99731#(<= ~counter~0 12)} ~cond := #in~cond; {99731#(<= ~counter~0 12)} is VALID [2022-04-28 06:01:03,721 INFO L290 TraceCheckUtils]: 109: Hoare triple {99731#(<= ~counter~0 12)} assume !(0 == ~cond); {99731#(<= ~counter~0 12)} is VALID [2022-04-28 06:01:03,721 INFO L290 TraceCheckUtils]: 110: Hoare triple {99731#(<= ~counter~0 12)} assume true; {99731#(<= ~counter~0 12)} is VALID [2022-04-28 06:01:03,721 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {99731#(<= ~counter~0 12)} {99731#(<= ~counter~0 12)} #96#return; {99731#(<= ~counter~0 12)} is VALID [2022-04-28 06:01:03,722 INFO L290 TraceCheckUtils]: 112: Hoare triple {99731#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {99731#(<= ~counter~0 12)} is VALID [2022-04-28 06:01:03,723 INFO L290 TraceCheckUtils]: 113: Hoare triple {99731#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {99756#(<= ~counter~0 13)} is VALID [2022-04-28 06:01:03,724 INFO L290 TraceCheckUtils]: 114: Hoare triple {99756#(<= ~counter~0 13)} assume !!(#t~post7 < 20);havoc #t~post7; {99756#(<= ~counter~0 13)} is VALID [2022-04-28 06:01:03,724 INFO L272 TraceCheckUtils]: 115: Hoare triple {99756#(<= ~counter~0 13)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {99756#(<= ~counter~0 13)} is VALID [2022-04-28 06:01:03,725 INFO L290 TraceCheckUtils]: 116: Hoare triple {99756#(<= ~counter~0 13)} ~cond := #in~cond; {99756#(<= ~counter~0 13)} is VALID [2022-04-28 06:01:03,725 INFO L290 TraceCheckUtils]: 117: Hoare triple {99756#(<= ~counter~0 13)} assume !(0 == ~cond); {99756#(<= ~counter~0 13)} is VALID [2022-04-28 06:01:03,725 INFO L290 TraceCheckUtils]: 118: Hoare triple {99756#(<= ~counter~0 13)} assume true; {99756#(<= ~counter~0 13)} is VALID [2022-04-28 06:01:03,726 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {99756#(<= ~counter~0 13)} {99756#(<= ~counter~0 13)} #96#return; {99756#(<= ~counter~0 13)} is VALID [2022-04-28 06:01:03,726 INFO L290 TraceCheckUtils]: 120: Hoare triple {99756#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {99756#(<= ~counter~0 13)} is VALID [2022-04-28 06:01:03,726 INFO L290 TraceCheckUtils]: 121: Hoare triple {99756#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {99781#(<= |main_#t~post7| 13)} is VALID [2022-04-28 06:01:03,727 INFO L290 TraceCheckUtils]: 122: Hoare triple {99781#(<= |main_#t~post7| 13)} assume !(#t~post7 < 20);havoc #t~post7; {99400#false} is VALID [2022-04-28 06:01:03,727 INFO L290 TraceCheckUtils]: 123: Hoare triple {99400#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {99400#false} is VALID [2022-04-28 06:01:03,727 INFO L290 TraceCheckUtils]: 124: Hoare triple {99400#false} assume !(#t~post8 < 20);havoc #t~post8; {99400#false} is VALID [2022-04-28 06:01:03,727 INFO L290 TraceCheckUtils]: 125: Hoare triple {99400#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {99400#false} is VALID [2022-04-28 06:01:03,727 INFO L290 TraceCheckUtils]: 126: Hoare triple {99400#false} assume !(#t~post6 < 20);havoc #t~post6; {99400#false} is VALID [2022-04-28 06:01:03,727 INFO L272 TraceCheckUtils]: 127: Hoare triple {99400#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {99400#false} is VALID [2022-04-28 06:01:03,727 INFO L290 TraceCheckUtils]: 128: Hoare triple {99400#false} ~cond := #in~cond; {99400#false} is VALID [2022-04-28 06:01:03,727 INFO L290 TraceCheckUtils]: 129: Hoare triple {99400#false} assume 0 == ~cond; {99400#false} is VALID [2022-04-28 06:01:03,728 INFO L290 TraceCheckUtils]: 130: Hoare triple {99400#false} assume !false; {99400#false} is VALID [2022-04-28 06:01:03,728 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 40 proven. 420 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 06:01:03,728 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 06:01:04,373 INFO L290 TraceCheckUtils]: 130: Hoare triple {99400#false} assume !false; {99400#false} is VALID [2022-04-28 06:01:04,373 INFO L290 TraceCheckUtils]: 129: Hoare triple {99400#false} assume 0 == ~cond; {99400#false} is VALID [2022-04-28 06:01:04,373 INFO L290 TraceCheckUtils]: 128: Hoare triple {99400#false} ~cond := #in~cond; {99400#false} is VALID [2022-04-28 06:01:04,374 INFO L272 TraceCheckUtils]: 127: Hoare triple {99400#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {99400#false} is VALID [2022-04-28 06:01:04,374 INFO L290 TraceCheckUtils]: 126: Hoare triple {99400#false} assume !(#t~post6 < 20);havoc #t~post6; {99400#false} is VALID [2022-04-28 06:01:04,374 INFO L290 TraceCheckUtils]: 125: Hoare triple {99400#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {99400#false} is VALID [2022-04-28 06:01:04,374 INFO L290 TraceCheckUtils]: 124: Hoare triple {99400#false} assume !(#t~post8 < 20);havoc #t~post8; {99400#false} is VALID [2022-04-28 06:01:04,374 INFO L290 TraceCheckUtils]: 123: Hoare triple {99400#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {99400#false} is VALID [2022-04-28 06:01:04,378 INFO L290 TraceCheckUtils]: 122: Hoare triple {99833#(< |main_#t~post7| 20)} assume !(#t~post7 < 20);havoc #t~post7; {99400#false} is VALID [2022-04-28 06:01:04,379 INFO L290 TraceCheckUtils]: 121: Hoare triple {99837#(< ~counter~0 20)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {99833#(< |main_#t~post7| 20)} is VALID [2022-04-28 06:01:04,379 INFO L290 TraceCheckUtils]: 120: Hoare triple {99837#(< ~counter~0 20)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {99837#(< ~counter~0 20)} is VALID [2022-04-28 06:01:04,379 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {99399#true} {99837#(< ~counter~0 20)} #96#return; {99837#(< ~counter~0 20)} is VALID [2022-04-28 06:01:04,380 INFO L290 TraceCheckUtils]: 118: Hoare triple {99399#true} assume true; {99399#true} is VALID [2022-04-28 06:01:04,380 INFO L290 TraceCheckUtils]: 117: Hoare triple {99399#true} assume !(0 == ~cond); {99399#true} is VALID [2022-04-28 06:01:04,380 INFO L290 TraceCheckUtils]: 116: Hoare triple {99399#true} ~cond := #in~cond; {99399#true} is VALID [2022-04-28 06:01:04,380 INFO L272 TraceCheckUtils]: 115: Hoare triple {99837#(< ~counter~0 20)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {99399#true} is VALID [2022-04-28 06:01:04,380 INFO L290 TraceCheckUtils]: 114: Hoare triple {99837#(< ~counter~0 20)} assume !!(#t~post7 < 20);havoc #t~post7; {99837#(< ~counter~0 20)} is VALID [2022-04-28 06:01:04,382 INFO L290 TraceCheckUtils]: 113: Hoare triple {99862#(< ~counter~0 19)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {99837#(< ~counter~0 20)} is VALID [2022-04-28 06:01:04,382 INFO L290 TraceCheckUtils]: 112: Hoare triple {99862#(< ~counter~0 19)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {99862#(< ~counter~0 19)} is VALID [2022-04-28 06:01:04,383 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {99399#true} {99862#(< ~counter~0 19)} #96#return; {99862#(< ~counter~0 19)} is VALID [2022-04-28 06:01:04,383 INFO L290 TraceCheckUtils]: 110: Hoare triple {99399#true} assume true; {99399#true} is VALID [2022-04-28 06:01:04,383 INFO L290 TraceCheckUtils]: 109: Hoare triple {99399#true} assume !(0 == ~cond); {99399#true} is VALID [2022-04-28 06:01:04,383 INFO L290 TraceCheckUtils]: 108: Hoare triple {99399#true} ~cond := #in~cond; {99399#true} is VALID [2022-04-28 06:01:04,383 INFO L272 TraceCheckUtils]: 107: Hoare triple {99862#(< ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {99399#true} is VALID [2022-04-28 06:01:04,383 INFO L290 TraceCheckUtils]: 106: Hoare triple {99862#(< ~counter~0 19)} assume !!(#t~post7 < 20);havoc #t~post7; {99862#(< ~counter~0 19)} is VALID [2022-04-28 06:01:04,385 INFO L290 TraceCheckUtils]: 105: Hoare triple {99887#(< ~counter~0 18)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {99862#(< ~counter~0 19)} is VALID [2022-04-28 06:01:04,385 INFO L290 TraceCheckUtils]: 104: Hoare triple {99887#(< ~counter~0 18)} assume !!(0 != ~r~0); {99887#(< ~counter~0 18)} is VALID [2022-04-28 06:01:04,386 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {99399#true} {99887#(< ~counter~0 18)} #94#return; {99887#(< ~counter~0 18)} is VALID [2022-04-28 06:01:04,386 INFO L290 TraceCheckUtils]: 102: Hoare triple {99399#true} assume true; {99399#true} is VALID [2022-04-28 06:01:04,386 INFO L290 TraceCheckUtils]: 101: Hoare triple {99399#true} assume !(0 == ~cond); {99399#true} is VALID [2022-04-28 06:01:04,386 INFO L290 TraceCheckUtils]: 100: Hoare triple {99399#true} ~cond := #in~cond; {99399#true} is VALID [2022-04-28 06:01:04,386 INFO L272 TraceCheckUtils]: 99: Hoare triple {99887#(< ~counter~0 18)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {99399#true} is VALID [2022-04-28 06:01:04,386 INFO L290 TraceCheckUtils]: 98: Hoare triple {99887#(< ~counter~0 18)} assume !!(#t~post6 < 20);havoc #t~post6; {99887#(< ~counter~0 18)} is VALID [2022-04-28 06:01:04,387 INFO L290 TraceCheckUtils]: 97: Hoare triple {99912#(< ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {99887#(< ~counter~0 18)} is VALID [2022-04-28 06:01:04,387 INFO L290 TraceCheckUtils]: 96: Hoare triple {99912#(< ~counter~0 17)} assume !(~r~0 < 0); {99912#(< ~counter~0 17)} is VALID [2022-04-28 06:01:04,388 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {99399#true} {99912#(< ~counter~0 17)} #98#return; {99912#(< ~counter~0 17)} is VALID [2022-04-28 06:01:04,388 INFO L290 TraceCheckUtils]: 94: Hoare triple {99399#true} assume true; {99399#true} is VALID [2022-04-28 06:01:04,388 INFO L290 TraceCheckUtils]: 93: Hoare triple {99399#true} assume !(0 == ~cond); {99399#true} is VALID [2022-04-28 06:01:04,388 INFO L290 TraceCheckUtils]: 92: Hoare triple {99399#true} ~cond := #in~cond; {99399#true} is VALID [2022-04-28 06:01:04,388 INFO L272 TraceCheckUtils]: 91: Hoare triple {99912#(< ~counter~0 17)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {99399#true} is VALID [2022-04-28 06:01:04,388 INFO L290 TraceCheckUtils]: 90: Hoare triple {99912#(< ~counter~0 17)} assume !!(#t~post8 < 20);havoc #t~post8; {99912#(< ~counter~0 17)} is VALID [2022-04-28 06:01:04,390 INFO L290 TraceCheckUtils]: 89: Hoare triple {99937#(< ~counter~0 16)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {99912#(< ~counter~0 17)} is VALID [2022-04-28 06:01:04,390 INFO L290 TraceCheckUtils]: 88: Hoare triple {99937#(< ~counter~0 16)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {99937#(< ~counter~0 16)} is VALID [2022-04-28 06:01:04,390 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {99399#true} {99937#(< ~counter~0 16)} #98#return; {99937#(< ~counter~0 16)} is VALID [2022-04-28 06:01:04,390 INFO L290 TraceCheckUtils]: 86: Hoare triple {99399#true} assume true; {99399#true} is VALID [2022-04-28 06:01:04,391 INFO L290 TraceCheckUtils]: 85: Hoare triple {99399#true} assume !(0 == ~cond); {99399#true} is VALID [2022-04-28 06:01:04,391 INFO L290 TraceCheckUtils]: 84: Hoare triple {99399#true} ~cond := #in~cond; {99399#true} is VALID [2022-04-28 06:01:04,391 INFO L272 TraceCheckUtils]: 83: Hoare triple {99937#(< ~counter~0 16)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {99399#true} is VALID [2022-04-28 06:01:04,391 INFO L290 TraceCheckUtils]: 82: Hoare triple {99937#(< ~counter~0 16)} assume !!(#t~post8 < 20);havoc #t~post8; {99937#(< ~counter~0 16)} is VALID [2022-04-28 06:01:04,392 INFO L290 TraceCheckUtils]: 81: Hoare triple {99962#(< ~counter~0 15)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {99937#(< ~counter~0 16)} is VALID [2022-04-28 06:01:04,392 INFO L290 TraceCheckUtils]: 80: Hoare triple {99962#(< ~counter~0 15)} assume !(~r~0 > 0); {99962#(< ~counter~0 15)} is VALID [2022-04-28 06:01:04,393 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {99399#true} {99962#(< ~counter~0 15)} #96#return; {99962#(< ~counter~0 15)} is VALID [2022-04-28 06:01:04,393 INFO L290 TraceCheckUtils]: 78: Hoare triple {99399#true} assume true; {99399#true} is VALID [2022-04-28 06:01:04,393 INFO L290 TraceCheckUtils]: 77: Hoare triple {99399#true} assume !(0 == ~cond); {99399#true} is VALID [2022-04-28 06:01:04,393 INFO L290 TraceCheckUtils]: 76: Hoare triple {99399#true} ~cond := #in~cond; {99399#true} is VALID [2022-04-28 06:01:04,393 INFO L272 TraceCheckUtils]: 75: Hoare triple {99962#(< ~counter~0 15)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {99399#true} is VALID [2022-04-28 06:01:04,393 INFO L290 TraceCheckUtils]: 74: Hoare triple {99962#(< ~counter~0 15)} assume !!(#t~post7 < 20);havoc #t~post7; {99962#(< ~counter~0 15)} is VALID [2022-04-28 06:01:04,395 INFO L290 TraceCheckUtils]: 73: Hoare triple {99756#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {99962#(< ~counter~0 15)} is VALID [2022-04-28 06:01:04,395 INFO L290 TraceCheckUtils]: 72: Hoare triple {99756#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {99756#(<= ~counter~0 13)} is VALID [2022-04-28 06:01:04,395 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {99399#true} {99756#(<= ~counter~0 13)} #96#return; {99756#(<= ~counter~0 13)} is VALID [2022-04-28 06:01:04,395 INFO L290 TraceCheckUtils]: 70: Hoare triple {99399#true} assume true; {99399#true} is VALID [2022-04-28 06:01:04,395 INFO L290 TraceCheckUtils]: 69: Hoare triple {99399#true} assume !(0 == ~cond); {99399#true} is VALID [2022-04-28 06:01:04,396 INFO L290 TraceCheckUtils]: 68: Hoare triple {99399#true} ~cond := #in~cond; {99399#true} is VALID [2022-04-28 06:01:04,396 INFO L272 TraceCheckUtils]: 67: Hoare triple {99756#(<= ~counter~0 13)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {99399#true} is VALID [2022-04-28 06:01:04,396 INFO L290 TraceCheckUtils]: 66: Hoare triple {99756#(<= ~counter~0 13)} assume !!(#t~post7 < 20);havoc #t~post7; {99756#(<= ~counter~0 13)} is VALID [2022-04-28 06:01:04,397 INFO L290 TraceCheckUtils]: 65: Hoare triple {99731#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {99756#(<= ~counter~0 13)} is VALID [2022-04-28 06:01:04,397 INFO L290 TraceCheckUtils]: 64: Hoare triple {99731#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {99731#(<= ~counter~0 12)} is VALID [2022-04-28 06:01:04,398 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {99399#true} {99731#(<= ~counter~0 12)} #96#return; {99731#(<= ~counter~0 12)} is VALID [2022-04-28 06:01:04,398 INFO L290 TraceCheckUtils]: 62: Hoare triple {99399#true} assume true; {99399#true} is VALID [2022-04-28 06:01:04,398 INFO L290 TraceCheckUtils]: 61: Hoare triple {99399#true} assume !(0 == ~cond); {99399#true} is VALID [2022-04-28 06:01:04,398 INFO L290 TraceCheckUtils]: 60: Hoare triple {99399#true} ~cond := #in~cond; {99399#true} is VALID [2022-04-28 06:01:04,398 INFO L272 TraceCheckUtils]: 59: Hoare triple {99731#(<= ~counter~0 12)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {99399#true} is VALID [2022-04-28 06:01:04,398 INFO L290 TraceCheckUtils]: 58: Hoare triple {99731#(<= ~counter~0 12)} assume !!(#t~post7 < 20);havoc #t~post7; {99731#(<= ~counter~0 12)} is VALID [2022-04-28 06:01:04,399 INFO L290 TraceCheckUtils]: 57: Hoare triple {99706#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {99731#(<= ~counter~0 12)} is VALID [2022-04-28 06:01:04,400 INFO L290 TraceCheckUtils]: 56: Hoare triple {99706#(<= ~counter~0 11)} assume !!(0 != ~r~0); {99706#(<= ~counter~0 11)} is VALID [2022-04-28 06:01:04,400 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {99399#true} {99706#(<= ~counter~0 11)} #94#return; {99706#(<= ~counter~0 11)} is VALID [2022-04-28 06:01:04,400 INFO L290 TraceCheckUtils]: 54: Hoare triple {99399#true} assume true; {99399#true} is VALID [2022-04-28 06:01:04,400 INFO L290 TraceCheckUtils]: 53: Hoare triple {99399#true} assume !(0 == ~cond); {99399#true} is VALID [2022-04-28 06:01:04,400 INFO L290 TraceCheckUtils]: 52: Hoare triple {99399#true} ~cond := #in~cond; {99399#true} is VALID [2022-04-28 06:01:04,400 INFO L272 TraceCheckUtils]: 51: Hoare triple {99706#(<= ~counter~0 11)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {99399#true} is VALID [2022-04-28 06:01:04,401 INFO L290 TraceCheckUtils]: 50: Hoare triple {99706#(<= ~counter~0 11)} assume !!(#t~post6 < 20);havoc #t~post6; {99706#(<= ~counter~0 11)} is VALID [2022-04-28 06:01:04,402 INFO L290 TraceCheckUtils]: 49: Hoare triple {99681#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {99706#(<= ~counter~0 11)} is VALID [2022-04-28 06:01:04,402 INFO L290 TraceCheckUtils]: 48: Hoare triple {99681#(<= ~counter~0 10)} assume !(~r~0 < 0); {99681#(<= ~counter~0 10)} is VALID [2022-04-28 06:01:04,402 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {99399#true} {99681#(<= ~counter~0 10)} #98#return; {99681#(<= ~counter~0 10)} is VALID [2022-04-28 06:01:04,403 INFO L290 TraceCheckUtils]: 46: Hoare triple {99399#true} assume true; {99399#true} is VALID [2022-04-28 06:01:04,403 INFO L290 TraceCheckUtils]: 45: Hoare triple {99399#true} assume !(0 == ~cond); {99399#true} is VALID [2022-04-28 06:01:04,403 INFO L290 TraceCheckUtils]: 44: Hoare triple {99399#true} ~cond := #in~cond; {99399#true} is VALID [2022-04-28 06:01:04,403 INFO L272 TraceCheckUtils]: 43: Hoare triple {99681#(<= ~counter~0 10)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {99399#true} is VALID [2022-04-28 06:01:04,403 INFO L290 TraceCheckUtils]: 42: Hoare triple {99681#(<= ~counter~0 10)} assume !!(#t~post8 < 20);havoc #t~post8; {99681#(<= ~counter~0 10)} is VALID [2022-04-28 06:01:04,405 INFO L290 TraceCheckUtils]: 41: Hoare triple {99656#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {99681#(<= ~counter~0 10)} is VALID [2022-04-28 06:01:04,405 INFO L290 TraceCheckUtils]: 40: Hoare triple {99656#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {99656#(<= ~counter~0 9)} is VALID [2022-04-28 06:01:04,405 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {99399#true} {99656#(<= ~counter~0 9)} #98#return; {99656#(<= ~counter~0 9)} is VALID [2022-04-28 06:01:04,405 INFO L290 TraceCheckUtils]: 38: Hoare triple {99399#true} assume true; {99399#true} is VALID [2022-04-28 06:01:04,406 INFO L290 TraceCheckUtils]: 37: Hoare triple {99399#true} assume !(0 == ~cond); {99399#true} is VALID [2022-04-28 06:01:04,406 INFO L290 TraceCheckUtils]: 36: Hoare triple {99399#true} ~cond := #in~cond; {99399#true} is VALID [2022-04-28 06:01:04,406 INFO L272 TraceCheckUtils]: 35: Hoare triple {99656#(<= ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {99399#true} is VALID [2022-04-28 06:01:04,406 INFO L290 TraceCheckUtils]: 34: Hoare triple {99656#(<= ~counter~0 9)} assume !!(#t~post8 < 20);havoc #t~post8; {99656#(<= ~counter~0 9)} is VALID [2022-04-28 06:01:04,407 INFO L290 TraceCheckUtils]: 33: Hoare triple {99631#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {99656#(<= ~counter~0 9)} is VALID [2022-04-28 06:01:04,407 INFO L290 TraceCheckUtils]: 32: Hoare triple {99631#(<= ~counter~0 8)} assume !(~r~0 > 0); {99631#(<= ~counter~0 8)} is VALID [2022-04-28 06:01:04,408 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {99399#true} {99631#(<= ~counter~0 8)} #96#return; {99631#(<= ~counter~0 8)} is VALID [2022-04-28 06:01:04,408 INFO L290 TraceCheckUtils]: 30: Hoare triple {99399#true} assume true; {99399#true} is VALID [2022-04-28 06:01:04,408 INFO L290 TraceCheckUtils]: 29: Hoare triple {99399#true} assume !(0 == ~cond); {99399#true} is VALID [2022-04-28 06:01:04,408 INFO L290 TraceCheckUtils]: 28: Hoare triple {99399#true} ~cond := #in~cond; {99399#true} is VALID [2022-04-28 06:01:04,408 INFO L272 TraceCheckUtils]: 27: Hoare triple {99631#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {99399#true} is VALID [2022-04-28 06:01:04,408 INFO L290 TraceCheckUtils]: 26: Hoare triple {99631#(<= ~counter~0 8)} assume !!(#t~post7 < 20);havoc #t~post7; {99631#(<= ~counter~0 8)} is VALID [2022-04-28 06:01:04,410 INFO L290 TraceCheckUtils]: 25: Hoare triple {99606#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {99631#(<= ~counter~0 8)} is VALID [2022-04-28 06:01:04,410 INFO L290 TraceCheckUtils]: 24: Hoare triple {99606#(<= ~counter~0 7)} assume !!(0 != ~r~0); {99606#(<= ~counter~0 7)} is VALID [2022-04-28 06:01:04,411 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {99399#true} {99606#(<= ~counter~0 7)} #94#return; {99606#(<= ~counter~0 7)} is VALID [2022-04-28 06:01:04,411 INFO L290 TraceCheckUtils]: 22: Hoare triple {99399#true} assume true; {99399#true} is VALID [2022-04-28 06:01:04,411 INFO L290 TraceCheckUtils]: 21: Hoare triple {99399#true} assume !(0 == ~cond); {99399#true} is VALID [2022-04-28 06:01:04,411 INFO L290 TraceCheckUtils]: 20: Hoare triple {99399#true} ~cond := #in~cond; {99399#true} is VALID [2022-04-28 06:01:04,411 INFO L272 TraceCheckUtils]: 19: Hoare triple {99606#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {99399#true} is VALID [2022-04-28 06:01:04,411 INFO L290 TraceCheckUtils]: 18: Hoare triple {99606#(<= ~counter~0 7)} assume !!(#t~post6 < 20);havoc #t~post6; {99606#(<= ~counter~0 7)} is VALID [2022-04-28 06:01:04,412 INFO L290 TraceCheckUtils]: 17: Hoare triple {99581#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {99606#(<= ~counter~0 7)} is VALID [2022-04-28 06:01:04,413 INFO L290 TraceCheckUtils]: 16: Hoare triple {99581#(<= ~counter~0 6)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {99581#(<= ~counter~0 6)} is VALID [2022-04-28 06:01:04,413 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {99399#true} {99581#(<= ~counter~0 6)} #92#return; {99581#(<= ~counter~0 6)} is VALID [2022-04-28 06:01:04,413 INFO L290 TraceCheckUtils]: 14: Hoare triple {99399#true} assume true; {99399#true} is VALID [2022-04-28 06:01:04,413 INFO L290 TraceCheckUtils]: 13: Hoare triple {99399#true} assume !(0 == ~cond); {99399#true} is VALID [2022-04-28 06:01:04,413 INFO L290 TraceCheckUtils]: 12: Hoare triple {99399#true} ~cond := #in~cond; {99399#true} is VALID [2022-04-28 06:01:04,413 INFO L272 TraceCheckUtils]: 11: Hoare triple {99581#(<= ~counter~0 6)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {99399#true} is VALID [2022-04-28 06:01:04,414 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {99399#true} {99581#(<= ~counter~0 6)} #90#return; {99581#(<= ~counter~0 6)} is VALID [2022-04-28 06:01:04,414 INFO L290 TraceCheckUtils]: 9: Hoare triple {99399#true} assume true; {99399#true} is VALID [2022-04-28 06:01:04,414 INFO L290 TraceCheckUtils]: 8: Hoare triple {99399#true} assume !(0 == ~cond); {99399#true} is VALID [2022-04-28 06:01:04,414 INFO L290 TraceCheckUtils]: 7: Hoare triple {99399#true} ~cond := #in~cond; {99399#true} is VALID [2022-04-28 06:01:04,414 INFO L272 TraceCheckUtils]: 6: Hoare triple {99581#(<= ~counter~0 6)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {99399#true} is VALID [2022-04-28 06:01:04,414 INFO L290 TraceCheckUtils]: 5: Hoare triple {99581#(<= ~counter~0 6)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {99581#(<= ~counter~0 6)} is VALID [2022-04-28 06:01:04,414 INFO L272 TraceCheckUtils]: 4: Hoare triple {99581#(<= ~counter~0 6)} call #t~ret9 := main(); {99581#(<= ~counter~0 6)} is VALID [2022-04-28 06:01:04,415 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {99581#(<= ~counter~0 6)} {99399#true} #102#return; {99581#(<= ~counter~0 6)} is VALID [2022-04-28 06:01:04,415 INFO L290 TraceCheckUtils]: 2: Hoare triple {99581#(<= ~counter~0 6)} assume true; {99581#(<= ~counter~0 6)} is VALID [2022-04-28 06:01:04,415 INFO L290 TraceCheckUtils]: 1: Hoare triple {99399#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {99581#(<= ~counter~0 6)} is VALID [2022-04-28 06:01:04,415 INFO L272 TraceCheckUtils]: 0: Hoare triple {99399#true} call ULTIMATE.init(); {99399#true} is VALID [2022-04-28 06:01:04,416 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 40 proven. 108 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2022-04-28 06:01:04,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:01:04,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530232161] [2022-04-28 06:01:04,416 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:01:04,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [900259316] [2022-04-28 06:01:04,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [900259316] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 06:01:04,416 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 06:01:04,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 24 [2022-04-28 06:01:04,416 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:01:04,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [731806537] [2022-04-28 06:01:04,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [731806537] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:01:04,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:01:04,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 06:01:04,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990398423] [2022-04-28 06:01:04,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:01:04,417 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.529411764705882) internal successors, (94), 16 states have internal predecessors, (94), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) Word has length 131 [2022-04-28 06:01:04,417 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:01:04,417 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 5.529411764705882) internal successors, (94), 16 states have internal predecessors, (94), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-28 06:01:04,558 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:01:04,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 06:01:04,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:01:04,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 06:01:04,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-28 06:01:04,559 INFO L87 Difference]: Start difference. First operand 690 states and 936 transitions. Second operand has 17 states, 17 states have (on average 5.529411764705882) internal successors, (94), 16 states have internal predecessors, (94), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-28 06:01:08,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:01:08,195 INFO L93 Difference]: Finished difference Result 903 states and 1260 transitions. [2022-04-28 06:01:08,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-28 06:01:08,195 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.529411764705882) internal successors, (94), 16 states have internal predecessors, (94), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) Word has length 131 [2022-04-28 06:01:08,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:01:08,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 5.529411764705882) internal successors, (94), 16 states have internal predecessors, (94), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-28 06:01:08,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 296 transitions. [2022-04-28 06:01:08,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 5.529411764705882) internal successors, (94), 16 states have internal predecessors, (94), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-28 06:01:08,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 296 transitions. [2022-04-28 06:01:08,199 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 296 transitions. [2022-04-28 06:01:08,473 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 296 edges. 296 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:01:08,494 INFO L225 Difference]: With dead ends: 903 [2022-04-28 06:01:08,494 INFO L226 Difference]: Without dead ends: 706 [2022-04-28 06:01:08,495 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 238 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=500, Invalid=760, Unknown=0, NotChecked=0, Total=1260 [2022-04-28 06:01:08,495 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 205 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 06:01:08,495 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 291 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 06:01:08,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2022-04-28 06:01:10,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 706. [2022-04-28 06:01:10,728 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:01:10,729 INFO L82 GeneralOperation]: Start isEquivalent. First operand 706 states. Second operand has 706 states, 536 states have (on average 1.208955223880597) internal successors, (648), 536 states have internal predecessors, (648), 153 states have call successors, (153), 18 states have call predecessors, (153), 16 states have return successors, (151), 151 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-28 06:01:10,729 INFO L74 IsIncluded]: Start isIncluded. First operand 706 states. Second operand has 706 states, 536 states have (on average 1.208955223880597) internal successors, (648), 536 states have internal predecessors, (648), 153 states have call successors, (153), 18 states have call predecessors, (153), 16 states have return successors, (151), 151 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-28 06:01:10,730 INFO L87 Difference]: Start difference. First operand 706 states. Second operand has 706 states, 536 states have (on average 1.208955223880597) internal successors, (648), 536 states have internal predecessors, (648), 153 states have call successors, (153), 18 states have call predecessors, (153), 16 states have return successors, (151), 151 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-28 06:01:10,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:01:10,746 INFO L93 Difference]: Finished difference Result 706 states and 952 transitions. [2022-04-28 06:01:10,746 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 952 transitions. [2022-04-28 06:01:10,747 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:01:10,747 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:01:10,747 INFO L74 IsIncluded]: Start isIncluded. First operand has 706 states, 536 states have (on average 1.208955223880597) internal successors, (648), 536 states have internal predecessors, (648), 153 states have call successors, (153), 18 states have call predecessors, (153), 16 states have return successors, (151), 151 states have call predecessors, (151), 151 states have call successors, (151) Second operand 706 states. [2022-04-28 06:01:10,748 INFO L87 Difference]: Start difference. First operand has 706 states, 536 states have (on average 1.208955223880597) internal successors, (648), 536 states have internal predecessors, (648), 153 states have call successors, (153), 18 states have call predecessors, (153), 16 states have return successors, (151), 151 states have call predecessors, (151), 151 states have call successors, (151) Second operand 706 states. [2022-04-28 06:01:10,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:01:10,764 INFO L93 Difference]: Finished difference Result 706 states and 952 transitions. [2022-04-28 06:01:10,764 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 952 transitions. [2022-04-28 06:01:10,765 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:01:10,765 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:01:10,765 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:01:10,765 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:01:10,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 706 states, 536 states have (on average 1.208955223880597) internal successors, (648), 536 states have internal predecessors, (648), 153 states have call successors, (153), 18 states have call predecessors, (153), 16 states have return successors, (151), 151 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-28 06:01:10,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 952 transitions. [2022-04-28 06:01:10,793 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 952 transitions. Word has length 131 [2022-04-28 06:01:10,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:01:10,793 INFO L495 AbstractCegarLoop]: Abstraction has 706 states and 952 transitions. [2022-04-28 06:01:10,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.529411764705882) internal successors, (94), 16 states have internal predecessors, (94), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-28 06:01:10,794 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 706 states and 952 transitions. [2022-04-28 06:01:15,774 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 952 edges. 952 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:01:15,774 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 952 transitions. [2022-04-28 06:01:15,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-04-28 06:01:15,775 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:01:15,776 INFO L195 NwaCegarLoop]: trace histogram [15, 14, 14, 6, 6, 6, 6, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:01:15,787 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Forceful destruction successful, exit code 0 [2022-04-28 06:01:15,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:01:15,976 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:01:15,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:01:15,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1252937077, now seen corresponding path program 11 times [2022-04-28 06:01:15,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:01:15,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1567855746] [2022-04-28 06:01:15,977 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 06:01:15,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1252937077, now seen corresponding path program 12 times [2022-04-28 06:01:15,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:01:15,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004129140] [2022-04-28 06:01:15,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:01:15,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:01:15,995 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:01:15,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [653877176] [2022-04-28 06:01:15,995 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 06:01:15,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:01:15,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:01:15,996 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:01:16,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2022-04-28 06:01:16,105 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 06:01:16,106 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:01:16,107 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 06:01:16,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:01:16,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:01:17,004 INFO L272 TraceCheckUtils]: 0: Hoare triple {104862#true} call ULTIMATE.init(); {104862#true} is VALID [2022-04-28 06:01:17,004 INFO L290 TraceCheckUtils]: 1: Hoare triple {104862#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {104862#true} is VALID [2022-04-28 06:01:17,004 INFO L290 TraceCheckUtils]: 2: Hoare triple {104862#true} assume true; {104862#true} is VALID [2022-04-28 06:01:17,004 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {104862#true} {104862#true} #102#return; {104862#true} is VALID [2022-04-28 06:01:17,005 INFO L272 TraceCheckUtils]: 4: Hoare triple {104862#true} call #t~ret9 := main(); {104862#true} is VALID [2022-04-28 06:01:17,005 INFO L290 TraceCheckUtils]: 5: Hoare triple {104862#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {104862#true} is VALID [2022-04-28 06:01:17,005 INFO L272 TraceCheckUtils]: 6: Hoare triple {104862#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {104862#true} is VALID [2022-04-28 06:01:17,005 INFO L290 TraceCheckUtils]: 7: Hoare triple {104862#true} ~cond := #in~cond; {104862#true} is VALID [2022-04-28 06:01:17,005 INFO L290 TraceCheckUtils]: 8: Hoare triple {104862#true} assume !(0 == ~cond); {104862#true} is VALID [2022-04-28 06:01:17,005 INFO L290 TraceCheckUtils]: 9: Hoare triple {104862#true} assume true; {104862#true} is VALID [2022-04-28 06:01:17,005 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {104862#true} {104862#true} #90#return; {104862#true} is VALID [2022-04-28 06:01:17,005 INFO L272 TraceCheckUtils]: 11: Hoare triple {104862#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {104862#true} is VALID [2022-04-28 06:01:17,005 INFO L290 TraceCheckUtils]: 12: Hoare triple {104862#true} ~cond := #in~cond; {104862#true} is VALID [2022-04-28 06:01:17,005 INFO L290 TraceCheckUtils]: 13: Hoare triple {104862#true} assume !(0 == ~cond); {104862#true} is VALID [2022-04-28 06:01:17,005 INFO L290 TraceCheckUtils]: 14: Hoare triple {104862#true} assume true; {104862#true} is VALID [2022-04-28 06:01:17,005 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {104862#true} {104862#true} #92#return; {104862#true} is VALID [2022-04-28 06:01:17,006 INFO L290 TraceCheckUtils]: 16: Hoare triple {104862#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {104862#true} is VALID [2022-04-28 06:01:17,006 INFO L290 TraceCheckUtils]: 17: Hoare triple {104862#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {104862#true} is VALID [2022-04-28 06:01:17,006 INFO L290 TraceCheckUtils]: 18: Hoare triple {104862#true} assume !!(#t~post6 < 20);havoc #t~post6; {104862#true} is VALID [2022-04-28 06:01:17,006 INFO L272 TraceCheckUtils]: 19: Hoare triple {104862#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {104862#true} is VALID [2022-04-28 06:01:17,006 INFO L290 TraceCheckUtils]: 20: Hoare triple {104862#true} ~cond := #in~cond; {104862#true} is VALID [2022-04-28 06:01:17,006 INFO L290 TraceCheckUtils]: 21: Hoare triple {104862#true} assume !(0 == ~cond); {104862#true} is VALID [2022-04-28 06:01:17,006 INFO L290 TraceCheckUtils]: 22: Hoare triple {104862#true} assume true; {104862#true} is VALID [2022-04-28 06:01:17,006 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {104862#true} {104862#true} #94#return; {104862#true} is VALID [2022-04-28 06:01:17,006 INFO L290 TraceCheckUtils]: 24: Hoare triple {104862#true} assume !!(0 != ~r~0); {104862#true} is VALID [2022-04-28 06:01:17,006 INFO L290 TraceCheckUtils]: 25: Hoare triple {104862#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {104862#true} is VALID [2022-04-28 06:01:17,006 INFO L290 TraceCheckUtils]: 26: Hoare triple {104862#true} assume !!(#t~post7 < 20);havoc #t~post7; {104862#true} is VALID [2022-04-28 06:01:17,006 INFO L272 TraceCheckUtils]: 27: Hoare triple {104862#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {104862#true} is VALID [2022-04-28 06:01:17,006 INFO L290 TraceCheckUtils]: 28: Hoare triple {104862#true} ~cond := #in~cond; {104862#true} is VALID [2022-04-28 06:01:17,006 INFO L290 TraceCheckUtils]: 29: Hoare triple {104862#true} assume !(0 == ~cond); {104862#true} is VALID [2022-04-28 06:01:17,007 INFO L290 TraceCheckUtils]: 30: Hoare triple {104862#true} assume true; {104862#true} is VALID [2022-04-28 06:01:17,007 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {104862#true} {104862#true} #96#return; {104862#true} is VALID [2022-04-28 06:01:17,007 INFO L290 TraceCheckUtils]: 32: Hoare triple {104862#true} assume !(~r~0 > 0); {104862#true} is VALID [2022-04-28 06:01:17,007 INFO L290 TraceCheckUtils]: 33: Hoare triple {104862#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {104862#true} is VALID [2022-04-28 06:01:17,007 INFO L290 TraceCheckUtils]: 34: Hoare triple {104862#true} assume !!(#t~post8 < 20);havoc #t~post8; {104862#true} is VALID [2022-04-28 06:01:17,007 INFO L272 TraceCheckUtils]: 35: Hoare triple {104862#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {104862#true} is VALID [2022-04-28 06:01:17,007 INFO L290 TraceCheckUtils]: 36: Hoare triple {104862#true} ~cond := #in~cond; {104862#true} is VALID [2022-04-28 06:01:17,007 INFO L290 TraceCheckUtils]: 37: Hoare triple {104862#true} assume !(0 == ~cond); {104862#true} is VALID [2022-04-28 06:01:17,007 INFO L290 TraceCheckUtils]: 38: Hoare triple {104862#true} assume true; {104862#true} is VALID [2022-04-28 06:01:17,007 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {104862#true} {104862#true} #98#return; {104862#true} is VALID [2022-04-28 06:01:17,007 INFO L290 TraceCheckUtils]: 40: Hoare triple {104862#true} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {104862#true} is VALID [2022-04-28 06:01:17,007 INFO L290 TraceCheckUtils]: 41: Hoare triple {104862#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {104862#true} is VALID [2022-04-28 06:01:17,008 INFO L290 TraceCheckUtils]: 42: Hoare triple {104862#true} assume !!(#t~post8 < 20);havoc #t~post8; {104862#true} is VALID [2022-04-28 06:01:17,008 INFO L272 TraceCheckUtils]: 43: Hoare triple {104862#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {104862#true} is VALID [2022-04-28 06:01:17,008 INFO L290 TraceCheckUtils]: 44: Hoare triple {104862#true} ~cond := #in~cond; {104862#true} is VALID [2022-04-28 06:01:17,008 INFO L290 TraceCheckUtils]: 45: Hoare triple {104862#true} assume !(0 == ~cond); {104862#true} is VALID [2022-04-28 06:01:17,008 INFO L290 TraceCheckUtils]: 46: Hoare triple {104862#true} assume true; {104862#true} is VALID [2022-04-28 06:01:17,008 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {104862#true} {104862#true} #98#return; {104862#true} is VALID [2022-04-28 06:01:17,008 INFO L290 TraceCheckUtils]: 48: Hoare triple {104862#true} assume !(~r~0 < 0); {104862#true} is VALID [2022-04-28 06:01:17,008 INFO L290 TraceCheckUtils]: 49: Hoare triple {104862#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {104862#true} is VALID [2022-04-28 06:01:17,008 INFO L290 TraceCheckUtils]: 50: Hoare triple {104862#true} assume !!(#t~post6 < 20);havoc #t~post6; {104862#true} is VALID [2022-04-28 06:01:17,008 INFO L272 TraceCheckUtils]: 51: Hoare triple {104862#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {104862#true} is VALID [2022-04-28 06:01:17,008 INFO L290 TraceCheckUtils]: 52: Hoare triple {104862#true} ~cond := #in~cond; {104862#true} is VALID [2022-04-28 06:01:17,008 INFO L290 TraceCheckUtils]: 53: Hoare triple {104862#true} assume !(0 == ~cond); {104862#true} is VALID [2022-04-28 06:01:17,008 INFO L290 TraceCheckUtils]: 54: Hoare triple {104862#true} assume true; {104862#true} is VALID [2022-04-28 06:01:17,009 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {104862#true} {104862#true} #94#return; {104862#true} is VALID [2022-04-28 06:01:17,009 INFO L290 TraceCheckUtils]: 56: Hoare triple {104862#true} assume !!(0 != ~r~0); {104862#true} is VALID [2022-04-28 06:01:17,009 INFO L290 TraceCheckUtils]: 57: Hoare triple {104862#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {104862#true} is VALID [2022-04-28 06:01:17,009 INFO L290 TraceCheckUtils]: 58: Hoare triple {104862#true} assume !!(#t~post7 < 20);havoc #t~post7; {104862#true} is VALID [2022-04-28 06:01:17,009 INFO L272 TraceCheckUtils]: 59: Hoare triple {104862#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {104862#true} is VALID [2022-04-28 06:01:17,009 INFO L290 TraceCheckUtils]: 60: Hoare triple {104862#true} ~cond := #in~cond; {104862#true} is VALID [2022-04-28 06:01:17,009 INFO L290 TraceCheckUtils]: 61: Hoare triple {104862#true} assume !(0 == ~cond); {104862#true} is VALID [2022-04-28 06:01:17,009 INFO L290 TraceCheckUtils]: 62: Hoare triple {104862#true} assume true; {104862#true} is VALID [2022-04-28 06:01:17,009 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {104862#true} {104862#true} #96#return; {104862#true} is VALID [2022-04-28 06:01:17,009 INFO L290 TraceCheckUtils]: 64: Hoare triple {104862#true} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {104862#true} is VALID [2022-04-28 06:01:17,009 INFO L290 TraceCheckUtils]: 65: Hoare triple {104862#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {104862#true} is VALID [2022-04-28 06:01:17,009 INFO L290 TraceCheckUtils]: 66: Hoare triple {104862#true} assume !!(#t~post7 < 20);havoc #t~post7; {104862#true} is VALID [2022-04-28 06:01:17,009 INFO L272 TraceCheckUtils]: 67: Hoare triple {104862#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {104862#true} is VALID [2022-04-28 06:01:17,010 INFO L290 TraceCheckUtils]: 68: Hoare triple {104862#true} ~cond := #in~cond; {104862#true} is VALID [2022-04-28 06:01:17,010 INFO L290 TraceCheckUtils]: 69: Hoare triple {104862#true} assume !(0 == ~cond); {104862#true} is VALID [2022-04-28 06:01:17,010 INFO L290 TraceCheckUtils]: 70: Hoare triple {104862#true} assume true; {104862#true} is VALID [2022-04-28 06:01:17,010 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {104862#true} {104862#true} #96#return; {104862#true} is VALID [2022-04-28 06:01:17,010 INFO L290 TraceCheckUtils]: 72: Hoare triple {104862#true} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {104862#true} is VALID [2022-04-28 06:01:17,010 INFO L290 TraceCheckUtils]: 73: Hoare triple {104862#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {104862#true} is VALID [2022-04-28 06:01:17,010 INFO L290 TraceCheckUtils]: 74: Hoare triple {104862#true} assume !!(#t~post7 < 20);havoc #t~post7; {104862#true} is VALID [2022-04-28 06:01:17,010 INFO L272 TraceCheckUtils]: 75: Hoare triple {104862#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {104862#true} is VALID [2022-04-28 06:01:17,010 INFO L290 TraceCheckUtils]: 76: Hoare triple {104862#true} ~cond := #in~cond; {104862#true} is VALID [2022-04-28 06:01:17,010 INFO L290 TraceCheckUtils]: 77: Hoare triple {104862#true} assume !(0 == ~cond); {104862#true} is VALID [2022-04-28 06:01:17,010 INFO L290 TraceCheckUtils]: 78: Hoare triple {104862#true} assume true; {104862#true} is VALID [2022-04-28 06:01:17,010 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {104862#true} {104862#true} #96#return; {104862#true} is VALID [2022-04-28 06:01:17,010 INFO L290 TraceCheckUtils]: 80: Hoare triple {104862#true} assume !(~r~0 > 0); {104862#true} is VALID [2022-04-28 06:01:17,011 INFO L290 TraceCheckUtils]: 81: Hoare triple {104862#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {104862#true} is VALID [2022-04-28 06:01:17,011 INFO L290 TraceCheckUtils]: 82: Hoare triple {104862#true} assume !!(#t~post8 < 20);havoc #t~post8; {104862#true} is VALID [2022-04-28 06:01:17,011 INFO L272 TraceCheckUtils]: 83: Hoare triple {104862#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {104862#true} is VALID [2022-04-28 06:01:17,011 INFO L290 TraceCheckUtils]: 84: Hoare triple {104862#true} ~cond := #in~cond; {104862#true} is VALID [2022-04-28 06:01:17,011 INFO L290 TraceCheckUtils]: 85: Hoare triple {104862#true} assume !(0 == ~cond); {104862#true} is VALID [2022-04-28 06:01:17,011 INFO L290 TraceCheckUtils]: 86: Hoare triple {104862#true} assume true; {104862#true} is VALID [2022-04-28 06:01:17,011 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {104862#true} {104862#true} #98#return; {104862#true} is VALID [2022-04-28 06:01:17,011 INFO L290 TraceCheckUtils]: 88: Hoare triple {104862#true} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {104862#true} is VALID [2022-04-28 06:01:17,011 INFO L290 TraceCheckUtils]: 89: Hoare triple {104862#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {104862#true} is VALID [2022-04-28 06:01:17,011 INFO L290 TraceCheckUtils]: 90: Hoare triple {104862#true} assume !!(#t~post8 < 20);havoc #t~post8; {104862#true} is VALID [2022-04-28 06:01:17,011 INFO L272 TraceCheckUtils]: 91: Hoare triple {104862#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {104862#true} is VALID [2022-04-28 06:01:17,011 INFO L290 TraceCheckUtils]: 92: Hoare triple {104862#true} ~cond := #in~cond; {104862#true} is VALID [2022-04-28 06:01:17,011 INFO L290 TraceCheckUtils]: 93: Hoare triple {104862#true} assume !(0 == ~cond); {104862#true} is VALID [2022-04-28 06:01:17,012 INFO L290 TraceCheckUtils]: 94: Hoare triple {104862#true} assume true; {104862#true} is VALID [2022-04-28 06:01:17,012 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {104862#true} {104862#true} #98#return; {104862#true} is VALID [2022-04-28 06:01:17,012 INFO L290 TraceCheckUtils]: 96: Hoare triple {104862#true} assume !(~r~0 < 0); {104862#true} is VALID [2022-04-28 06:01:17,012 INFO L290 TraceCheckUtils]: 97: Hoare triple {104862#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {104862#true} is VALID [2022-04-28 06:01:17,012 INFO L290 TraceCheckUtils]: 98: Hoare triple {104862#true} assume !!(#t~post6 < 20);havoc #t~post6; {104862#true} is VALID [2022-04-28 06:01:17,012 INFO L272 TraceCheckUtils]: 99: Hoare triple {104862#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {104862#true} is VALID [2022-04-28 06:01:17,012 INFO L290 TraceCheckUtils]: 100: Hoare triple {104862#true} ~cond := #in~cond; {104862#true} is VALID [2022-04-28 06:01:17,012 INFO L290 TraceCheckUtils]: 101: Hoare triple {104862#true} assume !(0 == ~cond); {104862#true} is VALID [2022-04-28 06:01:17,012 INFO L290 TraceCheckUtils]: 102: Hoare triple {104862#true} assume true; {104862#true} is VALID [2022-04-28 06:01:17,012 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {104862#true} {104862#true} #94#return; {104862#true} is VALID [2022-04-28 06:01:17,012 INFO L290 TraceCheckUtils]: 104: Hoare triple {104862#true} assume !!(0 != ~r~0); {104862#true} is VALID [2022-04-28 06:01:17,012 INFO L290 TraceCheckUtils]: 105: Hoare triple {104862#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {104862#true} is VALID [2022-04-28 06:01:17,013 INFO L290 TraceCheckUtils]: 106: Hoare triple {104862#true} assume !!(#t~post7 < 20);havoc #t~post7; {104862#true} is VALID [2022-04-28 06:01:17,013 INFO L272 TraceCheckUtils]: 107: Hoare triple {104862#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {104862#true} is VALID [2022-04-28 06:01:17,013 INFO L290 TraceCheckUtils]: 108: Hoare triple {104862#true} ~cond := #in~cond; {104862#true} is VALID [2022-04-28 06:01:17,013 INFO L290 TraceCheckUtils]: 109: Hoare triple {104862#true} assume !(0 == ~cond); {104862#true} is VALID [2022-04-28 06:01:17,013 INFO L290 TraceCheckUtils]: 110: Hoare triple {104862#true} assume true; {104862#true} is VALID [2022-04-28 06:01:17,013 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {104862#true} {104862#true} #96#return; {104862#true} is VALID [2022-04-28 06:01:17,013 INFO L290 TraceCheckUtils]: 112: Hoare triple {104862#true} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {104862#true} is VALID [2022-04-28 06:01:17,013 INFO L290 TraceCheckUtils]: 113: Hoare triple {104862#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {104862#true} is VALID [2022-04-28 06:01:17,013 INFO L290 TraceCheckUtils]: 114: Hoare triple {104862#true} assume !!(#t~post7 < 20);havoc #t~post7; {104862#true} is VALID [2022-04-28 06:01:17,015 INFO L272 TraceCheckUtils]: 115: Hoare triple {104862#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {104862#true} is VALID [2022-04-28 06:01:17,015 INFO L290 TraceCheckUtils]: 116: Hoare triple {104862#true} ~cond := #in~cond; {104862#true} is VALID [2022-04-28 06:01:17,015 INFO L290 TraceCheckUtils]: 117: Hoare triple {104862#true} assume !(0 == ~cond); {104862#true} is VALID [2022-04-28 06:01:17,015 INFO L290 TraceCheckUtils]: 118: Hoare triple {104862#true} assume true; {104862#true} is VALID [2022-04-28 06:01:17,015 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {104862#true} {104862#true} #96#return; {104862#true} is VALID [2022-04-28 06:01:17,016 INFO L290 TraceCheckUtils]: 120: Hoare triple {104862#true} assume !(~r~0 > 0); {105227#(not (< 0 main_~r~0))} is VALID [2022-04-28 06:01:17,016 INFO L290 TraceCheckUtils]: 121: Hoare triple {105227#(not (< 0 main_~r~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {105227#(not (< 0 main_~r~0))} is VALID [2022-04-28 06:01:17,016 INFO L290 TraceCheckUtils]: 122: Hoare triple {105227#(not (< 0 main_~r~0))} assume !!(#t~post8 < 20);havoc #t~post8; {105227#(not (< 0 main_~r~0))} is VALID [2022-04-28 06:01:17,016 INFO L272 TraceCheckUtils]: 123: Hoare triple {105227#(not (< 0 main_~r~0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {104862#true} is VALID [2022-04-28 06:01:17,017 INFO L290 TraceCheckUtils]: 124: Hoare triple {104862#true} ~cond := #in~cond; {105240#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 06:01:17,017 INFO L290 TraceCheckUtils]: 125: Hoare triple {105240#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {105244#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 06:01:17,017 INFO L290 TraceCheckUtils]: 126: Hoare triple {105244#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {105244#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 06:01:17,018 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {105244#(not (= |__VERIFIER_assert_#in~cond| 0))} {105227#(not (< 0 main_~r~0))} #98#return; {105251#(and (= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4) (* main_~r~0 4))) (not (< 0 main_~r~0)))} is VALID [2022-04-28 06:01:17,024 INFO L290 TraceCheckUtils]: 128: Hoare triple {105251#(and (= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4) (* main_~r~0 4))) (not (< 0 main_~r~0)))} assume !(~r~0 < 0); {105255#(and (= (mod (+ (* main_~v~0 2) (* (- 1) main_~u~0 main_~u~0) (* main_~v~0 main_~v~0) (* main_~u~0 2)) 4) 0) (not (< (div (+ (* (- 1) main_~u~0 main_~u~0) (* main_~v~0 main_~v~0) (* (- 2) main_~v~0) (* main_~u~0 2)) (- 4)) main_~A~0)) (not (< main_~A~0 (div (+ (* (- 1) main_~u~0 main_~u~0) (* main_~v~0 main_~v~0) (* (- 2) main_~v~0) (* main_~u~0 2)) (- 4)))))} is VALID [2022-04-28 06:01:17,031 INFO L290 TraceCheckUtils]: 129: Hoare triple {105255#(and (= (mod (+ (* main_~v~0 2) (* (- 1) main_~u~0 main_~u~0) (* main_~v~0 main_~v~0) (* main_~u~0 2)) 4) 0) (not (< (div (+ (* (- 1) main_~u~0 main_~u~0) (* main_~v~0 main_~v~0) (* (- 2) main_~v~0) (* main_~u~0 2)) (- 4)) main_~A~0)) (not (< main_~A~0 (div (+ (* (- 1) main_~u~0 main_~u~0) (* main_~v~0 main_~v~0) (* (- 2) main_~v~0) (* main_~u~0 2)) (- 4)))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {105255#(and (= (mod (+ (* main_~v~0 2) (* (- 1) main_~u~0 main_~u~0) (* main_~v~0 main_~v~0) (* main_~u~0 2)) 4) 0) (not (< (div (+ (* (- 1) main_~u~0 main_~u~0) (* main_~v~0 main_~v~0) (* (- 2) main_~v~0) (* main_~u~0 2)) (- 4)) main_~A~0)) (not (< main_~A~0 (div (+ (* (- 1) main_~u~0 main_~u~0) (* main_~v~0 main_~v~0) (* (- 2) main_~v~0) (* main_~u~0 2)) (- 4)))))} is VALID [2022-04-28 06:01:17,039 INFO L290 TraceCheckUtils]: 130: Hoare triple {105255#(and (= (mod (+ (* main_~v~0 2) (* (- 1) main_~u~0 main_~u~0) (* main_~v~0 main_~v~0) (* main_~u~0 2)) 4) 0) (not (< (div (+ (* (- 1) main_~u~0 main_~u~0) (* main_~v~0 main_~v~0) (* (- 2) main_~v~0) (* main_~u~0 2)) (- 4)) main_~A~0)) (not (< main_~A~0 (div (+ (* (- 1) main_~u~0 main_~u~0) (* main_~v~0 main_~v~0) (* (- 2) main_~v~0) (* main_~u~0 2)) (- 4)))))} assume !(#t~post6 < 20);havoc #t~post6; {105255#(and (= (mod (+ (* main_~v~0 2) (* (- 1) main_~u~0 main_~u~0) (* main_~v~0 main_~v~0) (* main_~u~0 2)) 4) 0) (not (< (div (+ (* (- 1) main_~u~0 main_~u~0) (* main_~v~0 main_~v~0) (* (- 2) main_~v~0) (* main_~u~0 2)) (- 4)) main_~A~0)) (not (< main_~A~0 (div (+ (* (- 1) main_~u~0 main_~u~0) (* main_~v~0 main_~v~0) (* (- 2) main_~v~0) (* main_~u~0 2)) (- 4)))))} is VALID [2022-04-28 06:01:17,041 INFO L272 TraceCheckUtils]: 131: Hoare triple {105255#(and (= (mod (+ (* main_~v~0 2) (* (- 1) main_~u~0 main_~u~0) (* main_~v~0 main_~v~0) (* main_~u~0 2)) 4) 0) (not (< (div (+ (* (- 1) main_~u~0 main_~u~0) (* main_~v~0 main_~v~0) (* (- 2) main_~v~0) (* main_~u~0 2)) (- 4)) main_~A~0)) (not (< main_~A~0 (div (+ (* (- 1) main_~u~0 main_~u~0) (* main_~v~0 main_~v~0) (* (- 2) main_~v~0) (* main_~u~0 2)) (- 4)))))} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {105265#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 06:01:17,041 INFO L290 TraceCheckUtils]: 132: Hoare triple {105265#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {105269#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 06:01:17,041 INFO L290 TraceCheckUtils]: 133: Hoare triple {105269#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {104863#false} is VALID [2022-04-28 06:01:17,042 INFO L290 TraceCheckUtils]: 134: Hoare triple {104863#false} assume !false; {104863#false} is VALID [2022-04-28 06:01:17,042 INFO L134 CoverageAnalysis]: Checked inductivity of 514 backedges. 88 proven. 1 refuted. 0 times theorem prover too weak. 425 trivial. 0 not checked. [2022-04-28 06:01:17,042 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 06:01:19,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:01:19,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004129140] [2022-04-28 06:01:19,677 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:01:19,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [653877176] [2022-04-28 06:01:19,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [653877176] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 06:01:19,677 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 06:01:19,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-28 06:01:19,677 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:01:19,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1567855746] [2022-04-28 06:01:19,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1567855746] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:01:19,677 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:01:19,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 06:01:19,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773225319] [2022-04-28 06:01:19,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:01:19,678 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 135 [2022-04-28 06:01:19,678 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:01:19,678 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 06:01:19,729 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:01:19,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 06:01:19,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:01:19,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 06:01:19,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=84, Unknown=1, NotChecked=0, Total=110 [2022-04-28 06:01:19,730 INFO L87 Difference]: Start difference. First operand 706 states and 952 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 06:01:21,929 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 06:01:25,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:01:25,739 INFO L93 Difference]: Finished difference Result 758 states and 1028 transitions. [2022-04-28 06:01:25,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 06:01:25,740 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 135 [2022-04-28 06:01:25,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:01:25,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 06:01:25,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 79 transitions. [2022-04-28 06:01:25,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 06:01:25,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 79 transitions. [2022-04-28 06:01:25,742 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 79 transitions. [2022-04-28 06:01:25,819 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:01:25,841 INFO L225 Difference]: With dead ends: 758 [2022-04-28 06:01:25,841 INFO L226 Difference]: Without dead ends: 746 [2022-04-28 06:01:25,841 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 132 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=43, Invalid=138, Unknown=1, NotChecked=0, Total=182 [2022-04-28 06:01:25,842 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 27 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 06:01:25,842 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 295 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 172 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 06:01:25,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2022-04-28 06:01:28,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 683. [2022-04-28 06:01:28,130 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:01:28,131 INFO L82 GeneralOperation]: Start isEquivalent. First operand 746 states. Second operand has 683 states, 515 states have (on average 1.192233009708738) internal successors, (614), 522 states have internal predecessors, (614), 150 states have call successors, (150), 19 states have call predecessors, (150), 17 states have return successors, (148), 141 states have call predecessors, (148), 148 states have call successors, (148) [2022-04-28 06:01:28,132 INFO L74 IsIncluded]: Start isIncluded. First operand 746 states. Second operand has 683 states, 515 states have (on average 1.192233009708738) internal successors, (614), 522 states have internal predecessors, (614), 150 states have call successors, (150), 19 states have call predecessors, (150), 17 states have return successors, (148), 141 states have call predecessors, (148), 148 states have call successors, (148) [2022-04-28 06:01:28,132 INFO L87 Difference]: Start difference. First operand 746 states. Second operand has 683 states, 515 states have (on average 1.192233009708738) internal successors, (614), 522 states have internal predecessors, (614), 150 states have call successors, (150), 19 states have call predecessors, (150), 17 states have return successors, (148), 141 states have call predecessors, (148), 148 states have call successors, (148) [2022-04-28 06:01:28,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:01:28,151 INFO L93 Difference]: Finished difference Result 746 states and 1010 transitions. [2022-04-28 06:01:28,151 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1010 transitions. [2022-04-28 06:01:28,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:01:28,152 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:01:28,153 INFO L74 IsIncluded]: Start isIncluded. First operand has 683 states, 515 states have (on average 1.192233009708738) internal successors, (614), 522 states have internal predecessors, (614), 150 states have call successors, (150), 19 states have call predecessors, (150), 17 states have return successors, (148), 141 states have call predecessors, (148), 148 states have call successors, (148) Second operand 746 states. [2022-04-28 06:01:28,153 INFO L87 Difference]: Start difference. First operand has 683 states, 515 states have (on average 1.192233009708738) internal successors, (614), 522 states have internal predecessors, (614), 150 states have call successors, (150), 19 states have call predecessors, (150), 17 states have return successors, (148), 141 states have call predecessors, (148), 148 states have call successors, (148) Second operand 746 states. [2022-04-28 06:01:28,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:01:28,172 INFO L93 Difference]: Finished difference Result 746 states and 1010 transitions. [2022-04-28 06:01:28,172 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1010 transitions. [2022-04-28 06:01:28,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:01:28,173 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:01:28,173 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:01:28,173 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:01:28,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 683 states, 515 states have (on average 1.192233009708738) internal successors, (614), 522 states have internal predecessors, (614), 150 states have call successors, (150), 19 states have call predecessors, (150), 17 states have return successors, (148), 141 states have call predecessors, (148), 148 states have call successors, (148) [2022-04-28 06:01:28,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 912 transitions. [2022-04-28 06:01:28,194 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 912 transitions. Word has length 135 [2022-04-28 06:01:28,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:01:28,195 INFO L495 AbstractCegarLoop]: Abstraction has 683 states and 912 transitions. [2022-04-28 06:01:28,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 06:01:28,195 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 683 states and 912 transitions. [2022-04-28 06:01:33,684 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 912 edges. 911 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 06:01:33,684 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 912 transitions. [2022-04-28 06:01:33,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-04-28 06:01:33,686 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:01:33,686 INFO L195 NwaCegarLoop]: trace histogram [15, 14, 14, 8, 8, 8, 8, 6, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:01:33,691 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Forceful destruction successful, exit code 0 [2022-04-28 06:01:33,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2022-04-28 06:01:33,886 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:01:33,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:01:33,887 INFO L85 PathProgramCache]: Analyzing trace with hash 200539575, now seen corresponding path program 13 times [2022-04-28 06:01:33,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:01:33,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1800644414] [2022-04-28 06:01:33,887 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 06:01:33,887 INFO L85 PathProgramCache]: Analyzing trace with hash 200539575, now seen corresponding path program 14 times [2022-04-28 06:01:33,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:01:33,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502118643] [2022-04-28 06:01:33,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:01:33,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:01:33,904 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:01:33,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [31580034] [2022-04-28 06:01:33,904 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 06:01:33,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:01:33,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:01:33,905 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:01:33,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2022-04-28 06:01:34,007 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 06:01:34,007 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:01:34,009 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-28 06:01:34,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:01:34,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:01:34,892 INFO L272 TraceCheckUtils]: 0: Hoare triple {109682#true} call ULTIMATE.init(); {109682#true} is VALID [2022-04-28 06:01:34,893 INFO L290 TraceCheckUtils]: 1: Hoare triple {109682#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {109690#(<= ~counter~0 0)} is VALID [2022-04-28 06:01:34,893 INFO L290 TraceCheckUtils]: 2: Hoare triple {109690#(<= ~counter~0 0)} assume true; {109690#(<= ~counter~0 0)} is VALID [2022-04-28 06:01:34,894 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {109690#(<= ~counter~0 0)} {109682#true} #102#return; {109690#(<= ~counter~0 0)} is VALID [2022-04-28 06:01:34,894 INFO L272 TraceCheckUtils]: 4: Hoare triple {109690#(<= ~counter~0 0)} call #t~ret9 := main(); {109690#(<= ~counter~0 0)} is VALID [2022-04-28 06:01:34,894 INFO L290 TraceCheckUtils]: 5: Hoare triple {109690#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {109690#(<= ~counter~0 0)} is VALID [2022-04-28 06:01:34,895 INFO L272 TraceCheckUtils]: 6: Hoare triple {109690#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {109690#(<= ~counter~0 0)} is VALID [2022-04-28 06:01:34,895 INFO L290 TraceCheckUtils]: 7: Hoare triple {109690#(<= ~counter~0 0)} ~cond := #in~cond; {109690#(<= ~counter~0 0)} is VALID [2022-04-28 06:01:34,896 INFO L290 TraceCheckUtils]: 8: Hoare triple {109690#(<= ~counter~0 0)} assume !(0 == ~cond); {109690#(<= ~counter~0 0)} is VALID [2022-04-28 06:01:34,896 INFO L290 TraceCheckUtils]: 9: Hoare triple {109690#(<= ~counter~0 0)} assume true; {109690#(<= ~counter~0 0)} is VALID [2022-04-28 06:01:34,896 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {109690#(<= ~counter~0 0)} {109690#(<= ~counter~0 0)} #90#return; {109690#(<= ~counter~0 0)} is VALID [2022-04-28 06:01:34,897 INFO L272 TraceCheckUtils]: 11: Hoare triple {109690#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {109690#(<= ~counter~0 0)} is VALID [2022-04-28 06:01:34,897 INFO L290 TraceCheckUtils]: 12: Hoare triple {109690#(<= ~counter~0 0)} ~cond := #in~cond; {109690#(<= ~counter~0 0)} is VALID [2022-04-28 06:01:34,898 INFO L290 TraceCheckUtils]: 13: Hoare triple {109690#(<= ~counter~0 0)} assume !(0 == ~cond); {109690#(<= ~counter~0 0)} is VALID [2022-04-28 06:01:34,898 INFO L290 TraceCheckUtils]: 14: Hoare triple {109690#(<= ~counter~0 0)} assume true; {109690#(<= ~counter~0 0)} is VALID [2022-04-28 06:01:34,898 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {109690#(<= ~counter~0 0)} {109690#(<= ~counter~0 0)} #92#return; {109690#(<= ~counter~0 0)} is VALID [2022-04-28 06:01:34,899 INFO L290 TraceCheckUtils]: 16: Hoare triple {109690#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {109690#(<= ~counter~0 0)} is VALID [2022-04-28 06:01:34,901 INFO L290 TraceCheckUtils]: 17: Hoare triple {109690#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {109739#(<= ~counter~0 1)} is VALID [2022-04-28 06:01:34,902 INFO L290 TraceCheckUtils]: 18: Hoare triple {109739#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {109739#(<= ~counter~0 1)} is VALID [2022-04-28 06:01:34,902 INFO L272 TraceCheckUtils]: 19: Hoare triple {109739#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {109739#(<= ~counter~0 1)} is VALID [2022-04-28 06:01:34,903 INFO L290 TraceCheckUtils]: 20: Hoare triple {109739#(<= ~counter~0 1)} ~cond := #in~cond; {109739#(<= ~counter~0 1)} is VALID [2022-04-28 06:01:34,903 INFO L290 TraceCheckUtils]: 21: Hoare triple {109739#(<= ~counter~0 1)} assume !(0 == ~cond); {109739#(<= ~counter~0 1)} is VALID [2022-04-28 06:01:34,903 INFO L290 TraceCheckUtils]: 22: Hoare triple {109739#(<= ~counter~0 1)} assume true; {109739#(<= ~counter~0 1)} is VALID [2022-04-28 06:01:34,904 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {109739#(<= ~counter~0 1)} {109739#(<= ~counter~0 1)} #94#return; {109739#(<= ~counter~0 1)} is VALID [2022-04-28 06:01:34,904 INFO L290 TraceCheckUtils]: 24: Hoare triple {109739#(<= ~counter~0 1)} assume !!(0 != ~r~0); {109739#(<= ~counter~0 1)} is VALID [2022-04-28 06:01:34,905 INFO L290 TraceCheckUtils]: 25: Hoare triple {109739#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {109764#(<= ~counter~0 2)} is VALID [2022-04-28 06:01:34,906 INFO L290 TraceCheckUtils]: 26: Hoare triple {109764#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {109764#(<= ~counter~0 2)} is VALID [2022-04-28 06:01:34,906 INFO L272 TraceCheckUtils]: 27: Hoare triple {109764#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {109764#(<= ~counter~0 2)} is VALID [2022-04-28 06:01:34,907 INFO L290 TraceCheckUtils]: 28: Hoare triple {109764#(<= ~counter~0 2)} ~cond := #in~cond; {109764#(<= ~counter~0 2)} is VALID [2022-04-28 06:01:34,907 INFO L290 TraceCheckUtils]: 29: Hoare triple {109764#(<= ~counter~0 2)} assume !(0 == ~cond); {109764#(<= ~counter~0 2)} is VALID [2022-04-28 06:01:34,907 INFO L290 TraceCheckUtils]: 30: Hoare triple {109764#(<= ~counter~0 2)} assume true; {109764#(<= ~counter~0 2)} is VALID [2022-04-28 06:01:34,908 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {109764#(<= ~counter~0 2)} {109764#(<= ~counter~0 2)} #96#return; {109764#(<= ~counter~0 2)} is VALID [2022-04-28 06:01:34,908 INFO L290 TraceCheckUtils]: 32: Hoare triple {109764#(<= ~counter~0 2)} assume !(~r~0 > 0); {109764#(<= ~counter~0 2)} is VALID [2022-04-28 06:01:34,910 INFO L290 TraceCheckUtils]: 33: Hoare triple {109764#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {109789#(<= ~counter~0 3)} is VALID [2022-04-28 06:01:34,910 INFO L290 TraceCheckUtils]: 34: Hoare triple {109789#(<= ~counter~0 3)} assume !!(#t~post8 < 20);havoc #t~post8; {109789#(<= ~counter~0 3)} is VALID [2022-04-28 06:01:34,911 INFO L272 TraceCheckUtils]: 35: Hoare triple {109789#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {109789#(<= ~counter~0 3)} is VALID [2022-04-28 06:01:34,911 INFO L290 TraceCheckUtils]: 36: Hoare triple {109789#(<= ~counter~0 3)} ~cond := #in~cond; {109789#(<= ~counter~0 3)} is VALID [2022-04-28 06:01:34,911 INFO L290 TraceCheckUtils]: 37: Hoare triple {109789#(<= ~counter~0 3)} assume !(0 == ~cond); {109789#(<= ~counter~0 3)} is VALID [2022-04-28 06:01:34,912 INFO L290 TraceCheckUtils]: 38: Hoare triple {109789#(<= ~counter~0 3)} assume true; {109789#(<= ~counter~0 3)} is VALID [2022-04-28 06:01:34,912 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {109789#(<= ~counter~0 3)} {109789#(<= ~counter~0 3)} #98#return; {109789#(<= ~counter~0 3)} is VALID [2022-04-28 06:01:34,912 INFO L290 TraceCheckUtils]: 40: Hoare triple {109789#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {109789#(<= ~counter~0 3)} is VALID [2022-04-28 06:01:34,914 INFO L290 TraceCheckUtils]: 41: Hoare triple {109789#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {109814#(<= ~counter~0 4)} is VALID [2022-04-28 06:01:34,915 INFO L290 TraceCheckUtils]: 42: Hoare triple {109814#(<= ~counter~0 4)} assume !!(#t~post8 < 20);havoc #t~post8; {109814#(<= ~counter~0 4)} is VALID [2022-04-28 06:01:34,915 INFO L272 TraceCheckUtils]: 43: Hoare triple {109814#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {109814#(<= ~counter~0 4)} is VALID [2022-04-28 06:01:34,916 INFO L290 TraceCheckUtils]: 44: Hoare triple {109814#(<= ~counter~0 4)} ~cond := #in~cond; {109814#(<= ~counter~0 4)} is VALID [2022-04-28 06:01:34,916 INFO L290 TraceCheckUtils]: 45: Hoare triple {109814#(<= ~counter~0 4)} assume !(0 == ~cond); {109814#(<= ~counter~0 4)} is VALID [2022-04-28 06:01:34,916 INFO L290 TraceCheckUtils]: 46: Hoare triple {109814#(<= ~counter~0 4)} assume true; {109814#(<= ~counter~0 4)} is VALID [2022-04-28 06:01:34,917 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {109814#(<= ~counter~0 4)} {109814#(<= ~counter~0 4)} #98#return; {109814#(<= ~counter~0 4)} is VALID [2022-04-28 06:01:34,917 INFO L290 TraceCheckUtils]: 48: Hoare triple {109814#(<= ~counter~0 4)} assume !(~r~0 < 0); {109814#(<= ~counter~0 4)} is VALID [2022-04-28 06:01:34,918 INFO L290 TraceCheckUtils]: 49: Hoare triple {109814#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {109839#(<= ~counter~0 5)} is VALID [2022-04-28 06:01:34,919 INFO L290 TraceCheckUtils]: 50: Hoare triple {109839#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {109839#(<= ~counter~0 5)} is VALID [2022-04-28 06:01:34,919 INFO L272 TraceCheckUtils]: 51: Hoare triple {109839#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {109839#(<= ~counter~0 5)} is VALID [2022-04-28 06:01:34,920 INFO L290 TraceCheckUtils]: 52: Hoare triple {109839#(<= ~counter~0 5)} ~cond := #in~cond; {109839#(<= ~counter~0 5)} is VALID [2022-04-28 06:01:34,920 INFO L290 TraceCheckUtils]: 53: Hoare triple {109839#(<= ~counter~0 5)} assume !(0 == ~cond); {109839#(<= ~counter~0 5)} is VALID [2022-04-28 06:01:34,920 INFO L290 TraceCheckUtils]: 54: Hoare triple {109839#(<= ~counter~0 5)} assume true; {109839#(<= ~counter~0 5)} is VALID [2022-04-28 06:01:34,921 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {109839#(<= ~counter~0 5)} {109839#(<= ~counter~0 5)} #94#return; {109839#(<= ~counter~0 5)} is VALID [2022-04-28 06:01:34,921 INFO L290 TraceCheckUtils]: 56: Hoare triple {109839#(<= ~counter~0 5)} assume !!(0 != ~r~0); {109839#(<= ~counter~0 5)} is VALID [2022-04-28 06:01:34,923 INFO L290 TraceCheckUtils]: 57: Hoare triple {109839#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {109864#(<= ~counter~0 6)} is VALID [2022-04-28 06:01:34,923 INFO L290 TraceCheckUtils]: 58: Hoare triple {109864#(<= ~counter~0 6)} assume !!(#t~post7 < 20);havoc #t~post7; {109864#(<= ~counter~0 6)} is VALID [2022-04-28 06:01:34,923 INFO L272 TraceCheckUtils]: 59: Hoare triple {109864#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {109864#(<= ~counter~0 6)} is VALID [2022-04-28 06:01:34,924 INFO L290 TraceCheckUtils]: 60: Hoare triple {109864#(<= ~counter~0 6)} ~cond := #in~cond; {109864#(<= ~counter~0 6)} is VALID [2022-04-28 06:01:34,924 INFO L290 TraceCheckUtils]: 61: Hoare triple {109864#(<= ~counter~0 6)} assume !(0 == ~cond); {109864#(<= ~counter~0 6)} is VALID [2022-04-28 06:01:34,924 INFO L290 TraceCheckUtils]: 62: Hoare triple {109864#(<= ~counter~0 6)} assume true; {109864#(<= ~counter~0 6)} is VALID [2022-04-28 06:01:34,925 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {109864#(<= ~counter~0 6)} {109864#(<= ~counter~0 6)} #96#return; {109864#(<= ~counter~0 6)} is VALID [2022-04-28 06:01:34,925 INFO L290 TraceCheckUtils]: 64: Hoare triple {109864#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {109864#(<= ~counter~0 6)} is VALID [2022-04-28 06:01:34,927 INFO L290 TraceCheckUtils]: 65: Hoare triple {109864#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {109889#(<= ~counter~0 7)} is VALID [2022-04-28 06:01:34,927 INFO L290 TraceCheckUtils]: 66: Hoare triple {109889#(<= ~counter~0 7)} assume !!(#t~post7 < 20);havoc #t~post7; {109889#(<= ~counter~0 7)} is VALID [2022-04-28 06:01:34,927 INFO L272 TraceCheckUtils]: 67: Hoare triple {109889#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {109889#(<= ~counter~0 7)} is VALID [2022-04-28 06:01:34,928 INFO L290 TraceCheckUtils]: 68: Hoare triple {109889#(<= ~counter~0 7)} ~cond := #in~cond; {109889#(<= ~counter~0 7)} is VALID [2022-04-28 06:01:34,928 INFO L290 TraceCheckUtils]: 69: Hoare triple {109889#(<= ~counter~0 7)} assume !(0 == ~cond); {109889#(<= ~counter~0 7)} is VALID [2022-04-28 06:01:34,928 INFO L290 TraceCheckUtils]: 70: Hoare triple {109889#(<= ~counter~0 7)} assume true; {109889#(<= ~counter~0 7)} is VALID [2022-04-28 06:01:34,929 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {109889#(<= ~counter~0 7)} {109889#(<= ~counter~0 7)} #96#return; {109889#(<= ~counter~0 7)} is VALID [2022-04-28 06:01:34,929 INFO L290 TraceCheckUtils]: 72: Hoare triple {109889#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {109889#(<= ~counter~0 7)} is VALID [2022-04-28 06:01:34,930 INFO L290 TraceCheckUtils]: 73: Hoare triple {109889#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {109914#(<= ~counter~0 8)} is VALID [2022-04-28 06:01:34,931 INFO L290 TraceCheckUtils]: 74: Hoare triple {109914#(<= ~counter~0 8)} assume !!(#t~post7 < 20);havoc #t~post7; {109914#(<= ~counter~0 8)} is VALID [2022-04-28 06:01:34,931 INFO L272 TraceCheckUtils]: 75: Hoare triple {109914#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {109914#(<= ~counter~0 8)} is VALID [2022-04-28 06:01:34,932 INFO L290 TraceCheckUtils]: 76: Hoare triple {109914#(<= ~counter~0 8)} ~cond := #in~cond; {109914#(<= ~counter~0 8)} is VALID [2022-04-28 06:01:34,932 INFO L290 TraceCheckUtils]: 77: Hoare triple {109914#(<= ~counter~0 8)} assume !(0 == ~cond); {109914#(<= ~counter~0 8)} is VALID [2022-04-28 06:01:34,932 INFO L290 TraceCheckUtils]: 78: Hoare triple {109914#(<= ~counter~0 8)} assume true; {109914#(<= ~counter~0 8)} is VALID [2022-04-28 06:01:34,933 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {109914#(<= ~counter~0 8)} {109914#(<= ~counter~0 8)} #96#return; {109914#(<= ~counter~0 8)} is VALID [2022-04-28 06:01:34,933 INFO L290 TraceCheckUtils]: 80: Hoare triple {109914#(<= ~counter~0 8)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {109914#(<= ~counter~0 8)} is VALID [2022-04-28 06:01:34,935 INFO L290 TraceCheckUtils]: 81: Hoare triple {109914#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {109939#(<= ~counter~0 9)} is VALID [2022-04-28 06:01:34,935 INFO L290 TraceCheckUtils]: 82: Hoare triple {109939#(<= ~counter~0 9)} assume !!(#t~post7 < 20);havoc #t~post7; {109939#(<= ~counter~0 9)} is VALID [2022-04-28 06:01:34,936 INFO L272 TraceCheckUtils]: 83: Hoare triple {109939#(<= ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {109939#(<= ~counter~0 9)} is VALID [2022-04-28 06:01:34,936 INFO L290 TraceCheckUtils]: 84: Hoare triple {109939#(<= ~counter~0 9)} ~cond := #in~cond; {109939#(<= ~counter~0 9)} is VALID [2022-04-28 06:01:34,936 INFO L290 TraceCheckUtils]: 85: Hoare triple {109939#(<= ~counter~0 9)} assume !(0 == ~cond); {109939#(<= ~counter~0 9)} is VALID [2022-04-28 06:01:34,936 INFO L290 TraceCheckUtils]: 86: Hoare triple {109939#(<= ~counter~0 9)} assume true; {109939#(<= ~counter~0 9)} is VALID [2022-04-28 06:01:34,937 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {109939#(<= ~counter~0 9)} {109939#(<= ~counter~0 9)} #96#return; {109939#(<= ~counter~0 9)} is VALID [2022-04-28 06:01:34,937 INFO L290 TraceCheckUtils]: 88: Hoare triple {109939#(<= ~counter~0 9)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {109939#(<= ~counter~0 9)} is VALID [2022-04-28 06:01:34,939 INFO L290 TraceCheckUtils]: 89: Hoare triple {109939#(<= ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {109964#(<= ~counter~0 10)} is VALID [2022-04-28 06:01:34,939 INFO L290 TraceCheckUtils]: 90: Hoare triple {109964#(<= ~counter~0 10)} assume !!(#t~post7 < 20);havoc #t~post7; {109964#(<= ~counter~0 10)} is VALID [2022-04-28 06:01:34,939 INFO L272 TraceCheckUtils]: 91: Hoare triple {109964#(<= ~counter~0 10)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {109964#(<= ~counter~0 10)} is VALID [2022-04-28 06:01:34,940 INFO L290 TraceCheckUtils]: 92: Hoare triple {109964#(<= ~counter~0 10)} ~cond := #in~cond; {109964#(<= ~counter~0 10)} is VALID [2022-04-28 06:01:34,940 INFO L290 TraceCheckUtils]: 93: Hoare triple {109964#(<= ~counter~0 10)} assume !(0 == ~cond); {109964#(<= ~counter~0 10)} is VALID [2022-04-28 06:01:34,940 INFO L290 TraceCheckUtils]: 94: Hoare triple {109964#(<= ~counter~0 10)} assume true; {109964#(<= ~counter~0 10)} is VALID [2022-04-28 06:01:34,941 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {109964#(<= ~counter~0 10)} {109964#(<= ~counter~0 10)} #96#return; {109964#(<= ~counter~0 10)} is VALID [2022-04-28 06:01:34,941 INFO L290 TraceCheckUtils]: 96: Hoare triple {109964#(<= ~counter~0 10)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {109964#(<= ~counter~0 10)} is VALID [2022-04-28 06:01:34,943 INFO L290 TraceCheckUtils]: 97: Hoare triple {109964#(<= ~counter~0 10)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {109989#(<= ~counter~0 11)} is VALID [2022-04-28 06:01:34,943 INFO L290 TraceCheckUtils]: 98: Hoare triple {109989#(<= ~counter~0 11)} assume !!(#t~post7 < 20);havoc #t~post7; {109989#(<= ~counter~0 11)} is VALID [2022-04-28 06:01:34,944 INFO L272 TraceCheckUtils]: 99: Hoare triple {109989#(<= ~counter~0 11)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {109989#(<= ~counter~0 11)} is VALID [2022-04-28 06:01:34,944 INFO L290 TraceCheckUtils]: 100: Hoare triple {109989#(<= ~counter~0 11)} ~cond := #in~cond; {109989#(<= ~counter~0 11)} is VALID [2022-04-28 06:01:34,944 INFO L290 TraceCheckUtils]: 101: Hoare triple {109989#(<= ~counter~0 11)} assume !(0 == ~cond); {109989#(<= ~counter~0 11)} is VALID [2022-04-28 06:01:34,945 INFO L290 TraceCheckUtils]: 102: Hoare triple {109989#(<= ~counter~0 11)} assume true; {109989#(<= ~counter~0 11)} is VALID [2022-04-28 06:01:34,945 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {109989#(<= ~counter~0 11)} {109989#(<= ~counter~0 11)} #96#return; {109989#(<= ~counter~0 11)} is VALID [2022-04-28 06:01:34,946 INFO L290 TraceCheckUtils]: 104: Hoare triple {109989#(<= ~counter~0 11)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {109989#(<= ~counter~0 11)} is VALID [2022-04-28 06:01:34,947 INFO L290 TraceCheckUtils]: 105: Hoare triple {109989#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {110014#(<= ~counter~0 12)} is VALID [2022-04-28 06:01:34,947 INFO L290 TraceCheckUtils]: 106: Hoare triple {110014#(<= ~counter~0 12)} assume !!(#t~post7 < 20);havoc #t~post7; {110014#(<= ~counter~0 12)} is VALID [2022-04-28 06:01:34,948 INFO L272 TraceCheckUtils]: 107: Hoare triple {110014#(<= ~counter~0 12)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {110014#(<= ~counter~0 12)} is VALID [2022-04-28 06:01:34,948 INFO L290 TraceCheckUtils]: 108: Hoare triple {110014#(<= ~counter~0 12)} ~cond := #in~cond; {110014#(<= ~counter~0 12)} is VALID [2022-04-28 06:01:34,949 INFO L290 TraceCheckUtils]: 109: Hoare triple {110014#(<= ~counter~0 12)} assume !(0 == ~cond); {110014#(<= ~counter~0 12)} is VALID [2022-04-28 06:01:34,949 INFO L290 TraceCheckUtils]: 110: Hoare triple {110014#(<= ~counter~0 12)} assume true; {110014#(<= ~counter~0 12)} is VALID [2022-04-28 06:01:34,950 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {110014#(<= ~counter~0 12)} {110014#(<= ~counter~0 12)} #96#return; {110014#(<= ~counter~0 12)} is VALID [2022-04-28 06:01:34,950 INFO L290 TraceCheckUtils]: 112: Hoare triple {110014#(<= ~counter~0 12)} assume !(~r~0 > 0); {110014#(<= ~counter~0 12)} is VALID [2022-04-28 06:01:34,952 INFO L290 TraceCheckUtils]: 113: Hoare triple {110014#(<= ~counter~0 12)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {110039#(<= ~counter~0 13)} is VALID [2022-04-28 06:01:34,952 INFO L290 TraceCheckUtils]: 114: Hoare triple {110039#(<= ~counter~0 13)} assume !!(#t~post8 < 20);havoc #t~post8; {110039#(<= ~counter~0 13)} is VALID [2022-04-28 06:01:34,953 INFO L272 TraceCheckUtils]: 115: Hoare triple {110039#(<= ~counter~0 13)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {110039#(<= ~counter~0 13)} is VALID [2022-04-28 06:01:34,953 INFO L290 TraceCheckUtils]: 116: Hoare triple {110039#(<= ~counter~0 13)} ~cond := #in~cond; {110039#(<= ~counter~0 13)} is VALID [2022-04-28 06:01:34,953 INFO L290 TraceCheckUtils]: 117: Hoare triple {110039#(<= ~counter~0 13)} assume !(0 == ~cond); {110039#(<= ~counter~0 13)} is VALID [2022-04-28 06:01:34,954 INFO L290 TraceCheckUtils]: 118: Hoare triple {110039#(<= ~counter~0 13)} assume true; {110039#(<= ~counter~0 13)} is VALID [2022-04-28 06:01:34,954 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {110039#(<= ~counter~0 13)} {110039#(<= ~counter~0 13)} #98#return; {110039#(<= ~counter~0 13)} is VALID [2022-04-28 06:01:34,954 INFO L290 TraceCheckUtils]: 120: Hoare triple {110039#(<= ~counter~0 13)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {110039#(<= ~counter~0 13)} is VALID [2022-04-28 06:01:34,957 INFO L290 TraceCheckUtils]: 121: Hoare triple {110039#(<= ~counter~0 13)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {110064#(<= ~counter~0 14)} is VALID [2022-04-28 06:01:34,957 INFO L290 TraceCheckUtils]: 122: Hoare triple {110064#(<= ~counter~0 14)} assume !!(#t~post8 < 20);havoc #t~post8; {110064#(<= ~counter~0 14)} is VALID [2022-04-28 06:01:34,958 INFO L272 TraceCheckUtils]: 123: Hoare triple {110064#(<= ~counter~0 14)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {110064#(<= ~counter~0 14)} is VALID [2022-04-28 06:01:34,958 INFO L290 TraceCheckUtils]: 124: Hoare triple {110064#(<= ~counter~0 14)} ~cond := #in~cond; {110064#(<= ~counter~0 14)} is VALID [2022-04-28 06:01:34,958 INFO L290 TraceCheckUtils]: 125: Hoare triple {110064#(<= ~counter~0 14)} assume !(0 == ~cond); {110064#(<= ~counter~0 14)} is VALID [2022-04-28 06:01:34,959 INFO L290 TraceCheckUtils]: 126: Hoare triple {110064#(<= ~counter~0 14)} assume true; {110064#(<= ~counter~0 14)} is VALID [2022-04-28 06:01:34,959 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {110064#(<= ~counter~0 14)} {110064#(<= ~counter~0 14)} #98#return; {110064#(<= ~counter~0 14)} is VALID [2022-04-28 06:01:34,959 INFO L290 TraceCheckUtils]: 128: Hoare triple {110064#(<= ~counter~0 14)} assume !(~r~0 < 0); {110064#(<= ~counter~0 14)} is VALID [2022-04-28 06:01:34,960 INFO L290 TraceCheckUtils]: 129: Hoare triple {110064#(<= ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {110089#(<= |main_#t~post6| 14)} is VALID [2022-04-28 06:01:34,960 INFO L290 TraceCheckUtils]: 130: Hoare triple {110089#(<= |main_#t~post6| 14)} assume !(#t~post6 < 20);havoc #t~post6; {109683#false} is VALID [2022-04-28 06:01:34,960 INFO L272 TraceCheckUtils]: 131: Hoare triple {109683#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {109683#false} is VALID [2022-04-28 06:01:34,960 INFO L290 TraceCheckUtils]: 132: Hoare triple {109683#false} ~cond := #in~cond; {109683#false} is VALID [2022-04-28 06:01:34,961 INFO L290 TraceCheckUtils]: 133: Hoare triple {109683#false} assume 0 == ~cond; {109683#false} is VALID [2022-04-28 06:01:34,961 INFO L290 TraceCheckUtils]: 134: Hoare triple {109683#false} assume !false; {109683#false} is VALID [2022-04-28 06:01:34,961 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 28 proven. 508 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 06:01:34,961 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 06:01:35,746 INFO L290 TraceCheckUtils]: 134: Hoare triple {109683#false} assume !false; {109683#false} is VALID [2022-04-28 06:01:35,747 INFO L290 TraceCheckUtils]: 133: Hoare triple {109683#false} assume 0 == ~cond; {109683#false} is VALID [2022-04-28 06:01:35,747 INFO L290 TraceCheckUtils]: 132: Hoare triple {109683#false} ~cond := #in~cond; {109683#false} is VALID [2022-04-28 06:01:35,747 INFO L272 TraceCheckUtils]: 131: Hoare triple {109683#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {109683#false} is VALID [2022-04-28 06:01:35,747 INFO L290 TraceCheckUtils]: 130: Hoare triple {110117#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {109683#false} is VALID [2022-04-28 06:01:35,747 INFO L290 TraceCheckUtils]: 129: Hoare triple {110121#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {110117#(< |main_#t~post6| 20)} is VALID [2022-04-28 06:01:35,748 INFO L290 TraceCheckUtils]: 128: Hoare triple {110121#(< ~counter~0 20)} assume !(~r~0 < 0); {110121#(< ~counter~0 20)} is VALID [2022-04-28 06:01:35,748 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {109682#true} {110121#(< ~counter~0 20)} #98#return; {110121#(< ~counter~0 20)} is VALID [2022-04-28 06:01:35,749 INFO L290 TraceCheckUtils]: 126: Hoare triple {109682#true} assume true; {109682#true} is VALID [2022-04-28 06:01:35,749 INFO L290 TraceCheckUtils]: 125: Hoare triple {109682#true} assume !(0 == ~cond); {109682#true} is VALID [2022-04-28 06:01:35,749 INFO L290 TraceCheckUtils]: 124: Hoare triple {109682#true} ~cond := #in~cond; {109682#true} is VALID [2022-04-28 06:01:35,749 INFO L272 TraceCheckUtils]: 123: Hoare triple {110121#(< ~counter~0 20)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {109682#true} is VALID [2022-04-28 06:01:35,749 INFO L290 TraceCheckUtils]: 122: Hoare triple {110121#(< ~counter~0 20)} assume !!(#t~post8 < 20);havoc #t~post8; {110121#(< ~counter~0 20)} is VALID [2022-04-28 06:01:35,751 INFO L290 TraceCheckUtils]: 121: Hoare triple {110146#(< ~counter~0 19)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {110121#(< ~counter~0 20)} is VALID [2022-04-28 06:01:35,752 INFO L290 TraceCheckUtils]: 120: Hoare triple {110146#(< ~counter~0 19)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {110146#(< ~counter~0 19)} is VALID [2022-04-28 06:01:35,752 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {109682#true} {110146#(< ~counter~0 19)} #98#return; {110146#(< ~counter~0 19)} is VALID [2022-04-28 06:01:35,752 INFO L290 TraceCheckUtils]: 118: Hoare triple {109682#true} assume true; {109682#true} is VALID [2022-04-28 06:01:35,753 INFO L290 TraceCheckUtils]: 117: Hoare triple {109682#true} assume !(0 == ~cond); {109682#true} is VALID [2022-04-28 06:01:35,753 INFO L290 TraceCheckUtils]: 116: Hoare triple {109682#true} ~cond := #in~cond; {109682#true} is VALID [2022-04-28 06:01:35,753 INFO L272 TraceCheckUtils]: 115: Hoare triple {110146#(< ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {109682#true} is VALID [2022-04-28 06:01:35,753 INFO L290 TraceCheckUtils]: 114: Hoare triple {110146#(< ~counter~0 19)} assume !!(#t~post8 < 20);havoc #t~post8; {110146#(< ~counter~0 19)} is VALID [2022-04-28 06:01:35,754 INFO L290 TraceCheckUtils]: 113: Hoare triple {110171#(< ~counter~0 18)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {110146#(< ~counter~0 19)} is VALID [2022-04-28 06:01:35,754 INFO L290 TraceCheckUtils]: 112: Hoare triple {110171#(< ~counter~0 18)} assume !(~r~0 > 0); {110171#(< ~counter~0 18)} is VALID [2022-04-28 06:01:35,755 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {109682#true} {110171#(< ~counter~0 18)} #96#return; {110171#(< ~counter~0 18)} is VALID [2022-04-28 06:01:35,755 INFO L290 TraceCheckUtils]: 110: Hoare triple {109682#true} assume true; {109682#true} is VALID [2022-04-28 06:01:35,755 INFO L290 TraceCheckUtils]: 109: Hoare triple {109682#true} assume !(0 == ~cond); {109682#true} is VALID [2022-04-28 06:01:35,755 INFO L290 TraceCheckUtils]: 108: Hoare triple {109682#true} ~cond := #in~cond; {109682#true} is VALID [2022-04-28 06:01:35,755 INFO L272 TraceCheckUtils]: 107: Hoare triple {110171#(< ~counter~0 18)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {109682#true} is VALID [2022-04-28 06:01:35,756 INFO L290 TraceCheckUtils]: 106: Hoare triple {110171#(< ~counter~0 18)} assume !!(#t~post7 < 20);havoc #t~post7; {110171#(< ~counter~0 18)} is VALID [2022-04-28 06:01:35,757 INFO L290 TraceCheckUtils]: 105: Hoare triple {110196#(< ~counter~0 17)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {110171#(< ~counter~0 18)} is VALID [2022-04-28 06:01:35,757 INFO L290 TraceCheckUtils]: 104: Hoare triple {110196#(< ~counter~0 17)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {110196#(< ~counter~0 17)} is VALID [2022-04-28 06:01:35,758 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {109682#true} {110196#(< ~counter~0 17)} #96#return; {110196#(< ~counter~0 17)} is VALID [2022-04-28 06:01:35,758 INFO L290 TraceCheckUtils]: 102: Hoare triple {109682#true} assume true; {109682#true} is VALID [2022-04-28 06:01:35,758 INFO L290 TraceCheckUtils]: 101: Hoare triple {109682#true} assume !(0 == ~cond); {109682#true} is VALID [2022-04-28 06:01:35,758 INFO L290 TraceCheckUtils]: 100: Hoare triple {109682#true} ~cond := #in~cond; {109682#true} is VALID [2022-04-28 06:01:35,758 INFO L272 TraceCheckUtils]: 99: Hoare triple {110196#(< ~counter~0 17)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {109682#true} is VALID [2022-04-28 06:01:35,758 INFO L290 TraceCheckUtils]: 98: Hoare triple {110196#(< ~counter~0 17)} assume !!(#t~post7 < 20);havoc #t~post7; {110196#(< ~counter~0 17)} is VALID [2022-04-28 06:01:35,759 INFO L290 TraceCheckUtils]: 97: Hoare triple {110221#(< ~counter~0 16)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {110196#(< ~counter~0 17)} is VALID [2022-04-28 06:01:35,760 INFO L290 TraceCheckUtils]: 96: Hoare triple {110221#(< ~counter~0 16)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {110221#(< ~counter~0 16)} is VALID [2022-04-28 06:01:35,760 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {109682#true} {110221#(< ~counter~0 16)} #96#return; {110221#(< ~counter~0 16)} is VALID [2022-04-28 06:01:35,760 INFO L290 TraceCheckUtils]: 94: Hoare triple {109682#true} assume true; {109682#true} is VALID [2022-04-28 06:01:35,760 INFO L290 TraceCheckUtils]: 93: Hoare triple {109682#true} assume !(0 == ~cond); {109682#true} is VALID [2022-04-28 06:01:35,760 INFO L290 TraceCheckUtils]: 92: Hoare triple {109682#true} ~cond := #in~cond; {109682#true} is VALID [2022-04-28 06:01:35,760 INFO L272 TraceCheckUtils]: 91: Hoare triple {110221#(< ~counter~0 16)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {109682#true} is VALID [2022-04-28 06:01:35,761 INFO L290 TraceCheckUtils]: 90: Hoare triple {110221#(< ~counter~0 16)} assume !!(#t~post7 < 20);havoc #t~post7; {110221#(< ~counter~0 16)} is VALID [2022-04-28 06:01:35,762 INFO L290 TraceCheckUtils]: 89: Hoare triple {110064#(<= ~counter~0 14)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {110221#(< ~counter~0 16)} is VALID [2022-04-28 06:01:35,762 INFO L290 TraceCheckUtils]: 88: Hoare triple {110064#(<= ~counter~0 14)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {110064#(<= ~counter~0 14)} is VALID [2022-04-28 06:01:35,763 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {109682#true} {110064#(<= ~counter~0 14)} #96#return; {110064#(<= ~counter~0 14)} is VALID [2022-04-28 06:01:35,763 INFO L290 TraceCheckUtils]: 86: Hoare triple {109682#true} assume true; {109682#true} is VALID [2022-04-28 06:01:35,763 INFO L290 TraceCheckUtils]: 85: Hoare triple {109682#true} assume !(0 == ~cond); {109682#true} is VALID [2022-04-28 06:01:35,763 INFO L290 TraceCheckUtils]: 84: Hoare triple {109682#true} ~cond := #in~cond; {109682#true} is VALID [2022-04-28 06:01:35,763 INFO L272 TraceCheckUtils]: 83: Hoare triple {110064#(<= ~counter~0 14)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {109682#true} is VALID [2022-04-28 06:01:35,763 INFO L290 TraceCheckUtils]: 82: Hoare triple {110064#(<= ~counter~0 14)} assume !!(#t~post7 < 20);havoc #t~post7; {110064#(<= ~counter~0 14)} is VALID [2022-04-28 06:01:35,764 INFO L290 TraceCheckUtils]: 81: Hoare triple {110039#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {110064#(<= ~counter~0 14)} is VALID [2022-04-28 06:01:35,765 INFO L290 TraceCheckUtils]: 80: Hoare triple {110039#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {110039#(<= ~counter~0 13)} is VALID [2022-04-28 06:01:35,783 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {109682#true} {110039#(<= ~counter~0 13)} #96#return; {110039#(<= ~counter~0 13)} is VALID [2022-04-28 06:01:35,783 INFO L290 TraceCheckUtils]: 78: Hoare triple {109682#true} assume true; {109682#true} is VALID [2022-04-28 06:01:35,783 INFO L290 TraceCheckUtils]: 77: Hoare triple {109682#true} assume !(0 == ~cond); {109682#true} is VALID [2022-04-28 06:01:35,783 INFO L290 TraceCheckUtils]: 76: Hoare triple {109682#true} ~cond := #in~cond; {109682#true} is VALID [2022-04-28 06:01:35,784 INFO L272 TraceCheckUtils]: 75: Hoare triple {110039#(<= ~counter~0 13)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {109682#true} is VALID [2022-04-28 06:01:35,784 INFO L290 TraceCheckUtils]: 74: Hoare triple {110039#(<= ~counter~0 13)} assume !!(#t~post7 < 20);havoc #t~post7; {110039#(<= ~counter~0 13)} is VALID [2022-04-28 06:01:35,786 INFO L290 TraceCheckUtils]: 73: Hoare triple {110014#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {110039#(<= ~counter~0 13)} is VALID [2022-04-28 06:01:35,787 INFO L290 TraceCheckUtils]: 72: Hoare triple {110014#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {110014#(<= ~counter~0 12)} is VALID [2022-04-28 06:01:35,787 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {109682#true} {110014#(<= ~counter~0 12)} #96#return; {110014#(<= ~counter~0 12)} is VALID [2022-04-28 06:01:35,788 INFO L290 TraceCheckUtils]: 70: Hoare triple {109682#true} assume true; {109682#true} is VALID [2022-04-28 06:01:35,788 INFO L290 TraceCheckUtils]: 69: Hoare triple {109682#true} assume !(0 == ~cond); {109682#true} is VALID [2022-04-28 06:01:35,788 INFO L290 TraceCheckUtils]: 68: Hoare triple {109682#true} ~cond := #in~cond; {109682#true} is VALID [2022-04-28 06:01:35,788 INFO L272 TraceCheckUtils]: 67: Hoare triple {110014#(<= ~counter~0 12)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {109682#true} is VALID [2022-04-28 06:01:35,788 INFO L290 TraceCheckUtils]: 66: Hoare triple {110014#(<= ~counter~0 12)} assume !!(#t~post7 < 20);havoc #t~post7; {110014#(<= ~counter~0 12)} is VALID [2022-04-28 06:01:35,789 INFO L290 TraceCheckUtils]: 65: Hoare triple {109989#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {110014#(<= ~counter~0 12)} is VALID [2022-04-28 06:01:35,790 INFO L290 TraceCheckUtils]: 64: Hoare triple {109989#(<= ~counter~0 11)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {109989#(<= ~counter~0 11)} is VALID [2022-04-28 06:01:35,790 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {109682#true} {109989#(<= ~counter~0 11)} #96#return; {109989#(<= ~counter~0 11)} is VALID [2022-04-28 06:01:35,790 INFO L290 TraceCheckUtils]: 62: Hoare triple {109682#true} assume true; {109682#true} is VALID [2022-04-28 06:01:35,790 INFO L290 TraceCheckUtils]: 61: Hoare triple {109682#true} assume !(0 == ~cond); {109682#true} is VALID [2022-04-28 06:01:35,790 INFO L290 TraceCheckUtils]: 60: Hoare triple {109682#true} ~cond := #in~cond; {109682#true} is VALID [2022-04-28 06:01:35,790 INFO L272 TraceCheckUtils]: 59: Hoare triple {109989#(<= ~counter~0 11)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {109682#true} is VALID [2022-04-28 06:01:35,791 INFO L290 TraceCheckUtils]: 58: Hoare triple {109989#(<= ~counter~0 11)} assume !!(#t~post7 < 20);havoc #t~post7; {109989#(<= ~counter~0 11)} is VALID [2022-04-28 06:01:35,792 INFO L290 TraceCheckUtils]: 57: Hoare triple {109964#(<= ~counter~0 10)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {109989#(<= ~counter~0 11)} is VALID [2022-04-28 06:01:35,792 INFO L290 TraceCheckUtils]: 56: Hoare triple {109964#(<= ~counter~0 10)} assume !!(0 != ~r~0); {109964#(<= ~counter~0 10)} is VALID [2022-04-28 06:01:35,793 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {109682#true} {109964#(<= ~counter~0 10)} #94#return; {109964#(<= ~counter~0 10)} is VALID [2022-04-28 06:01:35,793 INFO L290 TraceCheckUtils]: 54: Hoare triple {109682#true} assume true; {109682#true} is VALID [2022-04-28 06:01:35,793 INFO L290 TraceCheckUtils]: 53: Hoare triple {109682#true} assume !(0 == ~cond); {109682#true} is VALID [2022-04-28 06:01:35,793 INFO L290 TraceCheckUtils]: 52: Hoare triple {109682#true} ~cond := #in~cond; {109682#true} is VALID [2022-04-28 06:01:35,793 INFO L272 TraceCheckUtils]: 51: Hoare triple {109964#(<= ~counter~0 10)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {109682#true} is VALID [2022-04-28 06:01:35,794 INFO L290 TraceCheckUtils]: 50: Hoare triple {109964#(<= ~counter~0 10)} assume !!(#t~post6 < 20);havoc #t~post6; {109964#(<= ~counter~0 10)} is VALID [2022-04-28 06:01:35,795 INFO L290 TraceCheckUtils]: 49: Hoare triple {109939#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {109964#(<= ~counter~0 10)} is VALID [2022-04-28 06:01:35,795 INFO L290 TraceCheckUtils]: 48: Hoare triple {109939#(<= ~counter~0 9)} assume !(~r~0 < 0); {109939#(<= ~counter~0 9)} is VALID [2022-04-28 06:01:35,796 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {109682#true} {109939#(<= ~counter~0 9)} #98#return; {109939#(<= ~counter~0 9)} is VALID [2022-04-28 06:01:35,796 INFO L290 TraceCheckUtils]: 46: Hoare triple {109682#true} assume true; {109682#true} is VALID [2022-04-28 06:01:35,796 INFO L290 TraceCheckUtils]: 45: Hoare triple {109682#true} assume !(0 == ~cond); {109682#true} is VALID [2022-04-28 06:01:35,796 INFO L290 TraceCheckUtils]: 44: Hoare triple {109682#true} ~cond := #in~cond; {109682#true} is VALID [2022-04-28 06:01:35,796 INFO L272 TraceCheckUtils]: 43: Hoare triple {109939#(<= ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {109682#true} is VALID [2022-04-28 06:01:35,796 INFO L290 TraceCheckUtils]: 42: Hoare triple {109939#(<= ~counter~0 9)} assume !!(#t~post8 < 20);havoc #t~post8; {109939#(<= ~counter~0 9)} is VALID [2022-04-28 06:01:35,797 INFO L290 TraceCheckUtils]: 41: Hoare triple {109914#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {109939#(<= ~counter~0 9)} is VALID [2022-04-28 06:01:35,798 INFO L290 TraceCheckUtils]: 40: Hoare triple {109914#(<= ~counter~0 8)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {109914#(<= ~counter~0 8)} is VALID [2022-04-28 06:01:35,798 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {109682#true} {109914#(<= ~counter~0 8)} #98#return; {109914#(<= ~counter~0 8)} is VALID [2022-04-28 06:01:35,798 INFO L290 TraceCheckUtils]: 38: Hoare triple {109682#true} assume true; {109682#true} is VALID [2022-04-28 06:01:35,798 INFO L290 TraceCheckUtils]: 37: Hoare triple {109682#true} assume !(0 == ~cond); {109682#true} is VALID [2022-04-28 06:01:35,798 INFO L290 TraceCheckUtils]: 36: Hoare triple {109682#true} ~cond := #in~cond; {109682#true} is VALID [2022-04-28 06:01:35,799 INFO L272 TraceCheckUtils]: 35: Hoare triple {109914#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {109682#true} is VALID [2022-04-28 06:01:35,799 INFO L290 TraceCheckUtils]: 34: Hoare triple {109914#(<= ~counter~0 8)} assume !!(#t~post8 < 20);havoc #t~post8; {109914#(<= ~counter~0 8)} is VALID [2022-04-28 06:01:35,800 INFO L290 TraceCheckUtils]: 33: Hoare triple {109889#(<= ~counter~0 7)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {109914#(<= ~counter~0 8)} is VALID [2022-04-28 06:01:35,800 INFO L290 TraceCheckUtils]: 32: Hoare triple {109889#(<= ~counter~0 7)} assume !(~r~0 > 0); {109889#(<= ~counter~0 7)} is VALID [2022-04-28 06:01:35,801 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {109682#true} {109889#(<= ~counter~0 7)} #96#return; {109889#(<= ~counter~0 7)} is VALID [2022-04-28 06:01:35,801 INFO L290 TraceCheckUtils]: 30: Hoare triple {109682#true} assume true; {109682#true} is VALID [2022-04-28 06:01:35,801 INFO L290 TraceCheckUtils]: 29: Hoare triple {109682#true} assume !(0 == ~cond); {109682#true} is VALID [2022-04-28 06:01:35,801 INFO L290 TraceCheckUtils]: 28: Hoare triple {109682#true} ~cond := #in~cond; {109682#true} is VALID [2022-04-28 06:01:35,801 INFO L272 TraceCheckUtils]: 27: Hoare triple {109889#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {109682#true} is VALID [2022-04-28 06:01:35,801 INFO L290 TraceCheckUtils]: 26: Hoare triple {109889#(<= ~counter~0 7)} assume !!(#t~post7 < 20);havoc #t~post7; {109889#(<= ~counter~0 7)} is VALID [2022-04-28 06:01:35,802 INFO L290 TraceCheckUtils]: 25: Hoare triple {109864#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {109889#(<= ~counter~0 7)} is VALID [2022-04-28 06:01:35,803 INFO L290 TraceCheckUtils]: 24: Hoare triple {109864#(<= ~counter~0 6)} assume !!(0 != ~r~0); {109864#(<= ~counter~0 6)} is VALID [2022-04-28 06:01:35,803 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {109682#true} {109864#(<= ~counter~0 6)} #94#return; {109864#(<= ~counter~0 6)} is VALID [2022-04-28 06:01:35,803 INFO L290 TraceCheckUtils]: 22: Hoare triple {109682#true} assume true; {109682#true} is VALID [2022-04-28 06:01:35,804 INFO L290 TraceCheckUtils]: 21: Hoare triple {109682#true} assume !(0 == ~cond); {109682#true} is VALID [2022-04-28 06:01:35,804 INFO L290 TraceCheckUtils]: 20: Hoare triple {109682#true} ~cond := #in~cond; {109682#true} is VALID [2022-04-28 06:01:35,804 INFO L272 TraceCheckUtils]: 19: Hoare triple {109864#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {109682#true} is VALID [2022-04-28 06:01:35,804 INFO L290 TraceCheckUtils]: 18: Hoare triple {109864#(<= ~counter~0 6)} assume !!(#t~post6 < 20);havoc #t~post6; {109864#(<= ~counter~0 6)} is VALID [2022-04-28 06:01:35,805 INFO L290 TraceCheckUtils]: 17: Hoare triple {109839#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {109864#(<= ~counter~0 6)} is VALID [2022-04-28 06:01:35,805 INFO L290 TraceCheckUtils]: 16: Hoare triple {109839#(<= ~counter~0 5)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {109839#(<= ~counter~0 5)} is VALID [2022-04-28 06:01:35,806 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {109682#true} {109839#(<= ~counter~0 5)} #92#return; {109839#(<= ~counter~0 5)} is VALID [2022-04-28 06:01:35,806 INFO L290 TraceCheckUtils]: 14: Hoare triple {109682#true} assume true; {109682#true} is VALID [2022-04-28 06:01:35,806 INFO L290 TraceCheckUtils]: 13: Hoare triple {109682#true} assume !(0 == ~cond); {109682#true} is VALID [2022-04-28 06:01:35,806 INFO L290 TraceCheckUtils]: 12: Hoare triple {109682#true} ~cond := #in~cond; {109682#true} is VALID [2022-04-28 06:01:35,806 INFO L272 TraceCheckUtils]: 11: Hoare triple {109839#(<= ~counter~0 5)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {109682#true} is VALID [2022-04-28 06:01:35,807 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {109682#true} {109839#(<= ~counter~0 5)} #90#return; {109839#(<= ~counter~0 5)} is VALID [2022-04-28 06:01:35,807 INFO L290 TraceCheckUtils]: 9: Hoare triple {109682#true} assume true; {109682#true} is VALID [2022-04-28 06:01:35,807 INFO L290 TraceCheckUtils]: 8: Hoare triple {109682#true} assume !(0 == ~cond); {109682#true} is VALID [2022-04-28 06:01:35,807 INFO L290 TraceCheckUtils]: 7: Hoare triple {109682#true} ~cond := #in~cond; {109682#true} is VALID [2022-04-28 06:01:35,807 INFO L272 TraceCheckUtils]: 6: Hoare triple {109839#(<= ~counter~0 5)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {109682#true} is VALID [2022-04-28 06:01:35,807 INFO L290 TraceCheckUtils]: 5: Hoare triple {109839#(<= ~counter~0 5)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {109839#(<= ~counter~0 5)} is VALID [2022-04-28 06:01:35,808 INFO L272 TraceCheckUtils]: 4: Hoare triple {109839#(<= ~counter~0 5)} call #t~ret9 := main(); {109839#(<= ~counter~0 5)} is VALID [2022-04-28 06:01:35,808 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {109839#(<= ~counter~0 5)} {109682#true} #102#return; {109839#(<= ~counter~0 5)} is VALID [2022-04-28 06:01:35,808 INFO L290 TraceCheckUtils]: 2: Hoare triple {109839#(<= ~counter~0 5)} assume true; {109839#(<= ~counter~0 5)} is VALID [2022-04-28 06:01:35,809 INFO L290 TraceCheckUtils]: 1: Hoare triple {109682#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {109839#(<= ~counter~0 5)} is VALID [2022-04-28 06:01:35,809 INFO L272 TraceCheckUtils]: 0: Hoare triple {109682#true} call ULTIMATE.init(); {109682#true} is VALID [2022-04-28 06:01:35,809 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 28 proven. 144 refuted. 0 times theorem prover too weak. 368 trivial. 0 not checked. [2022-04-28 06:01:35,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:01:35,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502118643] [2022-04-28 06:01:35,810 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:01:35,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [31580034] [2022-04-28 06:01:35,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [31580034] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 06:01:35,810 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 06:01:35,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 24 [2022-04-28 06:01:35,810 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:01:35,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1800644414] [2022-04-28 06:01:35,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1800644414] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:01:35,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:01:35,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 06:01:35,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739630813] [2022-04-28 06:01:35,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:01:35,811 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.333333333333333) internal successors, (96), 17 states have internal predecessors, (96), 17 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) Word has length 135 [2022-04-28 06:01:35,811 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:01:35,811 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 5.333333333333333) internal successors, (96), 17 states have internal predecessors, (96), 17 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-28 06:01:35,958 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:01:35,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 06:01:35,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:01:35,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 06:01:35,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-28 06:01:35,960 INFO L87 Difference]: Start difference. First operand 683 states and 912 transitions. Second operand has 18 states, 18 states have (on average 5.333333333333333) internal successors, (96), 17 states have internal predecessors, (96), 17 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-28 06:01:40,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:01:40,762 INFO L93 Difference]: Finished difference Result 734 states and 982 transitions. [2022-04-28 06:01:40,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-28 06:01:40,762 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.333333333333333) internal successors, (96), 17 states have internal predecessors, (96), 17 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) Word has length 135 [2022-04-28 06:01:40,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:01:40,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 5.333333333333333) internal successors, (96), 17 states have internal predecessors, (96), 17 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-28 06:01:40,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 294 transitions. [2022-04-28 06:01:40,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 5.333333333333333) internal successors, (96), 17 states have internal predecessors, (96), 17 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-28 06:01:40,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 294 transitions. [2022-04-28 06:01:40,768 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 294 transitions. [2022-04-28 06:01:41,141 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 294 edges. 294 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:01:41,174 INFO L225 Difference]: With dead ends: 734 [2022-04-28 06:01:41,174 INFO L226 Difference]: Without dead ends: 729 [2022-04-28 06:01:41,175 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 246 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=459, Invalid=731, Unknown=0, NotChecked=0, Total=1190 [2022-04-28 06:01:41,175 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 192 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 06:01:41,175 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 356 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 06:01:41,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2022-04-28 06:01:44,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 707. [2022-04-28 06:01:44,326 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:01:44,327 INFO L82 GeneralOperation]: Start isEquivalent. First operand 729 states. Second operand has 707 states, 525 states have (on average 1.1923809523809523) internal successors, (626), 542 states have internal predecessors, (626), 163 states have call successors, (163), 20 states have call predecessors, (163), 18 states have return successors, (161), 144 states have call predecessors, (161), 161 states have call successors, (161) [2022-04-28 06:01:44,328 INFO L74 IsIncluded]: Start isIncluded. First operand 729 states. Second operand has 707 states, 525 states have (on average 1.1923809523809523) internal successors, (626), 542 states have internal predecessors, (626), 163 states have call successors, (163), 20 states have call predecessors, (163), 18 states have return successors, (161), 144 states have call predecessors, (161), 161 states have call successors, (161) [2022-04-28 06:01:44,328 INFO L87 Difference]: Start difference. First operand 729 states. Second operand has 707 states, 525 states have (on average 1.1923809523809523) internal successors, (626), 542 states have internal predecessors, (626), 163 states have call successors, (163), 20 states have call predecessors, (163), 18 states have return successors, (161), 144 states have call predecessors, (161), 161 states have call successors, (161) [2022-04-28 06:01:44,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:01:44,353 INFO L93 Difference]: Finished difference Result 729 states and 976 transitions. [2022-04-28 06:01:44,353 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 976 transitions. [2022-04-28 06:01:44,354 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:01:44,354 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:01:44,355 INFO L74 IsIncluded]: Start isIncluded. First operand has 707 states, 525 states have (on average 1.1923809523809523) internal successors, (626), 542 states have internal predecessors, (626), 163 states have call successors, (163), 20 states have call predecessors, (163), 18 states have return successors, (161), 144 states have call predecessors, (161), 161 states have call successors, (161) Second operand 729 states. [2022-04-28 06:01:44,356 INFO L87 Difference]: Start difference. First operand has 707 states, 525 states have (on average 1.1923809523809523) internal successors, (626), 542 states have internal predecessors, (626), 163 states have call successors, (163), 20 states have call predecessors, (163), 18 states have return successors, (161), 144 states have call predecessors, (161), 161 states have call successors, (161) Second operand 729 states. [2022-04-28 06:01:44,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:01:44,381 INFO L93 Difference]: Finished difference Result 729 states and 976 transitions. [2022-04-28 06:01:44,381 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 976 transitions. [2022-04-28 06:01:44,382 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:01:44,382 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:01:44,382 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:01:44,383 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:01:44,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 525 states have (on average 1.1923809523809523) internal successors, (626), 542 states have internal predecessors, (626), 163 states have call successors, (163), 20 states have call predecessors, (163), 18 states have return successors, (161), 144 states have call predecessors, (161), 161 states have call successors, (161) [2022-04-28 06:01:44,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 950 transitions. [2022-04-28 06:01:44,443 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 950 transitions. Word has length 135 [2022-04-28 06:01:44,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:01:44,443 INFO L495 AbstractCegarLoop]: Abstraction has 707 states and 950 transitions. [2022-04-28 06:01:44,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.333333333333333) internal successors, (96), 17 states have internal predecessors, (96), 17 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-28 06:01:44,443 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 707 states and 950 transitions. [2022-04-28 06:01:48,866 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 950 edges. 950 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:01:48,866 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 950 transitions. [2022-04-28 06:01:48,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-04-28 06:01:48,868 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:01:48,868 INFO L195 NwaCegarLoop]: trace histogram [15, 14, 14, 6, 6, 6, 6, 6, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:01:48,895 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Forceful destruction successful, exit code 0 [2022-04-28 06:01:49,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:01:49,069 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:01:49,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:01:49,069 INFO L85 PathProgramCache]: Analyzing trace with hash -972958086, now seen corresponding path program 21 times [2022-04-28 06:01:49,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:01:49,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1661204208] [2022-04-28 06:01:49,070 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 06:01:49,070 INFO L85 PathProgramCache]: Analyzing trace with hash -972958086, now seen corresponding path program 22 times [2022-04-28 06:01:49,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:01:49,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380099271] [2022-04-28 06:01:49,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:01:49,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:01:49,090 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:01:49,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1644967497] [2022-04-28 06:01:49,090 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 06:01:49,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:01:49,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:01:49,091 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:01:49,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2022-04-28 06:01:49,170 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 06:01:49,170 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:01:49,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-28 06:01:49,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:01:49,197 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:04:12,175 INFO L272 TraceCheckUtils]: 0: Hoare triple {114877#true} call ULTIMATE.init(); {114877#true} is VALID [2022-04-28 06:04:12,176 INFO L290 TraceCheckUtils]: 1: Hoare triple {114877#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {114877#true} is VALID [2022-04-28 06:04:12,176 INFO L290 TraceCheckUtils]: 2: Hoare triple {114877#true} assume true; {114877#true} is VALID [2022-04-28 06:04:12,176 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {114877#true} {114877#true} #102#return; {114877#true} is VALID [2022-04-28 06:04:12,176 INFO L272 TraceCheckUtils]: 4: Hoare triple {114877#true} call #t~ret9 := main(); {114877#true} is VALID [2022-04-28 06:04:12,176 INFO L290 TraceCheckUtils]: 5: Hoare triple {114877#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {114877#true} is VALID [2022-04-28 06:04:12,176 INFO L272 TraceCheckUtils]: 6: Hoare triple {114877#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {114877#true} is VALID [2022-04-28 06:04:12,176 INFO L290 TraceCheckUtils]: 7: Hoare triple {114877#true} ~cond := #in~cond; {114877#true} is VALID [2022-04-28 06:04:12,176 INFO L290 TraceCheckUtils]: 8: Hoare triple {114877#true} assume !(0 == ~cond); {114877#true} is VALID [2022-04-28 06:04:12,176 INFO L290 TraceCheckUtils]: 9: Hoare triple {114877#true} assume true; {114877#true} is VALID [2022-04-28 06:04:12,176 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {114877#true} {114877#true} #90#return; {114877#true} is VALID [2022-04-28 06:04:12,176 INFO L272 TraceCheckUtils]: 11: Hoare triple {114877#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {114877#true} is VALID [2022-04-28 06:04:12,176 INFO L290 TraceCheckUtils]: 12: Hoare triple {114877#true} ~cond := #in~cond; {114918#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 06:04:12,177 INFO L290 TraceCheckUtils]: 13: Hoare triple {114918#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {114922#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 06:04:12,177 INFO L290 TraceCheckUtils]: 14: Hoare triple {114922#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {114922#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 06:04:12,178 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {114922#(not (= |assume_abort_if_not_#in~cond| 0))} {114877#true} #92#return; {114929#(and (<= 0 main_~A~0) (= (mod main_~A~0 2) 1))} is VALID [2022-04-28 06:04:14,180 WARN L290 TraceCheckUtils]: 16: Hoare triple {114929#(and (<= 0 main_~A~0) (= (mod main_~A~0 2) 1))} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {114933#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} is UNKNOWN [2022-04-28 06:04:14,181 INFO L290 TraceCheckUtils]: 17: Hoare triple {114933#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {114933#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} is VALID [2022-04-28 06:04:14,182 INFO L290 TraceCheckUtils]: 18: Hoare triple {114933#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} assume !!(#t~post6 < 20);havoc #t~post6; {114933#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} is VALID [2022-04-28 06:04:14,182 INFO L272 TraceCheckUtils]: 19: Hoare triple {114933#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {114877#true} is VALID [2022-04-28 06:04:14,182 INFO L290 TraceCheckUtils]: 20: Hoare triple {114877#true} ~cond := #in~cond; {114877#true} is VALID [2022-04-28 06:04:14,182 INFO L290 TraceCheckUtils]: 21: Hoare triple {114877#true} assume !(0 == ~cond); {114877#true} is VALID [2022-04-28 06:04:14,182 INFO L290 TraceCheckUtils]: 22: Hoare triple {114877#true} assume true; {114877#true} is VALID [2022-04-28 06:04:14,182 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {114877#true} {114933#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} #94#return; {114933#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} is VALID [2022-04-28 06:04:14,183 INFO L290 TraceCheckUtils]: 24: Hoare triple {114933#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} assume !!(0 != ~r~0); {114933#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} is VALID [2022-04-28 06:04:14,183 INFO L290 TraceCheckUtils]: 25: Hoare triple {114933#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {114933#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} is VALID [2022-04-28 06:04:14,184 INFO L290 TraceCheckUtils]: 26: Hoare triple {114933#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} assume !!(#t~post7 < 20);havoc #t~post7; {114933#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} is VALID [2022-04-28 06:04:14,184 INFO L272 TraceCheckUtils]: 27: Hoare triple {114933#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {114877#true} is VALID [2022-04-28 06:04:14,184 INFO L290 TraceCheckUtils]: 28: Hoare triple {114877#true} ~cond := #in~cond; {114877#true} is VALID [2022-04-28 06:04:14,184 INFO L290 TraceCheckUtils]: 29: Hoare triple {114877#true} assume !(0 == ~cond); {114877#true} is VALID [2022-04-28 06:04:14,184 INFO L290 TraceCheckUtils]: 30: Hoare triple {114877#true} assume true; {114877#true} is VALID [2022-04-28 06:04:14,184 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {114877#true} {114933#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} #96#return; {114933#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} is VALID [2022-04-28 06:04:14,185 INFO L290 TraceCheckUtils]: 32: Hoare triple {114933#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} assume !(~r~0 > 0); {114933#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} is VALID [2022-04-28 06:04:14,185 INFO L290 TraceCheckUtils]: 33: Hoare triple {114933#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {114933#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} is VALID [2022-04-28 06:04:14,185 INFO L290 TraceCheckUtils]: 34: Hoare triple {114933#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} assume !!(#t~post8 < 20);havoc #t~post8; {114933#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} is VALID [2022-04-28 06:04:14,186 INFO L272 TraceCheckUtils]: 35: Hoare triple {114933#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {114877#true} is VALID [2022-04-28 06:04:14,186 INFO L290 TraceCheckUtils]: 36: Hoare triple {114877#true} ~cond := #in~cond; {114877#true} is VALID [2022-04-28 06:04:14,186 INFO L290 TraceCheckUtils]: 37: Hoare triple {114877#true} assume !(0 == ~cond); {114877#true} is VALID [2022-04-28 06:04:14,186 INFO L290 TraceCheckUtils]: 38: Hoare triple {114877#true} assume true; {114877#true} is VALID [2022-04-28 06:04:14,186 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {114877#true} {114933#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} #98#return; {114933#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} is VALID [2022-04-28 06:04:14,761 INFO L290 TraceCheckUtils]: 40: Hoare triple {114933#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {115006#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} is VALID [2022-04-28 06:04:14,779 INFO L290 TraceCheckUtils]: 41: Hoare triple {115006#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {115006#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} is VALID [2022-04-28 06:04:14,780 INFO L290 TraceCheckUtils]: 42: Hoare triple {115006#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} assume !!(#t~post8 < 20);havoc #t~post8; {115006#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} is VALID [2022-04-28 06:04:14,780 INFO L272 TraceCheckUtils]: 43: Hoare triple {115006#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {114877#true} is VALID [2022-04-28 06:04:14,780 INFO L290 TraceCheckUtils]: 44: Hoare triple {114877#true} ~cond := #in~cond; {114877#true} is VALID [2022-04-28 06:04:14,780 INFO L290 TraceCheckUtils]: 45: Hoare triple {114877#true} assume !(0 == ~cond); {114877#true} is VALID [2022-04-28 06:04:14,780 INFO L290 TraceCheckUtils]: 46: Hoare triple {114877#true} assume true; {114877#true} is VALID [2022-04-28 06:04:14,781 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {114877#true} {115006#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} #98#return; {115006#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} is VALID [2022-04-28 06:04:14,782 INFO L290 TraceCheckUtils]: 48: Hoare triple {115006#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} assume !(~r~0 < 0); {115006#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} is VALID [2022-04-28 06:04:14,784 INFO L290 TraceCheckUtils]: 49: Hoare triple {115006#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {115006#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} is VALID [2022-04-28 06:04:14,786 INFO L290 TraceCheckUtils]: 50: Hoare triple {115006#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} assume !!(#t~post6 < 20);havoc #t~post6; {115006#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} is VALID [2022-04-28 06:04:14,786 INFO L272 TraceCheckUtils]: 51: Hoare triple {115006#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {114877#true} is VALID [2022-04-28 06:04:14,786 INFO L290 TraceCheckUtils]: 52: Hoare triple {114877#true} ~cond := #in~cond; {114877#true} is VALID [2022-04-28 06:04:14,786 INFO L290 TraceCheckUtils]: 53: Hoare triple {114877#true} assume !(0 == ~cond); {114877#true} is VALID [2022-04-28 06:04:14,786 INFO L290 TraceCheckUtils]: 54: Hoare triple {114877#true} assume true; {114877#true} is VALID [2022-04-28 06:04:14,786 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {114877#true} {115006#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} #94#return; {115006#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} is VALID [2022-04-28 06:04:14,787 INFO L290 TraceCheckUtils]: 56: Hoare triple {115006#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} assume !!(0 != ~r~0); {115006#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} is VALID [2022-04-28 06:04:14,788 INFO L290 TraceCheckUtils]: 57: Hoare triple {115006#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {115006#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} is VALID [2022-04-28 06:04:14,789 INFO L290 TraceCheckUtils]: 58: Hoare triple {115006#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} assume !!(#t~post7 < 20);havoc #t~post7; {115006#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} is VALID [2022-04-28 06:04:14,789 INFO L272 TraceCheckUtils]: 59: Hoare triple {115006#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {114877#true} is VALID [2022-04-28 06:04:14,789 INFO L290 TraceCheckUtils]: 60: Hoare triple {114877#true} ~cond := #in~cond; {114877#true} is VALID [2022-04-28 06:04:14,790 INFO L290 TraceCheckUtils]: 61: Hoare triple {114877#true} assume !(0 == ~cond); {114877#true} is VALID [2022-04-28 06:04:14,790 INFO L290 TraceCheckUtils]: 62: Hoare triple {114877#true} assume true; {114877#true} is VALID [2022-04-28 06:04:14,790 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {114877#true} {115006#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} #96#return; {115006#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} is VALID [2022-04-28 06:04:14,793 INFO L290 TraceCheckUtils]: 64: Hoare triple {115006#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {115079#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ main_~r~0 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (<= main_~v~0 3))} is VALID [2022-04-28 06:04:14,794 INFO L290 TraceCheckUtils]: 65: Hoare triple {115079#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ main_~r~0 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (<= main_~v~0 3))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {115079#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ main_~r~0 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (<= main_~v~0 3))} is VALID [2022-04-28 06:04:14,807 INFO L290 TraceCheckUtils]: 66: Hoare triple {115079#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ main_~r~0 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (<= main_~v~0 3))} assume !!(#t~post7 < 20);havoc #t~post7; {115079#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ main_~r~0 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (<= main_~v~0 3))} is VALID [2022-04-28 06:04:14,807 INFO L272 TraceCheckUtils]: 67: Hoare triple {115079#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ main_~r~0 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (<= main_~v~0 3))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {114877#true} is VALID [2022-04-28 06:04:14,807 INFO L290 TraceCheckUtils]: 68: Hoare triple {114877#true} ~cond := #in~cond; {114877#true} is VALID [2022-04-28 06:04:14,807 INFO L290 TraceCheckUtils]: 69: Hoare triple {114877#true} assume !(0 == ~cond); {114877#true} is VALID [2022-04-28 06:04:14,807 INFO L290 TraceCheckUtils]: 70: Hoare triple {114877#true} assume true; {114877#true} is VALID [2022-04-28 06:04:14,808 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {114877#true} {115079#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ main_~r~0 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (<= main_~v~0 3))} #96#return; {115079#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ main_~r~0 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (<= main_~v~0 3))} is VALID [2022-04-28 06:04:14,809 INFO L290 TraceCheckUtils]: 72: Hoare triple {115079#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ main_~r~0 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (<= main_~v~0 3))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {115104#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} is VALID [2022-04-28 06:04:14,810 INFO L290 TraceCheckUtils]: 73: Hoare triple {115104#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {115104#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} is VALID [2022-04-28 06:04:14,815 INFO L290 TraceCheckUtils]: 74: Hoare triple {115104#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} assume !!(#t~post7 < 20);havoc #t~post7; {115104#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} is VALID [2022-04-28 06:04:14,815 INFO L272 TraceCheckUtils]: 75: Hoare triple {115104#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {114877#true} is VALID [2022-04-28 06:04:14,815 INFO L290 TraceCheckUtils]: 76: Hoare triple {114877#true} ~cond := #in~cond; {114877#true} is VALID [2022-04-28 06:04:14,816 INFO L290 TraceCheckUtils]: 77: Hoare triple {114877#true} assume !(0 == ~cond); {114877#true} is VALID [2022-04-28 06:04:14,816 INFO L290 TraceCheckUtils]: 78: Hoare triple {114877#true} assume true; {114877#true} is VALID [2022-04-28 06:04:14,816 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {114877#true} {115104#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} #96#return; {115104#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} is VALID [2022-04-28 06:04:14,817 INFO L290 TraceCheckUtils]: 80: Hoare triple {115104#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} assume !(~r~0 > 0); {115104#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} is VALID [2022-04-28 06:04:14,818 INFO L290 TraceCheckUtils]: 81: Hoare triple {115104#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {115104#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} is VALID [2022-04-28 06:04:14,819 INFO L290 TraceCheckUtils]: 82: Hoare triple {115104#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} assume !!(#t~post8 < 20);havoc #t~post8; {115104#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} is VALID [2022-04-28 06:04:14,819 INFO L272 TraceCheckUtils]: 83: Hoare triple {115104#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {114877#true} is VALID [2022-04-28 06:04:14,819 INFO L290 TraceCheckUtils]: 84: Hoare triple {114877#true} ~cond := #in~cond; {114877#true} is VALID [2022-04-28 06:04:14,819 INFO L290 TraceCheckUtils]: 85: Hoare triple {114877#true} assume !(0 == ~cond); {114877#true} is VALID [2022-04-28 06:04:14,819 INFO L290 TraceCheckUtils]: 86: Hoare triple {114877#true} assume true; {114877#true} is VALID [2022-04-28 06:04:14,820 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {114877#true} {115104#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} #98#return; {115104#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} is VALID [2022-04-28 06:04:14,878 INFO L290 TraceCheckUtils]: 88: Hoare triple {115104#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {115153#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} is VALID [2022-04-28 06:04:14,882 INFO L290 TraceCheckUtils]: 89: Hoare triple {115153#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {115153#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} is VALID [2022-04-28 06:04:14,883 INFO L290 TraceCheckUtils]: 90: Hoare triple {115153#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} assume !!(#t~post8 < 20);havoc #t~post8; {115153#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} is VALID [2022-04-28 06:04:14,883 INFO L272 TraceCheckUtils]: 91: Hoare triple {115153#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {114877#true} is VALID [2022-04-28 06:04:14,883 INFO L290 TraceCheckUtils]: 92: Hoare triple {114877#true} ~cond := #in~cond; {114877#true} is VALID [2022-04-28 06:04:14,883 INFO L290 TraceCheckUtils]: 93: Hoare triple {114877#true} assume !(0 == ~cond); {114877#true} is VALID [2022-04-28 06:04:14,883 INFO L290 TraceCheckUtils]: 94: Hoare triple {114877#true} assume true; {114877#true} is VALID [2022-04-28 06:04:14,883 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {114877#true} {115153#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} #98#return; {115153#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} is VALID [2022-04-28 06:04:14,884 INFO L290 TraceCheckUtils]: 96: Hoare triple {115153#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} assume !(~r~0 < 0); {115153#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} is VALID [2022-04-28 06:04:14,885 INFO L290 TraceCheckUtils]: 97: Hoare triple {115153#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {115153#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} is VALID [2022-04-28 06:04:14,886 INFO L290 TraceCheckUtils]: 98: Hoare triple {115153#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} assume !!(#t~post6 < 20);havoc #t~post6; {115153#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} is VALID [2022-04-28 06:04:14,886 INFO L272 TraceCheckUtils]: 99: Hoare triple {115153#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {114877#true} is VALID [2022-04-28 06:04:14,886 INFO L290 TraceCheckUtils]: 100: Hoare triple {114877#true} ~cond := #in~cond; {114877#true} is VALID [2022-04-28 06:04:14,886 INFO L290 TraceCheckUtils]: 101: Hoare triple {114877#true} assume !(0 == ~cond); {114877#true} is VALID [2022-04-28 06:04:14,886 INFO L290 TraceCheckUtils]: 102: Hoare triple {114877#true} assume true; {114877#true} is VALID [2022-04-28 06:04:14,887 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {114877#true} {115153#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} #94#return; {115153#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} is VALID [2022-04-28 06:04:14,894 INFO L290 TraceCheckUtils]: 104: Hoare triple {115153#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} assume !!(0 != ~r~0); {115153#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} is VALID [2022-04-28 06:04:14,895 INFO L290 TraceCheckUtils]: 105: Hoare triple {115153#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {115153#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} is VALID [2022-04-28 06:04:14,896 INFO L290 TraceCheckUtils]: 106: Hoare triple {115153#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} assume !!(#t~post7 < 20);havoc #t~post7; {115153#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} is VALID [2022-04-28 06:04:14,896 INFO L272 TraceCheckUtils]: 107: Hoare triple {115153#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {114877#true} is VALID [2022-04-28 06:04:14,896 INFO L290 TraceCheckUtils]: 108: Hoare triple {114877#true} ~cond := #in~cond; {114877#true} is VALID [2022-04-28 06:04:14,897 INFO L290 TraceCheckUtils]: 109: Hoare triple {114877#true} assume !(0 == ~cond); {114877#true} is VALID [2022-04-28 06:04:14,897 INFO L290 TraceCheckUtils]: 110: Hoare triple {114877#true} assume true; {114877#true} is VALID [2022-04-28 06:04:14,897 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {114877#true} {115153#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} #96#return; {115153#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} is VALID [2022-04-28 06:04:14,898 INFO L290 TraceCheckUtils]: 112: Hoare triple {115153#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {115226#(exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ 7 main_~r~0))))} is VALID [2022-04-28 06:04:14,910 INFO L290 TraceCheckUtils]: 113: Hoare triple {115226#(exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ 7 main_~r~0))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {115226#(exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ 7 main_~r~0))))} is VALID [2022-04-28 06:04:14,911 INFO L290 TraceCheckUtils]: 114: Hoare triple {115226#(exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ 7 main_~r~0))))} assume !!(#t~post7 < 20);havoc #t~post7; {115226#(exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ 7 main_~r~0))))} is VALID [2022-04-28 06:04:14,911 INFO L272 TraceCheckUtils]: 115: Hoare triple {115226#(exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ 7 main_~r~0))))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {114877#true} is VALID [2022-04-28 06:04:14,911 INFO L290 TraceCheckUtils]: 116: Hoare triple {114877#true} ~cond := #in~cond; {114877#true} is VALID [2022-04-28 06:04:14,911 INFO L290 TraceCheckUtils]: 117: Hoare triple {114877#true} assume !(0 == ~cond); {114877#true} is VALID [2022-04-28 06:04:14,911 INFO L290 TraceCheckUtils]: 118: Hoare triple {114877#true} assume true; {114877#true} is VALID [2022-04-28 06:04:14,912 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {114877#true} {115226#(exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ 7 main_~r~0))))} #96#return; {115226#(exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ 7 main_~r~0))))} is VALID [2022-04-28 06:04:14,915 INFO L290 TraceCheckUtils]: 120: Hoare triple {115226#(exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ 7 main_~r~0))))} assume !(~r~0 > 0); {115226#(exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ 7 main_~r~0))))} is VALID [2022-04-28 06:04:14,916 INFO L290 TraceCheckUtils]: 121: Hoare triple {115226#(exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ 7 main_~r~0))))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {115226#(exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ 7 main_~r~0))))} is VALID [2022-04-28 06:04:14,933 INFO L290 TraceCheckUtils]: 122: Hoare triple {115226#(exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ 7 main_~r~0))))} assume !!(#t~post8 < 20);havoc #t~post8; {115226#(exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ 7 main_~r~0))))} is VALID [2022-04-28 06:04:14,933 INFO L272 TraceCheckUtils]: 123: Hoare triple {115226#(exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ 7 main_~r~0))))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {114877#true} is VALID [2022-04-28 06:04:14,933 INFO L290 TraceCheckUtils]: 124: Hoare triple {114877#true} ~cond := #in~cond; {114877#true} is VALID [2022-04-28 06:04:14,933 INFO L290 TraceCheckUtils]: 125: Hoare triple {114877#true} assume !(0 == ~cond); {114877#true} is VALID [2022-04-28 06:04:14,933 INFO L290 TraceCheckUtils]: 126: Hoare triple {114877#true} assume true; {114877#true} is VALID [2022-04-28 06:04:14,934 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {114877#true} {115226#(exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ 7 main_~r~0))))} #98#return; {115226#(exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ 7 main_~r~0))))} is VALID [2022-04-28 06:04:14,937 INFO L290 TraceCheckUtils]: 128: Hoare triple {115226#(exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ 7 main_~r~0))))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {114878#false} is VALID [2022-04-28 06:04:14,937 INFO L290 TraceCheckUtils]: 129: Hoare triple {114878#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {114878#false} is VALID [2022-04-28 06:04:14,937 INFO L290 TraceCheckUtils]: 130: Hoare triple {114878#false} assume !(#t~post8 < 20);havoc #t~post8; {114878#false} is VALID [2022-04-28 06:04:14,937 INFO L290 TraceCheckUtils]: 131: Hoare triple {114878#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {114878#false} is VALID [2022-04-28 06:04:14,937 INFO L290 TraceCheckUtils]: 132: Hoare triple {114878#false} assume !(#t~post6 < 20);havoc #t~post6; {114878#false} is VALID [2022-04-28 06:04:14,937 INFO L272 TraceCheckUtils]: 133: Hoare triple {114878#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {114878#false} is VALID [2022-04-28 06:04:14,937 INFO L290 TraceCheckUtils]: 134: Hoare triple {114878#false} ~cond := #in~cond; {114878#false} is VALID [2022-04-28 06:04:14,937 INFO L290 TraceCheckUtils]: 135: Hoare triple {114878#false} assume 0 == ~cond; {114878#false} is VALID [2022-04-28 06:04:14,937 INFO L290 TraceCheckUtils]: 136: Hoare triple {114878#false} assume !false; {114878#false} is VALID [2022-04-28 06:04:14,938 INFO L134 CoverageAnalysis]: Checked inductivity of 524 backedges. 47 proven. 112 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2022-04-28 06:04:14,938 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 06:04:19,540 INFO L290 TraceCheckUtils]: 136: Hoare triple {114878#false} assume !false; {114878#false} is VALID [2022-04-28 06:04:19,540 INFO L290 TraceCheckUtils]: 135: Hoare triple {114878#false} assume 0 == ~cond; {114878#false} is VALID [2022-04-28 06:04:19,540 INFO L290 TraceCheckUtils]: 134: Hoare triple {114878#false} ~cond := #in~cond; {114878#false} is VALID [2022-04-28 06:04:19,540 INFO L272 TraceCheckUtils]: 133: Hoare triple {114878#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {114878#false} is VALID [2022-04-28 06:04:19,540 INFO L290 TraceCheckUtils]: 132: Hoare triple {114878#false} assume !(#t~post6 < 20);havoc #t~post6; {114878#false} is VALID [2022-04-28 06:04:19,540 INFO L290 TraceCheckUtils]: 131: Hoare triple {114878#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {114878#false} is VALID [2022-04-28 06:04:19,540 INFO L290 TraceCheckUtils]: 130: Hoare triple {114878#false} assume !(#t~post8 < 20);havoc #t~post8; {114878#false} is VALID [2022-04-28 06:04:19,540 INFO L290 TraceCheckUtils]: 129: Hoare triple {114878#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {114878#false} is VALID [2022-04-28 06:04:19,541 INFO L290 TraceCheckUtils]: 128: Hoare triple {115323#(not (< main_~r~0 0))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {114878#false} is VALID [2022-04-28 06:04:19,541 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {114877#true} {115323#(not (< main_~r~0 0))} #98#return; {115323#(not (< main_~r~0 0))} is VALID [2022-04-28 06:04:19,541 INFO L290 TraceCheckUtils]: 126: Hoare triple {114877#true} assume true; {114877#true} is VALID [2022-04-28 06:04:19,541 INFO L290 TraceCheckUtils]: 125: Hoare triple {114877#true} assume !(0 == ~cond); {114877#true} is VALID [2022-04-28 06:04:19,541 INFO L290 TraceCheckUtils]: 124: Hoare triple {114877#true} ~cond := #in~cond; {114877#true} is VALID [2022-04-28 06:04:19,541 INFO L272 TraceCheckUtils]: 123: Hoare triple {115323#(not (< main_~r~0 0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {114877#true} is VALID [2022-04-28 06:04:19,542 INFO L290 TraceCheckUtils]: 122: Hoare triple {115323#(not (< main_~r~0 0))} assume !!(#t~post8 < 20);havoc #t~post8; {115323#(not (< main_~r~0 0))} is VALID [2022-04-28 06:04:19,542 INFO L290 TraceCheckUtils]: 121: Hoare triple {115323#(not (< main_~r~0 0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {115323#(not (< main_~r~0 0))} is VALID [2022-04-28 06:04:19,542 INFO L290 TraceCheckUtils]: 120: Hoare triple {115323#(not (< main_~r~0 0))} assume !(~r~0 > 0); {115323#(not (< main_~r~0 0))} is VALID [2022-04-28 06:04:19,543 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {114877#true} {115323#(not (< main_~r~0 0))} #96#return; {115323#(not (< main_~r~0 0))} is VALID [2022-04-28 06:04:19,543 INFO L290 TraceCheckUtils]: 118: Hoare triple {114877#true} assume true; {114877#true} is VALID [2022-04-28 06:04:19,543 INFO L290 TraceCheckUtils]: 117: Hoare triple {114877#true} assume !(0 == ~cond); {114877#true} is VALID [2022-04-28 06:04:19,543 INFO L290 TraceCheckUtils]: 116: Hoare triple {114877#true} ~cond := #in~cond; {114877#true} is VALID [2022-04-28 06:04:19,543 INFO L272 TraceCheckUtils]: 115: Hoare triple {115323#(not (< main_~r~0 0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {114877#true} is VALID [2022-04-28 06:04:19,543 INFO L290 TraceCheckUtils]: 114: Hoare triple {115323#(not (< main_~r~0 0))} assume !!(#t~post7 < 20);havoc #t~post7; {115323#(not (< main_~r~0 0))} is VALID [2022-04-28 06:04:19,543 INFO L290 TraceCheckUtils]: 113: Hoare triple {115323#(not (< main_~r~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {115323#(not (< main_~r~0 0))} is VALID [2022-04-28 06:04:19,545 INFO L290 TraceCheckUtils]: 112: Hoare triple {115372#(<= main_~v~0 main_~r~0)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {115323#(not (< main_~r~0 0))} is VALID [2022-04-28 06:04:19,546 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {114877#true} {115372#(<= main_~v~0 main_~r~0)} #96#return; {115372#(<= main_~v~0 main_~r~0)} is VALID [2022-04-28 06:04:19,546 INFO L290 TraceCheckUtils]: 110: Hoare triple {114877#true} assume true; {114877#true} is VALID [2022-04-28 06:04:19,546 INFO L290 TraceCheckUtils]: 109: Hoare triple {114877#true} assume !(0 == ~cond); {114877#true} is VALID [2022-04-28 06:04:19,546 INFO L290 TraceCheckUtils]: 108: Hoare triple {114877#true} ~cond := #in~cond; {114877#true} is VALID [2022-04-28 06:04:19,546 INFO L272 TraceCheckUtils]: 107: Hoare triple {115372#(<= main_~v~0 main_~r~0)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {114877#true} is VALID [2022-04-28 06:04:19,546 INFO L290 TraceCheckUtils]: 106: Hoare triple {115372#(<= main_~v~0 main_~r~0)} assume !!(#t~post7 < 20);havoc #t~post7; {115372#(<= main_~v~0 main_~r~0)} is VALID [2022-04-28 06:04:19,546 INFO L290 TraceCheckUtils]: 105: Hoare triple {115372#(<= main_~v~0 main_~r~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {115372#(<= main_~v~0 main_~r~0)} is VALID [2022-04-28 06:04:19,547 INFO L290 TraceCheckUtils]: 104: Hoare triple {115372#(<= main_~v~0 main_~r~0)} assume !!(0 != ~r~0); {115372#(<= main_~v~0 main_~r~0)} is VALID [2022-04-28 06:04:19,547 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {114877#true} {115372#(<= main_~v~0 main_~r~0)} #94#return; {115372#(<= main_~v~0 main_~r~0)} is VALID [2022-04-28 06:04:19,547 INFO L290 TraceCheckUtils]: 102: Hoare triple {114877#true} assume true; {114877#true} is VALID [2022-04-28 06:04:19,547 INFO L290 TraceCheckUtils]: 101: Hoare triple {114877#true} assume !(0 == ~cond); {114877#true} is VALID [2022-04-28 06:04:19,547 INFO L290 TraceCheckUtils]: 100: Hoare triple {114877#true} ~cond := #in~cond; {114877#true} is VALID [2022-04-28 06:04:19,547 INFO L272 TraceCheckUtils]: 99: Hoare triple {115372#(<= main_~v~0 main_~r~0)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {114877#true} is VALID [2022-04-28 06:04:19,555 INFO L290 TraceCheckUtils]: 98: Hoare triple {115372#(<= main_~v~0 main_~r~0)} assume !!(#t~post6 < 20);havoc #t~post6; {115372#(<= main_~v~0 main_~r~0)} is VALID [2022-04-28 06:04:19,556 INFO L290 TraceCheckUtils]: 97: Hoare triple {115372#(<= main_~v~0 main_~r~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {115372#(<= main_~v~0 main_~r~0)} is VALID [2022-04-28 06:04:19,556 INFO L290 TraceCheckUtils]: 96: Hoare triple {115372#(<= main_~v~0 main_~r~0)} assume !(~r~0 < 0); {115372#(<= main_~v~0 main_~r~0)} is VALID [2022-04-28 06:04:19,556 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {114877#true} {115372#(<= main_~v~0 main_~r~0)} #98#return; {115372#(<= main_~v~0 main_~r~0)} is VALID [2022-04-28 06:04:19,557 INFO L290 TraceCheckUtils]: 94: Hoare triple {114877#true} assume true; {114877#true} is VALID [2022-04-28 06:04:19,557 INFO L290 TraceCheckUtils]: 93: Hoare triple {114877#true} assume !(0 == ~cond); {114877#true} is VALID [2022-04-28 06:04:19,557 INFO L290 TraceCheckUtils]: 92: Hoare triple {114877#true} ~cond := #in~cond; {114877#true} is VALID [2022-04-28 06:04:19,557 INFO L272 TraceCheckUtils]: 91: Hoare triple {115372#(<= main_~v~0 main_~r~0)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {114877#true} is VALID [2022-04-28 06:04:19,557 INFO L290 TraceCheckUtils]: 90: Hoare triple {115372#(<= main_~v~0 main_~r~0)} assume !!(#t~post8 < 20);havoc #t~post8; {115372#(<= main_~v~0 main_~r~0)} is VALID [2022-04-28 06:04:19,557 INFO L290 TraceCheckUtils]: 89: Hoare triple {115372#(<= main_~v~0 main_~r~0)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {115372#(<= main_~v~0 main_~r~0)} is VALID [2022-04-28 06:04:19,561 INFO L290 TraceCheckUtils]: 88: Hoare triple {115445#(<= main_~v~0 (+ main_~u~0 main_~r~0))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {115372#(<= main_~v~0 main_~r~0)} is VALID [2022-04-28 06:04:19,561 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {114877#true} {115445#(<= main_~v~0 (+ main_~u~0 main_~r~0))} #98#return; {115445#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-28 06:04:19,561 INFO L290 TraceCheckUtils]: 86: Hoare triple {114877#true} assume true; {114877#true} is VALID [2022-04-28 06:04:19,561 INFO L290 TraceCheckUtils]: 85: Hoare triple {114877#true} assume !(0 == ~cond); {114877#true} is VALID [2022-04-28 06:04:19,562 INFO L290 TraceCheckUtils]: 84: Hoare triple {114877#true} ~cond := #in~cond; {114877#true} is VALID [2022-04-28 06:04:19,562 INFO L272 TraceCheckUtils]: 83: Hoare triple {115445#(<= main_~v~0 (+ main_~u~0 main_~r~0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {114877#true} is VALID [2022-04-28 06:04:19,562 INFO L290 TraceCheckUtils]: 82: Hoare triple {115445#(<= main_~v~0 (+ main_~u~0 main_~r~0))} assume !!(#t~post8 < 20);havoc #t~post8; {115445#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-28 06:04:19,562 INFO L290 TraceCheckUtils]: 81: Hoare triple {115445#(<= main_~v~0 (+ main_~u~0 main_~r~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {115445#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-28 06:04:19,563 INFO L290 TraceCheckUtils]: 80: Hoare triple {115445#(<= main_~v~0 (+ main_~u~0 main_~r~0))} assume !(~r~0 > 0); {115445#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-28 06:04:19,563 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {114877#true} {115445#(<= main_~v~0 (+ main_~u~0 main_~r~0))} #96#return; {115445#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-28 06:04:19,563 INFO L290 TraceCheckUtils]: 78: Hoare triple {114877#true} assume true; {114877#true} is VALID [2022-04-28 06:04:19,563 INFO L290 TraceCheckUtils]: 77: Hoare triple {114877#true} assume !(0 == ~cond); {114877#true} is VALID [2022-04-28 06:04:19,563 INFO L290 TraceCheckUtils]: 76: Hoare triple {114877#true} ~cond := #in~cond; {114877#true} is VALID [2022-04-28 06:04:19,563 INFO L272 TraceCheckUtils]: 75: Hoare triple {115445#(<= main_~v~0 (+ main_~u~0 main_~r~0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {114877#true} is VALID [2022-04-28 06:04:19,564 INFO L290 TraceCheckUtils]: 74: Hoare triple {115445#(<= main_~v~0 (+ main_~u~0 main_~r~0))} assume !!(#t~post7 < 20);havoc #t~post7; {115445#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-28 06:04:19,564 INFO L290 TraceCheckUtils]: 73: Hoare triple {115445#(<= main_~v~0 (+ main_~u~0 main_~r~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {115445#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-28 06:04:19,565 INFO L290 TraceCheckUtils]: 72: Hoare triple {115494#(or (not (< 0 main_~r~0)) (<= (+ (* main_~v~0 2) 2) (+ main_~u~0 main_~r~0)))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {115445#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-28 06:04:19,566 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {114877#true} {115494#(or (not (< 0 main_~r~0)) (<= (+ (* main_~v~0 2) 2) (+ main_~u~0 main_~r~0)))} #96#return; {115494#(or (not (< 0 main_~r~0)) (<= (+ (* main_~v~0 2) 2) (+ main_~u~0 main_~r~0)))} is VALID [2022-04-28 06:04:19,566 INFO L290 TraceCheckUtils]: 70: Hoare triple {114877#true} assume true; {114877#true} is VALID [2022-04-28 06:04:19,566 INFO L290 TraceCheckUtils]: 69: Hoare triple {114877#true} assume !(0 == ~cond); {114877#true} is VALID [2022-04-28 06:04:19,566 INFO L290 TraceCheckUtils]: 68: Hoare triple {114877#true} ~cond := #in~cond; {114877#true} is VALID [2022-04-28 06:04:19,566 INFO L272 TraceCheckUtils]: 67: Hoare triple {115494#(or (not (< 0 main_~r~0)) (<= (+ (* main_~v~0 2) 2) (+ main_~u~0 main_~r~0)))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {114877#true} is VALID [2022-04-28 06:04:19,567 INFO L290 TraceCheckUtils]: 66: Hoare triple {115494#(or (not (< 0 main_~r~0)) (<= (+ (* main_~v~0 2) 2) (+ main_~u~0 main_~r~0)))} assume !!(#t~post7 < 20);havoc #t~post7; {115494#(or (not (< 0 main_~r~0)) (<= (+ (* main_~v~0 2) 2) (+ main_~u~0 main_~r~0)))} is VALID [2022-04-28 06:04:19,567 INFO L290 TraceCheckUtils]: 65: Hoare triple {115494#(or (not (< 0 main_~r~0)) (<= (+ (* main_~v~0 2) 2) (+ main_~u~0 main_~r~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {115494#(or (not (< 0 main_~r~0)) (<= (+ (* main_~v~0 2) 2) (+ main_~u~0 main_~r~0)))} is VALID [2022-04-28 06:04:19,569 INFO L290 TraceCheckUtils]: 64: Hoare triple {115519#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {115494#(or (not (< 0 main_~r~0)) (<= (+ (* main_~v~0 2) 2) (+ main_~u~0 main_~r~0)))} is VALID [2022-04-28 06:04:19,569 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {114877#true} {115519#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} #96#return; {115519#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} is VALID [2022-04-28 06:04:19,570 INFO L290 TraceCheckUtils]: 62: Hoare triple {114877#true} assume true; {114877#true} is VALID [2022-04-28 06:04:19,570 INFO L290 TraceCheckUtils]: 61: Hoare triple {114877#true} assume !(0 == ~cond); {114877#true} is VALID [2022-04-28 06:04:19,570 INFO L290 TraceCheckUtils]: 60: Hoare triple {114877#true} ~cond := #in~cond; {114877#true} is VALID [2022-04-28 06:04:19,570 INFO L272 TraceCheckUtils]: 59: Hoare triple {115519#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {114877#true} is VALID [2022-04-28 06:04:19,570 INFO L290 TraceCheckUtils]: 58: Hoare triple {115519#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} assume !!(#t~post7 < 20);havoc #t~post7; {115519#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} is VALID [2022-04-28 06:04:19,571 INFO L290 TraceCheckUtils]: 57: Hoare triple {115519#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {115519#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} is VALID [2022-04-28 06:04:19,571 INFO L290 TraceCheckUtils]: 56: Hoare triple {115519#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} assume !!(0 != ~r~0); {115519#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} is VALID [2022-04-28 06:04:19,572 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {114877#true} {115519#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} #94#return; {115519#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} is VALID [2022-04-28 06:04:19,572 INFO L290 TraceCheckUtils]: 54: Hoare triple {114877#true} assume true; {114877#true} is VALID [2022-04-28 06:04:19,572 INFO L290 TraceCheckUtils]: 53: Hoare triple {114877#true} assume !(0 == ~cond); {114877#true} is VALID [2022-04-28 06:04:19,572 INFO L290 TraceCheckUtils]: 52: Hoare triple {114877#true} ~cond := #in~cond; {114877#true} is VALID [2022-04-28 06:04:19,572 INFO L272 TraceCheckUtils]: 51: Hoare triple {115519#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {114877#true} is VALID [2022-04-28 06:04:19,572 INFO L290 TraceCheckUtils]: 50: Hoare triple {115519#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} assume !!(#t~post6 < 20);havoc #t~post6; {115519#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} is VALID [2022-04-28 06:04:19,573 INFO L290 TraceCheckUtils]: 49: Hoare triple {115519#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {115519#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} is VALID [2022-04-28 06:04:19,573 INFO L290 TraceCheckUtils]: 48: Hoare triple {115519#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} assume !(~r~0 < 0); {115519#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} is VALID [2022-04-28 06:04:19,574 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {114877#true} {115519#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} #98#return; {115519#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} is VALID [2022-04-28 06:04:19,574 INFO L290 TraceCheckUtils]: 46: Hoare triple {114877#true} assume true; {114877#true} is VALID [2022-04-28 06:04:19,574 INFO L290 TraceCheckUtils]: 45: Hoare triple {114877#true} assume !(0 == ~cond); {114877#true} is VALID [2022-04-28 06:04:19,574 INFO L290 TraceCheckUtils]: 44: Hoare triple {114877#true} ~cond := #in~cond; {114877#true} is VALID [2022-04-28 06:04:19,574 INFO L272 TraceCheckUtils]: 43: Hoare triple {115519#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {114877#true} is VALID [2022-04-28 06:04:19,575 INFO L290 TraceCheckUtils]: 42: Hoare triple {115519#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} assume !!(#t~post8 < 20);havoc #t~post8; {115519#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} is VALID [2022-04-28 06:04:19,575 INFO L290 TraceCheckUtils]: 41: Hoare triple {115519#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {115519#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} is VALID [2022-04-28 06:04:19,584 INFO L290 TraceCheckUtils]: 40: Hoare triple {115592#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {115519#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} is VALID [2022-04-28 06:04:19,584 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {114877#true} {115592#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} #98#return; {115592#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} is VALID [2022-04-28 06:04:19,584 INFO L290 TraceCheckUtils]: 38: Hoare triple {114877#true} assume true; {114877#true} is VALID [2022-04-28 06:04:19,585 INFO L290 TraceCheckUtils]: 37: Hoare triple {114877#true} assume !(0 == ~cond); {114877#true} is VALID [2022-04-28 06:04:19,585 INFO L290 TraceCheckUtils]: 36: Hoare triple {114877#true} ~cond := #in~cond; {114877#true} is VALID [2022-04-28 06:04:19,585 INFO L272 TraceCheckUtils]: 35: Hoare triple {115592#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {114877#true} is VALID [2022-04-28 06:04:19,585 INFO L290 TraceCheckUtils]: 34: Hoare triple {115592#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} assume !!(#t~post8 < 20);havoc #t~post8; {115592#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} is VALID [2022-04-28 06:04:19,586 INFO L290 TraceCheckUtils]: 33: Hoare triple {115592#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {115592#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} is VALID [2022-04-28 06:04:19,586 INFO L290 TraceCheckUtils]: 32: Hoare triple {115592#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} assume !(~r~0 > 0); {115592#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} is VALID [2022-04-28 06:04:19,587 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {114877#true} {115592#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} #96#return; {115592#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} is VALID [2022-04-28 06:04:19,587 INFO L290 TraceCheckUtils]: 30: Hoare triple {114877#true} assume true; {114877#true} is VALID [2022-04-28 06:04:19,587 INFO L290 TraceCheckUtils]: 29: Hoare triple {114877#true} assume !(0 == ~cond); {114877#true} is VALID [2022-04-28 06:04:19,587 INFO L290 TraceCheckUtils]: 28: Hoare triple {114877#true} ~cond := #in~cond; {114877#true} is VALID [2022-04-28 06:04:19,587 INFO L272 TraceCheckUtils]: 27: Hoare triple {115592#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {114877#true} is VALID [2022-04-28 06:04:19,588 INFO L290 TraceCheckUtils]: 26: Hoare triple {115592#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} assume !!(#t~post7 < 20);havoc #t~post7; {115592#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} is VALID [2022-04-28 06:04:19,588 INFO L290 TraceCheckUtils]: 25: Hoare triple {115592#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {115592#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} is VALID [2022-04-28 06:04:19,588 INFO L290 TraceCheckUtils]: 24: Hoare triple {115592#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} assume !!(0 != ~r~0); {115592#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} is VALID [2022-04-28 06:04:19,589 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {114877#true} {115592#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} #94#return; {115592#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} is VALID [2022-04-28 06:04:19,589 INFO L290 TraceCheckUtils]: 22: Hoare triple {114877#true} assume true; {114877#true} is VALID [2022-04-28 06:04:19,589 INFO L290 TraceCheckUtils]: 21: Hoare triple {114877#true} assume !(0 == ~cond); {114877#true} is VALID [2022-04-28 06:04:19,589 INFO L290 TraceCheckUtils]: 20: Hoare triple {114877#true} ~cond := #in~cond; {114877#true} is VALID [2022-04-28 06:04:19,589 INFO L272 TraceCheckUtils]: 19: Hoare triple {115592#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {114877#true} is VALID [2022-04-28 06:04:19,590 INFO L290 TraceCheckUtils]: 18: Hoare triple {115592#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} assume !!(#t~post6 < 20);havoc #t~post6; {115592#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} is VALID [2022-04-28 06:04:19,590 INFO L290 TraceCheckUtils]: 17: Hoare triple {115592#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {115592#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} is VALID [2022-04-28 06:04:19,592 INFO L290 TraceCheckUtils]: 16: Hoare triple {115665#(forall ((main_~R~0 Int)) (or (<= 2 main_~R~0) (<= (+ (* main_~R~0 main_~R~0) (* main_~R~0 2)) main_~A~0) (not (< (* main_~R~0 main_~R~0) main_~A~0))))} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {115592#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} is VALID [2022-04-28 06:04:19,594 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {114922#(not (= |assume_abort_if_not_#in~cond| 0))} {114877#true} #92#return; {115665#(forall ((main_~R~0 Int)) (or (<= 2 main_~R~0) (<= (+ (* main_~R~0 main_~R~0) (* main_~R~0 2)) main_~A~0) (not (< (* main_~R~0 main_~R~0) main_~A~0))))} is VALID [2022-04-28 06:04:19,594 INFO L290 TraceCheckUtils]: 14: Hoare triple {114922#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {114922#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 06:04:19,595 INFO L290 TraceCheckUtils]: 13: Hoare triple {115678#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {114922#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 06:04:19,595 INFO L290 TraceCheckUtils]: 12: Hoare triple {114877#true} ~cond := #in~cond; {115678#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-28 06:04:19,595 INFO L272 TraceCheckUtils]: 11: Hoare triple {114877#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {114877#true} is VALID [2022-04-28 06:04:19,595 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {114877#true} {114877#true} #90#return; {114877#true} is VALID [2022-04-28 06:04:19,595 INFO L290 TraceCheckUtils]: 9: Hoare triple {114877#true} assume true; {114877#true} is VALID [2022-04-28 06:04:19,596 INFO L290 TraceCheckUtils]: 8: Hoare triple {114877#true} assume !(0 == ~cond); {114877#true} is VALID [2022-04-28 06:04:19,596 INFO L290 TraceCheckUtils]: 7: Hoare triple {114877#true} ~cond := #in~cond; {114877#true} is VALID [2022-04-28 06:04:19,596 INFO L272 TraceCheckUtils]: 6: Hoare triple {114877#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {114877#true} is VALID [2022-04-28 06:04:19,596 INFO L290 TraceCheckUtils]: 5: Hoare triple {114877#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {114877#true} is VALID [2022-04-28 06:04:19,596 INFO L272 TraceCheckUtils]: 4: Hoare triple {114877#true} call #t~ret9 := main(); {114877#true} is VALID [2022-04-28 06:04:19,596 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {114877#true} {114877#true} #102#return; {114877#true} is VALID [2022-04-28 06:04:19,596 INFO L290 TraceCheckUtils]: 2: Hoare triple {114877#true} assume true; {114877#true} is VALID [2022-04-28 06:04:19,596 INFO L290 TraceCheckUtils]: 1: Hoare triple {114877#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {114877#true} is VALID [2022-04-28 06:04:19,596 INFO L272 TraceCheckUtils]: 0: Hoare triple {114877#true} call ULTIMATE.init(); {114877#true} is VALID [2022-04-28 06:04:19,597 INFO L134 CoverageAnalysis]: Checked inductivity of 524 backedges. 67 proven. 92 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2022-04-28 06:04:19,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:04:19,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380099271] [2022-04-28 06:04:19,597 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:04:19,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1644967497] [2022-04-28 06:04:19,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1644967497] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 06:04:19,597 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 06:04:19,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2022-04-28 06:04:19,597 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:04:19,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1661204208] [2022-04-28 06:04:19,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1661204208] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:04:19,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:04:19,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 06:04:19,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081828880] [2022-04-28 06:04:19,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:04:19,598 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 10 states have internal predecessors, (62), 8 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 8 states have call predecessors, (17), 7 states have call successors, (17) Word has length 137 [2022-04-28 06:04:19,598 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:04:19,599 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 10 states have internal predecessors, (62), 8 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 8 states have call predecessors, (17), 7 states have call successors, (17) [2022-04-28 06:04:27,595 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 96 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 06:04:27,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 06:04:27,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:04:27,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 06:04:27,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=288, Unknown=2, NotChecked=0, Total=342 [2022-04-28 06:04:27,596 INFO L87 Difference]: Start difference. First operand 707 states and 950 transitions. Second operand has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 10 states have internal predecessors, (62), 8 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 8 states have call predecessors, (17), 7 states have call successors, (17) [2022-04-28 06:04:33,987 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 06:04:40,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:04:40,084 INFO L93 Difference]: Finished difference Result 964 states and 1336 transitions. [2022-04-28 06:04:40,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 06:04:40,084 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 10 states have internal predecessors, (62), 8 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 8 states have call predecessors, (17), 7 states have call successors, (17) Word has length 137 [2022-04-28 06:04:40,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:04:40,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 10 states have internal predecessors, (62), 8 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 8 states have call predecessors, (17), 7 states have call successors, (17) [2022-04-28 06:04:40,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 161 transitions. [2022-04-28 06:04:40,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 10 states have internal predecessors, (62), 8 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 8 states have call predecessors, (17), 7 states have call successors, (17) [2022-04-28 06:04:40,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 161 transitions. [2022-04-28 06:04:40,087 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 161 transitions. [2022-04-28 06:04:44,789 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 161 edges. 159 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 06:04:44,818 INFO L225 Difference]: With dead ends: 964 [2022-04-28 06:04:44,818 INFO L226 Difference]: Without dead ends: 851 [2022-04-28 06:04:44,819 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=70, Invalid=390, Unknown=2, NotChecked=0, Total=462 [2022-04-28 06:04:44,819 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 28 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 226 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-04-28 06:04:44,820 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 455 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 56 Invalid, 1 Unknown, 226 Unchecked, 2.9s Time] [2022-04-28 06:04:44,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2022-04-28 06:04:47,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 707. [2022-04-28 06:04:47,334 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:04:47,335 INFO L82 GeneralOperation]: Start isEquivalent. First operand 851 states. Second operand has 707 states, 525 states have (on average 1.1923809523809523) internal successors, (626), 542 states have internal predecessors, (626), 163 states have call successors, (163), 20 states have call predecessors, (163), 18 states have return successors, (161), 144 states have call predecessors, (161), 161 states have call successors, (161) [2022-04-28 06:04:47,336 INFO L74 IsIncluded]: Start isIncluded. First operand 851 states. Second operand has 707 states, 525 states have (on average 1.1923809523809523) internal successors, (626), 542 states have internal predecessors, (626), 163 states have call successors, (163), 20 states have call predecessors, (163), 18 states have return successors, (161), 144 states have call predecessors, (161), 161 states have call successors, (161) [2022-04-28 06:04:47,336 INFO L87 Difference]: Start difference. First operand 851 states. Second operand has 707 states, 525 states have (on average 1.1923809523809523) internal successors, (626), 542 states have internal predecessors, (626), 163 states have call successors, (163), 20 states have call predecessors, (163), 18 states have return successors, (161), 144 states have call predecessors, (161), 161 states have call successors, (161) [2022-04-28 06:04:47,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:04:47,360 INFO L93 Difference]: Finished difference Result 851 states and 1168 transitions. [2022-04-28 06:04:47,360 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1168 transitions. [2022-04-28 06:04:47,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:04:47,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:04:47,362 INFO L74 IsIncluded]: Start isIncluded. First operand has 707 states, 525 states have (on average 1.1923809523809523) internal successors, (626), 542 states have internal predecessors, (626), 163 states have call successors, (163), 20 states have call predecessors, (163), 18 states have return successors, (161), 144 states have call predecessors, (161), 161 states have call successors, (161) Second operand 851 states. [2022-04-28 06:04:47,362 INFO L87 Difference]: Start difference. First operand has 707 states, 525 states have (on average 1.1923809523809523) internal successors, (626), 542 states have internal predecessors, (626), 163 states have call successors, (163), 20 states have call predecessors, (163), 18 states have return successors, (161), 144 states have call predecessors, (161), 161 states have call successors, (161) Second operand 851 states. [2022-04-28 06:04:47,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:04:47,386 INFO L93 Difference]: Finished difference Result 851 states and 1168 transitions. [2022-04-28 06:04:47,386 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1168 transitions. [2022-04-28 06:04:47,387 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:04:47,387 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:04:47,387 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:04:47,387 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:04:47,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 525 states have (on average 1.1923809523809523) internal successors, (626), 542 states have internal predecessors, (626), 163 states have call successors, (163), 20 states have call predecessors, (163), 18 states have return successors, (161), 144 states have call predecessors, (161), 161 states have call successors, (161) [2022-04-28 06:04:47,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 950 transitions. [2022-04-28 06:04:47,409 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 950 transitions. Word has length 137 [2022-04-28 06:04:47,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:04:47,409 INFO L495 AbstractCegarLoop]: Abstraction has 707 states and 950 transitions. [2022-04-28 06:04:47,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 10 states have internal predecessors, (62), 8 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 8 states have call predecessors, (17), 7 states have call successors, (17) [2022-04-28 06:04:47,409 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 707 states and 950 transitions. [2022-04-28 06:04:56,276 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 950 edges. 948 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 06:04:56,276 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 950 transitions. [2022-04-28 06:04:56,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-04-28 06:04:56,277 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:04:56,277 INFO L195 NwaCegarLoop]: trace histogram [15, 14, 14, 7, 7, 7, 7, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:04:56,294 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Forceful destruction successful, exit code 0 [2022-04-28 06:04:56,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:04:56,478 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:04:56,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:04:56,478 INFO L85 PathProgramCache]: Analyzing trace with hash -134259028, now seen corresponding path program 23 times [2022-04-28 06:04:56,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:04:56,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [290505775] [2022-04-28 06:04:56,479 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 06:04:56,479 INFO L85 PathProgramCache]: Analyzing trace with hash -134259028, now seen corresponding path program 24 times [2022-04-28 06:04:56,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:04:56,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183852163] [2022-04-28 06:04:56,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:04:56,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:04:56,492 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:04:56,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1173841441] [2022-04-28 06:04:56,492 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 06:04:56,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:04:56,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:04:56,493 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:04:56,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-04-28 06:04:56,670 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-04-28 06:04:56,670 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:04:56,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-28 06:04:56,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:04:56,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:04:57,456 INFO L272 TraceCheckUtils]: 0: Hoare triple {120767#true} call ULTIMATE.init(); {120767#true} is VALID [2022-04-28 06:04:57,457 INFO L290 TraceCheckUtils]: 1: Hoare triple {120767#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {120775#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:57,457 INFO L290 TraceCheckUtils]: 2: Hoare triple {120775#(<= ~counter~0 0)} assume true; {120775#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:57,458 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {120775#(<= ~counter~0 0)} {120767#true} #102#return; {120775#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:57,458 INFO L272 TraceCheckUtils]: 4: Hoare triple {120775#(<= ~counter~0 0)} call #t~ret9 := main(); {120775#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:57,458 INFO L290 TraceCheckUtils]: 5: Hoare triple {120775#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {120775#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:57,459 INFO L272 TraceCheckUtils]: 6: Hoare triple {120775#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {120775#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:57,459 INFO L290 TraceCheckUtils]: 7: Hoare triple {120775#(<= ~counter~0 0)} ~cond := #in~cond; {120775#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:57,459 INFO L290 TraceCheckUtils]: 8: Hoare triple {120775#(<= ~counter~0 0)} assume !(0 == ~cond); {120775#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:57,459 INFO L290 TraceCheckUtils]: 9: Hoare triple {120775#(<= ~counter~0 0)} assume true; {120775#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:57,460 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {120775#(<= ~counter~0 0)} {120775#(<= ~counter~0 0)} #90#return; {120775#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:57,460 INFO L272 TraceCheckUtils]: 11: Hoare triple {120775#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {120775#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:57,460 INFO L290 TraceCheckUtils]: 12: Hoare triple {120775#(<= ~counter~0 0)} ~cond := #in~cond; {120775#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:57,461 INFO L290 TraceCheckUtils]: 13: Hoare triple {120775#(<= ~counter~0 0)} assume !(0 == ~cond); {120775#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:57,461 INFO L290 TraceCheckUtils]: 14: Hoare triple {120775#(<= ~counter~0 0)} assume true; {120775#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:57,461 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {120775#(<= ~counter~0 0)} {120775#(<= ~counter~0 0)} #92#return; {120775#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:57,462 INFO L290 TraceCheckUtils]: 16: Hoare triple {120775#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {120775#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:57,464 INFO L290 TraceCheckUtils]: 17: Hoare triple {120775#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {120824#(<= ~counter~0 1)} is VALID [2022-04-28 06:04:57,465 INFO L290 TraceCheckUtils]: 18: Hoare triple {120824#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {120824#(<= ~counter~0 1)} is VALID [2022-04-28 06:04:57,465 INFO L272 TraceCheckUtils]: 19: Hoare triple {120824#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {120824#(<= ~counter~0 1)} is VALID [2022-04-28 06:04:57,465 INFO L290 TraceCheckUtils]: 20: Hoare triple {120824#(<= ~counter~0 1)} ~cond := #in~cond; {120824#(<= ~counter~0 1)} is VALID [2022-04-28 06:04:57,466 INFO L290 TraceCheckUtils]: 21: Hoare triple {120824#(<= ~counter~0 1)} assume !(0 == ~cond); {120824#(<= ~counter~0 1)} is VALID [2022-04-28 06:04:57,466 INFO L290 TraceCheckUtils]: 22: Hoare triple {120824#(<= ~counter~0 1)} assume true; {120824#(<= ~counter~0 1)} is VALID [2022-04-28 06:04:57,466 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {120824#(<= ~counter~0 1)} {120824#(<= ~counter~0 1)} #94#return; {120824#(<= ~counter~0 1)} is VALID [2022-04-28 06:04:57,467 INFO L290 TraceCheckUtils]: 24: Hoare triple {120824#(<= ~counter~0 1)} assume !!(0 != ~r~0); {120824#(<= ~counter~0 1)} is VALID [2022-04-28 06:04:57,468 INFO L290 TraceCheckUtils]: 25: Hoare triple {120824#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {120849#(<= ~counter~0 2)} is VALID [2022-04-28 06:04:57,468 INFO L290 TraceCheckUtils]: 26: Hoare triple {120849#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {120849#(<= ~counter~0 2)} is VALID [2022-04-28 06:04:57,469 INFO L272 TraceCheckUtils]: 27: Hoare triple {120849#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {120849#(<= ~counter~0 2)} is VALID [2022-04-28 06:04:57,469 INFO L290 TraceCheckUtils]: 28: Hoare triple {120849#(<= ~counter~0 2)} ~cond := #in~cond; {120849#(<= ~counter~0 2)} is VALID [2022-04-28 06:04:57,469 INFO L290 TraceCheckUtils]: 29: Hoare triple {120849#(<= ~counter~0 2)} assume !(0 == ~cond); {120849#(<= ~counter~0 2)} is VALID [2022-04-28 06:04:57,470 INFO L290 TraceCheckUtils]: 30: Hoare triple {120849#(<= ~counter~0 2)} assume true; {120849#(<= ~counter~0 2)} is VALID [2022-04-28 06:04:57,470 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {120849#(<= ~counter~0 2)} {120849#(<= ~counter~0 2)} #96#return; {120849#(<= ~counter~0 2)} is VALID [2022-04-28 06:04:57,470 INFO L290 TraceCheckUtils]: 32: Hoare triple {120849#(<= ~counter~0 2)} assume !(~r~0 > 0); {120849#(<= ~counter~0 2)} is VALID [2022-04-28 06:04:57,471 INFO L290 TraceCheckUtils]: 33: Hoare triple {120849#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {120874#(<= ~counter~0 3)} is VALID [2022-04-28 06:04:57,472 INFO L290 TraceCheckUtils]: 34: Hoare triple {120874#(<= ~counter~0 3)} assume !!(#t~post8 < 20);havoc #t~post8; {120874#(<= ~counter~0 3)} is VALID [2022-04-28 06:04:57,472 INFO L272 TraceCheckUtils]: 35: Hoare triple {120874#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {120874#(<= ~counter~0 3)} is VALID [2022-04-28 06:04:57,473 INFO L290 TraceCheckUtils]: 36: Hoare triple {120874#(<= ~counter~0 3)} ~cond := #in~cond; {120874#(<= ~counter~0 3)} is VALID [2022-04-28 06:04:57,473 INFO L290 TraceCheckUtils]: 37: Hoare triple {120874#(<= ~counter~0 3)} assume !(0 == ~cond); {120874#(<= ~counter~0 3)} is VALID [2022-04-28 06:04:57,473 INFO L290 TraceCheckUtils]: 38: Hoare triple {120874#(<= ~counter~0 3)} assume true; {120874#(<= ~counter~0 3)} is VALID [2022-04-28 06:04:57,474 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {120874#(<= ~counter~0 3)} {120874#(<= ~counter~0 3)} #98#return; {120874#(<= ~counter~0 3)} is VALID [2022-04-28 06:04:57,474 INFO L290 TraceCheckUtils]: 40: Hoare triple {120874#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {120874#(<= ~counter~0 3)} is VALID [2022-04-28 06:04:57,475 INFO L290 TraceCheckUtils]: 41: Hoare triple {120874#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {120899#(<= ~counter~0 4)} is VALID [2022-04-28 06:04:57,475 INFO L290 TraceCheckUtils]: 42: Hoare triple {120899#(<= ~counter~0 4)} assume !!(#t~post8 < 20);havoc #t~post8; {120899#(<= ~counter~0 4)} is VALID [2022-04-28 06:04:57,476 INFO L272 TraceCheckUtils]: 43: Hoare triple {120899#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {120899#(<= ~counter~0 4)} is VALID [2022-04-28 06:04:57,476 INFO L290 TraceCheckUtils]: 44: Hoare triple {120899#(<= ~counter~0 4)} ~cond := #in~cond; {120899#(<= ~counter~0 4)} is VALID [2022-04-28 06:04:57,476 INFO L290 TraceCheckUtils]: 45: Hoare triple {120899#(<= ~counter~0 4)} assume !(0 == ~cond); {120899#(<= ~counter~0 4)} is VALID [2022-04-28 06:04:57,477 INFO L290 TraceCheckUtils]: 46: Hoare triple {120899#(<= ~counter~0 4)} assume true; {120899#(<= ~counter~0 4)} is VALID [2022-04-28 06:04:57,477 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {120899#(<= ~counter~0 4)} {120899#(<= ~counter~0 4)} #98#return; {120899#(<= ~counter~0 4)} is VALID [2022-04-28 06:04:57,477 INFO L290 TraceCheckUtils]: 48: Hoare triple {120899#(<= ~counter~0 4)} assume !(~r~0 < 0); {120899#(<= ~counter~0 4)} is VALID [2022-04-28 06:04:57,479 INFO L290 TraceCheckUtils]: 49: Hoare triple {120899#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {120924#(<= ~counter~0 5)} is VALID [2022-04-28 06:04:57,479 INFO L290 TraceCheckUtils]: 50: Hoare triple {120924#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {120924#(<= ~counter~0 5)} is VALID [2022-04-28 06:04:57,479 INFO L272 TraceCheckUtils]: 51: Hoare triple {120924#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {120924#(<= ~counter~0 5)} is VALID [2022-04-28 06:04:57,480 INFO L290 TraceCheckUtils]: 52: Hoare triple {120924#(<= ~counter~0 5)} ~cond := #in~cond; {120924#(<= ~counter~0 5)} is VALID [2022-04-28 06:04:57,480 INFO L290 TraceCheckUtils]: 53: Hoare triple {120924#(<= ~counter~0 5)} assume !(0 == ~cond); {120924#(<= ~counter~0 5)} is VALID [2022-04-28 06:04:57,480 INFO L290 TraceCheckUtils]: 54: Hoare triple {120924#(<= ~counter~0 5)} assume true; {120924#(<= ~counter~0 5)} is VALID [2022-04-28 06:04:57,481 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {120924#(<= ~counter~0 5)} {120924#(<= ~counter~0 5)} #94#return; {120924#(<= ~counter~0 5)} is VALID [2022-04-28 06:04:57,481 INFO L290 TraceCheckUtils]: 56: Hoare triple {120924#(<= ~counter~0 5)} assume !!(0 != ~r~0); {120924#(<= ~counter~0 5)} is VALID [2022-04-28 06:04:57,482 INFO L290 TraceCheckUtils]: 57: Hoare triple {120924#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {120949#(<= ~counter~0 6)} is VALID [2022-04-28 06:04:57,482 INFO L290 TraceCheckUtils]: 58: Hoare triple {120949#(<= ~counter~0 6)} assume !!(#t~post7 < 20);havoc #t~post7; {120949#(<= ~counter~0 6)} is VALID [2022-04-28 06:04:57,483 INFO L272 TraceCheckUtils]: 59: Hoare triple {120949#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {120949#(<= ~counter~0 6)} is VALID [2022-04-28 06:04:57,483 INFO L290 TraceCheckUtils]: 60: Hoare triple {120949#(<= ~counter~0 6)} ~cond := #in~cond; {120949#(<= ~counter~0 6)} is VALID [2022-04-28 06:04:57,483 INFO L290 TraceCheckUtils]: 61: Hoare triple {120949#(<= ~counter~0 6)} assume !(0 == ~cond); {120949#(<= ~counter~0 6)} is VALID [2022-04-28 06:04:57,484 INFO L290 TraceCheckUtils]: 62: Hoare triple {120949#(<= ~counter~0 6)} assume true; {120949#(<= ~counter~0 6)} is VALID [2022-04-28 06:04:57,484 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {120949#(<= ~counter~0 6)} {120949#(<= ~counter~0 6)} #96#return; {120949#(<= ~counter~0 6)} is VALID [2022-04-28 06:04:57,484 INFO L290 TraceCheckUtils]: 64: Hoare triple {120949#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {120949#(<= ~counter~0 6)} is VALID [2022-04-28 06:04:57,486 INFO L290 TraceCheckUtils]: 65: Hoare triple {120949#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {120974#(<= ~counter~0 7)} is VALID [2022-04-28 06:04:57,486 INFO L290 TraceCheckUtils]: 66: Hoare triple {120974#(<= ~counter~0 7)} assume !!(#t~post7 < 20);havoc #t~post7; {120974#(<= ~counter~0 7)} is VALID [2022-04-28 06:04:57,486 INFO L272 TraceCheckUtils]: 67: Hoare triple {120974#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {120974#(<= ~counter~0 7)} is VALID [2022-04-28 06:04:57,487 INFO L290 TraceCheckUtils]: 68: Hoare triple {120974#(<= ~counter~0 7)} ~cond := #in~cond; {120974#(<= ~counter~0 7)} is VALID [2022-04-28 06:04:57,487 INFO L290 TraceCheckUtils]: 69: Hoare triple {120974#(<= ~counter~0 7)} assume !(0 == ~cond); {120974#(<= ~counter~0 7)} is VALID [2022-04-28 06:04:57,487 INFO L290 TraceCheckUtils]: 70: Hoare triple {120974#(<= ~counter~0 7)} assume true; {120974#(<= ~counter~0 7)} is VALID [2022-04-28 06:04:57,488 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {120974#(<= ~counter~0 7)} {120974#(<= ~counter~0 7)} #96#return; {120974#(<= ~counter~0 7)} is VALID [2022-04-28 06:04:57,488 INFO L290 TraceCheckUtils]: 72: Hoare triple {120974#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {120974#(<= ~counter~0 7)} is VALID [2022-04-28 06:04:57,489 INFO L290 TraceCheckUtils]: 73: Hoare triple {120974#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {120999#(<= ~counter~0 8)} is VALID [2022-04-28 06:04:57,489 INFO L290 TraceCheckUtils]: 74: Hoare triple {120999#(<= ~counter~0 8)} assume !!(#t~post7 < 20);havoc #t~post7; {120999#(<= ~counter~0 8)} is VALID [2022-04-28 06:04:57,490 INFO L272 TraceCheckUtils]: 75: Hoare triple {120999#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {120999#(<= ~counter~0 8)} is VALID [2022-04-28 06:04:57,490 INFO L290 TraceCheckUtils]: 76: Hoare triple {120999#(<= ~counter~0 8)} ~cond := #in~cond; {120999#(<= ~counter~0 8)} is VALID [2022-04-28 06:04:57,490 INFO L290 TraceCheckUtils]: 77: Hoare triple {120999#(<= ~counter~0 8)} assume !(0 == ~cond); {120999#(<= ~counter~0 8)} is VALID [2022-04-28 06:04:57,491 INFO L290 TraceCheckUtils]: 78: Hoare triple {120999#(<= ~counter~0 8)} assume true; {120999#(<= ~counter~0 8)} is VALID [2022-04-28 06:04:57,491 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {120999#(<= ~counter~0 8)} {120999#(<= ~counter~0 8)} #96#return; {120999#(<= ~counter~0 8)} is VALID [2022-04-28 06:04:57,491 INFO L290 TraceCheckUtils]: 80: Hoare triple {120999#(<= ~counter~0 8)} assume !(~r~0 > 0); {120999#(<= ~counter~0 8)} is VALID [2022-04-28 06:04:57,492 INFO L290 TraceCheckUtils]: 81: Hoare triple {120999#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {121024#(<= ~counter~0 9)} is VALID [2022-04-28 06:04:57,493 INFO L290 TraceCheckUtils]: 82: Hoare triple {121024#(<= ~counter~0 9)} assume !!(#t~post8 < 20);havoc #t~post8; {121024#(<= ~counter~0 9)} is VALID [2022-04-28 06:04:57,493 INFO L272 TraceCheckUtils]: 83: Hoare triple {121024#(<= ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {121024#(<= ~counter~0 9)} is VALID [2022-04-28 06:04:57,494 INFO L290 TraceCheckUtils]: 84: Hoare triple {121024#(<= ~counter~0 9)} ~cond := #in~cond; {121024#(<= ~counter~0 9)} is VALID [2022-04-28 06:04:57,494 INFO L290 TraceCheckUtils]: 85: Hoare triple {121024#(<= ~counter~0 9)} assume !(0 == ~cond); {121024#(<= ~counter~0 9)} is VALID [2022-04-28 06:04:57,494 INFO L290 TraceCheckUtils]: 86: Hoare triple {121024#(<= ~counter~0 9)} assume true; {121024#(<= ~counter~0 9)} is VALID [2022-04-28 06:04:57,495 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {121024#(<= ~counter~0 9)} {121024#(<= ~counter~0 9)} #98#return; {121024#(<= ~counter~0 9)} is VALID [2022-04-28 06:04:57,495 INFO L290 TraceCheckUtils]: 88: Hoare triple {121024#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {121024#(<= ~counter~0 9)} is VALID [2022-04-28 06:04:57,496 INFO L290 TraceCheckUtils]: 89: Hoare triple {121024#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {121049#(<= ~counter~0 10)} is VALID [2022-04-28 06:04:57,496 INFO L290 TraceCheckUtils]: 90: Hoare triple {121049#(<= ~counter~0 10)} assume !!(#t~post8 < 20);havoc #t~post8; {121049#(<= ~counter~0 10)} is VALID [2022-04-28 06:04:57,497 INFO L272 TraceCheckUtils]: 91: Hoare triple {121049#(<= ~counter~0 10)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {121049#(<= ~counter~0 10)} is VALID [2022-04-28 06:04:57,497 INFO L290 TraceCheckUtils]: 92: Hoare triple {121049#(<= ~counter~0 10)} ~cond := #in~cond; {121049#(<= ~counter~0 10)} is VALID [2022-04-28 06:04:57,497 INFO L290 TraceCheckUtils]: 93: Hoare triple {121049#(<= ~counter~0 10)} assume !(0 == ~cond); {121049#(<= ~counter~0 10)} is VALID [2022-04-28 06:04:57,497 INFO L290 TraceCheckUtils]: 94: Hoare triple {121049#(<= ~counter~0 10)} assume true; {121049#(<= ~counter~0 10)} is VALID [2022-04-28 06:04:57,498 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {121049#(<= ~counter~0 10)} {121049#(<= ~counter~0 10)} #98#return; {121049#(<= ~counter~0 10)} is VALID [2022-04-28 06:04:57,498 INFO L290 TraceCheckUtils]: 96: Hoare triple {121049#(<= ~counter~0 10)} assume !(~r~0 < 0); {121049#(<= ~counter~0 10)} is VALID [2022-04-28 06:04:57,499 INFO L290 TraceCheckUtils]: 97: Hoare triple {121049#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {121074#(<= ~counter~0 11)} is VALID [2022-04-28 06:04:57,500 INFO L290 TraceCheckUtils]: 98: Hoare triple {121074#(<= ~counter~0 11)} assume !!(#t~post6 < 20);havoc #t~post6; {121074#(<= ~counter~0 11)} is VALID [2022-04-28 06:04:57,500 INFO L272 TraceCheckUtils]: 99: Hoare triple {121074#(<= ~counter~0 11)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {121074#(<= ~counter~0 11)} is VALID [2022-04-28 06:04:57,500 INFO L290 TraceCheckUtils]: 100: Hoare triple {121074#(<= ~counter~0 11)} ~cond := #in~cond; {121074#(<= ~counter~0 11)} is VALID [2022-04-28 06:04:57,501 INFO L290 TraceCheckUtils]: 101: Hoare triple {121074#(<= ~counter~0 11)} assume !(0 == ~cond); {121074#(<= ~counter~0 11)} is VALID [2022-04-28 06:04:57,501 INFO L290 TraceCheckUtils]: 102: Hoare triple {121074#(<= ~counter~0 11)} assume true; {121074#(<= ~counter~0 11)} is VALID [2022-04-28 06:04:57,501 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {121074#(<= ~counter~0 11)} {121074#(<= ~counter~0 11)} #94#return; {121074#(<= ~counter~0 11)} is VALID [2022-04-28 06:04:57,502 INFO L290 TraceCheckUtils]: 104: Hoare triple {121074#(<= ~counter~0 11)} assume !!(0 != ~r~0); {121074#(<= ~counter~0 11)} is VALID [2022-04-28 06:04:57,503 INFO L290 TraceCheckUtils]: 105: Hoare triple {121074#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {121099#(<= ~counter~0 12)} is VALID [2022-04-28 06:04:57,503 INFO L290 TraceCheckUtils]: 106: Hoare triple {121099#(<= ~counter~0 12)} assume !!(#t~post7 < 20);havoc #t~post7; {121099#(<= ~counter~0 12)} is VALID [2022-04-28 06:04:57,504 INFO L272 TraceCheckUtils]: 107: Hoare triple {121099#(<= ~counter~0 12)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {121099#(<= ~counter~0 12)} is VALID [2022-04-28 06:04:57,504 INFO L290 TraceCheckUtils]: 108: Hoare triple {121099#(<= ~counter~0 12)} ~cond := #in~cond; {121099#(<= ~counter~0 12)} is VALID [2022-04-28 06:04:57,504 INFO L290 TraceCheckUtils]: 109: Hoare triple {121099#(<= ~counter~0 12)} assume !(0 == ~cond); {121099#(<= ~counter~0 12)} is VALID [2022-04-28 06:04:57,504 INFO L290 TraceCheckUtils]: 110: Hoare triple {121099#(<= ~counter~0 12)} assume true; {121099#(<= ~counter~0 12)} is VALID [2022-04-28 06:04:57,505 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {121099#(<= ~counter~0 12)} {121099#(<= ~counter~0 12)} #96#return; {121099#(<= ~counter~0 12)} is VALID [2022-04-28 06:04:57,505 INFO L290 TraceCheckUtils]: 112: Hoare triple {121099#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {121099#(<= ~counter~0 12)} is VALID [2022-04-28 06:04:57,506 INFO L290 TraceCheckUtils]: 113: Hoare triple {121099#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {121124#(<= ~counter~0 13)} is VALID [2022-04-28 06:04:57,507 INFO L290 TraceCheckUtils]: 114: Hoare triple {121124#(<= ~counter~0 13)} assume !!(#t~post7 < 20);havoc #t~post7; {121124#(<= ~counter~0 13)} is VALID [2022-04-28 06:04:57,507 INFO L272 TraceCheckUtils]: 115: Hoare triple {121124#(<= ~counter~0 13)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {121124#(<= ~counter~0 13)} is VALID [2022-04-28 06:04:57,507 INFO L290 TraceCheckUtils]: 116: Hoare triple {121124#(<= ~counter~0 13)} ~cond := #in~cond; {121124#(<= ~counter~0 13)} is VALID [2022-04-28 06:04:57,508 INFO L290 TraceCheckUtils]: 117: Hoare triple {121124#(<= ~counter~0 13)} assume !(0 == ~cond); {121124#(<= ~counter~0 13)} is VALID [2022-04-28 06:04:57,508 INFO L290 TraceCheckUtils]: 118: Hoare triple {121124#(<= ~counter~0 13)} assume true; {121124#(<= ~counter~0 13)} is VALID [2022-04-28 06:04:57,508 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {121124#(<= ~counter~0 13)} {121124#(<= ~counter~0 13)} #96#return; {121124#(<= ~counter~0 13)} is VALID [2022-04-28 06:04:57,509 INFO L290 TraceCheckUtils]: 120: Hoare triple {121124#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {121124#(<= ~counter~0 13)} is VALID [2022-04-28 06:04:57,510 INFO L290 TraceCheckUtils]: 121: Hoare triple {121124#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {121149#(<= ~counter~0 14)} is VALID [2022-04-28 06:04:57,510 INFO L290 TraceCheckUtils]: 122: Hoare triple {121149#(<= ~counter~0 14)} assume !!(#t~post7 < 20);havoc #t~post7; {121149#(<= ~counter~0 14)} is VALID [2022-04-28 06:04:57,510 INFO L272 TraceCheckUtils]: 123: Hoare triple {121149#(<= ~counter~0 14)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {121149#(<= ~counter~0 14)} is VALID [2022-04-28 06:04:57,511 INFO L290 TraceCheckUtils]: 124: Hoare triple {121149#(<= ~counter~0 14)} ~cond := #in~cond; {121149#(<= ~counter~0 14)} is VALID [2022-04-28 06:04:57,511 INFO L290 TraceCheckUtils]: 125: Hoare triple {121149#(<= ~counter~0 14)} assume !(0 == ~cond); {121149#(<= ~counter~0 14)} is VALID [2022-04-28 06:04:57,511 INFO L290 TraceCheckUtils]: 126: Hoare triple {121149#(<= ~counter~0 14)} assume true; {121149#(<= ~counter~0 14)} is VALID [2022-04-28 06:04:57,512 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {121149#(<= ~counter~0 14)} {121149#(<= ~counter~0 14)} #96#return; {121149#(<= ~counter~0 14)} is VALID [2022-04-28 06:04:57,512 INFO L290 TraceCheckUtils]: 128: Hoare triple {121149#(<= ~counter~0 14)} assume !(~r~0 > 0); {121149#(<= ~counter~0 14)} is VALID [2022-04-28 06:04:57,513 INFO L290 TraceCheckUtils]: 129: Hoare triple {121149#(<= ~counter~0 14)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {121174#(<= ~counter~0 15)} is VALID [2022-04-28 06:04:57,513 INFO L290 TraceCheckUtils]: 130: Hoare triple {121174#(<= ~counter~0 15)} assume !(#t~post8 < 20);havoc #t~post8; {121174#(<= ~counter~0 15)} is VALID [2022-04-28 06:04:57,514 INFO L290 TraceCheckUtils]: 131: Hoare triple {121174#(<= ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {121181#(<= |main_#t~post6| 15)} is VALID [2022-04-28 06:04:57,514 INFO L290 TraceCheckUtils]: 132: Hoare triple {121181#(<= |main_#t~post6| 15)} assume !(#t~post6 < 20);havoc #t~post6; {120768#false} is VALID [2022-04-28 06:04:57,514 INFO L272 TraceCheckUtils]: 133: Hoare triple {120768#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {120768#false} is VALID [2022-04-28 06:04:57,514 INFO L290 TraceCheckUtils]: 134: Hoare triple {120768#false} ~cond := #in~cond; {120768#false} is VALID [2022-04-28 06:04:57,514 INFO L290 TraceCheckUtils]: 135: Hoare triple {120768#false} assume 0 == ~cond; {120768#false} is VALID [2022-04-28 06:04:57,514 INFO L290 TraceCheckUtils]: 136: Hoare triple {120768#false} assume !false; {120768#false} is VALID [2022-04-28 06:04:57,515 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 28 proven. 498 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 06:04:57,515 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 06:04:58,359 INFO L290 TraceCheckUtils]: 136: Hoare triple {120768#false} assume !false; {120768#false} is VALID [2022-04-28 06:04:58,360 INFO L290 TraceCheckUtils]: 135: Hoare triple {120768#false} assume 0 == ~cond; {120768#false} is VALID [2022-04-28 06:04:58,360 INFO L290 TraceCheckUtils]: 134: Hoare triple {120768#false} ~cond := #in~cond; {120768#false} is VALID [2022-04-28 06:04:58,360 INFO L272 TraceCheckUtils]: 133: Hoare triple {120768#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {120768#false} is VALID [2022-04-28 06:04:58,360 INFO L290 TraceCheckUtils]: 132: Hoare triple {121209#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {120768#false} is VALID [2022-04-28 06:04:58,361 INFO L290 TraceCheckUtils]: 131: Hoare triple {121213#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {121209#(< |main_#t~post6| 20)} is VALID [2022-04-28 06:04:58,361 INFO L290 TraceCheckUtils]: 130: Hoare triple {121213#(< ~counter~0 20)} assume !(#t~post8 < 20);havoc #t~post8; {121213#(< ~counter~0 20)} is VALID [2022-04-28 06:04:58,364 INFO L290 TraceCheckUtils]: 129: Hoare triple {121220#(< ~counter~0 19)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {121213#(< ~counter~0 20)} is VALID [2022-04-28 06:04:58,365 INFO L290 TraceCheckUtils]: 128: Hoare triple {121220#(< ~counter~0 19)} assume !(~r~0 > 0); {121220#(< ~counter~0 19)} is VALID [2022-04-28 06:04:58,365 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {120767#true} {121220#(< ~counter~0 19)} #96#return; {121220#(< ~counter~0 19)} is VALID [2022-04-28 06:04:58,365 INFO L290 TraceCheckUtils]: 126: Hoare triple {120767#true} assume true; {120767#true} is VALID [2022-04-28 06:04:58,366 INFO L290 TraceCheckUtils]: 125: Hoare triple {120767#true} assume !(0 == ~cond); {120767#true} is VALID [2022-04-28 06:04:58,366 INFO L290 TraceCheckUtils]: 124: Hoare triple {120767#true} ~cond := #in~cond; {120767#true} is VALID [2022-04-28 06:04:58,366 INFO L272 TraceCheckUtils]: 123: Hoare triple {121220#(< ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {120767#true} is VALID [2022-04-28 06:04:58,366 INFO L290 TraceCheckUtils]: 122: Hoare triple {121220#(< ~counter~0 19)} assume !!(#t~post7 < 20);havoc #t~post7; {121220#(< ~counter~0 19)} is VALID [2022-04-28 06:04:58,369 INFO L290 TraceCheckUtils]: 121: Hoare triple {121245#(< ~counter~0 18)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {121220#(< ~counter~0 19)} is VALID [2022-04-28 06:04:58,369 INFO L290 TraceCheckUtils]: 120: Hoare triple {121245#(< ~counter~0 18)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {121245#(< ~counter~0 18)} is VALID [2022-04-28 06:04:58,370 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {120767#true} {121245#(< ~counter~0 18)} #96#return; {121245#(< ~counter~0 18)} is VALID [2022-04-28 06:04:58,370 INFO L290 TraceCheckUtils]: 118: Hoare triple {120767#true} assume true; {120767#true} is VALID [2022-04-28 06:04:58,370 INFO L290 TraceCheckUtils]: 117: Hoare triple {120767#true} assume !(0 == ~cond); {120767#true} is VALID [2022-04-28 06:04:58,370 INFO L290 TraceCheckUtils]: 116: Hoare triple {120767#true} ~cond := #in~cond; {120767#true} is VALID [2022-04-28 06:04:58,370 INFO L272 TraceCheckUtils]: 115: Hoare triple {121245#(< ~counter~0 18)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {120767#true} is VALID [2022-04-28 06:04:58,371 INFO L290 TraceCheckUtils]: 114: Hoare triple {121245#(< ~counter~0 18)} assume !!(#t~post7 < 20);havoc #t~post7; {121245#(< ~counter~0 18)} is VALID [2022-04-28 06:04:58,372 INFO L290 TraceCheckUtils]: 113: Hoare triple {121270#(< ~counter~0 17)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {121245#(< ~counter~0 18)} is VALID [2022-04-28 06:04:58,373 INFO L290 TraceCheckUtils]: 112: Hoare triple {121270#(< ~counter~0 17)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {121270#(< ~counter~0 17)} is VALID [2022-04-28 06:04:58,373 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {120767#true} {121270#(< ~counter~0 17)} #96#return; {121270#(< ~counter~0 17)} is VALID [2022-04-28 06:04:58,374 INFO L290 TraceCheckUtils]: 110: Hoare triple {120767#true} assume true; {120767#true} is VALID [2022-04-28 06:04:58,374 INFO L290 TraceCheckUtils]: 109: Hoare triple {120767#true} assume !(0 == ~cond); {120767#true} is VALID [2022-04-28 06:04:58,374 INFO L290 TraceCheckUtils]: 108: Hoare triple {120767#true} ~cond := #in~cond; {120767#true} is VALID [2022-04-28 06:04:58,374 INFO L272 TraceCheckUtils]: 107: Hoare triple {121270#(< ~counter~0 17)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {120767#true} is VALID [2022-04-28 06:04:58,374 INFO L290 TraceCheckUtils]: 106: Hoare triple {121270#(< ~counter~0 17)} assume !!(#t~post7 < 20);havoc #t~post7; {121270#(< ~counter~0 17)} is VALID [2022-04-28 06:04:58,375 INFO L290 TraceCheckUtils]: 105: Hoare triple {121174#(<= ~counter~0 15)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {121270#(< ~counter~0 17)} is VALID [2022-04-28 06:04:58,376 INFO L290 TraceCheckUtils]: 104: Hoare triple {121174#(<= ~counter~0 15)} assume !!(0 != ~r~0); {121174#(<= ~counter~0 15)} is VALID [2022-04-28 06:04:58,376 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {120767#true} {121174#(<= ~counter~0 15)} #94#return; {121174#(<= ~counter~0 15)} is VALID [2022-04-28 06:04:58,376 INFO L290 TraceCheckUtils]: 102: Hoare triple {120767#true} assume true; {120767#true} is VALID [2022-04-28 06:04:58,377 INFO L290 TraceCheckUtils]: 101: Hoare triple {120767#true} assume !(0 == ~cond); {120767#true} is VALID [2022-04-28 06:04:58,377 INFO L290 TraceCheckUtils]: 100: Hoare triple {120767#true} ~cond := #in~cond; {120767#true} is VALID [2022-04-28 06:04:58,377 INFO L272 TraceCheckUtils]: 99: Hoare triple {121174#(<= ~counter~0 15)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {120767#true} is VALID [2022-04-28 06:04:58,377 INFO L290 TraceCheckUtils]: 98: Hoare triple {121174#(<= ~counter~0 15)} assume !!(#t~post6 < 20);havoc #t~post6; {121174#(<= ~counter~0 15)} is VALID [2022-04-28 06:04:58,378 INFO L290 TraceCheckUtils]: 97: Hoare triple {121149#(<= ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {121174#(<= ~counter~0 15)} is VALID [2022-04-28 06:04:58,379 INFO L290 TraceCheckUtils]: 96: Hoare triple {121149#(<= ~counter~0 14)} assume !(~r~0 < 0); {121149#(<= ~counter~0 14)} is VALID [2022-04-28 06:04:58,379 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {120767#true} {121149#(<= ~counter~0 14)} #98#return; {121149#(<= ~counter~0 14)} is VALID [2022-04-28 06:04:58,379 INFO L290 TraceCheckUtils]: 94: Hoare triple {120767#true} assume true; {120767#true} is VALID [2022-04-28 06:04:58,379 INFO L290 TraceCheckUtils]: 93: Hoare triple {120767#true} assume !(0 == ~cond); {120767#true} is VALID [2022-04-28 06:04:58,379 INFO L290 TraceCheckUtils]: 92: Hoare triple {120767#true} ~cond := #in~cond; {120767#true} is VALID [2022-04-28 06:04:58,379 INFO L272 TraceCheckUtils]: 91: Hoare triple {121149#(<= ~counter~0 14)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {120767#true} is VALID [2022-04-28 06:04:58,380 INFO L290 TraceCheckUtils]: 90: Hoare triple {121149#(<= ~counter~0 14)} assume !!(#t~post8 < 20);havoc #t~post8; {121149#(<= ~counter~0 14)} is VALID [2022-04-28 06:04:58,381 INFO L290 TraceCheckUtils]: 89: Hoare triple {121124#(<= ~counter~0 13)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {121149#(<= ~counter~0 14)} is VALID [2022-04-28 06:04:58,381 INFO L290 TraceCheckUtils]: 88: Hoare triple {121124#(<= ~counter~0 13)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {121124#(<= ~counter~0 13)} is VALID [2022-04-28 06:04:58,382 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {120767#true} {121124#(<= ~counter~0 13)} #98#return; {121124#(<= ~counter~0 13)} is VALID [2022-04-28 06:04:58,382 INFO L290 TraceCheckUtils]: 86: Hoare triple {120767#true} assume true; {120767#true} is VALID [2022-04-28 06:04:58,382 INFO L290 TraceCheckUtils]: 85: Hoare triple {120767#true} assume !(0 == ~cond); {120767#true} is VALID [2022-04-28 06:04:58,382 INFO L290 TraceCheckUtils]: 84: Hoare triple {120767#true} ~cond := #in~cond; {120767#true} is VALID [2022-04-28 06:04:58,382 INFO L272 TraceCheckUtils]: 83: Hoare triple {121124#(<= ~counter~0 13)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {120767#true} is VALID [2022-04-28 06:04:58,383 INFO L290 TraceCheckUtils]: 82: Hoare triple {121124#(<= ~counter~0 13)} assume !!(#t~post8 < 20);havoc #t~post8; {121124#(<= ~counter~0 13)} is VALID [2022-04-28 06:04:58,384 INFO L290 TraceCheckUtils]: 81: Hoare triple {121099#(<= ~counter~0 12)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {121124#(<= ~counter~0 13)} is VALID [2022-04-28 06:04:58,384 INFO L290 TraceCheckUtils]: 80: Hoare triple {121099#(<= ~counter~0 12)} assume !(~r~0 > 0); {121099#(<= ~counter~0 12)} is VALID [2022-04-28 06:04:58,385 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {120767#true} {121099#(<= ~counter~0 12)} #96#return; {121099#(<= ~counter~0 12)} is VALID [2022-04-28 06:04:58,385 INFO L290 TraceCheckUtils]: 78: Hoare triple {120767#true} assume true; {120767#true} is VALID [2022-04-28 06:04:58,385 INFO L290 TraceCheckUtils]: 77: Hoare triple {120767#true} assume !(0 == ~cond); {120767#true} is VALID [2022-04-28 06:04:58,385 INFO L290 TraceCheckUtils]: 76: Hoare triple {120767#true} ~cond := #in~cond; {120767#true} is VALID [2022-04-28 06:04:58,385 INFO L272 TraceCheckUtils]: 75: Hoare triple {121099#(<= ~counter~0 12)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {120767#true} is VALID [2022-04-28 06:04:58,386 INFO L290 TraceCheckUtils]: 74: Hoare triple {121099#(<= ~counter~0 12)} assume !!(#t~post7 < 20);havoc #t~post7; {121099#(<= ~counter~0 12)} is VALID [2022-04-28 06:04:58,387 INFO L290 TraceCheckUtils]: 73: Hoare triple {121074#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {121099#(<= ~counter~0 12)} is VALID [2022-04-28 06:04:58,387 INFO L290 TraceCheckUtils]: 72: Hoare triple {121074#(<= ~counter~0 11)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {121074#(<= ~counter~0 11)} is VALID [2022-04-28 06:04:58,388 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {120767#true} {121074#(<= ~counter~0 11)} #96#return; {121074#(<= ~counter~0 11)} is VALID [2022-04-28 06:04:58,388 INFO L290 TraceCheckUtils]: 70: Hoare triple {120767#true} assume true; {120767#true} is VALID [2022-04-28 06:04:58,388 INFO L290 TraceCheckUtils]: 69: Hoare triple {120767#true} assume !(0 == ~cond); {120767#true} is VALID [2022-04-28 06:04:58,388 INFO L290 TraceCheckUtils]: 68: Hoare triple {120767#true} ~cond := #in~cond; {120767#true} is VALID [2022-04-28 06:04:58,388 INFO L272 TraceCheckUtils]: 67: Hoare triple {121074#(<= ~counter~0 11)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {120767#true} is VALID [2022-04-28 06:04:58,389 INFO L290 TraceCheckUtils]: 66: Hoare triple {121074#(<= ~counter~0 11)} assume !!(#t~post7 < 20);havoc #t~post7; {121074#(<= ~counter~0 11)} is VALID [2022-04-28 06:04:58,390 INFO L290 TraceCheckUtils]: 65: Hoare triple {121049#(<= ~counter~0 10)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {121074#(<= ~counter~0 11)} is VALID [2022-04-28 06:04:58,390 INFO L290 TraceCheckUtils]: 64: Hoare triple {121049#(<= ~counter~0 10)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {121049#(<= ~counter~0 10)} is VALID [2022-04-28 06:04:58,391 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {120767#true} {121049#(<= ~counter~0 10)} #96#return; {121049#(<= ~counter~0 10)} is VALID [2022-04-28 06:04:58,391 INFO L290 TraceCheckUtils]: 62: Hoare triple {120767#true} assume true; {120767#true} is VALID [2022-04-28 06:04:58,391 INFO L290 TraceCheckUtils]: 61: Hoare triple {120767#true} assume !(0 == ~cond); {120767#true} is VALID [2022-04-28 06:04:58,391 INFO L290 TraceCheckUtils]: 60: Hoare triple {120767#true} ~cond := #in~cond; {120767#true} is VALID [2022-04-28 06:04:58,391 INFO L272 TraceCheckUtils]: 59: Hoare triple {121049#(<= ~counter~0 10)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {120767#true} is VALID [2022-04-28 06:04:58,392 INFO L290 TraceCheckUtils]: 58: Hoare triple {121049#(<= ~counter~0 10)} assume !!(#t~post7 < 20);havoc #t~post7; {121049#(<= ~counter~0 10)} is VALID [2022-04-28 06:04:58,393 INFO L290 TraceCheckUtils]: 57: Hoare triple {121024#(<= ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {121049#(<= ~counter~0 10)} is VALID [2022-04-28 06:04:58,393 INFO L290 TraceCheckUtils]: 56: Hoare triple {121024#(<= ~counter~0 9)} assume !!(0 != ~r~0); {121024#(<= ~counter~0 9)} is VALID [2022-04-28 06:04:58,394 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {120767#true} {121024#(<= ~counter~0 9)} #94#return; {121024#(<= ~counter~0 9)} is VALID [2022-04-28 06:04:58,394 INFO L290 TraceCheckUtils]: 54: Hoare triple {120767#true} assume true; {120767#true} is VALID [2022-04-28 06:04:58,394 INFO L290 TraceCheckUtils]: 53: Hoare triple {120767#true} assume !(0 == ~cond); {120767#true} is VALID [2022-04-28 06:04:58,394 INFO L290 TraceCheckUtils]: 52: Hoare triple {120767#true} ~cond := #in~cond; {120767#true} is VALID [2022-04-28 06:04:58,394 INFO L272 TraceCheckUtils]: 51: Hoare triple {121024#(<= ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {120767#true} is VALID [2022-04-28 06:04:58,394 INFO L290 TraceCheckUtils]: 50: Hoare triple {121024#(<= ~counter~0 9)} assume !!(#t~post6 < 20);havoc #t~post6; {121024#(<= ~counter~0 9)} is VALID [2022-04-28 06:04:58,396 INFO L290 TraceCheckUtils]: 49: Hoare triple {120999#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {121024#(<= ~counter~0 9)} is VALID [2022-04-28 06:04:58,396 INFO L290 TraceCheckUtils]: 48: Hoare triple {120999#(<= ~counter~0 8)} assume !(~r~0 < 0); {120999#(<= ~counter~0 8)} is VALID [2022-04-28 06:04:58,397 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {120767#true} {120999#(<= ~counter~0 8)} #98#return; {120999#(<= ~counter~0 8)} is VALID [2022-04-28 06:04:58,397 INFO L290 TraceCheckUtils]: 46: Hoare triple {120767#true} assume true; {120767#true} is VALID [2022-04-28 06:04:58,397 INFO L290 TraceCheckUtils]: 45: Hoare triple {120767#true} assume !(0 == ~cond); {120767#true} is VALID [2022-04-28 06:04:58,397 INFO L290 TraceCheckUtils]: 44: Hoare triple {120767#true} ~cond := #in~cond; {120767#true} is VALID [2022-04-28 06:04:58,397 INFO L272 TraceCheckUtils]: 43: Hoare triple {120999#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {120767#true} is VALID [2022-04-28 06:04:58,397 INFO L290 TraceCheckUtils]: 42: Hoare triple {120999#(<= ~counter~0 8)} assume !!(#t~post8 < 20);havoc #t~post8; {120999#(<= ~counter~0 8)} is VALID [2022-04-28 06:04:58,399 INFO L290 TraceCheckUtils]: 41: Hoare triple {120974#(<= ~counter~0 7)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {120999#(<= ~counter~0 8)} is VALID [2022-04-28 06:04:58,399 INFO L290 TraceCheckUtils]: 40: Hoare triple {120974#(<= ~counter~0 7)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {120974#(<= ~counter~0 7)} is VALID [2022-04-28 06:04:58,400 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {120767#true} {120974#(<= ~counter~0 7)} #98#return; {120974#(<= ~counter~0 7)} is VALID [2022-04-28 06:04:58,400 INFO L290 TraceCheckUtils]: 38: Hoare triple {120767#true} assume true; {120767#true} is VALID [2022-04-28 06:04:58,400 INFO L290 TraceCheckUtils]: 37: Hoare triple {120767#true} assume !(0 == ~cond); {120767#true} is VALID [2022-04-28 06:04:58,400 INFO L290 TraceCheckUtils]: 36: Hoare triple {120767#true} ~cond := #in~cond; {120767#true} is VALID [2022-04-28 06:04:58,400 INFO L272 TraceCheckUtils]: 35: Hoare triple {120974#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {120767#true} is VALID [2022-04-28 06:04:58,400 INFO L290 TraceCheckUtils]: 34: Hoare triple {120974#(<= ~counter~0 7)} assume !!(#t~post8 < 20);havoc #t~post8; {120974#(<= ~counter~0 7)} is VALID [2022-04-28 06:04:58,402 INFO L290 TraceCheckUtils]: 33: Hoare triple {120949#(<= ~counter~0 6)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {120974#(<= ~counter~0 7)} is VALID [2022-04-28 06:04:58,402 INFO L290 TraceCheckUtils]: 32: Hoare triple {120949#(<= ~counter~0 6)} assume !(~r~0 > 0); {120949#(<= ~counter~0 6)} is VALID [2022-04-28 06:04:58,403 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {120767#true} {120949#(<= ~counter~0 6)} #96#return; {120949#(<= ~counter~0 6)} is VALID [2022-04-28 06:04:58,403 INFO L290 TraceCheckUtils]: 30: Hoare triple {120767#true} assume true; {120767#true} is VALID [2022-04-28 06:04:58,403 INFO L290 TraceCheckUtils]: 29: Hoare triple {120767#true} assume !(0 == ~cond); {120767#true} is VALID [2022-04-28 06:04:58,403 INFO L290 TraceCheckUtils]: 28: Hoare triple {120767#true} ~cond := #in~cond; {120767#true} is VALID [2022-04-28 06:04:58,403 INFO L272 TraceCheckUtils]: 27: Hoare triple {120949#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {120767#true} is VALID [2022-04-28 06:04:58,404 INFO L290 TraceCheckUtils]: 26: Hoare triple {120949#(<= ~counter~0 6)} assume !!(#t~post7 < 20);havoc #t~post7; {120949#(<= ~counter~0 6)} is VALID [2022-04-28 06:04:58,405 INFO L290 TraceCheckUtils]: 25: Hoare triple {120924#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {120949#(<= ~counter~0 6)} is VALID [2022-04-28 06:04:58,405 INFO L290 TraceCheckUtils]: 24: Hoare triple {120924#(<= ~counter~0 5)} assume !!(0 != ~r~0); {120924#(<= ~counter~0 5)} is VALID [2022-04-28 06:04:58,406 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {120767#true} {120924#(<= ~counter~0 5)} #94#return; {120924#(<= ~counter~0 5)} is VALID [2022-04-28 06:04:58,406 INFO L290 TraceCheckUtils]: 22: Hoare triple {120767#true} assume true; {120767#true} is VALID [2022-04-28 06:04:58,406 INFO L290 TraceCheckUtils]: 21: Hoare triple {120767#true} assume !(0 == ~cond); {120767#true} is VALID [2022-04-28 06:04:58,406 INFO L290 TraceCheckUtils]: 20: Hoare triple {120767#true} ~cond := #in~cond; {120767#true} is VALID [2022-04-28 06:04:58,406 INFO L272 TraceCheckUtils]: 19: Hoare triple {120924#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {120767#true} is VALID [2022-04-28 06:04:58,407 INFO L290 TraceCheckUtils]: 18: Hoare triple {120924#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {120924#(<= ~counter~0 5)} is VALID [2022-04-28 06:04:58,409 INFO L290 TraceCheckUtils]: 17: Hoare triple {120899#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {120924#(<= ~counter~0 5)} is VALID [2022-04-28 06:04:58,409 INFO L290 TraceCheckUtils]: 16: Hoare triple {120899#(<= ~counter~0 4)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {120899#(<= ~counter~0 4)} is VALID [2022-04-28 06:04:58,409 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {120767#true} {120899#(<= ~counter~0 4)} #92#return; {120899#(<= ~counter~0 4)} is VALID [2022-04-28 06:04:58,410 INFO L290 TraceCheckUtils]: 14: Hoare triple {120767#true} assume true; {120767#true} is VALID [2022-04-28 06:04:58,410 INFO L290 TraceCheckUtils]: 13: Hoare triple {120767#true} assume !(0 == ~cond); {120767#true} is VALID [2022-04-28 06:04:58,410 INFO L290 TraceCheckUtils]: 12: Hoare triple {120767#true} ~cond := #in~cond; {120767#true} is VALID [2022-04-28 06:04:58,410 INFO L272 TraceCheckUtils]: 11: Hoare triple {120899#(<= ~counter~0 4)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {120767#true} is VALID [2022-04-28 06:04:58,410 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {120767#true} {120899#(<= ~counter~0 4)} #90#return; {120899#(<= ~counter~0 4)} is VALID [2022-04-28 06:04:58,410 INFO L290 TraceCheckUtils]: 9: Hoare triple {120767#true} assume true; {120767#true} is VALID [2022-04-28 06:04:58,410 INFO L290 TraceCheckUtils]: 8: Hoare triple {120767#true} assume !(0 == ~cond); {120767#true} is VALID [2022-04-28 06:04:58,411 INFO L290 TraceCheckUtils]: 7: Hoare triple {120767#true} ~cond := #in~cond; {120767#true} is VALID [2022-04-28 06:04:58,411 INFO L272 TraceCheckUtils]: 6: Hoare triple {120899#(<= ~counter~0 4)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {120767#true} is VALID [2022-04-28 06:04:58,411 INFO L290 TraceCheckUtils]: 5: Hoare triple {120899#(<= ~counter~0 4)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {120899#(<= ~counter~0 4)} is VALID [2022-04-28 06:04:58,411 INFO L272 TraceCheckUtils]: 4: Hoare triple {120899#(<= ~counter~0 4)} call #t~ret9 := main(); {120899#(<= ~counter~0 4)} is VALID [2022-04-28 06:04:58,412 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {120899#(<= ~counter~0 4)} {120767#true} #102#return; {120899#(<= ~counter~0 4)} is VALID [2022-04-28 06:04:58,412 INFO L290 TraceCheckUtils]: 2: Hoare triple {120899#(<= ~counter~0 4)} assume true; {120899#(<= ~counter~0 4)} is VALID [2022-04-28 06:04:58,413 INFO L290 TraceCheckUtils]: 1: Hoare triple {120767#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {120899#(<= ~counter~0 4)} is VALID [2022-04-28 06:04:58,413 INFO L272 TraceCheckUtils]: 0: Hoare triple {120767#true} call ULTIMATE.init(); {120767#true} is VALID [2022-04-28 06:04:58,413 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 28 proven. 134 refuted. 0 times theorem prover too weak. 368 trivial. 0 not checked. [2022-04-28 06:04:58,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:04:58,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183852163] [2022-04-28 06:04:58,413 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:04:58,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1173841441] [2022-04-28 06:04:58,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1173841441] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 06:04:58,414 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 06:04:58,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 24 [2022-04-28 06:04:58,414 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:04:58,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [290505775] [2022-04-28 06:04:58,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [290505775] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:04:58,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:04:58,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-28 06:04:58,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810192563] [2022-04-28 06:04:58,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:04:58,415 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.157894736842105) internal successors, (98), 18 states have internal predecessors, (98), 17 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) Word has length 137 [2022-04-28 06:04:58,415 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:04:58,415 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 5.157894736842105) internal successors, (98), 18 states have internal predecessors, (98), 17 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-28 06:04:58,583 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:04:58,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-28 06:04:58,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:04:58,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-28 06:04:58,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-28 06:04:58,584 INFO L87 Difference]: Start difference. First operand 707 states and 950 transitions. Second operand has 19 states, 19 states have (on average 5.157894736842105) internal successors, (98), 18 states have internal predecessors, (98), 17 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-28 06:05:05,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:05:05,074 INFO L93 Difference]: Finished difference Result 807 states and 1089 transitions. [2022-04-28 06:05:05,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-28 06:05:05,074 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.157894736842105) internal successors, (98), 18 states have internal predecessors, (98), 17 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) Word has length 137 [2022-04-28 06:05:05,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:05:05,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 5.157894736842105) internal successors, (98), 18 states have internal predecessors, (98), 17 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-28 06:05:05,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 316 transitions. [2022-04-28 06:05:05,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 5.157894736842105) internal successors, (98), 18 states have internal predecessors, (98), 17 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-28 06:05:05,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 316 transitions. [2022-04-28 06:05:05,080 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 316 transitions. [2022-04-28 06:05:05,465 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 316 edges. 316 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:05:05,503 INFO L225 Difference]: With dead ends: 807 [2022-04-28 06:05:05,503 INFO L226 Difference]: Without dead ends: 802 [2022-04-28 06:05:05,504 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 250 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=479, Invalid=781, Unknown=0, NotChecked=0, Total=1260 [2022-04-28 06:05:05,508 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 354 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 281 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 281 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-28 06:05:05,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 341 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [281 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-28 06:05:05,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2022-04-28 06:05:09,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 775. [2022-04-28 06:05:09,373 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:05:09,374 INFO L82 GeneralOperation]: Start isEquivalent. First operand 802 states. Second operand has 775 states, 579 states have (on average 1.2037996545768566) internal successors, (697), 596 states have internal predecessors, (697), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 157 states have call predecessors, (174), 174 states have call successors, (174) [2022-04-28 06:05:09,375 INFO L74 IsIncluded]: Start isIncluded. First operand 802 states. Second operand has 775 states, 579 states have (on average 1.2037996545768566) internal successors, (697), 596 states have internal predecessors, (697), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 157 states have call predecessors, (174), 174 states have call successors, (174) [2022-04-28 06:05:09,375 INFO L87 Difference]: Start difference. First operand 802 states. Second operand has 775 states, 579 states have (on average 1.2037996545768566) internal successors, (697), 596 states have internal predecessors, (697), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 157 states have call predecessors, (174), 174 states have call successors, (174) [2022-04-28 06:05:09,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:05:09,405 INFO L93 Difference]: Finished difference Result 802 states and 1078 transitions. [2022-04-28 06:05:09,405 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 1078 transitions. [2022-04-28 06:05:09,406 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:05:09,406 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:05:09,407 INFO L74 IsIncluded]: Start isIncluded. First operand has 775 states, 579 states have (on average 1.2037996545768566) internal successors, (697), 596 states have internal predecessors, (697), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 157 states have call predecessors, (174), 174 states have call successors, (174) Second operand 802 states. [2022-04-28 06:05:09,408 INFO L87 Difference]: Start difference. First operand has 775 states, 579 states have (on average 1.2037996545768566) internal successors, (697), 596 states have internal predecessors, (697), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 157 states have call predecessors, (174), 174 states have call successors, (174) Second operand 802 states. [2022-04-28 06:05:09,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:05:09,441 INFO L93 Difference]: Finished difference Result 802 states and 1078 transitions. [2022-04-28 06:05:09,441 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 1078 transitions. [2022-04-28 06:05:09,442 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:05:09,442 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:05:09,442 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:05:09,442 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:05:09,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 775 states, 579 states have (on average 1.2037996545768566) internal successors, (697), 596 states have internal predecessors, (697), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 157 states have call predecessors, (174), 174 states have call successors, (174) [2022-04-28 06:05:09,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 1047 transitions. [2022-04-28 06:05:09,497 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 1047 transitions. Word has length 137 [2022-04-28 06:05:09,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:05:09,497 INFO L495 AbstractCegarLoop]: Abstraction has 775 states and 1047 transitions. [2022-04-28 06:05:09,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.157894736842105) internal successors, (98), 18 states have internal predecessors, (98), 17 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-28 06:05:09,497 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 775 states and 1047 transitions. [2022-04-28 06:05:27,000 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1047 edges. 1044 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-28 06:05:27,000 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 1047 transitions. [2022-04-28 06:05:27,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-04-28 06:05:27,002 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:05:27,003 INFO L195 NwaCegarLoop]: trace histogram [15, 14, 14, 8, 7, 7, 7, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:05:27,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Forceful destruction successful, exit code 0 [2022-04-28 06:05:27,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2022-04-28 06:05:27,203 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:05:27,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:05:27,204 INFO L85 PathProgramCache]: Analyzing trace with hash -895861967, now seen corresponding path program 19 times [2022-04-28 06:05:27,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:05:27,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1006983798] [2022-04-28 06:05:27,204 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 06:05:27,204 INFO L85 PathProgramCache]: Analyzing trace with hash -895861967, now seen corresponding path program 20 times [2022-04-28 06:05:27,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:05:27,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444322816] [2022-04-28 06:05:27,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:05:27,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:05:27,224 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:05:27,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [608644077] [2022-04-28 06:05:27,225 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 06:05:27,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:05:27,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:05:27,226 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:05:27,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2022-04-28 06:05:27,324 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 06:05:27,324 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:05:27,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-28 06:05:27,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:05:27,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:05:28,416 INFO L272 TraceCheckUtils]: 0: Hoare triple {126404#true} call ULTIMATE.init(); {126404#true} is VALID [2022-04-28 06:05:28,417 INFO L290 TraceCheckUtils]: 1: Hoare triple {126404#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {126412#(<= ~counter~0 0)} is VALID [2022-04-28 06:05:28,417 INFO L290 TraceCheckUtils]: 2: Hoare triple {126412#(<= ~counter~0 0)} assume true; {126412#(<= ~counter~0 0)} is VALID [2022-04-28 06:05:28,418 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {126412#(<= ~counter~0 0)} {126404#true} #102#return; {126412#(<= ~counter~0 0)} is VALID [2022-04-28 06:05:28,418 INFO L272 TraceCheckUtils]: 4: Hoare triple {126412#(<= ~counter~0 0)} call #t~ret9 := main(); {126412#(<= ~counter~0 0)} is VALID [2022-04-28 06:05:28,418 INFO L290 TraceCheckUtils]: 5: Hoare triple {126412#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {126412#(<= ~counter~0 0)} is VALID [2022-04-28 06:05:28,419 INFO L272 TraceCheckUtils]: 6: Hoare triple {126412#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {126412#(<= ~counter~0 0)} is VALID [2022-04-28 06:05:28,419 INFO L290 TraceCheckUtils]: 7: Hoare triple {126412#(<= ~counter~0 0)} ~cond := #in~cond; {126412#(<= ~counter~0 0)} is VALID [2022-04-28 06:05:28,419 INFO L290 TraceCheckUtils]: 8: Hoare triple {126412#(<= ~counter~0 0)} assume !(0 == ~cond); {126412#(<= ~counter~0 0)} is VALID [2022-04-28 06:05:28,420 INFO L290 TraceCheckUtils]: 9: Hoare triple {126412#(<= ~counter~0 0)} assume true; {126412#(<= ~counter~0 0)} is VALID [2022-04-28 06:05:28,420 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {126412#(<= ~counter~0 0)} {126412#(<= ~counter~0 0)} #90#return; {126412#(<= ~counter~0 0)} is VALID [2022-04-28 06:05:28,421 INFO L272 TraceCheckUtils]: 11: Hoare triple {126412#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {126412#(<= ~counter~0 0)} is VALID [2022-04-28 06:05:28,421 INFO L290 TraceCheckUtils]: 12: Hoare triple {126412#(<= ~counter~0 0)} ~cond := #in~cond; {126412#(<= ~counter~0 0)} is VALID [2022-04-28 06:05:28,421 INFO L290 TraceCheckUtils]: 13: Hoare triple {126412#(<= ~counter~0 0)} assume !(0 == ~cond); {126412#(<= ~counter~0 0)} is VALID [2022-04-28 06:05:28,421 INFO L290 TraceCheckUtils]: 14: Hoare triple {126412#(<= ~counter~0 0)} assume true; {126412#(<= ~counter~0 0)} is VALID [2022-04-28 06:05:28,422 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {126412#(<= ~counter~0 0)} {126412#(<= ~counter~0 0)} #92#return; {126412#(<= ~counter~0 0)} is VALID [2022-04-28 06:05:28,422 INFO L290 TraceCheckUtils]: 16: Hoare triple {126412#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {126412#(<= ~counter~0 0)} is VALID [2022-04-28 06:05:28,426 INFO L290 TraceCheckUtils]: 17: Hoare triple {126412#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {126461#(<= ~counter~0 1)} is VALID [2022-04-28 06:05:28,427 INFO L290 TraceCheckUtils]: 18: Hoare triple {126461#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {126461#(<= ~counter~0 1)} is VALID [2022-04-28 06:05:28,427 INFO L272 TraceCheckUtils]: 19: Hoare triple {126461#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {126461#(<= ~counter~0 1)} is VALID [2022-04-28 06:05:28,428 INFO L290 TraceCheckUtils]: 20: Hoare triple {126461#(<= ~counter~0 1)} ~cond := #in~cond; {126461#(<= ~counter~0 1)} is VALID [2022-04-28 06:05:28,428 INFO L290 TraceCheckUtils]: 21: Hoare triple {126461#(<= ~counter~0 1)} assume !(0 == ~cond); {126461#(<= ~counter~0 1)} is VALID [2022-04-28 06:05:28,428 INFO L290 TraceCheckUtils]: 22: Hoare triple {126461#(<= ~counter~0 1)} assume true; {126461#(<= ~counter~0 1)} is VALID [2022-04-28 06:05:28,429 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {126461#(<= ~counter~0 1)} {126461#(<= ~counter~0 1)} #94#return; {126461#(<= ~counter~0 1)} is VALID [2022-04-28 06:05:28,429 INFO L290 TraceCheckUtils]: 24: Hoare triple {126461#(<= ~counter~0 1)} assume !!(0 != ~r~0); {126461#(<= ~counter~0 1)} is VALID [2022-04-28 06:05:28,433 INFO L290 TraceCheckUtils]: 25: Hoare triple {126461#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {126486#(<= ~counter~0 2)} is VALID [2022-04-28 06:05:28,433 INFO L290 TraceCheckUtils]: 26: Hoare triple {126486#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {126486#(<= ~counter~0 2)} is VALID [2022-04-28 06:05:28,434 INFO L272 TraceCheckUtils]: 27: Hoare triple {126486#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {126486#(<= ~counter~0 2)} is VALID [2022-04-28 06:05:28,434 INFO L290 TraceCheckUtils]: 28: Hoare triple {126486#(<= ~counter~0 2)} ~cond := #in~cond; {126486#(<= ~counter~0 2)} is VALID [2022-04-28 06:05:28,434 INFO L290 TraceCheckUtils]: 29: Hoare triple {126486#(<= ~counter~0 2)} assume !(0 == ~cond); {126486#(<= ~counter~0 2)} is VALID [2022-04-28 06:05:28,435 INFO L290 TraceCheckUtils]: 30: Hoare triple {126486#(<= ~counter~0 2)} assume true; {126486#(<= ~counter~0 2)} is VALID [2022-04-28 06:05:28,435 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {126486#(<= ~counter~0 2)} {126486#(<= ~counter~0 2)} #96#return; {126486#(<= ~counter~0 2)} is VALID [2022-04-28 06:05:28,436 INFO L290 TraceCheckUtils]: 32: Hoare triple {126486#(<= ~counter~0 2)} assume !(~r~0 > 0); {126486#(<= ~counter~0 2)} is VALID [2022-04-28 06:05:28,438 INFO L290 TraceCheckUtils]: 33: Hoare triple {126486#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {126511#(<= ~counter~0 3)} is VALID [2022-04-28 06:05:28,438 INFO L290 TraceCheckUtils]: 34: Hoare triple {126511#(<= ~counter~0 3)} assume !!(#t~post8 < 20);havoc #t~post8; {126511#(<= ~counter~0 3)} is VALID [2022-04-28 06:05:28,439 INFO L272 TraceCheckUtils]: 35: Hoare triple {126511#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {126511#(<= ~counter~0 3)} is VALID [2022-04-28 06:05:28,439 INFO L290 TraceCheckUtils]: 36: Hoare triple {126511#(<= ~counter~0 3)} ~cond := #in~cond; {126511#(<= ~counter~0 3)} is VALID [2022-04-28 06:05:28,439 INFO L290 TraceCheckUtils]: 37: Hoare triple {126511#(<= ~counter~0 3)} assume !(0 == ~cond); {126511#(<= ~counter~0 3)} is VALID [2022-04-28 06:05:28,440 INFO L290 TraceCheckUtils]: 38: Hoare triple {126511#(<= ~counter~0 3)} assume true; {126511#(<= ~counter~0 3)} is VALID [2022-04-28 06:05:28,440 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {126511#(<= ~counter~0 3)} {126511#(<= ~counter~0 3)} #98#return; {126511#(<= ~counter~0 3)} is VALID [2022-04-28 06:05:28,440 INFO L290 TraceCheckUtils]: 40: Hoare triple {126511#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {126511#(<= ~counter~0 3)} is VALID [2022-04-28 06:05:28,443 INFO L290 TraceCheckUtils]: 41: Hoare triple {126511#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {126536#(<= ~counter~0 4)} is VALID [2022-04-28 06:05:28,444 INFO L290 TraceCheckUtils]: 42: Hoare triple {126536#(<= ~counter~0 4)} assume !!(#t~post8 < 20);havoc #t~post8; {126536#(<= ~counter~0 4)} is VALID [2022-04-28 06:05:28,444 INFO L272 TraceCheckUtils]: 43: Hoare triple {126536#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {126536#(<= ~counter~0 4)} is VALID [2022-04-28 06:05:28,445 INFO L290 TraceCheckUtils]: 44: Hoare triple {126536#(<= ~counter~0 4)} ~cond := #in~cond; {126536#(<= ~counter~0 4)} is VALID [2022-04-28 06:05:28,445 INFO L290 TraceCheckUtils]: 45: Hoare triple {126536#(<= ~counter~0 4)} assume !(0 == ~cond); {126536#(<= ~counter~0 4)} is VALID [2022-04-28 06:05:28,445 INFO L290 TraceCheckUtils]: 46: Hoare triple {126536#(<= ~counter~0 4)} assume true; {126536#(<= ~counter~0 4)} is VALID [2022-04-28 06:05:28,446 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {126536#(<= ~counter~0 4)} {126536#(<= ~counter~0 4)} #98#return; {126536#(<= ~counter~0 4)} is VALID [2022-04-28 06:05:28,446 INFO L290 TraceCheckUtils]: 48: Hoare triple {126536#(<= ~counter~0 4)} assume !(~r~0 < 0); {126536#(<= ~counter~0 4)} is VALID [2022-04-28 06:05:28,449 INFO L290 TraceCheckUtils]: 49: Hoare triple {126536#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {126561#(<= ~counter~0 5)} is VALID [2022-04-28 06:05:28,449 INFO L290 TraceCheckUtils]: 50: Hoare triple {126561#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {126561#(<= ~counter~0 5)} is VALID [2022-04-28 06:05:28,450 INFO L272 TraceCheckUtils]: 51: Hoare triple {126561#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {126561#(<= ~counter~0 5)} is VALID [2022-04-28 06:05:28,450 INFO L290 TraceCheckUtils]: 52: Hoare triple {126561#(<= ~counter~0 5)} ~cond := #in~cond; {126561#(<= ~counter~0 5)} is VALID [2022-04-28 06:05:28,450 INFO L290 TraceCheckUtils]: 53: Hoare triple {126561#(<= ~counter~0 5)} assume !(0 == ~cond); {126561#(<= ~counter~0 5)} is VALID [2022-04-28 06:05:28,451 INFO L290 TraceCheckUtils]: 54: Hoare triple {126561#(<= ~counter~0 5)} assume true; {126561#(<= ~counter~0 5)} is VALID [2022-04-28 06:05:28,451 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {126561#(<= ~counter~0 5)} {126561#(<= ~counter~0 5)} #94#return; {126561#(<= ~counter~0 5)} is VALID [2022-04-28 06:05:28,451 INFO L290 TraceCheckUtils]: 56: Hoare triple {126561#(<= ~counter~0 5)} assume !!(0 != ~r~0); {126561#(<= ~counter~0 5)} is VALID [2022-04-28 06:05:28,454 INFO L290 TraceCheckUtils]: 57: Hoare triple {126561#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {126586#(<= ~counter~0 6)} is VALID [2022-04-28 06:05:28,454 INFO L290 TraceCheckUtils]: 58: Hoare triple {126586#(<= ~counter~0 6)} assume !!(#t~post7 < 20);havoc #t~post7; {126586#(<= ~counter~0 6)} is VALID [2022-04-28 06:05:28,455 INFO L272 TraceCheckUtils]: 59: Hoare triple {126586#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {126586#(<= ~counter~0 6)} is VALID [2022-04-28 06:05:28,455 INFO L290 TraceCheckUtils]: 60: Hoare triple {126586#(<= ~counter~0 6)} ~cond := #in~cond; {126586#(<= ~counter~0 6)} is VALID [2022-04-28 06:05:28,456 INFO L290 TraceCheckUtils]: 61: Hoare triple {126586#(<= ~counter~0 6)} assume !(0 == ~cond); {126586#(<= ~counter~0 6)} is VALID [2022-04-28 06:05:28,456 INFO L290 TraceCheckUtils]: 62: Hoare triple {126586#(<= ~counter~0 6)} assume true; {126586#(<= ~counter~0 6)} is VALID [2022-04-28 06:05:28,456 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {126586#(<= ~counter~0 6)} {126586#(<= ~counter~0 6)} #96#return; {126586#(<= ~counter~0 6)} is VALID [2022-04-28 06:05:28,457 INFO L290 TraceCheckUtils]: 64: Hoare triple {126586#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {126586#(<= ~counter~0 6)} is VALID [2022-04-28 06:05:28,459 INFO L290 TraceCheckUtils]: 65: Hoare triple {126586#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {126611#(<= ~counter~0 7)} is VALID [2022-04-28 06:05:28,460 INFO L290 TraceCheckUtils]: 66: Hoare triple {126611#(<= ~counter~0 7)} assume !!(#t~post7 < 20);havoc #t~post7; {126611#(<= ~counter~0 7)} is VALID [2022-04-28 06:05:28,460 INFO L272 TraceCheckUtils]: 67: Hoare triple {126611#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {126611#(<= ~counter~0 7)} is VALID [2022-04-28 06:05:28,461 INFO L290 TraceCheckUtils]: 68: Hoare triple {126611#(<= ~counter~0 7)} ~cond := #in~cond; {126611#(<= ~counter~0 7)} is VALID [2022-04-28 06:05:28,461 INFO L290 TraceCheckUtils]: 69: Hoare triple {126611#(<= ~counter~0 7)} assume !(0 == ~cond); {126611#(<= ~counter~0 7)} is VALID [2022-04-28 06:05:28,461 INFO L290 TraceCheckUtils]: 70: Hoare triple {126611#(<= ~counter~0 7)} assume true; {126611#(<= ~counter~0 7)} is VALID [2022-04-28 06:05:28,462 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {126611#(<= ~counter~0 7)} {126611#(<= ~counter~0 7)} #96#return; {126611#(<= ~counter~0 7)} is VALID [2022-04-28 06:05:28,462 INFO L290 TraceCheckUtils]: 72: Hoare triple {126611#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {126611#(<= ~counter~0 7)} is VALID [2022-04-28 06:05:28,466 INFO L290 TraceCheckUtils]: 73: Hoare triple {126611#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {126636#(<= ~counter~0 8)} is VALID [2022-04-28 06:05:28,466 INFO L290 TraceCheckUtils]: 74: Hoare triple {126636#(<= ~counter~0 8)} assume !!(#t~post7 < 20);havoc #t~post7; {126636#(<= ~counter~0 8)} is VALID [2022-04-28 06:05:28,467 INFO L272 TraceCheckUtils]: 75: Hoare triple {126636#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {126636#(<= ~counter~0 8)} is VALID [2022-04-28 06:05:28,467 INFO L290 TraceCheckUtils]: 76: Hoare triple {126636#(<= ~counter~0 8)} ~cond := #in~cond; {126636#(<= ~counter~0 8)} is VALID [2022-04-28 06:05:28,468 INFO L290 TraceCheckUtils]: 77: Hoare triple {126636#(<= ~counter~0 8)} assume !(0 == ~cond); {126636#(<= ~counter~0 8)} is VALID [2022-04-28 06:05:28,468 INFO L290 TraceCheckUtils]: 78: Hoare triple {126636#(<= ~counter~0 8)} assume true; {126636#(<= ~counter~0 8)} is VALID [2022-04-28 06:05:28,469 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {126636#(<= ~counter~0 8)} {126636#(<= ~counter~0 8)} #96#return; {126636#(<= ~counter~0 8)} is VALID [2022-04-28 06:05:28,469 INFO L290 TraceCheckUtils]: 80: Hoare triple {126636#(<= ~counter~0 8)} assume !(~r~0 > 0); {126636#(<= ~counter~0 8)} is VALID [2022-04-28 06:05:28,472 INFO L290 TraceCheckUtils]: 81: Hoare triple {126636#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {126661#(<= ~counter~0 9)} is VALID [2022-04-28 06:05:28,472 INFO L290 TraceCheckUtils]: 82: Hoare triple {126661#(<= ~counter~0 9)} assume !!(#t~post8 < 20);havoc #t~post8; {126661#(<= ~counter~0 9)} is VALID [2022-04-28 06:05:28,473 INFO L272 TraceCheckUtils]: 83: Hoare triple {126661#(<= ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {126661#(<= ~counter~0 9)} is VALID [2022-04-28 06:05:28,473 INFO L290 TraceCheckUtils]: 84: Hoare triple {126661#(<= ~counter~0 9)} ~cond := #in~cond; {126661#(<= ~counter~0 9)} is VALID [2022-04-28 06:05:28,474 INFO L290 TraceCheckUtils]: 85: Hoare triple {126661#(<= ~counter~0 9)} assume !(0 == ~cond); {126661#(<= ~counter~0 9)} is VALID [2022-04-28 06:05:28,474 INFO L290 TraceCheckUtils]: 86: Hoare triple {126661#(<= ~counter~0 9)} assume true; {126661#(<= ~counter~0 9)} is VALID [2022-04-28 06:05:28,475 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {126661#(<= ~counter~0 9)} {126661#(<= ~counter~0 9)} #98#return; {126661#(<= ~counter~0 9)} is VALID [2022-04-28 06:05:28,475 INFO L290 TraceCheckUtils]: 88: Hoare triple {126661#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {126661#(<= ~counter~0 9)} is VALID [2022-04-28 06:05:28,477 INFO L290 TraceCheckUtils]: 89: Hoare triple {126661#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {126686#(<= ~counter~0 10)} is VALID [2022-04-28 06:05:28,478 INFO L290 TraceCheckUtils]: 90: Hoare triple {126686#(<= ~counter~0 10)} assume !!(#t~post8 < 20);havoc #t~post8; {126686#(<= ~counter~0 10)} is VALID [2022-04-28 06:05:28,479 INFO L272 TraceCheckUtils]: 91: Hoare triple {126686#(<= ~counter~0 10)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {126686#(<= ~counter~0 10)} is VALID [2022-04-28 06:05:28,479 INFO L290 TraceCheckUtils]: 92: Hoare triple {126686#(<= ~counter~0 10)} ~cond := #in~cond; {126686#(<= ~counter~0 10)} is VALID [2022-04-28 06:05:28,479 INFO L290 TraceCheckUtils]: 93: Hoare triple {126686#(<= ~counter~0 10)} assume !(0 == ~cond); {126686#(<= ~counter~0 10)} is VALID [2022-04-28 06:05:28,479 INFO L290 TraceCheckUtils]: 94: Hoare triple {126686#(<= ~counter~0 10)} assume true; {126686#(<= ~counter~0 10)} is VALID [2022-04-28 06:05:28,480 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {126686#(<= ~counter~0 10)} {126686#(<= ~counter~0 10)} #98#return; {126686#(<= ~counter~0 10)} is VALID [2022-04-28 06:05:28,480 INFO L290 TraceCheckUtils]: 96: Hoare triple {126686#(<= ~counter~0 10)} assume !(~r~0 < 0); {126686#(<= ~counter~0 10)} is VALID [2022-04-28 06:05:28,483 INFO L290 TraceCheckUtils]: 97: Hoare triple {126686#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {126711#(<= ~counter~0 11)} is VALID [2022-04-28 06:05:28,483 INFO L290 TraceCheckUtils]: 98: Hoare triple {126711#(<= ~counter~0 11)} assume !!(#t~post6 < 20);havoc #t~post6; {126711#(<= ~counter~0 11)} is VALID [2022-04-28 06:05:28,484 INFO L272 TraceCheckUtils]: 99: Hoare triple {126711#(<= ~counter~0 11)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {126711#(<= ~counter~0 11)} is VALID [2022-04-28 06:05:28,484 INFO L290 TraceCheckUtils]: 100: Hoare triple {126711#(<= ~counter~0 11)} ~cond := #in~cond; {126711#(<= ~counter~0 11)} is VALID [2022-04-28 06:05:28,484 INFO L290 TraceCheckUtils]: 101: Hoare triple {126711#(<= ~counter~0 11)} assume !(0 == ~cond); {126711#(<= ~counter~0 11)} is VALID [2022-04-28 06:05:28,485 INFO L290 TraceCheckUtils]: 102: Hoare triple {126711#(<= ~counter~0 11)} assume true; {126711#(<= ~counter~0 11)} is VALID [2022-04-28 06:05:28,485 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {126711#(<= ~counter~0 11)} {126711#(<= ~counter~0 11)} #94#return; {126711#(<= ~counter~0 11)} is VALID [2022-04-28 06:05:28,486 INFO L290 TraceCheckUtils]: 104: Hoare triple {126711#(<= ~counter~0 11)} assume !!(0 != ~r~0); {126711#(<= ~counter~0 11)} is VALID [2022-04-28 06:05:28,488 INFO L290 TraceCheckUtils]: 105: Hoare triple {126711#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {126736#(<= ~counter~0 12)} is VALID [2022-04-28 06:05:28,488 INFO L290 TraceCheckUtils]: 106: Hoare triple {126736#(<= ~counter~0 12)} assume !!(#t~post7 < 20);havoc #t~post7; {126736#(<= ~counter~0 12)} is VALID [2022-04-28 06:05:28,489 INFO L272 TraceCheckUtils]: 107: Hoare triple {126736#(<= ~counter~0 12)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {126736#(<= ~counter~0 12)} is VALID [2022-04-28 06:05:28,489 INFO L290 TraceCheckUtils]: 108: Hoare triple {126736#(<= ~counter~0 12)} ~cond := #in~cond; {126736#(<= ~counter~0 12)} is VALID [2022-04-28 06:05:28,490 INFO L290 TraceCheckUtils]: 109: Hoare triple {126736#(<= ~counter~0 12)} assume !(0 == ~cond); {126736#(<= ~counter~0 12)} is VALID [2022-04-28 06:05:28,490 INFO L290 TraceCheckUtils]: 110: Hoare triple {126736#(<= ~counter~0 12)} assume true; {126736#(<= ~counter~0 12)} is VALID [2022-04-28 06:05:28,491 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {126736#(<= ~counter~0 12)} {126736#(<= ~counter~0 12)} #96#return; {126736#(<= ~counter~0 12)} is VALID [2022-04-28 06:05:28,491 INFO L290 TraceCheckUtils]: 112: Hoare triple {126736#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {126736#(<= ~counter~0 12)} is VALID [2022-04-28 06:05:28,494 INFO L290 TraceCheckUtils]: 113: Hoare triple {126736#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {126761#(<= ~counter~0 13)} is VALID [2022-04-28 06:05:28,494 INFO L290 TraceCheckUtils]: 114: Hoare triple {126761#(<= ~counter~0 13)} assume !!(#t~post7 < 20);havoc #t~post7; {126761#(<= ~counter~0 13)} is VALID [2022-04-28 06:05:28,495 INFO L272 TraceCheckUtils]: 115: Hoare triple {126761#(<= ~counter~0 13)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {126761#(<= ~counter~0 13)} is VALID [2022-04-28 06:05:28,495 INFO L290 TraceCheckUtils]: 116: Hoare triple {126761#(<= ~counter~0 13)} ~cond := #in~cond; {126761#(<= ~counter~0 13)} is VALID [2022-04-28 06:05:28,496 INFO L290 TraceCheckUtils]: 117: Hoare triple {126761#(<= ~counter~0 13)} assume !(0 == ~cond); {126761#(<= ~counter~0 13)} is VALID [2022-04-28 06:05:28,496 INFO L290 TraceCheckUtils]: 118: Hoare triple {126761#(<= ~counter~0 13)} assume true; {126761#(<= ~counter~0 13)} is VALID [2022-04-28 06:05:28,496 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {126761#(<= ~counter~0 13)} {126761#(<= ~counter~0 13)} #96#return; {126761#(<= ~counter~0 13)} is VALID [2022-04-28 06:05:28,497 INFO L290 TraceCheckUtils]: 120: Hoare triple {126761#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {126761#(<= ~counter~0 13)} is VALID [2022-04-28 06:05:28,500 INFO L290 TraceCheckUtils]: 121: Hoare triple {126761#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {126786#(<= ~counter~0 14)} is VALID [2022-04-28 06:05:28,500 INFO L290 TraceCheckUtils]: 122: Hoare triple {126786#(<= ~counter~0 14)} assume !!(#t~post7 < 20);havoc #t~post7; {126786#(<= ~counter~0 14)} is VALID [2022-04-28 06:05:28,501 INFO L272 TraceCheckUtils]: 123: Hoare triple {126786#(<= ~counter~0 14)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {126786#(<= ~counter~0 14)} is VALID [2022-04-28 06:05:28,501 INFO L290 TraceCheckUtils]: 124: Hoare triple {126786#(<= ~counter~0 14)} ~cond := #in~cond; {126786#(<= ~counter~0 14)} is VALID [2022-04-28 06:05:28,502 INFO L290 TraceCheckUtils]: 125: Hoare triple {126786#(<= ~counter~0 14)} assume !(0 == ~cond); {126786#(<= ~counter~0 14)} is VALID [2022-04-28 06:05:28,502 INFO L290 TraceCheckUtils]: 126: Hoare triple {126786#(<= ~counter~0 14)} assume true; {126786#(<= ~counter~0 14)} is VALID [2022-04-28 06:05:28,502 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {126786#(<= ~counter~0 14)} {126786#(<= ~counter~0 14)} #96#return; {126786#(<= ~counter~0 14)} is VALID [2022-04-28 06:05:28,503 INFO L290 TraceCheckUtils]: 128: Hoare triple {126786#(<= ~counter~0 14)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {126786#(<= ~counter~0 14)} is VALID [2022-04-28 06:05:28,503 INFO L290 TraceCheckUtils]: 129: Hoare triple {126786#(<= ~counter~0 14)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {126811#(<= |main_#t~post7| 14)} is VALID [2022-04-28 06:05:28,504 INFO L290 TraceCheckUtils]: 130: Hoare triple {126811#(<= |main_#t~post7| 14)} assume !(#t~post7 < 20);havoc #t~post7; {126405#false} is VALID [2022-04-28 06:05:28,504 INFO L290 TraceCheckUtils]: 131: Hoare triple {126405#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {126405#false} is VALID [2022-04-28 06:05:28,504 INFO L290 TraceCheckUtils]: 132: Hoare triple {126405#false} assume !(#t~post8 < 20);havoc #t~post8; {126405#false} is VALID [2022-04-28 06:05:28,504 INFO L290 TraceCheckUtils]: 133: Hoare triple {126405#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {126405#false} is VALID [2022-04-28 06:05:28,504 INFO L290 TraceCheckUtils]: 134: Hoare triple {126405#false} assume !(#t~post6 < 20);havoc #t~post6; {126405#false} is VALID [2022-04-28 06:05:28,504 INFO L272 TraceCheckUtils]: 135: Hoare triple {126405#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {126405#false} is VALID [2022-04-28 06:05:28,504 INFO L290 TraceCheckUtils]: 136: Hoare triple {126405#false} ~cond := #in~cond; {126405#false} is VALID [2022-04-28 06:05:28,504 INFO L290 TraceCheckUtils]: 137: Hoare triple {126405#false} assume 0 == ~cond; {126405#false} is VALID [2022-04-28 06:05:28,504 INFO L290 TraceCheckUtils]: 138: Hoare triple {126405#false} assume !false; {126405#false} is VALID [2022-04-28 06:05:28,505 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 42 proven. 498 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 06:05:28,505 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 06:05:29,405 INFO L290 TraceCheckUtils]: 138: Hoare triple {126405#false} assume !false; {126405#false} is VALID [2022-04-28 06:05:29,405 INFO L290 TraceCheckUtils]: 137: Hoare triple {126405#false} assume 0 == ~cond; {126405#false} is VALID [2022-04-28 06:05:29,405 INFO L290 TraceCheckUtils]: 136: Hoare triple {126405#false} ~cond := #in~cond; {126405#false} is VALID [2022-04-28 06:05:29,405 INFO L272 TraceCheckUtils]: 135: Hoare triple {126405#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {126405#false} is VALID [2022-04-28 06:05:29,405 INFO L290 TraceCheckUtils]: 134: Hoare triple {126405#false} assume !(#t~post6 < 20);havoc #t~post6; {126405#false} is VALID [2022-04-28 06:05:29,405 INFO L290 TraceCheckUtils]: 133: Hoare triple {126405#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {126405#false} is VALID [2022-04-28 06:05:29,405 INFO L290 TraceCheckUtils]: 132: Hoare triple {126405#false} assume !(#t~post8 < 20);havoc #t~post8; {126405#false} is VALID [2022-04-28 06:05:29,405 INFO L290 TraceCheckUtils]: 131: Hoare triple {126405#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {126405#false} is VALID [2022-04-28 06:05:29,406 INFO L290 TraceCheckUtils]: 130: Hoare triple {126863#(< |main_#t~post7| 20)} assume !(#t~post7 < 20);havoc #t~post7; {126405#false} is VALID [2022-04-28 06:05:29,406 INFO L290 TraceCheckUtils]: 129: Hoare triple {126867#(< ~counter~0 20)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {126863#(< |main_#t~post7| 20)} is VALID [2022-04-28 06:05:29,406 INFO L290 TraceCheckUtils]: 128: Hoare triple {126867#(< ~counter~0 20)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {126867#(< ~counter~0 20)} is VALID [2022-04-28 06:05:29,407 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {126404#true} {126867#(< ~counter~0 20)} #96#return; {126867#(< ~counter~0 20)} is VALID [2022-04-28 06:05:29,407 INFO L290 TraceCheckUtils]: 126: Hoare triple {126404#true} assume true; {126404#true} is VALID [2022-04-28 06:05:29,407 INFO L290 TraceCheckUtils]: 125: Hoare triple {126404#true} assume !(0 == ~cond); {126404#true} is VALID [2022-04-28 06:05:29,407 INFO L290 TraceCheckUtils]: 124: Hoare triple {126404#true} ~cond := #in~cond; {126404#true} is VALID [2022-04-28 06:05:29,407 INFO L272 TraceCheckUtils]: 123: Hoare triple {126867#(< ~counter~0 20)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {126404#true} is VALID [2022-04-28 06:05:29,408 INFO L290 TraceCheckUtils]: 122: Hoare triple {126867#(< ~counter~0 20)} assume !!(#t~post7 < 20);havoc #t~post7; {126867#(< ~counter~0 20)} is VALID [2022-04-28 06:05:29,411 INFO L290 TraceCheckUtils]: 121: Hoare triple {126892#(< ~counter~0 19)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {126867#(< ~counter~0 20)} is VALID [2022-04-28 06:05:29,411 INFO L290 TraceCheckUtils]: 120: Hoare triple {126892#(< ~counter~0 19)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {126892#(< ~counter~0 19)} is VALID [2022-04-28 06:05:29,412 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {126404#true} {126892#(< ~counter~0 19)} #96#return; {126892#(< ~counter~0 19)} is VALID [2022-04-28 06:05:29,412 INFO L290 TraceCheckUtils]: 118: Hoare triple {126404#true} assume true; {126404#true} is VALID [2022-04-28 06:05:29,412 INFO L290 TraceCheckUtils]: 117: Hoare triple {126404#true} assume !(0 == ~cond); {126404#true} is VALID [2022-04-28 06:05:29,412 INFO L290 TraceCheckUtils]: 116: Hoare triple {126404#true} ~cond := #in~cond; {126404#true} is VALID [2022-04-28 06:05:29,412 INFO L272 TraceCheckUtils]: 115: Hoare triple {126892#(< ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {126404#true} is VALID [2022-04-28 06:05:29,412 INFO L290 TraceCheckUtils]: 114: Hoare triple {126892#(< ~counter~0 19)} assume !!(#t~post7 < 20);havoc #t~post7; {126892#(< ~counter~0 19)} is VALID [2022-04-28 06:05:29,413 INFO L290 TraceCheckUtils]: 113: Hoare triple {126917#(< ~counter~0 18)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {126892#(< ~counter~0 19)} is VALID [2022-04-28 06:05:29,414 INFO L290 TraceCheckUtils]: 112: Hoare triple {126917#(< ~counter~0 18)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {126917#(< ~counter~0 18)} is VALID [2022-04-28 06:05:29,414 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {126404#true} {126917#(< ~counter~0 18)} #96#return; {126917#(< ~counter~0 18)} is VALID [2022-04-28 06:05:29,414 INFO L290 TraceCheckUtils]: 110: Hoare triple {126404#true} assume true; {126404#true} is VALID [2022-04-28 06:05:29,415 INFO L290 TraceCheckUtils]: 109: Hoare triple {126404#true} assume !(0 == ~cond); {126404#true} is VALID [2022-04-28 06:05:29,415 INFO L290 TraceCheckUtils]: 108: Hoare triple {126404#true} ~cond := #in~cond; {126404#true} is VALID [2022-04-28 06:05:29,415 INFO L272 TraceCheckUtils]: 107: Hoare triple {126917#(< ~counter~0 18)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {126404#true} is VALID [2022-04-28 06:05:29,415 INFO L290 TraceCheckUtils]: 106: Hoare triple {126917#(< ~counter~0 18)} assume !!(#t~post7 < 20);havoc #t~post7; {126917#(< ~counter~0 18)} is VALID [2022-04-28 06:05:29,416 INFO L290 TraceCheckUtils]: 105: Hoare triple {126942#(< ~counter~0 17)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {126917#(< ~counter~0 18)} is VALID [2022-04-28 06:05:29,417 INFO L290 TraceCheckUtils]: 104: Hoare triple {126942#(< ~counter~0 17)} assume !!(0 != ~r~0); {126942#(< ~counter~0 17)} is VALID [2022-04-28 06:05:29,417 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {126404#true} {126942#(< ~counter~0 17)} #94#return; {126942#(< ~counter~0 17)} is VALID [2022-04-28 06:05:29,417 INFO L290 TraceCheckUtils]: 102: Hoare triple {126404#true} assume true; {126404#true} is VALID [2022-04-28 06:05:29,417 INFO L290 TraceCheckUtils]: 101: Hoare triple {126404#true} assume !(0 == ~cond); {126404#true} is VALID [2022-04-28 06:05:29,418 INFO L290 TraceCheckUtils]: 100: Hoare triple {126404#true} ~cond := #in~cond; {126404#true} is VALID [2022-04-28 06:05:29,418 INFO L272 TraceCheckUtils]: 99: Hoare triple {126942#(< ~counter~0 17)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {126404#true} is VALID [2022-04-28 06:05:29,418 INFO L290 TraceCheckUtils]: 98: Hoare triple {126942#(< ~counter~0 17)} assume !!(#t~post6 < 20);havoc #t~post6; {126942#(< ~counter~0 17)} is VALID [2022-04-28 06:05:29,419 INFO L290 TraceCheckUtils]: 97: Hoare triple {126967#(< ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {126942#(< ~counter~0 17)} is VALID [2022-04-28 06:05:29,420 INFO L290 TraceCheckUtils]: 96: Hoare triple {126967#(< ~counter~0 16)} assume !(~r~0 < 0); {126967#(< ~counter~0 16)} is VALID [2022-04-28 06:05:29,420 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {126404#true} {126967#(< ~counter~0 16)} #98#return; {126967#(< ~counter~0 16)} is VALID [2022-04-28 06:05:29,421 INFO L290 TraceCheckUtils]: 94: Hoare triple {126404#true} assume true; {126404#true} is VALID [2022-04-28 06:05:29,421 INFO L290 TraceCheckUtils]: 93: Hoare triple {126404#true} assume !(0 == ~cond); {126404#true} is VALID [2022-04-28 06:05:29,421 INFO L290 TraceCheckUtils]: 92: Hoare triple {126404#true} ~cond := #in~cond; {126404#true} is VALID [2022-04-28 06:05:29,421 INFO L272 TraceCheckUtils]: 91: Hoare triple {126967#(< ~counter~0 16)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {126404#true} is VALID [2022-04-28 06:05:29,421 INFO L290 TraceCheckUtils]: 90: Hoare triple {126967#(< ~counter~0 16)} assume !!(#t~post8 < 20);havoc #t~post8; {126967#(< ~counter~0 16)} is VALID [2022-04-28 06:05:29,423 INFO L290 TraceCheckUtils]: 89: Hoare triple {126786#(<= ~counter~0 14)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {126967#(< ~counter~0 16)} is VALID [2022-04-28 06:05:29,423 INFO L290 TraceCheckUtils]: 88: Hoare triple {126786#(<= ~counter~0 14)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {126786#(<= ~counter~0 14)} is VALID [2022-04-28 06:05:29,424 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {126404#true} {126786#(<= ~counter~0 14)} #98#return; {126786#(<= ~counter~0 14)} is VALID [2022-04-28 06:05:29,424 INFO L290 TraceCheckUtils]: 86: Hoare triple {126404#true} assume true; {126404#true} is VALID [2022-04-28 06:05:29,424 INFO L290 TraceCheckUtils]: 85: Hoare triple {126404#true} assume !(0 == ~cond); {126404#true} is VALID [2022-04-28 06:05:29,424 INFO L290 TraceCheckUtils]: 84: Hoare triple {126404#true} ~cond := #in~cond; {126404#true} is VALID [2022-04-28 06:05:29,424 INFO L272 TraceCheckUtils]: 83: Hoare triple {126786#(<= ~counter~0 14)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {126404#true} is VALID [2022-04-28 06:05:29,424 INFO L290 TraceCheckUtils]: 82: Hoare triple {126786#(<= ~counter~0 14)} assume !!(#t~post8 < 20);havoc #t~post8; {126786#(<= ~counter~0 14)} is VALID [2022-04-28 06:05:29,426 INFO L290 TraceCheckUtils]: 81: Hoare triple {126761#(<= ~counter~0 13)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {126786#(<= ~counter~0 14)} is VALID [2022-04-28 06:05:29,426 INFO L290 TraceCheckUtils]: 80: Hoare triple {126761#(<= ~counter~0 13)} assume !(~r~0 > 0); {126761#(<= ~counter~0 13)} is VALID [2022-04-28 06:05:29,427 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {126404#true} {126761#(<= ~counter~0 13)} #96#return; {126761#(<= ~counter~0 13)} is VALID [2022-04-28 06:05:29,427 INFO L290 TraceCheckUtils]: 78: Hoare triple {126404#true} assume true; {126404#true} is VALID [2022-04-28 06:05:29,427 INFO L290 TraceCheckUtils]: 77: Hoare triple {126404#true} assume !(0 == ~cond); {126404#true} is VALID [2022-04-28 06:05:29,427 INFO L290 TraceCheckUtils]: 76: Hoare triple {126404#true} ~cond := #in~cond; {126404#true} is VALID [2022-04-28 06:05:29,427 INFO L272 TraceCheckUtils]: 75: Hoare triple {126761#(<= ~counter~0 13)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {126404#true} is VALID [2022-04-28 06:05:29,427 INFO L290 TraceCheckUtils]: 74: Hoare triple {126761#(<= ~counter~0 13)} assume !!(#t~post7 < 20);havoc #t~post7; {126761#(<= ~counter~0 13)} is VALID [2022-04-28 06:05:29,429 INFO L290 TraceCheckUtils]: 73: Hoare triple {126736#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {126761#(<= ~counter~0 13)} is VALID [2022-04-28 06:05:29,429 INFO L290 TraceCheckUtils]: 72: Hoare triple {126736#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {126736#(<= ~counter~0 12)} is VALID [2022-04-28 06:05:29,430 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {126404#true} {126736#(<= ~counter~0 12)} #96#return; {126736#(<= ~counter~0 12)} is VALID [2022-04-28 06:05:29,430 INFO L290 TraceCheckUtils]: 70: Hoare triple {126404#true} assume true; {126404#true} is VALID [2022-04-28 06:05:29,430 INFO L290 TraceCheckUtils]: 69: Hoare triple {126404#true} assume !(0 == ~cond); {126404#true} is VALID [2022-04-28 06:05:29,430 INFO L290 TraceCheckUtils]: 68: Hoare triple {126404#true} ~cond := #in~cond; {126404#true} is VALID [2022-04-28 06:05:29,430 INFO L272 TraceCheckUtils]: 67: Hoare triple {126736#(<= ~counter~0 12)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {126404#true} is VALID [2022-04-28 06:05:29,430 INFO L290 TraceCheckUtils]: 66: Hoare triple {126736#(<= ~counter~0 12)} assume !!(#t~post7 < 20);havoc #t~post7; {126736#(<= ~counter~0 12)} is VALID [2022-04-28 06:05:29,432 INFO L290 TraceCheckUtils]: 65: Hoare triple {126711#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {126736#(<= ~counter~0 12)} is VALID [2022-04-28 06:05:29,433 INFO L290 TraceCheckUtils]: 64: Hoare triple {126711#(<= ~counter~0 11)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {126711#(<= ~counter~0 11)} is VALID [2022-04-28 06:05:29,433 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {126404#true} {126711#(<= ~counter~0 11)} #96#return; {126711#(<= ~counter~0 11)} is VALID [2022-04-28 06:05:29,433 INFO L290 TraceCheckUtils]: 62: Hoare triple {126404#true} assume true; {126404#true} is VALID [2022-04-28 06:05:29,434 INFO L290 TraceCheckUtils]: 61: Hoare triple {126404#true} assume !(0 == ~cond); {126404#true} is VALID [2022-04-28 06:05:29,434 INFO L290 TraceCheckUtils]: 60: Hoare triple {126404#true} ~cond := #in~cond; {126404#true} is VALID [2022-04-28 06:05:29,434 INFO L272 TraceCheckUtils]: 59: Hoare triple {126711#(<= ~counter~0 11)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {126404#true} is VALID [2022-04-28 06:05:29,434 INFO L290 TraceCheckUtils]: 58: Hoare triple {126711#(<= ~counter~0 11)} assume !!(#t~post7 < 20);havoc #t~post7; {126711#(<= ~counter~0 11)} is VALID [2022-04-28 06:05:29,436 INFO L290 TraceCheckUtils]: 57: Hoare triple {126686#(<= ~counter~0 10)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {126711#(<= ~counter~0 11)} is VALID [2022-04-28 06:05:29,436 INFO L290 TraceCheckUtils]: 56: Hoare triple {126686#(<= ~counter~0 10)} assume !!(0 != ~r~0); {126686#(<= ~counter~0 10)} is VALID [2022-04-28 06:05:29,437 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {126404#true} {126686#(<= ~counter~0 10)} #94#return; {126686#(<= ~counter~0 10)} is VALID [2022-04-28 06:05:29,437 INFO L290 TraceCheckUtils]: 54: Hoare triple {126404#true} assume true; {126404#true} is VALID [2022-04-28 06:05:29,437 INFO L290 TraceCheckUtils]: 53: Hoare triple {126404#true} assume !(0 == ~cond); {126404#true} is VALID [2022-04-28 06:05:29,437 INFO L290 TraceCheckUtils]: 52: Hoare triple {126404#true} ~cond := #in~cond; {126404#true} is VALID [2022-04-28 06:05:29,437 INFO L272 TraceCheckUtils]: 51: Hoare triple {126686#(<= ~counter~0 10)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {126404#true} is VALID [2022-04-28 06:05:29,437 INFO L290 TraceCheckUtils]: 50: Hoare triple {126686#(<= ~counter~0 10)} assume !!(#t~post6 < 20);havoc #t~post6; {126686#(<= ~counter~0 10)} is VALID [2022-04-28 06:05:29,439 INFO L290 TraceCheckUtils]: 49: Hoare triple {126661#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {126686#(<= ~counter~0 10)} is VALID [2022-04-28 06:05:29,439 INFO L290 TraceCheckUtils]: 48: Hoare triple {126661#(<= ~counter~0 9)} assume !(~r~0 < 0); {126661#(<= ~counter~0 9)} is VALID [2022-04-28 06:05:29,440 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {126404#true} {126661#(<= ~counter~0 9)} #98#return; {126661#(<= ~counter~0 9)} is VALID [2022-04-28 06:05:29,440 INFO L290 TraceCheckUtils]: 46: Hoare triple {126404#true} assume true; {126404#true} is VALID [2022-04-28 06:05:29,440 INFO L290 TraceCheckUtils]: 45: Hoare triple {126404#true} assume !(0 == ~cond); {126404#true} is VALID [2022-04-28 06:05:29,440 INFO L290 TraceCheckUtils]: 44: Hoare triple {126404#true} ~cond := #in~cond; {126404#true} is VALID [2022-04-28 06:05:29,440 INFO L272 TraceCheckUtils]: 43: Hoare triple {126661#(<= ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {126404#true} is VALID [2022-04-28 06:05:29,441 INFO L290 TraceCheckUtils]: 42: Hoare triple {126661#(<= ~counter~0 9)} assume !!(#t~post8 < 20);havoc #t~post8; {126661#(<= ~counter~0 9)} is VALID [2022-04-28 06:05:29,442 INFO L290 TraceCheckUtils]: 41: Hoare triple {126636#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {126661#(<= ~counter~0 9)} is VALID [2022-04-28 06:05:29,442 INFO L290 TraceCheckUtils]: 40: Hoare triple {126636#(<= ~counter~0 8)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {126636#(<= ~counter~0 8)} is VALID [2022-04-28 06:05:29,443 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {126404#true} {126636#(<= ~counter~0 8)} #98#return; {126636#(<= ~counter~0 8)} is VALID [2022-04-28 06:05:29,443 INFO L290 TraceCheckUtils]: 38: Hoare triple {126404#true} assume true; {126404#true} is VALID [2022-04-28 06:05:29,443 INFO L290 TraceCheckUtils]: 37: Hoare triple {126404#true} assume !(0 == ~cond); {126404#true} is VALID [2022-04-28 06:05:29,443 INFO L290 TraceCheckUtils]: 36: Hoare triple {126404#true} ~cond := #in~cond; {126404#true} is VALID [2022-04-28 06:05:29,443 INFO L272 TraceCheckUtils]: 35: Hoare triple {126636#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {126404#true} is VALID [2022-04-28 06:05:29,444 INFO L290 TraceCheckUtils]: 34: Hoare triple {126636#(<= ~counter~0 8)} assume !!(#t~post8 < 20);havoc #t~post8; {126636#(<= ~counter~0 8)} is VALID [2022-04-28 06:05:29,445 INFO L290 TraceCheckUtils]: 33: Hoare triple {126611#(<= ~counter~0 7)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {126636#(<= ~counter~0 8)} is VALID [2022-04-28 06:05:29,446 INFO L290 TraceCheckUtils]: 32: Hoare triple {126611#(<= ~counter~0 7)} assume !(~r~0 > 0); {126611#(<= ~counter~0 7)} is VALID [2022-04-28 06:05:29,446 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {126404#true} {126611#(<= ~counter~0 7)} #96#return; {126611#(<= ~counter~0 7)} is VALID [2022-04-28 06:05:29,447 INFO L290 TraceCheckUtils]: 30: Hoare triple {126404#true} assume true; {126404#true} is VALID [2022-04-28 06:05:29,447 INFO L290 TraceCheckUtils]: 29: Hoare triple {126404#true} assume !(0 == ~cond); {126404#true} is VALID [2022-04-28 06:05:29,447 INFO L290 TraceCheckUtils]: 28: Hoare triple {126404#true} ~cond := #in~cond; {126404#true} is VALID [2022-04-28 06:05:29,447 INFO L272 TraceCheckUtils]: 27: Hoare triple {126611#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {126404#true} is VALID [2022-04-28 06:05:29,447 INFO L290 TraceCheckUtils]: 26: Hoare triple {126611#(<= ~counter~0 7)} assume !!(#t~post7 < 20);havoc #t~post7; {126611#(<= ~counter~0 7)} is VALID [2022-04-28 06:05:29,449 INFO L290 TraceCheckUtils]: 25: Hoare triple {126586#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {126611#(<= ~counter~0 7)} is VALID [2022-04-28 06:05:29,449 INFO L290 TraceCheckUtils]: 24: Hoare triple {126586#(<= ~counter~0 6)} assume !!(0 != ~r~0); {126586#(<= ~counter~0 6)} is VALID [2022-04-28 06:05:29,450 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {126404#true} {126586#(<= ~counter~0 6)} #94#return; {126586#(<= ~counter~0 6)} is VALID [2022-04-28 06:05:29,450 INFO L290 TraceCheckUtils]: 22: Hoare triple {126404#true} assume true; {126404#true} is VALID [2022-04-28 06:05:29,450 INFO L290 TraceCheckUtils]: 21: Hoare triple {126404#true} assume !(0 == ~cond); {126404#true} is VALID [2022-04-28 06:05:29,450 INFO L290 TraceCheckUtils]: 20: Hoare triple {126404#true} ~cond := #in~cond; {126404#true} is VALID [2022-04-28 06:05:29,450 INFO L272 TraceCheckUtils]: 19: Hoare triple {126586#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {126404#true} is VALID [2022-04-28 06:05:29,451 INFO L290 TraceCheckUtils]: 18: Hoare triple {126586#(<= ~counter~0 6)} assume !!(#t~post6 < 20);havoc #t~post6; {126586#(<= ~counter~0 6)} is VALID [2022-04-28 06:05:29,452 INFO L290 TraceCheckUtils]: 17: Hoare triple {126561#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {126586#(<= ~counter~0 6)} is VALID [2022-04-28 06:05:29,452 INFO L290 TraceCheckUtils]: 16: Hoare triple {126561#(<= ~counter~0 5)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {126561#(<= ~counter~0 5)} is VALID [2022-04-28 06:05:29,453 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {126404#true} {126561#(<= ~counter~0 5)} #92#return; {126561#(<= ~counter~0 5)} is VALID [2022-04-28 06:05:29,453 INFO L290 TraceCheckUtils]: 14: Hoare triple {126404#true} assume true; {126404#true} is VALID [2022-04-28 06:05:29,453 INFO L290 TraceCheckUtils]: 13: Hoare triple {126404#true} assume !(0 == ~cond); {126404#true} is VALID [2022-04-28 06:05:29,453 INFO L290 TraceCheckUtils]: 12: Hoare triple {126404#true} ~cond := #in~cond; {126404#true} is VALID [2022-04-28 06:05:29,453 INFO L272 TraceCheckUtils]: 11: Hoare triple {126561#(<= ~counter~0 5)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {126404#true} is VALID [2022-04-28 06:05:29,454 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {126404#true} {126561#(<= ~counter~0 5)} #90#return; {126561#(<= ~counter~0 5)} is VALID [2022-04-28 06:05:29,454 INFO L290 TraceCheckUtils]: 9: Hoare triple {126404#true} assume true; {126404#true} is VALID [2022-04-28 06:05:29,454 INFO L290 TraceCheckUtils]: 8: Hoare triple {126404#true} assume !(0 == ~cond); {126404#true} is VALID [2022-04-28 06:05:29,454 INFO L290 TraceCheckUtils]: 7: Hoare triple {126404#true} ~cond := #in~cond; {126404#true} is VALID [2022-04-28 06:05:29,454 INFO L272 TraceCheckUtils]: 6: Hoare triple {126561#(<= ~counter~0 5)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {126404#true} is VALID [2022-04-28 06:05:29,454 INFO L290 TraceCheckUtils]: 5: Hoare triple {126561#(<= ~counter~0 5)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {126561#(<= ~counter~0 5)} is VALID [2022-04-28 06:05:29,455 INFO L272 TraceCheckUtils]: 4: Hoare triple {126561#(<= ~counter~0 5)} call #t~ret9 := main(); {126561#(<= ~counter~0 5)} is VALID [2022-04-28 06:05:29,455 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {126561#(<= ~counter~0 5)} {126404#true} #102#return; {126561#(<= ~counter~0 5)} is VALID [2022-04-28 06:05:29,455 INFO L290 TraceCheckUtils]: 2: Hoare triple {126561#(<= ~counter~0 5)} assume true; {126561#(<= ~counter~0 5)} is VALID [2022-04-28 06:05:29,456 INFO L290 TraceCheckUtils]: 1: Hoare triple {126404#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {126561#(<= ~counter~0 5)} is VALID [2022-04-28 06:05:29,456 INFO L272 TraceCheckUtils]: 0: Hoare triple {126404#true} call ULTIMATE.init(); {126404#true} is VALID [2022-04-28 06:05:29,456 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 42 proven. 134 refuted. 0 times theorem prover too weak. 368 trivial. 0 not checked. [2022-04-28 06:05:29,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:05:29,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444322816] [2022-04-28 06:05:29,457 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:05:29,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [608644077] [2022-04-28 06:05:29,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [608644077] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 06:05:29,457 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 06:05:29,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 24 [2022-04-28 06:05:29,457 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:05:29,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1006983798] [2022-04-28 06:05:29,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1006983798] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:05:29,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:05:29,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 06:05:29,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717842368] [2022-04-28 06:05:29,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:05:29,458 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.555555555555555) internal successors, (100), 17 states have internal predecessors, (100), 17 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) Word has length 139 [2022-04-28 06:05:29,458 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:05:29,458 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 5.555555555555555) internal successors, (100), 17 states have internal predecessors, (100), 17 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-28 06:05:29,652 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:05:29,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 06:05:29,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:05:29,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 06:05:29,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-28 06:05:29,653 INFO L87 Difference]: Start difference. First operand 775 states and 1047 transitions. Second operand has 18 states, 18 states have (on average 5.555555555555555) internal successors, (100), 17 states have internal predecessors, (100), 17 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-28 06:05:34,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:05:34,533 INFO L93 Difference]: Finished difference Result 945 states and 1302 transitions. [2022-04-28 06:05:34,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-28 06:05:34,533 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.555555555555555) internal successors, (100), 17 states have internal predecessors, (100), 17 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) Word has length 139 [2022-04-28 06:05:34,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:05:34,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 5.555555555555555) internal successors, (100), 17 states have internal predecessors, (100), 17 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-28 06:05:34,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 316 transitions. [2022-04-28 06:05:34,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 5.555555555555555) internal successors, (100), 17 states have internal predecessors, (100), 17 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-28 06:05:34,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 316 transitions. [2022-04-28 06:05:34,540 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 316 transitions. [2022-04-28 06:05:34,942 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 316 edges. 316 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:05:34,967 INFO L225 Difference]: With dead ends: 945 [2022-04-28 06:05:34,968 INFO L226 Difference]: Without dead ends: 775 [2022-04-28 06:05:34,968 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 254 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=522, Invalid=810, Unknown=0, NotChecked=0, Total=1332 [2022-04-28 06:05:34,969 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 208 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 06:05:34,969 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 322 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 06:05:34,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2022-04-28 06:05:37,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 775. [2022-04-28 06:05:37,906 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:05:37,907 INFO L82 GeneralOperation]: Start isEquivalent. First operand 775 states. Second operand has 775 states, 579 states have (on average 1.1934369602763386) internal successors, (691), 596 states have internal predecessors, (691), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 157 states have call predecessors, (174), 174 states have call successors, (174) [2022-04-28 06:05:37,908 INFO L74 IsIncluded]: Start isIncluded. First operand 775 states. Second operand has 775 states, 579 states have (on average 1.1934369602763386) internal successors, (691), 596 states have internal predecessors, (691), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 157 states have call predecessors, (174), 174 states have call successors, (174) [2022-04-28 06:05:37,908 INFO L87 Difference]: Start difference. First operand 775 states. Second operand has 775 states, 579 states have (on average 1.1934369602763386) internal successors, (691), 596 states have internal predecessors, (691), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 157 states have call predecessors, (174), 174 states have call successors, (174) [2022-04-28 06:05:37,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:05:37,928 INFO L93 Difference]: Finished difference Result 775 states and 1041 transitions. [2022-04-28 06:05:37,928 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 1041 transitions. [2022-04-28 06:05:37,929 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:05:37,929 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:05:37,929 INFO L74 IsIncluded]: Start isIncluded. First operand has 775 states, 579 states have (on average 1.1934369602763386) internal successors, (691), 596 states have internal predecessors, (691), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 157 states have call predecessors, (174), 174 states have call successors, (174) Second operand 775 states. [2022-04-28 06:05:37,930 INFO L87 Difference]: Start difference. First operand has 775 states, 579 states have (on average 1.1934369602763386) internal successors, (691), 596 states have internal predecessors, (691), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 157 states have call predecessors, (174), 174 states have call successors, (174) Second operand 775 states. [2022-04-28 06:05:37,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:05:37,950 INFO L93 Difference]: Finished difference Result 775 states and 1041 transitions. [2022-04-28 06:05:37,950 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 1041 transitions. [2022-04-28 06:05:37,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:05:37,951 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:05:37,951 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:05:37,951 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:05:37,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 775 states, 579 states have (on average 1.1934369602763386) internal successors, (691), 596 states have internal predecessors, (691), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 157 states have call predecessors, (174), 174 states have call successors, (174) [2022-04-28 06:05:37,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 1041 transitions. [2022-04-28 06:05:37,984 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 1041 transitions. Word has length 139 [2022-04-28 06:05:37,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:05:37,984 INFO L495 AbstractCegarLoop]: Abstraction has 775 states and 1041 transitions. [2022-04-28 06:05:37,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.555555555555555) internal successors, (100), 17 states have internal predecessors, (100), 17 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-28 06:05:37,984 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 775 states and 1041 transitions. [2022-04-28 06:05:51,527 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1041 edges. 1038 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-28 06:05:51,527 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 1041 transitions. [2022-04-28 06:05:51,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-04-28 06:05:51,538 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:05:51,538 INFO L195 NwaCegarLoop]: trace histogram [16, 15, 15, 7, 7, 7, 7, 6, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:05:51,554 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Forceful destruction successful, exit code 0 [2022-04-28 06:05:51,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2022-04-28 06:05:51,738 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:05:51,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:05:51,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1908608861, now seen corresponding path program 25 times [2022-04-28 06:05:51,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:05:51,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1535621153] [2022-04-28 06:05:51,740 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 06:05:51,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1908608861, now seen corresponding path program 26 times [2022-04-28 06:05:51,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:05:51,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992497257] [2022-04-28 06:05:51,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:05:51,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:05:51,754 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:05:51,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1785258228] [2022-04-28 06:05:51,754 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 06:05:51,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:05:51,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:05:51,755 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:05:51,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2022-04-28 06:05:51,829 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 06:05:51,830 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:05:51,831 INFO L263 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-28 06:05:51,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:05:51,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:05:52,707 INFO L272 TraceCheckUtils]: 0: Hoare triple {132277#true} call ULTIMATE.init(); {132277#true} is VALID [2022-04-28 06:05:52,708 INFO L290 TraceCheckUtils]: 1: Hoare triple {132277#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {132285#(<= ~counter~0 0)} is VALID [2022-04-28 06:05:52,708 INFO L290 TraceCheckUtils]: 2: Hoare triple {132285#(<= ~counter~0 0)} assume true; {132285#(<= ~counter~0 0)} is VALID [2022-04-28 06:05:52,708 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {132285#(<= ~counter~0 0)} {132277#true} #102#return; {132285#(<= ~counter~0 0)} is VALID [2022-04-28 06:05:52,709 INFO L272 TraceCheckUtils]: 4: Hoare triple {132285#(<= ~counter~0 0)} call #t~ret9 := main(); {132285#(<= ~counter~0 0)} is VALID [2022-04-28 06:05:52,709 INFO L290 TraceCheckUtils]: 5: Hoare triple {132285#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {132285#(<= ~counter~0 0)} is VALID [2022-04-28 06:05:52,709 INFO L272 TraceCheckUtils]: 6: Hoare triple {132285#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {132285#(<= ~counter~0 0)} is VALID [2022-04-28 06:05:52,710 INFO L290 TraceCheckUtils]: 7: Hoare triple {132285#(<= ~counter~0 0)} ~cond := #in~cond; {132285#(<= ~counter~0 0)} is VALID [2022-04-28 06:05:52,710 INFO L290 TraceCheckUtils]: 8: Hoare triple {132285#(<= ~counter~0 0)} assume !(0 == ~cond); {132285#(<= ~counter~0 0)} is VALID [2022-04-28 06:05:52,710 INFO L290 TraceCheckUtils]: 9: Hoare triple {132285#(<= ~counter~0 0)} assume true; {132285#(<= ~counter~0 0)} is VALID [2022-04-28 06:05:52,711 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {132285#(<= ~counter~0 0)} {132285#(<= ~counter~0 0)} #90#return; {132285#(<= ~counter~0 0)} is VALID [2022-04-28 06:05:52,711 INFO L272 TraceCheckUtils]: 11: Hoare triple {132285#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {132285#(<= ~counter~0 0)} is VALID [2022-04-28 06:05:52,711 INFO L290 TraceCheckUtils]: 12: Hoare triple {132285#(<= ~counter~0 0)} ~cond := #in~cond; {132285#(<= ~counter~0 0)} is VALID [2022-04-28 06:05:52,711 INFO L290 TraceCheckUtils]: 13: Hoare triple {132285#(<= ~counter~0 0)} assume !(0 == ~cond); {132285#(<= ~counter~0 0)} is VALID [2022-04-28 06:05:52,712 INFO L290 TraceCheckUtils]: 14: Hoare triple {132285#(<= ~counter~0 0)} assume true; {132285#(<= ~counter~0 0)} is VALID [2022-04-28 06:05:52,712 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {132285#(<= ~counter~0 0)} {132285#(<= ~counter~0 0)} #92#return; {132285#(<= ~counter~0 0)} is VALID [2022-04-28 06:05:52,712 INFO L290 TraceCheckUtils]: 16: Hoare triple {132285#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {132285#(<= ~counter~0 0)} is VALID [2022-04-28 06:05:52,715 INFO L290 TraceCheckUtils]: 17: Hoare triple {132285#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {132334#(<= ~counter~0 1)} is VALID [2022-04-28 06:05:52,715 INFO L290 TraceCheckUtils]: 18: Hoare triple {132334#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {132334#(<= ~counter~0 1)} is VALID [2022-04-28 06:05:52,716 INFO L272 TraceCheckUtils]: 19: Hoare triple {132334#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {132334#(<= ~counter~0 1)} is VALID [2022-04-28 06:05:52,716 INFO L290 TraceCheckUtils]: 20: Hoare triple {132334#(<= ~counter~0 1)} ~cond := #in~cond; {132334#(<= ~counter~0 1)} is VALID [2022-04-28 06:05:52,716 INFO L290 TraceCheckUtils]: 21: Hoare triple {132334#(<= ~counter~0 1)} assume !(0 == ~cond); {132334#(<= ~counter~0 1)} is VALID [2022-04-28 06:05:52,717 INFO L290 TraceCheckUtils]: 22: Hoare triple {132334#(<= ~counter~0 1)} assume true; {132334#(<= ~counter~0 1)} is VALID [2022-04-28 06:05:52,717 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {132334#(<= ~counter~0 1)} {132334#(<= ~counter~0 1)} #94#return; {132334#(<= ~counter~0 1)} is VALID [2022-04-28 06:05:52,717 INFO L290 TraceCheckUtils]: 24: Hoare triple {132334#(<= ~counter~0 1)} assume !!(0 != ~r~0); {132334#(<= ~counter~0 1)} is VALID [2022-04-28 06:05:52,718 INFO L290 TraceCheckUtils]: 25: Hoare triple {132334#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {132359#(<= ~counter~0 2)} is VALID [2022-04-28 06:05:52,719 INFO L290 TraceCheckUtils]: 26: Hoare triple {132359#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {132359#(<= ~counter~0 2)} is VALID [2022-04-28 06:05:52,719 INFO L272 TraceCheckUtils]: 27: Hoare triple {132359#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {132359#(<= ~counter~0 2)} is VALID [2022-04-28 06:05:52,720 INFO L290 TraceCheckUtils]: 28: Hoare triple {132359#(<= ~counter~0 2)} ~cond := #in~cond; {132359#(<= ~counter~0 2)} is VALID [2022-04-28 06:05:52,720 INFO L290 TraceCheckUtils]: 29: Hoare triple {132359#(<= ~counter~0 2)} assume !(0 == ~cond); {132359#(<= ~counter~0 2)} is VALID [2022-04-28 06:05:52,720 INFO L290 TraceCheckUtils]: 30: Hoare triple {132359#(<= ~counter~0 2)} assume true; {132359#(<= ~counter~0 2)} is VALID [2022-04-28 06:05:52,721 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {132359#(<= ~counter~0 2)} {132359#(<= ~counter~0 2)} #96#return; {132359#(<= ~counter~0 2)} is VALID [2022-04-28 06:05:52,721 INFO L290 TraceCheckUtils]: 32: Hoare triple {132359#(<= ~counter~0 2)} assume !(~r~0 > 0); {132359#(<= ~counter~0 2)} is VALID [2022-04-28 06:05:52,722 INFO L290 TraceCheckUtils]: 33: Hoare triple {132359#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {132384#(<= ~counter~0 3)} is VALID [2022-04-28 06:05:52,722 INFO L290 TraceCheckUtils]: 34: Hoare triple {132384#(<= ~counter~0 3)} assume !!(#t~post8 < 20);havoc #t~post8; {132384#(<= ~counter~0 3)} is VALID [2022-04-28 06:05:52,723 INFO L272 TraceCheckUtils]: 35: Hoare triple {132384#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {132384#(<= ~counter~0 3)} is VALID [2022-04-28 06:05:52,723 INFO L290 TraceCheckUtils]: 36: Hoare triple {132384#(<= ~counter~0 3)} ~cond := #in~cond; {132384#(<= ~counter~0 3)} is VALID [2022-04-28 06:05:52,723 INFO L290 TraceCheckUtils]: 37: Hoare triple {132384#(<= ~counter~0 3)} assume !(0 == ~cond); {132384#(<= ~counter~0 3)} is VALID [2022-04-28 06:05:52,724 INFO L290 TraceCheckUtils]: 38: Hoare triple {132384#(<= ~counter~0 3)} assume true; {132384#(<= ~counter~0 3)} is VALID [2022-04-28 06:05:52,724 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {132384#(<= ~counter~0 3)} {132384#(<= ~counter~0 3)} #98#return; {132384#(<= ~counter~0 3)} is VALID [2022-04-28 06:05:52,724 INFO L290 TraceCheckUtils]: 40: Hoare triple {132384#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {132384#(<= ~counter~0 3)} is VALID [2022-04-28 06:05:52,726 INFO L290 TraceCheckUtils]: 41: Hoare triple {132384#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {132409#(<= ~counter~0 4)} is VALID [2022-04-28 06:05:52,726 INFO L290 TraceCheckUtils]: 42: Hoare triple {132409#(<= ~counter~0 4)} assume !!(#t~post8 < 20);havoc #t~post8; {132409#(<= ~counter~0 4)} is VALID [2022-04-28 06:05:52,726 INFO L272 TraceCheckUtils]: 43: Hoare triple {132409#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {132409#(<= ~counter~0 4)} is VALID [2022-04-28 06:05:52,727 INFO L290 TraceCheckUtils]: 44: Hoare triple {132409#(<= ~counter~0 4)} ~cond := #in~cond; {132409#(<= ~counter~0 4)} is VALID [2022-04-28 06:05:52,727 INFO L290 TraceCheckUtils]: 45: Hoare triple {132409#(<= ~counter~0 4)} assume !(0 == ~cond); {132409#(<= ~counter~0 4)} is VALID [2022-04-28 06:05:52,727 INFO L290 TraceCheckUtils]: 46: Hoare triple {132409#(<= ~counter~0 4)} assume true; {132409#(<= ~counter~0 4)} is VALID [2022-04-28 06:05:52,728 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {132409#(<= ~counter~0 4)} {132409#(<= ~counter~0 4)} #98#return; {132409#(<= ~counter~0 4)} is VALID [2022-04-28 06:05:52,728 INFO L290 TraceCheckUtils]: 48: Hoare triple {132409#(<= ~counter~0 4)} assume !(~r~0 < 0); {132409#(<= ~counter~0 4)} is VALID [2022-04-28 06:05:52,729 INFO L290 TraceCheckUtils]: 49: Hoare triple {132409#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {132434#(<= ~counter~0 5)} is VALID [2022-04-28 06:05:52,729 INFO L290 TraceCheckUtils]: 50: Hoare triple {132434#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {132434#(<= ~counter~0 5)} is VALID [2022-04-28 06:05:52,730 INFO L272 TraceCheckUtils]: 51: Hoare triple {132434#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {132434#(<= ~counter~0 5)} is VALID [2022-04-28 06:05:52,730 INFO L290 TraceCheckUtils]: 52: Hoare triple {132434#(<= ~counter~0 5)} ~cond := #in~cond; {132434#(<= ~counter~0 5)} is VALID [2022-04-28 06:05:52,730 INFO L290 TraceCheckUtils]: 53: Hoare triple {132434#(<= ~counter~0 5)} assume !(0 == ~cond); {132434#(<= ~counter~0 5)} is VALID [2022-04-28 06:05:52,731 INFO L290 TraceCheckUtils]: 54: Hoare triple {132434#(<= ~counter~0 5)} assume true; {132434#(<= ~counter~0 5)} is VALID [2022-04-28 06:05:52,731 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {132434#(<= ~counter~0 5)} {132434#(<= ~counter~0 5)} #94#return; {132434#(<= ~counter~0 5)} is VALID [2022-04-28 06:05:52,732 INFO L290 TraceCheckUtils]: 56: Hoare triple {132434#(<= ~counter~0 5)} assume !!(0 != ~r~0); {132434#(<= ~counter~0 5)} is VALID [2022-04-28 06:05:52,733 INFO L290 TraceCheckUtils]: 57: Hoare triple {132434#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {132459#(<= ~counter~0 6)} is VALID [2022-04-28 06:05:52,733 INFO L290 TraceCheckUtils]: 58: Hoare triple {132459#(<= ~counter~0 6)} assume !!(#t~post7 < 20);havoc #t~post7; {132459#(<= ~counter~0 6)} is VALID [2022-04-28 06:05:52,733 INFO L272 TraceCheckUtils]: 59: Hoare triple {132459#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {132459#(<= ~counter~0 6)} is VALID [2022-04-28 06:05:52,734 INFO L290 TraceCheckUtils]: 60: Hoare triple {132459#(<= ~counter~0 6)} ~cond := #in~cond; {132459#(<= ~counter~0 6)} is VALID [2022-04-28 06:05:52,734 INFO L290 TraceCheckUtils]: 61: Hoare triple {132459#(<= ~counter~0 6)} assume !(0 == ~cond); {132459#(<= ~counter~0 6)} is VALID [2022-04-28 06:05:52,734 INFO L290 TraceCheckUtils]: 62: Hoare triple {132459#(<= ~counter~0 6)} assume true; {132459#(<= ~counter~0 6)} is VALID [2022-04-28 06:05:52,735 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {132459#(<= ~counter~0 6)} {132459#(<= ~counter~0 6)} #96#return; {132459#(<= ~counter~0 6)} is VALID [2022-04-28 06:05:52,735 INFO L290 TraceCheckUtils]: 64: Hoare triple {132459#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {132459#(<= ~counter~0 6)} is VALID [2022-04-28 06:05:52,736 INFO L290 TraceCheckUtils]: 65: Hoare triple {132459#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {132484#(<= ~counter~0 7)} is VALID [2022-04-28 06:05:52,736 INFO L290 TraceCheckUtils]: 66: Hoare triple {132484#(<= ~counter~0 7)} assume !!(#t~post7 < 20);havoc #t~post7; {132484#(<= ~counter~0 7)} is VALID [2022-04-28 06:05:52,737 INFO L272 TraceCheckUtils]: 67: Hoare triple {132484#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {132484#(<= ~counter~0 7)} is VALID [2022-04-28 06:05:52,737 INFO L290 TraceCheckUtils]: 68: Hoare triple {132484#(<= ~counter~0 7)} ~cond := #in~cond; {132484#(<= ~counter~0 7)} is VALID [2022-04-28 06:05:52,737 INFO L290 TraceCheckUtils]: 69: Hoare triple {132484#(<= ~counter~0 7)} assume !(0 == ~cond); {132484#(<= ~counter~0 7)} is VALID [2022-04-28 06:05:52,738 INFO L290 TraceCheckUtils]: 70: Hoare triple {132484#(<= ~counter~0 7)} assume true; {132484#(<= ~counter~0 7)} is VALID [2022-04-28 06:05:52,738 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {132484#(<= ~counter~0 7)} {132484#(<= ~counter~0 7)} #96#return; {132484#(<= ~counter~0 7)} is VALID [2022-04-28 06:05:52,738 INFO L290 TraceCheckUtils]: 72: Hoare triple {132484#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {132484#(<= ~counter~0 7)} is VALID [2022-04-28 06:05:52,739 INFO L290 TraceCheckUtils]: 73: Hoare triple {132484#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {132509#(<= ~counter~0 8)} is VALID [2022-04-28 06:05:52,740 INFO L290 TraceCheckUtils]: 74: Hoare triple {132509#(<= ~counter~0 8)} assume !!(#t~post7 < 20);havoc #t~post7; {132509#(<= ~counter~0 8)} is VALID [2022-04-28 06:05:52,740 INFO L272 TraceCheckUtils]: 75: Hoare triple {132509#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {132509#(<= ~counter~0 8)} is VALID [2022-04-28 06:05:52,740 INFO L290 TraceCheckUtils]: 76: Hoare triple {132509#(<= ~counter~0 8)} ~cond := #in~cond; {132509#(<= ~counter~0 8)} is VALID [2022-04-28 06:05:52,741 INFO L290 TraceCheckUtils]: 77: Hoare triple {132509#(<= ~counter~0 8)} assume !(0 == ~cond); {132509#(<= ~counter~0 8)} is VALID [2022-04-28 06:05:52,741 INFO L290 TraceCheckUtils]: 78: Hoare triple {132509#(<= ~counter~0 8)} assume true; {132509#(<= ~counter~0 8)} is VALID [2022-04-28 06:05:52,741 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {132509#(<= ~counter~0 8)} {132509#(<= ~counter~0 8)} #96#return; {132509#(<= ~counter~0 8)} is VALID [2022-04-28 06:05:52,742 INFO L290 TraceCheckUtils]: 80: Hoare triple {132509#(<= ~counter~0 8)} assume !(~r~0 > 0); {132509#(<= ~counter~0 8)} is VALID [2022-04-28 06:05:52,743 INFO L290 TraceCheckUtils]: 81: Hoare triple {132509#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {132534#(<= ~counter~0 9)} is VALID [2022-04-28 06:05:52,743 INFO L290 TraceCheckUtils]: 82: Hoare triple {132534#(<= ~counter~0 9)} assume !!(#t~post8 < 20);havoc #t~post8; {132534#(<= ~counter~0 9)} is VALID [2022-04-28 06:05:52,744 INFO L272 TraceCheckUtils]: 83: Hoare triple {132534#(<= ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {132534#(<= ~counter~0 9)} is VALID [2022-04-28 06:05:52,744 INFO L290 TraceCheckUtils]: 84: Hoare triple {132534#(<= ~counter~0 9)} ~cond := #in~cond; {132534#(<= ~counter~0 9)} is VALID [2022-04-28 06:05:52,744 INFO L290 TraceCheckUtils]: 85: Hoare triple {132534#(<= ~counter~0 9)} assume !(0 == ~cond); {132534#(<= ~counter~0 9)} is VALID [2022-04-28 06:05:52,744 INFO L290 TraceCheckUtils]: 86: Hoare triple {132534#(<= ~counter~0 9)} assume true; {132534#(<= ~counter~0 9)} is VALID [2022-04-28 06:05:52,745 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {132534#(<= ~counter~0 9)} {132534#(<= ~counter~0 9)} #98#return; {132534#(<= ~counter~0 9)} is VALID [2022-04-28 06:05:52,745 INFO L290 TraceCheckUtils]: 88: Hoare triple {132534#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {132534#(<= ~counter~0 9)} is VALID [2022-04-28 06:05:52,746 INFO L290 TraceCheckUtils]: 89: Hoare triple {132534#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {132559#(<= ~counter~0 10)} is VALID [2022-04-28 06:05:52,746 INFO L290 TraceCheckUtils]: 90: Hoare triple {132559#(<= ~counter~0 10)} assume !!(#t~post8 < 20);havoc #t~post8; {132559#(<= ~counter~0 10)} is VALID [2022-04-28 06:05:52,747 INFO L272 TraceCheckUtils]: 91: Hoare triple {132559#(<= ~counter~0 10)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {132559#(<= ~counter~0 10)} is VALID [2022-04-28 06:05:52,747 INFO L290 TraceCheckUtils]: 92: Hoare triple {132559#(<= ~counter~0 10)} ~cond := #in~cond; {132559#(<= ~counter~0 10)} is VALID [2022-04-28 06:05:52,747 INFO L290 TraceCheckUtils]: 93: Hoare triple {132559#(<= ~counter~0 10)} assume !(0 == ~cond); {132559#(<= ~counter~0 10)} is VALID [2022-04-28 06:05:52,748 INFO L290 TraceCheckUtils]: 94: Hoare triple {132559#(<= ~counter~0 10)} assume true; {132559#(<= ~counter~0 10)} is VALID [2022-04-28 06:05:52,748 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {132559#(<= ~counter~0 10)} {132559#(<= ~counter~0 10)} #98#return; {132559#(<= ~counter~0 10)} is VALID [2022-04-28 06:05:52,748 INFO L290 TraceCheckUtils]: 96: Hoare triple {132559#(<= ~counter~0 10)} assume !(~r~0 < 0); {132559#(<= ~counter~0 10)} is VALID [2022-04-28 06:05:52,750 INFO L290 TraceCheckUtils]: 97: Hoare triple {132559#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {132584#(<= ~counter~0 11)} is VALID [2022-04-28 06:05:52,750 INFO L290 TraceCheckUtils]: 98: Hoare triple {132584#(<= ~counter~0 11)} assume !!(#t~post6 < 20);havoc #t~post6; {132584#(<= ~counter~0 11)} is VALID [2022-04-28 06:05:52,750 INFO L272 TraceCheckUtils]: 99: Hoare triple {132584#(<= ~counter~0 11)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {132584#(<= ~counter~0 11)} is VALID [2022-04-28 06:05:52,751 INFO L290 TraceCheckUtils]: 100: Hoare triple {132584#(<= ~counter~0 11)} ~cond := #in~cond; {132584#(<= ~counter~0 11)} is VALID [2022-04-28 06:05:52,751 INFO L290 TraceCheckUtils]: 101: Hoare triple {132584#(<= ~counter~0 11)} assume !(0 == ~cond); {132584#(<= ~counter~0 11)} is VALID [2022-04-28 06:05:52,751 INFO L290 TraceCheckUtils]: 102: Hoare triple {132584#(<= ~counter~0 11)} assume true; {132584#(<= ~counter~0 11)} is VALID [2022-04-28 06:05:52,752 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {132584#(<= ~counter~0 11)} {132584#(<= ~counter~0 11)} #94#return; {132584#(<= ~counter~0 11)} is VALID [2022-04-28 06:05:52,752 INFO L290 TraceCheckUtils]: 104: Hoare triple {132584#(<= ~counter~0 11)} assume !!(0 != ~r~0); {132584#(<= ~counter~0 11)} is VALID [2022-04-28 06:05:52,753 INFO L290 TraceCheckUtils]: 105: Hoare triple {132584#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {132609#(<= ~counter~0 12)} is VALID [2022-04-28 06:05:52,753 INFO L290 TraceCheckUtils]: 106: Hoare triple {132609#(<= ~counter~0 12)} assume !!(#t~post7 < 20);havoc #t~post7; {132609#(<= ~counter~0 12)} is VALID [2022-04-28 06:05:52,754 INFO L272 TraceCheckUtils]: 107: Hoare triple {132609#(<= ~counter~0 12)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {132609#(<= ~counter~0 12)} is VALID [2022-04-28 06:05:52,754 INFO L290 TraceCheckUtils]: 108: Hoare triple {132609#(<= ~counter~0 12)} ~cond := #in~cond; {132609#(<= ~counter~0 12)} is VALID [2022-04-28 06:05:52,754 INFO L290 TraceCheckUtils]: 109: Hoare triple {132609#(<= ~counter~0 12)} assume !(0 == ~cond); {132609#(<= ~counter~0 12)} is VALID [2022-04-28 06:05:52,754 INFO L290 TraceCheckUtils]: 110: Hoare triple {132609#(<= ~counter~0 12)} assume true; {132609#(<= ~counter~0 12)} is VALID [2022-04-28 06:05:52,755 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {132609#(<= ~counter~0 12)} {132609#(<= ~counter~0 12)} #96#return; {132609#(<= ~counter~0 12)} is VALID [2022-04-28 06:05:52,755 INFO L290 TraceCheckUtils]: 112: Hoare triple {132609#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {132609#(<= ~counter~0 12)} is VALID [2022-04-28 06:05:52,756 INFO L290 TraceCheckUtils]: 113: Hoare triple {132609#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {132634#(<= ~counter~0 13)} is VALID [2022-04-28 06:05:52,757 INFO L290 TraceCheckUtils]: 114: Hoare triple {132634#(<= ~counter~0 13)} assume !!(#t~post7 < 20);havoc #t~post7; {132634#(<= ~counter~0 13)} is VALID [2022-04-28 06:05:52,757 INFO L272 TraceCheckUtils]: 115: Hoare triple {132634#(<= ~counter~0 13)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {132634#(<= ~counter~0 13)} is VALID [2022-04-28 06:05:52,757 INFO L290 TraceCheckUtils]: 116: Hoare triple {132634#(<= ~counter~0 13)} ~cond := #in~cond; {132634#(<= ~counter~0 13)} is VALID [2022-04-28 06:05:52,758 INFO L290 TraceCheckUtils]: 117: Hoare triple {132634#(<= ~counter~0 13)} assume !(0 == ~cond); {132634#(<= ~counter~0 13)} is VALID [2022-04-28 06:05:52,758 INFO L290 TraceCheckUtils]: 118: Hoare triple {132634#(<= ~counter~0 13)} assume true; {132634#(<= ~counter~0 13)} is VALID [2022-04-28 06:05:52,758 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {132634#(<= ~counter~0 13)} {132634#(<= ~counter~0 13)} #96#return; {132634#(<= ~counter~0 13)} is VALID [2022-04-28 06:05:52,759 INFO L290 TraceCheckUtils]: 120: Hoare triple {132634#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {132634#(<= ~counter~0 13)} is VALID [2022-04-28 06:05:52,760 INFO L290 TraceCheckUtils]: 121: Hoare triple {132634#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {132659#(<= ~counter~0 14)} is VALID [2022-04-28 06:05:52,760 INFO L290 TraceCheckUtils]: 122: Hoare triple {132659#(<= ~counter~0 14)} assume !!(#t~post7 < 20);havoc #t~post7; {132659#(<= ~counter~0 14)} is VALID [2022-04-28 06:05:52,760 INFO L272 TraceCheckUtils]: 123: Hoare triple {132659#(<= ~counter~0 14)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {132659#(<= ~counter~0 14)} is VALID [2022-04-28 06:05:52,761 INFO L290 TraceCheckUtils]: 124: Hoare triple {132659#(<= ~counter~0 14)} ~cond := #in~cond; {132659#(<= ~counter~0 14)} is VALID [2022-04-28 06:05:52,761 INFO L290 TraceCheckUtils]: 125: Hoare triple {132659#(<= ~counter~0 14)} assume !(0 == ~cond); {132659#(<= ~counter~0 14)} is VALID [2022-04-28 06:05:52,761 INFO L290 TraceCheckUtils]: 126: Hoare triple {132659#(<= ~counter~0 14)} assume true; {132659#(<= ~counter~0 14)} is VALID [2022-04-28 06:05:52,762 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {132659#(<= ~counter~0 14)} {132659#(<= ~counter~0 14)} #96#return; {132659#(<= ~counter~0 14)} is VALID [2022-04-28 06:05:52,762 INFO L290 TraceCheckUtils]: 128: Hoare triple {132659#(<= ~counter~0 14)} assume !(~r~0 > 0); {132659#(<= ~counter~0 14)} is VALID [2022-04-28 06:05:52,763 INFO L290 TraceCheckUtils]: 129: Hoare triple {132659#(<= ~counter~0 14)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {132684#(<= ~counter~0 15)} is VALID [2022-04-28 06:05:52,763 INFO L290 TraceCheckUtils]: 130: Hoare triple {132684#(<= ~counter~0 15)} assume !!(#t~post8 < 20);havoc #t~post8; {132684#(<= ~counter~0 15)} is VALID [2022-04-28 06:05:52,764 INFO L272 TraceCheckUtils]: 131: Hoare triple {132684#(<= ~counter~0 15)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {132684#(<= ~counter~0 15)} is VALID [2022-04-28 06:05:52,764 INFO L290 TraceCheckUtils]: 132: Hoare triple {132684#(<= ~counter~0 15)} ~cond := #in~cond; {132684#(<= ~counter~0 15)} is VALID [2022-04-28 06:05:52,764 INFO L290 TraceCheckUtils]: 133: Hoare triple {132684#(<= ~counter~0 15)} assume !(0 == ~cond); {132684#(<= ~counter~0 15)} is VALID [2022-04-28 06:05:52,765 INFO L290 TraceCheckUtils]: 134: Hoare triple {132684#(<= ~counter~0 15)} assume true; {132684#(<= ~counter~0 15)} is VALID [2022-04-28 06:05:52,765 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {132684#(<= ~counter~0 15)} {132684#(<= ~counter~0 15)} #98#return; {132684#(<= ~counter~0 15)} is VALID [2022-04-28 06:05:52,765 INFO L290 TraceCheckUtils]: 136: Hoare triple {132684#(<= ~counter~0 15)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {132684#(<= ~counter~0 15)} is VALID [2022-04-28 06:05:52,766 INFO L290 TraceCheckUtils]: 137: Hoare triple {132684#(<= ~counter~0 15)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {132709#(<= |main_#t~post8| 15)} is VALID [2022-04-28 06:05:52,766 INFO L290 TraceCheckUtils]: 138: Hoare triple {132709#(<= |main_#t~post8| 15)} assume !(#t~post8 < 20);havoc #t~post8; {132278#false} is VALID [2022-04-28 06:05:52,766 INFO L290 TraceCheckUtils]: 139: Hoare triple {132278#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {132278#false} is VALID [2022-04-28 06:05:52,766 INFO L290 TraceCheckUtils]: 140: Hoare triple {132278#false} assume !(#t~post6 < 20);havoc #t~post6; {132278#false} is VALID [2022-04-28 06:05:52,766 INFO L272 TraceCheckUtils]: 141: Hoare triple {132278#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {132278#false} is VALID [2022-04-28 06:05:52,766 INFO L290 TraceCheckUtils]: 142: Hoare triple {132278#false} ~cond := #in~cond; {132278#false} is VALID [2022-04-28 06:05:52,766 INFO L290 TraceCheckUtils]: 143: Hoare triple {132278#false} assume 0 == ~cond; {132278#false} is VALID [2022-04-28 06:05:52,766 INFO L290 TraceCheckUtils]: 144: Hoare triple {132278#false} assume !false; {132278#false} is VALID [2022-04-28 06:05:52,767 INFO L134 CoverageAnalysis]: Checked inductivity of 606 backedges. 36 proven. 566 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 06:05:52,767 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 06:05:53,513 INFO L290 TraceCheckUtils]: 144: Hoare triple {132278#false} assume !false; {132278#false} is VALID [2022-04-28 06:05:53,513 INFO L290 TraceCheckUtils]: 143: Hoare triple {132278#false} assume 0 == ~cond; {132278#false} is VALID [2022-04-28 06:05:53,513 INFO L290 TraceCheckUtils]: 142: Hoare triple {132278#false} ~cond := #in~cond; {132278#false} is VALID [2022-04-28 06:05:53,513 INFO L272 TraceCheckUtils]: 141: Hoare triple {132278#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {132278#false} is VALID [2022-04-28 06:05:53,513 INFO L290 TraceCheckUtils]: 140: Hoare triple {132278#false} assume !(#t~post6 < 20);havoc #t~post6; {132278#false} is VALID [2022-04-28 06:05:53,513 INFO L290 TraceCheckUtils]: 139: Hoare triple {132278#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {132278#false} is VALID [2022-04-28 06:05:53,513 INFO L290 TraceCheckUtils]: 138: Hoare triple {132749#(< |main_#t~post8| 20)} assume !(#t~post8 < 20);havoc #t~post8; {132278#false} is VALID [2022-04-28 06:05:53,514 INFO L290 TraceCheckUtils]: 137: Hoare triple {132753#(< ~counter~0 20)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {132749#(< |main_#t~post8| 20)} is VALID [2022-04-28 06:05:53,514 INFO L290 TraceCheckUtils]: 136: Hoare triple {132753#(< ~counter~0 20)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {132753#(< ~counter~0 20)} is VALID [2022-04-28 06:05:53,514 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {132277#true} {132753#(< ~counter~0 20)} #98#return; {132753#(< ~counter~0 20)} is VALID [2022-04-28 06:05:53,514 INFO L290 TraceCheckUtils]: 134: Hoare triple {132277#true} assume true; {132277#true} is VALID [2022-04-28 06:05:53,515 INFO L290 TraceCheckUtils]: 133: Hoare triple {132277#true} assume !(0 == ~cond); {132277#true} is VALID [2022-04-28 06:05:53,515 INFO L290 TraceCheckUtils]: 132: Hoare triple {132277#true} ~cond := #in~cond; {132277#true} is VALID [2022-04-28 06:05:53,515 INFO L272 TraceCheckUtils]: 131: Hoare triple {132753#(< ~counter~0 20)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {132277#true} is VALID [2022-04-28 06:05:53,515 INFO L290 TraceCheckUtils]: 130: Hoare triple {132753#(< ~counter~0 20)} assume !!(#t~post8 < 20);havoc #t~post8; {132753#(< ~counter~0 20)} is VALID [2022-04-28 06:05:53,518 INFO L290 TraceCheckUtils]: 129: Hoare triple {132778#(< ~counter~0 19)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {132753#(< ~counter~0 20)} is VALID [2022-04-28 06:05:53,518 INFO L290 TraceCheckUtils]: 128: Hoare triple {132778#(< ~counter~0 19)} assume !(~r~0 > 0); {132778#(< ~counter~0 19)} is VALID [2022-04-28 06:05:53,519 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {132277#true} {132778#(< ~counter~0 19)} #96#return; {132778#(< ~counter~0 19)} is VALID [2022-04-28 06:05:53,519 INFO L290 TraceCheckUtils]: 126: Hoare triple {132277#true} assume true; {132277#true} is VALID [2022-04-28 06:05:53,519 INFO L290 TraceCheckUtils]: 125: Hoare triple {132277#true} assume !(0 == ~cond); {132277#true} is VALID [2022-04-28 06:05:53,519 INFO L290 TraceCheckUtils]: 124: Hoare triple {132277#true} ~cond := #in~cond; {132277#true} is VALID [2022-04-28 06:05:53,519 INFO L272 TraceCheckUtils]: 123: Hoare triple {132778#(< ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {132277#true} is VALID [2022-04-28 06:05:53,519 INFO L290 TraceCheckUtils]: 122: Hoare triple {132778#(< ~counter~0 19)} assume !!(#t~post7 < 20);havoc #t~post7; {132778#(< ~counter~0 19)} is VALID [2022-04-28 06:05:53,521 INFO L290 TraceCheckUtils]: 121: Hoare triple {132803#(< ~counter~0 18)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {132778#(< ~counter~0 19)} is VALID [2022-04-28 06:05:53,521 INFO L290 TraceCheckUtils]: 120: Hoare triple {132803#(< ~counter~0 18)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {132803#(< ~counter~0 18)} is VALID [2022-04-28 06:05:53,521 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {132277#true} {132803#(< ~counter~0 18)} #96#return; {132803#(< ~counter~0 18)} is VALID [2022-04-28 06:05:53,521 INFO L290 TraceCheckUtils]: 118: Hoare triple {132277#true} assume true; {132277#true} is VALID [2022-04-28 06:05:53,521 INFO L290 TraceCheckUtils]: 117: Hoare triple {132277#true} assume !(0 == ~cond); {132277#true} is VALID [2022-04-28 06:05:53,522 INFO L290 TraceCheckUtils]: 116: Hoare triple {132277#true} ~cond := #in~cond; {132277#true} is VALID [2022-04-28 06:05:53,522 INFO L272 TraceCheckUtils]: 115: Hoare triple {132803#(< ~counter~0 18)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {132277#true} is VALID [2022-04-28 06:05:53,522 INFO L290 TraceCheckUtils]: 114: Hoare triple {132803#(< ~counter~0 18)} assume !!(#t~post7 < 20);havoc #t~post7; {132803#(< ~counter~0 18)} is VALID [2022-04-28 06:05:53,523 INFO L290 TraceCheckUtils]: 113: Hoare triple {132828#(< ~counter~0 17)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {132803#(< ~counter~0 18)} is VALID [2022-04-28 06:05:53,523 INFO L290 TraceCheckUtils]: 112: Hoare triple {132828#(< ~counter~0 17)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {132828#(< ~counter~0 17)} is VALID [2022-04-28 06:05:53,524 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {132277#true} {132828#(< ~counter~0 17)} #96#return; {132828#(< ~counter~0 17)} is VALID [2022-04-28 06:05:53,524 INFO L290 TraceCheckUtils]: 110: Hoare triple {132277#true} assume true; {132277#true} is VALID [2022-04-28 06:05:53,524 INFO L290 TraceCheckUtils]: 109: Hoare triple {132277#true} assume !(0 == ~cond); {132277#true} is VALID [2022-04-28 06:05:53,524 INFO L290 TraceCheckUtils]: 108: Hoare triple {132277#true} ~cond := #in~cond; {132277#true} is VALID [2022-04-28 06:05:53,524 INFO L272 TraceCheckUtils]: 107: Hoare triple {132828#(< ~counter~0 17)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {132277#true} is VALID [2022-04-28 06:05:53,524 INFO L290 TraceCheckUtils]: 106: Hoare triple {132828#(< ~counter~0 17)} assume !!(#t~post7 < 20);havoc #t~post7; {132828#(< ~counter~0 17)} is VALID [2022-04-28 06:05:53,526 INFO L290 TraceCheckUtils]: 105: Hoare triple {132684#(<= ~counter~0 15)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {132828#(< ~counter~0 17)} is VALID [2022-04-28 06:05:53,526 INFO L290 TraceCheckUtils]: 104: Hoare triple {132684#(<= ~counter~0 15)} assume !!(0 != ~r~0); {132684#(<= ~counter~0 15)} is VALID [2022-04-28 06:05:53,527 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {132277#true} {132684#(<= ~counter~0 15)} #94#return; {132684#(<= ~counter~0 15)} is VALID [2022-04-28 06:05:53,527 INFO L290 TraceCheckUtils]: 102: Hoare triple {132277#true} assume true; {132277#true} is VALID [2022-04-28 06:05:53,527 INFO L290 TraceCheckUtils]: 101: Hoare triple {132277#true} assume !(0 == ~cond); {132277#true} is VALID [2022-04-28 06:05:53,527 INFO L290 TraceCheckUtils]: 100: Hoare triple {132277#true} ~cond := #in~cond; {132277#true} is VALID [2022-04-28 06:05:53,527 INFO L272 TraceCheckUtils]: 99: Hoare triple {132684#(<= ~counter~0 15)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {132277#true} is VALID [2022-04-28 06:05:53,527 INFO L290 TraceCheckUtils]: 98: Hoare triple {132684#(<= ~counter~0 15)} assume !!(#t~post6 < 20);havoc #t~post6; {132684#(<= ~counter~0 15)} is VALID [2022-04-28 06:05:53,529 INFO L290 TraceCheckUtils]: 97: Hoare triple {132659#(<= ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {132684#(<= ~counter~0 15)} is VALID [2022-04-28 06:05:53,529 INFO L290 TraceCheckUtils]: 96: Hoare triple {132659#(<= ~counter~0 14)} assume !(~r~0 < 0); {132659#(<= ~counter~0 14)} is VALID [2022-04-28 06:05:53,529 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {132277#true} {132659#(<= ~counter~0 14)} #98#return; {132659#(<= ~counter~0 14)} is VALID [2022-04-28 06:05:53,529 INFO L290 TraceCheckUtils]: 94: Hoare triple {132277#true} assume true; {132277#true} is VALID [2022-04-28 06:05:53,529 INFO L290 TraceCheckUtils]: 93: Hoare triple {132277#true} assume !(0 == ~cond); {132277#true} is VALID [2022-04-28 06:05:53,530 INFO L290 TraceCheckUtils]: 92: Hoare triple {132277#true} ~cond := #in~cond; {132277#true} is VALID [2022-04-28 06:05:53,530 INFO L272 TraceCheckUtils]: 91: Hoare triple {132659#(<= ~counter~0 14)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {132277#true} is VALID [2022-04-28 06:05:53,530 INFO L290 TraceCheckUtils]: 90: Hoare triple {132659#(<= ~counter~0 14)} assume !!(#t~post8 < 20);havoc #t~post8; {132659#(<= ~counter~0 14)} is VALID [2022-04-28 06:05:53,531 INFO L290 TraceCheckUtils]: 89: Hoare triple {132634#(<= ~counter~0 13)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {132659#(<= ~counter~0 14)} is VALID [2022-04-28 06:05:53,531 INFO L290 TraceCheckUtils]: 88: Hoare triple {132634#(<= ~counter~0 13)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {132634#(<= ~counter~0 13)} is VALID [2022-04-28 06:05:53,532 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {132277#true} {132634#(<= ~counter~0 13)} #98#return; {132634#(<= ~counter~0 13)} is VALID [2022-04-28 06:05:53,532 INFO L290 TraceCheckUtils]: 86: Hoare triple {132277#true} assume true; {132277#true} is VALID [2022-04-28 06:05:53,532 INFO L290 TraceCheckUtils]: 85: Hoare triple {132277#true} assume !(0 == ~cond); {132277#true} is VALID [2022-04-28 06:05:53,532 INFO L290 TraceCheckUtils]: 84: Hoare triple {132277#true} ~cond := #in~cond; {132277#true} is VALID [2022-04-28 06:05:53,532 INFO L272 TraceCheckUtils]: 83: Hoare triple {132634#(<= ~counter~0 13)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {132277#true} is VALID [2022-04-28 06:05:53,532 INFO L290 TraceCheckUtils]: 82: Hoare triple {132634#(<= ~counter~0 13)} assume !!(#t~post8 < 20);havoc #t~post8; {132634#(<= ~counter~0 13)} is VALID [2022-04-28 06:05:53,534 INFO L290 TraceCheckUtils]: 81: Hoare triple {132609#(<= ~counter~0 12)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {132634#(<= ~counter~0 13)} is VALID [2022-04-28 06:05:53,534 INFO L290 TraceCheckUtils]: 80: Hoare triple {132609#(<= ~counter~0 12)} assume !(~r~0 > 0); {132609#(<= ~counter~0 12)} is VALID [2022-04-28 06:05:53,535 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {132277#true} {132609#(<= ~counter~0 12)} #96#return; {132609#(<= ~counter~0 12)} is VALID [2022-04-28 06:05:53,535 INFO L290 TraceCheckUtils]: 78: Hoare triple {132277#true} assume true; {132277#true} is VALID [2022-04-28 06:05:53,535 INFO L290 TraceCheckUtils]: 77: Hoare triple {132277#true} assume !(0 == ~cond); {132277#true} is VALID [2022-04-28 06:05:53,535 INFO L290 TraceCheckUtils]: 76: Hoare triple {132277#true} ~cond := #in~cond; {132277#true} is VALID [2022-04-28 06:05:53,535 INFO L272 TraceCheckUtils]: 75: Hoare triple {132609#(<= ~counter~0 12)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {132277#true} is VALID [2022-04-28 06:05:53,535 INFO L290 TraceCheckUtils]: 74: Hoare triple {132609#(<= ~counter~0 12)} assume !!(#t~post7 < 20);havoc #t~post7; {132609#(<= ~counter~0 12)} is VALID [2022-04-28 06:05:53,536 INFO L290 TraceCheckUtils]: 73: Hoare triple {132584#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {132609#(<= ~counter~0 12)} is VALID [2022-04-28 06:05:53,537 INFO L290 TraceCheckUtils]: 72: Hoare triple {132584#(<= ~counter~0 11)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {132584#(<= ~counter~0 11)} is VALID [2022-04-28 06:05:53,537 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {132277#true} {132584#(<= ~counter~0 11)} #96#return; {132584#(<= ~counter~0 11)} is VALID [2022-04-28 06:05:53,537 INFO L290 TraceCheckUtils]: 70: Hoare triple {132277#true} assume true; {132277#true} is VALID [2022-04-28 06:05:53,537 INFO L290 TraceCheckUtils]: 69: Hoare triple {132277#true} assume !(0 == ~cond); {132277#true} is VALID [2022-04-28 06:05:53,537 INFO L290 TraceCheckUtils]: 68: Hoare triple {132277#true} ~cond := #in~cond; {132277#true} is VALID [2022-04-28 06:05:53,537 INFO L272 TraceCheckUtils]: 67: Hoare triple {132584#(<= ~counter~0 11)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {132277#true} is VALID [2022-04-28 06:05:53,538 INFO L290 TraceCheckUtils]: 66: Hoare triple {132584#(<= ~counter~0 11)} assume !!(#t~post7 < 20);havoc #t~post7; {132584#(<= ~counter~0 11)} is VALID [2022-04-28 06:05:53,539 INFO L290 TraceCheckUtils]: 65: Hoare triple {132559#(<= ~counter~0 10)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {132584#(<= ~counter~0 11)} is VALID [2022-04-28 06:05:53,539 INFO L290 TraceCheckUtils]: 64: Hoare triple {132559#(<= ~counter~0 10)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {132559#(<= ~counter~0 10)} is VALID [2022-04-28 06:05:53,540 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {132277#true} {132559#(<= ~counter~0 10)} #96#return; {132559#(<= ~counter~0 10)} is VALID [2022-04-28 06:05:53,540 INFO L290 TraceCheckUtils]: 62: Hoare triple {132277#true} assume true; {132277#true} is VALID [2022-04-28 06:05:53,540 INFO L290 TraceCheckUtils]: 61: Hoare triple {132277#true} assume !(0 == ~cond); {132277#true} is VALID [2022-04-28 06:05:53,540 INFO L290 TraceCheckUtils]: 60: Hoare triple {132277#true} ~cond := #in~cond; {132277#true} is VALID [2022-04-28 06:05:53,540 INFO L272 TraceCheckUtils]: 59: Hoare triple {132559#(<= ~counter~0 10)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {132277#true} is VALID [2022-04-28 06:05:53,540 INFO L290 TraceCheckUtils]: 58: Hoare triple {132559#(<= ~counter~0 10)} assume !!(#t~post7 < 20);havoc #t~post7; {132559#(<= ~counter~0 10)} is VALID [2022-04-28 06:05:53,542 INFO L290 TraceCheckUtils]: 57: Hoare triple {132534#(<= ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {132559#(<= ~counter~0 10)} is VALID [2022-04-28 06:05:53,542 INFO L290 TraceCheckUtils]: 56: Hoare triple {132534#(<= ~counter~0 9)} assume !!(0 != ~r~0); {132534#(<= ~counter~0 9)} is VALID [2022-04-28 06:05:53,542 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {132277#true} {132534#(<= ~counter~0 9)} #94#return; {132534#(<= ~counter~0 9)} is VALID [2022-04-28 06:05:53,543 INFO L290 TraceCheckUtils]: 54: Hoare triple {132277#true} assume true; {132277#true} is VALID [2022-04-28 06:05:53,543 INFO L290 TraceCheckUtils]: 53: Hoare triple {132277#true} assume !(0 == ~cond); {132277#true} is VALID [2022-04-28 06:05:53,543 INFO L290 TraceCheckUtils]: 52: Hoare triple {132277#true} ~cond := #in~cond; {132277#true} is VALID [2022-04-28 06:05:53,543 INFO L272 TraceCheckUtils]: 51: Hoare triple {132534#(<= ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {132277#true} is VALID [2022-04-28 06:05:53,543 INFO L290 TraceCheckUtils]: 50: Hoare triple {132534#(<= ~counter~0 9)} assume !!(#t~post6 < 20);havoc #t~post6; {132534#(<= ~counter~0 9)} is VALID [2022-04-28 06:05:53,544 INFO L290 TraceCheckUtils]: 49: Hoare triple {132509#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {132534#(<= ~counter~0 9)} is VALID [2022-04-28 06:05:53,545 INFO L290 TraceCheckUtils]: 48: Hoare triple {132509#(<= ~counter~0 8)} assume !(~r~0 < 0); {132509#(<= ~counter~0 8)} is VALID [2022-04-28 06:05:53,545 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {132277#true} {132509#(<= ~counter~0 8)} #98#return; {132509#(<= ~counter~0 8)} is VALID [2022-04-28 06:05:53,545 INFO L290 TraceCheckUtils]: 46: Hoare triple {132277#true} assume true; {132277#true} is VALID [2022-04-28 06:05:53,545 INFO L290 TraceCheckUtils]: 45: Hoare triple {132277#true} assume !(0 == ~cond); {132277#true} is VALID [2022-04-28 06:05:53,545 INFO L290 TraceCheckUtils]: 44: Hoare triple {132277#true} ~cond := #in~cond; {132277#true} is VALID [2022-04-28 06:05:53,545 INFO L272 TraceCheckUtils]: 43: Hoare triple {132509#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {132277#true} is VALID [2022-04-28 06:05:53,546 INFO L290 TraceCheckUtils]: 42: Hoare triple {132509#(<= ~counter~0 8)} assume !!(#t~post8 < 20);havoc #t~post8; {132509#(<= ~counter~0 8)} is VALID [2022-04-28 06:05:53,547 INFO L290 TraceCheckUtils]: 41: Hoare triple {132484#(<= ~counter~0 7)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {132509#(<= ~counter~0 8)} is VALID [2022-04-28 06:05:53,547 INFO L290 TraceCheckUtils]: 40: Hoare triple {132484#(<= ~counter~0 7)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {132484#(<= ~counter~0 7)} is VALID [2022-04-28 06:05:53,548 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {132277#true} {132484#(<= ~counter~0 7)} #98#return; {132484#(<= ~counter~0 7)} is VALID [2022-04-28 06:05:53,548 INFO L290 TraceCheckUtils]: 38: Hoare triple {132277#true} assume true; {132277#true} is VALID [2022-04-28 06:05:53,548 INFO L290 TraceCheckUtils]: 37: Hoare triple {132277#true} assume !(0 == ~cond); {132277#true} is VALID [2022-04-28 06:05:53,548 INFO L290 TraceCheckUtils]: 36: Hoare triple {132277#true} ~cond := #in~cond; {132277#true} is VALID [2022-04-28 06:05:53,548 INFO L272 TraceCheckUtils]: 35: Hoare triple {132484#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {132277#true} is VALID [2022-04-28 06:05:53,548 INFO L290 TraceCheckUtils]: 34: Hoare triple {132484#(<= ~counter~0 7)} assume !!(#t~post8 < 20);havoc #t~post8; {132484#(<= ~counter~0 7)} is VALID [2022-04-28 06:05:53,550 INFO L290 TraceCheckUtils]: 33: Hoare triple {132459#(<= ~counter~0 6)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {132484#(<= ~counter~0 7)} is VALID [2022-04-28 06:05:53,550 INFO L290 TraceCheckUtils]: 32: Hoare triple {132459#(<= ~counter~0 6)} assume !(~r~0 > 0); {132459#(<= ~counter~0 6)} is VALID [2022-04-28 06:05:53,550 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {132277#true} {132459#(<= ~counter~0 6)} #96#return; {132459#(<= ~counter~0 6)} is VALID [2022-04-28 06:05:53,550 INFO L290 TraceCheckUtils]: 30: Hoare triple {132277#true} assume true; {132277#true} is VALID [2022-04-28 06:05:53,550 INFO L290 TraceCheckUtils]: 29: Hoare triple {132277#true} assume !(0 == ~cond); {132277#true} is VALID [2022-04-28 06:05:53,551 INFO L290 TraceCheckUtils]: 28: Hoare triple {132277#true} ~cond := #in~cond; {132277#true} is VALID [2022-04-28 06:05:53,551 INFO L272 TraceCheckUtils]: 27: Hoare triple {132459#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {132277#true} is VALID [2022-04-28 06:05:53,551 INFO L290 TraceCheckUtils]: 26: Hoare triple {132459#(<= ~counter~0 6)} assume !!(#t~post7 < 20);havoc #t~post7; {132459#(<= ~counter~0 6)} is VALID [2022-04-28 06:05:53,552 INFO L290 TraceCheckUtils]: 25: Hoare triple {132434#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {132459#(<= ~counter~0 6)} is VALID [2022-04-28 06:05:53,552 INFO L290 TraceCheckUtils]: 24: Hoare triple {132434#(<= ~counter~0 5)} assume !!(0 != ~r~0); {132434#(<= ~counter~0 5)} is VALID [2022-04-28 06:05:53,553 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {132277#true} {132434#(<= ~counter~0 5)} #94#return; {132434#(<= ~counter~0 5)} is VALID [2022-04-28 06:05:53,553 INFO L290 TraceCheckUtils]: 22: Hoare triple {132277#true} assume true; {132277#true} is VALID [2022-04-28 06:05:53,553 INFO L290 TraceCheckUtils]: 21: Hoare triple {132277#true} assume !(0 == ~cond); {132277#true} is VALID [2022-04-28 06:05:53,553 INFO L290 TraceCheckUtils]: 20: Hoare triple {132277#true} ~cond := #in~cond; {132277#true} is VALID [2022-04-28 06:05:53,553 INFO L272 TraceCheckUtils]: 19: Hoare triple {132434#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {132277#true} is VALID [2022-04-28 06:05:53,553 INFO L290 TraceCheckUtils]: 18: Hoare triple {132434#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {132434#(<= ~counter~0 5)} is VALID [2022-04-28 06:05:53,555 INFO L290 TraceCheckUtils]: 17: Hoare triple {132409#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {132434#(<= ~counter~0 5)} is VALID [2022-04-28 06:05:53,555 INFO L290 TraceCheckUtils]: 16: Hoare triple {132409#(<= ~counter~0 4)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {132409#(<= ~counter~0 4)} is VALID [2022-04-28 06:05:53,555 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {132277#true} {132409#(<= ~counter~0 4)} #92#return; {132409#(<= ~counter~0 4)} is VALID [2022-04-28 06:05:53,555 INFO L290 TraceCheckUtils]: 14: Hoare triple {132277#true} assume true; {132277#true} is VALID [2022-04-28 06:05:53,555 INFO L290 TraceCheckUtils]: 13: Hoare triple {132277#true} assume !(0 == ~cond); {132277#true} is VALID [2022-04-28 06:05:53,555 INFO L290 TraceCheckUtils]: 12: Hoare triple {132277#true} ~cond := #in~cond; {132277#true} is VALID [2022-04-28 06:05:53,555 INFO L272 TraceCheckUtils]: 11: Hoare triple {132409#(<= ~counter~0 4)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {132277#true} is VALID [2022-04-28 06:05:53,556 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {132277#true} {132409#(<= ~counter~0 4)} #90#return; {132409#(<= ~counter~0 4)} is VALID [2022-04-28 06:05:53,556 INFO L290 TraceCheckUtils]: 9: Hoare triple {132277#true} assume true; {132277#true} is VALID [2022-04-28 06:05:53,556 INFO L290 TraceCheckUtils]: 8: Hoare triple {132277#true} assume !(0 == ~cond); {132277#true} is VALID [2022-04-28 06:05:53,556 INFO L290 TraceCheckUtils]: 7: Hoare triple {132277#true} ~cond := #in~cond; {132277#true} is VALID [2022-04-28 06:05:53,556 INFO L272 TraceCheckUtils]: 6: Hoare triple {132409#(<= ~counter~0 4)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {132277#true} is VALID [2022-04-28 06:05:53,556 INFO L290 TraceCheckUtils]: 5: Hoare triple {132409#(<= ~counter~0 4)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {132409#(<= ~counter~0 4)} is VALID [2022-04-28 06:05:53,557 INFO L272 TraceCheckUtils]: 4: Hoare triple {132409#(<= ~counter~0 4)} call #t~ret9 := main(); {132409#(<= ~counter~0 4)} is VALID [2022-04-28 06:05:53,557 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {132409#(<= ~counter~0 4)} {132277#true} #102#return; {132409#(<= ~counter~0 4)} is VALID [2022-04-28 06:05:53,557 INFO L290 TraceCheckUtils]: 2: Hoare triple {132409#(<= ~counter~0 4)} assume true; {132409#(<= ~counter~0 4)} is VALID [2022-04-28 06:05:53,558 INFO L290 TraceCheckUtils]: 1: Hoare triple {132277#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {132409#(<= ~counter~0 4)} is VALID [2022-04-28 06:05:53,558 INFO L272 TraceCheckUtils]: 0: Hoare triple {132277#true} call ULTIMATE.init(); {132277#true} is VALID [2022-04-28 06:05:53,558 INFO L134 CoverageAnalysis]: Checked inductivity of 606 backedges. 36 proven. 146 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2022-04-28 06:05:53,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:05:53,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992497257] [2022-04-28 06:05:53,558 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:05:53,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1785258228] [2022-04-28 06:05:53,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1785258228] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 06:05:53,559 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 06:05:53,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 24 [2022-04-28 06:05:53,559 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:05:53,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1535621153] [2022-04-28 06:05:53,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1535621153] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:05:53,559 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:05:53,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-28 06:05:53,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209509331] [2022-04-28 06:05:53,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:05:53,559 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.473684210526316) internal successors, (104), 18 states have internal predecessors, (104), 18 states have call successors, (20), 18 states have call predecessors, (20), 16 states have return successors, (18), 16 states have call predecessors, (18), 17 states have call successors, (18) Word has length 145 [2022-04-28 06:05:53,560 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:05:53,560 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 5.473684210526316) internal successors, (104), 18 states have internal predecessors, (104), 18 states have call successors, (20), 18 states have call predecessors, (20), 16 states have return successors, (18), 16 states have call predecessors, (18), 17 states have call successors, (18) [2022-04-28 06:05:53,741 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:05:53,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-28 06:05:53,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:05:53,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-28 06:05:53,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-28 06:05:53,742 INFO L87 Difference]: Start difference. First operand 775 states and 1041 transitions. Second operand has 19 states, 19 states have (on average 5.473684210526316) internal successors, (104), 18 states have internal predecessors, (104), 18 states have call successors, (20), 18 states have call predecessors, (20), 16 states have return successors, (18), 16 states have call predecessors, (18), 17 states have call successors, (18) [2022-04-28 06:05:59,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:05:59,449 INFO L93 Difference]: Finished difference Result 981 states and 1345 transitions. [2022-04-28 06:05:59,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-28 06:05:59,450 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.473684210526316) internal successors, (104), 18 states have internal predecessors, (104), 18 states have call successors, (20), 18 states have call predecessors, (20), 16 states have return successors, (18), 16 states have call predecessors, (18), 17 states have call successors, (18) Word has length 145 [2022-04-28 06:05:59,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:05:59,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 5.473684210526316) internal successors, (104), 18 states have internal predecessors, (104), 18 states have call successors, (20), 18 states have call predecessors, (20), 16 states have return successors, (18), 16 states have call predecessors, (18), 17 states have call successors, (18) [2022-04-28 06:05:59,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 337 transitions. [2022-04-28 06:05:59,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 5.473684210526316) internal successors, (104), 18 states have internal predecessors, (104), 18 states have call successors, (20), 18 states have call predecessors, (20), 16 states have return successors, (18), 16 states have call predecessors, (18), 17 states have call successors, (18) [2022-04-28 06:05:59,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 337 transitions. [2022-04-28 06:05:59,456 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 337 transitions. [2022-04-28 06:06:00,017 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 337 edges. 337 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:06:00,043 INFO L225 Difference]: With dead ends: 981 [2022-04-28 06:06:00,043 INFO L226 Difference]: Without dead ends: 789 [2022-04-28 06:06:00,044 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 266 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=509, Invalid=823, Unknown=0, NotChecked=0, Total=1332 [2022-04-28 06:06:00,044 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 230 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-28 06:06:00,044 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 343 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-28 06:06:00,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2022-04-28 06:06:03,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 778. [2022-04-28 06:06:03,016 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:06:03,017 INFO L82 GeneralOperation]: Start isEquivalent. First operand 789 states. Second operand has 778 states, 582 states have (on average 1.1872852233676976) internal successors, (691), 594 states have internal predecessors, (691), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 162 states have call predecessors, (174), 174 states have call successors, (174) [2022-04-28 06:06:03,018 INFO L74 IsIncluded]: Start isIncluded. First operand 789 states. Second operand has 778 states, 582 states have (on average 1.1872852233676976) internal successors, (691), 594 states have internal predecessors, (691), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 162 states have call predecessors, (174), 174 states have call successors, (174) [2022-04-28 06:06:03,018 INFO L87 Difference]: Start difference. First operand 789 states. Second operand has 778 states, 582 states have (on average 1.1872852233676976) internal successors, (691), 594 states have internal predecessors, (691), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 162 states have call predecessors, (174), 174 states have call successors, (174) [2022-04-28 06:06:03,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:06:03,039 INFO L93 Difference]: Finished difference Result 789 states and 1052 transitions. [2022-04-28 06:06:03,039 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1052 transitions. [2022-04-28 06:06:03,040 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:06:03,040 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:06:03,041 INFO L74 IsIncluded]: Start isIncluded. First operand has 778 states, 582 states have (on average 1.1872852233676976) internal successors, (691), 594 states have internal predecessors, (691), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 162 states have call predecessors, (174), 174 states have call successors, (174) Second operand 789 states. [2022-04-28 06:06:03,041 INFO L87 Difference]: Start difference. First operand has 778 states, 582 states have (on average 1.1872852233676976) internal successors, (691), 594 states have internal predecessors, (691), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 162 states have call predecessors, (174), 174 states have call successors, (174) Second operand 789 states. [2022-04-28 06:06:03,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:06:03,063 INFO L93 Difference]: Finished difference Result 789 states and 1052 transitions. [2022-04-28 06:06:03,063 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1052 transitions. [2022-04-28 06:06:03,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:06:03,064 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:06:03,064 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:06:03,064 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:06:03,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 778 states, 582 states have (on average 1.1872852233676976) internal successors, (691), 594 states have internal predecessors, (691), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 162 states have call predecessors, (174), 174 states have call successors, (174) [2022-04-28 06:06:03,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 1041 transitions. [2022-04-28 06:06:03,093 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 1041 transitions. Word has length 145 [2022-04-28 06:06:03,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:06:03,093 INFO L495 AbstractCegarLoop]: Abstraction has 778 states and 1041 transitions. [2022-04-28 06:06:03,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.473684210526316) internal successors, (104), 18 states have internal predecessors, (104), 18 states have call successors, (20), 18 states have call predecessors, (20), 16 states have return successors, (18), 16 states have call predecessors, (18), 17 states have call successors, (18) [2022-04-28 06:06:03,093 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 778 states and 1041 transitions. [2022-04-28 06:06:14,794 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1041 edges. 1039 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 06:06:14,794 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 1041 transitions. [2022-04-28 06:06:14,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-04-28 06:06:14,796 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:06:14,796 INFO L195 NwaCegarLoop]: trace histogram [16, 15, 15, 9, 8, 8, 8, 6, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:06:14,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Forceful destruction successful, exit code 0 [2022-04-28 06:06:15,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2022-04-28 06:06:15,021 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:06:15,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:06:15,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1963931820, now seen corresponding path program 21 times [2022-04-28 06:06:15,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:06:15,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [36129388] [2022-04-28 06:06:15,022 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 06:06:15,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1963931820, now seen corresponding path program 22 times [2022-04-28 06:06:15,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:06:15,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727861564] [2022-04-28 06:06:15,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:06:15,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:06:15,037 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:06:15,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1200132300] [2022-04-28 06:06:15,037 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 06:06:15,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:06:15,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:06:15,038 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:06:15,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2022-04-28 06:06:15,213 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 06:06:15,213 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:06:15,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-28 06:06:15,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:06:15,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:06:16,126 INFO L272 TraceCheckUtils]: 0: Hoare triple {138292#true} call ULTIMATE.init(); {138292#true} is VALID [2022-04-28 06:06:16,126 INFO L290 TraceCheckUtils]: 1: Hoare triple {138292#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {138300#(<= ~counter~0 0)} is VALID [2022-04-28 06:06:16,127 INFO L290 TraceCheckUtils]: 2: Hoare triple {138300#(<= ~counter~0 0)} assume true; {138300#(<= ~counter~0 0)} is VALID [2022-04-28 06:06:16,127 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {138300#(<= ~counter~0 0)} {138292#true} #102#return; {138300#(<= ~counter~0 0)} is VALID [2022-04-28 06:06:16,127 INFO L272 TraceCheckUtils]: 4: Hoare triple {138300#(<= ~counter~0 0)} call #t~ret9 := main(); {138300#(<= ~counter~0 0)} is VALID [2022-04-28 06:06:16,128 INFO L290 TraceCheckUtils]: 5: Hoare triple {138300#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {138300#(<= ~counter~0 0)} is VALID [2022-04-28 06:06:16,128 INFO L272 TraceCheckUtils]: 6: Hoare triple {138300#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {138300#(<= ~counter~0 0)} is VALID [2022-04-28 06:06:16,128 INFO L290 TraceCheckUtils]: 7: Hoare triple {138300#(<= ~counter~0 0)} ~cond := #in~cond; {138300#(<= ~counter~0 0)} is VALID [2022-04-28 06:06:16,129 INFO L290 TraceCheckUtils]: 8: Hoare triple {138300#(<= ~counter~0 0)} assume !(0 == ~cond); {138300#(<= ~counter~0 0)} is VALID [2022-04-28 06:06:16,129 INFO L290 TraceCheckUtils]: 9: Hoare triple {138300#(<= ~counter~0 0)} assume true; {138300#(<= ~counter~0 0)} is VALID [2022-04-28 06:06:16,129 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {138300#(<= ~counter~0 0)} {138300#(<= ~counter~0 0)} #90#return; {138300#(<= ~counter~0 0)} is VALID [2022-04-28 06:06:16,130 INFO L272 TraceCheckUtils]: 11: Hoare triple {138300#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {138300#(<= ~counter~0 0)} is VALID [2022-04-28 06:06:16,130 INFO L290 TraceCheckUtils]: 12: Hoare triple {138300#(<= ~counter~0 0)} ~cond := #in~cond; {138300#(<= ~counter~0 0)} is VALID [2022-04-28 06:06:16,130 INFO L290 TraceCheckUtils]: 13: Hoare triple {138300#(<= ~counter~0 0)} assume !(0 == ~cond); {138300#(<= ~counter~0 0)} is VALID [2022-04-28 06:06:16,130 INFO L290 TraceCheckUtils]: 14: Hoare triple {138300#(<= ~counter~0 0)} assume true; {138300#(<= ~counter~0 0)} is VALID [2022-04-28 06:06:16,131 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {138300#(<= ~counter~0 0)} {138300#(<= ~counter~0 0)} #92#return; {138300#(<= ~counter~0 0)} is VALID [2022-04-28 06:06:16,131 INFO L290 TraceCheckUtils]: 16: Hoare triple {138300#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {138300#(<= ~counter~0 0)} is VALID [2022-04-28 06:06:16,135 INFO L290 TraceCheckUtils]: 17: Hoare triple {138300#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {138349#(<= ~counter~0 1)} is VALID [2022-04-28 06:06:16,135 INFO L290 TraceCheckUtils]: 18: Hoare triple {138349#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {138349#(<= ~counter~0 1)} is VALID [2022-04-28 06:06:16,136 INFO L272 TraceCheckUtils]: 19: Hoare triple {138349#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {138349#(<= ~counter~0 1)} is VALID [2022-04-28 06:06:16,136 INFO L290 TraceCheckUtils]: 20: Hoare triple {138349#(<= ~counter~0 1)} ~cond := #in~cond; {138349#(<= ~counter~0 1)} is VALID [2022-04-28 06:06:16,136 INFO L290 TraceCheckUtils]: 21: Hoare triple {138349#(<= ~counter~0 1)} assume !(0 == ~cond); {138349#(<= ~counter~0 1)} is VALID [2022-04-28 06:06:16,137 INFO L290 TraceCheckUtils]: 22: Hoare triple {138349#(<= ~counter~0 1)} assume true; {138349#(<= ~counter~0 1)} is VALID [2022-04-28 06:06:16,137 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {138349#(<= ~counter~0 1)} {138349#(<= ~counter~0 1)} #94#return; {138349#(<= ~counter~0 1)} is VALID [2022-04-28 06:06:16,137 INFO L290 TraceCheckUtils]: 24: Hoare triple {138349#(<= ~counter~0 1)} assume !!(0 != ~r~0); {138349#(<= ~counter~0 1)} is VALID [2022-04-28 06:06:16,140 INFO L290 TraceCheckUtils]: 25: Hoare triple {138349#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {138374#(<= ~counter~0 2)} is VALID [2022-04-28 06:06:16,141 INFO L290 TraceCheckUtils]: 26: Hoare triple {138374#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {138374#(<= ~counter~0 2)} is VALID [2022-04-28 06:06:16,141 INFO L272 TraceCheckUtils]: 27: Hoare triple {138374#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {138374#(<= ~counter~0 2)} is VALID [2022-04-28 06:06:16,142 INFO L290 TraceCheckUtils]: 28: Hoare triple {138374#(<= ~counter~0 2)} ~cond := #in~cond; {138374#(<= ~counter~0 2)} is VALID [2022-04-28 06:06:16,142 INFO L290 TraceCheckUtils]: 29: Hoare triple {138374#(<= ~counter~0 2)} assume !(0 == ~cond); {138374#(<= ~counter~0 2)} is VALID [2022-04-28 06:06:16,142 INFO L290 TraceCheckUtils]: 30: Hoare triple {138374#(<= ~counter~0 2)} assume true; {138374#(<= ~counter~0 2)} is VALID [2022-04-28 06:06:16,143 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {138374#(<= ~counter~0 2)} {138374#(<= ~counter~0 2)} #96#return; {138374#(<= ~counter~0 2)} is VALID [2022-04-28 06:06:16,143 INFO L290 TraceCheckUtils]: 32: Hoare triple {138374#(<= ~counter~0 2)} assume !(~r~0 > 0); {138374#(<= ~counter~0 2)} is VALID [2022-04-28 06:06:16,146 INFO L290 TraceCheckUtils]: 33: Hoare triple {138374#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {138399#(<= ~counter~0 3)} is VALID [2022-04-28 06:06:16,146 INFO L290 TraceCheckUtils]: 34: Hoare triple {138399#(<= ~counter~0 3)} assume !!(#t~post8 < 20);havoc #t~post8; {138399#(<= ~counter~0 3)} is VALID [2022-04-28 06:06:16,147 INFO L272 TraceCheckUtils]: 35: Hoare triple {138399#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {138399#(<= ~counter~0 3)} is VALID [2022-04-28 06:06:16,147 INFO L290 TraceCheckUtils]: 36: Hoare triple {138399#(<= ~counter~0 3)} ~cond := #in~cond; {138399#(<= ~counter~0 3)} is VALID [2022-04-28 06:06:16,147 INFO L290 TraceCheckUtils]: 37: Hoare triple {138399#(<= ~counter~0 3)} assume !(0 == ~cond); {138399#(<= ~counter~0 3)} is VALID [2022-04-28 06:06:16,148 INFO L290 TraceCheckUtils]: 38: Hoare triple {138399#(<= ~counter~0 3)} assume true; {138399#(<= ~counter~0 3)} is VALID [2022-04-28 06:06:16,148 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {138399#(<= ~counter~0 3)} {138399#(<= ~counter~0 3)} #98#return; {138399#(<= ~counter~0 3)} is VALID [2022-04-28 06:06:16,148 INFO L290 TraceCheckUtils]: 40: Hoare triple {138399#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {138399#(<= ~counter~0 3)} is VALID [2022-04-28 06:06:16,151 INFO L290 TraceCheckUtils]: 41: Hoare triple {138399#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {138424#(<= ~counter~0 4)} is VALID [2022-04-28 06:06:16,152 INFO L290 TraceCheckUtils]: 42: Hoare triple {138424#(<= ~counter~0 4)} assume !!(#t~post8 < 20);havoc #t~post8; {138424#(<= ~counter~0 4)} is VALID [2022-04-28 06:06:16,152 INFO L272 TraceCheckUtils]: 43: Hoare triple {138424#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {138424#(<= ~counter~0 4)} is VALID [2022-04-28 06:06:16,153 INFO L290 TraceCheckUtils]: 44: Hoare triple {138424#(<= ~counter~0 4)} ~cond := #in~cond; {138424#(<= ~counter~0 4)} is VALID [2022-04-28 06:06:16,153 INFO L290 TraceCheckUtils]: 45: Hoare triple {138424#(<= ~counter~0 4)} assume !(0 == ~cond); {138424#(<= ~counter~0 4)} is VALID [2022-04-28 06:06:16,153 INFO L290 TraceCheckUtils]: 46: Hoare triple {138424#(<= ~counter~0 4)} assume true; {138424#(<= ~counter~0 4)} is VALID [2022-04-28 06:06:16,154 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {138424#(<= ~counter~0 4)} {138424#(<= ~counter~0 4)} #98#return; {138424#(<= ~counter~0 4)} is VALID [2022-04-28 06:06:16,154 INFO L290 TraceCheckUtils]: 48: Hoare triple {138424#(<= ~counter~0 4)} assume !(~r~0 < 0); {138424#(<= ~counter~0 4)} is VALID [2022-04-28 06:06:16,157 INFO L290 TraceCheckUtils]: 49: Hoare triple {138424#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {138449#(<= ~counter~0 5)} is VALID [2022-04-28 06:06:16,159 INFO L290 TraceCheckUtils]: 50: Hoare triple {138449#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {138449#(<= ~counter~0 5)} is VALID [2022-04-28 06:06:16,160 INFO L272 TraceCheckUtils]: 51: Hoare triple {138449#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {138449#(<= ~counter~0 5)} is VALID [2022-04-28 06:06:16,161 INFO L290 TraceCheckUtils]: 52: Hoare triple {138449#(<= ~counter~0 5)} ~cond := #in~cond; {138449#(<= ~counter~0 5)} is VALID [2022-04-28 06:06:16,161 INFO L290 TraceCheckUtils]: 53: Hoare triple {138449#(<= ~counter~0 5)} assume !(0 == ~cond); {138449#(<= ~counter~0 5)} is VALID [2022-04-28 06:06:16,161 INFO L290 TraceCheckUtils]: 54: Hoare triple {138449#(<= ~counter~0 5)} assume true; {138449#(<= ~counter~0 5)} is VALID [2022-04-28 06:06:16,162 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {138449#(<= ~counter~0 5)} {138449#(<= ~counter~0 5)} #94#return; {138449#(<= ~counter~0 5)} is VALID [2022-04-28 06:06:16,163 INFO L290 TraceCheckUtils]: 56: Hoare triple {138449#(<= ~counter~0 5)} assume !!(0 != ~r~0); {138449#(<= ~counter~0 5)} is VALID [2022-04-28 06:06:16,168 INFO L290 TraceCheckUtils]: 57: Hoare triple {138449#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {138474#(<= ~counter~0 6)} is VALID [2022-04-28 06:06:16,168 INFO L290 TraceCheckUtils]: 58: Hoare triple {138474#(<= ~counter~0 6)} assume !!(#t~post7 < 20);havoc #t~post7; {138474#(<= ~counter~0 6)} is VALID [2022-04-28 06:06:16,169 INFO L272 TraceCheckUtils]: 59: Hoare triple {138474#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {138474#(<= ~counter~0 6)} is VALID [2022-04-28 06:06:16,169 INFO L290 TraceCheckUtils]: 60: Hoare triple {138474#(<= ~counter~0 6)} ~cond := #in~cond; {138474#(<= ~counter~0 6)} is VALID [2022-04-28 06:06:16,170 INFO L290 TraceCheckUtils]: 61: Hoare triple {138474#(<= ~counter~0 6)} assume !(0 == ~cond); {138474#(<= ~counter~0 6)} is VALID [2022-04-28 06:06:16,170 INFO L290 TraceCheckUtils]: 62: Hoare triple {138474#(<= ~counter~0 6)} assume true; {138474#(<= ~counter~0 6)} is VALID [2022-04-28 06:06:16,171 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {138474#(<= ~counter~0 6)} {138474#(<= ~counter~0 6)} #96#return; {138474#(<= ~counter~0 6)} is VALID [2022-04-28 06:06:16,171 INFO L290 TraceCheckUtils]: 64: Hoare triple {138474#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {138474#(<= ~counter~0 6)} is VALID [2022-04-28 06:06:16,176 INFO L290 TraceCheckUtils]: 65: Hoare triple {138474#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {138499#(<= ~counter~0 7)} is VALID [2022-04-28 06:06:16,177 INFO L290 TraceCheckUtils]: 66: Hoare triple {138499#(<= ~counter~0 7)} assume !!(#t~post7 < 20);havoc #t~post7; {138499#(<= ~counter~0 7)} is VALID [2022-04-28 06:06:16,178 INFO L272 TraceCheckUtils]: 67: Hoare triple {138499#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {138499#(<= ~counter~0 7)} is VALID [2022-04-28 06:06:16,178 INFO L290 TraceCheckUtils]: 68: Hoare triple {138499#(<= ~counter~0 7)} ~cond := #in~cond; {138499#(<= ~counter~0 7)} is VALID [2022-04-28 06:06:16,178 INFO L290 TraceCheckUtils]: 69: Hoare triple {138499#(<= ~counter~0 7)} assume !(0 == ~cond); {138499#(<= ~counter~0 7)} is VALID [2022-04-28 06:06:16,179 INFO L290 TraceCheckUtils]: 70: Hoare triple {138499#(<= ~counter~0 7)} assume true; {138499#(<= ~counter~0 7)} is VALID [2022-04-28 06:06:16,179 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {138499#(<= ~counter~0 7)} {138499#(<= ~counter~0 7)} #96#return; {138499#(<= ~counter~0 7)} is VALID [2022-04-28 06:06:16,180 INFO L290 TraceCheckUtils]: 72: Hoare triple {138499#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {138499#(<= ~counter~0 7)} is VALID [2022-04-28 06:06:16,185 INFO L290 TraceCheckUtils]: 73: Hoare triple {138499#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {138524#(<= ~counter~0 8)} is VALID [2022-04-28 06:06:16,186 INFO L290 TraceCheckUtils]: 74: Hoare triple {138524#(<= ~counter~0 8)} assume !!(#t~post7 < 20);havoc #t~post7; {138524#(<= ~counter~0 8)} is VALID [2022-04-28 06:06:16,187 INFO L272 TraceCheckUtils]: 75: Hoare triple {138524#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {138524#(<= ~counter~0 8)} is VALID [2022-04-28 06:06:16,187 INFO L290 TraceCheckUtils]: 76: Hoare triple {138524#(<= ~counter~0 8)} ~cond := #in~cond; {138524#(<= ~counter~0 8)} is VALID [2022-04-28 06:06:16,187 INFO L290 TraceCheckUtils]: 77: Hoare triple {138524#(<= ~counter~0 8)} assume !(0 == ~cond); {138524#(<= ~counter~0 8)} is VALID [2022-04-28 06:06:16,188 INFO L290 TraceCheckUtils]: 78: Hoare triple {138524#(<= ~counter~0 8)} assume true; {138524#(<= ~counter~0 8)} is VALID [2022-04-28 06:06:16,188 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {138524#(<= ~counter~0 8)} {138524#(<= ~counter~0 8)} #96#return; {138524#(<= ~counter~0 8)} is VALID [2022-04-28 06:06:16,189 INFO L290 TraceCheckUtils]: 80: Hoare triple {138524#(<= ~counter~0 8)} assume !(~r~0 > 0); {138524#(<= ~counter~0 8)} is VALID [2022-04-28 06:06:16,194 INFO L290 TraceCheckUtils]: 81: Hoare triple {138524#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {138549#(<= ~counter~0 9)} is VALID [2022-04-28 06:06:16,195 INFO L290 TraceCheckUtils]: 82: Hoare triple {138549#(<= ~counter~0 9)} assume !!(#t~post8 < 20);havoc #t~post8; {138549#(<= ~counter~0 9)} is VALID [2022-04-28 06:06:16,196 INFO L272 TraceCheckUtils]: 83: Hoare triple {138549#(<= ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {138549#(<= ~counter~0 9)} is VALID [2022-04-28 06:06:16,196 INFO L290 TraceCheckUtils]: 84: Hoare triple {138549#(<= ~counter~0 9)} ~cond := #in~cond; {138549#(<= ~counter~0 9)} is VALID [2022-04-28 06:06:16,196 INFO L290 TraceCheckUtils]: 85: Hoare triple {138549#(<= ~counter~0 9)} assume !(0 == ~cond); {138549#(<= ~counter~0 9)} is VALID [2022-04-28 06:06:16,197 INFO L290 TraceCheckUtils]: 86: Hoare triple {138549#(<= ~counter~0 9)} assume true; {138549#(<= ~counter~0 9)} is VALID [2022-04-28 06:06:16,197 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {138549#(<= ~counter~0 9)} {138549#(<= ~counter~0 9)} #98#return; {138549#(<= ~counter~0 9)} is VALID [2022-04-28 06:06:16,198 INFO L290 TraceCheckUtils]: 88: Hoare triple {138549#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {138549#(<= ~counter~0 9)} is VALID [2022-04-28 06:06:16,203 INFO L290 TraceCheckUtils]: 89: Hoare triple {138549#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {138574#(<= ~counter~0 10)} is VALID [2022-04-28 06:06:16,204 INFO L290 TraceCheckUtils]: 90: Hoare triple {138574#(<= ~counter~0 10)} assume !!(#t~post8 < 20);havoc #t~post8; {138574#(<= ~counter~0 10)} is VALID [2022-04-28 06:06:16,204 INFO L272 TraceCheckUtils]: 91: Hoare triple {138574#(<= ~counter~0 10)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {138574#(<= ~counter~0 10)} is VALID [2022-04-28 06:06:16,205 INFO L290 TraceCheckUtils]: 92: Hoare triple {138574#(<= ~counter~0 10)} ~cond := #in~cond; {138574#(<= ~counter~0 10)} is VALID [2022-04-28 06:06:16,205 INFO L290 TraceCheckUtils]: 93: Hoare triple {138574#(<= ~counter~0 10)} assume !(0 == ~cond); {138574#(<= ~counter~0 10)} is VALID [2022-04-28 06:06:16,205 INFO L290 TraceCheckUtils]: 94: Hoare triple {138574#(<= ~counter~0 10)} assume true; {138574#(<= ~counter~0 10)} is VALID [2022-04-28 06:06:16,206 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {138574#(<= ~counter~0 10)} {138574#(<= ~counter~0 10)} #98#return; {138574#(<= ~counter~0 10)} is VALID [2022-04-28 06:06:16,206 INFO L290 TraceCheckUtils]: 96: Hoare triple {138574#(<= ~counter~0 10)} assume !(~r~0 < 0); {138574#(<= ~counter~0 10)} is VALID [2022-04-28 06:06:16,211 INFO L290 TraceCheckUtils]: 97: Hoare triple {138574#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {138599#(<= ~counter~0 11)} is VALID [2022-04-28 06:06:16,212 INFO L290 TraceCheckUtils]: 98: Hoare triple {138599#(<= ~counter~0 11)} assume !!(#t~post6 < 20);havoc #t~post6; {138599#(<= ~counter~0 11)} is VALID [2022-04-28 06:06:16,213 INFO L272 TraceCheckUtils]: 99: Hoare triple {138599#(<= ~counter~0 11)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {138599#(<= ~counter~0 11)} is VALID [2022-04-28 06:06:16,213 INFO L290 TraceCheckUtils]: 100: Hoare triple {138599#(<= ~counter~0 11)} ~cond := #in~cond; {138599#(<= ~counter~0 11)} is VALID [2022-04-28 06:06:16,213 INFO L290 TraceCheckUtils]: 101: Hoare triple {138599#(<= ~counter~0 11)} assume !(0 == ~cond); {138599#(<= ~counter~0 11)} is VALID [2022-04-28 06:06:16,214 INFO L290 TraceCheckUtils]: 102: Hoare triple {138599#(<= ~counter~0 11)} assume true; {138599#(<= ~counter~0 11)} is VALID [2022-04-28 06:06:16,214 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {138599#(<= ~counter~0 11)} {138599#(<= ~counter~0 11)} #94#return; {138599#(<= ~counter~0 11)} is VALID [2022-04-28 06:06:16,215 INFO L290 TraceCheckUtils]: 104: Hoare triple {138599#(<= ~counter~0 11)} assume !!(0 != ~r~0); {138599#(<= ~counter~0 11)} is VALID [2022-04-28 06:06:16,220 INFO L290 TraceCheckUtils]: 105: Hoare triple {138599#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {138624#(<= ~counter~0 12)} is VALID [2022-04-28 06:06:16,220 INFO L290 TraceCheckUtils]: 106: Hoare triple {138624#(<= ~counter~0 12)} assume !!(#t~post7 < 20);havoc #t~post7; {138624#(<= ~counter~0 12)} is VALID [2022-04-28 06:06:16,221 INFO L272 TraceCheckUtils]: 107: Hoare triple {138624#(<= ~counter~0 12)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {138624#(<= ~counter~0 12)} is VALID [2022-04-28 06:06:16,221 INFO L290 TraceCheckUtils]: 108: Hoare triple {138624#(<= ~counter~0 12)} ~cond := #in~cond; {138624#(<= ~counter~0 12)} is VALID [2022-04-28 06:06:16,222 INFO L290 TraceCheckUtils]: 109: Hoare triple {138624#(<= ~counter~0 12)} assume !(0 == ~cond); {138624#(<= ~counter~0 12)} is VALID [2022-04-28 06:06:16,222 INFO L290 TraceCheckUtils]: 110: Hoare triple {138624#(<= ~counter~0 12)} assume true; {138624#(<= ~counter~0 12)} is VALID [2022-04-28 06:06:16,223 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {138624#(<= ~counter~0 12)} {138624#(<= ~counter~0 12)} #96#return; {138624#(<= ~counter~0 12)} is VALID [2022-04-28 06:06:16,223 INFO L290 TraceCheckUtils]: 112: Hoare triple {138624#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {138624#(<= ~counter~0 12)} is VALID [2022-04-28 06:06:16,229 INFO L290 TraceCheckUtils]: 113: Hoare triple {138624#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {138649#(<= ~counter~0 13)} is VALID [2022-04-28 06:06:16,230 INFO L290 TraceCheckUtils]: 114: Hoare triple {138649#(<= ~counter~0 13)} assume !!(#t~post7 < 20);havoc #t~post7; {138649#(<= ~counter~0 13)} is VALID [2022-04-28 06:06:16,230 INFO L272 TraceCheckUtils]: 115: Hoare triple {138649#(<= ~counter~0 13)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {138649#(<= ~counter~0 13)} is VALID [2022-04-28 06:06:16,230 INFO L290 TraceCheckUtils]: 116: Hoare triple {138649#(<= ~counter~0 13)} ~cond := #in~cond; {138649#(<= ~counter~0 13)} is VALID [2022-04-28 06:06:16,231 INFO L290 TraceCheckUtils]: 117: Hoare triple {138649#(<= ~counter~0 13)} assume !(0 == ~cond); {138649#(<= ~counter~0 13)} is VALID [2022-04-28 06:06:16,231 INFO L290 TraceCheckUtils]: 118: Hoare triple {138649#(<= ~counter~0 13)} assume true; {138649#(<= ~counter~0 13)} is VALID [2022-04-28 06:06:16,231 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {138649#(<= ~counter~0 13)} {138649#(<= ~counter~0 13)} #96#return; {138649#(<= ~counter~0 13)} is VALID [2022-04-28 06:06:16,232 INFO L290 TraceCheckUtils]: 120: Hoare triple {138649#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {138649#(<= ~counter~0 13)} is VALID [2022-04-28 06:06:16,236 INFO L290 TraceCheckUtils]: 121: Hoare triple {138649#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {138674#(<= ~counter~0 14)} is VALID [2022-04-28 06:06:16,236 INFO L290 TraceCheckUtils]: 122: Hoare triple {138674#(<= ~counter~0 14)} assume !!(#t~post7 < 20);havoc #t~post7; {138674#(<= ~counter~0 14)} is VALID [2022-04-28 06:06:16,237 INFO L272 TraceCheckUtils]: 123: Hoare triple {138674#(<= ~counter~0 14)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {138674#(<= ~counter~0 14)} is VALID [2022-04-28 06:06:16,237 INFO L290 TraceCheckUtils]: 124: Hoare triple {138674#(<= ~counter~0 14)} ~cond := #in~cond; {138674#(<= ~counter~0 14)} is VALID [2022-04-28 06:06:16,237 INFO L290 TraceCheckUtils]: 125: Hoare triple {138674#(<= ~counter~0 14)} assume !(0 == ~cond); {138674#(<= ~counter~0 14)} is VALID [2022-04-28 06:06:16,238 INFO L290 TraceCheckUtils]: 126: Hoare triple {138674#(<= ~counter~0 14)} assume true; {138674#(<= ~counter~0 14)} is VALID [2022-04-28 06:06:16,238 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {138674#(<= ~counter~0 14)} {138674#(<= ~counter~0 14)} #96#return; {138674#(<= ~counter~0 14)} is VALID [2022-04-28 06:06:16,238 INFO L290 TraceCheckUtils]: 128: Hoare triple {138674#(<= ~counter~0 14)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {138674#(<= ~counter~0 14)} is VALID [2022-04-28 06:06:16,241 INFO L290 TraceCheckUtils]: 129: Hoare triple {138674#(<= ~counter~0 14)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {138699#(<= ~counter~0 15)} is VALID [2022-04-28 06:06:16,242 INFO L290 TraceCheckUtils]: 130: Hoare triple {138699#(<= ~counter~0 15)} assume !!(#t~post7 < 20);havoc #t~post7; {138699#(<= ~counter~0 15)} is VALID [2022-04-28 06:06:16,242 INFO L272 TraceCheckUtils]: 131: Hoare triple {138699#(<= ~counter~0 15)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {138699#(<= ~counter~0 15)} is VALID [2022-04-28 06:06:16,242 INFO L290 TraceCheckUtils]: 132: Hoare triple {138699#(<= ~counter~0 15)} ~cond := #in~cond; {138699#(<= ~counter~0 15)} is VALID [2022-04-28 06:06:16,243 INFO L290 TraceCheckUtils]: 133: Hoare triple {138699#(<= ~counter~0 15)} assume !(0 == ~cond); {138699#(<= ~counter~0 15)} is VALID [2022-04-28 06:06:16,243 INFO L290 TraceCheckUtils]: 134: Hoare triple {138699#(<= ~counter~0 15)} assume true; {138699#(<= ~counter~0 15)} is VALID [2022-04-28 06:06:16,243 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {138699#(<= ~counter~0 15)} {138699#(<= ~counter~0 15)} #96#return; {138699#(<= ~counter~0 15)} is VALID [2022-04-28 06:06:16,244 INFO L290 TraceCheckUtils]: 136: Hoare triple {138699#(<= ~counter~0 15)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {138699#(<= ~counter~0 15)} is VALID [2022-04-28 06:06:16,244 INFO L290 TraceCheckUtils]: 137: Hoare triple {138699#(<= ~counter~0 15)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {138724#(<= |main_#t~post7| 15)} is VALID [2022-04-28 06:06:16,244 INFO L290 TraceCheckUtils]: 138: Hoare triple {138724#(<= |main_#t~post7| 15)} assume !(#t~post7 < 20);havoc #t~post7; {138293#false} is VALID [2022-04-28 06:06:16,244 INFO L290 TraceCheckUtils]: 139: Hoare triple {138293#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {138293#false} is VALID [2022-04-28 06:06:16,245 INFO L290 TraceCheckUtils]: 140: Hoare triple {138293#false} assume !(#t~post8 < 20);havoc #t~post8; {138293#false} is VALID [2022-04-28 06:06:16,245 INFO L290 TraceCheckUtils]: 141: Hoare triple {138293#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {138293#false} is VALID [2022-04-28 06:06:16,245 INFO L290 TraceCheckUtils]: 142: Hoare triple {138293#false} assume !(#t~post6 < 20);havoc #t~post6; {138293#false} is VALID [2022-04-28 06:06:16,245 INFO L272 TraceCheckUtils]: 143: Hoare triple {138293#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {138293#false} is VALID [2022-04-28 06:06:16,245 INFO L290 TraceCheckUtils]: 144: Hoare triple {138293#false} ~cond := #in~cond; {138293#false} is VALID [2022-04-28 06:06:16,245 INFO L290 TraceCheckUtils]: 145: Hoare triple {138293#false} assume 0 == ~cond; {138293#false} is VALID [2022-04-28 06:06:16,245 INFO L290 TraceCheckUtils]: 146: Hoare triple {138293#false} assume !false; {138293#false} is VALID [2022-04-28 06:06:16,245 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 44 proven. 584 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 06:06:16,245 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 06:06:17,019 INFO L290 TraceCheckUtils]: 146: Hoare triple {138293#false} assume !false; {138293#false} is VALID [2022-04-28 06:06:17,019 INFO L290 TraceCheckUtils]: 145: Hoare triple {138293#false} assume 0 == ~cond; {138293#false} is VALID [2022-04-28 06:06:17,019 INFO L290 TraceCheckUtils]: 144: Hoare triple {138293#false} ~cond := #in~cond; {138293#false} is VALID [2022-04-28 06:06:17,019 INFO L272 TraceCheckUtils]: 143: Hoare triple {138293#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {138293#false} is VALID [2022-04-28 06:06:17,019 INFO L290 TraceCheckUtils]: 142: Hoare triple {138293#false} assume !(#t~post6 < 20);havoc #t~post6; {138293#false} is VALID [2022-04-28 06:06:17,019 INFO L290 TraceCheckUtils]: 141: Hoare triple {138293#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {138293#false} is VALID [2022-04-28 06:06:17,019 INFO L290 TraceCheckUtils]: 140: Hoare triple {138293#false} assume !(#t~post8 < 20);havoc #t~post8; {138293#false} is VALID [2022-04-28 06:06:17,019 INFO L290 TraceCheckUtils]: 139: Hoare triple {138293#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {138293#false} is VALID [2022-04-28 06:06:17,020 INFO L290 TraceCheckUtils]: 138: Hoare triple {138776#(< |main_#t~post7| 20)} assume !(#t~post7 < 20);havoc #t~post7; {138293#false} is VALID [2022-04-28 06:06:17,020 INFO L290 TraceCheckUtils]: 137: Hoare triple {138780#(< ~counter~0 20)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {138776#(< |main_#t~post7| 20)} is VALID [2022-04-28 06:06:17,020 INFO L290 TraceCheckUtils]: 136: Hoare triple {138780#(< ~counter~0 20)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {138780#(< ~counter~0 20)} is VALID [2022-04-28 06:06:17,021 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {138292#true} {138780#(< ~counter~0 20)} #96#return; {138780#(< ~counter~0 20)} is VALID [2022-04-28 06:06:17,021 INFO L290 TraceCheckUtils]: 134: Hoare triple {138292#true} assume true; {138292#true} is VALID [2022-04-28 06:06:17,021 INFO L290 TraceCheckUtils]: 133: Hoare triple {138292#true} assume !(0 == ~cond); {138292#true} is VALID [2022-04-28 06:06:17,021 INFO L290 TraceCheckUtils]: 132: Hoare triple {138292#true} ~cond := #in~cond; {138292#true} is VALID [2022-04-28 06:06:17,021 INFO L272 TraceCheckUtils]: 131: Hoare triple {138780#(< ~counter~0 20)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {138292#true} is VALID [2022-04-28 06:06:17,021 INFO L290 TraceCheckUtils]: 130: Hoare triple {138780#(< ~counter~0 20)} assume !!(#t~post7 < 20);havoc #t~post7; {138780#(< ~counter~0 20)} is VALID [2022-04-28 06:06:17,026 INFO L290 TraceCheckUtils]: 129: Hoare triple {138805#(< ~counter~0 19)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {138780#(< ~counter~0 20)} is VALID [2022-04-28 06:06:17,026 INFO L290 TraceCheckUtils]: 128: Hoare triple {138805#(< ~counter~0 19)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {138805#(< ~counter~0 19)} is VALID [2022-04-28 06:06:17,027 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {138292#true} {138805#(< ~counter~0 19)} #96#return; {138805#(< ~counter~0 19)} is VALID [2022-04-28 06:06:17,027 INFO L290 TraceCheckUtils]: 126: Hoare triple {138292#true} assume true; {138292#true} is VALID [2022-04-28 06:06:17,027 INFO L290 TraceCheckUtils]: 125: Hoare triple {138292#true} assume !(0 == ~cond); {138292#true} is VALID [2022-04-28 06:06:17,027 INFO L290 TraceCheckUtils]: 124: Hoare triple {138292#true} ~cond := #in~cond; {138292#true} is VALID [2022-04-28 06:06:17,027 INFO L272 TraceCheckUtils]: 123: Hoare triple {138805#(< ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {138292#true} is VALID [2022-04-28 06:06:17,027 INFO L290 TraceCheckUtils]: 122: Hoare triple {138805#(< ~counter~0 19)} assume !!(#t~post7 < 20);havoc #t~post7; {138805#(< ~counter~0 19)} is VALID [2022-04-28 06:06:17,031 INFO L290 TraceCheckUtils]: 121: Hoare triple {138830#(< ~counter~0 18)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {138805#(< ~counter~0 19)} is VALID [2022-04-28 06:06:17,031 INFO L290 TraceCheckUtils]: 120: Hoare triple {138830#(< ~counter~0 18)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {138830#(< ~counter~0 18)} is VALID [2022-04-28 06:06:17,032 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {138292#true} {138830#(< ~counter~0 18)} #96#return; {138830#(< ~counter~0 18)} is VALID [2022-04-28 06:06:17,032 INFO L290 TraceCheckUtils]: 118: Hoare triple {138292#true} assume true; {138292#true} is VALID [2022-04-28 06:06:17,032 INFO L290 TraceCheckUtils]: 117: Hoare triple {138292#true} assume !(0 == ~cond); {138292#true} is VALID [2022-04-28 06:06:17,032 INFO L290 TraceCheckUtils]: 116: Hoare triple {138292#true} ~cond := #in~cond; {138292#true} is VALID [2022-04-28 06:06:17,032 INFO L272 TraceCheckUtils]: 115: Hoare triple {138830#(< ~counter~0 18)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {138292#true} is VALID [2022-04-28 06:06:17,032 INFO L290 TraceCheckUtils]: 114: Hoare triple {138830#(< ~counter~0 18)} assume !!(#t~post7 < 20);havoc #t~post7; {138830#(< ~counter~0 18)} is VALID [2022-04-28 06:06:17,036 INFO L290 TraceCheckUtils]: 113: Hoare triple {138855#(< ~counter~0 17)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {138830#(< ~counter~0 18)} is VALID [2022-04-28 06:06:17,036 INFO L290 TraceCheckUtils]: 112: Hoare triple {138855#(< ~counter~0 17)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {138855#(< ~counter~0 17)} is VALID [2022-04-28 06:06:17,037 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {138292#true} {138855#(< ~counter~0 17)} #96#return; {138855#(< ~counter~0 17)} is VALID [2022-04-28 06:06:17,037 INFO L290 TraceCheckUtils]: 110: Hoare triple {138292#true} assume true; {138292#true} is VALID [2022-04-28 06:06:17,037 INFO L290 TraceCheckUtils]: 109: Hoare triple {138292#true} assume !(0 == ~cond); {138292#true} is VALID [2022-04-28 06:06:17,037 INFO L290 TraceCheckUtils]: 108: Hoare triple {138292#true} ~cond := #in~cond; {138292#true} is VALID [2022-04-28 06:06:17,037 INFO L272 TraceCheckUtils]: 107: Hoare triple {138855#(< ~counter~0 17)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {138292#true} is VALID [2022-04-28 06:06:17,037 INFO L290 TraceCheckUtils]: 106: Hoare triple {138855#(< ~counter~0 17)} assume !!(#t~post7 < 20);havoc #t~post7; {138855#(< ~counter~0 17)} is VALID [2022-04-28 06:06:17,040 INFO L290 TraceCheckUtils]: 105: Hoare triple {138699#(<= ~counter~0 15)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {138855#(< ~counter~0 17)} is VALID [2022-04-28 06:06:17,041 INFO L290 TraceCheckUtils]: 104: Hoare triple {138699#(<= ~counter~0 15)} assume !!(0 != ~r~0); {138699#(<= ~counter~0 15)} is VALID [2022-04-28 06:06:17,041 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {138292#true} {138699#(<= ~counter~0 15)} #94#return; {138699#(<= ~counter~0 15)} is VALID [2022-04-28 06:06:17,042 INFO L290 TraceCheckUtils]: 102: Hoare triple {138292#true} assume true; {138292#true} is VALID [2022-04-28 06:06:17,042 INFO L290 TraceCheckUtils]: 101: Hoare triple {138292#true} assume !(0 == ~cond); {138292#true} is VALID [2022-04-28 06:06:17,042 INFO L290 TraceCheckUtils]: 100: Hoare triple {138292#true} ~cond := #in~cond; {138292#true} is VALID [2022-04-28 06:06:17,042 INFO L272 TraceCheckUtils]: 99: Hoare triple {138699#(<= ~counter~0 15)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {138292#true} is VALID [2022-04-28 06:06:17,042 INFO L290 TraceCheckUtils]: 98: Hoare triple {138699#(<= ~counter~0 15)} assume !!(#t~post6 < 20);havoc #t~post6; {138699#(<= ~counter~0 15)} is VALID [2022-04-28 06:06:17,045 INFO L290 TraceCheckUtils]: 97: Hoare triple {138674#(<= ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {138699#(<= ~counter~0 15)} is VALID [2022-04-28 06:06:17,046 INFO L290 TraceCheckUtils]: 96: Hoare triple {138674#(<= ~counter~0 14)} assume !(~r~0 < 0); {138674#(<= ~counter~0 14)} is VALID [2022-04-28 06:06:17,046 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {138292#true} {138674#(<= ~counter~0 14)} #98#return; {138674#(<= ~counter~0 14)} is VALID [2022-04-28 06:06:17,047 INFO L290 TraceCheckUtils]: 94: Hoare triple {138292#true} assume true; {138292#true} is VALID [2022-04-28 06:06:17,047 INFO L290 TraceCheckUtils]: 93: Hoare triple {138292#true} assume !(0 == ~cond); {138292#true} is VALID [2022-04-28 06:06:17,047 INFO L290 TraceCheckUtils]: 92: Hoare triple {138292#true} ~cond := #in~cond; {138292#true} is VALID [2022-04-28 06:06:17,047 INFO L272 TraceCheckUtils]: 91: Hoare triple {138674#(<= ~counter~0 14)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {138292#true} is VALID [2022-04-28 06:06:17,047 INFO L290 TraceCheckUtils]: 90: Hoare triple {138674#(<= ~counter~0 14)} assume !!(#t~post8 < 20);havoc #t~post8; {138674#(<= ~counter~0 14)} is VALID [2022-04-28 06:06:17,050 INFO L290 TraceCheckUtils]: 89: Hoare triple {138649#(<= ~counter~0 13)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {138674#(<= ~counter~0 14)} is VALID [2022-04-28 06:06:17,051 INFO L290 TraceCheckUtils]: 88: Hoare triple {138649#(<= ~counter~0 13)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {138649#(<= ~counter~0 13)} is VALID [2022-04-28 06:06:17,051 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {138292#true} {138649#(<= ~counter~0 13)} #98#return; {138649#(<= ~counter~0 13)} is VALID [2022-04-28 06:06:17,051 INFO L290 TraceCheckUtils]: 86: Hoare triple {138292#true} assume true; {138292#true} is VALID [2022-04-28 06:06:17,052 INFO L290 TraceCheckUtils]: 85: Hoare triple {138292#true} assume !(0 == ~cond); {138292#true} is VALID [2022-04-28 06:06:17,052 INFO L290 TraceCheckUtils]: 84: Hoare triple {138292#true} ~cond := #in~cond; {138292#true} is VALID [2022-04-28 06:06:17,052 INFO L272 TraceCheckUtils]: 83: Hoare triple {138649#(<= ~counter~0 13)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {138292#true} is VALID [2022-04-28 06:06:17,052 INFO L290 TraceCheckUtils]: 82: Hoare triple {138649#(<= ~counter~0 13)} assume !!(#t~post8 < 20);havoc #t~post8; {138649#(<= ~counter~0 13)} is VALID [2022-04-28 06:06:17,056 INFO L290 TraceCheckUtils]: 81: Hoare triple {138624#(<= ~counter~0 12)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {138649#(<= ~counter~0 13)} is VALID [2022-04-28 06:06:17,056 INFO L290 TraceCheckUtils]: 80: Hoare triple {138624#(<= ~counter~0 12)} assume !(~r~0 > 0); {138624#(<= ~counter~0 12)} is VALID [2022-04-28 06:06:17,057 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {138292#true} {138624#(<= ~counter~0 12)} #96#return; {138624#(<= ~counter~0 12)} is VALID [2022-04-28 06:06:17,057 INFO L290 TraceCheckUtils]: 78: Hoare triple {138292#true} assume true; {138292#true} is VALID [2022-04-28 06:06:17,057 INFO L290 TraceCheckUtils]: 77: Hoare triple {138292#true} assume !(0 == ~cond); {138292#true} is VALID [2022-04-28 06:06:17,057 INFO L290 TraceCheckUtils]: 76: Hoare triple {138292#true} ~cond := #in~cond; {138292#true} is VALID [2022-04-28 06:06:17,057 INFO L272 TraceCheckUtils]: 75: Hoare triple {138624#(<= ~counter~0 12)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {138292#true} is VALID [2022-04-28 06:06:17,057 INFO L290 TraceCheckUtils]: 74: Hoare triple {138624#(<= ~counter~0 12)} assume !!(#t~post7 < 20);havoc #t~post7; {138624#(<= ~counter~0 12)} is VALID [2022-04-28 06:06:17,061 INFO L290 TraceCheckUtils]: 73: Hoare triple {138599#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {138624#(<= ~counter~0 12)} is VALID [2022-04-28 06:06:17,062 INFO L290 TraceCheckUtils]: 72: Hoare triple {138599#(<= ~counter~0 11)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {138599#(<= ~counter~0 11)} is VALID [2022-04-28 06:06:17,062 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {138292#true} {138599#(<= ~counter~0 11)} #96#return; {138599#(<= ~counter~0 11)} is VALID [2022-04-28 06:06:17,062 INFO L290 TraceCheckUtils]: 70: Hoare triple {138292#true} assume true; {138292#true} is VALID [2022-04-28 06:06:17,062 INFO L290 TraceCheckUtils]: 69: Hoare triple {138292#true} assume !(0 == ~cond); {138292#true} is VALID [2022-04-28 06:06:17,062 INFO L290 TraceCheckUtils]: 68: Hoare triple {138292#true} ~cond := #in~cond; {138292#true} is VALID [2022-04-28 06:06:17,062 INFO L272 TraceCheckUtils]: 67: Hoare triple {138599#(<= ~counter~0 11)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {138292#true} is VALID [2022-04-28 06:06:17,063 INFO L290 TraceCheckUtils]: 66: Hoare triple {138599#(<= ~counter~0 11)} assume !!(#t~post7 < 20);havoc #t~post7; {138599#(<= ~counter~0 11)} is VALID [2022-04-28 06:06:17,066 INFO L290 TraceCheckUtils]: 65: Hoare triple {138574#(<= ~counter~0 10)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {138599#(<= ~counter~0 11)} is VALID [2022-04-28 06:06:17,066 INFO L290 TraceCheckUtils]: 64: Hoare triple {138574#(<= ~counter~0 10)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {138574#(<= ~counter~0 10)} is VALID [2022-04-28 06:06:17,067 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {138292#true} {138574#(<= ~counter~0 10)} #96#return; {138574#(<= ~counter~0 10)} is VALID [2022-04-28 06:06:17,067 INFO L290 TraceCheckUtils]: 62: Hoare triple {138292#true} assume true; {138292#true} is VALID [2022-04-28 06:06:17,067 INFO L290 TraceCheckUtils]: 61: Hoare triple {138292#true} assume !(0 == ~cond); {138292#true} is VALID [2022-04-28 06:06:17,067 INFO L290 TraceCheckUtils]: 60: Hoare triple {138292#true} ~cond := #in~cond; {138292#true} is VALID [2022-04-28 06:06:17,067 INFO L272 TraceCheckUtils]: 59: Hoare triple {138574#(<= ~counter~0 10)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {138292#true} is VALID [2022-04-28 06:06:17,067 INFO L290 TraceCheckUtils]: 58: Hoare triple {138574#(<= ~counter~0 10)} assume !!(#t~post7 < 20);havoc #t~post7; {138574#(<= ~counter~0 10)} is VALID [2022-04-28 06:06:17,071 INFO L290 TraceCheckUtils]: 57: Hoare triple {138549#(<= ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {138574#(<= ~counter~0 10)} is VALID [2022-04-28 06:06:17,072 INFO L290 TraceCheckUtils]: 56: Hoare triple {138549#(<= ~counter~0 9)} assume !!(0 != ~r~0); {138549#(<= ~counter~0 9)} is VALID [2022-04-28 06:06:17,072 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {138292#true} {138549#(<= ~counter~0 9)} #94#return; {138549#(<= ~counter~0 9)} is VALID [2022-04-28 06:06:17,072 INFO L290 TraceCheckUtils]: 54: Hoare triple {138292#true} assume true; {138292#true} is VALID [2022-04-28 06:06:17,072 INFO L290 TraceCheckUtils]: 53: Hoare triple {138292#true} assume !(0 == ~cond); {138292#true} is VALID [2022-04-28 06:06:17,072 INFO L290 TraceCheckUtils]: 52: Hoare triple {138292#true} ~cond := #in~cond; {138292#true} is VALID [2022-04-28 06:06:17,072 INFO L272 TraceCheckUtils]: 51: Hoare triple {138549#(<= ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {138292#true} is VALID [2022-04-28 06:06:17,073 INFO L290 TraceCheckUtils]: 50: Hoare triple {138549#(<= ~counter~0 9)} assume !!(#t~post6 < 20);havoc #t~post6; {138549#(<= ~counter~0 9)} is VALID [2022-04-28 06:06:17,077 INFO L290 TraceCheckUtils]: 49: Hoare triple {138524#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {138549#(<= ~counter~0 9)} is VALID [2022-04-28 06:06:17,077 INFO L290 TraceCheckUtils]: 48: Hoare triple {138524#(<= ~counter~0 8)} assume !(~r~0 < 0); {138524#(<= ~counter~0 8)} is VALID [2022-04-28 06:06:17,078 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {138292#true} {138524#(<= ~counter~0 8)} #98#return; {138524#(<= ~counter~0 8)} is VALID [2022-04-28 06:06:17,078 INFO L290 TraceCheckUtils]: 46: Hoare triple {138292#true} assume true; {138292#true} is VALID [2022-04-28 06:06:17,078 INFO L290 TraceCheckUtils]: 45: Hoare triple {138292#true} assume !(0 == ~cond); {138292#true} is VALID [2022-04-28 06:06:17,078 INFO L290 TraceCheckUtils]: 44: Hoare triple {138292#true} ~cond := #in~cond; {138292#true} is VALID [2022-04-28 06:06:17,078 INFO L272 TraceCheckUtils]: 43: Hoare triple {138524#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {138292#true} is VALID [2022-04-28 06:06:17,078 INFO L290 TraceCheckUtils]: 42: Hoare triple {138524#(<= ~counter~0 8)} assume !!(#t~post8 < 20);havoc #t~post8; {138524#(<= ~counter~0 8)} is VALID [2022-04-28 06:06:17,083 INFO L290 TraceCheckUtils]: 41: Hoare triple {138499#(<= ~counter~0 7)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {138524#(<= ~counter~0 8)} is VALID [2022-04-28 06:06:17,083 INFO L290 TraceCheckUtils]: 40: Hoare triple {138499#(<= ~counter~0 7)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {138499#(<= ~counter~0 7)} is VALID [2022-04-28 06:06:17,084 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {138292#true} {138499#(<= ~counter~0 7)} #98#return; {138499#(<= ~counter~0 7)} is VALID [2022-04-28 06:06:17,084 INFO L290 TraceCheckUtils]: 38: Hoare triple {138292#true} assume true; {138292#true} is VALID [2022-04-28 06:06:17,084 INFO L290 TraceCheckUtils]: 37: Hoare triple {138292#true} assume !(0 == ~cond); {138292#true} is VALID [2022-04-28 06:06:17,084 INFO L290 TraceCheckUtils]: 36: Hoare triple {138292#true} ~cond := #in~cond; {138292#true} is VALID [2022-04-28 06:06:17,084 INFO L272 TraceCheckUtils]: 35: Hoare triple {138499#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {138292#true} is VALID [2022-04-28 06:06:17,084 INFO L290 TraceCheckUtils]: 34: Hoare triple {138499#(<= ~counter~0 7)} assume !!(#t~post8 < 20);havoc #t~post8; {138499#(<= ~counter~0 7)} is VALID [2022-04-28 06:06:17,089 INFO L290 TraceCheckUtils]: 33: Hoare triple {138474#(<= ~counter~0 6)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {138499#(<= ~counter~0 7)} is VALID [2022-04-28 06:06:17,089 INFO L290 TraceCheckUtils]: 32: Hoare triple {138474#(<= ~counter~0 6)} assume !(~r~0 > 0); {138474#(<= ~counter~0 6)} is VALID [2022-04-28 06:06:17,090 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {138292#true} {138474#(<= ~counter~0 6)} #96#return; {138474#(<= ~counter~0 6)} is VALID [2022-04-28 06:06:17,090 INFO L290 TraceCheckUtils]: 30: Hoare triple {138292#true} assume true; {138292#true} is VALID [2022-04-28 06:06:17,090 INFO L290 TraceCheckUtils]: 29: Hoare triple {138292#true} assume !(0 == ~cond); {138292#true} is VALID [2022-04-28 06:06:17,090 INFO L290 TraceCheckUtils]: 28: Hoare triple {138292#true} ~cond := #in~cond; {138292#true} is VALID [2022-04-28 06:06:17,090 INFO L272 TraceCheckUtils]: 27: Hoare triple {138474#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {138292#true} is VALID [2022-04-28 06:06:17,090 INFO L290 TraceCheckUtils]: 26: Hoare triple {138474#(<= ~counter~0 6)} assume !!(#t~post7 < 20);havoc #t~post7; {138474#(<= ~counter~0 6)} is VALID [2022-04-28 06:06:17,095 INFO L290 TraceCheckUtils]: 25: Hoare triple {138449#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {138474#(<= ~counter~0 6)} is VALID [2022-04-28 06:06:17,095 INFO L290 TraceCheckUtils]: 24: Hoare triple {138449#(<= ~counter~0 5)} assume !!(0 != ~r~0); {138449#(<= ~counter~0 5)} is VALID [2022-04-28 06:06:17,096 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {138292#true} {138449#(<= ~counter~0 5)} #94#return; {138449#(<= ~counter~0 5)} is VALID [2022-04-28 06:06:17,096 INFO L290 TraceCheckUtils]: 22: Hoare triple {138292#true} assume true; {138292#true} is VALID [2022-04-28 06:06:17,096 INFO L290 TraceCheckUtils]: 21: Hoare triple {138292#true} assume !(0 == ~cond); {138292#true} is VALID [2022-04-28 06:06:17,096 INFO L290 TraceCheckUtils]: 20: Hoare triple {138292#true} ~cond := #in~cond; {138292#true} is VALID [2022-04-28 06:06:17,096 INFO L272 TraceCheckUtils]: 19: Hoare triple {138449#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {138292#true} is VALID [2022-04-28 06:06:17,096 INFO L290 TraceCheckUtils]: 18: Hoare triple {138449#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {138449#(<= ~counter~0 5)} is VALID [2022-04-28 06:06:17,101 INFO L290 TraceCheckUtils]: 17: Hoare triple {138424#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {138449#(<= ~counter~0 5)} is VALID [2022-04-28 06:06:17,101 INFO L290 TraceCheckUtils]: 16: Hoare triple {138424#(<= ~counter~0 4)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {138424#(<= ~counter~0 4)} is VALID [2022-04-28 06:06:17,101 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {138292#true} {138424#(<= ~counter~0 4)} #92#return; {138424#(<= ~counter~0 4)} is VALID [2022-04-28 06:06:17,102 INFO L290 TraceCheckUtils]: 14: Hoare triple {138292#true} assume true; {138292#true} is VALID [2022-04-28 06:06:17,102 INFO L290 TraceCheckUtils]: 13: Hoare triple {138292#true} assume !(0 == ~cond); {138292#true} is VALID [2022-04-28 06:06:17,102 INFO L290 TraceCheckUtils]: 12: Hoare triple {138292#true} ~cond := #in~cond; {138292#true} is VALID [2022-04-28 06:06:17,102 INFO L272 TraceCheckUtils]: 11: Hoare triple {138424#(<= ~counter~0 4)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {138292#true} is VALID [2022-04-28 06:06:17,102 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {138292#true} {138424#(<= ~counter~0 4)} #90#return; {138424#(<= ~counter~0 4)} is VALID [2022-04-28 06:06:17,102 INFO L290 TraceCheckUtils]: 9: Hoare triple {138292#true} assume true; {138292#true} is VALID [2022-04-28 06:06:17,102 INFO L290 TraceCheckUtils]: 8: Hoare triple {138292#true} assume !(0 == ~cond); {138292#true} is VALID [2022-04-28 06:06:17,102 INFO L290 TraceCheckUtils]: 7: Hoare triple {138292#true} ~cond := #in~cond; {138292#true} is VALID [2022-04-28 06:06:17,102 INFO L272 TraceCheckUtils]: 6: Hoare triple {138424#(<= ~counter~0 4)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {138292#true} is VALID [2022-04-28 06:06:17,103 INFO L290 TraceCheckUtils]: 5: Hoare triple {138424#(<= ~counter~0 4)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {138424#(<= ~counter~0 4)} is VALID [2022-04-28 06:06:17,103 INFO L272 TraceCheckUtils]: 4: Hoare triple {138424#(<= ~counter~0 4)} call #t~ret9 := main(); {138424#(<= ~counter~0 4)} is VALID [2022-04-28 06:06:17,103 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {138424#(<= ~counter~0 4)} {138292#true} #102#return; {138424#(<= ~counter~0 4)} is VALID [2022-04-28 06:06:17,103 INFO L290 TraceCheckUtils]: 2: Hoare triple {138424#(<= ~counter~0 4)} assume true; {138424#(<= ~counter~0 4)} is VALID [2022-04-28 06:06:17,104 INFO L290 TraceCheckUtils]: 1: Hoare triple {138292#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {138424#(<= ~counter~0 4)} is VALID [2022-04-28 06:06:17,104 INFO L272 TraceCheckUtils]: 0: Hoare triple {138292#true} call ULTIMATE.init(); {138292#true} is VALID [2022-04-28 06:06:17,104 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 44 proven. 164 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2022-04-28 06:06:17,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:06:17,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727861564] [2022-04-28 06:06:17,105 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:06:17,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1200132300] [2022-04-28 06:06:17,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1200132300] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 06:06:17,105 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 06:06:17,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 24 [2022-04-28 06:06:17,105 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:06:17,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [36129388] [2022-04-28 06:06:17,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [36129388] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:06:17,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:06:17,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-28 06:06:17,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284942] [2022-04-28 06:06:17,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:06:17,106 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.578947368421052) internal successors, (106), 18 states have internal predecessors, (106), 18 states have call successors, (20), 18 states have call predecessors, (20), 16 states have return successors, (18), 16 states have call predecessors, (18), 17 states have call successors, (18) Word has length 147 [2022-04-28 06:06:17,106 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:06:17,106 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 5.578947368421052) internal successors, (106), 18 states have internal predecessors, (106), 18 states have call successors, (20), 18 states have call predecessors, (20), 16 states have return successors, (18), 16 states have call predecessors, (18), 17 states have call successors, (18) [2022-04-28 06:06:17,372 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:06:17,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-28 06:06:17,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:06:17,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-28 06:06:17,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-28 06:06:17,373 INFO L87 Difference]: Start difference. First operand 778 states and 1041 transitions. Second operand has 19 states, 19 states have (on average 5.578947368421052) internal successors, (106), 18 states have internal predecessors, (106), 18 states have call successors, (20), 18 states have call predecessors, (20), 16 states have return successors, (18), 16 states have call predecessors, (18), 17 states have call successors, (18) [2022-04-28 06:06:23,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:06:23,130 INFO L93 Difference]: Finished difference Result 965 states and 1319 transitions. [2022-04-28 06:06:23,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-28 06:06:23,130 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.578947368421052) internal successors, (106), 18 states have internal predecessors, (106), 18 states have call successors, (20), 18 states have call predecessors, (20), 16 states have return successors, (18), 16 states have call predecessors, (18), 17 states have call successors, (18) Word has length 147 [2022-04-28 06:06:23,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:06:23,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 5.578947368421052) internal successors, (106), 18 states have internal predecessors, (106), 18 states have call successors, (20), 18 states have call predecessors, (20), 16 states have return successors, (18), 16 states have call predecessors, (18), 17 states have call successors, (18) [2022-04-28 06:06:23,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 336 transitions. [2022-04-28 06:06:23,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 5.578947368421052) internal successors, (106), 18 states have internal predecessors, (106), 18 states have call successors, (20), 18 states have call predecessors, (20), 16 states have return successors, (18), 16 states have call predecessors, (18), 17 states have call successors, (18) [2022-04-28 06:06:23,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 336 transitions. [2022-04-28 06:06:23,136 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 336 transitions. [2022-04-28 06:06:23,524 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 336 edges. 336 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:06:23,551 INFO L225 Difference]: With dead ends: 965 [2022-04-28 06:06:23,551 INFO L226 Difference]: Without dead ends: 795 [2022-04-28 06:06:23,552 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 270 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=544, Invalid=862, Unknown=0, NotChecked=0, Total=1406 [2022-04-28 06:06:23,552 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 265 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 220 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 220 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-28 06:06:23,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 323 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [220 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-28 06:06:23,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2022-04-28 06:06:26,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 795. [2022-04-28 06:06:26,612 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:06:26,613 INFO L82 GeneralOperation]: Start isEquivalent. First operand 795 states. Second operand has 795 states, 599 states have (on average 1.1819699499165275) internal successors, (708), 606 states have internal predecessors, (708), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 167 states have call predecessors, (174), 174 states have call successors, (174) [2022-04-28 06:06:26,614 INFO L74 IsIncluded]: Start isIncluded. First operand 795 states. Second operand has 795 states, 599 states have (on average 1.1819699499165275) internal successors, (708), 606 states have internal predecessors, (708), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 167 states have call predecessors, (174), 174 states have call successors, (174) [2022-04-28 06:06:26,614 INFO L87 Difference]: Start difference. First operand 795 states. Second operand has 795 states, 599 states have (on average 1.1819699499165275) internal successors, (708), 606 states have internal predecessors, (708), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 167 states have call predecessors, (174), 174 states have call successors, (174) [2022-04-28 06:06:26,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:06:26,634 INFO L93 Difference]: Finished difference Result 795 states and 1058 transitions. [2022-04-28 06:06:26,634 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1058 transitions. [2022-04-28 06:06:26,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:06:26,636 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:06:26,636 INFO L74 IsIncluded]: Start isIncluded. First operand has 795 states, 599 states have (on average 1.1819699499165275) internal successors, (708), 606 states have internal predecessors, (708), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 167 states have call predecessors, (174), 174 states have call successors, (174) Second operand 795 states. [2022-04-28 06:06:26,637 INFO L87 Difference]: Start difference. First operand has 795 states, 599 states have (on average 1.1819699499165275) internal successors, (708), 606 states have internal predecessors, (708), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 167 states have call predecessors, (174), 174 states have call successors, (174) Second operand 795 states. [2022-04-28 06:06:26,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:06:26,669 INFO L93 Difference]: Finished difference Result 795 states and 1058 transitions. [2022-04-28 06:06:26,669 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1058 transitions. [2022-04-28 06:06:26,670 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:06:26,670 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:06:26,670 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:06:26,670 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:06:26,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 795 states, 599 states have (on average 1.1819699499165275) internal successors, (708), 606 states have internal predecessors, (708), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 167 states have call predecessors, (174), 174 states have call successors, (174) [2022-04-28 06:06:26,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 1058 transitions. [2022-04-28 06:06:26,713 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 1058 transitions. Word has length 147 [2022-04-28 06:06:26,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:06:26,713 INFO L495 AbstractCegarLoop]: Abstraction has 795 states and 1058 transitions. [2022-04-28 06:06:26,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.578947368421052) internal successors, (106), 18 states have internal predecessors, (106), 18 states have call successors, (20), 18 states have call predecessors, (20), 16 states have return successors, (18), 16 states have call predecessors, (18), 17 states have call successors, (18) [2022-04-28 06:06:26,713 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 795 states and 1058 transitions. [2022-04-28 06:06:38,923 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1058 edges. 1056 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 06:06:38,923 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1058 transitions. [2022-04-28 06:06:38,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-04-28 06:06:38,925 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:06:38,925 INFO L195 NwaCegarLoop]: trace histogram [17, 16, 16, 7, 7, 7, 7, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:06:38,941 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Forceful destruction successful, exit code 0 [2022-04-28 06:06:39,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:06:39,125 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:06:39,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:06:39,125 INFO L85 PathProgramCache]: Analyzing trace with hash -913503479, now seen corresponding path program 15 times [2022-04-28 06:06:39,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:06:39,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [955595622] [2022-04-28 06:06:39,126 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 06:06:39,126 INFO L85 PathProgramCache]: Analyzing trace with hash -913503479, now seen corresponding path program 16 times [2022-04-28 06:06:39,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:06:39,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228602833] [2022-04-28 06:06:39,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:06:39,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:06:39,140 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:06:39,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [399439934] [2022-04-28 06:06:39,140 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 06:06:39,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:06:39,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:06:39,142 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:06:39,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2022-04-28 06:06:39,282 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 06:06:39,282 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:06:39,284 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-28 06:06:39,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:06:39,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:06:40,122 INFO L272 TraceCheckUtils]: 0: Hoare triple {144335#true} call ULTIMATE.init(); {144335#true} is VALID [2022-04-28 06:06:40,122 INFO L290 TraceCheckUtils]: 1: Hoare triple {144335#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {144343#(<= ~counter~0 0)} is VALID [2022-04-28 06:06:40,123 INFO L290 TraceCheckUtils]: 2: Hoare triple {144343#(<= ~counter~0 0)} assume true; {144343#(<= ~counter~0 0)} is VALID [2022-04-28 06:06:40,123 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {144343#(<= ~counter~0 0)} {144335#true} #102#return; {144343#(<= ~counter~0 0)} is VALID [2022-04-28 06:06:40,123 INFO L272 TraceCheckUtils]: 4: Hoare triple {144343#(<= ~counter~0 0)} call #t~ret9 := main(); {144343#(<= ~counter~0 0)} is VALID [2022-04-28 06:06:40,124 INFO L290 TraceCheckUtils]: 5: Hoare triple {144343#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {144343#(<= ~counter~0 0)} is VALID [2022-04-28 06:06:40,124 INFO L272 TraceCheckUtils]: 6: Hoare triple {144343#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {144343#(<= ~counter~0 0)} is VALID [2022-04-28 06:06:40,124 INFO L290 TraceCheckUtils]: 7: Hoare triple {144343#(<= ~counter~0 0)} ~cond := #in~cond; {144343#(<= ~counter~0 0)} is VALID [2022-04-28 06:06:40,125 INFO L290 TraceCheckUtils]: 8: Hoare triple {144343#(<= ~counter~0 0)} assume !(0 == ~cond); {144343#(<= ~counter~0 0)} is VALID [2022-04-28 06:06:40,125 INFO L290 TraceCheckUtils]: 9: Hoare triple {144343#(<= ~counter~0 0)} assume true; {144343#(<= ~counter~0 0)} is VALID [2022-04-28 06:06:40,125 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {144343#(<= ~counter~0 0)} {144343#(<= ~counter~0 0)} #90#return; {144343#(<= ~counter~0 0)} is VALID [2022-04-28 06:06:40,126 INFO L272 TraceCheckUtils]: 11: Hoare triple {144343#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {144343#(<= ~counter~0 0)} is VALID [2022-04-28 06:06:40,126 INFO L290 TraceCheckUtils]: 12: Hoare triple {144343#(<= ~counter~0 0)} ~cond := #in~cond; {144343#(<= ~counter~0 0)} is VALID [2022-04-28 06:06:40,126 INFO L290 TraceCheckUtils]: 13: Hoare triple {144343#(<= ~counter~0 0)} assume !(0 == ~cond); {144343#(<= ~counter~0 0)} is VALID [2022-04-28 06:06:40,126 INFO L290 TraceCheckUtils]: 14: Hoare triple {144343#(<= ~counter~0 0)} assume true; {144343#(<= ~counter~0 0)} is VALID [2022-04-28 06:06:40,127 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {144343#(<= ~counter~0 0)} {144343#(<= ~counter~0 0)} #92#return; {144343#(<= ~counter~0 0)} is VALID [2022-04-28 06:06:40,127 INFO L290 TraceCheckUtils]: 16: Hoare triple {144343#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {144343#(<= ~counter~0 0)} is VALID [2022-04-28 06:06:40,130 INFO L290 TraceCheckUtils]: 17: Hoare triple {144343#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {144392#(<= ~counter~0 1)} is VALID [2022-04-28 06:06:40,130 INFO L290 TraceCheckUtils]: 18: Hoare triple {144392#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {144392#(<= ~counter~0 1)} is VALID [2022-04-28 06:06:40,130 INFO L272 TraceCheckUtils]: 19: Hoare triple {144392#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {144392#(<= ~counter~0 1)} is VALID [2022-04-28 06:06:40,131 INFO L290 TraceCheckUtils]: 20: Hoare triple {144392#(<= ~counter~0 1)} ~cond := #in~cond; {144392#(<= ~counter~0 1)} is VALID [2022-04-28 06:06:40,131 INFO L290 TraceCheckUtils]: 21: Hoare triple {144392#(<= ~counter~0 1)} assume !(0 == ~cond); {144392#(<= ~counter~0 1)} is VALID [2022-04-28 06:06:40,131 INFO L290 TraceCheckUtils]: 22: Hoare triple {144392#(<= ~counter~0 1)} assume true; {144392#(<= ~counter~0 1)} is VALID [2022-04-28 06:06:40,132 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {144392#(<= ~counter~0 1)} {144392#(<= ~counter~0 1)} #94#return; {144392#(<= ~counter~0 1)} is VALID [2022-04-28 06:06:40,132 INFO L290 TraceCheckUtils]: 24: Hoare triple {144392#(<= ~counter~0 1)} assume !!(0 != ~r~0); {144392#(<= ~counter~0 1)} is VALID [2022-04-28 06:06:40,133 INFO L290 TraceCheckUtils]: 25: Hoare triple {144392#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {144417#(<= ~counter~0 2)} is VALID [2022-04-28 06:06:40,133 INFO L290 TraceCheckUtils]: 26: Hoare triple {144417#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {144417#(<= ~counter~0 2)} is VALID [2022-04-28 06:06:40,134 INFO L272 TraceCheckUtils]: 27: Hoare triple {144417#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {144417#(<= ~counter~0 2)} is VALID [2022-04-28 06:06:40,134 INFO L290 TraceCheckUtils]: 28: Hoare triple {144417#(<= ~counter~0 2)} ~cond := #in~cond; {144417#(<= ~counter~0 2)} is VALID [2022-04-28 06:06:40,134 INFO L290 TraceCheckUtils]: 29: Hoare triple {144417#(<= ~counter~0 2)} assume !(0 == ~cond); {144417#(<= ~counter~0 2)} is VALID [2022-04-28 06:06:40,135 INFO L290 TraceCheckUtils]: 30: Hoare triple {144417#(<= ~counter~0 2)} assume true; {144417#(<= ~counter~0 2)} is VALID [2022-04-28 06:06:40,135 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {144417#(<= ~counter~0 2)} {144417#(<= ~counter~0 2)} #96#return; {144417#(<= ~counter~0 2)} is VALID [2022-04-28 06:06:40,135 INFO L290 TraceCheckUtils]: 32: Hoare triple {144417#(<= ~counter~0 2)} assume !(~r~0 > 0); {144417#(<= ~counter~0 2)} is VALID [2022-04-28 06:06:40,136 INFO L290 TraceCheckUtils]: 33: Hoare triple {144417#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {144442#(<= ~counter~0 3)} is VALID [2022-04-28 06:06:40,137 INFO L290 TraceCheckUtils]: 34: Hoare triple {144442#(<= ~counter~0 3)} assume !!(#t~post8 < 20);havoc #t~post8; {144442#(<= ~counter~0 3)} is VALID [2022-04-28 06:06:40,137 INFO L272 TraceCheckUtils]: 35: Hoare triple {144442#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {144442#(<= ~counter~0 3)} is VALID [2022-04-28 06:06:40,137 INFO L290 TraceCheckUtils]: 36: Hoare triple {144442#(<= ~counter~0 3)} ~cond := #in~cond; {144442#(<= ~counter~0 3)} is VALID [2022-04-28 06:06:40,138 INFO L290 TraceCheckUtils]: 37: Hoare triple {144442#(<= ~counter~0 3)} assume !(0 == ~cond); {144442#(<= ~counter~0 3)} is VALID [2022-04-28 06:06:40,138 INFO L290 TraceCheckUtils]: 38: Hoare triple {144442#(<= ~counter~0 3)} assume true; {144442#(<= ~counter~0 3)} is VALID [2022-04-28 06:06:40,138 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {144442#(<= ~counter~0 3)} {144442#(<= ~counter~0 3)} #98#return; {144442#(<= ~counter~0 3)} is VALID [2022-04-28 06:06:40,139 INFO L290 TraceCheckUtils]: 40: Hoare triple {144442#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {144442#(<= ~counter~0 3)} is VALID [2022-04-28 06:06:40,140 INFO L290 TraceCheckUtils]: 41: Hoare triple {144442#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {144467#(<= ~counter~0 4)} is VALID [2022-04-28 06:06:40,140 INFO L290 TraceCheckUtils]: 42: Hoare triple {144467#(<= ~counter~0 4)} assume !!(#t~post8 < 20);havoc #t~post8; {144467#(<= ~counter~0 4)} is VALID [2022-04-28 06:06:40,141 INFO L272 TraceCheckUtils]: 43: Hoare triple {144467#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {144467#(<= ~counter~0 4)} is VALID [2022-04-28 06:06:40,141 INFO L290 TraceCheckUtils]: 44: Hoare triple {144467#(<= ~counter~0 4)} ~cond := #in~cond; {144467#(<= ~counter~0 4)} is VALID [2022-04-28 06:06:40,141 INFO L290 TraceCheckUtils]: 45: Hoare triple {144467#(<= ~counter~0 4)} assume !(0 == ~cond); {144467#(<= ~counter~0 4)} is VALID [2022-04-28 06:06:40,141 INFO L290 TraceCheckUtils]: 46: Hoare triple {144467#(<= ~counter~0 4)} assume true; {144467#(<= ~counter~0 4)} is VALID [2022-04-28 06:06:40,142 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {144467#(<= ~counter~0 4)} {144467#(<= ~counter~0 4)} #98#return; {144467#(<= ~counter~0 4)} is VALID [2022-04-28 06:06:40,142 INFO L290 TraceCheckUtils]: 48: Hoare triple {144467#(<= ~counter~0 4)} assume !(~r~0 < 0); {144467#(<= ~counter~0 4)} is VALID [2022-04-28 06:06:40,143 INFO L290 TraceCheckUtils]: 49: Hoare triple {144467#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {144492#(<= ~counter~0 5)} is VALID [2022-04-28 06:06:40,143 INFO L290 TraceCheckUtils]: 50: Hoare triple {144492#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {144492#(<= ~counter~0 5)} is VALID [2022-04-28 06:06:40,144 INFO L272 TraceCheckUtils]: 51: Hoare triple {144492#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {144492#(<= ~counter~0 5)} is VALID [2022-04-28 06:06:40,144 INFO L290 TraceCheckUtils]: 52: Hoare triple {144492#(<= ~counter~0 5)} ~cond := #in~cond; {144492#(<= ~counter~0 5)} is VALID [2022-04-28 06:06:40,144 INFO L290 TraceCheckUtils]: 53: Hoare triple {144492#(<= ~counter~0 5)} assume !(0 == ~cond); {144492#(<= ~counter~0 5)} is VALID [2022-04-28 06:06:40,145 INFO L290 TraceCheckUtils]: 54: Hoare triple {144492#(<= ~counter~0 5)} assume true; {144492#(<= ~counter~0 5)} is VALID [2022-04-28 06:06:40,145 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {144492#(<= ~counter~0 5)} {144492#(<= ~counter~0 5)} #94#return; {144492#(<= ~counter~0 5)} is VALID [2022-04-28 06:06:40,145 INFO L290 TraceCheckUtils]: 56: Hoare triple {144492#(<= ~counter~0 5)} assume !!(0 != ~r~0); {144492#(<= ~counter~0 5)} is VALID [2022-04-28 06:06:40,147 INFO L290 TraceCheckUtils]: 57: Hoare triple {144492#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {144517#(<= ~counter~0 6)} is VALID [2022-04-28 06:06:40,147 INFO L290 TraceCheckUtils]: 58: Hoare triple {144517#(<= ~counter~0 6)} assume !!(#t~post7 < 20);havoc #t~post7; {144517#(<= ~counter~0 6)} is VALID [2022-04-28 06:06:40,147 INFO L272 TraceCheckUtils]: 59: Hoare triple {144517#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {144517#(<= ~counter~0 6)} is VALID [2022-04-28 06:06:40,148 INFO L290 TraceCheckUtils]: 60: Hoare triple {144517#(<= ~counter~0 6)} ~cond := #in~cond; {144517#(<= ~counter~0 6)} is VALID [2022-04-28 06:06:40,148 INFO L290 TraceCheckUtils]: 61: Hoare triple {144517#(<= ~counter~0 6)} assume !(0 == ~cond); {144517#(<= ~counter~0 6)} is VALID [2022-04-28 06:06:40,148 INFO L290 TraceCheckUtils]: 62: Hoare triple {144517#(<= ~counter~0 6)} assume true; {144517#(<= ~counter~0 6)} is VALID [2022-04-28 06:06:40,149 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {144517#(<= ~counter~0 6)} {144517#(<= ~counter~0 6)} #96#return; {144517#(<= ~counter~0 6)} is VALID [2022-04-28 06:06:40,149 INFO L290 TraceCheckUtils]: 64: Hoare triple {144517#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {144517#(<= ~counter~0 6)} is VALID [2022-04-28 06:06:40,150 INFO L290 TraceCheckUtils]: 65: Hoare triple {144517#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {144542#(<= ~counter~0 7)} is VALID [2022-04-28 06:06:40,150 INFO L290 TraceCheckUtils]: 66: Hoare triple {144542#(<= ~counter~0 7)} assume !!(#t~post7 < 20);havoc #t~post7; {144542#(<= ~counter~0 7)} is VALID [2022-04-28 06:06:40,151 INFO L272 TraceCheckUtils]: 67: Hoare triple {144542#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {144542#(<= ~counter~0 7)} is VALID [2022-04-28 06:06:40,151 INFO L290 TraceCheckUtils]: 68: Hoare triple {144542#(<= ~counter~0 7)} ~cond := #in~cond; {144542#(<= ~counter~0 7)} is VALID [2022-04-28 06:06:40,151 INFO L290 TraceCheckUtils]: 69: Hoare triple {144542#(<= ~counter~0 7)} assume !(0 == ~cond); {144542#(<= ~counter~0 7)} is VALID [2022-04-28 06:06:40,152 INFO L290 TraceCheckUtils]: 70: Hoare triple {144542#(<= ~counter~0 7)} assume true; {144542#(<= ~counter~0 7)} is VALID [2022-04-28 06:06:40,152 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {144542#(<= ~counter~0 7)} {144542#(<= ~counter~0 7)} #96#return; {144542#(<= ~counter~0 7)} is VALID [2022-04-28 06:06:40,152 INFO L290 TraceCheckUtils]: 72: Hoare triple {144542#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {144542#(<= ~counter~0 7)} is VALID [2022-04-28 06:06:40,154 INFO L290 TraceCheckUtils]: 73: Hoare triple {144542#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {144567#(<= ~counter~0 8)} is VALID [2022-04-28 06:06:40,154 INFO L290 TraceCheckUtils]: 74: Hoare triple {144567#(<= ~counter~0 8)} assume !!(#t~post7 < 20);havoc #t~post7; {144567#(<= ~counter~0 8)} is VALID [2022-04-28 06:06:40,154 INFO L272 TraceCheckUtils]: 75: Hoare triple {144567#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {144567#(<= ~counter~0 8)} is VALID [2022-04-28 06:06:40,154 INFO L290 TraceCheckUtils]: 76: Hoare triple {144567#(<= ~counter~0 8)} ~cond := #in~cond; {144567#(<= ~counter~0 8)} is VALID [2022-04-28 06:06:40,155 INFO L290 TraceCheckUtils]: 77: Hoare triple {144567#(<= ~counter~0 8)} assume !(0 == ~cond); {144567#(<= ~counter~0 8)} is VALID [2022-04-28 06:06:40,155 INFO L290 TraceCheckUtils]: 78: Hoare triple {144567#(<= ~counter~0 8)} assume true; {144567#(<= ~counter~0 8)} is VALID [2022-04-28 06:06:40,155 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {144567#(<= ~counter~0 8)} {144567#(<= ~counter~0 8)} #96#return; {144567#(<= ~counter~0 8)} is VALID [2022-04-28 06:06:40,156 INFO L290 TraceCheckUtils]: 80: Hoare triple {144567#(<= ~counter~0 8)} assume !(~r~0 > 0); {144567#(<= ~counter~0 8)} is VALID [2022-04-28 06:06:40,157 INFO L290 TraceCheckUtils]: 81: Hoare triple {144567#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {144592#(<= ~counter~0 9)} is VALID [2022-04-28 06:06:40,157 INFO L290 TraceCheckUtils]: 82: Hoare triple {144592#(<= ~counter~0 9)} assume !!(#t~post8 < 20);havoc #t~post8; {144592#(<= ~counter~0 9)} is VALID [2022-04-28 06:06:40,158 INFO L272 TraceCheckUtils]: 83: Hoare triple {144592#(<= ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {144592#(<= ~counter~0 9)} is VALID [2022-04-28 06:06:40,158 INFO L290 TraceCheckUtils]: 84: Hoare triple {144592#(<= ~counter~0 9)} ~cond := #in~cond; {144592#(<= ~counter~0 9)} is VALID [2022-04-28 06:06:40,158 INFO L290 TraceCheckUtils]: 85: Hoare triple {144592#(<= ~counter~0 9)} assume !(0 == ~cond); {144592#(<= ~counter~0 9)} is VALID [2022-04-28 06:06:40,158 INFO L290 TraceCheckUtils]: 86: Hoare triple {144592#(<= ~counter~0 9)} assume true; {144592#(<= ~counter~0 9)} is VALID [2022-04-28 06:06:40,159 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {144592#(<= ~counter~0 9)} {144592#(<= ~counter~0 9)} #98#return; {144592#(<= ~counter~0 9)} is VALID [2022-04-28 06:06:40,159 INFO L290 TraceCheckUtils]: 88: Hoare triple {144592#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {144592#(<= ~counter~0 9)} is VALID [2022-04-28 06:06:40,160 INFO L290 TraceCheckUtils]: 89: Hoare triple {144592#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {144617#(<= ~counter~0 10)} is VALID [2022-04-28 06:06:40,161 INFO L290 TraceCheckUtils]: 90: Hoare triple {144617#(<= ~counter~0 10)} assume !!(#t~post8 < 20);havoc #t~post8; {144617#(<= ~counter~0 10)} is VALID [2022-04-28 06:06:40,161 INFO L272 TraceCheckUtils]: 91: Hoare triple {144617#(<= ~counter~0 10)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {144617#(<= ~counter~0 10)} is VALID [2022-04-28 06:06:40,161 INFO L290 TraceCheckUtils]: 92: Hoare triple {144617#(<= ~counter~0 10)} ~cond := #in~cond; {144617#(<= ~counter~0 10)} is VALID [2022-04-28 06:06:40,162 INFO L290 TraceCheckUtils]: 93: Hoare triple {144617#(<= ~counter~0 10)} assume !(0 == ~cond); {144617#(<= ~counter~0 10)} is VALID [2022-04-28 06:06:40,162 INFO L290 TraceCheckUtils]: 94: Hoare triple {144617#(<= ~counter~0 10)} assume true; {144617#(<= ~counter~0 10)} is VALID [2022-04-28 06:06:40,162 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {144617#(<= ~counter~0 10)} {144617#(<= ~counter~0 10)} #98#return; {144617#(<= ~counter~0 10)} is VALID [2022-04-28 06:06:40,163 INFO L290 TraceCheckUtils]: 96: Hoare triple {144617#(<= ~counter~0 10)} assume !(~r~0 < 0); {144617#(<= ~counter~0 10)} is VALID [2022-04-28 06:06:40,164 INFO L290 TraceCheckUtils]: 97: Hoare triple {144617#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {144642#(<= ~counter~0 11)} is VALID [2022-04-28 06:06:40,164 INFO L290 TraceCheckUtils]: 98: Hoare triple {144642#(<= ~counter~0 11)} assume !!(#t~post6 < 20);havoc #t~post6; {144642#(<= ~counter~0 11)} is VALID [2022-04-28 06:06:40,164 INFO L272 TraceCheckUtils]: 99: Hoare triple {144642#(<= ~counter~0 11)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {144642#(<= ~counter~0 11)} is VALID [2022-04-28 06:06:40,165 INFO L290 TraceCheckUtils]: 100: Hoare triple {144642#(<= ~counter~0 11)} ~cond := #in~cond; {144642#(<= ~counter~0 11)} is VALID [2022-04-28 06:06:40,165 INFO L290 TraceCheckUtils]: 101: Hoare triple {144642#(<= ~counter~0 11)} assume !(0 == ~cond); {144642#(<= ~counter~0 11)} is VALID [2022-04-28 06:06:40,165 INFO L290 TraceCheckUtils]: 102: Hoare triple {144642#(<= ~counter~0 11)} assume true; {144642#(<= ~counter~0 11)} is VALID [2022-04-28 06:06:40,166 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {144642#(<= ~counter~0 11)} {144642#(<= ~counter~0 11)} #94#return; {144642#(<= ~counter~0 11)} is VALID [2022-04-28 06:06:40,166 INFO L290 TraceCheckUtils]: 104: Hoare triple {144642#(<= ~counter~0 11)} assume !!(0 != ~r~0); {144642#(<= ~counter~0 11)} is VALID [2022-04-28 06:06:40,167 INFO L290 TraceCheckUtils]: 105: Hoare triple {144642#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {144667#(<= ~counter~0 12)} is VALID [2022-04-28 06:06:40,167 INFO L290 TraceCheckUtils]: 106: Hoare triple {144667#(<= ~counter~0 12)} assume !!(#t~post7 < 20);havoc #t~post7; {144667#(<= ~counter~0 12)} is VALID [2022-04-28 06:06:40,168 INFO L272 TraceCheckUtils]: 107: Hoare triple {144667#(<= ~counter~0 12)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {144667#(<= ~counter~0 12)} is VALID [2022-04-28 06:06:40,168 INFO L290 TraceCheckUtils]: 108: Hoare triple {144667#(<= ~counter~0 12)} ~cond := #in~cond; {144667#(<= ~counter~0 12)} is VALID [2022-04-28 06:06:40,168 INFO L290 TraceCheckUtils]: 109: Hoare triple {144667#(<= ~counter~0 12)} assume !(0 == ~cond); {144667#(<= ~counter~0 12)} is VALID [2022-04-28 06:06:40,169 INFO L290 TraceCheckUtils]: 110: Hoare triple {144667#(<= ~counter~0 12)} assume true; {144667#(<= ~counter~0 12)} is VALID [2022-04-28 06:06:40,169 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {144667#(<= ~counter~0 12)} {144667#(<= ~counter~0 12)} #96#return; {144667#(<= ~counter~0 12)} is VALID [2022-04-28 06:06:40,169 INFO L290 TraceCheckUtils]: 112: Hoare triple {144667#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {144667#(<= ~counter~0 12)} is VALID [2022-04-28 06:06:40,170 INFO L290 TraceCheckUtils]: 113: Hoare triple {144667#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {144692#(<= ~counter~0 13)} is VALID [2022-04-28 06:06:40,171 INFO L290 TraceCheckUtils]: 114: Hoare triple {144692#(<= ~counter~0 13)} assume !!(#t~post7 < 20);havoc #t~post7; {144692#(<= ~counter~0 13)} is VALID [2022-04-28 06:06:40,171 INFO L272 TraceCheckUtils]: 115: Hoare triple {144692#(<= ~counter~0 13)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {144692#(<= ~counter~0 13)} is VALID [2022-04-28 06:06:40,172 INFO L290 TraceCheckUtils]: 116: Hoare triple {144692#(<= ~counter~0 13)} ~cond := #in~cond; {144692#(<= ~counter~0 13)} is VALID [2022-04-28 06:06:40,172 INFO L290 TraceCheckUtils]: 117: Hoare triple {144692#(<= ~counter~0 13)} assume !(0 == ~cond); {144692#(<= ~counter~0 13)} is VALID [2022-04-28 06:06:40,172 INFO L290 TraceCheckUtils]: 118: Hoare triple {144692#(<= ~counter~0 13)} assume true; {144692#(<= ~counter~0 13)} is VALID [2022-04-28 06:06:40,172 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {144692#(<= ~counter~0 13)} {144692#(<= ~counter~0 13)} #96#return; {144692#(<= ~counter~0 13)} is VALID [2022-04-28 06:06:40,173 INFO L290 TraceCheckUtils]: 120: Hoare triple {144692#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {144692#(<= ~counter~0 13)} is VALID [2022-04-28 06:06:40,174 INFO L290 TraceCheckUtils]: 121: Hoare triple {144692#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {144717#(<= ~counter~0 14)} is VALID [2022-04-28 06:06:40,174 INFO L290 TraceCheckUtils]: 122: Hoare triple {144717#(<= ~counter~0 14)} assume !!(#t~post7 < 20);havoc #t~post7; {144717#(<= ~counter~0 14)} is VALID [2022-04-28 06:06:40,175 INFO L272 TraceCheckUtils]: 123: Hoare triple {144717#(<= ~counter~0 14)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {144717#(<= ~counter~0 14)} is VALID [2022-04-28 06:06:40,175 INFO L290 TraceCheckUtils]: 124: Hoare triple {144717#(<= ~counter~0 14)} ~cond := #in~cond; {144717#(<= ~counter~0 14)} is VALID [2022-04-28 06:06:40,175 INFO L290 TraceCheckUtils]: 125: Hoare triple {144717#(<= ~counter~0 14)} assume !(0 == ~cond); {144717#(<= ~counter~0 14)} is VALID [2022-04-28 06:06:40,175 INFO L290 TraceCheckUtils]: 126: Hoare triple {144717#(<= ~counter~0 14)} assume true; {144717#(<= ~counter~0 14)} is VALID [2022-04-28 06:06:40,176 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {144717#(<= ~counter~0 14)} {144717#(<= ~counter~0 14)} #96#return; {144717#(<= ~counter~0 14)} is VALID [2022-04-28 06:06:40,176 INFO L290 TraceCheckUtils]: 128: Hoare triple {144717#(<= ~counter~0 14)} assume !(~r~0 > 0); {144717#(<= ~counter~0 14)} is VALID [2022-04-28 06:06:40,177 INFO L290 TraceCheckUtils]: 129: Hoare triple {144717#(<= ~counter~0 14)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {144742#(<= ~counter~0 15)} is VALID [2022-04-28 06:06:40,178 INFO L290 TraceCheckUtils]: 130: Hoare triple {144742#(<= ~counter~0 15)} assume !!(#t~post8 < 20);havoc #t~post8; {144742#(<= ~counter~0 15)} is VALID [2022-04-28 06:06:40,178 INFO L272 TraceCheckUtils]: 131: Hoare triple {144742#(<= ~counter~0 15)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {144742#(<= ~counter~0 15)} is VALID [2022-04-28 06:06:40,178 INFO L290 TraceCheckUtils]: 132: Hoare triple {144742#(<= ~counter~0 15)} ~cond := #in~cond; {144742#(<= ~counter~0 15)} is VALID [2022-04-28 06:06:40,179 INFO L290 TraceCheckUtils]: 133: Hoare triple {144742#(<= ~counter~0 15)} assume !(0 == ~cond); {144742#(<= ~counter~0 15)} is VALID [2022-04-28 06:06:40,179 INFO L290 TraceCheckUtils]: 134: Hoare triple {144742#(<= ~counter~0 15)} assume true; {144742#(<= ~counter~0 15)} is VALID [2022-04-28 06:06:40,179 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {144742#(<= ~counter~0 15)} {144742#(<= ~counter~0 15)} #98#return; {144742#(<= ~counter~0 15)} is VALID [2022-04-28 06:06:40,180 INFO L290 TraceCheckUtils]: 136: Hoare triple {144742#(<= ~counter~0 15)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {144742#(<= ~counter~0 15)} is VALID [2022-04-28 06:06:40,181 INFO L290 TraceCheckUtils]: 137: Hoare triple {144742#(<= ~counter~0 15)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {144767#(<= ~counter~0 16)} is VALID [2022-04-28 06:06:40,181 INFO L290 TraceCheckUtils]: 138: Hoare triple {144767#(<= ~counter~0 16)} assume !!(#t~post8 < 20);havoc #t~post8; {144767#(<= ~counter~0 16)} is VALID [2022-04-28 06:06:40,181 INFO L272 TraceCheckUtils]: 139: Hoare triple {144767#(<= ~counter~0 16)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {144767#(<= ~counter~0 16)} is VALID [2022-04-28 06:06:40,182 INFO L290 TraceCheckUtils]: 140: Hoare triple {144767#(<= ~counter~0 16)} ~cond := #in~cond; {144767#(<= ~counter~0 16)} is VALID [2022-04-28 06:06:40,182 INFO L290 TraceCheckUtils]: 141: Hoare triple {144767#(<= ~counter~0 16)} assume !(0 == ~cond); {144767#(<= ~counter~0 16)} is VALID [2022-04-28 06:06:40,182 INFO L290 TraceCheckUtils]: 142: Hoare triple {144767#(<= ~counter~0 16)} assume true; {144767#(<= ~counter~0 16)} is VALID [2022-04-28 06:06:40,183 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {144767#(<= ~counter~0 16)} {144767#(<= ~counter~0 16)} #98#return; {144767#(<= ~counter~0 16)} is VALID [2022-04-28 06:06:40,183 INFO L290 TraceCheckUtils]: 144: Hoare triple {144767#(<= ~counter~0 16)} assume !(~r~0 < 0); {144767#(<= ~counter~0 16)} is VALID [2022-04-28 06:06:40,183 INFO L290 TraceCheckUtils]: 145: Hoare triple {144767#(<= ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {144792#(<= |main_#t~post6| 16)} is VALID [2022-04-28 06:06:40,184 INFO L290 TraceCheckUtils]: 146: Hoare triple {144792#(<= |main_#t~post6| 16)} assume !(#t~post6 < 20);havoc #t~post6; {144336#false} is VALID [2022-04-28 06:06:40,184 INFO L272 TraceCheckUtils]: 147: Hoare triple {144336#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {144336#false} is VALID [2022-04-28 06:06:40,184 INFO L290 TraceCheckUtils]: 148: Hoare triple {144336#false} ~cond := #in~cond; {144336#false} is VALID [2022-04-28 06:06:40,184 INFO L290 TraceCheckUtils]: 149: Hoare triple {144336#false} assume 0 == ~cond; {144336#false} is VALID [2022-04-28 06:06:40,184 INFO L290 TraceCheckUtils]: 150: Hoare triple {144336#false} assume !false; {144336#false} is VALID [2022-04-28 06:06:40,184 INFO L134 CoverageAnalysis]: Checked inductivity of 678 backedges. 32 proven. 642 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 06:06:40,184 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 06:06:40,917 INFO L290 TraceCheckUtils]: 150: Hoare triple {144336#false} assume !false; {144336#false} is VALID [2022-04-28 06:06:40,917 INFO L290 TraceCheckUtils]: 149: Hoare triple {144336#false} assume 0 == ~cond; {144336#false} is VALID [2022-04-28 06:06:40,917 INFO L290 TraceCheckUtils]: 148: Hoare triple {144336#false} ~cond := #in~cond; {144336#false} is VALID [2022-04-28 06:06:40,917 INFO L272 TraceCheckUtils]: 147: Hoare triple {144336#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {144336#false} is VALID [2022-04-28 06:06:40,917 INFO L290 TraceCheckUtils]: 146: Hoare triple {144820#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {144336#false} is VALID [2022-04-28 06:06:40,918 INFO L290 TraceCheckUtils]: 145: Hoare triple {144824#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {144820#(< |main_#t~post6| 20)} is VALID [2022-04-28 06:06:40,918 INFO L290 TraceCheckUtils]: 144: Hoare triple {144824#(< ~counter~0 20)} assume !(~r~0 < 0); {144824#(< ~counter~0 20)} is VALID [2022-04-28 06:06:40,918 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {144335#true} {144824#(< ~counter~0 20)} #98#return; {144824#(< ~counter~0 20)} is VALID [2022-04-28 06:06:40,918 INFO L290 TraceCheckUtils]: 142: Hoare triple {144335#true} assume true; {144335#true} is VALID [2022-04-28 06:06:40,919 INFO L290 TraceCheckUtils]: 141: Hoare triple {144335#true} assume !(0 == ~cond); {144335#true} is VALID [2022-04-28 06:06:40,919 INFO L290 TraceCheckUtils]: 140: Hoare triple {144335#true} ~cond := #in~cond; {144335#true} is VALID [2022-04-28 06:06:40,919 INFO L272 TraceCheckUtils]: 139: Hoare triple {144824#(< ~counter~0 20)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {144335#true} is VALID [2022-04-28 06:06:40,919 INFO L290 TraceCheckUtils]: 138: Hoare triple {144824#(< ~counter~0 20)} assume !!(#t~post8 < 20);havoc #t~post8; {144824#(< ~counter~0 20)} is VALID [2022-04-28 06:06:40,922 INFO L290 TraceCheckUtils]: 137: Hoare triple {144849#(< ~counter~0 19)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {144824#(< ~counter~0 20)} is VALID [2022-04-28 06:06:40,923 INFO L290 TraceCheckUtils]: 136: Hoare triple {144849#(< ~counter~0 19)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {144849#(< ~counter~0 19)} is VALID [2022-04-28 06:06:40,923 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {144335#true} {144849#(< ~counter~0 19)} #98#return; {144849#(< ~counter~0 19)} is VALID [2022-04-28 06:06:40,923 INFO L290 TraceCheckUtils]: 134: Hoare triple {144335#true} assume true; {144335#true} is VALID [2022-04-28 06:06:40,923 INFO L290 TraceCheckUtils]: 133: Hoare triple {144335#true} assume !(0 == ~cond); {144335#true} is VALID [2022-04-28 06:06:40,923 INFO L290 TraceCheckUtils]: 132: Hoare triple {144335#true} ~cond := #in~cond; {144335#true} is VALID [2022-04-28 06:06:40,923 INFO L272 TraceCheckUtils]: 131: Hoare triple {144849#(< ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {144335#true} is VALID [2022-04-28 06:06:40,924 INFO L290 TraceCheckUtils]: 130: Hoare triple {144849#(< ~counter~0 19)} assume !!(#t~post8 < 20);havoc #t~post8; {144849#(< ~counter~0 19)} is VALID [2022-04-28 06:06:40,925 INFO L290 TraceCheckUtils]: 129: Hoare triple {144874#(< ~counter~0 18)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {144849#(< ~counter~0 19)} is VALID [2022-04-28 06:06:40,926 INFO L290 TraceCheckUtils]: 128: Hoare triple {144874#(< ~counter~0 18)} assume !(~r~0 > 0); {144874#(< ~counter~0 18)} is VALID [2022-04-28 06:06:40,926 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {144335#true} {144874#(< ~counter~0 18)} #96#return; {144874#(< ~counter~0 18)} is VALID [2022-04-28 06:06:40,926 INFO L290 TraceCheckUtils]: 126: Hoare triple {144335#true} assume true; {144335#true} is VALID [2022-04-28 06:06:40,926 INFO L290 TraceCheckUtils]: 125: Hoare triple {144335#true} assume !(0 == ~cond); {144335#true} is VALID [2022-04-28 06:06:40,926 INFO L290 TraceCheckUtils]: 124: Hoare triple {144335#true} ~cond := #in~cond; {144335#true} is VALID [2022-04-28 06:06:40,927 INFO L272 TraceCheckUtils]: 123: Hoare triple {144874#(< ~counter~0 18)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {144335#true} is VALID [2022-04-28 06:06:40,927 INFO L290 TraceCheckUtils]: 122: Hoare triple {144874#(< ~counter~0 18)} assume !!(#t~post7 < 20);havoc #t~post7; {144874#(< ~counter~0 18)} is VALID [2022-04-28 06:06:40,929 INFO L290 TraceCheckUtils]: 121: Hoare triple {144767#(<= ~counter~0 16)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {144874#(< ~counter~0 18)} is VALID [2022-04-28 06:06:40,929 INFO L290 TraceCheckUtils]: 120: Hoare triple {144767#(<= ~counter~0 16)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {144767#(<= ~counter~0 16)} is VALID [2022-04-28 06:06:40,930 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {144335#true} {144767#(<= ~counter~0 16)} #96#return; {144767#(<= ~counter~0 16)} is VALID [2022-04-28 06:06:40,930 INFO L290 TraceCheckUtils]: 118: Hoare triple {144335#true} assume true; {144335#true} is VALID [2022-04-28 06:06:40,930 INFO L290 TraceCheckUtils]: 117: Hoare triple {144335#true} assume !(0 == ~cond); {144335#true} is VALID [2022-04-28 06:06:40,930 INFO L290 TraceCheckUtils]: 116: Hoare triple {144335#true} ~cond := #in~cond; {144335#true} is VALID [2022-04-28 06:06:40,931 INFO L272 TraceCheckUtils]: 115: Hoare triple {144767#(<= ~counter~0 16)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {144335#true} is VALID [2022-04-28 06:06:40,935 INFO L290 TraceCheckUtils]: 114: Hoare triple {144767#(<= ~counter~0 16)} assume !!(#t~post7 < 20);havoc #t~post7; {144767#(<= ~counter~0 16)} is VALID [2022-04-28 06:06:40,939 INFO L290 TraceCheckUtils]: 113: Hoare triple {144742#(<= ~counter~0 15)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {144767#(<= ~counter~0 16)} is VALID [2022-04-28 06:06:40,940 INFO L290 TraceCheckUtils]: 112: Hoare triple {144742#(<= ~counter~0 15)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {144742#(<= ~counter~0 15)} is VALID [2022-04-28 06:06:40,940 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {144335#true} {144742#(<= ~counter~0 15)} #96#return; {144742#(<= ~counter~0 15)} is VALID [2022-04-28 06:06:40,940 INFO L290 TraceCheckUtils]: 110: Hoare triple {144335#true} assume true; {144335#true} is VALID [2022-04-28 06:06:40,941 INFO L290 TraceCheckUtils]: 109: Hoare triple {144335#true} assume !(0 == ~cond); {144335#true} is VALID [2022-04-28 06:06:40,941 INFO L290 TraceCheckUtils]: 108: Hoare triple {144335#true} ~cond := #in~cond; {144335#true} is VALID [2022-04-28 06:06:40,941 INFO L272 TraceCheckUtils]: 107: Hoare triple {144742#(<= ~counter~0 15)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {144335#true} is VALID [2022-04-28 06:06:40,941 INFO L290 TraceCheckUtils]: 106: Hoare triple {144742#(<= ~counter~0 15)} assume !!(#t~post7 < 20);havoc #t~post7; {144742#(<= ~counter~0 15)} is VALID [2022-04-28 06:06:40,944 INFO L290 TraceCheckUtils]: 105: Hoare triple {144717#(<= ~counter~0 14)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {144742#(<= ~counter~0 15)} is VALID [2022-04-28 06:06:40,944 INFO L290 TraceCheckUtils]: 104: Hoare triple {144717#(<= ~counter~0 14)} assume !!(0 != ~r~0); {144717#(<= ~counter~0 14)} is VALID [2022-04-28 06:06:40,945 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {144335#true} {144717#(<= ~counter~0 14)} #94#return; {144717#(<= ~counter~0 14)} is VALID [2022-04-28 06:06:40,945 INFO L290 TraceCheckUtils]: 102: Hoare triple {144335#true} assume true; {144335#true} is VALID [2022-04-28 06:06:40,945 INFO L290 TraceCheckUtils]: 101: Hoare triple {144335#true} assume !(0 == ~cond); {144335#true} is VALID [2022-04-28 06:06:40,945 INFO L290 TraceCheckUtils]: 100: Hoare triple {144335#true} ~cond := #in~cond; {144335#true} is VALID [2022-04-28 06:06:40,945 INFO L272 TraceCheckUtils]: 99: Hoare triple {144717#(<= ~counter~0 14)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {144335#true} is VALID [2022-04-28 06:06:40,945 INFO L290 TraceCheckUtils]: 98: Hoare triple {144717#(<= ~counter~0 14)} assume !!(#t~post6 < 20);havoc #t~post6; {144717#(<= ~counter~0 14)} is VALID [2022-04-28 06:06:40,948 INFO L290 TraceCheckUtils]: 97: Hoare triple {144692#(<= ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {144717#(<= ~counter~0 14)} is VALID [2022-04-28 06:06:40,948 INFO L290 TraceCheckUtils]: 96: Hoare triple {144692#(<= ~counter~0 13)} assume !(~r~0 < 0); {144692#(<= ~counter~0 13)} is VALID [2022-04-28 06:06:40,949 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {144335#true} {144692#(<= ~counter~0 13)} #98#return; {144692#(<= ~counter~0 13)} is VALID [2022-04-28 06:06:40,949 INFO L290 TraceCheckUtils]: 94: Hoare triple {144335#true} assume true; {144335#true} is VALID [2022-04-28 06:06:40,949 INFO L290 TraceCheckUtils]: 93: Hoare triple {144335#true} assume !(0 == ~cond); {144335#true} is VALID [2022-04-28 06:06:40,949 INFO L290 TraceCheckUtils]: 92: Hoare triple {144335#true} ~cond := #in~cond; {144335#true} is VALID [2022-04-28 06:06:40,949 INFO L272 TraceCheckUtils]: 91: Hoare triple {144692#(<= ~counter~0 13)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {144335#true} is VALID [2022-04-28 06:06:40,949 INFO L290 TraceCheckUtils]: 90: Hoare triple {144692#(<= ~counter~0 13)} assume !!(#t~post8 < 20);havoc #t~post8; {144692#(<= ~counter~0 13)} is VALID [2022-04-28 06:06:40,952 INFO L290 TraceCheckUtils]: 89: Hoare triple {144667#(<= ~counter~0 12)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {144692#(<= ~counter~0 13)} is VALID [2022-04-28 06:06:40,952 INFO L290 TraceCheckUtils]: 88: Hoare triple {144667#(<= ~counter~0 12)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {144667#(<= ~counter~0 12)} is VALID [2022-04-28 06:06:40,953 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {144335#true} {144667#(<= ~counter~0 12)} #98#return; {144667#(<= ~counter~0 12)} is VALID [2022-04-28 06:06:40,953 INFO L290 TraceCheckUtils]: 86: Hoare triple {144335#true} assume true; {144335#true} is VALID [2022-04-28 06:06:40,953 INFO L290 TraceCheckUtils]: 85: Hoare triple {144335#true} assume !(0 == ~cond); {144335#true} is VALID [2022-04-28 06:06:40,953 INFO L290 TraceCheckUtils]: 84: Hoare triple {144335#true} ~cond := #in~cond; {144335#true} is VALID [2022-04-28 06:06:40,953 INFO L272 TraceCheckUtils]: 83: Hoare triple {144667#(<= ~counter~0 12)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {144335#true} is VALID [2022-04-28 06:06:40,953 INFO L290 TraceCheckUtils]: 82: Hoare triple {144667#(<= ~counter~0 12)} assume !!(#t~post8 < 20);havoc #t~post8; {144667#(<= ~counter~0 12)} is VALID [2022-04-28 06:06:40,956 INFO L290 TraceCheckUtils]: 81: Hoare triple {144642#(<= ~counter~0 11)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {144667#(<= ~counter~0 12)} is VALID [2022-04-28 06:06:40,956 INFO L290 TraceCheckUtils]: 80: Hoare triple {144642#(<= ~counter~0 11)} assume !(~r~0 > 0); {144642#(<= ~counter~0 11)} is VALID [2022-04-28 06:06:40,957 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {144335#true} {144642#(<= ~counter~0 11)} #96#return; {144642#(<= ~counter~0 11)} is VALID [2022-04-28 06:06:40,957 INFO L290 TraceCheckUtils]: 78: Hoare triple {144335#true} assume true; {144335#true} is VALID [2022-04-28 06:06:40,957 INFO L290 TraceCheckUtils]: 77: Hoare triple {144335#true} assume !(0 == ~cond); {144335#true} is VALID [2022-04-28 06:06:40,957 INFO L290 TraceCheckUtils]: 76: Hoare triple {144335#true} ~cond := #in~cond; {144335#true} is VALID [2022-04-28 06:06:40,957 INFO L272 TraceCheckUtils]: 75: Hoare triple {144642#(<= ~counter~0 11)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {144335#true} is VALID [2022-04-28 06:06:40,957 INFO L290 TraceCheckUtils]: 74: Hoare triple {144642#(<= ~counter~0 11)} assume !!(#t~post7 < 20);havoc #t~post7; {144642#(<= ~counter~0 11)} is VALID [2022-04-28 06:06:40,959 INFO L290 TraceCheckUtils]: 73: Hoare triple {144617#(<= ~counter~0 10)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {144642#(<= ~counter~0 11)} is VALID [2022-04-28 06:06:40,959 INFO L290 TraceCheckUtils]: 72: Hoare triple {144617#(<= ~counter~0 10)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {144617#(<= ~counter~0 10)} is VALID [2022-04-28 06:06:40,960 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {144335#true} {144617#(<= ~counter~0 10)} #96#return; {144617#(<= ~counter~0 10)} is VALID [2022-04-28 06:06:40,960 INFO L290 TraceCheckUtils]: 70: Hoare triple {144335#true} assume true; {144335#true} is VALID [2022-04-28 06:06:40,960 INFO L290 TraceCheckUtils]: 69: Hoare triple {144335#true} assume !(0 == ~cond); {144335#true} is VALID [2022-04-28 06:06:40,960 INFO L290 TraceCheckUtils]: 68: Hoare triple {144335#true} ~cond := #in~cond; {144335#true} is VALID [2022-04-28 06:06:40,960 INFO L272 TraceCheckUtils]: 67: Hoare triple {144617#(<= ~counter~0 10)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {144335#true} is VALID [2022-04-28 06:06:40,960 INFO L290 TraceCheckUtils]: 66: Hoare triple {144617#(<= ~counter~0 10)} assume !!(#t~post7 < 20);havoc #t~post7; {144617#(<= ~counter~0 10)} is VALID [2022-04-28 06:06:40,962 INFO L290 TraceCheckUtils]: 65: Hoare triple {144592#(<= ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {144617#(<= ~counter~0 10)} is VALID [2022-04-28 06:06:40,963 INFO L290 TraceCheckUtils]: 64: Hoare triple {144592#(<= ~counter~0 9)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {144592#(<= ~counter~0 9)} is VALID [2022-04-28 06:06:40,963 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {144335#true} {144592#(<= ~counter~0 9)} #96#return; {144592#(<= ~counter~0 9)} is VALID [2022-04-28 06:06:40,963 INFO L290 TraceCheckUtils]: 62: Hoare triple {144335#true} assume true; {144335#true} is VALID [2022-04-28 06:06:40,963 INFO L290 TraceCheckUtils]: 61: Hoare triple {144335#true} assume !(0 == ~cond); {144335#true} is VALID [2022-04-28 06:06:40,963 INFO L290 TraceCheckUtils]: 60: Hoare triple {144335#true} ~cond := #in~cond; {144335#true} is VALID [2022-04-28 06:06:40,963 INFO L272 TraceCheckUtils]: 59: Hoare triple {144592#(<= ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {144335#true} is VALID [2022-04-28 06:06:40,964 INFO L290 TraceCheckUtils]: 58: Hoare triple {144592#(<= ~counter~0 9)} assume !!(#t~post7 < 20);havoc #t~post7; {144592#(<= ~counter~0 9)} is VALID [2022-04-28 06:06:40,966 INFO L290 TraceCheckUtils]: 57: Hoare triple {144567#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {144592#(<= ~counter~0 9)} is VALID [2022-04-28 06:06:40,966 INFO L290 TraceCheckUtils]: 56: Hoare triple {144567#(<= ~counter~0 8)} assume !!(0 != ~r~0); {144567#(<= ~counter~0 8)} is VALID [2022-04-28 06:06:40,966 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {144335#true} {144567#(<= ~counter~0 8)} #94#return; {144567#(<= ~counter~0 8)} is VALID [2022-04-28 06:06:40,966 INFO L290 TraceCheckUtils]: 54: Hoare triple {144335#true} assume true; {144335#true} is VALID [2022-04-28 06:06:40,967 INFO L290 TraceCheckUtils]: 53: Hoare triple {144335#true} assume !(0 == ~cond); {144335#true} is VALID [2022-04-28 06:06:40,967 INFO L290 TraceCheckUtils]: 52: Hoare triple {144335#true} ~cond := #in~cond; {144335#true} is VALID [2022-04-28 06:06:40,967 INFO L272 TraceCheckUtils]: 51: Hoare triple {144567#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {144335#true} is VALID [2022-04-28 06:06:40,967 INFO L290 TraceCheckUtils]: 50: Hoare triple {144567#(<= ~counter~0 8)} assume !!(#t~post6 < 20);havoc #t~post6; {144567#(<= ~counter~0 8)} is VALID [2022-04-28 06:06:40,969 INFO L290 TraceCheckUtils]: 49: Hoare triple {144542#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {144567#(<= ~counter~0 8)} is VALID [2022-04-28 06:06:40,969 INFO L290 TraceCheckUtils]: 48: Hoare triple {144542#(<= ~counter~0 7)} assume !(~r~0 < 0); {144542#(<= ~counter~0 7)} is VALID [2022-04-28 06:06:40,970 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {144335#true} {144542#(<= ~counter~0 7)} #98#return; {144542#(<= ~counter~0 7)} is VALID [2022-04-28 06:06:40,970 INFO L290 TraceCheckUtils]: 46: Hoare triple {144335#true} assume true; {144335#true} is VALID [2022-04-28 06:06:40,970 INFO L290 TraceCheckUtils]: 45: Hoare triple {144335#true} assume !(0 == ~cond); {144335#true} is VALID [2022-04-28 06:06:40,970 INFO L290 TraceCheckUtils]: 44: Hoare triple {144335#true} ~cond := #in~cond; {144335#true} is VALID [2022-04-28 06:06:40,970 INFO L272 TraceCheckUtils]: 43: Hoare triple {144542#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {144335#true} is VALID [2022-04-28 06:06:40,970 INFO L290 TraceCheckUtils]: 42: Hoare triple {144542#(<= ~counter~0 7)} assume !!(#t~post8 < 20);havoc #t~post8; {144542#(<= ~counter~0 7)} is VALID [2022-04-28 06:06:40,973 INFO L290 TraceCheckUtils]: 41: Hoare triple {144517#(<= ~counter~0 6)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {144542#(<= ~counter~0 7)} is VALID [2022-04-28 06:06:40,973 INFO L290 TraceCheckUtils]: 40: Hoare triple {144517#(<= ~counter~0 6)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {144517#(<= ~counter~0 6)} is VALID [2022-04-28 06:06:40,974 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {144335#true} {144517#(<= ~counter~0 6)} #98#return; {144517#(<= ~counter~0 6)} is VALID [2022-04-28 06:06:40,974 INFO L290 TraceCheckUtils]: 38: Hoare triple {144335#true} assume true; {144335#true} is VALID [2022-04-28 06:06:40,974 INFO L290 TraceCheckUtils]: 37: Hoare triple {144335#true} assume !(0 == ~cond); {144335#true} is VALID [2022-04-28 06:06:40,974 INFO L290 TraceCheckUtils]: 36: Hoare triple {144335#true} ~cond := #in~cond; {144335#true} is VALID [2022-04-28 06:06:40,974 INFO L272 TraceCheckUtils]: 35: Hoare triple {144517#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {144335#true} is VALID [2022-04-28 06:06:40,974 INFO L290 TraceCheckUtils]: 34: Hoare triple {144517#(<= ~counter~0 6)} assume !!(#t~post8 < 20);havoc #t~post8; {144517#(<= ~counter~0 6)} is VALID [2022-04-28 06:06:40,975 INFO L290 TraceCheckUtils]: 33: Hoare triple {144492#(<= ~counter~0 5)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {144517#(<= ~counter~0 6)} is VALID [2022-04-28 06:06:40,976 INFO L290 TraceCheckUtils]: 32: Hoare triple {144492#(<= ~counter~0 5)} assume !(~r~0 > 0); {144492#(<= ~counter~0 5)} is VALID [2022-04-28 06:06:40,976 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {144335#true} {144492#(<= ~counter~0 5)} #96#return; {144492#(<= ~counter~0 5)} is VALID [2022-04-28 06:06:40,976 INFO L290 TraceCheckUtils]: 30: Hoare triple {144335#true} assume true; {144335#true} is VALID [2022-04-28 06:06:40,976 INFO L290 TraceCheckUtils]: 29: Hoare triple {144335#true} assume !(0 == ~cond); {144335#true} is VALID [2022-04-28 06:06:40,976 INFO L290 TraceCheckUtils]: 28: Hoare triple {144335#true} ~cond := #in~cond; {144335#true} is VALID [2022-04-28 06:06:40,976 INFO L272 TraceCheckUtils]: 27: Hoare triple {144492#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {144335#true} is VALID [2022-04-28 06:06:40,977 INFO L290 TraceCheckUtils]: 26: Hoare triple {144492#(<= ~counter~0 5)} assume !!(#t~post7 < 20);havoc #t~post7; {144492#(<= ~counter~0 5)} is VALID [2022-04-28 06:06:40,978 INFO L290 TraceCheckUtils]: 25: Hoare triple {144467#(<= ~counter~0 4)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {144492#(<= ~counter~0 5)} is VALID [2022-04-28 06:06:40,978 INFO L290 TraceCheckUtils]: 24: Hoare triple {144467#(<= ~counter~0 4)} assume !!(0 != ~r~0); {144467#(<= ~counter~0 4)} is VALID [2022-04-28 06:06:40,979 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {144335#true} {144467#(<= ~counter~0 4)} #94#return; {144467#(<= ~counter~0 4)} is VALID [2022-04-28 06:06:40,979 INFO L290 TraceCheckUtils]: 22: Hoare triple {144335#true} assume true; {144335#true} is VALID [2022-04-28 06:06:40,979 INFO L290 TraceCheckUtils]: 21: Hoare triple {144335#true} assume !(0 == ~cond); {144335#true} is VALID [2022-04-28 06:06:40,979 INFO L290 TraceCheckUtils]: 20: Hoare triple {144335#true} ~cond := #in~cond; {144335#true} is VALID [2022-04-28 06:06:40,979 INFO L272 TraceCheckUtils]: 19: Hoare triple {144467#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {144335#true} is VALID [2022-04-28 06:06:40,979 INFO L290 TraceCheckUtils]: 18: Hoare triple {144467#(<= ~counter~0 4)} assume !!(#t~post6 < 20);havoc #t~post6; {144467#(<= ~counter~0 4)} is VALID [2022-04-28 06:06:40,980 INFO L290 TraceCheckUtils]: 17: Hoare triple {144442#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {144467#(<= ~counter~0 4)} is VALID [2022-04-28 06:06:40,980 INFO L290 TraceCheckUtils]: 16: Hoare triple {144442#(<= ~counter~0 3)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {144442#(<= ~counter~0 3)} is VALID [2022-04-28 06:06:40,981 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {144335#true} {144442#(<= ~counter~0 3)} #92#return; {144442#(<= ~counter~0 3)} is VALID [2022-04-28 06:06:40,981 INFO L290 TraceCheckUtils]: 14: Hoare triple {144335#true} assume true; {144335#true} is VALID [2022-04-28 06:06:40,981 INFO L290 TraceCheckUtils]: 13: Hoare triple {144335#true} assume !(0 == ~cond); {144335#true} is VALID [2022-04-28 06:06:40,981 INFO L290 TraceCheckUtils]: 12: Hoare triple {144335#true} ~cond := #in~cond; {144335#true} is VALID [2022-04-28 06:06:40,981 INFO L272 TraceCheckUtils]: 11: Hoare triple {144442#(<= ~counter~0 3)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {144335#true} is VALID [2022-04-28 06:06:40,981 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {144335#true} {144442#(<= ~counter~0 3)} #90#return; {144442#(<= ~counter~0 3)} is VALID [2022-04-28 06:06:40,981 INFO L290 TraceCheckUtils]: 9: Hoare triple {144335#true} assume true; {144335#true} is VALID [2022-04-28 06:06:40,982 INFO L290 TraceCheckUtils]: 8: Hoare triple {144335#true} assume !(0 == ~cond); {144335#true} is VALID [2022-04-28 06:06:40,982 INFO L290 TraceCheckUtils]: 7: Hoare triple {144335#true} ~cond := #in~cond; {144335#true} is VALID [2022-04-28 06:06:40,982 INFO L272 TraceCheckUtils]: 6: Hoare triple {144442#(<= ~counter~0 3)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {144335#true} is VALID [2022-04-28 06:06:40,982 INFO L290 TraceCheckUtils]: 5: Hoare triple {144442#(<= ~counter~0 3)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {144442#(<= ~counter~0 3)} is VALID [2022-04-28 06:06:40,982 INFO L272 TraceCheckUtils]: 4: Hoare triple {144442#(<= ~counter~0 3)} call #t~ret9 := main(); {144442#(<= ~counter~0 3)} is VALID [2022-04-28 06:06:40,982 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {144442#(<= ~counter~0 3)} {144335#true} #102#return; {144442#(<= ~counter~0 3)} is VALID [2022-04-28 06:06:40,983 INFO L290 TraceCheckUtils]: 2: Hoare triple {144442#(<= ~counter~0 3)} assume true; {144442#(<= ~counter~0 3)} is VALID [2022-04-28 06:06:40,983 INFO L290 TraceCheckUtils]: 1: Hoare triple {144335#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {144442#(<= ~counter~0 3)} is VALID [2022-04-28 06:06:40,983 INFO L272 TraceCheckUtils]: 0: Hoare triple {144335#true} call ULTIMATE.init(); {144335#true} is VALID [2022-04-28 06:06:40,984 INFO L134 CoverageAnalysis]: Checked inductivity of 678 backedges. 32 proven. 162 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2022-04-28 06:06:40,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:06:40,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228602833] [2022-04-28 06:06:40,984 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:06:40,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [399439934] [2022-04-28 06:06:40,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [399439934] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 06:06:40,984 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 06:06:40,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 24 [2022-04-28 06:06:40,984 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:06:40,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [955595622] [2022-04-28 06:06:40,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [955595622] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:06:40,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:06:40,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-28 06:06:40,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709053742] [2022-04-28 06:06:40,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:06:40,985 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.4) internal successors, (108), 19 states have internal predecessors, (108), 19 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 17 states have call predecessors, (19), 18 states have call successors, (19) Word has length 151 [2022-04-28 06:06:40,985 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:06:40,986 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 5.4) internal successors, (108), 19 states have internal predecessors, (108), 19 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 17 states have call predecessors, (19), 18 states have call successors, (19) [2022-04-28 06:06:41,187 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:06:41,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-28 06:06:41,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:06:41,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-28 06:06:41,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-28 06:06:41,188 INFO L87 Difference]: Start difference. First operand 795 states and 1058 transitions. Second operand has 20 states, 20 states have (on average 5.4) internal successors, (108), 19 states have internal predecessors, (108), 19 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 17 states have call predecessors, (19), 18 states have call successors, (19) [2022-04-28 06:06:47,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:06:47,938 INFO L93 Difference]: Finished difference Result 846 states and 1128 transitions. [2022-04-28 06:06:47,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-28 06:06:47,938 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.4) internal successors, (108), 19 states have internal predecessors, (108), 19 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 17 states have call predecessors, (19), 18 states have call successors, (19) Word has length 151 [2022-04-28 06:06:47,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:06:47,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 5.4) internal successors, (108), 19 states have internal predecessors, (108), 19 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 17 states have call predecessors, (19), 18 states have call successors, (19) [2022-04-28 06:06:47,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 334 transitions. [2022-04-28 06:06:47,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 5.4) internal successors, (108), 19 states have internal predecessors, (108), 19 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 17 states have call predecessors, (19), 18 states have call successors, (19) [2022-04-28 06:06:47,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 334 transitions. [2022-04-28 06:06:47,943 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 334 transitions. [2022-04-28 06:06:48,437 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 334 edges. 334 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:06:48,467 INFO L225 Difference]: With dead ends: 846 [2022-04-28 06:06:48,467 INFO L226 Difference]: Without dead ends: 841 [2022-04-28 06:06:48,467 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 278 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=499, Invalid=833, Unknown=0, NotChecked=0, Total=1332 [2022-04-28 06:06:48,468 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 290 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 275 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 275 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-28 06:06:48,468 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 361 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [275 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-28 06:06:48,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2022-04-28 06:06:51,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 819. [2022-04-28 06:06:51,527 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:06:51,528 INFO L82 GeneralOperation]: Start isEquivalent. First operand 841 states. Second operand has 819 states, 609 states have (on average 1.1822660098522169) internal successors, (720), 626 states have internal predecessors, (720), 189 states have call successors, (189), 22 states have call predecessors, (189), 20 states have return successors, (187), 170 states have call predecessors, (187), 187 states have call successors, (187) [2022-04-28 06:06:51,529 INFO L74 IsIncluded]: Start isIncluded. First operand 841 states. Second operand has 819 states, 609 states have (on average 1.1822660098522169) internal successors, (720), 626 states have internal predecessors, (720), 189 states have call successors, (189), 22 states have call predecessors, (189), 20 states have return successors, (187), 170 states have call predecessors, (187), 187 states have call successors, (187) [2022-04-28 06:06:51,529 INFO L87 Difference]: Start difference. First operand 841 states. Second operand has 819 states, 609 states have (on average 1.1822660098522169) internal successors, (720), 626 states have internal predecessors, (720), 189 states have call successors, (189), 22 states have call predecessors, (189), 20 states have return successors, (187), 170 states have call predecessors, (187), 187 states have call successors, (187) [2022-04-28 06:06:51,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:06:51,562 INFO L93 Difference]: Finished difference Result 841 states and 1122 transitions. [2022-04-28 06:06:51,562 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1122 transitions. [2022-04-28 06:06:51,563 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:06:51,563 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:06:51,564 INFO L74 IsIncluded]: Start isIncluded. First operand has 819 states, 609 states have (on average 1.1822660098522169) internal successors, (720), 626 states have internal predecessors, (720), 189 states have call successors, (189), 22 states have call predecessors, (189), 20 states have return successors, (187), 170 states have call predecessors, (187), 187 states have call successors, (187) Second operand 841 states. [2022-04-28 06:06:51,564 INFO L87 Difference]: Start difference. First operand has 819 states, 609 states have (on average 1.1822660098522169) internal successors, (720), 626 states have internal predecessors, (720), 189 states have call successors, (189), 22 states have call predecessors, (189), 20 states have return successors, (187), 170 states have call predecessors, (187), 187 states have call successors, (187) Second operand 841 states. [2022-04-28 06:06:51,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:06:51,588 INFO L93 Difference]: Finished difference Result 841 states and 1122 transitions. [2022-04-28 06:06:51,588 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1122 transitions. [2022-04-28 06:06:51,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:06:51,589 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:06:51,589 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:06:51,589 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:06:51,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 609 states have (on average 1.1822660098522169) internal successors, (720), 626 states have internal predecessors, (720), 189 states have call successors, (189), 22 states have call predecessors, (189), 20 states have return successors, (187), 170 states have call predecessors, (187), 187 states have call successors, (187) [2022-04-28 06:06:51,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1096 transitions. [2022-04-28 06:06:51,620 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1096 transitions. Word has length 151 [2022-04-28 06:06:51,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:06:51,620 INFO L495 AbstractCegarLoop]: Abstraction has 819 states and 1096 transitions. [2022-04-28 06:06:51,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.4) internal successors, (108), 19 states have internal predecessors, (108), 19 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 17 states have call predecessors, (19), 18 states have call successors, (19) [2022-04-28 06:06:51,620 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 819 states and 1096 transitions. [2022-04-28 06:07:05,744 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1096 edges. 1095 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 06:07:05,744 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1096 transitions. [2022-04-28 06:07:05,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-04-28 06:07:05,746 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:07:05,746 INFO L195 NwaCegarLoop]: trace histogram [17, 16, 16, 8, 8, 8, 8, 6, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:07:05,772 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Forceful destruction successful, exit code 0 [2022-04-28 06:07:05,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable51 [2022-04-28 06:07:05,946 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:07:05,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:07:05,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1031451968, now seen corresponding path program 27 times [2022-04-28 06:07:05,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:07:05,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1634510736] [2022-04-28 06:07:05,947 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 06:07:05,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1031451968, now seen corresponding path program 28 times [2022-04-28 06:07:05,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:07:05,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455204728] [2022-04-28 06:07:05,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:07:05,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:07:05,962 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:07:05,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1909655896] [2022-04-28 06:07:05,962 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 06:07:05,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:07:05,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:07:05,963 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:07:05,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2022-04-28 06:07:06,036 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 06:07:06,036 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:07:06,038 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-28 06:07:06,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:07:06,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:07:07,031 INFO L272 TraceCheckUtils]: 0: Hoare triple {150302#true} call ULTIMATE.init(); {150302#true} is VALID [2022-04-28 06:07:07,031 INFO L290 TraceCheckUtils]: 1: Hoare triple {150302#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {150310#(<= ~counter~0 0)} is VALID [2022-04-28 06:07:07,032 INFO L290 TraceCheckUtils]: 2: Hoare triple {150310#(<= ~counter~0 0)} assume true; {150310#(<= ~counter~0 0)} is VALID [2022-04-28 06:07:07,032 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {150310#(<= ~counter~0 0)} {150302#true} #102#return; {150310#(<= ~counter~0 0)} is VALID [2022-04-28 06:07:07,032 INFO L272 TraceCheckUtils]: 4: Hoare triple {150310#(<= ~counter~0 0)} call #t~ret9 := main(); {150310#(<= ~counter~0 0)} is VALID [2022-04-28 06:07:07,033 INFO L290 TraceCheckUtils]: 5: Hoare triple {150310#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {150310#(<= ~counter~0 0)} is VALID [2022-04-28 06:07:07,033 INFO L272 TraceCheckUtils]: 6: Hoare triple {150310#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {150310#(<= ~counter~0 0)} is VALID [2022-04-28 06:07:07,033 INFO L290 TraceCheckUtils]: 7: Hoare triple {150310#(<= ~counter~0 0)} ~cond := #in~cond; {150310#(<= ~counter~0 0)} is VALID [2022-04-28 06:07:07,042 INFO L290 TraceCheckUtils]: 8: Hoare triple {150310#(<= ~counter~0 0)} assume !(0 == ~cond); {150310#(<= ~counter~0 0)} is VALID [2022-04-28 06:07:07,043 INFO L290 TraceCheckUtils]: 9: Hoare triple {150310#(<= ~counter~0 0)} assume true; {150310#(<= ~counter~0 0)} is VALID [2022-04-28 06:07:07,043 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {150310#(<= ~counter~0 0)} {150310#(<= ~counter~0 0)} #90#return; {150310#(<= ~counter~0 0)} is VALID [2022-04-28 06:07:07,044 INFO L272 TraceCheckUtils]: 11: Hoare triple {150310#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {150310#(<= ~counter~0 0)} is VALID [2022-04-28 06:07:07,044 INFO L290 TraceCheckUtils]: 12: Hoare triple {150310#(<= ~counter~0 0)} ~cond := #in~cond; {150310#(<= ~counter~0 0)} is VALID [2022-04-28 06:07:07,044 INFO L290 TraceCheckUtils]: 13: Hoare triple {150310#(<= ~counter~0 0)} assume !(0 == ~cond); {150310#(<= ~counter~0 0)} is VALID [2022-04-28 06:07:07,045 INFO L290 TraceCheckUtils]: 14: Hoare triple {150310#(<= ~counter~0 0)} assume true; {150310#(<= ~counter~0 0)} is VALID [2022-04-28 06:07:07,045 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {150310#(<= ~counter~0 0)} {150310#(<= ~counter~0 0)} #92#return; {150310#(<= ~counter~0 0)} is VALID [2022-04-28 06:07:07,045 INFO L290 TraceCheckUtils]: 16: Hoare triple {150310#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {150310#(<= ~counter~0 0)} is VALID [2022-04-28 06:07:07,050 INFO L290 TraceCheckUtils]: 17: Hoare triple {150310#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {150359#(<= ~counter~0 1)} is VALID [2022-04-28 06:07:07,051 INFO L290 TraceCheckUtils]: 18: Hoare triple {150359#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {150359#(<= ~counter~0 1)} is VALID [2022-04-28 06:07:07,051 INFO L272 TraceCheckUtils]: 19: Hoare triple {150359#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {150359#(<= ~counter~0 1)} is VALID [2022-04-28 06:07:07,052 INFO L290 TraceCheckUtils]: 20: Hoare triple {150359#(<= ~counter~0 1)} ~cond := #in~cond; {150359#(<= ~counter~0 1)} is VALID [2022-04-28 06:07:07,052 INFO L290 TraceCheckUtils]: 21: Hoare triple {150359#(<= ~counter~0 1)} assume !(0 == ~cond); {150359#(<= ~counter~0 1)} is VALID [2022-04-28 06:07:07,052 INFO L290 TraceCheckUtils]: 22: Hoare triple {150359#(<= ~counter~0 1)} assume true; {150359#(<= ~counter~0 1)} is VALID [2022-04-28 06:07:07,053 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {150359#(<= ~counter~0 1)} {150359#(<= ~counter~0 1)} #94#return; {150359#(<= ~counter~0 1)} is VALID [2022-04-28 06:07:07,053 INFO L290 TraceCheckUtils]: 24: Hoare triple {150359#(<= ~counter~0 1)} assume !!(0 != ~r~0); {150359#(<= ~counter~0 1)} is VALID [2022-04-28 06:07:07,058 INFO L290 TraceCheckUtils]: 25: Hoare triple {150359#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {150384#(<= ~counter~0 2)} is VALID [2022-04-28 06:07:07,058 INFO L290 TraceCheckUtils]: 26: Hoare triple {150384#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {150384#(<= ~counter~0 2)} is VALID [2022-04-28 06:07:07,059 INFO L272 TraceCheckUtils]: 27: Hoare triple {150384#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {150384#(<= ~counter~0 2)} is VALID [2022-04-28 06:07:07,059 INFO L290 TraceCheckUtils]: 28: Hoare triple {150384#(<= ~counter~0 2)} ~cond := #in~cond; {150384#(<= ~counter~0 2)} is VALID [2022-04-28 06:07:07,059 INFO L290 TraceCheckUtils]: 29: Hoare triple {150384#(<= ~counter~0 2)} assume !(0 == ~cond); {150384#(<= ~counter~0 2)} is VALID [2022-04-28 06:07:07,060 INFO L290 TraceCheckUtils]: 30: Hoare triple {150384#(<= ~counter~0 2)} assume true; {150384#(<= ~counter~0 2)} is VALID [2022-04-28 06:07:07,060 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {150384#(<= ~counter~0 2)} {150384#(<= ~counter~0 2)} #96#return; {150384#(<= ~counter~0 2)} is VALID [2022-04-28 06:07:07,060 INFO L290 TraceCheckUtils]: 32: Hoare triple {150384#(<= ~counter~0 2)} assume !(~r~0 > 0); {150384#(<= ~counter~0 2)} is VALID [2022-04-28 06:07:07,066 INFO L290 TraceCheckUtils]: 33: Hoare triple {150384#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {150409#(<= ~counter~0 3)} is VALID [2022-04-28 06:07:07,066 INFO L290 TraceCheckUtils]: 34: Hoare triple {150409#(<= ~counter~0 3)} assume !!(#t~post8 < 20);havoc #t~post8; {150409#(<= ~counter~0 3)} is VALID [2022-04-28 06:07:07,067 INFO L272 TraceCheckUtils]: 35: Hoare triple {150409#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {150409#(<= ~counter~0 3)} is VALID [2022-04-28 06:07:07,067 INFO L290 TraceCheckUtils]: 36: Hoare triple {150409#(<= ~counter~0 3)} ~cond := #in~cond; {150409#(<= ~counter~0 3)} is VALID [2022-04-28 06:07:07,068 INFO L290 TraceCheckUtils]: 37: Hoare triple {150409#(<= ~counter~0 3)} assume !(0 == ~cond); {150409#(<= ~counter~0 3)} is VALID [2022-04-28 06:07:07,068 INFO L290 TraceCheckUtils]: 38: Hoare triple {150409#(<= ~counter~0 3)} assume true; {150409#(<= ~counter~0 3)} is VALID [2022-04-28 06:07:07,068 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {150409#(<= ~counter~0 3)} {150409#(<= ~counter~0 3)} #98#return; {150409#(<= ~counter~0 3)} is VALID [2022-04-28 06:07:07,069 INFO L290 TraceCheckUtils]: 40: Hoare triple {150409#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {150409#(<= ~counter~0 3)} is VALID [2022-04-28 06:07:07,072 INFO L290 TraceCheckUtils]: 41: Hoare triple {150409#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {150434#(<= ~counter~0 4)} is VALID [2022-04-28 06:07:07,072 INFO L290 TraceCheckUtils]: 42: Hoare triple {150434#(<= ~counter~0 4)} assume !!(#t~post8 < 20);havoc #t~post8; {150434#(<= ~counter~0 4)} is VALID [2022-04-28 06:07:07,073 INFO L272 TraceCheckUtils]: 43: Hoare triple {150434#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {150434#(<= ~counter~0 4)} is VALID [2022-04-28 06:07:07,073 INFO L290 TraceCheckUtils]: 44: Hoare triple {150434#(<= ~counter~0 4)} ~cond := #in~cond; {150434#(<= ~counter~0 4)} is VALID [2022-04-28 06:07:07,073 INFO L290 TraceCheckUtils]: 45: Hoare triple {150434#(<= ~counter~0 4)} assume !(0 == ~cond); {150434#(<= ~counter~0 4)} is VALID [2022-04-28 06:07:07,074 INFO L290 TraceCheckUtils]: 46: Hoare triple {150434#(<= ~counter~0 4)} assume true; {150434#(<= ~counter~0 4)} is VALID [2022-04-28 06:07:07,074 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {150434#(<= ~counter~0 4)} {150434#(<= ~counter~0 4)} #98#return; {150434#(<= ~counter~0 4)} is VALID [2022-04-28 06:07:07,074 INFO L290 TraceCheckUtils]: 48: Hoare triple {150434#(<= ~counter~0 4)} assume !(~r~0 < 0); {150434#(<= ~counter~0 4)} is VALID [2022-04-28 06:07:07,078 INFO L290 TraceCheckUtils]: 49: Hoare triple {150434#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {150459#(<= ~counter~0 5)} is VALID [2022-04-28 06:07:07,078 INFO L290 TraceCheckUtils]: 50: Hoare triple {150459#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {150459#(<= ~counter~0 5)} is VALID [2022-04-28 06:07:07,079 INFO L272 TraceCheckUtils]: 51: Hoare triple {150459#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {150459#(<= ~counter~0 5)} is VALID [2022-04-28 06:07:07,079 INFO L290 TraceCheckUtils]: 52: Hoare triple {150459#(<= ~counter~0 5)} ~cond := #in~cond; {150459#(<= ~counter~0 5)} is VALID [2022-04-28 06:07:07,079 INFO L290 TraceCheckUtils]: 53: Hoare triple {150459#(<= ~counter~0 5)} assume !(0 == ~cond); {150459#(<= ~counter~0 5)} is VALID [2022-04-28 06:07:07,079 INFO L290 TraceCheckUtils]: 54: Hoare triple {150459#(<= ~counter~0 5)} assume true; {150459#(<= ~counter~0 5)} is VALID [2022-04-28 06:07:07,080 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {150459#(<= ~counter~0 5)} {150459#(<= ~counter~0 5)} #94#return; {150459#(<= ~counter~0 5)} is VALID [2022-04-28 06:07:07,080 INFO L290 TraceCheckUtils]: 56: Hoare triple {150459#(<= ~counter~0 5)} assume !!(0 != ~r~0); {150459#(<= ~counter~0 5)} is VALID [2022-04-28 06:07:07,086 INFO L290 TraceCheckUtils]: 57: Hoare triple {150459#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {150484#(<= ~counter~0 6)} is VALID [2022-04-28 06:07:07,087 INFO L290 TraceCheckUtils]: 58: Hoare triple {150484#(<= ~counter~0 6)} assume !!(#t~post7 < 20);havoc #t~post7; {150484#(<= ~counter~0 6)} is VALID [2022-04-28 06:07:07,087 INFO L272 TraceCheckUtils]: 59: Hoare triple {150484#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {150484#(<= ~counter~0 6)} is VALID [2022-04-28 06:07:07,087 INFO L290 TraceCheckUtils]: 60: Hoare triple {150484#(<= ~counter~0 6)} ~cond := #in~cond; {150484#(<= ~counter~0 6)} is VALID [2022-04-28 06:07:07,088 INFO L290 TraceCheckUtils]: 61: Hoare triple {150484#(<= ~counter~0 6)} assume !(0 == ~cond); {150484#(<= ~counter~0 6)} is VALID [2022-04-28 06:07:07,088 INFO L290 TraceCheckUtils]: 62: Hoare triple {150484#(<= ~counter~0 6)} assume true; {150484#(<= ~counter~0 6)} is VALID [2022-04-28 06:07:07,088 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {150484#(<= ~counter~0 6)} {150484#(<= ~counter~0 6)} #96#return; {150484#(<= ~counter~0 6)} is VALID [2022-04-28 06:07:07,089 INFO L290 TraceCheckUtils]: 64: Hoare triple {150484#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {150484#(<= ~counter~0 6)} is VALID [2022-04-28 06:07:07,092 INFO L290 TraceCheckUtils]: 65: Hoare triple {150484#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {150509#(<= ~counter~0 7)} is VALID [2022-04-28 06:07:07,093 INFO L290 TraceCheckUtils]: 66: Hoare triple {150509#(<= ~counter~0 7)} assume !!(#t~post7 < 20);havoc #t~post7; {150509#(<= ~counter~0 7)} is VALID [2022-04-28 06:07:07,093 INFO L272 TraceCheckUtils]: 67: Hoare triple {150509#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {150509#(<= ~counter~0 7)} is VALID [2022-04-28 06:07:07,094 INFO L290 TraceCheckUtils]: 68: Hoare triple {150509#(<= ~counter~0 7)} ~cond := #in~cond; {150509#(<= ~counter~0 7)} is VALID [2022-04-28 06:07:07,094 INFO L290 TraceCheckUtils]: 69: Hoare triple {150509#(<= ~counter~0 7)} assume !(0 == ~cond); {150509#(<= ~counter~0 7)} is VALID [2022-04-28 06:07:07,094 INFO L290 TraceCheckUtils]: 70: Hoare triple {150509#(<= ~counter~0 7)} assume true; {150509#(<= ~counter~0 7)} is VALID [2022-04-28 06:07:07,095 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {150509#(<= ~counter~0 7)} {150509#(<= ~counter~0 7)} #96#return; {150509#(<= ~counter~0 7)} is VALID [2022-04-28 06:07:07,095 INFO L290 TraceCheckUtils]: 72: Hoare triple {150509#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {150509#(<= ~counter~0 7)} is VALID [2022-04-28 06:07:07,101 INFO L290 TraceCheckUtils]: 73: Hoare triple {150509#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {150534#(<= ~counter~0 8)} is VALID [2022-04-28 06:07:07,101 INFO L290 TraceCheckUtils]: 74: Hoare triple {150534#(<= ~counter~0 8)} assume !!(#t~post7 < 20);havoc #t~post7; {150534#(<= ~counter~0 8)} is VALID [2022-04-28 06:07:07,102 INFO L272 TraceCheckUtils]: 75: Hoare triple {150534#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {150534#(<= ~counter~0 8)} is VALID [2022-04-28 06:07:07,102 INFO L290 TraceCheckUtils]: 76: Hoare triple {150534#(<= ~counter~0 8)} ~cond := #in~cond; {150534#(<= ~counter~0 8)} is VALID [2022-04-28 06:07:07,102 INFO L290 TraceCheckUtils]: 77: Hoare triple {150534#(<= ~counter~0 8)} assume !(0 == ~cond); {150534#(<= ~counter~0 8)} is VALID [2022-04-28 06:07:07,102 INFO L290 TraceCheckUtils]: 78: Hoare triple {150534#(<= ~counter~0 8)} assume true; {150534#(<= ~counter~0 8)} is VALID [2022-04-28 06:07:07,103 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {150534#(<= ~counter~0 8)} {150534#(<= ~counter~0 8)} #96#return; {150534#(<= ~counter~0 8)} is VALID [2022-04-28 06:07:07,103 INFO L290 TraceCheckUtils]: 80: Hoare triple {150534#(<= ~counter~0 8)} assume !(~r~0 > 0); {150534#(<= ~counter~0 8)} is VALID [2022-04-28 06:07:07,108 INFO L290 TraceCheckUtils]: 81: Hoare triple {150534#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {150559#(<= ~counter~0 9)} is VALID [2022-04-28 06:07:07,108 INFO L290 TraceCheckUtils]: 82: Hoare triple {150559#(<= ~counter~0 9)} assume !!(#t~post8 < 20);havoc #t~post8; {150559#(<= ~counter~0 9)} is VALID [2022-04-28 06:07:07,109 INFO L272 TraceCheckUtils]: 83: Hoare triple {150559#(<= ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {150559#(<= ~counter~0 9)} is VALID [2022-04-28 06:07:07,109 INFO L290 TraceCheckUtils]: 84: Hoare triple {150559#(<= ~counter~0 9)} ~cond := #in~cond; {150559#(<= ~counter~0 9)} is VALID [2022-04-28 06:07:07,109 INFO L290 TraceCheckUtils]: 85: Hoare triple {150559#(<= ~counter~0 9)} assume !(0 == ~cond); {150559#(<= ~counter~0 9)} is VALID [2022-04-28 06:07:07,109 INFO L290 TraceCheckUtils]: 86: Hoare triple {150559#(<= ~counter~0 9)} assume true; {150559#(<= ~counter~0 9)} is VALID [2022-04-28 06:07:07,110 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {150559#(<= ~counter~0 9)} {150559#(<= ~counter~0 9)} #98#return; {150559#(<= ~counter~0 9)} is VALID [2022-04-28 06:07:07,110 INFO L290 TraceCheckUtils]: 88: Hoare triple {150559#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {150559#(<= ~counter~0 9)} is VALID [2022-04-28 06:07:07,116 INFO L290 TraceCheckUtils]: 89: Hoare triple {150559#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {150584#(<= ~counter~0 10)} is VALID [2022-04-28 06:07:07,116 INFO L290 TraceCheckUtils]: 90: Hoare triple {150584#(<= ~counter~0 10)} assume !!(#t~post8 < 20);havoc #t~post8; {150584#(<= ~counter~0 10)} is VALID [2022-04-28 06:07:07,117 INFO L272 TraceCheckUtils]: 91: Hoare triple {150584#(<= ~counter~0 10)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {150584#(<= ~counter~0 10)} is VALID [2022-04-28 06:07:07,117 INFO L290 TraceCheckUtils]: 92: Hoare triple {150584#(<= ~counter~0 10)} ~cond := #in~cond; {150584#(<= ~counter~0 10)} is VALID [2022-04-28 06:07:07,117 INFO L290 TraceCheckUtils]: 93: Hoare triple {150584#(<= ~counter~0 10)} assume !(0 == ~cond); {150584#(<= ~counter~0 10)} is VALID [2022-04-28 06:07:07,117 INFO L290 TraceCheckUtils]: 94: Hoare triple {150584#(<= ~counter~0 10)} assume true; {150584#(<= ~counter~0 10)} is VALID [2022-04-28 06:07:07,118 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {150584#(<= ~counter~0 10)} {150584#(<= ~counter~0 10)} #98#return; {150584#(<= ~counter~0 10)} is VALID [2022-04-28 06:07:07,118 INFO L290 TraceCheckUtils]: 96: Hoare triple {150584#(<= ~counter~0 10)} assume !(~r~0 < 0); {150584#(<= ~counter~0 10)} is VALID [2022-04-28 06:07:07,122 INFO L290 TraceCheckUtils]: 97: Hoare triple {150584#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {150609#(<= ~counter~0 11)} is VALID [2022-04-28 06:07:07,123 INFO L290 TraceCheckUtils]: 98: Hoare triple {150609#(<= ~counter~0 11)} assume !!(#t~post6 < 20);havoc #t~post6; {150609#(<= ~counter~0 11)} is VALID [2022-04-28 06:07:07,123 INFO L272 TraceCheckUtils]: 99: Hoare triple {150609#(<= ~counter~0 11)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {150609#(<= ~counter~0 11)} is VALID [2022-04-28 06:07:07,123 INFO L290 TraceCheckUtils]: 100: Hoare triple {150609#(<= ~counter~0 11)} ~cond := #in~cond; {150609#(<= ~counter~0 11)} is VALID [2022-04-28 06:07:07,124 INFO L290 TraceCheckUtils]: 101: Hoare triple {150609#(<= ~counter~0 11)} assume !(0 == ~cond); {150609#(<= ~counter~0 11)} is VALID [2022-04-28 06:07:07,124 INFO L290 TraceCheckUtils]: 102: Hoare triple {150609#(<= ~counter~0 11)} assume true; {150609#(<= ~counter~0 11)} is VALID [2022-04-28 06:07:07,124 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {150609#(<= ~counter~0 11)} {150609#(<= ~counter~0 11)} #94#return; {150609#(<= ~counter~0 11)} is VALID [2022-04-28 06:07:07,125 INFO L290 TraceCheckUtils]: 104: Hoare triple {150609#(<= ~counter~0 11)} assume !!(0 != ~r~0); {150609#(<= ~counter~0 11)} is VALID [2022-04-28 06:07:07,128 INFO L290 TraceCheckUtils]: 105: Hoare triple {150609#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {150634#(<= ~counter~0 12)} is VALID [2022-04-28 06:07:07,129 INFO L290 TraceCheckUtils]: 106: Hoare triple {150634#(<= ~counter~0 12)} assume !!(#t~post7 < 20);havoc #t~post7; {150634#(<= ~counter~0 12)} is VALID [2022-04-28 06:07:07,129 INFO L272 TraceCheckUtils]: 107: Hoare triple {150634#(<= ~counter~0 12)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {150634#(<= ~counter~0 12)} is VALID [2022-04-28 06:07:07,130 INFO L290 TraceCheckUtils]: 108: Hoare triple {150634#(<= ~counter~0 12)} ~cond := #in~cond; {150634#(<= ~counter~0 12)} is VALID [2022-04-28 06:07:07,130 INFO L290 TraceCheckUtils]: 109: Hoare triple {150634#(<= ~counter~0 12)} assume !(0 == ~cond); {150634#(<= ~counter~0 12)} is VALID [2022-04-28 06:07:07,130 INFO L290 TraceCheckUtils]: 110: Hoare triple {150634#(<= ~counter~0 12)} assume true; {150634#(<= ~counter~0 12)} is VALID [2022-04-28 06:07:07,131 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {150634#(<= ~counter~0 12)} {150634#(<= ~counter~0 12)} #96#return; {150634#(<= ~counter~0 12)} is VALID [2022-04-28 06:07:07,131 INFO L290 TraceCheckUtils]: 112: Hoare triple {150634#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {150634#(<= ~counter~0 12)} is VALID [2022-04-28 06:07:07,135 INFO L290 TraceCheckUtils]: 113: Hoare triple {150634#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {150659#(<= ~counter~0 13)} is VALID [2022-04-28 06:07:07,135 INFO L290 TraceCheckUtils]: 114: Hoare triple {150659#(<= ~counter~0 13)} assume !!(#t~post7 < 20);havoc #t~post7; {150659#(<= ~counter~0 13)} is VALID [2022-04-28 06:07:07,136 INFO L272 TraceCheckUtils]: 115: Hoare triple {150659#(<= ~counter~0 13)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {150659#(<= ~counter~0 13)} is VALID [2022-04-28 06:07:07,136 INFO L290 TraceCheckUtils]: 116: Hoare triple {150659#(<= ~counter~0 13)} ~cond := #in~cond; {150659#(<= ~counter~0 13)} is VALID [2022-04-28 06:07:07,136 INFO L290 TraceCheckUtils]: 117: Hoare triple {150659#(<= ~counter~0 13)} assume !(0 == ~cond); {150659#(<= ~counter~0 13)} is VALID [2022-04-28 06:07:07,137 INFO L290 TraceCheckUtils]: 118: Hoare triple {150659#(<= ~counter~0 13)} assume true; {150659#(<= ~counter~0 13)} is VALID [2022-04-28 06:07:07,137 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {150659#(<= ~counter~0 13)} {150659#(<= ~counter~0 13)} #96#return; {150659#(<= ~counter~0 13)} is VALID [2022-04-28 06:07:07,137 INFO L290 TraceCheckUtils]: 120: Hoare triple {150659#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {150659#(<= ~counter~0 13)} is VALID [2022-04-28 06:07:07,142 INFO L290 TraceCheckUtils]: 121: Hoare triple {150659#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {150684#(<= ~counter~0 14)} is VALID [2022-04-28 06:07:07,142 INFO L290 TraceCheckUtils]: 122: Hoare triple {150684#(<= ~counter~0 14)} assume !!(#t~post7 < 20);havoc #t~post7; {150684#(<= ~counter~0 14)} is VALID [2022-04-28 06:07:07,143 INFO L272 TraceCheckUtils]: 123: Hoare triple {150684#(<= ~counter~0 14)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {150684#(<= ~counter~0 14)} is VALID [2022-04-28 06:07:07,143 INFO L290 TraceCheckUtils]: 124: Hoare triple {150684#(<= ~counter~0 14)} ~cond := #in~cond; {150684#(<= ~counter~0 14)} is VALID [2022-04-28 06:07:07,143 INFO L290 TraceCheckUtils]: 125: Hoare triple {150684#(<= ~counter~0 14)} assume !(0 == ~cond); {150684#(<= ~counter~0 14)} is VALID [2022-04-28 06:07:07,144 INFO L290 TraceCheckUtils]: 126: Hoare triple {150684#(<= ~counter~0 14)} assume true; {150684#(<= ~counter~0 14)} is VALID [2022-04-28 06:07:07,144 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {150684#(<= ~counter~0 14)} {150684#(<= ~counter~0 14)} #96#return; {150684#(<= ~counter~0 14)} is VALID [2022-04-28 06:07:07,144 INFO L290 TraceCheckUtils]: 128: Hoare triple {150684#(<= ~counter~0 14)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {150684#(<= ~counter~0 14)} is VALID [2022-04-28 06:07:07,148 INFO L290 TraceCheckUtils]: 129: Hoare triple {150684#(<= ~counter~0 14)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {150709#(<= ~counter~0 15)} is VALID [2022-04-28 06:07:07,149 INFO L290 TraceCheckUtils]: 130: Hoare triple {150709#(<= ~counter~0 15)} assume !!(#t~post7 < 20);havoc #t~post7; {150709#(<= ~counter~0 15)} is VALID [2022-04-28 06:07:07,150 INFO L272 TraceCheckUtils]: 131: Hoare triple {150709#(<= ~counter~0 15)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {150709#(<= ~counter~0 15)} is VALID [2022-04-28 06:07:07,150 INFO L290 TraceCheckUtils]: 132: Hoare triple {150709#(<= ~counter~0 15)} ~cond := #in~cond; {150709#(<= ~counter~0 15)} is VALID [2022-04-28 06:07:07,150 INFO L290 TraceCheckUtils]: 133: Hoare triple {150709#(<= ~counter~0 15)} assume !(0 == ~cond); {150709#(<= ~counter~0 15)} is VALID [2022-04-28 06:07:07,150 INFO L290 TraceCheckUtils]: 134: Hoare triple {150709#(<= ~counter~0 15)} assume true; {150709#(<= ~counter~0 15)} is VALID [2022-04-28 06:07:07,151 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {150709#(<= ~counter~0 15)} {150709#(<= ~counter~0 15)} #96#return; {150709#(<= ~counter~0 15)} is VALID [2022-04-28 06:07:07,151 INFO L290 TraceCheckUtils]: 136: Hoare triple {150709#(<= ~counter~0 15)} assume !(~r~0 > 0); {150709#(<= ~counter~0 15)} is VALID [2022-04-28 06:07:07,156 INFO L290 TraceCheckUtils]: 137: Hoare triple {150709#(<= ~counter~0 15)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {150734#(<= ~counter~0 16)} is VALID [2022-04-28 06:07:07,157 INFO L290 TraceCheckUtils]: 138: Hoare triple {150734#(<= ~counter~0 16)} assume !!(#t~post8 < 20);havoc #t~post8; {150734#(<= ~counter~0 16)} is VALID [2022-04-28 06:07:07,157 INFO L272 TraceCheckUtils]: 139: Hoare triple {150734#(<= ~counter~0 16)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {150734#(<= ~counter~0 16)} is VALID [2022-04-28 06:07:07,158 INFO L290 TraceCheckUtils]: 140: Hoare triple {150734#(<= ~counter~0 16)} ~cond := #in~cond; {150734#(<= ~counter~0 16)} is VALID [2022-04-28 06:07:07,158 INFO L290 TraceCheckUtils]: 141: Hoare triple {150734#(<= ~counter~0 16)} assume !(0 == ~cond); {150734#(<= ~counter~0 16)} is VALID [2022-04-28 06:07:07,158 INFO L290 TraceCheckUtils]: 142: Hoare triple {150734#(<= ~counter~0 16)} assume true; {150734#(<= ~counter~0 16)} is VALID [2022-04-28 06:07:07,159 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {150734#(<= ~counter~0 16)} {150734#(<= ~counter~0 16)} #98#return; {150734#(<= ~counter~0 16)} is VALID [2022-04-28 06:07:07,159 INFO L290 TraceCheckUtils]: 144: Hoare triple {150734#(<= ~counter~0 16)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {150734#(<= ~counter~0 16)} is VALID [2022-04-28 06:07:07,159 INFO L290 TraceCheckUtils]: 145: Hoare triple {150734#(<= ~counter~0 16)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {150759#(<= |main_#t~post8| 16)} is VALID [2022-04-28 06:07:07,160 INFO L290 TraceCheckUtils]: 146: Hoare triple {150759#(<= |main_#t~post8| 16)} assume !(#t~post8 < 20);havoc #t~post8; {150303#false} is VALID [2022-04-28 06:07:07,160 INFO L290 TraceCheckUtils]: 147: Hoare triple {150303#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {150303#false} is VALID [2022-04-28 06:07:07,160 INFO L290 TraceCheckUtils]: 148: Hoare triple {150303#false} assume !(#t~post6 < 20);havoc #t~post6; {150303#false} is VALID [2022-04-28 06:07:07,160 INFO L272 TraceCheckUtils]: 149: Hoare triple {150303#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {150303#false} is VALID [2022-04-28 06:07:07,160 INFO L290 TraceCheckUtils]: 150: Hoare triple {150303#false} ~cond := #in~cond; {150303#false} is VALID [2022-04-28 06:07:07,160 INFO L290 TraceCheckUtils]: 151: Hoare triple {150303#false} assume 0 == ~cond; {150303#false} is VALID [2022-04-28 06:07:07,160 INFO L290 TraceCheckUtils]: 152: Hoare triple {150303#false} assume !false; {150303#false} is VALID [2022-04-28 06:07:07,160 INFO L134 CoverageAnalysis]: Checked inductivity of 696 backedges. 38 proven. 654 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 06:07:07,161 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 06:07:07,939 INFO L290 TraceCheckUtils]: 152: Hoare triple {150303#false} assume !false; {150303#false} is VALID [2022-04-28 06:07:07,939 INFO L290 TraceCheckUtils]: 151: Hoare triple {150303#false} assume 0 == ~cond; {150303#false} is VALID [2022-04-28 06:07:07,939 INFO L290 TraceCheckUtils]: 150: Hoare triple {150303#false} ~cond := #in~cond; {150303#false} is VALID [2022-04-28 06:07:07,939 INFO L272 TraceCheckUtils]: 149: Hoare triple {150303#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {150303#false} is VALID [2022-04-28 06:07:07,939 INFO L290 TraceCheckUtils]: 148: Hoare triple {150303#false} assume !(#t~post6 < 20);havoc #t~post6; {150303#false} is VALID [2022-04-28 06:07:07,939 INFO L290 TraceCheckUtils]: 147: Hoare triple {150303#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {150303#false} is VALID [2022-04-28 06:07:07,940 INFO L290 TraceCheckUtils]: 146: Hoare triple {150799#(< |main_#t~post8| 20)} assume !(#t~post8 < 20);havoc #t~post8; {150303#false} is VALID [2022-04-28 06:07:07,940 INFO L290 TraceCheckUtils]: 145: Hoare triple {150803#(< ~counter~0 20)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {150799#(< |main_#t~post8| 20)} is VALID [2022-04-28 06:07:07,940 INFO L290 TraceCheckUtils]: 144: Hoare triple {150803#(< ~counter~0 20)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {150803#(< ~counter~0 20)} is VALID [2022-04-28 06:07:07,941 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {150302#true} {150803#(< ~counter~0 20)} #98#return; {150803#(< ~counter~0 20)} is VALID [2022-04-28 06:07:07,941 INFO L290 TraceCheckUtils]: 142: Hoare triple {150302#true} assume true; {150302#true} is VALID [2022-04-28 06:07:07,941 INFO L290 TraceCheckUtils]: 141: Hoare triple {150302#true} assume !(0 == ~cond); {150302#true} is VALID [2022-04-28 06:07:07,941 INFO L290 TraceCheckUtils]: 140: Hoare triple {150302#true} ~cond := #in~cond; {150302#true} is VALID [2022-04-28 06:07:07,941 INFO L272 TraceCheckUtils]: 139: Hoare triple {150803#(< ~counter~0 20)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {150302#true} is VALID [2022-04-28 06:07:07,941 INFO L290 TraceCheckUtils]: 138: Hoare triple {150803#(< ~counter~0 20)} assume !!(#t~post8 < 20);havoc #t~post8; {150803#(< ~counter~0 20)} is VALID [2022-04-28 06:07:07,945 INFO L290 TraceCheckUtils]: 137: Hoare triple {150828#(< ~counter~0 19)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {150803#(< ~counter~0 20)} is VALID [2022-04-28 06:07:07,946 INFO L290 TraceCheckUtils]: 136: Hoare triple {150828#(< ~counter~0 19)} assume !(~r~0 > 0); {150828#(< ~counter~0 19)} is VALID [2022-04-28 06:07:07,946 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {150302#true} {150828#(< ~counter~0 19)} #96#return; {150828#(< ~counter~0 19)} is VALID [2022-04-28 06:07:07,946 INFO L290 TraceCheckUtils]: 134: Hoare triple {150302#true} assume true; {150302#true} is VALID [2022-04-28 06:07:07,946 INFO L290 TraceCheckUtils]: 133: Hoare triple {150302#true} assume !(0 == ~cond); {150302#true} is VALID [2022-04-28 06:07:07,946 INFO L290 TraceCheckUtils]: 132: Hoare triple {150302#true} ~cond := #in~cond; {150302#true} is VALID [2022-04-28 06:07:07,946 INFO L272 TraceCheckUtils]: 131: Hoare triple {150828#(< ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {150302#true} is VALID [2022-04-28 06:07:07,947 INFO L290 TraceCheckUtils]: 130: Hoare triple {150828#(< ~counter~0 19)} assume !!(#t~post7 < 20);havoc #t~post7; {150828#(< ~counter~0 19)} is VALID [2022-04-28 06:07:07,949 INFO L290 TraceCheckUtils]: 129: Hoare triple {150853#(< ~counter~0 18)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {150828#(< ~counter~0 19)} is VALID [2022-04-28 06:07:07,949 INFO L290 TraceCheckUtils]: 128: Hoare triple {150853#(< ~counter~0 18)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {150853#(< ~counter~0 18)} is VALID [2022-04-28 06:07:07,950 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {150302#true} {150853#(< ~counter~0 18)} #96#return; {150853#(< ~counter~0 18)} is VALID [2022-04-28 06:07:07,950 INFO L290 TraceCheckUtils]: 126: Hoare triple {150302#true} assume true; {150302#true} is VALID [2022-04-28 06:07:07,950 INFO L290 TraceCheckUtils]: 125: Hoare triple {150302#true} assume !(0 == ~cond); {150302#true} is VALID [2022-04-28 06:07:07,950 INFO L290 TraceCheckUtils]: 124: Hoare triple {150302#true} ~cond := #in~cond; {150302#true} is VALID [2022-04-28 06:07:07,950 INFO L272 TraceCheckUtils]: 123: Hoare triple {150853#(< ~counter~0 18)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {150302#true} is VALID [2022-04-28 06:07:07,950 INFO L290 TraceCheckUtils]: 122: Hoare triple {150853#(< ~counter~0 18)} assume !!(#t~post7 < 20);havoc #t~post7; {150853#(< ~counter~0 18)} is VALID [2022-04-28 06:07:07,952 INFO L290 TraceCheckUtils]: 121: Hoare triple {150734#(<= ~counter~0 16)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {150853#(< ~counter~0 18)} is VALID [2022-04-28 06:07:07,952 INFO L290 TraceCheckUtils]: 120: Hoare triple {150734#(<= ~counter~0 16)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {150734#(<= ~counter~0 16)} is VALID [2022-04-28 06:07:07,953 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {150302#true} {150734#(<= ~counter~0 16)} #96#return; {150734#(<= ~counter~0 16)} is VALID [2022-04-28 06:07:07,953 INFO L290 TraceCheckUtils]: 118: Hoare triple {150302#true} assume true; {150302#true} is VALID [2022-04-28 06:07:07,953 INFO L290 TraceCheckUtils]: 117: Hoare triple {150302#true} assume !(0 == ~cond); {150302#true} is VALID [2022-04-28 06:07:07,953 INFO L290 TraceCheckUtils]: 116: Hoare triple {150302#true} ~cond := #in~cond; {150302#true} is VALID [2022-04-28 06:07:07,953 INFO L272 TraceCheckUtils]: 115: Hoare triple {150734#(<= ~counter~0 16)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {150302#true} is VALID [2022-04-28 06:07:07,953 INFO L290 TraceCheckUtils]: 114: Hoare triple {150734#(<= ~counter~0 16)} assume !!(#t~post7 < 20);havoc #t~post7; {150734#(<= ~counter~0 16)} is VALID [2022-04-28 06:07:07,956 INFO L290 TraceCheckUtils]: 113: Hoare triple {150709#(<= ~counter~0 15)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {150734#(<= ~counter~0 16)} is VALID [2022-04-28 06:07:07,957 INFO L290 TraceCheckUtils]: 112: Hoare triple {150709#(<= ~counter~0 15)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {150709#(<= ~counter~0 15)} is VALID [2022-04-28 06:07:07,957 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {150302#true} {150709#(<= ~counter~0 15)} #96#return; {150709#(<= ~counter~0 15)} is VALID [2022-04-28 06:07:07,957 INFO L290 TraceCheckUtils]: 110: Hoare triple {150302#true} assume true; {150302#true} is VALID [2022-04-28 06:07:07,957 INFO L290 TraceCheckUtils]: 109: Hoare triple {150302#true} assume !(0 == ~cond); {150302#true} is VALID [2022-04-28 06:07:07,957 INFO L290 TraceCheckUtils]: 108: Hoare triple {150302#true} ~cond := #in~cond; {150302#true} is VALID [2022-04-28 06:07:07,957 INFO L272 TraceCheckUtils]: 107: Hoare triple {150709#(<= ~counter~0 15)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {150302#true} is VALID [2022-04-28 06:07:07,958 INFO L290 TraceCheckUtils]: 106: Hoare triple {150709#(<= ~counter~0 15)} assume !!(#t~post7 < 20);havoc #t~post7; {150709#(<= ~counter~0 15)} is VALID [2022-04-28 06:07:07,960 INFO L290 TraceCheckUtils]: 105: Hoare triple {150684#(<= ~counter~0 14)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {150709#(<= ~counter~0 15)} is VALID [2022-04-28 06:07:07,960 INFO L290 TraceCheckUtils]: 104: Hoare triple {150684#(<= ~counter~0 14)} assume !!(0 != ~r~0); {150684#(<= ~counter~0 14)} is VALID [2022-04-28 06:07:07,961 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {150302#true} {150684#(<= ~counter~0 14)} #94#return; {150684#(<= ~counter~0 14)} is VALID [2022-04-28 06:07:07,961 INFO L290 TraceCheckUtils]: 102: Hoare triple {150302#true} assume true; {150302#true} is VALID [2022-04-28 06:07:07,961 INFO L290 TraceCheckUtils]: 101: Hoare triple {150302#true} assume !(0 == ~cond); {150302#true} is VALID [2022-04-28 06:07:07,961 INFO L290 TraceCheckUtils]: 100: Hoare triple {150302#true} ~cond := #in~cond; {150302#true} is VALID [2022-04-28 06:07:07,961 INFO L272 TraceCheckUtils]: 99: Hoare triple {150684#(<= ~counter~0 14)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {150302#true} is VALID [2022-04-28 06:07:07,961 INFO L290 TraceCheckUtils]: 98: Hoare triple {150684#(<= ~counter~0 14)} assume !!(#t~post6 < 20);havoc #t~post6; {150684#(<= ~counter~0 14)} is VALID [2022-04-28 06:07:07,963 INFO L290 TraceCheckUtils]: 97: Hoare triple {150659#(<= ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {150684#(<= ~counter~0 14)} is VALID [2022-04-28 06:07:07,963 INFO L290 TraceCheckUtils]: 96: Hoare triple {150659#(<= ~counter~0 13)} assume !(~r~0 < 0); {150659#(<= ~counter~0 13)} is VALID [2022-04-28 06:07:07,964 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {150302#true} {150659#(<= ~counter~0 13)} #98#return; {150659#(<= ~counter~0 13)} is VALID [2022-04-28 06:07:07,964 INFO L290 TraceCheckUtils]: 94: Hoare triple {150302#true} assume true; {150302#true} is VALID [2022-04-28 06:07:07,964 INFO L290 TraceCheckUtils]: 93: Hoare triple {150302#true} assume !(0 == ~cond); {150302#true} is VALID [2022-04-28 06:07:07,964 INFO L290 TraceCheckUtils]: 92: Hoare triple {150302#true} ~cond := #in~cond; {150302#true} is VALID [2022-04-28 06:07:07,964 INFO L272 TraceCheckUtils]: 91: Hoare triple {150659#(<= ~counter~0 13)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {150302#true} is VALID [2022-04-28 06:07:07,964 INFO L290 TraceCheckUtils]: 90: Hoare triple {150659#(<= ~counter~0 13)} assume !!(#t~post8 < 20);havoc #t~post8; {150659#(<= ~counter~0 13)} is VALID [2022-04-28 06:07:07,968 INFO L290 TraceCheckUtils]: 89: Hoare triple {150634#(<= ~counter~0 12)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {150659#(<= ~counter~0 13)} is VALID [2022-04-28 06:07:07,969 INFO L290 TraceCheckUtils]: 88: Hoare triple {150634#(<= ~counter~0 12)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {150634#(<= ~counter~0 12)} is VALID [2022-04-28 06:07:07,969 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {150302#true} {150634#(<= ~counter~0 12)} #98#return; {150634#(<= ~counter~0 12)} is VALID [2022-04-28 06:07:07,969 INFO L290 TraceCheckUtils]: 86: Hoare triple {150302#true} assume true; {150302#true} is VALID [2022-04-28 06:07:07,969 INFO L290 TraceCheckUtils]: 85: Hoare triple {150302#true} assume !(0 == ~cond); {150302#true} is VALID [2022-04-28 06:07:07,969 INFO L290 TraceCheckUtils]: 84: Hoare triple {150302#true} ~cond := #in~cond; {150302#true} is VALID [2022-04-28 06:07:07,969 INFO L272 TraceCheckUtils]: 83: Hoare triple {150634#(<= ~counter~0 12)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {150302#true} is VALID [2022-04-28 06:07:07,970 INFO L290 TraceCheckUtils]: 82: Hoare triple {150634#(<= ~counter~0 12)} assume !!(#t~post8 < 20);havoc #t~post8; {150634#(<= ~counter~0 12)} is VALID [2022-04-28 06:07:07,973 INFO L290 TraceCheckUtils]: 81: Hoare triple {150609#(<= ~counter~0 11)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {150634#(<= ~counter~0 12)} is VALID [2022-04-28 06:07:07,974 INFO L290 TraceCheckUtils]: 80: Hoare triple {150609#(<= ~counter~0 11)} assume !(~r~0 > 0); {150609#(<= ~counter~0 11)} is VALID [2022-04-28 06:07:07,974 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {150302#true} {150609#(<= ~counter~0 11)} #96#return; {150609#(<= ~counter~0 11)} is VALID [2022-04-28 06:07:07,974 INFO L290 TraceCheckUtils]: 78: Hoare triple {150302#true} assume true; {150302#true} is VALID [2022-04-28 06:07:07,974 INFO L290 TraceCheckUtils]: 77: Hoare triple {150302#true} assume !(0 == ~cond); {150302#true} is VALID [2022-04-28 06:07:07,974 INFO L290 TraceCheckUtils]: 76: Hoare triple {150302#true} ~cond := #in~cond; {150302#true} is VALID [2022-04-28 06:07:07,974 INFO L272 TraceCheckUtils]: 75: Hoare triple {150609#(<= ~counter~0 11)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {150302#true} is VALID [2022-04-28 06:07:07,975 INFO L290 TraceCheckUtils]: 74: Hoare triple {150609#(<= ~counter~0 11)} assume !!(#t~post7 < 20);havoc #t~post7; {150609#(<= ~counter~0 11)} is VALID [2022-04-28 06:07:07,978 INFO L290 TraceCheckUtils]: 73: Hoare triple {150584#(<= ~counter~0 10)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {150609#(<= ~counter~0 11)} is VALID [2022-04-28 06:07:07,978 INFO L290 TraceCheckUtils]: 72: Hoare triple {150584#(<= ~counter~0 10)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {150584#(<= ~counter~0 10)} is VALID [2022-04-28 06:07:07,979 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {150302#true} {150584#(<= ~counter~0 10)} #96#return; {150584#(<= ~counter~0 10)} is VALID [2022-04-28 06:07:07,979 INFO L290 TraceCheckUtils]: 70: Hoare triple {150302#true} assume true; {150302#true} is VALID [2022-04-28 06:07:07,979 INFO L290 TraceCheckUtils]: 69: Hoare triple {150302#true} assume !(0 == ~cond); {150302#true} is VALID [2022-04-28 06:07:07,979 INFO L290 TraceCheckUtils]: 68: Hoare triple {150302#true} ~cond := #in~cond; {150302#true} is VALID [2022-04-28 06:07:07,979 INFO L272 TraceCheckUtils]: 67: Hoare triple {150584#(<= ~counter~0 10)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {150302#true} is VALID [2022-04-28 06:07:07,995 INFO L290 TraceCheckUtils]: 66: Hoare triple {150584#(<= ~counter~0 10)} assume !!(#t~post7 < 20);havoc #t~post7; {150584#(<= ~counter~0 10)} is VALID [2022-04-28 06:07:08,002 INFO L290 TraceCheckUtils]: 65: Hoare triple {150559#(<= ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {150584#(<= ~counter~0 10)} is VALID [2022-04-28 06:07:08,003 INFO L290 TraceCheckUtils]: 64: Hoare triple {150559#(<= ~counter~0 9)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {150559#(<= ~counter~0 9)} is VALID [2022-04-28 06:07:08,003 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {150302#true} {150559#(<= ~counter~0 9)} #96#return; {150559#(<= ~counter~0 9)} is VALID [2022-04-28 06:07:08,004 INFO L290 TraceCheckUtils]: 62: Hoare triple {150302#true} assume true; {150302#true} is VALID [2022-04-28 06:07:08,004 INFO L290 TraceCheckUtils]: 61: Hoare triple {150302#true} assume !(0 == ~cond); {150302#true} is VALID [2022-04-28 06:07:08,004 INFO L290 TraceCheckUtils]: 60: Hoare triple {150302#true} ~cond := #in~cond; {150302#true} is VALID [2022-04-28 06:07:08,004 INFO L272 TraceCheckUtils]: 59: Hoare triple {150559#(<= ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {150302#true} is VALID [2022-04-28 06:07:08,004 INFO L290 TraceCheckUtils]: 58: Hoare triple {150559#(<= ~counter~0 9)} assume !!(#t~post7 < 20);havoc #t~post7; {150559#(<= ~counter~0 9)} is VALID [2022-04-28 06:07:08,010 INFO L290 TraceCheckUtils]: 57: Hoare triple {150534#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {150559#(<= ~counter~0 9)} is VALID [2022-04-28 06:07:08,011 INFO L290 TraceCheckUtils]: 56: Hoare triple {150534#(<= ~counter~0 8)} assume !!(0 != ~r~0); {150534#(<= ~counter~0 8)} is VALID [2022-04-28 06:07:08,012 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {150302#true} {150534#(<= ~counter~0 8)} #94#return; {150534#(<= ~counter~0 8)} is VALID [2022-04-28 06:07:08,012 INFO L290 TraceCheckUtils]: 54: Hoare triple {150302#true} assume true; {150302#true} is VALID [2022-04-28 06:07:08,012 INFO L290 TraceCheckUtils]: 53: Hoare triple {150302#true} assume !(0 == ~cond); {150302#true} is VALID [2022-04-28 06:07:08,012 INFO L290 TraceCheckUtils]: 52: Hoare triple {150302#true} ~cond := #in~cond; {150302#true} is VALID [2022-04-28 06:07:08,012 INFO L272 TraceCheckUtils]: 51: Hoare triple {150534#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {150302#true} is VALID [2022-04-28 06:07:08,012 INFO L290 TraceCheckUtils]: 50: Hoare triple {150534#(<= ~counter~0 8)} assume !!(#t~post6 < 20);havoc #t~post6; {150534#(<= ~counter~0 8)} is VALID [2022-04-28 06:07:08,018 INFO L290 TraceCheckUtils]: 49: Hoare triple {150509#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {150534#(<= ~counter~0 8)} is VALID [2022-04-28 06:07:08,018 INFO L290 TraceCheckUtils]: 48: Hoare triple {150509#(<= ~counter~0 7)} assume !(~r~0 < 0); {150509#(<= ~counter~0 7)} is VALID [2022-04-28 06:07:08,019 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {150302#true} {150509#(<= ~counter~0 7)} #98#return; {150509#(<= ~counter~0 7)} is VALID [2022-04-28 06:07:08,019 INFO L290 TraceCheckUtils]: 46: Hoare triple {150302#true} assume true; {150302#true} is VALID [2022-04-28 06:07:08,019 INFO L290 TraceCheckUtils]: 45: Hoare triple {150302#true} assume !(0 == ~cond); {150302#true} is VALID [2022-04-28 06:07:08,019 INFO L290 TraceCheckUtils]: 44: Hoare triple {150302#true} ~cond := #in~cond; {150302#true} is VALID [2022-04-28 06:07:08,019 INFO L272 TraceCheckUtils]: 43: Hoare triple {150509#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {150302#true} is VALID [2022-04-28 06:07:08,020 INFO L290 TraceCheckUtils]: 42: Hoare triple {150509#(<= ~counter~0 7)} assume !!(#t~post8 < 20);havoc #t~post8; {150509#(<= ~counter~0 7)} is VALID [2022-04-28 06:07:08,027 INFO L290 TraceCheckUtils]: 41: Hoare triple {150484#(<= ~counter~0 6)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {150509#(<= ~counter~0 7)} is VALID [2022-04-28 06:07:08,027 INFO L290 TraceCheckUtils]: 40: Hoare triple {150484#(<= ~counter~0 6)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {150484#(<= ~counter~0 6)} is VALID [2022-04-28 06:07:08,028 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {150302#true} {150484#(<= ~counter~0 6)} #98#return; {150484#(<= ~counter~0 6)} is VALID [2022-04-28 06:07:08,028 INFO L290 TraceCheckUtils]: 38: Hoare triple {150302#true} assume true; {150302#true} is VALID [2022-04-28 06:07:08,028 INFO L290 TraceCheckUtils]: 37: Hoare triple {150302#true} assume !(0 == ~cond); {150302#true} is VALID [2022-04-28 06:07:08,028 INFO L290 TraceCheckUtils]: 36: Hoare triple {150302#true} ~cond := #in~cond; {150302#true} is VALID [2022-04-28 06:07:08,028 INFO L272 TraceCheckUtils]: 35: Hoare triple {150484#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {150302#true} is VALID [2022-04-28 06:07:08,029 INFO L290 TraceCheckUtils]: 34: Hoare triple {150484#(<= ~counter~0 6)} assume !!(#t~post8 < 20);havoc #t~post8; {150484#(<= ~counter~0 6)} is VALID [2022-04-28 06:07:08,036 INFO L290 TraceCheckUtils]: 33: Hoare triple {150459#(<= ~counter~0 5)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {150484#(<= ~counter~0 6)} is VALID [2022-04-28 06:07:08,036 INFO L290 TraceCheckUtils]: 32: Hoare triple {150459#(<= ~counter~0 5)} assume !(~r~0 > 0); {150459#(<= ~counter~0 5)} is VALID [2022-04-28 06:07:08,037 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {150302#true} {150459#(<= ~counter~0 5)} #96#return; {150459#(<= ~counter~0 5)} is VALID [2022-04-28 06:07:08,037 INFO L290 TraceCheckUtils]: 30: Hoare triple {150302#true} assume true; {150302#true} is VALID [2022-04-28 06:07:08,037 INFO L290 TraceCheckUtils]: 29: Hoare triple {150302#true} assume !(0 == ~cond); {150302#true} is VALID [2022-04-28 06:07:08,037 INFO L290 TraceCheckUtils]: 28: Hoare triple {150302#true} ~cond := #in~cond; {150302#true} is VALID [2022-04-28 06:07:08,037 INFO L272 TraceCheckUtils]: 27: Hoare triple {150459#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {150302#true} is VALID [2022-04-28 06:07:08,037 INFO L290 TraceCheckUtils]: 26: Hoare triple {150459#(<= ~counter~0 5)} assume !!(#t~post7 < 20);havoc #t~post7; {150459#(<= ~counter~0 5)} is VALID [2022-04-28 06:07:08,044 INFO L290 TraceCheckUtils]: 25: Hoare triple {150434#(<= ~counter~0 4)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {150459#(<= ~counter~0 5)} is VALID [2022-04-28 06:07:08,045 INFO L290 TraceCheckUtils]: 24: Hoare triple {150434#(<= ~counter~0 4)} assume !!(0 != ~r~0); {150434#(<= ~counter~0 4)} is VALID [2022-04-28 06:07:08,046 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {150302#true} {150434#(<= ~counter~0 4)} #94#return; {150434#(<= ~counter~0 4)} is VALID [2022-04-28 06:07:08,046 INFO L290 TraceCheckUtils]: 22: Hoare triple {150302#true} assume true; {150302#true} is VALID [2022-04-28 06:07:08,046 INFO L290 TraceCheckUtils]: 21: Hoare triple {150302#true} assume !(0 == ~cond); {150302#true} is VALID [2022-04-28 06:07:08,046 INFO L290 TraceCheckUtils]: 20: Hoare triple {150302#true} ~cond := #in~cond; {150302#true} is VALID [2022-04-28 06:07:08,046 INFO L272 TraceCheckUtils]: 19: Hoare triple {150434#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {150302#true} is VALID [2022-04-28 06:07:08,046 INFO L290 TraceCheckUtils]: 18: Hoare triple {150434#(<= ~counter~0 4)} assume !!(#t~post6 < 20);havoc #t~post6; {150434#(<= ~counter~0 4)} is VALID [2022-04-28 06:07:08,052 INFO L290 TraceCheckUtils]: 17: Hoare triple {150409#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {150434#(<= ~counter~0 4)} is VALID [2022-04-28 06:07:08,053 INFO L290 TraceCheckUtils]: 16: Hoare triple {150409#(<= ~counter~0 3)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {150409#(<= ~counter~0 3)} is VALID [2022-04-28 06:07:08,053 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {150302#true} {150409#(<= ~counter~0 3)} #92#return; {150409#(<= ~counter~0 3)} is VALID [2022-04-28 06:07:08,053 INFO L290 TraceCheckUtils]: 14: Hoare triple {150302#true} assume true; {150302#true} is VALID [2022-04-28 06:07:08,053 INFO L290 TraceCheckUtils]: 13: Hoare triple {150302#true} assume !(0 == ~cond); {150302#true} is VALID [2022-04-28 06:07:08,053 INFO L290 TraceCheckUtils]: 12: Hoare triple {150302#true} ~cond := #in~cond; {150302#true} is VALID [2022-04-28 06:07:08,054 INFO L272 TraceCheckUtils]: 11: Hoare triple {150409#(<= ~counter~0 3)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {150302#true} is VALID [2022-04-28 06:07:08,054 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {150302#true} {150409#(<= ~counter~0 3)} #90#return; {150409#(<= ~counter~0 3)} is VALID [2022-04-28 06:07:08,054 INFO L290 TraceCheckUtils]: 9: Hoare triple {150302#true} assume true; {150302#true} is VALID [2022-04-28 06:07:08,054 INFO L290 TraceCheckUtils]: 8: Hoare triple {150302#true} assume !(0 == ~cond); {150302#true} is VALID [2022-04-28 06:07:08,054 INFO L290 TraceCheckUtils]: 7: Hoare triple {150302#true} ~cond := #in~cond; {150302#true} is VALID [2022-04-28 06:07:08,054 INFO L272 TraceCheckUtils]: 6: Hoare triple {150409#(<= ~counter~0 3)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {150302#true} is VALID [2022-04-28 06:07:08,055 INFO L290 TraceCheckUtils]: 5: Hoare triple {150409#(<= ~counter~0 3)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {150409#(<= ~counter~0 3)} is VALID [2022-04-28 06:07:08,055 INFO L272 TraceCheckUtils]: 4: Hoare triple {150409#(<= ~counter~0 3)} call #t~ret9 := main(); {150409#(<= ~counter~0 3)} is VALID [2022-04-28 06:07:08,055 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {150409#(<= ~counter~0 3)} {150302#true} #102#return; {150409#(<= ~counter~0 3)} is VALID [2022-04-28 06:07:08,056 INFO L290 TraceCheckUtils]: 2: Hoare triple {150409#(<= ~counter~0 3)} assume true; {150409#(<= ~counter~0 3)} is VALID [2022-04-28 06:07:08,056 INFO L290 TraceCheckUtils]: 1: Hoare triple {150302#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {150409#(<= ~counter~0 3)} is VALID [2022-04-28 06:07:08,056 INFO L272 TraceCheckUtils]: 0: Hoare triple {150302#true} call ULTIMATE.init(); {150302#true} is VALID [2022-04-28 06:07:08,057 INFO L134 CoverageAnalysis]: Checked inductivity of 696 backedges. 38 proven. 174 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2022-04-28 06:07:08,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:07:08,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455204728] [2022-04-28 06:07:08,057 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:07:08,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1909655896] [2022-04-28 06:07:08,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1909655896] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 06:07:08,057 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 06:07:08,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 24 [2022-04-28 06:07:08,058 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:07:08,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1634510736] [2022-04-28 06:07:08,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1634510736] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:07:08,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:07:08,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-28 06:07:08,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336438873] [2022-04-28 06:07:08,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:07:08,059 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.5) internal successors, (110), 19 states have internal predecessors, (110), 19 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 17 states have call predecessors, (19), 18 states have call successors, (19) Word has length 153 [2022-04-28 06:07:08,059 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:07:08,059 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 5.5) internal successors, (110), 19 states have internal predecessors, (110), 19 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 17 states have call predecessors, (19), 18 states have call successors, (19) [2022-04-28 06:07:08,371 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:07:08,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-28 06:07:08,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:07:08,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-28 06:07:08,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-28 06:07:08,372 INFO L87 Difference]: Start difference. First operand 819 states and 1096 transitions. Second operand has 20 states, 20 states have (on average 5.5) internal successors, (110), 19 states have internal predecessors, (110), 19 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 17 states have call predecessors, (19), 18 states have call successors, (19) [2022-04-28 06:07:14,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:07:14,759 INFO L93 Difference]: Finished difference Result 1023 states and 1398 transitions. [2022-04-28 06:07:14,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-28 06:07:14,760 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.5) internal successors, (110), 19 states have internal predecessors, (110), 19 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 17 states have call predecessors, (19), 18 states have call successors, (19) Word has length 153 [2022-04-28 06:07:14,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:07:14,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 5.5) internal successors, (110), 19 states have internal predecessors, (110), 19 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 17 states have call predecessors, (19), 18 states have call successors, (19) [2022-04-28 06:07:14,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 356 transitions. [2022-04-28 06:07:14,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 5.5) internal successors, (110), 19 states have internal predecessors, (110), 19 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 17 states have call predecessors, (19), 18 states have call successors, (19) [2022-04-28 06:07:14,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 356 transitions. [2022-04-28 06:07:14,764 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 356 transitions. [2022-04-28 06:07:15,194 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 356 edges. 356 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:07:15,224 INFO L225 Difference]: With dead ends: 1023 [2022-04-28 06:07:15,224 INFO L226 Difference]: Without dead ends: 845 [2022-04-28 06:07:15,225 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 282 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=530, Invalid=876, Unknown=0, NotChecked=0, Total=1406 [2022-04-28 06:07:15,225 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 296 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 255 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 255 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-28 06:07:15,225 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 337 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [255 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-28 06:07:15,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2022-04-28 06:07:18,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 834. [2022-04-28 06:07:18,451 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:07:18,452 INFO L82 GeneralOperation]: Start isEquivalent. First operand 845 states. Second operand has 834 states, 624 states have (on average 1.1826923076923077) internal successors, (738), 636 states have internal predecessors, (738), 189 states have call successors, (189), 22 states have call predecessors, (189), 20 states have return successors, (187), 175 states have call predecessors, (187), 187 states have call successors, (187) [2022-04-28 06:07:18,452 INFO L74 IsIncluded]: Start isIncluded. First operand 845 states. Second operand has 834 states, 624 states have (on average 1.1826923076923077) internal successors, (738), 636 states have internal predecessors, (738), 189 states have call successors, (189), 22 states have call predecessors, (189), 20 states have return successors, (187), 175 states have call predecessors, (187), 187 states have call successors, (187) [2022-04-28 06:07:18,453 INFO L87 Difference]: Start difference. First operand 845 states. Second operand has 834 states, 624 states have (on average 1.1826923076923077) internal successors, (738), 636 states have internal predecessors, (738), 189 states have call successors, (189), 22 states have call predecessors, (189), 20 states have return successors, (187), 175 states have call predecessors, (187), 187 states have call successors, (187) [2022-04-28 06:07:18,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:07:18,475 INFO L93 Difference]: Finished difference Result 845 states and 1125 transitions. [2022-04-28 06:07:18,475 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1125 transitions. [2022-04-28 06:07:18,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:07:18,476 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:07:18,477 INFO L74 IsIncluded]: Start isIncluded. First operand has 834 states, 624 states have (on average 1.1826923076923077) internal successors, (738), 636 states have internal predecessors, (738), 189 states have call successors, (189), 22 states have call predecessors, (189), 20 states have return successors, (187), 175 states have call predecessors, (187), 187 states have call successors, (187) Second operand 845 states. [2022-04-28 06:07:18,477 INFO L87 Difference]: Start difference. First operand has 834 states, 624 states have (on average 1.1826923076923077) internal successors, (738), 636 states have internal predecessors, (738), 189 states have call successors, (189), 22 states have call predecessors, (189), 20 states have return successors, (187), 175 states have call predecessors, (187), 187 states have call successors, (187) Second operand 845 states. [2022-04-28 06:07:18,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:07:18,499 INFO L93 Difference]: Finished difference Result 845 states and 1125 transitions. [2022-04-28 06:07:18,499 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1125 transitions. [2022-04-28 06:07:18,500 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:07:18,500 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:07:18,500 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:07:18,500 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:07:18,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 834 states, 624 states have (on average 1.1826923076923077) internal successors, (738), 636 states have internal predecessors, (738), 189 states have call successors, (189), 22 states have call predecessors, (189), 20 states have return successors, (187), 175 states have call predecessors, (187), 187 states have call successors, (187) [2022-04-28 06:07:18,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 1114 transitions. [2022-04-28 06:07:18,530 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 1114 transitions. Word has length 153 [2022-04-28 06:07:18,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:07:18,530 INFO L495 AbstractCegarLoop]: Abstraction has 834 states and 1114 transitions. [2022-04-28 06:07:18,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.5) internal successors, (110), 19 states have internal predecessors, (110), 19 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 17 states have call predecessors, (19), 18 states have call successors, (19) [2022-04-28 06:07:18,530 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 834 states and 1114 transitions. [2022-04-28 06:07:32,154 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1114 edges. 1111 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-28 06:07:32,155 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1114 transitions. [2022-04-28 06:07:32,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-04-28 06:07:32,156 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:07:32,156 INFO L195 NwaCegarLoop]: trace histogram [17, 16, 16, 10, 9, 9, 9, 7, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:07:32,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Forceful destruction successful, exit code 0 [2022-04-28 06:07:32,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,54 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:07:32,357 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:07:32,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:07:32,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1196851319, now seen corresponding path program 23 times [2022-04-28 06:07:32,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:07:32,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [207365971] [2022-04-28 06:07:32,358 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 06:07:32,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1196851319, now seen corresponding path program 24 times [2022-04-28 06:07:32,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:07:32,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080247480] [2022-04-28 06:07:32,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:07:32,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:07:32,371 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:07:32,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1132834230] [2022-04-28 06:07:32,372 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 06:07:32,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:07:32,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:07:32,373 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:07:32,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2022-04-28 06:07:32,608 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-04-28 06:07:32,608 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:07:32,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-28 06:07:32,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:07:32,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:07:33,536 INFO L272 TraceCheckUtils]: 0: Hoare triple {156675#true} call ULTIMATE.init(); {156675#true} is VALID [2022-04-28 06:07:33,536 INFO L290 TraceCheckUtils]: 1: Hoare triple {156675#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {156683#(<= ~counter~0 0)} is VALID [2022-04-28 06:07:33,537 INFO L290 TraceCheckUtils]: 2: Hoare triple {156683#(<= ~counter~0 0)} assume true; {156683#(<= ~counter~0 0)} is VALID [2022-04-28 06:07:33,537 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {156683#(<= ~counter~0 0)} {156675#true} #102#return; {156683#(<= ~counter~0 0)} is VALID [2022-04-28 06:07:33,537 INFO L272 TraceCheckUtils]: 4: Hoare triple {156683#(<= ~counter~0 0)} call #t~ret9 := main(); {156683#(<= ~counter~0 0)} is VALID [2022-04-28 06:07:33,537 INFO L290 TraceCheckUtils]: 5: Hoare triple {156683#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {156683#(<= ~counter~0 0)} is VALID [2022-04-28 06:07:33,538 INFO L272 TraceCheckUtils]: 6: Hoare triple {156683#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {156683#(<= ~counter~0 0)} is VALID [2022-04-28 06:07:33,538 INFO L290 TraceCheckUtils]: 7: Hoare triple {156683#(<= ~counter~0 0)} ~cond := #in~cond; {156683#(<= ~counter~0 0)} is VALID [2022-04-28 06:07:33,538 INFO L290 TraceCheckUtils]: 8: Hoare triple {156683#(<= ~counter~0 0)} assume !(0 == ~cond); {156683#(<= ~counter~0 0)} is VALID [2022-04-28 06:07:33,539 INFO L290 TraceCheckUtils]: 9: Hoare triple {156683#(<= ~counter~0 0)} assume true; {156683#(<= ~counter~0 0)} is VALID [2022-04-28 06:07:33,539 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {156683#(<= ~counter~0 0)} {156683#(<= ~counter~0 0)} #90#return; {156683#(<= ~counter~0 0)} is VALID [2022-04-28 06:07:33,539 INFO L272 TraceCheckUtils]: 11: Hoare triple {156683#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {156683#(<= ~counter~0 0)} is VALID [2022-04-28 06:07:33,540 INFO L290 TraceCheckUtils]: 12: Hoare triple {156683#(<= ~counter~0 0)} ~cond := #in~cond; {156683#(<= ~counter~0 0)} is VALID [2022-04-28 06:07:33,540 INFO L290 TraceCheckUtils]: 13: Hoare triple {156683#(<= ~counter~0 0)} assume !(0 == ~cond); {156683#(<= ~counter~0 0)} is VALID [2022-04-28 06:07:33,540 INFO L290 TraceCheckUtils]: 14: Hoare triple {156683#(<= ~counter~0 0)} assume true; {156683#(<= ~counter~0 0)} is VALID [2022-04-28 06:07:33,541 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {156683#(<= ~counter~0 0)} {156683#(<= ~counter~0 0)} #92#return; {156683#(<= ~counter~0 0)} is VALID [2022-04-28 06:07:33,541 INFO L290 TraceCheckUtils]: 16: Hoare triple {156683#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {156683#(<= ~counter~0 0)} is VALID [2022-04-28 06:07:33,544 INFO L290 TraceCheckUtils]: 17: Hoare triple {156683#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {156732#(<= ~counter~0 1)} is VALID [2022-04-28 06:07:33,544 INFO L290 TraceCheckUtils]: 18: Hoare triple {156732#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {156732#(<= ~counter~0 1)} is VALID [2022-04-28 06:07:33,545 INFO L272 TraceCheckUtils]: 19: Hoare triple {156732#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {156732#(<= ~counter~0 1)} is VALID [2022-04-28 06:07:33,545 INFO L290 TraceCheckUtils]: 20: Hoare triple {156732#(<= ~counter~0 1)} ~cond := #in~cond; {156732#(<= ~counter~0 1)} is VALID [2022-04-28 06:07:33,545 INFO L290 TraceCheckUtils]: 21: Hoare triple {156732#(<= ~counter~0 1)} assume !(0 == ~cond); {156732#(<= ~counter~0 1)} is VALID [2022-04-28 06:07:33,546 INFO L290 TraceCheckUtils]: 22: Hoare triple {156732#(<= ~counter~0 1)} assume true; {156732#(<= ~counter~0 1)} is VALID [2022-04-28 06:07:33,546 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {156732#(<= ~counter~0 1)} {156732#(<= ~counter~0 1)} #94#return; {156732#(<= ~counter~0 1)} is VALID [2022-04-28 06:07:33,546 INFO L290 TraceCheckUtils]: 24: Hoare triple {156732#(<= ~counter~0 1)} assume !!(0 != ~r~0); {156732#(<= ~counter~0 1)} is VALID [2022-04-28 06:07:33,548 INFO L290 TraceCheckUtils]: 25: Hoare triple {156732#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {156757#(<= ~counter~0 2)} is VALID [2022-04-28 06:07:33,548 INFO L290 TraceCheckUtils]: 26: Hoare triple {156757#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {156757#(<= ~counter~0 2)} is VALID [2022-04-28 06:07:33,548 INFO L272 TraceCheckUtils]: 27: Hoare triple {156757#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {156757#(<= ~counter~0 2)} is VALID [2022-04-28 06:07:33,549 INFO L290 TraceCheckUtils]: 28: Hoare triple {156757#(<= ~counter~0 2)} ~cond := #in~cond; {156757#(<= ~counter~0 2)} is VALID [2022-04-28 06:07:33,549 INFO L290 TraceCheckUtils]: 29: Hoare triple {156757#(<= ~counter~0 2)} assume !(0 == ~cond); {156757#(<= ~counter~0 2)} is VALID [2022-04-28 06:07:33,549 INFO L290 TraceCheckUtils]: 30: Hoare triple {156757#(<= ~counter~0 2)} assume true; {156757#(<= ~counter~0 2)} is VALID [2022-04-28 06:07:33,550 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {156757#(<= ~counter~0 2)} {156757#(<= ~counter~0 2)} #96#return; {156757#(<= ~counter~0 2)} is VALID [2022-04-28 06:07:33,550 INFO L290 TraceCheckUtils]: 32: Hoare triple {156757#(<= ~counter~0 2)} assume !(~r~0 > 0); {156757#(<= ~counter~0 2)} is VALID [2022-04-28 06:07:33,551 INFO L290 TraceCheckUtils]: 33: Hoare triple {156757#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {156782#(<= ~counter~0 3)} is VALID [2022-04-28 06:07:33,551 INFO L290 TraceCheckUtils]: 34: Hoare triple {156782#(<= ~counter~0 3)} assume !!(#t~post8 < 20);havoc #t~post8; {156782#(<= ~counter~0 3)} is VALID [2022-04-28 06:07:33,552 INFO L272 TraceCheckUtils]: 35: Hoare triple {156782#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {156782#(<= ~counter~0 3)} is VALID [2022-04-28 06:07:33,552 INFO L290 TraceCheckUtils]: 36: Hoare triple {156782#(<= ~counter~0 3)} ~cond := #in~cond; {156782#(<= ~counter~0 3)} is VALID [2022-04-28 06:07:33,552 INFO L290 TraceCheckUtils]: 37: Hoare triple {156782#(<= ~counter~0 3)} assume !(0 == ~cond); {156782#(<= ~counter~0 3)} is VALID [2022-04-28 06:07:33,553 INFO L290 TraceCheckUtils]: 38: Hoare triple {156782#(<= ~counter~0 3)} assume true; {156782#(<= ~counter~0 3)} is VALID [2022-04-28 06:07:33,553 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {156782#(<= ~counter~0 3)} {156782#(<= ~counter~0 3)} #98#return; {156782#(<= ~counter~0 3)} is VALID [2022-04-28 06:07:33,553 INFO L290 TraceCheckUtils]: 40: Hoare triple {156782#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {156782#(<= ~counter~0 3)} is VALID [2022-04-28 06:07:33,555 INFO L290 TraceCheckUtils]: 41: Hoare triple {156782#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {156807#(<= ~counter~0 4)} is VALID [2022-04-28 06:07:33,555 INFO L290 TraceCheckUtils]: 42: Hoare triple {156807#(<= ~counter~0 4)} assume !!(#t~post8 < 20);havoc #t~post8; {156807#(<= ~counter~0 4)} is VALID [2022-04-28 06:07:33,555 INFO L272 TraceCheckUtils]: 43: Hoare triple {156807#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {156807#(<= ~counter~0 4)} is VALID [2022-04-28 06:07:33,556 INFO L290 TraceCheckUtils]: 44: Hoare triple {156807#(<= ~counter~0 4)} ~cond := #in~cond; {156807#(<= ~counter~0 4)} is VALID [2022-04-28 06:07:33,556 INFO L290 TraceCheckUtils]: 45: Hoare triple {156807#(<= ~counter~0 4)} assume !(0 == ~cond); {156807#(<= ~counter~0 4)} is VALID [2022-04-28 06:07:33,556 INFO L290 TraceCheckUtils]: 46: Hoare triple {156807#(<= ~counter~0 4)} assume true; {156807#(<= ~counter~0 4)} is VALID [2022-04-28 06:07:33,557 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {156807#(<= ~counter~0 4)} {156807#(<= ~counter~0 4)} #98#return; {156807#(<= ~counter~0 4)} is VALID [2022-04-28 06:07:33,557 INFO L290 TraceCheckUtils]: 48: Hoare triple {156807#(<= ~counter~0 4)} assume !(~r~0 < 0); {156807#(<= ~counter~0 4)} is VALID [2022-04-28 06:07:33,558 INFO L290 TraceCheckUtils]: 49: Hoare triple {156807#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {156832#(<= ~counter~0 5)} is VALID [2022-04-28 06:07:33,559 INFO L290 TraceCheckUtils]: 50: Hoare triple {156832#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {156832#(<= ~counter~0 5)} is VALID [2022-04-28 06:07:33,559 INFO L272 TraceCheckUtils]: 51: Hoare triple {156832#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {156832#(<= ~counter~0 5)} is VALID [2022-04-28 06:07:33,559 INFO L290 TraceCheckUtils]: 52: Hoare triple {156832#(<= ~counter~0 5)} ~cond := #in~cond; {156832#(<= ~counter~0 5)} is VALID [2022-04-28 06:07:33,560 INFO L290 TraceCheckUtils]: 53: Hoare triple {156832#(<= ~counter~0 5)} assume !(0 == ~cond); {156832#(<= ~counter~0 5)} is VALID [2022-04-28 06:07:33,560 INFO L290 TraceCheckUtils]: 54: Hoare triple {156832#(<= ~counter~0 5)} assume true; {156832#(<= ~counter~0 5)} is VALID [2022-04-28 06:07:33,560 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {156832#(<= ~counter~0 5)} {156832#(<= ~counter~0 5)} #94#return; {156832#(<= ~counter~0 5)} is VALID [2022-04-28 06:07:33,561 INFO L290 TraceCheckUtils]: 56: Hoare triple {156832#(<= ~counter~0 5)} assume !!(0 != ~r~0); {156832#(<= ~counter~0 5)} is VALID [2022-04-28 06:07:33,562 INFO L290 TraceCheckUtils]: 57: Hoare triple {156832#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {156857#(<= ~counter~0 6)} is VALID [2022-04-28 06:07:33,562 INFO L290 TraceCheckUtils]: 58: Hoare triple {156857#(<= ~counter~0 6)} assume !!(#t~post7 < 20);havoc #t~post7; {156857#(<= ~counter~0 6)} is VALID [2022-04-28 06:07:33,563 INFO L272 TraceCheckUtils]: 59: Hoare triple {156857#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {156857#(<= ~counter~0 6)} is VALID [2022-04-28 06:07:33,563 INFO L290 TraceCheckUtils]: 60: Hoare triple {156857#(<= ~counter~0 6)} ~cond := #in~cond; {156857#(<= ~counter~0 6)} is VALID [2022-04-28 06:07:33,563 INFO L290 TraceCheckUtils]: 61: Hoare triple {156857#(<= ~counter~0 6)} assume !(0 == ~cond); {156857#(<= ~counter~0 6)} is VALID [2022-04-28 06:07:33,563 INFO L290 TraceCheckUtils]: 62: Hoare triple {156857#(<= ~counter~0 6)} assume true; {156857#(<= ~counter~0 6)} is VALID [2022-04-28 06:07:33,564 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {156857#(<= ~counter~0 6)} {156857#(<= ~counter~0 6)} #96#return; {156857#(<= ~counter~0 6)} is VALID [2022-04-28 06:07:33,564 INFO L290 TraceCheckUtils]: 64: Hoare triple {156857#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {156857#(<= ~counter~0 6)} is VALID [2022-04-28 06:07:33,565 INFO L290 TraceCheckUtils]: 65: Hoare triple {156857#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {156882#(<= ~counter~0 7)} is VALID [2022-04-28 06:07:33,566 INFO L290 TraceCheckUtils]: 66: Hoare triple {156882#(<= ~counter~0 7)} assume !!(#t~post7 < 20);havoc #t~post7; {156882#(<= ~counter~0 7)} is VALID [2022-04-28 06:07:33,566 INFO L272 TraceCheckUtils]: 67: Hoare triple {156882#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {156882#(<= ~counter~0 7)} is VALID [2022-04-28 06:07:33,566 INFO L290 TraceCheckUtils]: 68: Hoare triple {156882#(<= ~counter~0 7)} ~cond := #in~cond; {156882#(<= ~counter~0 7)} is VALID [2022-04-28 06:07:33,567 INFO L290 TraceCheckUtils]: 69: Hoare triple {156882#(<= ~counter~0 7)} assume !(0 == ~cond); {156882#(<= ~counter~0 7)} is VALID [2022-04-28 06:07:33,567 INFO L290 TraceCheckUtils]: 70: Hoare triple {156882#(<= ~counter~0 7)} assume true; {156882#(<= ~counter~0 7)} is VALID [2022-04-28 06:07:33,567 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {156882#(<= ~counter~0 7)} {156882#(<= ~counter~0 7)} #96#return; {156882#(<= ~counter~0 7)} is VALID [2022-04-28 06:07:33,568 INFO L290 TraceCheckUtils]: 72: Hoare triple {156882#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {156882#(<= ~counter~0 7)} is VALID [2022-04-28 06:07:33,569 INFO L290 TraceCheckUtils]: 73: Hoare triple {156882#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {156907#(<= ~counter~0 8)} is VALID [2022-04-28 06:07:33,569 INFO L290 TraceCheckUtils]: 74: Hoare triple {156907#(<= ~counter~0 8)} assume !!(#t~post7 < 20);havoc #t~post7; {156907#(<= ~counter~0 8)} is VALID [2022-04-28 06:07:33,570 INFO L272 TraceCheckUtils]: 75: Hoare triple {156907#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {156907#(<= ~counter~0 8)} is VALID [2022-04-28 06:07:33,570 INFO L290 TraceCheckUtils]: 76: Hoare triple {156907#(<= ~counter~0 8)} ~cond := #in~cond; {156907#(<= ~counter~0 8)} is VALID [2022-04-28 06:07:33,570 INFO L290 TraceCheckUtils]: 77: Hoare triple {156907#(<= ~counter~0 8)} assume !(0 == ~cond); {156907#(<= ~counter~0 8)} is VALID [2022-04-28 06:07:33,571 INFO L290 TraceCheckUtils]: 78: Hoare triple {156907#(<= ~counter~0 8)} assume true; {156907#(<= ~counter~0 8)} is VALID [2022-04-28 06:07:33,571 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {156907#(<= ~counter~0 8)} {156907#(<= ~counter~0 8)} #96#return; {156907#(<= ~counter~0 8)} is VALID [2022-04-28 06:07:33,571 INFO L290 TraceCheckUtils]: 80: Hoare triple {156907#(<= ~counter~0 8)} assume !(~r~0 > 0); {156907#(<= ~counter~0 8)} is VALID [2022-04-28 06:07:33,573 INFO L290 TraceCheckUtils]: 81: Hoare triple {156907#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {156932#(<= ~counter~0 9)} is VALID [2022-04-28 06:07:33,573 INFO L290 TraceCheckUtils]: 82: Hoare triple {156932#(<= ~counter~0 9)} assume !!(#t~post8 < 20);havoc #t~post8; {156932#(<= ~counter~0 9)} is VALID [2022-04-28 06:07:33,573 INFO L272 TraceCheckUtils]: 83: Hoare triple {156932#(<= ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {156932#(<= ~counter~0 9)} is VALID [2022-04-28 06:07:33,574 INFO L290 TraceCheckUtils]: 84: Hoare triple {156932#(<= ~counter~0 9)} ~cond := #in~cond; {156932#(<= ~counter~0 9)} is VALID [2022-04-28 06:07:33,574 INFO L290 TraceCheckUtils]: 85: Hoare triple {156932#(<= ~counter~0 9)} assume !(0 == ~cond); {156932#(<= ~counter~0 9)} is VALID [2022-04-28 06:07:33,574 INFO L290 TraceCheckUtils]: 86: Hoare triple {156932#(<= ~counter~0 9)} assume true; {156932#(<= ~counter~0 9)} is VALID [2022-04-28 06:07:33,575 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {156932#(<= ~counter~0 9)} {156932#(<= ~counter~0 9)} #98#return; {156932#(<= ~counter~0 9)} is VALID [2022-04-28 06:07:33,575 INFO L290 TraceCheckUtils]: 88: Hoare triple {156932#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {156932#(<= ~counter~0 9)} is VALID [2022-04-28 06:07:33,576 INFO L290 TraceCheckUtils]: 89: Hoare triple {156932#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {156957#(<= ~counter~0 10)} is VALID [2022-04-28 06:07:33,576 INFO L290 TraceCheckUtils]: 90: Hoare triple {156957#(<= ~counter~0 10)} assume !!(#t~post8 < 20);havoc #t~post8; {156957#(<= ~counter~0 10)} is VALID [2022-04-28 06:07:33,577 INFO L272 TraceCheckUtils]: 91: Hoare triple {156957#(<= ~counter~0 10)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {156957#(<= ~counter~0 10)} is VALID [2022-04-28 06:07:33,577 INFO L290 TraceCheckUtils]: 92: Hoare triple {156957#(<= ~counter~0 10)} ~cond := #in~cond; {156957#(<= ~counter~0 10)} is VALID [2022-04-28 06:07:33,577 INFO L290 TraceCheckUtils]: 93: Hoare triple {156957#(<= ~counter~0 10)} assume !(0 == ~cond); {156957#(<= ~counter~0 10)} is VALID [2022-04-28 06:07:33,578 INFO L290 TraceCheckUtils]: 94: Hoare triple {156957#(<= ~counter~0 10)} assume true; {156957#(<= ~counter~0 10)} is VALID [2022-04-28 06:07:33,578 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {156957#(<= ~counter~0 10)} {156957#(<= ~counter~0 10)} #98#return; {156957#(<= ~counter~0 10)} is VALID [2022-04-28 06:07:33,578 INFO L290 TraceCheckUtils]: 96: Hoare triple {156957#(<= ~counter~0 10)} assume !(~r~0 < 0); {156957#(<= ~counter~0 10)} is VALID [2022-04-28 06:07:33,580 INFO L290 TraceCheckUtils]: 97: Hoare triple {156957#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {156982#(<= ~counter~0 11)} is VALID [2022-04-28 06:07:33,580 INFO L290 TraceCheckUtils]: 98: Hoare triple {156982#(<= ~counter~0 11)} assume !!(#t~post6 < 20);havoc #t~post6; {156982#(<= ~counter~0 11)} is VALID [2022-04-28 06:07:33,581 INFO L272 TraceCheckUtils]: 99: Hoare triple {156982#(<= ~counter~0 11)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {156982#(<= ~counter~0 11)} is VALID [2022-04-28 06:07:33,581 INFO L290 TraceCheckUtils]: 100: Hoare triple {156982#(<= ~counter~0 11)} ~cond := #in~cond; {156982#(<= ~counter~0 11)} is VALID [2022-04-28 06:07:33,581 INFO L290 TraceCheckUtils]: 101: Hoare triple {156982#(<= ~counter~0 11)} assume !(0 == ~cond); {156982#(<= ~counter~0 11)} is VALID [2022-04-28 06:07:33,581 INFO L290 TraceCheckUtils]: 102: Hoare triple {156982#(<= ~counter~0 11)} assume true; {156982#(<= ~counter~0 11)} is VALID [2022-04-28 06:07:33,582 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {156982#(<= ~counter~0 11)} {156982#(<= ~counter~0 11)} #94#return; {156982#(<= ~counter~0 11)} is VALID [2022-04-28 06:07:33,582 INFO L290 TraceCheckUtils]: 104: Hoare triple {156982#(<= ~counter~0 11)} assume !!(0 != ~r~0); {156982#(<= ~counter~0 11)} is VALID [2022-04-28 06:07:33,583 INFO L290 TraceCheckUtils]: 105: Hoare triple {156982#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {157007#(<= ~counter~0 12)} is VALID [2022-04-28 06:07:33,584 INFO L290 TraceCheckUtils]: 106: Hoare triple {157007#(<= ~counter~0 12)} assume !!(#t~post7 < 20);havoc #t~post7; {157007#(<= ~counter~0 12)} is VALID [2022-04-28 06:07:33,584 INFO L272 TraceCheckUtils]: 107: Hoare triple {157007#(<= ~counter~0 12)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {157007#(<= ~counter~0 12)} is VALID [2022-04-28 06:07:33,584 INFO L290 TraceCheckUtils]: 108: Hoare triple {157007#(<= ~counter~0 12)} ~cond := #in~cond; {157007#(<= ~counter~0 12)} is VALID [2022-04-28 06:07:33,585 INFO L290 TraceCheckUtils]: 109: Hoare triple {157007#(<= ~counter~0 12)} assume !(0 == ~cond); {157007#(<= ~counter~0 12)} is VALID [2022-04-28 06:07:33,585 INFO L290 TraceCheckUtils]: 110: Hoare triple {157007#(<= ~counter~0 12)} assume true; {157007#(<= ~counter~0 12)} is VALID [2022-04-28 06:07:33,585 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {157007#(<= ~counter~0 12)} {157007#(<= ~counter~0 12)} #96#return; {157007#(<= ~counter~0 12)} is VALID [2022-04-28 06:07:33,586 INFO L290 TraceCheckUtils]: 112: Hoare triple {157007#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {157007#(<= ~counter~0 12)} is VALID [2022-04-28 06:07:33,587 INFO L290 TraceCheckUtils]: 113: Hoare triple {157007#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {157032#(<= ~counter~0 13)} is VALID [2022-04-28 06:07:33,587 INFO L290 TraceCheckUtils]: 114: Hoare triple {157032#(<= ~counter~0 13)} assume !!(#t~post7 < 20);havoc #t~post7; {157032#(<= ~counter~0 13)} is VALID [2022-04-28 06:07:33,588 INFO L272 TraceCheckUtils]: 115: Hoare triple {157032#(<= ~counter~0 13)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {157032#(<= ~counter~0 13)} is VALID [2022-04-28 06:07:33,588 INFO L290 TraceCheckUtils]: 116: Hoare triple {157032#(<= ~counter~0 13)} ~cond := #in~cond; {157032#(<= ~counter~0 13)} is VALID [2022-04-28 06:07:33,588 INFO L290 TraceCheckUtils]: 117: Hoare triple {157032#(<= ~counter~0 13)} assume !(0 == ~cond); {157032#(<= ~counter~0 13)} is VALID [2022-04-28 06:07:33,588 INFO L290 TraceCheckUtils]: 118: Hoare triple {157032#(<= ~counter~0 13)} assume true; {157032#(<= ~counter~0 13)} is VALID [2022-04-28 06:07:33,589 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {157032#(<= ~counter~0 13)} {157032#(<= ~counter~0 13)} #96#return; {157032#(<= ~counter~0 13)} is VALID [2022-04-28 06:07:33,589 INFO L290 TraceCheckUtils]: 120: Hoare triple {157032#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {157032#(<= ~counter~0 13)} is VALID [2022-04-28 06:07:33,590 INFO L290 TraceCheckUtils]: 121: Hoare triple {157032#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {157057#(<= ~counter~0 14)} is VALID [2022-04-28 06:07:33,591 INFO L290 TraceCheckUtils]: 122: Hoare triple {157057#(<= ~counter~0 14)} assume !!(#t~post7 < 20);havoc #t~post7; {157057#(<= ~counter~0 14)} is VALID [2022-04-28 06:07:33,591 INFO L272 TraceCheckUtils]: 123: Hoare triple {157057#(<= ~counter~0 14)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {157057#(<= ~counter~0 14)} is VALID [2022-04-28 06:07:33,591 INFO L290 TraceCheckUtils]: 124: Hoare triple {157057#(<= ~counter~0 14)} ~cond := #in~cond; {157057#(<= ~counter~0 14)} is VALID [2022-04-28 06:07:33,592 INFO L290 TraceCheckUtils]: 125: Hoare triple {157057#(<= ~counter~0 14)} assume !(0 == ~cond); {157057#(<= ~counter~0 14)} is VALID [2022-04-28 06:07:33,592 INFO L290 TraceCheckUtils]: 126: Hoare triple {157057#(<= ~counter~0 14)} assume true; {157057#(<= ~counter~0 14)} is VALID [2022-04-28 06:07:33,592 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {157057#(<= ~counter~0 14)} {157057#(<= ~counter~0 14)} #96#return; {157057#(<= ~counter~0 14)} is VALID [2022-04-28 06:07:33,593 INFO L290 TraceCheckUtils]: 128: Hoare triple {157057#(<= ~counter~0 14)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {157057#(<= ~counter~0 14)} is VALID [2022-04-28 06:07:33,594 INFO L290 TraceCheckUtils]: 129: Hoare triple {157057#(<= ~counter~0 14)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {157082#(<= ~counter~0 15)} is VALID [2022-04-28 06:07:33,594 INFO L290 TraceCheckUtils]: 130: Hoare triple {157082#(<= ~counter~0 15)} assume !!(#t~post7 < 20);havoc #t~post7; {157082#(<= ~counter~0 15)} is VALID [2022-04-28 06:07:33,595 INFO L272 TraceCheckUtils]: 131: Hoare triple {157082#(<= ~counter~0 15)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {157082#(<= ~counter~0 15)} is VALID [2022-04-28 06:07:33,595 INFO L290 TraceCheckUtils]: 132: Hoare triple {157082#(<= ~counter~0 15)} ~cond := #in~cond; {157082#(<= ~counter~0 15)} is VALID [2022-04-28 06:07:33,595 INFO L290 TraceCheckUtils]: 133: Hoare triple {157082#(<= ~counter~0 15)} assume !(0 == ~cond); {157082#(<= ~counter~0 15)} is VALID [2022-04-28 06:07:33,596 INFO L290 TraceCheckUtils]: 134: Hoare triple {157082#(<= ~counter~0 15)} assume true; {157082#(<= ~counter~0 15)} is VALID [2022-04-28 06:07:33,596 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {157082#(<= ~counter~0 15)} {157082#(<= ~counter~0 15)} #96#return; {157082#(<= ~counter~0 15)} is VALID [2022-04-28 06:07:33,596 INFO L290 TraceCheckUtils]: 136: Hoare triple {157082#(<= ~counter~0 15)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {157082#(<= ~counter~0 15)} is VALID [2022-04-28 06:07:33,598 INFO L290 TraceCheckUtils]: 137: Hoare triple {157082#(<= ~counter~0 15)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {157107#(<= ~counter~0 16)} is VALID [2022-04-28 06:07:33,598 INFO L290 TraceCheckUtils]: 138: Hoare triple {157107#(<= ~counter~0 16)} assume !!(#t~post7 < 20);havoc #t~post7; {157107#(<= ~counter~0 16)} is VALID [2022-04-28 06:07:33,598 INFO L272 TraceCheckUtils]: 139: Hoare triple {157107#(<= ~counter~0 16)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {157107#(<= ~counter~0 16)} is VALID [2022-04-28 06:07:33,599 INFO L290 TraceCheckUtils]: 140: Hoare triple {157107#(<= ~counter~0 16)} ~cond := #in~cond; {157107#(<= ~counter~0 16)} is VALID [2022-04-28 06:07:33,599 INFO L290 TraceCheckUtils]: 141: Hoare triple {157107#(<= ~counter~0 16)} assume !(0 == ~cond); {157107#(<= ~counter~0 16)} is VALID [2022-04-28 06:07:33,599 INFO L290 TraceCheckUtils]: 142: Hoare triple {157107#(<= ~counter~0 16)} assume true; {157107#(<= ~counter~0 16)} is VALID [2022-04-28 06:07:33,600 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {157107#(<= ~counter~0 16)} {157107#(<= ~counter~0 16)} #96#return; {157107#(<= ~counter~0 16)} is VALID [2022-04-28 06:07:33,600 INFO L290 TraceCheckUtils]: 144: Hoare triple {157107#(<= ~counter~0 16)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {157107#(<= ~counter~0 16)} is VALID [2022-04-28 06:07:33,600 INFO L290 TraceCheckUtils]: 145: Hoare triple {157107#(<= ~counter~0 16)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {157132#(<= |main_#t~post7| 16)} is VALID [2022-04-28 06:07:33,601 INFO L290 TraceCheckUtils]: 146: Hoare triple {157132#(<= |main_#t~post7| 16)} assume !(#t~post7 < 20);havoc #t~post7; {156676#false} is VALID [2022-04-28 06:07:33,601 INFO L290 TraceCheckUtils]: 147: Hoare triple {156676#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {156676#false} is VALID [2022-04-28 06:07:33,601 INFO L290 TraceCheckUtils]: 148: Hoare triple {156676#false} assume !(#t~post8 < 20);havoc #t~post8; {156676#false} is VALID [2022-04-28 06:07:33,601 INFO L290 TraceCheckUtils]: 149: Hoare triple {156676#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {156676#false} is VALID [2022-04-28 06:07:33,601 INFO L290 TraceCheckUtils]: 150: Hoare triple {156676#false} assume !(#t~post6 < 20);havoc #t~post6; {156676#false} is VALID [2022-04-28 06:07:33,601 INFO L272 TraceCheckUtils]: 151: Hoare triple {156676#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {156676#false} is VALID [2022-04-28 06:07:33,601 INFO L290 TraceCheckUtils]: 152: Hoare triple {156676#false} ~cond := #in~cond; {156676#false} is VALID [2022-04-28 06:07:33,601 INFO L290 TraceCheckUtils]: 153: Hoare triple {156676#false} assume 0 == ~cond; {156676#false} is VALID [2022-04-28 06:07:33,601 INFO L290 TraceCheckUtils]: 154: Hoare triple {156676#false} assume !false; {156676#false} is VALID [2022-04-28 06:07:33,602 INFO L134 CoverageAnalysis]: Checked inductivity of 728 backedges. 46 proven. 678 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 06:07:33,602 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 06:07:34,366 INFO L290 TraceCheckUtils]: 154: Hoare triple {156676#false} assume !false; {156676#false} is VALID [2022-04-28 06:07:34,366 INFO L290 TraceCheckUtils]: 153: Hoare triple {156676#false} assume 0 == ~cond; {156676#false} is VALID [2022-04-28 06:07:34,367 INFO L290 TraceCheckUtils]: 152: Hoare triple {156676#false} ~cond := #in~cond; {156676#false} is VALID [2022-04-28 06:07:34,367 INFO L272 TraceCheckUtils]: 151: Hoare triple {156676#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {156676#false} is VALID [2022-04-28 06:07:34,367 INFO L290 TraceCheckUtils]: 150: Hoare triple {156676#false} assume !(#t~post6 < 20);havoc #t~post6; {156676#false} is VALID [2022-04-28 06:07:34,367 INFO L290 TraceCheckUtils]: 149: Hoare triple {156676#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {156676#false} is VALID [2022-04-28 06:07:34,367 INFO L290 TraceCheckUtils]: 148: Hoare triple {156676#false} assume !(#t~post8 < 20);havoc #t~post8; {156676#false} is VALID [2022-04-28 06:07:34,367 INFO L290 TraceCheckUtils]: 147: Hoare triple {156676#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {156676#false} is VALID [2022-04-28 06:07:34,367 INFO L290 TraceCheckUtils]: 146: Hoare triple {157184#(< |main_#t~post7| 20)} assume !(#t~post7 < 20);havoc #t~post7; {156676#false} is VALID [2022-04-28 06:07:34,367 INFO L290 TraceCheckUtils]: 145: Hoare triple {157188#(< ~counter~0 20)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {157184#(< |main_#t~post7| 20)} is VALID [2022-04-28 06:07:34,368 INFO L290 TraceCheckUtils]: 144: Hoare triple {157188#(< ~counter~0 20)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {157188#(< ~counter~0 20)} is VALID [2022-04-28 06:07:34,368 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {156675#true} {157188#(< ~counter~0 20)} #96#return; {157188#(< ~counter~0 20)} is VALID [2022-04-28 06:07:34,368 INFO L290 TraceCheckUtils]: 142: Hoare triple {156675#true} assume true; {156675#true} is VALID [2022-04-28 06:07:34,368 INFO L290 TraceCheckUtils]: 141: Hoare triple {156675#true} assume !(0 == ~cond); {156675#true} is VALID [2022-04-28 06:07:34,368 INFO L290 TraceCheckUtils]: 140: Hoare triple {156675#true} ~cond := #in~cond; {156675#true} is VALID [2022-04-28 06:07:34,368 INFO L272 TraceCheckUtils]: 139: Hoare triple {157188#(< ~counter~0 20)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {156675#true} is VALID [2022-04-28 06:07:34,369 INFO L290 TraceCheckUtils]: 138: Hoare triple {157188#(< ~counter~0 20)} assume !!(#t~post7 < 20);havoc #t~post7; {157188#(< ~counter~0 20)} is VALID [2022-04-28 06:07:34,372 INFO L290 TraceCheckUtils]: 137: Hoare triple {157213#(< ~counter~0 19)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {157188#(< ~counter~0 20)} is VALID [2022-04-28 06:07:34,372 INFO L290 TraceCheckUtils]: 136: Hoare triple {157213#(< ~counter~0 19)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {157213#(< ~counter~0 19)} is VALID [2022-04-28 06:07:34,373 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {156675#true} {157213#(< ~counter~0 19)} #96#return; {157213#(< ~counter~0 19)} is VALID [2022-04-28 06:07:34,373 INFO L290 TraceCheckUtils]: 134: Hoare triple {156675#true} assume true; {156675#true} is VALID [2022-04-28 06:07:34,373 INFO L290 TraceCheckUtils]: 133: Hoare triple {156675#true} assume !(0 == ~cond); {156675#true} is VALID [2022-04-28 06:07:34,373 INFO L290 TraceCheckUtils]: 132: Hoare triple {156675#true} ~cond := #in~cond; {156675#true} is VALID [2022-04-28 06:07:34,373 INFO L272 TraceCheckUtils]: 131: Hoare triple {157213#(< ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {156675#true} is VALID [2022-04-28 06:07:34,373 INFO L290 TraceCheckUtils]: 130: Hoare triple {157213#(< ~counter~0 19)} assume !!(#t~post7 < 20);havoc #t~post7; {157213#(< ~counter~0 19)} is VALID [2022-04-28 06:07:34,374 INFO L290 TraceCheckUtils]: 129: Hoare triple {157238#(< ~counter~0 18)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {157213#(< ~counter~0 19)} is VALID [2022-04-28 06:07:34,375 INFO L290 TraceCheckUtils]: 128: Hoare triple {157238#(< ~counter~0 18)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {157238#(< ~counter~0 18)} is VALID [2022-04-28 06:07:34,375 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {156675#true} {157238#(< ~counter~0 18)} #96#return; {157238#(< ~counter~0 18)} is VALID [2022-04-28 06:07:34,375 INFO L290 TraceCheckUtils]: 126: Hoare triple {156675#true} assume true; {156675#true} is VALID [2022-04-28 06:07:34,375 INFO L290 TraceCheckUtils]: 125: Hoare triple {156675#true} assume !(0 == ~cond); {156675#true} is VALID [2022-04-28 06:07:34,375 INFO L290 TraceCheckUtils]: 124: Hoare triple {156675#true} ~cond := #in~cond; {156675#true} is VALID [2022-04-28 06:07:34,375 INFO L272 TraceCheckUtils]: 123: Hoare triple {157238#(< ~counter~0 18)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {156675#true} is VALID [2022-04-28 06:07:34,376 INFO L290 TraceCheckUtils]: 122: Hoare triple {157238#(< ~counter~0 18)} assume !!(#t~post7 < 20);havoc #t~post7; {157238#(< ~counter~0 18)} is VALID [2022-04-28 06:07:34,377 INFO L290 TraceCheckUtils]: 121: Hoare triple {157107#(<= ~counter~0 16)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {157238#(< ~counter~0 18)} is VALID [2022-04-28 06:07:34,377 INFO L290 TraceCheckUtils]: 120: Hoare triple {157107#(<= ~counter~0 16)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {157107#(<= ~counter~0 16)} is VALID [2022-04-28 06:07:34,378 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {156675#true} {157107#(<= ~counter~0 16)} #96#return; {157107#(<= ~counter~0 16)} is VALID [2022-04-28 06:07:34,378 INFO L290 TraceCheckUtils]: 118: Hoare triple {156675#true} assume true; {156675#true} is VALID [2022-04-28 06:07:34,378 INFO L290 TraceCheckUtils]: 117: Hoare triple {156675#true} assume !(0 == ~cond); {156675#true} is VALID [2022-04-28 06:07:34,378 INFO L290 TraceCheckUtils]: 116: Hoare triple {156675#true} ~cond := #in~cond; {156675#true} is VALID [2022-04-28 06:07:34,378 INFO L272 TraceCheckUtils]: 115: Hoare triple {157107#(<= ~counter~0 16)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {156675#true} is VALID [2022-04-28 06:07:34,378 INFO L290 TraceCheckUtils]: 114: Hoare triple {157107#(<= ~counter~0 16)} assume !!(#t~post7 < 20);havoc #t~post7; {157107#(<= ~counter~0 16)} is VALID [2022-04-28 06:07:34,379 INFO L290 TraceCheckUtils]: 113: Hoare triple {157082#(<= ~counter~0 15)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {157107#(<= ~counter~0 16)} is VALID [2022-04-28 06:07:34,380 INFO L290 TraceCheckUtils]: 112: Hoare triple {157082#(<= ~counter~0 15)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {157082#(<= ~counter~0 15)} is VALID [2022-04-28 06:07:34,380 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {156675#true} {157082#(<= ~counter~0 15)} #96#return; {157082#(<= ~counter~0 15)} is VALID [2022-04-28 06:07:34,380 INFO L290 TraceCheckUtils]: 110: Hoare triple {156675#true} assume true; {156675#true} is VALID [2022-04-28 06:07:34,380 INFO L290 TraceCheckUtils]: 109: Hoare triple {156675#true} assume !(0 == ~cond); {156675#true} is VALID [2022-04-28 06:07:34,380 INFO L290 TraceCheckUtils]: 108: Hoare triple {156675#true} ~cond := #in~cond; {156675#true} is VALID [2022-04-28 06:07:34,380 INFO L272 TraceCheckUtils]: 107: Hoare triple {157082#(<= ~counter~0 15)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {156675#true} is VALID [2022-04-28 06:07:34,380 INFO L290 TraceCheckUtils]: 106: Hoare triple {157082#(<= ~counter~0 15)} assume !!(#t~post7 < 20);havoc #t~post7; {157082#(<= ~counter~0 15)} is VALID [2022-04-28 06:07:34,382 INFO L290 TraceCheckUtils]: 105: Hoare triple {157057#(<= ~counter~0 14)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {157082#(<= ~counter~0 15)} is VALID [2022-04-28 06:07:34,382 INFO L290 TraceCheckUtils]: 104: Hoare triple {157057#(<= ~counter~0 14)} assume !!(0 != ~r~0); {157057#(<= ~counter~0 14)} is VALID [2022-04-28 06:07:34,382 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {156675#true} {157057#(<= ~counter~0 14)} #94#return; {157057#(<= ~counter~0 14)} is VALID [2022-04-28 06:07:34,383 INFO L290 TraceCheckUtils]: 102: Hoare triple {156675#true} assume true; {156675#true} is VALID [2022-04-28 06:07:34,383 INFO L290 TraceCheckUtils]: 101: Hoare triple {156675#true} assume !(0 == ~cond); {156675#true} is VALID [2022-04-28 06:07:34,383 INFO L290 TraceCheckUtils]: 100: Hoare triple {156675#true} ~cond := #in~cond; {156675#true} is VALID [2022-04-28 06:07:34,383 INFO L272 TraceCheckUtils]: 99: Hoare triple {157057#(<= ~counter~0 14)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {156675#true} is VALID [2022-04-28 06:07:34,383 INFO L290 TraceCheckUtils]: 98: Hoare triple {157057#(<= ~counter~0 14)} assume !!(#t~post6 < 20);havoc #t~post6; {157057#(<= ~counter~0 14)} is VALID [2022-04-28 06:07:34,384 INFO L290 TraceCheckUtils]: 97: Hoare triple {157032#(<= ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {157057#(<= ~counter~0 14)} is VALID [2022-04-28 06:07:34,384 INFO L290 TraceCheckUtils]: 96: Hoare triple {157032#(<= ~counter~0 13)} assume !(~r~0 < 0); {157032#(<= ~counter~0 13)} is VALID [2022-04-28 06:07:34,385 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {156675#true} {157032#(<= ~counter~0 13)} #98#return; {157032#(<= ~counter~0 13)} is VALID [2022-04-28 06:07:34,385 INFO L290 TraceCheckUtils]: 94: Hoare triple {156675#true} assume true; {156675#true} is VALID [2022-04-28 06:07:34,385 INFO L290 TraceCheckUtils]: 93: Hoare triple {156675#true} assume !(0 == ~cond); {156675#true} is VALID [2022-04-28 06:07:34,385 INFO L290 TraceCheckUtils]: 92: Hoare triple {156675#true} ~cond := #in~cond; {156675#true} is VALID [2022-04-28 06:07:34,385 INFO L272 TraceCheckUtils]: 91: Hoare triple {157032#(<= ~counter~0 13)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {156675#true} is VALID [2022-04-28 06:07:34,385 INFO L290 TraceCheckUtils]: 90: Hoare triple {157032#(<= ~counter~0 13)} assume !!(#t~post8 < 20);havoc #t~post8; {157032#(<= ~counter~0 13)} is VALID [2022-04-28 06:07:34,387 INFO L290 TraceCheckUtils]: 89: Hoare triple {157007#(<= ~counter~0 12)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {157032#(<= ~counter~0 13)} is VALID [2022-04-28 06:07:34,387 INFO L290 TraceCheckUtils]: 88: Hoare triple {157007#(<= ~counter~0 12)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {157007#(<= ~counter~0 12)} is VALID [2022-04-28 06:07:34,387 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {156675#true} {157007#(<= ~counter~0 12)} #98#return; {157007#(<= ~counter~0 12)} is VALID [2022-04-28 06:07:34,387 INFO L290 TraceCheckUtils]: 86: Hoare triple {156675#true} assume true; {156675#true} is VALID [2022-04-28 06:07:34,388 INFO L290 TraceCheckUtils]: 85: Hoare triple {156675#true} assume !(0 == ~cond); {156675#true} is VALID [2022-04-28 06:07:34,388 INFO L290 TraceCheckUtils]: 84: Hoare triple {156675#true} ~cond := #in~cond; {156675#true} is VALID [2022-04-28 06:07:34,388 INFO L272 TraceCheckUtils]: 83: Hoare triple {157007#(<= ~counter~0 12)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {156675#true} is VALID [2022-04-28 06:07:34,388 INFO L290 TraceCheckUtils]: 82: Hoare triple {157007#(<= ~counter~0 12)} assume !!(#t~post8 < 20);havoc #t~post8; {157007#(<= ~counter~0 12)} is VALID [2022-04-28 06:07:34,389 INFO L290 TraceCheckUtils]: 81: Hoare triple {156982#(<= ~counter~0 11)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {157007#(<= ~counter~0 12)} is VALID [2022-04-28 06:07:34,389 INFO L290 TraceCheckUtils]: 80: Hoare triple {156982#(<= ~counter~0 11)} assume !(~r~0 > 0); {156982#(<= ~counter~0 11)} is VALID [2022-04-28 06:07:34,390 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {156675#true} {156982#(<= ~counter~0 11)} #96#return; {156982#(<= ~counter~0 11)} is VALID [2022-04-28 06:07:34,390 INFO L290 TraceCheckUtils]: 78: Hoare triple {156675#true} assume true; {156675#true} is VALID [2022-04-28 06:07:34,390 INFO L290 TraceCheckUtils]: 77: Hoare triple {156675#true} assume !(0 == ~cond); {156675#true} is VALID [2022-04-28 06:07:34,390 INFO L290 TraceCheckUtils]: 76: Hoare triple {156675#true} ~cond := #in~cond; {156675#true} is VALID [2022-04-28 06:07:34,390 INFO L272 TraceCheckUtils]: 75: Hoare triple {156982#(<= ~counter~0 11)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {156675#true} is VALID [2022-04-28 06:07:34,390 INFO L290 TraceCheckUtils]: 74: Hoare triple {156982#(<= ~counter~0 11)} assume !!(#t~post7 < 20);havoc #t~post7; {156982#(<= ~counter~0 11)} is VALID [2022-04-28 06:07:34,392 INFO L290 TraceCheckUtils]: 73: Hoare triple {156957#(<= ~counter~0 10)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {156982#(<= ~counter~0 11)} is VALID [2022-04-28 06:07:34,392 INFO L290 TraceCheckUtils]: 72: Hoare triple {156957#(<= ~counter~0 10)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {156957#(<= ~counter~0 10)} is VALID [2022-04-28 06:07:34,392 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {156675#true} {156957#(<= ~counter~0 10)} #96#return; {156957#(<= ~counter~0 10)} is VALID [2022-04-28 06:07:34,392 INFO L290 TraceCheckUtils]: 70: Hoare triple {156675#true} assume true; {156675#true} is VALID [2022-04-28 06:07:34,393 INFO L290 TraceCheckUtils]: 69: Hoare triple {156675#true} assume !(0 == ~cond); {156675#true} is VALID [2022-04-28 06:07:34,393 INFO L290 TraceCheckUtils]: 68: Hoare triple {156675#true} ~cond := #in~cond; {156675#true} is VALID [2022-04-28 06:07:34,393 INFO L272 TraceCheckUtils]: 67: Hoare triple {156957#(<= ~counter~0 10)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {156675#true} is VALID [2022-04-28 06:07:34,393 INFO L290 TraceCheckUtils]: 66: Hoare triple {156957#(<= ~counter~0 10)} assume !!(#t~post7 < 20);havoc #t~post7; {156957#(<= ~counter~0 10)} is VALID [2022-04-28 06:07:34,394 INFO L290 TraceCheckUtils]: 65: Hoare triple {156932#(<= ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {156957#(<= ~counter~0 10)} is VALID [2022-04-28 06:07:34,394 INFO L290 TraceCheckUtils]: 64: Hoare triple {156932#(<= ~counter~0 9)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {156932#(<= ~counter~0 9)} is VALID [2022-04-28 06:07:34,395 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {156675#true} {156932#(<= ~counter~0 9)} #96#return; {156932#(<= ~counter~0 9)} is VALID [2022-04-28 06:07:34,395 INFO L290 TraceCheckUtils]: 62: Hoare triple {156675#true} assume true; {156675#true} is VALID [2022-04-28 06:07:34,395 INFO L290 TraceCheckUtils]: 61: Hoare triple {156675#true} assume !(0 == ~cond); {156675#true} is VALID [2022-04-28 06:07:34,395 INFO L290 TraceCheckUtils]: 60: Hoare triple {156675#true} ~cond := #in~cond; {156675#true} is VALID [2022-04-28 06:07:34,395 INFO L272 TraceCheckUtils]: 59: Hoare triple {156932#(<= ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {156675#true} is VALID [2022-04-28 06:07:34,395 INFO L290 TraceCheckUtils]: 58: Hoare triple {156932#(<= ~counter~0 9)} assume !!(#t~post7 < 20);havoc #t~post7; {156932#(<= ~counter~0 9)} is VALID [2022-04-28 06:07:34,397 INFO L290 TraceCheckUtils]: 57: Hoare triple {156907#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {156932#(<= ~counter~0 9)} is VALID [2022-04-28 06:07:34,397 INFO L290 TraceCheckUtils]: 56: Hoare triple {156907#(<= ~counter~0 8)} assume !!(0 != ~r~0); {156907#(<= ~counter~0 8)} is VALID [2022-04-28 06:07:34,397 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {156675#true} {156907#(<= ~counter~0 8)} #94#return; {156907#(<= ~counter~0 8)} is VALID [2022-04-28 06:07:34,397 INFO L290 TraceCheckUtils]: 54: Hoare triple {156675#true} assume true; {156675#true} is VALID [2022-04-28 06:07:34,397 INFO L290 TraceCheckUtils]: 53: Hoare triple {156675#true} assume !(0 == ~cond); {156675#true} is VALID [2022-04-28 06:07:34,398 INFO L290 TraceCheckUtils]: 52: Hoare triple {156675#true} ~cond := #in~cond; {156675#true} is VALID [2022-04-28 06:07:34,398 INFO L272 TraceCheckUtils]: 51: Hoare triple {156907#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {156675#true} is VALID [2022-04-28 06:07:34,398 INFO L290 TraceCheckUtils]: 50: Hoare triple {156907#(<= ~counter~0 8)} assume !!(#t~post6 < 20);havoc #t~post6; {156907#(<= ~counter~0 8)} is VALID [2022-04-28 06:07:34,399 INFO L290 TraceCheckUtils]: 49: Hoare triple {156882#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {156907#(<= ~counter~0 8)} is VALID [2022-04-28 06:07:34,399 INFO L290 TraceCheckUtils]: 48: Hoare triple {156882#(<= ~counter~0 7)} assume !(~r~0 < 0); {156882#(<= ~counter~0 7)} is VALID [2022-04-28 06:07:34,400 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {156675#true} {156882#(<= ~counter~0 7)} #98#return; {156882#(<= ~counter~0 7)} is VALID [2022-04-28 06:07:34,400 INFO L290 TraceCheckUtils]: 46: Hoare triple {156675#true} assume true; {156675#true} is VALID [2022-04-28 06:07:34,400 INFO L290 TraceCheckUtils]: 45: Hoare triple {156675#true} assume !(0 == ~cond); {156675#true} is VALID [2022-04-28 06:07:34,400 INFO L290 TraceCheckUtils]: 44: Hoare triple {156675#true} ~cond := #in~cond; {156675#true} is VALID [2022-04-28 06:07:34,400 INFO L272 TraceCheckUtils]: 43: Hoare triple {156882#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {156675#true} is VALID [2022-04-28 06:07:34,400 INFO L290 TraceCheckUtils]: 42: Hoare triple {156882#(<= ~counter~0 7)} assume !!(#t~post8 < 20);havoc #t~post8; {156882#(<= ~counter~0 7)} is VALID [2022-04-28 06:07:34,402 INFO L290 TraceCheckUtils]: 41: Hoare triple {156857#(<= ~counter~0 6)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {156882#(<= ~counter~0 7)} is VALID [2022-04-28 06:07:34,402 INFO L290 TraceCheckUtils]: 40: Hoare triple {156857#(<= ~counter~0 6)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {156857#(<= ~counter~0 6)} is VALID [2022-04-28 06:07:34,402 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {156675#true} {156857#(<= ~counter~0 6)} #98#return; {156857#(<= ~counter~0 6)} is VALID [2022-04-28 06:07:34,402 INFO L290 TraceCheckUtils]: 38: Hoare triple {156675#true} assume true; {156675#true} is VALID [2022-04-28 06:07:34,402 INFO L290 TraceCheckUtils]: 37: Hoare triple {156675#true} assume !(0 == ~cond); {156675#true} is VALID [2022-04-28 06:07:34,402 INFO L290 TraceCheckUtils]: 36: Hoare triple {156675#true} ~cond := #in~cond; {156675#true} is VALID [2022-04-28 06:07:34,403 INFO L272 TraceCheckUtils]: 35: Hoare triple {156857#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {156675#true} is VALID [2022-04-28 06:07:34,403 INFO L290 TraceCheckUtils]: 34: Hoare triple {156857#(<= ~counter~0 6)} assume !!(#t~post8 < 20);havoc #t~post8; {156857#(<= ~counter~0 6)} is VALID [2022-04-28 06:07:34,404 INFO L290 TraceCheckUtils]: 33: Hoare triple {156832#(<= ~counter~0 5)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {156857#(<= ~counter~0 6)} is VALID [2022-04-28 06:07:34,404 INFO L290 TraceCheckUtils]: 32: Hoare triple {156832#(<= ~counter~0 5)} assume !(~r~0 > 0); {156832#(<= ~counter~0 5)} is VALID [2022-04-28 06:07:34,405 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {156675#true} {156832#(<= ~counter~0 5)} #96#return; {156832#(<= ~counter~0 5)} is VALID [2022-04-28 06:07:34,405 INFO L290 TraceCheckUtils]: 30: Hoare triple {156675#true} assume true; {156675#true} is VALID [2022-04-28 06:07:34,405 INFO L290 TraceCheckUtils]: 29: Hoare triple {156675#true} assume !(0 == ~cond); {156675#true} is VALID [2022-04-28 06:07:34,405 INFO L290 TraceCheckUtils]: 28: Hoare triple {156675#true} ~cond := #in~cond; {156675#true} is VALID [2022-04-28 06:07:34,405 INFO L272 TraceCheckUtils]: 27: Hoare triple {156832#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {156675#true} is VALID [2022-04-28 06:07:34,405 INFO L290 TraceCheckUtils]: 26: Hoare triple {156832#(<= ~counter~0 5)} assume !!(#t~post7 < 20);havoc #t~post7; {156832#(<= ~counter~0 5)} is VALID [2022-04-28 06:07:34,407 INFO L290 TraceCheckUtils]: 25: Hoare triple {156807#(<= ~counter~0 4)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {156832#(<= ~counter~0 5)} is VALID [2022-04-28 06:07:34,407 INFO L290 TraceCheckUtils]: 24: Hoare triple {156807#(<= ~counter~0 4)} assume !!(0 != ~r~0); {156807#(<= ~counter~0 4)} is VALID [2022-04-28 06:07:34,407 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {156675#true} {156807#(<= ~counter~0 4)} #94#return; {156807#(<= ~counter~0 4)} is VALID [2022-04-28 06:07:34,407 INFO L290 TraceCheckUtils]: 22: Hoare triple {156675#true} assume true; {156675#true} is VALID [2022-04-28 06:07:34,407 INFO L290 TraceCheckUtils]: 21: Hoare triple {156675#true} assume !(0 == ~cond); {156675#true} is VALID [2022-04-28 06:07:34,407 INFO L290 TraceCheckUtils]: 20: Hoare triple {156675#true} ~cond := #in~cond; {156675#true} is VALID [2022-04-28 06:07:34,408 INFO L272 TraceCheckUtils]: 19: Hoare triple {156807#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {156675#true} is VALID [2022-04-28 06:07:34,408 INFO L290 TraceCheckUtils]: 18: Hoare triple {156807#(<= ~counter~0 4)} assume !!(#t~post6 < 20);havoc #t~post6; {156807#(<= ~counter~0 4)} is VALID [2022-04-28 06:07:34,409 INFO L290 TraceCheckUtils]: 17: Hoare triple {156782#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {156807#(<= ~counter~0 4)} is VALID [2022-04-28 06:07:34,409 INFO L290 TraceCheckUtils]: 16: Hoare triple {156782#(<= ~counter~0 3)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {156782#(<= ~counter~0 3)} is VALID [2022-04-28 06:07:34,410 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {156675#true} {156782#(<= ~counter~0 3)} #92#return; {156782#(<= ~counter~0 3)} is VALID [2022-04-28 06:07:34,410 INFO L290 TraceCheckUtils]: 14: Hoare triple {156675#true} assume true; {156675#true} is VALID [2022-04-28 06:07:34,410 INFO L290 TraceCheckUtils]: 13: Hoare triple {156675#true} assume !(0 == ~cond); {156675#true} is VALID [2022-04-28 06:07:34,410 INFO L290 TraceCheckUtils]: 12: Hoare triple {156675#true} ~cond := #in~cond; {156675#true} is VALID [2022-04-28 06:07:34,410 INFO L272 TraceCheckUtils]: 11: Hoare triple {156782#(<= ~counter~0 3)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {156675#true} is VALID [2022-04-28 06:07:34,410 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {156675#true} {156782#(<= ~counter~0 3)} #90#return; {156782#(<= ~counter~0 3)} is VALID [2022-04-28 06:07:34,410 INFO L290 TraceCheckUtils]: 9: Hoare triple {156675#true} assume true; {156675#true} is VALID [2022-04-28 06:07:34,410 INFO L290 TraceCheckUtils]: 8: Hoare triple {156675#true} assume !(0 == ~cond); {156675#true} is VALID [2022-04-28 06:07:34,410 INFO L290 TraceCheckUtils]: 7: Hoare triple {156675#true} ~cond := #in~cond; {156675#true} is VALID [2022-04-28 06:07:34,410 INFO L272 TraceCheckUtils]: 6: Hoare triple {156782#(<= ~counter~0 3)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {156675#true} is VALID [2022-04-28 06:07:34,411 INFO L290 TraceCheckUtils]: 5: Hoare triple {156782#(<= ~counter~0 3)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {156782#(<= ~counter~0 3)} is VALID [2022-04-28 06:07:34,411 INFO L272 TraceCheckUtils]: 4: Hoare triple {156782#(<= ~counter~0 3)} call #t~ret9 := main(); {156782#(<= ~counter~0 3)} is VALID [2022-04-28 06:07:34,411 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {156782#(<= ~counter~0 3)} {156675#true} #102#return; {156782#(<= ~counter~0 3)} is VALID [2022-04-28 06:07:34,412 INFO L290 TraceCheckUtils]: 2: Hoare triple {156782#(<= ~counter~0 3)} assume true; {156782#(<= ~counter~0 3)} is VALID [2022-04-28 06:07:34,412 INFO L290 TraceCheckUtils]: 1: Hoare triple {156675#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {156782#(<= ~counter~0 3)} is VALID [2022-04-28 06:07:34,412 INFO L272 TraceCheckUtils]: 0: Hoare triple {156675#true} call ULTIMATE.init(); {156675#true} is VALID [2022-04-28 06:07:34,412 INFO L134 CoverageAnalysis]: Checked inductivity of 728 backedges. 46 proven. 198 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2022-04-28 06:07:34,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:07:34,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080247480] [2022-04-28 06:07:34,413 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:07:34,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1132834230] [2022-04-28 06:07:34,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1132834230] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 06:07:34,413 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 06:07:34,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 24 [2022-04-28 06:07:34,413 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:07:34,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [207365971] [2022-04-28 06:07:34,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [207365971] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:07:34,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:07:34,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-28 06:07:34,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685010137] [2022-04-28 06:07:34,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:07:34,414 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.6) internal successors, (112), 19 states have internal predecessors, (112), 19 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 17 states have call predecessors, (19), 18 states have call successors, (19) Word has length 155 [2022-04-28 06:07:34,414 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:07:34,414 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 5.6) internal successors, (112), 19 states have internal predecessors, (112), 19 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 17 states have call predecessors, (19), 18 states have call successors, (19) [2022-04-28 06:07:34,596 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:07:34,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-28 06:07:34,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:07:34,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-28 06:07:34,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-28 06:07:34,597 INFO L87 Difference]: Start difference. First operand 834 states and 1114 transitions. Second operand has 20 states, 20 states have (on average 5.6) internal successors, (112), 19 states have internal predecessors, (112), 19 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 17 states have call predecessors, (19), 18 states have call successors, (19) [2022-04-28 06:07:40,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:07:40,260 INFO L93 Difference]: Finished difference Result 1021 states and 1392 transitions. [2022-04-28 06:07:40,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-04-28 06:07:40,260 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.6) internal successors, (112), 19 states have internal predecessors, (112), 19 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 17 states have call predecessors, (19), 18 states have call successors, (19) Word has length 155 [2022-04-28 06:07:40,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:07:40,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 5.6) internal successors, (112), 19 states have internal predecessors, (112), 19 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 17 states have call predecessors, (19), 18 states have call successors, (19) [2022-04-28 06:07:40,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 356 transitions. [2022-04-28 06:07:40,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 5.6) internal successors, (112), 19 states have internal predecessors, (112), 19 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 17 states have call predecessors, (19), 18 states have call successors, (19) [2022-04-28 06:07:40,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 356 transitions. [2022-04-28 06:07:40,265 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 356 transitions. [2022-04-28 06:07:40,743 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 356 edges. 356 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:07:40,773 INFO L225 Difference]: With dead ends: 1021 [2022-04-28 06:07:40,773 INFO L226 Difference]: Without dead ends: 851 [2022-04-28 06:07:40,774 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 286 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=566, Invalid=916, Unknown=0, NotChecked=0, Total=1482 [2022-04-28 06:07:40,774 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 265 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 230 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 230 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-28 06:07:40,774 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 348 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [230 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-28 06:07:40,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2022-04-28 06:07:44,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 851. [2022-04-28 06:07:44,155 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:07:44,156 INFO L82 GeneralOperation]: Start isEquivalent. First operand 851 states. Second operand has 851 states, 641 states have (on average 1.1778471138845554) internal successors, (755), 648 states have internal predecessors, (755), 189 states have call successors, (189), 22 states have call predecessors, (189), 20 states have return successors, (187), 180 states have call predecessors, (187), 187 states have call successors, (187) [2022-04-28 06:07:44,156 INFO L74 IsIncluded]: Start isIncluded. First operand 851 states. Second operand has 851 states, 641 states have (on average 1.1778471138845554) internal successors, (755), 648 states have internal predecessors, (755), 189 states have call successors, (189), 22 states have call predecessors, (189), 20 states have return successors, (187), 180 states have call predecessors, (187), 187 states have call successors, (187) [2022-04-28 06:07:44,157 INFO L87 Difference]: Start difference. First operand 851 states. Second operand has 851 states, 641 states have (on average 1.1778471138845554) internal successors, (755), 648 states have internal predecessors, (755), 189 states have call successors, (189), 22 states have call predecessors, (189), 20 states have return successors, (187), 180 states have call predecessors, (187), 187 states have call successors, (187) [2022-04-28 06:07:44,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:07:44,180 INFO L93 Difference]: Finished difference Result 851 states and 1131 transitions. [2022-04-28 06:07:44,180 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1131 transitions. [2022-04-28 06:07:44,180 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:07:44,180 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:07:44,181 INFO L74 IsIncluded]: Start isIncluded. First operand has 851 states, 641 states have (on average 1.1778471138845554) internal successors, (755), 648 states have internal predecessors, (755), 189 states have call successors, (189), 22 states have call predecessors, (189), 20 states have return successors, (187), 180 states have call predecessors, (187), 187 states have call successors, (187) Second operand 851 states. [2022-04-28 06:07:44,181 INFO L87 Difference]: Start difference. First operand has 851 states, 641 states have (on average 1.1778471138845554) internal successors, (755), 648 states have internal predecessors, (755), 189 states have call successors, (189), 22 states have call predecessors, (189), 20 states have return successors, (187), 180 states have call predecessors, (187), 187 states have call successors, (187) Second operand 851 states. [2022-04-28 06:07:44,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:07:44,204 INFO L93 Difference]: Finished difference Result 851 states and 1131 transitions. [2022-04-28 06:07:44,204 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1131 transitions. [2022-04-28 06:07:44,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:07:44,204 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:07:44,205 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:07:44,205 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:07:44,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 851 states, 641 states have (on average 1.1778471138845554) internal successors, (755), 648 states have internal predecessors, (755), 189 states have call successors, (189), 22 states have call predecessors, (189), 20 states have return successors, (187), 180 states have call predecessors, (187), 187 states have call successors, (187) [2022-04-28 06:07:44,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 1131 transitions. [2022-04-28 06:07:44,235 INFO L78 Accepts]: Start accepts. Automaton has 851 states and 1131 transitions. Word has length 155 [2022-04-28 06:07:44,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:07:44,235 INFO L495 AbstractCegarLoop]: Abstraction has 851 states and 1131 transitions. [2022-04-28 06:07:44,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.6) internal successors, (112), 19 states have internal predecessors, (112), 19 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 17 states have call predecessors, (19), 18 states have call successors, (19) [2022-04-28 06:07:44,235 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 851 states and 1131 transitions. [2022-04-28 06:07:56,213 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1131 edges. 1130 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 06:07:56,213 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1131 transitions. [2022-04-28 06:07:56,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-04-28 06:07:56,215 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:07:56,215 INFO L195 NwaCegarLoop]: trace histogram [18, 17, 17, 8, 8, 8, 8, 6, 6, 6, 6, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:07:56,220 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Forceful destruction successful, exit code 0 [2022-04-28 06:07:56,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53,55 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:07:56,420 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:07:56,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:07:56,421 INFO L85 PathProgramCache]: Analyzing trace with hash -61113684, now seen corresponding path program 17 times [2022-04-28 06:07:56,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:07:56,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [541114689] [2022-04-28 06:07:56,421 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 06:07:56,421 INFO L85 PathProgramCache]: Analyzing trace with hash -61113684, now seen corresponding path program 18 times [2022-04-28 06:07:56,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:07:56,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211979062] [2022-04-28 06:07:56,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:07:56,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:07:56,435 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:07:56,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1528000675] [2022-04-28 06:07:56,435 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 06:07:56,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:07:56,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:07:56,436 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:07:56,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Waiting until timeout for monitored process [2022-04-28 06:07:57,091 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-04-28 06:07:57,091 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:07:57,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-28 06:07:57,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:07:57,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:07:58,021 INFO L272 TraceCheckUtils]: 0: Hoare triple {163104#true} call ULTIMATE.init(); {163104#true} is VALID [2022-04-28 06:07:58,022 INFO L290 TraceCheckUtils]: 1: Hoare triple {163104#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {163112#(<= ~counter~0 0)} is VALID [2022-04-28 06:07:58,022 INFO L290 TraceCheckUtils]: 2: Hoare triple {163112#(<= ~counter~0 0)} assume true; {163112#(<= ~counter~0 0)} is VALID [2022-04-28 06:07:58,022 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {163112#(<= ~counter~0 0)} {163104#true} #102#return; {163112#(<= ~counter~0 0)} is VALID [2022-04-28 06:07:58,022 INFO L272 TraceCheckUtils]: 4: Hoare triple {163112#(<= ~counter~0 0)} call #t~ret9 := main(); {163112#(<= ~counter~0 0)} is VALID [2022-04-28 06:07:58,023 INFO L290 TraceCheckUtils]: 5: Hoare triple {163112#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {163112#(<= ~counter~0 0)} is VALID [2022-04-28 06:07:58,023 INFO L272 TraceCheckUtils]: 6: Hoare triple {163112#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {163112#(<= ~counter~0 0)} is VALID [2022-04-28 06:07:58,023 INFO L290 TraceCheckUtils]: 7: Hoare triple {163112#(<= ~counter~0 0)} ~cond := #in~cond; {163112#(<= ~counter~0 0)} is VALID [2022-04-28 06:07:58,024 INFO L290 TraceCheckUtils]: 8: Hoare triple {163112#(<= ~counter~0 0)} assume !(0 == ~cond); {163112#(<= ~counter~0 0)} is VALID [2022-04-28 06:07:58,024 INFO L290 TraceCheckUtils]: 9: Hoare triple {163112#(<= ~counter~0 0)} assume true; {163112#(<= ~counter~0 0)} is VALID [2022-04-28 06:07:58,024 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {163112#(<= ~counter~0 0)} {163112#(<= ~counter~0 0)} #90#return; {163112#(<= ~counter~0 0)} is VALID [2022-04-28 06:07:58,025 INFO L272 TraceCheckUtils]: 11: Hoare triple {163112#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {163112#(<= ~counter~0 0)} is VALID [2022-04-28 06:07:58,025 INFO L290 TraceCheckUtils]: 12: Hoare triple {163112#(<= ~counter~0 0)} ~cond := #in~cond; {163112#(<= ~counter~0 0)} is VALID [2022-04-28 06:07:58,025 INFO L290 TraceCheckUtils]: 13: Hoare triple {163112#(<= ~counter~0 0)} assume !(0 == ~cond); {163112#(<= ~counter~0 0)} is VALID [2022-04-28 06:07:58,025 INFO L290 TraceCheckUtils]: 14: Hoare triple {163112#(<= ~counter~0 0)} assume true; {163112#(<= ~counter~0 0)} is VALID [2022-04-28 06:07:58,026 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {163112#(<= ~counter~0 0)} {163112#(<= ~counter~0 0)} #92#return; {163112#(<= ~counter~0 0)} is VALID [2022-04-28 06:07:58,026 INFO L290 TraceCheckUtils]: 16: Hoare triple {163112#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {163112#(<= ~counter~0 0)} is VALID [2022-04-28 06:07:58,029 INFO L290 TraceCheckUtils]: 17: Hoare triple {163112#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {163161#(<= ~counter~0 1)} is VALID [2022-04-28 06:07:58,029 INFO L290 TraceCheckUtils]: 18: Hoare triple {163161#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {163161#(<= ~counter~0 1)} is VALID [2022-04-28 06:07:58,030 INFO L272 TraceCheckUtils]: 19: Hoare triple {163161#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {163161#(<= ~counter~0 1)} is VALID [2022-04-28 06:07:58,030 INFO L290 TraceCheckUtils]: 20: Hoare triple {163161#(<= ~counter~0 1)} ~cond := #in~cond; {163161#(<= ~counter~0 1)} is VALID [2022-04-28 06:07:58,030 INFO L290 TraceCheckUtils]: 21: Hoare triple {163161#(<= ~counter~0 1)} assume !(0 == ~cond); {163161#(<= ~counter~0 1)} is VALID [2022-04-28 06:07:58,031 INFO L290 TraceCheckUtils]: 22: Hoare triple {163161#(<= ~counter~0 1)} assume true; {163161#(<= ~counter~0 1)} is VALID [2022-04-28 06:07:58,031 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {163161#(<= ~counter~0 1)} {163161#(<= ~counter~0 1)} #94#return; {163161#(<= ~counter~0 1)} is VALID [2022-04-28 06:07:58,031 INFO L290 TraceCheckUtils]: 24: Hoare triple {163161#(<= ~counter~0 1)} assume !!(0 != ~r~0); {163161#(<= ~counter~0 1)} is VALID [2022-04-28 06:07:58,033 INFO L290 TraceCheckUtils]: 25: Hoare triple {163161#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {163186#(<= ~counter~0 2)} is VALID [2022-04-28 06:07:58,033 INFO L290 TraceCheckUtils]: 26: Hoare triple {163186#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {163186#(<= ~counter~0 2)} is VALID [2022-04-28 06:07:58,034 INFO L272 TraceCheckUtils]: 27: Hoare triple {163186#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {163186#(<= ~counter~0 2)} is VALID [2022-04-28 06:07:58,034 INFO L290 TraceCheckUtils]: 28: Hoare triple {163186#(<= ~counter~0 2)} ~cond := #in~cond; {163186#(<= ~counter~0 2)} is VALID [2022-04-28 06:07:58,034 INFO L290 TraceCheckUtils]: 29: Hoare triple {163186#(<= ~counter~0 2)} assume !(0 == ~cond); {163186#(<= ~counter~0 2)} is VALID [2022-04-28 06:07:58,034 INFO L290 TraceCheckUtils]: 30: Hoare triple {163186#(<= ~counter~0 2)} assume true; {163186#(<= ~counter~0 2)} is VALID [2022-04-28 06:07:58,035 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {163186#(<= ~counter~0 2)} {163186#(<= ~counter~0 2)} #96#return; {163186#(<= ~counter~0 2)} is VALID [2022-04-28 06:07:58,035 INFO L290 TraceCheckUtils]: 32: Hoare triple {163186#(<= ~counter~0 2)} assume !(~r~0 > 0); {163186#(<= ~counter~0 2)} is VALID [2022-04-28 06:07:58,036 INFO L290 TraceCheckUtils]: 33: Hoare triple {163186#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {163211#(<= ~counter~0 3)} is VALID [2022-04-28 06:07:58,037 INFO L290 TraceCheckUtils]: 34: Hoare triple {163211#(<= ~counter~0 3)} assume !!(#t~post8 < 20);havoc #t~post8; {163211#(<= ~counter~0 3)} is VALID [2022-04-28 06:07:58,037 INFO L272 TraceCheckUtils]: 35: Hoare triple {163211#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {163211#(<= ~counter~0 3)} is VALID [2022-04-28 06:07:58,037 INFO L290 TraceCheckUtils]: 36: Hoare triple {163211#(<= ~counter~0 3)} ~cond := #in~cond; {163211#(<= ~counter~0 3)} is VALID [2022-04-28 06:07:58,038 INFO L290 TraceCheckUtils]: 37: Hoare triple {163211#(<= ~counter~0 3)} assume !(0 == ~cond); {163211#(<= ~counter~0 3)} is VALID [2022-04-28 06:07:58,038 INFO L290 TraceCheckUtils]: 38: Hoare triple {163211#(<= ~counter~0 3)} assume true; {163211#(<= ~counter~0 3)} is VALID [2022-04-28 06:07:58,038 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {163211#(<= ~counter~0 3)} {163211#(<= ~counter~0 3)} #98#return; {163211#(<= ~counter~0 3)} is VALID [2022-04-28 06:07:58,039 INFO L290 TraceCheckUtils]: 40: Hoare triple {163211#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {163211#(<= ~counter~0 3)} is VALID [2022-04-28 06:07:58,040 INFO L290 TraceCheckUtils]: 41: Hoare triple {163211#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {163236#(<= ~counter~0 4)} is VALID [2022-04-28 06:07:58,040 INFO L290 TraceCheckUtils]: 42: Hoare triple {163236#(<= ~counter~0 4)} assume !!(#t~post8 < 20);havoc #t~post8; {163236#(<= ~counter~0 4)} is VALID [2022-04-28 06:07:58,041 INFO L272 TraceCheckUtils]: 43: Hoare triple {163236#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {163236#(<= ~counter~0 4)} is VALID [2022-04-28 06:07:58,041 INFO L290 TraceCheckUtils]: 44: Hoare triple {163236#(<= ~counter~0 4)} ~cond := #in~cond; {163236#(<= ~counter~0 4)} is VALID [2022-04-28 06:07:58,041 INFO L290 TraceCheckUtils]: 45: Hoare triple {163236#(<= ~counter~0 4)} assume !(0 == ~cond); {163236#(<= ~counter~0 4)} is VALID [2022-04-28 06:07:58,041 INFO L290 TraceCheckUtils]: 46: Hoare triple {163236#(<= ~counter~0 4)} assume true; {163236#(<= ~counter~0 4)} is VALID [2022-04-28 06:07:58,042 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {163236#(<= ~counter~0 4)} {163236#(<= ~counter~0 4)} #98#return; {163236#(<= ~counter~0 4)} is VALID [2022-04-28 06:07:58,042 INFO L290 TraceCheckUtils]: 48: Hoare triple {163236#(<= ~counter~0 4)} assume !(~r~0 < 0); {163236#(<= ~counter~0 4)} is VALID [2022-04-28 06:07:58,043 INFO L290 TraceCheckUtils]: 49: Hoare triple {163236#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {163261#(<= ~counter~0 5)} is VALID [2022-04-28 06:07:58,044 INFO L290 TraceCheckUtils]: 50: Hoare triple {163261#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {163261#(<= ~counter~0 5)} is VALID [2022-04-28 06:07:58,044 INFO L272 TraceCheckUtils]: 51: Hoare triple {163261#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {163261#(<= ~counter~0 5)} is VALID [2022-04-28 06:07:58,044 INFO L290 TraceCheckUtils]: 52: Hoare triple {163261#(<= ~counter~0 5)} ~cond := #in~cond; {163261#(<= ~counter~0 5)} is VALID [2022-04-28 06:07:58,045 INFO L290 TraceCheckUtils]: 53: Hoare triple {163261#(<= ~counter~0 5)} assume !(0 == ~cond); {163261#(<= ~counter~0 5)} is VALID [2022-04-28 06:07:58,045 INFO L290 TraceCheckUtils]: 54: Hoare triple {163261#(<= ~counter~0 5)} assume true; {163261#(<= ~counter~0 5)} is VALID [2022-04-28 06:07:58,045 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {163261#(<= ~counter~0 5)} {163261#(<= ~counter~0 5)} #94#return; {163261#(<= ~counter~0 5)} is VALID [2022-04-28 06:07:58,046 INFO L290 TraceCheckUtils]: 56: Hoare triple {163261#(<= ~counter~0 5)} assume !!(0 != ~r~0); {163261#(<= ~counter~0 5)} is VALID [2022-04-28 06:07:58,047 INFO L290 TraceCheckUtils]: 57: Hoare triple {163261#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {163286#(<= ~counter~0 6)} is VALID [2022-04-28 06:07:58,047 INFO L290 TraceCheckUtils]: 58: Hoare triple {163286#(<= ~counter~0 6)} assume !!(#t~post7 < 20);havoc #t~post7; {163286#(<= ~counter~0 6)} is VALID [2022-04-28 06:07:58,048 INFO L272 TraceCheckUtils]: 59: Hoare triple {163286#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {163286#(<= ~counter~0 6)} is VALID [2022-04-28 06:07:58,048 INFO L290 TraceCheckUtils]: 60: Hoare triple {163286#(<= ~counter~0 6)} ~cond := #in~cond; {163286#(<= ~counter~0 6)} is VALID [2022-04-28 06:07:58,048 INFO L290 TraceCheckUtils]: 61: Hoare triple {163286#(<= ~counter~0 6)} assume !(0 == ~cond); {163286#(<= ~counter~0 6)} is VALID [2022-04-28 06:07:58,049 INFO L290 TraceCheckUtils]: 62: Hoare triple {163286#(<= ~counter~0 6)} assume true; {163286#(<= ~counter~0 6)} is VALID [2022-04-28 06:07:58,049 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {163286#(<= ~counter~0 6)} {163286#(<= ~counter~0 6)} #96#return; {163286#(<= ~counter~0 6)} is VALID [2022-04-28 06:07:58,049 INFO L290 TraceCheckUtils]: 64: Hoare triple {163286#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {163286#(<= ~counter~0 6)} is VALID [2022-04-28 06:07:58,051 INFO L290 TraceCheckUtils]: 65: Hoare triple {163286#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {163311#(<= ~counter~0 7)} is VALID [2022-04-28 06:07:58,051 INFO L290 TraceCheckUtils]: 66: Hoare triple {163311#(<= ~counter~0 7)} assume !!(#t~post7 < 20);havoc #t~post7; {163311#(<= ~counter~0 7)} is VALID [2022-04-28 06:07:58,051 INFO L272 TraceCheckUtils]: 67: Hoare triple {163311#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {163311#(<= ~counter~0 7)} is VALID [2022-04-28 06:07:58,052 INFO L290 TraceCheckUtils]: 68: Hoare triple {163311#(<= ~counter~0 7)} ~cond := #in~cond; {163311#(<= ~counter~0 7)} is VALID [2022-04-28 06:07:58,052 INFO L290 TraceCheckUtils]: 69: Hoare triple {163311#(<= ~counter~0 7)} assume !(0 == ~cond); {163311#(<= ~counter~0 7)} is VALID [2022-04-28 06:07:58,052 INFO L290 TraceCheckUtils]: 70: Hoare triple {163311#(<= ~counter~0 7)} assume true; {163311#(<= ~counter~0 7)} is VALID [2022-04-28 06:07:58,053 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {163311#(<= ~counter~0 7)} {163311#(<= ~counter~0 7)} #96#return; {163311#(<= ~counter~0 7)} is VALID [2022-04-28 06:07:58,053 INFO L290 TraceCheckUtils]: 72: Hoare triple {163311#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {163311#(<= ~counter~0 7)} is VALID [2022-04-28 06:07:58,054 INFO L290 TraceCheckUtils]: 73: Hoare triple {163311#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {163336#(<= ~counter~0 8)} is VALID [2022-04-28 06:07:58,054 INFO L290 TraceCheckUtils]: 74: Hoare triple {163336#(<= ~counter~0 8)} assume !!(#t~post7 < 20);havoc #t~post7; {163336#(<= ~counter~0 8)} is VALID [2022-04-28 06:07:58,055 INFO L272 TraceCheckUtils]: 75: Hoare triple {163336#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {163336#(<= ~counter~0 8)} is VALID [2022-04-28 06:07:58,055 INFO L290 TraceCheckUtils]: 76: Hoare triple {163336#(<= ~counter~0 8)} ~cond := #in~cond; {163336#(<= ~counter~0 8)} is VALID [2022-04-28 06:07:58,055 INFO L290 TraceCheckUtils]: 77: Hoare triple {163336#(<= ~counter~0 8)} assume !(0 == ~cond); {163336#(<= ~counter~0 8)} is VALID [2022-04-28 06:07:58,056 INFO L290 TraceCheckUtils]: 78: Hoare triple {163336#(<= ~counter~0 8)} assume true; {163336#(<= ~counter~0 8)} is VALID [2022-04-28 06:07:58,056 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {163336#(<= ~counter~0 8)} {163336#(<= ~counter~0 8)} #96#return; {163336#(<= ~counter~0 8)} is VALID [2022-04-28 06:07:58,056 INFO L290 TraceCheckUtils]: 80: Hoare triple {163336#(<= ~counter~0 8)} assume !(~r~0 > 0); {163336#(<= ~counter~0 8)} is VALID [2022-04-28 06:07:58,058 INFO L290 TraceCheckUtils]: 81: Hoare triple {163336#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {163361#(<= ~counter~0 9)} is VALID [2022-04-28 06:07:58,058 INFO L290 TraceCheckUtils]: 82: Hoare triple {163361#(<= ~counter~0 9)} assume !!(#t~post8 < 20);havoc #t~post8; {163361#(<= ~counter~0 9)} is VALID [2022-04-28 06:07:58,059 INFO L272 TraceCheckUtils]: 83: Hoare triple {163361#(<= ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {163361#(<= ~counter~0 9)} is VALID [2022-04-28 06:07:58,059 INFO L290 TraceCheckUtils]: 84: Hoare triple {163361#(<= ~counter~0 9)} ~cond := #in~cond; {163361#(<= ~counter~0 9)} is VALID [2022-04-28 06:07:58,059 INFO L290 TraceCheckUtils]: 85: Hoare triple {163361#(<= ~counter~0 9)} assume !(0 == ~cond); {163361#(<= ~counter~0 9)} is VALID [2022-04-28 06:07:58,059 INFO L290 TraceCheckUtils]: 86: Hoare triple {163361#(<= ~counter~0 9)} assume true; {163361#(<= ~counter~0 9)} is VALID [2022-04-28 06:07:58,060 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {163361#(<= ~counter~0 9)} {163361#(<= ~counter~0 9)} #98#return; {163361#(<= ~counter~0 9)} is VALID [2022-04-28 06:07:58,060 INFO L290 TraceCheckUtils]: 88: Hoare triple {163361#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {163361#(<= ~counter~0 9)} is VALID [2022-04-28 06:07:58,061 INFO L290 TraceCheckUtils]: 89: Hoare triple {163361#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {163386#(<= ~counter~0 10)} is VALID [2022-04-28 06:07:58,062 INFO L290 TraceCheckUtils]: 90: Hoare triple {163386#(<= ~counter~0 10)} assume !!(#t~post8 < 20);havoc #t~post8; {163386#(<= ~counter~0 10)} is VALID [2022-04-28 06:07:58,062 INFO L272 TraceCheckUtils]: 91: Hoare triple {163386#(<= ~counter~0 10)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {163386#(<= ~counter~0 10)} is VALID [2022-04-28 06:07:58,062 INFO L290 TraceCheckUtils]: 92: Hoare triple {163386#(<= ~counter~0 10)} ~cond := #in~cond; {163386#(<= ~counter~0 10)} is VALID [2022-04-28 06:07:58,063 INFO L290 TraceCheckUtils]: 93: Hoare triple {163386#(<= ~counter~0 10)} assume !(0 == ~cond); {163386#(<= ~counter~0 10)} is VALID [2022-04-28 06:07:58,063 INFO L290 TraceCheckUtils]: 94: Hoare triple {163386#(<= ~counter~0 10)} assume true; {163386#(<= ~counter~0 10)} is VALID [2022-04-28 06:07:58,063 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {163386#(<= ~counter~0 10)} {163386#(<= ~counter~0 10)} #98#return; {163386#(<= ~counter~0 10)} is VALID [2022-04-28 06:07:58,064 INFO L290 TraceCheckUtils]: 96: Hoare triple {163386#(<= ~counter~0 10)} assume !(~r~0 < 0); {163386#(<= ~counter~0 10)} is VALID [2022-04-28 06:07:58,065 INFO L290 TraceCheckUtils]: 97: Hoare triple {163386#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {163411#(<= ~counter~0 11)} is VALID [2022-04-28 06:07:58,065 INFO L290 TraceCheckUtils]: 98: Hoare triple {163411#(<= ~counter~0 11)} assume !!(#t~post6 < 20);havoc #t~post6; {163411#(<= ~counter~0 11)} is VALID [2022-04-28 06:07:58,066 INFO L272 TraceCheckUtils]: 99: Hoare triple {163411#(<= ~counter~0 11)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {163411#(<= ~counter~0 11)} is VALID [2022-04-28 06:07:58,066 INFO L290 TraceCheckUtils]: 100: Hoare triple {163411#(<= ~counter~0 11)} ~cond := #in~cond; {163411#(<= ~counter~0 11)} is VALID [2022-04-28 06:07:58,066 INFO L290 TraceCheckUtils]: 101: Hoare triple {163411#(<= ~counter~0 11)} assume !(0 == ~cond); {163411#(<= ~counter~0 11)} is VALID [2022-04-28 06:07:58,066 INFO L290 TraceCheckUtils]: 102: Hoare triple {163411#(<= ~counter~0 11)} assume true; {163411#(<= ~counter~0 11)} is VALID [2022-04-28 06:07:58,067 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {163411#(<= ~counter~0 11)} {163411#(<= ~counter~0 11)} #94#return; {163411#(<= ~counter~0 11)} is VALID [2022-04-28 06:07:58,067 INFO L290 TraceCheckUtils]: 104: Hoare triple {163411#(<= ~counter~0 11)} assume !!(0 != ~r~0); {163411#(<= ~counter~0 11)} is VALID [2022-04-28 06:07:58,069 INFO L290 TraceCheckUtils]: 105: Hoare triple {163411#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {163436#(<= ~counter~0 12)} is VALID [2022-04-28 06:07:58,069 INFO L290 TraceCheckUtils]: 106: Hoare triple {163436#(<= ~counter~0 12)} assume !!(#t~post7 < 20);havoc #t~post7; {163436#(<= ~counter~0 12)} is VALID [2022-04-28 06:07:58,069 INFO L272 TraceCheckUtils]: 107: Hoare triple {163436#(<= ~counter~0 12)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {163436#(<= ~counter~0 12)} is VALID [2022-04-28 06:07:58,070 INFO L290 TraceCheckUtils]: 108: Hoare triple {163436#(<= ~counter~0 12)} ~cond := #in~cond; {163436#(<= ~counter~0 12)} is VALID [2022-04-28 06:07:58,070 INFO L290 TraceCheckUtils]: 109: Hoare triple {163436#(<= ~counter~0 12)} assume !(0 == ~cond); {163436#(<= ~counter~0 12)} is VALID [2022-04-28 06:07:58,070 INFO L290 TraceCheckUtils]: 110: Hoare triple {163436#(<= ~counter~0 12)} assume true; {163436#(<= ~counter~0 12)} is VALID [2022-04-28 06:07:58,071 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {163436#(<= ~counter~0 12)} {163436#(<= ~counter~0 12)} #96#return; {163436#(<= ~counter~0 12)} is VALID [2022-04-28 06:07:58,071 INFO L290 TraceCheckUtils]: 112: Hoare triple {163436#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {163436#(<= ~counter~0 12)} is VALID [2022-04-28 06:07:58,072 INFO L290 TraceCheckUtils]: 113: Hoare triple {163436#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {163461#(<= ~counter~0 13)} is VALID [2022-04-28 06:07:58,072 INFO L290 TraceCheckUtils]: 114: Hoare triple {163461#(<= ~counter~0 13)} assume !!(#t~post7 < 20);havoc #t~post7; {163461#(<= ~counter~0 13)} is VALID [2022-04-28 06:07:58,073 INFO L272 TraceCheckUtils]: 115: Hoare triple {163461#(<= ~counter~0 13)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {163461#(<= ~counter~0 13)} is VALID [2022-04-28 06:07:58,073 INFO L290 TraceCheckUtils]: 116: Hoare triple {163461#(<= ~counter~0 13)} ~cond := #in~cond; {163461#(<= ~counter~0 13)} is VALID [2022-04-28 06:07:58,073 INFO L290 TraceCheckUtils]: 117: Hoare triple {163461#(<= ~counter~0 13)} assume !(0 == ~cond); {163461#(<= ~counter~0 13)} is VALID [2022-04-28 06:07:58,074 INFO L290 TraceCheckUtils]: 118: Hoare triple {163461#(<= ~counter~0 13)} assume true; {163461#(<= ~counter~0 13)} is VALID [2022-04-28 06:07:58,074 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {163461#(<= ~counter~0 13)} {163461#(<= ~counter~0 13)} #96#return; {163461#(<= ~counter~0 13)} is VALID [2022-04-28 06:07:58,074 INFO L290 TraceCheckUtils]: 120: Hoare triple {163461#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {163461#(<= ~counter~0 13)} is VALID [2022-04-28 06:07:58,076 INFO L290 TraceCheckUtils]: 121: Hoare triple {163461#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {163486#(<= ~counter~0 14)} is VALID [2022-04-28 06:07:58,076 INFO L290 TraceCheckUtils]: 122: Hoare triple {163486#(<= ~counter~0 14)} assume !!(#t~post7 < 20);havoc #t~post7; {163486#(<= ~counter~0 14)} is VALID [2022-04-28 06:07:58,076 INFO L272 TraceCheckUtils]: 123: Hoare triple {163486#(<= ~counter~0 14)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {163486#(<= ~counter~0 14)} is VALID [2022-04-28 06:07:58,077 INFO L290 TraceCheckUtils]: 124: Hoare triple {163486#(<= ~counter~0 14)} ~cond := #in~cond; {163486#(<= ~counter~0 14)} is VALID [2022-04-28 06:07:58,077 INFO L290 TraceCheckUtils]: 125: Hoare triple {163486#(<= ~counter~0 14)} assume !(0 == ~cond); {163486#(<= ~counter~0 14)} is VALID [2022-04-28 06:07:58,077 INFO L290 TraceCheckUtils]: 126: Hoare triple {163486#(<= ~counter~0 14)} assume true; {163486#(<= ~counter~0 14)} is VALID [2022-04-28 06:07:58,078 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {163486#(<= ~counter~0 14)} {163486#(<= ~counter~0 14)} #96#return; {163486#(<= ~counter~0 14)} is VALID [2022-04-28 06:07:58,078 INFO L290 TraceCheckUtils]: 128: Hoare triple {163486#(<= ~counter~0 14)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {163486#(<= ~counter~0 14)} is VALID [2022-04-28 06:07:58,080 INFO L290 TraceCheckUtils]: 129: Hoare triple {163486#(<= ~counter~0 14)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {163511#(<= ~counter~0 15)} is VALID [2022-04-28 06:07:58,081 INFO L290 TraceCheckUtils]: 130: Hoare triple {163511#(<= ~counter~0 15)} assume !!(#t~post7 < 20);havoc #t~post7; {163511#(<= ~counter~0 15)} is VALID [2022-04-28 06:07:58,081 INFO L272 TraceCheckUtils]: 131: Hoare triple {163511#(<= ~counter~0 15)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {163511#(<= ~counter~0 15)} is VALID [2022-04-28 06:07:58,081 INFO L290 TraceCheckUtils]: 132: Hoare triple {163511#(<= ~counter~0 15)} ~cond := #in~cond; {163511#(<= ~counter~0 15)} is VALID [2022-04-28 06:07:58,082 INFO L290 TraceCheckUtils]: 133: Hoare triple {163511#(<= ~counter~0 15)} assume !(0 == ~cond); {163511#(<= ~counter~0 15)} is VALID [2022-04-28 06:07:58,082 INFO L290 TraceCheckUtils]: 134: Hoare triple {163511#(<= ~counter~0 15)} assume true; {163511#(<= ~counter~0 15)} is VALID [2022-04-28 06:07:58,082 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {163511#(<= ~counter~0 15)} {163511#(<= ~counter~0 15)} #96#return; {163511#(<= ~counter~0 15)} is VALID [2022-04-28 06:07:58,083 INFO L290 TraceCheckUtils]: 136: Hoare triple {163511#(<= ~counter~0 15)} assume !(~r~0 > 0); {163511#(<= ~counter~0 15)} is VALID [2022-04-28 06:07:58,084 INFO L290 TraceCheckUtils]: 137: Hoare triple {163511#(<= ~counter~0 15)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {163536#(<= ~counter~0 16)} is VALID [2022-04-28 06:07:58,084 INFO L290 TraceCheckUtils]: 138: Hoare triple {163536#(<= ~counter~0 16)} assume !!(#t~post8 < 20);havoc #t~post8; {163536#(<= ~counter~0 16)} is VALID [2022-04-28 06:07:58,085 INFO L272 TraceCheckUtils]: 139: Hoare triple {163536#(<= ~counter~0 16)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {163536#(<= ~counter~0 16)} is VALID [2022-04-28 06:07:58,085 INFO L290 TraceCheckUtils]: 140: Hoare triple {163536#(<= ~counter~0 16)} ~cond := #in~cond; {163536#(<= ~counter~0 16)} is VALID [2022-04-28 06:07:58,085 INFO L290 TraceCheckUtils]: 141: Hoare triple {163536#(<= ~counter~0 16)} assume !(0 == ~cond); {163536#(<= ~counter~0 16)} is VALID [2022-04-28 06:07:58,086 INFO L290 TraceCheckUtils]: 142: Hoare triple {163536#(<= ~counter~0 16)} assume true; {163536#(<= ~counter~0 16)} is VALID [2022-04-28 06:07:58,086 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {163536#(<= ~counter~0 16)} {163536#(<= ~counter~0 16)} #98#return; {163536#(<= ~counter~0 16)} is VALID [2022-04-28 06:07:58,086 INFO L290 TraceCheckUtils]: 144: Hoare triple {163536#(<= ~counter~0 16)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {163536#(<= ~counter~0 16)} is VALID [2022-04-28 06:07:58,088 INFO L290 TraceCheckUtils]: 145: Hoare triple {163536#(<= ~counter~0 16)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {163561#(<= ~counter~0 17)} is VALID [2022-04-28 06:07:58,088 INFO L290 TraceCheckUtils]: 146: Hoare triple {163561#(<= ~counter~0 17)} assume !!(#t~post8 < 20);havoc #t~post8; {163561#(<= ~counter~0 17)} is VALID [2022-04-28 06:07:58,089 INFO L272 TraceCheckUtils]: 147: Hoare triple {163561#(<= ~counter~0 17)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {163561#(<= ~counter~0 17)} is VALID [2022-04-28 06:07:58,089 INFO L290 TraceCheckUtils]: 148: Hoare triple {163561#(<= ~counter~0 17)} ~cond := #in~cond; {163561#(<= ~counter~0 17)} is VALID [2022-04-28 06:07:58,089 INFO L290 TraceCheckUtils]: 149: Hoare triple {163561#(<= ~counter~0 17)} assume !(0 == ~cond); {163561#(<= ~counter~0 17)} is VALID [2022-04-28 06:07:58,090 INFO L290 TraceCheckUtils]: 150: Hoare triple {163561#(<= ~counter~0 17)} assume true; {163561#(<= ~counter~0 17)} is VALID [2022-04-28 06:07:58,090 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {163561#(<= ~counter~0 17)} {163561#(<= ~counter~0 17)} #98#return; {163561#(<= ~counter~0 17)} is VALID [2022-04-28 06:07:58,090 INFO L290 TraceCheckUtils]: 152: Hoare triple {163561#(<= ~counter~0 17)} assume !(~r~0 < 0); {163561#(<= ~counter~0 17)} is VALID [2022-04-28 06:07:58,091 INFO L290 TraceCheckUtils]: 153: Hoare triple {163561#(<= ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {163586#(<= |main_#t~post6| 17)} is VALID [2022-04-28 06:07:58,091 INFO L290 TraceCheckUtils]: 154: Hoare triple {163586#(<= |main_#t~post6| 17)} assume !(#t~post6 < 20);havoc #t~post6; {163105#false} is VALID [2022-04-28 06:07:58,091 INFO L272 TraceCheckUtils]: 155: Hoare triple {163105#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {163105#false} is VALID [2022-04-28 06:07:58,091 INFO L290 TraceCheckUtils]: 156: Hoare triple {163105#false} ~cond := #in~cond; {163105#false} is VALID [2022-04-28 06:07:58,091 INFO L290 TraceCheckUtils]: 157: Hoare triple {163105#false} assume 0 == ~cond; {163105#false} is VALID [2022-04-28 06:07:58,091 INFO L290 TraceCheckUtils]: 158: Hoare triple {163105#false} assume !false; {163105#false} is VALID [2022-04-28 06:07:58,092 INFO L134 CoverageAnalysis]: Checked inductivity of 772 backedges. 34 proven. 734 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 06:07:58,092 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 06:07:58,909 INFO L290 TraceCheckUtils]: 158: Hoare triple {163105#false} assume !false; {163105#false} is VALID [2022-04-28 06:07:58,909 INFO L290 TraceCheckUtils]: 157: Hoare triple {163105#false} assume 0 == ~cond; {163105#false} is VALID [2022-04-28 06:07:58,909 INFO L290 TraceCheckUtils]: 156: Hoare triple {163105#false} ~cond := #in~cond; {163105#false} is VALID [2022-04-28 06:07:58,909 INFO L272 TraceCheckUtils]: 155: Hoare triple {163105#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {163105#false} is VALID [2022-04-28 06:07:58,909 INFO L290 TraceCheckUtils]: 154: Hoare triple {163614#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {163105#false} is VALID [2022-04-28 06:07:58,910 INFO L290 TraceCheckUtils]: 153: Hoare triple {163618#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {163614#(< |main_#t~post6| 20)} is VALID [2022-04-28 06:07:58,910 INFO L290 TraceCheckUtils]: 152: Hoare triple {163618#(< ~counter~0 20)} assume !(~r~0 < 0); {163618#(< ~counter~0 20)} is VALID [2022-04-28 06:07:58,910 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {163104#true} {163618#(< ~counter~0 20)} #98#return; {163618#(< ~counter~0 20)} is VALID [2022-04-28 06:07:58,910 INFO L290 TraceCheckUtils]: 150: Hoare triple {163104#true} assume true; {163104#true} is VALID [2022-04-28 06:07:58,911 INFO L290 TraceCheckUtils]: 149: Hoare triple {163104#true} assume !(0 == ~cond); {163104#true} is VALID [2022-04-28 06:07:58,911 INFO L290 TraceCheckUtils]: 148: Hoare triple {163104#true} ~cond := #in~cond; {163104#true} is VALID [2022-04-28 06:07:58,911 INFO L272 TraceCheckUtils]: 147: Hoare triple {163618#(< ~counter~0 20)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {163104#true} is VALID [2022-04-28 06:07:58,911 INFO L290 TraceCheckUtils]: 146: Hoare triple {163618#(< ~counter~0 20)} assume !!(#t~post8 < 20);havoc #t~post8; {163618#(< ~counter~0 20)} is VALID [2022-04-28 06:07:58,914 INFO L290 TraceCheckUtils]: 145: Hoare triple {163643#(< ~counter~0 19)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {163618#(< ~counter~0 20)} is VALID [2022-04-28 06:07:58,915 INFO L290 TraceCheckUtils]: 144: Hoare triple {163643#(< ~counter~0 19)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {163643#(< ~counter~0 19)} is VALID [2022-04-28 06:07:58,915 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {163104#true} {163643#(< ~counter~0 19)} #98#return; {163643#(< ~counter~0 19)} is VALID [2022-04-28 06:07:58,915 INFO L290 TraceCheckUtils]: 142: Hoare triple {163104#true} assume true; {163104#true} is VALID [2022-04-28 06:07:58,915 INFO L290 TraceCheckUtils]: 141: Hoare triple {163104#true} assume !(0 == ~cond); {163104#true} is VALID [2022-04-28 06:07:58,916 INFO L290 TraceCheckUtils]: 140: Hoare triple {163104#true} ~cond := #in~cond; {163104#true} is VALID [2022-04-28 06:07:58,916 INFO L272 TraceCheckUtils]: 139: Hoare triple {163643#(< ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {163104#true} is VALID [2022-04-28 06:07:58,916 INFO L290 TraceCheckUtils]: 138: Hoare triple {163643#(< ~counter~0 19)} assume !!(#t~post8 < 20);havoc #t~post8; {163643#(< ~counter~0 19)} is VALID [2022-04-28 06:07:58,918 INFO L290 TraceCheckUtils]: 137: Hoare triple {163561#(<= ~counter~0 17)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {163643#(< ~counter~0 19)} is VALID [2022-04-28 06:07:58,918 INFO L290 TraceCheckUtils]: 136: Hoare triple {163561#(<= ~counter~0 17)} assume !(~r~0 > 0); {163561#(<= ~counter~0 17)} is VALID [2022-04-28 06:07:58,919 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {163104#true} {163561#(<= ~counter~0 17)} #96#return; {163561#(<= ~counter~0 17)} is VALID [2022-04-28 06:07:58,919 INFO L290 TraceCheckUtils]: 134: Hoare triple {163104#true} assume true; {163104#true} is VALID [2022-04-28 06:07:58,919 INFO L290 TraceCheckUtils]: 133: Hoare triple {163104#true} assume !(0 == ~cond); {163104#true} is VALID [2022-04-28 06:07:58,919 INFO L290 TraceCheckUtils]: 132: Hoare triple {163104#true} ~cond := #in~cond; {163104#true} is VALID [2022-04-28 06:07:58,919 INFO L272 TraceCheckUtils]: 131: Hoare triple {163561#(<= ~counter~0 17)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {163104#true} is VALID [2022-04-28 06:07:58,919 INFO L290 TraceCheckUtils]: 130: Hoare triple {163561#(<= ~counter~0 17)} assume !!(#t~post7 < 20);havoc #t~post7; {163561#(<= ~counter~0 17)} is VALID [2022-04-28 06:07:58,921 INFO L290 TraceCheckUtils]: 129: Hoare triple {163536#(<= ~counter~0 16)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {163561#(<= ~counter~0 17)} is VALID [2022-04-28 06:07:58,921 INFO L290 TraceCheckUtils]: 128: Hoare triple {163536#(<= ~counter~0 16)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {163536#(<= ~counter~0 16)} is VALID [2022-04-28 06:07:58,921 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {163104#true} {163536#(<= ~counter~0 16)} #96#return; {163536#(<= ~counter~0 16)} is VALID [2022-04-28 06:07:58,921 INFO L290 TraceCheckUtils]: 126: Hoare triple {163104#true} assume true; {163104#true} is VALID [2022-04-28 06:07:58,921 INFO L290 TraceCheckUtils]: 125: Hoare triple {163104#true} assume !(0 == ~cond); {163104#true} is VALID [2022-04-28 06:07:58,922 INFO L290 TraceCheckUtils]: 124: Hoare triple {163104#true} ~cond := #in~cond; {163104#true} is VALID [2022-04-28 06:07:58,922 INFO L272 TraceCheckUtils]: 123: Hoare triple {163536#(<= ~counter~0 16)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {163104#true} is VALID [2022-04-28 06:07:58,922 INFO L290 TraceCheckUtils]: 122: Hoare triple {163536#(<= ~counter~0 16)} assume !!(#t~post7 < 20);havoc #t~post7; {163536#(<= ~counter~0 16)} is VALID [2022-04-28 06:07:58,923 INFO L290 TraceCheckUtils]: 121: Hoare triple {163511#(<= ~counter~0 15)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {163536#(<= ~counter~0 16)} is VALID [2022-04-28 06:07:58,923 INFO L290 TraceCheckUtils]: 120: Hoare triple {163511#(<= ~counter~0 15)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {163511#(<= ~counter~0 15)} is VALID [2022-04-28 06:07:58,924 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {163104#true} {163511#(<= ~counter~0 15)} #96#return; {163511#(<= ~counter~0 15)} is VALID [2022-04-28 06:07:58,924 INFO L290 TraceCheckUtils]: 118: Hoare triple {163104#true} assume true; {163104#true} is VALID [2022-04-28 06:07:58,924 INFO L290 TraceCheckUtils]: 117: Hoare triple {163104#true} assume !(0 == ~cond); {163104#true} is VALID [2022-04-28 06:07:58,924 INFO L290 TraceCheckUtils]: 116: Hoare triple {163104#true} ~cond := #in~cond; {163104#true} is VALID [2022-04-28 06:07:58,924 INFO L272 TraceCheckUtils]: 115: Hoare triple {163511#(<= ~counter~0 15)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {163104#true} is VALID [2022-04-28 06:07:58,924 INFO L290 TraceCheckUtils]: 114: Hoare triple {163511#(<= ~counter~0 15)} assume !!(#t~post7 < 20);havoc #t~post7; {163511#(<= ~counter~0 15)} is VALID [2022-04-28 06:07:58,926 INFO L290 TraceCheckUtils]: 113: Hoare triple {163486#(<= ~counter~0 14)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {163511#(<= ~counter~0 15)} is VALID [2022-04-28 06:07:58,926 INFO L290 TraceCheckUtils]: 112: Hoare triple {163486#(<= ~counter~0 14)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {163486#(<= ~counter~0 14)} is VALID [2022-04-28 06:07:58,926 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {163104#true} {163486#(<= ~counter~0 14)} #96#return; {163486#(<= ~counter~0 14)} is VALID [2022-04-28 06:07:58,926 INFO L290 TraceCheckUtils]: 110: Hoare triple {163104#true} assume true; {163104#true} is VALID [2022-04-28 06:07:58,927 INFO L290 TraceCheckUtils]: 109: Hoare triple {163104#true} assume !(0 == ~cond); {163104#true} is VALID [2022-04-28 06:07:58,927 INFO L290 TraceCheckUtils]: 108: Hoare triple {163104#true} ~cond := #in~cond; {163104#true} is VALID [2022-04-28 06:07:58,927 INFO L272 TraceCheckUtils]: 107: Hoare triple {163486#(<= ~counter~0 14)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {163104#true} is VALID [2022-04-28 06:07:58,927 INFO L290 TraceCheckUtils]: 106: Hoare triple {163486#(<= ~counter~0 14)} assume !!(#t~post7 < 20);havoc #t~post7; {163486#(<= ~counter~0 14)} is VALID [2022-04-28 06:07:58,928 INFO L290 TraceCheckUtils]: 105: Hoare triple {163461#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {163486#(<= ~counter~0 14)} is VALID [2022-04-28 06:07:58,929 INFO L290 TraceCheckUtils]: 104: Hoare triple {163461#(<= ~counter~0 13)} assume !!(0 != ~r~0); {163461#(<= ~counter~0 13)} is VALID [2022-04-28 06:07:58,929 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {163104#true} {163461#(<= ~counter~0 13)} #94#return; {163461#(<= ~counter~0 13)} is VALID [2022-04-28 06:07:58,929 INFO L290 TraceCheckUtils]: 102: Hoare triple {163104#true} assume true; {163104#true} is VALID [2022-04-28 06:07:58,929 INFO L290 TraceCheckUtils]: 101: Hoare triple {163104#true} assume !(0 == ~cond); {163104#true} is VALID [2022-04-28 06:07:58,929 INFO L290 TraceCheckUtils]: 100: Hoare triple {163104#true} ~cond := #in~cond; {163104#true} is VALID [2022-04-28 06:07:58,929 INFO L272 TraceCheckUtils]: 99: Hoare triple {163461#(<= ~counter~0 13)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {163104#true} is VALID [2022-04-28 06:07:58,930 INFO L290 TraceCheckUtils]: 98: Hoare triple {163461#(<= ~counter~0 13)} assume !!(#t~post6 < 20);havoc #t~post6; {163461#(<= ~counter~0 13)} is VALID [2022-04-28 06:07:58,931 INFO L290 TraceCheckUtils]: 97: Hoare triple {163436#(<= ~counter~0 12)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {163461#(<= ~counter~0 13)} is VALID [2022-04-28 06:07:58,931 INFO L290 TraceCheckUtils]: 96: Hoare triple {163436#(<= ~counter~0 12)} assume !(~r~0 < 0); {163436#(<= ~counter~0 12)} is VALID [2022-04-28 06:07:58,932 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {163104#true} {163436#(<= ~counter~0 12)} #98#return; {163436#(<= ~counter~0 12)} is VALID [2022-04-28 06:07:58,932 INFO L290 TraceCheckUtils]: 94: Hoare triple {163104#true} assume true; {163104#true} is VALID [2022-04-28 06:07:58,932 INFO L290 TraceCheckUtils]: 93: Hoare triple {163104#true} assume !(0 == ~cond); {163104#true} is VALID [2022-04-28 06:07:58,932 INFO L290 TraceCheckUtils]: 92: Hoare triple {163104#true} ~cond := #in~cond; {163104#true} is VALID [2022-04-28 06:07:58,932 INFO L272 TraceCheckUtils]: 91: Hoare triple {163436#(<= ~counter~0 12)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {163104#true} is VALID [2022-04-28 06:07:58,932 INFO L290 TraceCheckUtils]: 90: Hoare triple {163436#(<= ~counter~0 12)} assume !!(#t~post8 < 20);havoc #t~post8; {163436#(<= ~counter~0 12)} is VALID [2022-04-28 06:07:58,934 INFO L290 TraceCheckUtils]: 89: Hoare triple {163411#(<= ~counter~0 11)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {163436#(<= ~counter~0 12)} is VALID [2022-04-28 06:07:58,934 INFO L290 TraceCheckUtils]: 88: Hoare triple {163411#(<= ~counter~0 11)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {163411#(<= ~counter~0 11)} is VALID [2022-04-28 06:07:58,935 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {163104#true} {163411#(<= ~counter~0 11)} #98#return; {163411#(<= ~counter~0 11)} is VALID [2022-04-28 06:07:58,935 INFO L290 TraceCheckUtils]: 86: Hoare triple {163104#true} assume true; {163104#true} is VALID [2022-04-28 06:07:58,935 INFO L290 TraceCheckUtils]: 85: Hoare triple {163104#true} assume !(0 == ~cond); {163104#true} is VALID [2022-04-28 06:07:58,935 INFO L290 TraceCheckUtils]: 84: Hoare triple {163104#true} ~cond := #in~cond; {163104#true} is VALID [2022-04-28 06:07:58,935 INFO L272 TraceCheckUtils]: 83: Hoare triple {163411#(<= ~counter~0 11)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {163104#true} is VALID [2022-04-28 06:07:58,935 INFO L290 TraceCheckUtils]: 82: Hoare triple {163411#(<= ~counter~0 11)} assume !!(#t~post8 < 20);havoc #t~post8; {163411#(<= ~counter~0 11)} is VALID [2022-04-28 06:07:58,937 INFO L290 TraceCheckUtils]: 81: Hoare triple {163386#(<= ~counter~0 10)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {163411#(<= ~counter~0 11)} is VALID [2022-04-28 06:07:58,937 INFO L290 TraceCheckUtils]: 80: Hoare triple {163386#(<= ~counter~0 10)} assume !(~r~0 > 0); {163386#(<= ~counter~0 10)} is VALID [2022-04-28 06:07:58,937 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {163104#true} {163386#(<= ~counter~0 10)} #96#return; {163386#(<= ~counter~0 10)} is VALID [2022-04-28 06:07:58,937 INFO L290 TraceCheckUtils]: 78: Hoare triple {163104#true} assume true; {163104#true} is VALID [2022-04-28 06:07:58,938 INFO L290 TraceCheckUtils]: 77: Hoare triple {163104#true} assume !(0 == ~cond); {163104#true} is VALID [2022-04-28 06:07:58,938 INFO L290 TraceCheckUtils]: 76: Hoare triple {163104#true} ~cond := #in~cond; {163104#true} is VALID [2022-04-28 06:07:58,938 INFO L272 TraceCheckUtils]: 75: Hoare triple {163386#(<= ~counter~0 10)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {163104#true} is VALID [2022-04-28 06:07:58,938 INFO L290 TraceCheckUtils]: 74: Hoare triple {163386#(<= ~counter~0 10)} assume !!(#t~post7 < 20);havoc #t~post7; {163386#(<= ~counter~0 10)} is VALID [2022-04-28 06:07:58,939 INFO L290 TraceCheckUtils]: 73: Hoare triple {163361#(<= ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {163386#(<= ~counter~0 10)} is VALID [2022-04-28 06:07:58,940 INFO L290 TraceCheckUtils]: 72: Hoare triple {163361#(<= ~counter~0 9)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {163361#(<= ~counter~0 9)} is VALID [2022-04-28 06:07:58,940 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {163104#true} {163361#(<= ~counter~0 9)} #96#return; {163361#(<= ~counter~0 9)} is VALID [2022-04-28 06:07:58,940 INFO L290 TraceCheckUtils]: 70: Hoare triple {163104#true} assume true; {163104#true} is VALID [2022-04-28 06:07:58,940 INFO L290 TraceCheckUtils]: 69: Hoare triple {163104#true} assume !(0 == ~cond); {163104#true} is VALID [2022-04-28 06:07:58,940 INFO L290 TraceCheckUtils]: 68: Hoare triple {163104#true} ~cond := #in~cond; {163104#true} is VALID [2022-04-28 06:07:58,940 INFO L272 TraceCheckUtils]: 67: Hoare triple {163361#(<= ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {163104#true} is VALID [2022-04-28 06:07:58,941 INFO L290 TraceCheckUtils]: 66: Hoare triple {163361#(<= ~counter~0 9)} assume !!(#t~post7 < 20);havoc #t~post7; {163361#(<= ~counter~0 9)} is VALID [2022-04-28 06:07:58,942 INFO L290 TraceCheckUtils]: 65: Hoare triple {163336#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {163361#(<= ~counter~0 9)} is VALID [2022-04-28 06:07:58,942 INFO L290 TraceCheckUtils]: 64: Hoare triple {163336#(<= ~counter~0 8)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {163336#(<= ~counter~0 8)} is VALID [2022-04-28 06:07:58,943 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {163104#true} {163336#(<= ~counter~0 8)} #96#return; {163336#(<= ~counter~0 8)} is VALID [2022-04-28 06:07:58,943 INFO L290 TraceCheckUtils]: 62: Hoare triple {163104#true} assume true; {163104#true} is VALID [2022-04-28 06:07:58,943 INFO L290 TraceCheckUtils]: 61: Hoare triple {163104#true} assume !(0 == ~cond); {163104#true} is VALID [2022-04-28 06:07:58,943 INFO L290 TraceCheckUtils]: 60: Hoare triple {163104#true} ~cond := #in~cond; {163104#true} is VALID [2022-04-28 06:07:58,943 INFO L272 TraceCheckUtils]: 59: Hoare triple {163336#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {163104#true} is VALID [2022-04-28 06:07:58,943 INFO L290 TraceCheckUtils]: 58: Hoare triple {163336#(<= ~counter~0 8)} assume !!(#t~post7 < 20);havoc #t~post7; {163336#(<= ~counter~0 8)} is VALID [2022-04-28 06:07:58,944 INFO L290 TraceCheckUtils]: 57: Hoare triple {163311#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {163336#(<= ~counter~0 8)} is VALID [2022-04-28 06:07:58,945 INFO L290 TraceCheckUtils]: 56: Hoare triple {163311#(<= ~counter~0 7)} assume !!(0 != ~r~0); {163311#(<= ~counter~0 7)} is VALID [2022-04-28 06:07:58,945 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {163104#true} {163311#(<= ~counter~0 7)} #94#return; {163311#(<= ~counter~0 7)} is VALID [2022-04-28 06:07:58,945 INFO L290 TraceCheckUtils]: 54: Hoare triple {163104#true} assume true; {163104#true} is VALID [2022-04-28 06:07:58,945 INFO L290 TraceCheckUtils]: 53: Hoare triple {163104#true} assume !(0 == ~cond); {163104#true} is VALID [2022-04-28 06:07:58,945 INFO L290 TraceCheckUtils]: 52: Hoare triple {163104#true} ~cond := #in~cond; {163104#true} is VALID [2022-04-28 06:07:58,945 INFO L272 TraceCheckUtils]: 51: Hoare triple {163311#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {163104#true} is VALID [2022-04-28 06:07:58,946 INFO L290 TraceCheckUtils]: 50: Hoare triple {163311#(<= ~counter~0 7)} assume !!(#t~post6 < 20);havoc #t~post6; {163311#(<= ~counter~0 7)} is VALID [2022-04-28 06:07:58,947 INFO L290 TraceCheckUtils]: 49: Hoare triple {163286#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {163311#(<= ~counter~0 7)} is VALID [2022-04-28 06:07:58,948 INFO L290 TraceCheckUtils]: 48: Hoare triple {163286#(<= ~counter~0 6)} assume !(~r~0 < 0); {163286#(<= ~counter~0 6)} is VALID [2022-04-28 06:07:58,948 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {163104#true} {163286#(<= ~counter~0 6)} #98#return; {163286#(<= ~counter~0 6)} is VALID [2022-04-28 06:07:58,948 INFO L290 TraceCheckUtils]: 46: Hoare triple {163104#true} assume true; {163104#true} is VALID [2022-04-28 06:07:58,948 INFO L290 TraceCheckUtils]: 45: Hoare triple {163104#true} assume !(0 == ~cond); {163104#true} is VALID [2022-04-28 06:07:58,948 INFO L290 TraceCheckUtils]: 44: Hoare triple {163104#true} ~cond := #in~cond; {163104#true} is VALID [2022-04-28 06:07:58,948 INFO L272 TraceCheckUtils]: 43: Hoare triple {163286#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {163104#true} is VALID [2022-04-28 06:07:58,949 INFO L290 TraceCheckUtils]: 42: Hoare triple {163286#(<= ~counter~0 6)} assume !!(#t~post8 < 20);havoc #t~post8; {163286#(<= ~counter~0 6)} is VALID [2022-04-28 06:07:58,950 INFO L290 TraceCheckUtils]: 41: Hoare triple {163261#(<= ~counter~0 5)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {163286#(<= ~counter~0 6)} is VALID [2022-04-28 06:07:58,950 INFO L290 TraceCheckUtils]: 40: Hoare triple {163261#(<= ~counter~0 5)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {163261#(<= ~counter~0 5)} is VALID [2022-04-28 06:07:58,951 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {163104#true} {163261#(<= ~counter~0 5)} #98#return; {163261#(<= ~counter~0 5)} is VALID [2022-04-28 06:07:58,951 INFO L290 TraceCheckUtils]: 38: Hoare triple {163104#true} assume true; {163104#true} is VALID [2022-04-28 06:07:58,951 INFO L290 TraceCheckUtils]: 37: Hoare triple {163104#true} assume !(0 == ~cond); {163104#true} is VALID [2022-04-28 06:07:58,951 INFO L290 TraceCheckUtils]: 36: Hoare triple {163104#true} ~cond := #in~cond; {163104#true} is VALID [2022-04-28 06:07:58,951 INFO L272 TraceCheckUtils]: 35: Hoare triple {163261#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {163104#true} is VALID [2022-04-28 06:07:58,951 INFO L290 TraceCheckUtils]: 34: Hoare triple {163261#(<= ~counter~0 5)} assume !!(#t~post8 < 20);havoc #t~post8; {163261#(<= ~counter~0 5)} is VALID [2022-04-28 06:07:58,953 INFO L290 TraceCheckUtils]: 33: Hoare triple {163236#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {163261#(<= ~counter~0 5)} is VALID [2022-04-28 06:07:58,953 INFO L290 TraceCheckUtils]: 32: Hoare triple {163236#(<= ~counter~0 4)} assume !(~r~0 > 0); {163236#(<= ~counter~0 4)} is VALID [2022-04-28 06:07:58,954 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {163104#true} {163236#(<= ~counter~0 4)} #96#return; {163236#(<= ~counter~0 4)} is VALID [2022-04-28 06:07:58,954 INFO L290 TraceCheckUtils]: 30: Hoare triple {163104#true} assume true; {163104#true} is VALID [2022-04-28 06:07:58,954 INFO L290 TraceCheckUtils]: 29: Hoare triple {163104#true} assume !(0 == ~cond); {163104#true} is VALID [2022-04-28 06:07:58,954 INFO L290 TraceCheckUtils]: 28: Hoare triple {163104#true} ~cond := #in~cond; {163104#true} is VALID [2022-04-28 06:07:58,954 INFO L272 TraceCheckUtils]: 27: Hoare triple {163236#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {163104#true} is VALID [2022-04-28 06:07:58,954 INFO L290 TraceCheckUtils]: 26: Hoare triple {163236#(<= ~counter~0 4)} assume !!(#t~post7 < 20);havoc #t~post7; {163236#(<= ~counter~0 4)} is VALID [2022-04-28 06:07:58,955 INFO L290 TraceCheckUtils]: 25: Hoare triple {163211#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {163236#(<= ~counter~0 4)} is VALID [2022-04-28 06:07:58,956 INFO L290 TraceCheckUtils]: 24: Hoare triple {163211#(<= ~counter~0 3)} assume !!(0 != ~r~0); {163211#(<= ~counter~0 3)} is VALID [2022-04-28 06:07:58,956 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {163104#true} {163211#(<= ~counter~0 3)} #94#return; {163211#(<= ~counter~0 3)} is VALID [2022-04-28 06:07:58,956 INFO L290 TraceCheckUtils]: 22: Hoare triple {163104#true} assume true; {163104#true} is VALID [2022-04-28 06:07:58,956 INFO L290 TraceCheckUtils]: 21: Hoare triple {163104#true} assume !(0 == ~cond); {163104#true} is VALID [2022-04-28 06:07:58,956 INFO L290 TraceCheckUtils]: 20: Hoare triple {163104#true} ~cond := #in~cond; {163104#true} is VALID [2022-04-28 06:07:58,956 INFO L272 TraceCheckUtils]: 19: Hoare triple {163211#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {163104#true} is VALID [2022-04-28 06:07:58,957 INFO L290 TraceCheckUtils]: 18: Hoare triple {163211#(<= ~counter~0 3)} assume !!(#t~post6 < 20);havoc #t~post6; {163211#(<= ~counter~0 3)} is VALID [2022-04-28 06:07:58,958 INFO L290 TraceCheckUtils]: 17: Hoare triple {163186#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {163211#(<= ~counter~0 3)} is VALID [2022-04-28 06:07:58,958 INFO L290 TraceCheckUtils]: 16: Hoare triple {163186#(<= ~counter~0 2)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {163186#(<= ~counter~0 2)} is VALID [2022-04-28 06:07:58,959 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {163104#true} {163186#(<= ~counter~0 2)} #92#return; {163186#(<= ~counter~0 2)} is VALID [2022-04-28 06:07:58,959 INFO L290 TraceCheckUtils]: 14: Hoare triple {163104#true} assume true; {163104#true} is VALID [2022-04-28 06:07:58,959 INFO L290 TraceCheckUtils]: 13: Hoare triple {163104#true} assume !(0 == ~cond); {163104#true} is VALID [2022-04-28 06:07:58,959 INFO L290 TraceCheckUtils]: 12: Hoare triple {163104#true} ~cond := #in~cond; {163104#true} is VALID [2022-04-28 06:07:58,959 INFO L272 TraceCheckUtils]: 11: Hoare triple {163186#(<= ~counter~0 2)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {163104#true} is VALID [2022-04-28 06:07:58,959 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {163104#true} {163186#(<= ~counter~0 2)} #90#return; {163186#(<= ~counter~0 2)} is VALID [2022-04-28 06:07:58,959 INFO L290 TraceCheckUtils]: 9: Hoare triple {163104#true} assume true; {163104#true} is VALID [2022-04-28 06:07:58,959 INFO L290 TraceCheckUtils]: 8: Hoare triple {163104#true} assume !(0 == ~cond); {163104#true} is VALID [2022-04-28 06:07:58,960 INFO L290 TraceCheckUtils]: 7: Hoare triple {163104#true} ~cond := #in~cond; {163104#true} is VALID [2022-04-28 06:07:58,960 INFO L272 TraceCheckUtils]: 6: Hoare triple {163186#(<= ~counter~0 2)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {163104#true} is VALID [2022-04-28 06:07:58,960 INFO L290 TraceCheckUtils]: 5: Hoare triple {163186#(<= ~counter~0 2)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {163186#(<= ~counter~0 2)} is VALID [2022-04-28 06:07:58,960 INFO L272 TraceCheckUtils]: 4: Hoare triple {163186#(<= ~counter~0 2)} call #t~ret9 := main(); {163186#(<= ~counter~0 2)} is VALID [2022-04-28 06:07:58,960 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {163186#(<= ~counter~0 2)} {163104#true} #102#return; {163186#(<= ~counter~0 2)} is VALID [2022-04-28 06:07:58,961 INFO L290 TraceCheckUtils]: 2: Hoare triple {163186#(<= ~counter~0 2)} assume true; {163186#(<= ~counter~0 2)} is VALID [2022-04-28 06:07:58,961 INFO L290 TraceCheckUtils]: 1: Hoare triple {163104#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {163186#(<= ~counter~0 2)} is VALID [2022-04-28 06:07:58,961 INFO L272 TraceCheckUtils]: 0: Hoare triple {163104#true} call ULTIMATE.init(); {163104#true} is VALID [2022-04-28 06:07:58,962 INFO L134 CoverageAnalysis]: Checked inductivity of 772 backedges. 34 proven. 190 refuted. 0 times theorem prover too weak. 548 trivial. 0 not checked. [2022-04-28 06:07:58,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:07:58,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211979062] [2022-04-28 06:07:58,962 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:07:58,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1528000675] [2022-04-28 06:07:58,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1528000675] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 06:07:58,962 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 06:07:58,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 24 [2022-04-28 06:07:58,962 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:07:58,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [541114689] [2022-04-28 06:07:58,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [541114689] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:07:58,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:07:58,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-28 06:07:58,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44935883] [2022-04-28 06:07:58,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:07:58,963 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 5.428571428571429) internal successors, (114), 20 states have internal predecessors, (114), 20 states have call successors, (22), 20 states have call predecessors, (22), 18 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) Word has length 159 [2022-04-28 06:07:58,963 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:07:58,963 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 5.428571428571429) internal successors, (114), 20 states have internal predecessors, (114), 20 states have call successors, (22), 20 states have call predecessors, (22), 18 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) [2022-04-28 06:07:59,151 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 156 edges. 156 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:07:59,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-28 06:07:59,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:07:59,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-28 06:07:59,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-28 06:07:59,152 INFO L87 Difference]: Start difference. First operand 851 states and 1131 transitions. Second operand has 21 states, 21 states have (on average 5.428571428571429) internal successors, (114), 20 states have internal predecessors, (114), 20 states have call successors, (22), 20 states have call predecessors, (22), 18 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) [2022-04-28 06:08:05,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:08:05,211 INFO L93 Difference]: Finished difference Result 902 states and 1201 transitions. [2022-04-28 06:08:05,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-04-28 06:08:05,211 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 5.428571428571429) internal successors, (114), 20 states have internal predecessors, (114), 20 states have call successors, (22), 20 states have call predecessors, (22), 18 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) Word has length 159 [2022-04-28 06:08:05,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:08:05,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 5.428571428571429) internal successors, (114), 20 states have internal predecessors, (114), 20 states have call successors, (22), 20 states have call predecessors, (22), 18 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) [2022-04-28 06:08:05,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 354 transitions. [2022-04-28 06:08:05,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 5.428571428571429) internal successors, (114), 20 states have internal predecessors, (114), 20 states have call successors, (22), 20 states have call predecessors, (22), 18 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) [2022-04-28 06:08:05,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 354 transitions. [2022-04-28 06:08:05,218 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 354 transitions. [2022-04-28 06:08:05,671 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 354 edges. 354 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:08:05,703 INFO L225 Difference]: With dead ends: 902 [2022-04-28 06:08:05,704 INFO L226 Difference]: Without dead ends: 897 [2022-04-28 06:08:05,704 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 294 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=519, Invalid=887, Unknown=0, NotChecked=0, Total=1406 [2022-04-28 06:08:05,704 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 268 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 234 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 234 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-28 06:08:05,704 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 397 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [234 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-28 06:08:05,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2022-04-28 06:08:09,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 875. [2022-04-28 06:08:09,142 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:08:09,143 INFO L82 GeneralOperation]: Start isEquivalent. First operand 897 states. Second operand has 875 states, 651 states have (on average 1.1781874039938556) internal successors, (767), 668 states have internal predecessors, (767), 202 states have call successors, (202), 23 states have call predecessors, (202), 21 states have return successors, (200), 183 states have call predecessors, (200), 200 states have call successors, (200) [2022-04-28 06:08:09,143 INFO L74 IsIncluded]: Start isIncluded. First operand 897 states. Second operand has 875 states, 651 states have (on average 1.1781874039938556) internal successors, (767), 668 states have internal predecessors, (767), 202 states have call successors, (202), 23 states have call predecessors, (202), 21 states have return successors, (200), 183 states have call predecessors, (200), 200 states have call successors, (200) [2022-04-28 06:08:09,144 INFO L87 Difference]: Start difference. First operand 897 states. Second operand has 875 states, 651 states have (on average 1.1781874039938556) internal successors, (767), 668 states have internal predecessors, (767), 202 states have call successors, (202), 23 states have call predecessors, (202), 21 states have return successors, (200), 183 states have call predecessors, (200), 200 states have call successors, (200) [2022-04-28 06:08:09,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:08:09,169 INFO L93 Difference]: Finished difference Result 897 states and 1195 transitions. [2022-04-28 06:08:09,169 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 1195 transitions. [2022-04-28 06:08:09,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:08:09,170 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:08:09,171 INFO L74 IsIncluded]: Start isIncluded. First operand has 875 states, 651 states have (on average 1.1781874039938556) internal successors, (767), 668 states have internal predecessors, (767), 202 states have call successors, (202), 23 states have call predecessors, (202), 21 states have return successors, (200), 183 states have call predecessors, (200), 200 states have call successors, (200) Second operand 897 states. [2022-04-28 06:08:09,171 INFO L87 Difference]: Start difference. First operand has 875 states, 651 states have (on average 1.1781874039938556) internal successors, (767), 668 states have internal predecessors, (767), 202 states have call successors, (202), 23 states have call predecessors, (202), 21 states have return successors, (200), 183 states have call predecessors, (200), 200 states have call successors, (200) Second operand 897 states. [2022-04-28 06:08:09,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:08:09,196 INFO L93 Difference]: Finished difference Result 897 states and 1195 transitions. [2022-04-28 06:08:09,196 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 1195 transitions. [2022-04-28 06:08:09,197 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:08:09,197 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:08:09,197 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:08:09,197 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:08:09,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 875 states, 651 states have (on average 1.1781874039938556) internal successors, (767), 668 states have internal predecessors, (767), 202 states have call successors, (202), 23 states have call predecessors, (202), 21 states have return successors, (200), 183 states have call predecessors, (200), 200 states have call successors, (200) [2022-04-28 06:08:09,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 1169 transitions. [2022-04-28 06:08:09,230 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 1169 transitions. Word has length 159 [2022-04-28 06:08:09,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:08:09,230 INFO L495 AbstractCegarLoop]: Abstraction has 875 states and 1169 transitions. [2022-04-28 06:08:09,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 5.428571428571429) internal successors, (114), 20 states have internal predecessors, (114), 20 states have call successors, (22), 20 states have call predecessors, (22), 18 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) [2022-04-28 06:08:09,230 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 875 states and 1169 transitions. [2022-04-28 06:08:21,448 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1169 edges. 1168 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 06:08:21,448 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1169 transitions. [2022-04-28 06:08:21,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-04-28 06:08:21,450 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:08:21,450 INFO L195 NwaCegarLoop]: trace histogram [18, 17, 17, 9, 9, 9, 9, 6, 6, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:08:21,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Forceful destruction successful, exit code 0 [2022-04-28 06:08:21,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54,56 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:08:21,651 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:08:21,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:08:21,651 INFO L85 PathProgramCache]: Analyzing trace with hash -160708573, now seen corresponding path program 29 times [2022-04-28 06:08:21,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:08:21,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [351791962] [2022-04-28 06:08:21,652 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 06:08:21,652 INFO L85 PathProgramCache]: Analyzing trace with hash -160708573, now seen corresponding path program 30 times [2022-04-28 06:08:21,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:08:21,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744659679] [2022-04-28 06:08:21,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:08:21,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:08:21,672 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:08:21,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [501980006] [2022-04-28 06:08:21,673 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 06:08:21,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:08:21,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:08:21,674 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:08:21,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Waiting until timeout for monitored process [2022-04-28 06:08:23,061 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-04-28 06:08:23,061 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:08:23,064 INFO L263 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-28 06:08:23,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:08:23,108 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:08:24,435 INFO L272 TraceCheckUtils]: 0: Hoare triple {169457#true} call ULTIMATE.init(); {169457#true} is VALID [2022-04-28 06:08:24,435 INFO L290 TraceCheckUtils]: 1: Hoare triple {169457#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {169465#(<= ~counter~0 0)} is VALID [2022-04-28 06:08:24,436 INFO L290 TraceCheckUtils]: 2: Hoare triple {169465#(<= ~counter~0 0)} assume true; {169465#(<= ~counter~0 0)} is VALID [2022-04-28 06:08:24,436 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {169465#(<= ~counter~0 0)} {169457#true} #102#return; {169465#(<= ~counter~0 0)} is VALID [2022-04-28 06:08:24,436 INFO L272 TraceCheckUtils]: 4: Hoare triple {169465#(<= ~counter~0 0)} call #t~ret9 := main(); {169465#(<= ~counter~0 0)} is VALID [2022-04-28 06:08:24,437 INFO L290 TraceCheckUtils]: 5: Hoare triple {169465#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {169465#(<= ~counter~0 0)} is VALID [2022-04-28 06:08:24,437 INFO L272 TraceCheckUtils]: 6: Hoare triple {169465#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {169465#(<= ~counter~0 0)} is VALID [2022-04-28 06:08:24,438 INFO L290 TraceCheckUtils]: 7: Hoare triple {169465#(<= ~counter~0 0)} ~cond := #in~cond; {169465#(<= ~counter~0 0)} is VALID [2022-04-28 06:08:24,438 INFO L290 TraceCheckUtils]: 8: Hoare triple {169465#(<= ~counter~0 0)} assume !(0 == ~cond); {169465#(<= ~counter~0 0)} is VALID [2022-04-28 06:08:24,438 INFO L290 TraceCheckUtils]: 9: Hoare triple {169465#(<= ~counter~0 0)} assume true; {169465#(<= ~counter~0 0)} is VALID [2022-04-28 06:08:24,439 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {169465#(<= ~counter~0 0)} {169465#(<= ~counter~0 0)} #90#return; {169465#(<= ~counter~0 0)} is VALID [2022-04-28 06:08:24,439 INFO L272 TraceCheckUtils]: 11: Hoare triple {169465#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {169465#(<= ~counter~0 0)} is VALID [2022-04-28 06:08:24,440 INFO L290 TraceCheckUtils]: 12: Hoare triple {169465#(<= ~counter~0 0)} ~cond := #in~cond; {169465#(<= ~counter~0 0)} is VALID [2022-04-28 06:08:24,440 INFO L290 TraceCheckUtils]: 13: Hoare triple {169465#(<= ~counter~0 0)} assume !(0 == ~cond); {169465#(<= ~counter~0 0)} is VALID [2022-04-28 06:08:24,440 INFO L290 TraceCheckUtils]: 14: Hoare triple {169465#(<= ~counter~0 0)} assume true; {169465#(<= ~counter~0 0)} is VALID [2022-04-28 06:08:24,441 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {169465#(<= ~counter~0 0)} {169465#(<= ~counter~0 0)} #92#return; {169465#(<= ~counter~0 0)} is VALID [2022-04-28 06:08:24,441 INFO L290 TraceCheckUtils]: 16: Hoare triple {169465#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {169465#(<= ~counter~0 0)} is VALID [2022-04-28 06:08:24,445 INFO L290 TraceCheckUtils]: 17: Hoare triple {169465#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {169514#(<= ~counter~0 1)} is VALID [2022-04-28 06:08:24,446 INFO L290 TraceCheckUtils]: 18: Hoare triple {169514#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {169514#(<= ~counter~0 1)} is VALID [2022-04-28 06:08:24,446 INFO L272 TraceCheckUtils]: 19: Hoare triple {169514#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {169514#(<= ~counter~0 1)} is VALID [2022-04-28 06:08:24,447 INFO L290 TraceCheckUtils]: 20: Hoare triple {169514#(<= ~counter~0 1)} ~cond := #in~cond; {169514#(<= ~counter~0 1)} is VALID [2022-04-28 06:08:24,447 INFO L290 TraceCheckUtils]: 21: Hoare triple {169514#(<= ~counter~0 1)} assume !(0 == ~cond); {169514#(<= ~counter~0 1)} is VALID [2022-04-28 06:08:24,447 INFO L290 TraceCheckUtils]: 22: Hoare triple {169514#(<= ~counter~0 1)} assume true; {169514#(<= ~counter~0 1)} is VALID [2022-04-28 06:08:24,448 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {169514#(<= ~counter~0 1)} {169514#(<= ~counter~0 1)} #94#return; {169514#(<= ~counter~0 1)} is VALID [2022-04-28 06:08:24,448 INFO L290 TraceCheckUtils]: 24: Hoare triple {169514#(<= ~counter~0 1)} assume !!(0 != ~r~0); {169514#(<= ~counter~0 1)} is VALID [2022-04-28 06:08:24,451 INFO L290 TraceCheckUtils]: 25: Hoare triple {169514#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {169539#(<= ~counter~0 2)} is VALID [2022-04-28 06:08:24,452 INFO L290 TraceCheckUtils]: 26: Hoare triple {169539#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {169539#(<= ~counter~0 2)} is VALID [2022-04-28 06:08:24,452 INFO L272 TraceCheckUtils]: 27: Hoare triple {169539#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {169539#(<= ~counter~0 2)} is VALID [2022-04-28 06:08:24,453 INFO L290 TraceCheckUtils]: 28: Hoare triple {169539#(<= ~counter~0 2)} ~cond := #in~cond; {169539#(<= ~counter~0 2)} is VALID [2022-04-28 06:08:24,453 INFO L290 TraceCheckUtils]: 29: Hoare triple {169539#(<= ~counter~0 2)} assume !(0 == ~cond); {169539#(<= ~counter~0 2)} is VALID [2022-04-28 06:08:24,453 INFO L290 TraceCheckUtils]: 30: Hoare triple {169539#(<= ~counter~0 2)} assume true; {169539#(<= ~counter~0 2)} is VALID [2022-04-28 06:08:24,454 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {169539#(<= ~counter~0 2)} {169539#(<= ~counter~0 2)} #96#return; {169539#(<= ~counter~0 2)} is VALID [2022-04-28 06:08:24,454 INFO L290 TraceCheckUtils]: 32: Hoare triple {169539#(<= ~counter~0 2)} assume !(~r~0 > 0); {169539#(<= ~counter~0 2)} is VALID [2022-04-28 06:08:24,458 INFO L290 TraceCheckUtils]: 33: Hoare triple {169539#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {169564#(<= ~counter~0 3)} is VALID [2022-04-28 06:08:24,458 INFO L290 TraceCheckUtils]: 34: Hoare triple {169564#(<= ~counter~0 3)} assume !!(#t~post8 < 20);havoc #t~post8; {169564#(<= ~counter~0 3)} is VALID [2022-04-28 06:08:24,459 INFO L272 TraceCheckUtils]: 35: Hoare triple {169564#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {169564#(<= ~counter~0 3)} is VALID [2022-04-28 06:08:24,459 INFO L290 TraceCheckUtils]: 36: Hoare triple {169564#(<= ~counter~0 3)} ~cond := #in~cond; {169564#(<= ~counter~0 3)} is VALID [2022-04-28 06:08:24,459 INFO L290 TraceCheckUtils]: 37: Hoare triple {169564#(<= ~counter~0 3)} assume !(0 == ~cond); {169564#(<= ~counter~0 3)} is VALID [2022-04-28 06:08:24,460 INFO L290 TraceCheckUtils]: 38: Hoare triple {169564#(<= ~counter~0 3)} assume true; {169564#(<= ~counter~0 3)} is VALID [2022-04-28 06:08:24,460 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {169564#(<= ~counter~0 3)} {169564#(<= ~counter~0 3)} #98#return; {169564#(<= ~counter~0 3)} is VALID [2022-04-28 06:08:24,461 INFO L290 TraceCheckUtils]: 40: Hoare triple {169564#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {169564#(<= ~counter~0 3)} is VALID [2022-04-28 06:08:24,463 INFO L290 TraceCheckUtils]: 41: Hoare triple {169564#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {169589#(<= ~counter~0 4)} is VALID [2022-04-28 06:08:24,463 INFO L290 TraceCheckUtils]: 42: Hoare triple {169589#(<= ~counter~0 4)} assume !!(#t~post8 < 20);havoc #t~post8; {169589#(<= ~counter~0 4)} is VALID [2022-04-28 06:08:24,464 INFO L272 TraceCheckUtils]: 43: Hoare triple {169589#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {169589#(<= ~counter~0 4)} is VALID [2022-04-28 06:08:24,464 INFO L290 TraceCheckUtils]: 44: Hoare triple {169589#(<= ~counter~0 4)} ~cond := #in~cond; {169589#(<= ~counter~0 4)} is VALID [2022-04-28 06:08:24,464 INFO L290 TraceCheckUtils]: 45: Hoare triple {169589#(<= ~counter~0 4)} assume !(0 == ~cond); {169589#(<= ~counter~0 4)} is VALID [2022-04-28 06:08:24,465 INFO L290 TraceCheckUtils]: 46: Hoare triple {169589#(<= ~counter~0 4)} assume true; {169589#(<= ~counter~0 4)} is VALID [2022-04-28 06:08:24,465 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {169589#(<= ~counter~0 4)} {169589#(<= ~counter~0 4)} #98#return; {169589#(<= ~counter~0 4)} is VALID [2022-04-28 06:08:24,466 INFO L290 TraceCheckUtils]: 48: Hoare triple {169589#(<= ~counter~0 4)} assume !(~r~0 < 0); {169589#(<= ~counter~0 4)} is VALID [2022-04-28 06:08:24,468 INFO L290 TraceCheckUtils]: 49: Hoare triple {169589#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {169614#(<= ~counter~0 5)} is VALID [2022-04-28 06:08:24,468 INFO L290 TraceCheckUtils]: 50: Hoare triple {169614#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {169614#(<= ~counter~0 5)} is VALID [2022-04-28 06:08:24,469 INFO L272 TraceCheckUtils]: 51: Hoare triple {169614#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {169614#(<= ~counter~0 5)} is VALID [2022-04-28 06:08:24,469 INFO L290 TraceCheckUtils]: 52: Hoare triple {169614#(<= ~counter~0 5)} ~cond := #in~cond; {169614#(<= ~counter~0 5)} is VALID [2022-04-28 06:08:24,469 INFO L290 TraceCheckUtils]: 53: Hoare triple {169614#(<= ~counter~0 5)} assume !(0 == ~cond); {169614#(<= ~counter~0 5)} is VALID [2022-04-28 06:08:24,470 INFO L290 TraceCheckUtils]: 54: Hoare triple {169614#(<= ~counter~0 5)} assume true; {169614#(<= ~counter~0 5)} is VALID [2022-04-28 06:08:24,470 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {169614#(<= ~counter~0 5)} {169614#(<= ~counter~0 5)} #94#return; {169614#(<= ~counter~0 5)} is VALID [2022-04-28 06:08:24,470 INFO L290 TraceCheckUtils]: 56: Hoare triple {169614#(<= ~counter~0 5)} assume !!(0 != ~r~0); {169614#(<= ~counter~0 5)} is VALID [2022-04-28 06:08:24,473 INFO L290 TraceCheckUtils]: 57: Hoare triple {169614#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {169639#(<= ~counter~0 6)} is VALID [2022-04-28 06:08:24,474 INFO L290 TraceCheckUtils]: 58: Hoare triple {169639#(<= ~counter~0 6)} assume !!(#t~post7 < 20);havoc #t~post7; {169639#(<= ~counter~0 6)} is VALID [2022-04-28 06:08:24,474 INFO L272 TraceCheckUtils]: 59: Hoare triple {169639#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {169639#(<= ~counter~0 6)} is VALID [2022-04-28 06:08:24,475 INFO L290 TraceCheckUtils]: 60: Hoare triple {169639#(<= ~counter~0 6)} ~cond := #in~cond; {169639#(<= ~counter~0 6)} is VALID [2022-04-28 06:08:24,475 INFO L290 TraceCheckUtils]: 61: Hoare triple {169639#(<= ~counter~0 6)} assume !(0 == ~cond); {169639#(<= ~counter~0 6)} is VALID [2022-04-28 06:08:24,475 INFO L290 TraceCheckUtils]: 62: Hoare triple {169639#(<= ~counter~0 6)} assume true; {169639#(<= ~counter~0 6)} is VALID [2022-04-28 06:08:24,476 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {169639#(<= ~counter~0 6)} {169639#(<= ~counter~0 6)} #96#return; {169639#(<= ~counter~0 6)} is VALID [2022-04-28 06:08:24,476 INFO L290 TraceCheckUtils]: 64: Hoare triple {169639#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {169639#(<= ~counter~0 6)} is VALID [2022-04-28 06:08:24,479 INFO L290 TraceCheckUtils]: 65: Hoare triple {169639#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {169664#(<= ~counter~0 7)} is VALID [2022-04-28 06:08:24,479 INFO L290 TraceCheckUtils]: 66: Hoare triple {169664#(<= ~counter~0 7)} assume !!(#t~post7 < 20);havoc #t~post7; {169664#(<= ~counter~0 7)} is VALID [2022-04-28 06:08:24,480 INFO L272 TraceCheckUtils]: 67: Hoare triple {169664#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {169664#(<= ~counter~0 7)} is VALID [2022-04-28 06:08:24,480 INFO L290 TraceCheckUtils]: 68: Hoare triple {169664#(<= ~counter~0 7)} ~cond := #in~cond; {169664#(<= ~counter~0 7)} is VALID [2022-04-28 06:08:24,481 INFO L290 TraceCheckUtils]: 69: Hoare triple {169664#(<= ~counter~0 7)} assume !(0 == ~cond); {169664#(<= ~counter~0 7)} is VALID [2022-04-28 06:08:24,481 INFO L290 TraceCheckUtils]: 70: Hoare triple {169664#(<= ~counter~0 7)} assume true; {169664#(<= ~counter~0 7)} is VALID [2022-04-28 06:08:24,481 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {169664#(<= ~counter~0 7)} {169664#(<= ~counter~0 7)} #96#return; {169664#(<= ~counter~0 7)} is VALID [2022-04-28 06:08:24,482 INFO L290 TraceCheckUtils]: 72: Hoare triple {169664#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {169664#(<= ~counter~0 7)} is VALID [2022-04-28 06:08:24,484 INFO L290 TraceCheckUtils]: 73: Hoare triple {169664#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {169689#(<= ~counter~0 8)} is VALID [2022-04-28 06:08:24,484 INFO L290 TraceCheckUtils]: 74: Hoare triple {169689#(<= ~counter~0 8)} assume !!(#t~post7 < 20);havoc #t~post7; {169689#(<= ~counter~0 8)} is VALID [2022-04-28 06:08:24,485 INFO L272 TraceCheckUtils]: 75: Hoare triple {169689#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {169689#(<= ~counter~0 8)} is VALID [2022-04-28 06:08:24,485 INFO L290 TraceCheckUtils]: 76: Hoare triple {169689#(<= ~counter~0 8)} ~cond := #in~cond; {169689#(<= ~counter~0 8)} is VALID [2022-04-28 06:08:24,486 INFO L290 TraceCheckUtils]: 77: Hoare triple {169689#(<= ~counter~0 8)} assume !(0 == ~cond); {169689#(<= ~counter~0 8)} is VALID [2022-04-28 06:08:24,486 INFO L290 TraceCheckUtils]: 78: Hoare triple {169689#(<= ~counter~0 8)} assume true; {169689#(<= ~counter~0 8)} is VALID [2022-04-28 06:08:24,487 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {169689#(<= ~counter~0 8)} {169689#(<= ~counter~0 8)} #96#return; {169689#(<= ~counter~0 8)} is VALID [2022-04-28 06:08:24,487 INFO L290 TraceCheckUtils]: 80: Hoare triple {169689#(<= ~counter~0 8)} assume !(~r~0 > 0); {169689#(<= ~counter~0 8)} is VALID [2022-04-28 06:08:24,489 INFO L290 TraceCheckUtils]: 81: Hoare triple {169689#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {169714#(<= ~counter~0 9)} is VALID [2022-04-28 06:08:24,490 INFO L290 TraceCheckUtils]: 82: Hoare triple {169714#(<= ~counter~0 9)} assume !!(#t~post8 < 20);havoc #t~post8; {169714#(<= ~counter~0 9)} is VALID [2022-04-28 06:08:24,490 INFO L272 TraceCheckUtils]: 83: Hoare triple {169714#(<= ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {169714#(<= ~counter~0 9)} is VALID [2022-04-28 06:08:24,490 INFO L290 TraceCheckUtils]: 84: Hoare triple {169714#(<= ~counter~0 9)} ~cond := #in~cond; {169714#(<= ~counter~0 9)} is VALID [2022-04-28 06:08:24,491 INFO L290 TraceCheckUtils]: 85: Hoare triple {169714#(<= ~counter~0 9)} assume !(0 == ~cond); {169714#(<= ~counter~0 9)} is VALID [2022-04-28 06:08:24,491 INFO L290 TraceCheckUtils]: 86: Hoare triple {169714#(<= ~counter~0 9)} assume true; {169714#(<= ~counter~0 9)} is VALID [2022-04-28 06:08:24,492 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {169714#(<= ~counter~0 9)} {169714#(<= ~counter~0 9)} #98#return; {169714#(<= ~counter~0 9)} is VALID [2022-04-28 06:08:24,492 INFO L290 TraceCheckUtils]: 88: Hoare triple {169714#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {169714#(<= ~counter~0 9)} is VALID [2022-04-28 06:08:24,494 INFO L290 TraceCheckUtils]: 89: Hoare triple {169714#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {169739#(<= ~counter~0 10)} is VALID [2022-04-28 06:08:24,495 INFO L290 TraceCheckUtils]: 90: Hoare triple {169739#(<= ~counter~0 10)} assume !!(#t~post8 < 20);havoc #t~post8; {169739#(<= ~counter~0 10)} is VALID [2022-04-28 06:08:24,495 INFO L272 TraceCheckUtils]: 91: Hoare triple {169739#(<= ~counter~0 10)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {169739#(<= ~counter~0 10)} is VALID [2022-04-28 06:08:24,496 INFO L290 TraceCheckUtils]: 92: Hoare triple {169739#(<= ~counter~0 10)} ~cond := #in~cond; {169739#(<= ~counter~0 10)} is VALID [2022-04-28 06:08:24,496 INFO L290 TraceCheckUtils]: 93: Hoare triple {169739#(<= ~counter~0 10)} assume !(0 == ~cond); {169739#(<= ~counter~0 10)} is VALID [2022-04-28 06:08:24,496 INFO L290 TraceCheckUtils]: 94: Hoare triple {169739#(<= ~counter~0 10)} assume true; {169739#(<= ~counter~0 10)} is VALID [2022-04-28 06:08:24,497 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {169739#(<= ~counter~0 10)} {169739#(<= ~counter~0 10)} #98#return; {169739#(<= ~counter~0 10)} is VALID [2022-04-28 06:08:24,497 INFO L290 TraceCheckUtils]: 96: Hoare triple {169739#(<= ~counter~0 10)} assume !(~r~0 < 0); {169739#(<= ~counter~0 10)} is VALID [2022-04-28 06:08:24,499 INFO L290 TraceCheckUtils]: 97: Hoare triple {169739#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {169764#(<= ~counter~0 11)} is VALID [2022-04-28 06:08:24,500 INFO L290 TraceCheckUtils]: 98: Hoare triple {169764#(<= ~counter~0 11)} assume !!(#t~post6 < 20);havoc #t~post6; {169764#(<= ~counter~0 11)} is VALID [2022-04-28 06:08:24,500 INFO L272 TraceCheckUtils]: 99: Hoare triple {169764#(<= ~counter~0 11)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {169764#(<= ~counter~0 11)} is VALID [2022-04-28 06:08:24,501 INFO L290 TraceCheckUtils]: 100: Hoare triple {169764#(<= ~counter~0 11)} ~cond := #in~cond; {169764#(<= ~counter~0 11)} is VALID [2022-04-28 06:08:24,501 INFO L290 TraceCheckUtils]: 101: Hoare triple {169764#(<= ~counter~0 11)} assume !(0 == ~cond); {169764#(<= ~counter~0 11)} is VALID [2022-04-28 06:08:24,501 INFO L290 TraceCheckUtils]: 102: Hoare triple {169764#(<= ~counter~0 11)} assume true; {169764#(<= ~counter~0 11)} is VALID [2022-04-28 06:08:24,502 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {169764#(<= ~counter~0 11)} {169764#(<= ~counter~0 11)} #94#return; {169764#(<= ~counter~0 11)} is VALID [2022-04-28 06:08:24,502 INFO L290 TraceCheckUtils]: 104: Hoare triple {169764#(<= ~counter~0 11)} assume !!(0 != ~r~0); {169764#(<= ~counter~0 11)} is VALID [2022-04-28 06:08:24,504 INFO L290 TraceCheckUtils]: 105: Hoare triple {169764#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {169789#(<= ~counter~0 12)} is VALID [2022-04-28 06:08:24,505 INFO L290 TraceCheckUtils]: 106: Hoare triple {169789#(<= ~counter~0 12)} assume !!(#t~post7 < 20);havoc #t~post7; {169789#(<= ~counter~0 12)} is VALID [2022-04-28 06:08:24,505 INFO L272 TraceCheckUtils]: 107: Hoare triple {169789#(<= ~counter~0 12)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {169789#(<= ~counter~0 12)} is VALID [2022-04-28 06:08:24,506 INFO L290 TraceCheckUtils]: 108: Hoare triple {169789#(<= ~counter~0 12)} ~cond := #in~cond; {169789#(<= ~counter~0 12)} is VALID [2022-04-28 06:08:24,506 INFO L290 TraceCheckUtils]: 109: Hoare triple {169789#(<= ~counter~0 12)} assume !(0 == ~cond); {169789#(<= ~counter~0 12)} is VALID [2022-04-28 06:08:24,506 INFO L290 TraceCheckUtils]: 110: Hoare triple {169789#(<= ~counter~0 12)} assume true; {169789#(<= ~counter~0 12)} is VALID [2022-04-28 06:08:24,507 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {169789#(<= ~counter~0 12)} {169789#(<= ~counter~0 12)} #96#return; {169789#(<= ~counter~0 12)} is VALID [2022-04-28 06:08:24,507 INFO L290 TraceCheckUtils]: 112: Hoare triple {169789#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {169789#(<= ~counter~0 12)} is VALID [2022-04-28 06:08:24,511 INFO L290 TraceCheckUtils]: 113: Hoare triple {169789#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {169814#(<= ~counter~0 13)} is VALID [2022-04-28 06:08:24,511 INFO L290 TraceCheckUtils]: 114: Hoare triple {169814#(<= ~counter~0 13)} assume !!(#t~post7 < 20);havoc #t~post7; {169814#(<= ~counter~0 13)} is VALID [2022-04-28 06:08:24,512 INFO L272 TraceCheckUtils]: 115: Hoare triple {169814#(<= ~counter~0 13)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {169814#(<= ~counter~0 13)} is VALID [2022-04-28 06:08:24,512 INFO L290 TraceCheckUtils]: 116: Hoare triple {169814#(<= ~counter~0 13)} ~cond := #in~cond; {169814#(<= ~counter~0 13)} is VALID [2022-04-28 06:08:24,512 INFO L290 TraceCheckUtils]: 117: Hoare triple {169814#(<= ~counter~0 13)} assume !(0 == ~cond); {169814#(<= ~counter~0 13)} is VALID [2022-04-28 06:08:24,513 INFO L290 TraceCheckUtils]: 118: Hoare triple {169814#(<= ~counter~0 13)} assume true; {169814#(<= ~counter~0 13)} is VALID [2022-04-28 06:08:24,513 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {169814#(<= ~counter~0 13)} {169814#(<= ~counter~0 13)} #96#return; {169814#(<= ~counter~0 13)} is VALID [2022-04-28 06:08:24,514 INFO L290 TraceCheckUtils]: 120: Hoare triple {169814#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {169814#(<= ~counter~0 13)} is VALID [2022-04-28 06:08:24,517 INFO L290 TraceCheckUtils]: 121: Hoare triple {169814#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {169839#(<= ~counter~0 14)} is VALID [2022-04-28 06:08:24,517 INFO L290 TraceCheckUtils]: 122: Hoare triple {169839#(<= ~counter~0 14)} assume !!(#t~post7 < 20);havoc #t~post7; {169839#(<= ~counter~0 14)} is VALID [2022-04-28 06:08:24,518 INFO L272 TraceCheckUtils]: 123: Hoare triple {169839#(<= ~counter~0 14)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {169839#(<= ~counter~0 14)} is VALID [2022-04-28 06:08:24,518 INFO L290 TraceCheckUtils]: 124: Hoare triple {169839#(<= ~counter~0 14)} ~cond := #in~cond; {169839#(<= ~counter~0 14)} is VALID [2022-04-28 06:08:24,518 INFO L290 TraceCheckUtils]: 125: Hoare triple {169839#(<= ~counter~0 14)} assume !(0 == ~cond); {169839#(<= ~counter~0 14)} is VALID [2022-04-28 06:08:24,519 INFO L290 TraceCheckUtils]: 126: Hoare triple {169839#(<= ~counter~0 14)} assume true; {169839#(<= ~counter~0 14)} is VALID [2022-04-28 06:08:24,519 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {169839#(<= ~counter~0 14)} {169839#(<= ~counter~0 14)} #96#return; {169839#(<= ~counter~0 14)} is VALID [2022-04-28 06:08:24,520 INFO L290 TraceCheckUtils]: 128: Hoare triple {169839#(<= ~counter~0 14)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {169839#(<= ~counter~0 14)} is VALID [2022-04-28 06:08:24,522 INFO L290 TraceCheckUtils]: 129: Hoare triple {169839#(<= ~counter~0 14)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {169864#(<= ~counter~0 15)} is VALID [2022-04-28 06:08:24,522 INFO L290 TraceCheckUtils]: 130: Hoare triple {169864#(<= ~counter~0 15)} assume !!(#t~post7 < 20);havoc #t~post7; {169864#(<= ~counter~0 15)} is VALID [2022-04-28 06:08:24,523 INFO L272 TraceCheckUtils]: 131: Hoare triple {169864#(<= ~counter~0 15)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {169864#(<= ~counter~0 15)} is VALID [2022-04-28 06:08:24,523 INFO L290 TraceCheckUtils]: 132: Hoare triple {169864#(<= ~counter~0 15)} ~cond := #in~cond; {169864#(<= ~counter~0 15)} is VALID [2022-04-28 06:08:24,523 INFO L290 TraceCheckUtils]: 133: Hoare triple {169864#(<= ~counter~0 15)} assume !(0 == ~cond); {169864#(<= ~counter~0 15)} is VALID [2022-04-28 06:08:24,524 INFO L290 TraceCheckUtils]: 134: Hoare triple {169864#(<= ~counter~0 15)} assume true; {169864#(<= ~counter~0 15)} is VALID [2022-04-28 06:08:24,524 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {169864#(<= ~counter~0 15)} {169864#(<= ~counter~0 15)} #96#return; {169864#(<= ~counter~0 15)} is VALID [2022-04-28 06:08:24,525 INFO L290 TraceCheckUtils]: 136: Hoare triple {169864#(<= ~counter~0 15)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {169864#(<= ~counter~0 15)} is VALID [2022-04-28 06:08:24,527 INFO L290 TraceCheckUtils]: 137: Hoare triple {169864#(<= ~counter~0 15)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {169889#(<= ~counter~0 16)} is VALID [2022-04-28 06:08:24,527 INFO L290 TraceCheckUtils]: 138: Hoare triple {169889#(<= ~counter~0 16)} assume !!(#t~post7 < 20);havoc #t~post7; {169889#(<= ~counter~0 16)} is VALID [2022-04-28 06:08:24,528 INFO L272 TraceCheckUtils]: 139: Hoare triple {169889#(<= ~counter~0 16)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {169889#(<= ~counter~0 16)} is VALID [2022-04-28 06:08:24,528 INFO L290 TraceCheckUtils]: 140: Hoare triple {169889#(<= ~counter~0 16)} ~cond := #in~cond; {169889#(<= ~counter~0 16)} is VALID [2022-04-28 06:08:24,528 INFO L290 TraceCheckUtils]: 141: Hoare triple {169889#(<= ~counter~0 16)} assume !(0 == ~cond); {169889#(<= ~counter~0 16)} is VALID [2022-04-28 06:08:24,529 INFO L290 TraceCheckUtils]: 142: Hoare triple {169889#(<= ~counter~0 16)} assume true; {169889#(<= ~counter~0 16)} is VALID [2022-04-28 06:08:24,529 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {169889#(<= ~counter~0 16)} {169889#(<= ~counter~0 16)} #96#return; {169889#(<= ~counter~0 16)} is VALID [2022-04-28 06:08:24,530 INFO L290 TraceCheckUtils]: 144: Hoare triple {169889#(<= ~counter~0 16)} assume !(~r~0 > 0); {169889#(<= ~counter~0 16)} is VALID [2022-04-28 06:08:24,532 INFO L290 TraceCheckUtils]: 145: Hoare triple {169889#(<= ~counter~0 16)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {169914#(<= ~counter~0 17)} is VALID [2022-04-28 06:08:24,533 INFO L290 TraceCheckUtils]: 146: Hoare triple {169914#(<= ~counter~0 17)} assume !!(#t~post8 < 20);havoc #t~post8; {169914#(<= ~counter~0 17)} is VALID [2022-04-28 06:08:24,533 INFO L272 TraceCheckUtils]: 147: Hoare triple {169914#(<= ~counter~0 17)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {169914#(<= ~counter~0 17)} is VALID [2022-04-28 06:08:24,533 INFO L290 TraceCheckUtils]: 148: Hoare triple {169914#(<= ~counter~0 17)} ~cond := #in~cond; {169914#(<= ~counter~0 17)} is VALID [2022-04-28 06:08:24,534 INFO L290 TraceCheckUtils]: 149: Hoare triple {169914#(<= ~counter~0 17)} assume !(0 == ~cond); {169914#(<= ~counter~0 17)} is VALID [2022-04-28 06:08:24,534 INFO L290 TraceCheckUtils]: 150: Hoare triple {169914#(<= ~counter~0 17)} assume true; {169914#(<= ~counter~0 17)} is VALID [2022-04-28 06:08:24,535 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {169914#(<= ~counter~0 17)} {169914#(<= ~counter~0 17)} #98#return; {169914#(<= ~counter~0 17)} is VALID [2022-04-28 06:08:24,535 INFO L290 TraceCheckUtils]: 152: Hoare triple {169914#(<= ~counter~0 17)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {169914#(<= ~counter~0 17)} is VALID [2022-04-28 06:08:24,535 INFO L290 TraceCheckUtils]: 153: Hoare triple {169914#(<= ~counter~0 17)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {169939#(<= |main_#t~post8| 17)} is VALID [2022-04-28 06:08:24,536 INFO L290 TraceCheckUtils]: 154: Hoare triple {169939#(<= |main_#t~post8| 17)} assume !(#t~post8 < 20);havoc #t~post8; {169458#false} is VALID [2022-04-28 06:08:24,536 INFO L290 TraceCheckUtils]: 155: Hoare triple {169458#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {169458#false} is VALID [2022-04-28 06:08:24,536 INFO L290 TraceCheckUtils]: 156: Hoare triple {169458#false} assume !(#t~post6 < 20);havoc #t~post6; {169458#false} is VALID [2022-04-28 06:08:24,536 INFO L272 TraceCheckUtils]: 157: Hoare triple {169458#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {169458#false} is VALID [2022-04-28 06:08:24,536 INFO L290 TraceCheckUtils]: 158: Hoare triple {169458#false} ~cond := #in~cond; {169458#false} is VALID [2022-04-28 06:08:24,536 INFO L290 TraceCheckUtils]: 159: Hoare triple {169458#false} assume 0 == ~cond; {169458#false} is VALID [2022-04-28 06:08:24,536 INFO L290 TraceCheckUtils]: 160: Hoare triple {169458#false} assume !false; {169458#false} is VALID [2022-04-28 06:08:24,537 INFO L134 CoverageAnalysis]: Checked inductivity of 794 backedges. 40 proven. 750 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 06:08:24,537 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 06:08:25,467 INFO L290 TraceCheckUtils]: 160: Hoare triple {169458#false} assume !false; {169458#false} is VALID [2022-04-28 06:08:25,467 INFO L290 TraceCheckUtils]: 159: Hoare triple {169458#false} assume 0 == ~cond; {169458#false} is VALID [2022-04-28 06:08:25,467 INFO L290 TraceCheckUtils]: 158: Hoare triple {169458#false} ~cond := #in~cond; {169458#false} is VALID [2022-04-28 06:08:25,467 INFO L272 TraceCheckUtils]: 157: Hoare triple {169458#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {169458#false} is VALID [2022-04-28 06:08:25,467 INFO L290 TraceCheckUtils]: 156: Hoare triple {169458#false} assume !(#t~post6 < 20);havoc #t~post6; {169458#false} is VALID [2022-04-28 06:08:25,467 INFO L290 TraceCheckUtils]: 155: Hoare triple {169458#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {169458#false} is VALID [2022-04-28 06:08:25,468 INFO L290 TraceCheckUtils]: 154: Hoare triple {169979#(< |main_#t~post8| 20)} assume !(#t~post8 < 20);havoc #t~post8; {169458#false} is VALID [2022-04-28 06:08:25,468 INFO L290 TraceCheckUtils]: 153: Hoare triple {169983#(< ~counter~0 20)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {169979#(< |main_#t~post8| 20)} is VALID [2022-04-28 06:08:25,468 INFO L290 TraceCheckUtils]: 152: Hoare triple {169983#(< ~counter~0 20)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {169983#(< ~counter~0 20)} is VALID [2022-04-28 06:08:25,469 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {169457#true} {169983#(< ~counter~0 20)} #98#return; {169983#(< ~counter~0 20)} is VALID [2022-04-28 06:08:25,469 INFO L290 TraceCheckUtils]: 150: Hoare triple {169457#true} assume true; {169457#true} is VALID [2022-04-28 06:08:25,469 INFO L290 TraceCheckUtils]: 149: Hoare triple {169457#true} assume !(0 == ~cond); {169457#true} is VALID [2022-04-28 06:08:25,469 INFO L290 TraceCheckUtils]: 148: Hoare triple {169457#true} ~cond := #in~cond; {169457#true} is VALID [2022-04-28 06:08:25,469 INFO L272 TraceCheckUtils]: 147: Hoare triple {169983#(< ~counter~0 20)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {169457#true} is VALID [2022-04-28 06:08:25,470 INFO L290 TraceCheckUtils]: 146: Hoare triple {169983#(< ~counter~0 20)} assume !!(#t~post8 < 20);havoc #t~post8; {169983#(< ~counter~0 20)} is VALID [2022-04-28 06:08:25,473 INFO L290 TraceCheckUtils]: 145: Hoare triple {170008#(< ~counter~0 19)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {169983#(< ~counter~0 20)} is VALID [2022-04-28 06:08:25,474 INFO L290 TraceCheckUtils]: 144: Hoare triple {170008#(< ~counter~0 19)} assume !(~r~0 > 0); {170008#(< ~counter~0 19)} is VALID [2022-04-28 06:08:25,474 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {169457#true} {170008#(< ~counter~0 19)} #96#return; {170008#(< ~counter~0 19)} is VALID [2022-04-28 06:08:25,475 INFO L290 TraceCheckUtils]: 142: Hoare triple {169457#true} assume true; {169457#true} is VALID [2022-04-28 06:08:25,475 INFO L290 TraceCheckUtils]: 141: Hoare triple {169457#true} assume !(0 == ~cond); {169457#true} is VALID [2022-04-28 06:08:25,475 INFO L290 TraceCheckUtils]: 140: Hoare triple {169457#true} ~cond := #in~cond; {169457#true} is VALID [2022-04-28 06:08:25,475 INFO L272 TraceCheckUtils]: 139: Hoare triple {170008#(< ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {169457#true} is VALID [2022-04-28 06:08:25,475 INFO L290 TraceCheckUtils]: 138: Hoare triple {170008#(< ~counter~0 19)} assume !!(#t~post7 < 20);havoc #t~post7; {170008#(< ~counter~0 19)} is VALID [2022-04-28 06:08:25,477 INFO L290 TraceCheckUtils]: 137: Hoare triple {169914#(<= ~counter~0 17)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {170008#(< ~counter~0 19)} is VALID [2022-04-28 06:08:25,477 INFO L290 TraceCheckUtils]: 136: Hoare triple {169914#(<= ~counter~0 17)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {169914#(<= ~counter~0 17)} is VALID [2022-04-28 06:08:25,478 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {169457#true} {169914#(<= ~counter~0 17)} #96#return; {169914#(<= ~counter~0 17)} is VALID [2022-04-28 06:08:25,478 INFO L290 TraceCheckUtils]: 134: Hoare triple {169457#true} assume true; {169457#true} is VALID [2022-04-28 06:08:25,478 INFO L290 TraceCheckUtils]: 133: Hoare triple {169457#true} assume !(0 == ~cond); {169457#true} is VALID [2022-04-28 06:08:25,478 INFO L290 TraceCheckUtils]: 132: Hoare triple {169457#true} ~cond := #in~cond; {169457#true} is VALID [2022-04-28 06:08:25,478 INFO L272 TraceCheckUtils]: 131: Hoare triple {169914#(<= ~counter~0 17)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {169457#true} is VALID [2022-04-28 06:08:25,478 INFO L290 TraceCheckUtils]: 130: Hoare triple {169914#(<= ~counter~0 17)} assume !!(#t~post7 < 20);havoc #t~post7; {169914#(<= ~counter~0 17)} is VALID [2022-04-28 06:08:25,480 INFO L290 TraceCheckUtils]: 129: Hoare triple {169889#(<= ~counter~0 16)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {169914#(<= ~counter~0 17)} is VALID [2022-04-28 06:08:25,480 INFO L290 TraceCheckUtils]: 128: Hoare triple {169889#(<= ~counter~0 16)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {169889#(<= ~counter~0 16)} is VALID [2022-04-28 06:08:25,480 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {169457#true} {169889#(<= ~counter~0 16)} #96#return; {169889#(<= ~counter~0 16)} is VALID [2022-04-28 06:08:25,481 INFO L290 TraceCheckUtils]: 126: Hoare triple {169457#true} assume true; {169457#true} is VALID [2022-04-28 06:08:25,481 INFO L290 TraceCheckUtils]: 125: Hoare triple {169457#true} assume !(0 == ~cond); {169457#true} is VALID [2022-04-28 06:08:25,481 INFO L290 TraceCheckUtils]: 124: Hoare triple {169457#true} ~cond := #in~cond; {169457#true} is VALID [2022-04-28 06:08:25,481 INFO L272 TraceCheckUtils]: 123: Hoare triple {169889#(<= ~counter~0 16)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {169457#true} is VALID [2022-04-28 06:08:25,481 INFO L290 TraceCheckUtils]: 122: Hoare triple {169889#(<= ~counter~0 16)} assume !!(#t~post7 < 20);havoc #t~post7; {169889#(<= ~counter~0 16)} is VALID [2022-04-28 06:08:25,483 INFO L290 TraceCheckUtils]: 121: Hoare triple {169864#(<= ~counter~0 15)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {169889#(<= ~counter~0 16)} is VALID [2022-04-28 06:08:25,483 INFO L290 TraceCheckUtils]: 120: Hoare triple {169864#(<= ~counter~0 15)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {169864#(<= ~counter~0 15)} is VALID [2022-04-28 06:08:25,483 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {169457#true} {169864#(<= ~counter~0 15)} #96#return; {169864#(<= ~counter~0 15)} is VALID [2022-04-28 06:08:25,484 INFO L290 TraceCheckUtils]: 118: Hoare triple {169457#true} assume true; {169457#true} is VALID [2022-04-28 06:08:25,484 INFO L290 TraceCheckUtils]: 117: Hoare triple {169457#true} assume !(0 == ~cond); {169457#true} is VALID [2022-04-28 06:08:25,484 INFO L290 TraceCheckUtils]: 116: Hoare triple {169457#true} ~cond := #in~cond; {169457#true} is VALID [2022-04-28 06:08:25,484 INFO L272 TraceCheckUtils]: 115: Hoare triple {169864#(<= ~counter~0 15)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {169457#true} is VALID [2022-04-28 06:08:25,484 INFO L290 TraceCheckUtils]: 114: Hoare triple {169864#(<= ~counter~0 15)} assume !!(#t~post7 < 20);havoc #t~post7; {169864#(<= ~counter~0 15)} is VALID [2022-04-28 06:08:25,485 INFO L290 TraceCheckUtils]: 113: Hoare triple {169839#(<= ~counter~0 14)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {169864#(<= ~counter~0 15)} is VALID [2022-04-28 06:08:25,486 INFO L290 TraceCheckUtils]: 112: Hoare triple {169839#(<= ~counter~0 14)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {169839#(<= ~counter~0 14)} is VALID [2022-04-28 06:08:25,486 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {169457#true} {169839#(<= ~counter~0 14)} #96#return; {169839#(<= ~counter~0 14)} is VALID [2022-04-28 06:08:25,486 INFO L290 TraceCheckUtils]: 110: Hoare triple {169457#true} assume true; {169457#true} is VALID [2022-04-28 06:08:25,487 INFO L290 TraceCheckUtils]: 109: Hoare triple {169457#true} assume !(0 == ~cond); {169457#true} is VALID [2022-04-28 06:08:25,487 INFO L290 TraceCheckUtils]: 108: Hoare triple {169457#true} ~cond := #in~cond; {169457#true} is VALID [2022-04-28 06:08:25,487 INFO L272 TraceCheckUtils]: 107: Hoare triple {169839#(<= ~counter~0 14)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {169457#true} is VALID [2022-04-28 06:08:25,487 INFO L290 TraceCheckUtils]: 106: Hoare triple {169839#(<= ~counter~0 14)} assume !!(#t~post7 < 20);havoc #t~post7; {169839#(<= ~counter~0 14)} is VALID [2022-04-28 06:08:25,488 INFO L290 TraceCheckUtils]: 105: Hoare triple {169814#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {169839#(<= ~counter~0 14)} is VALID [2022-04-28 06:08:25,489 INFO L290 TraceCheckUtils]: 104: Hoare triple {169814#(<= ~counter~0 13)} assume !!(0 != ~r~0); {169814#(<= ~counter~0 13)} is VALID [2022-04-28 06:08:25,489 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {169457#true} {169814#(<= ~counter~0 13)} #94#return; {169814#(<= ~counter~0 13)} is VALID [2022-04-28 06:08:25,489 INFO L290 TraceCheckUtils]: 102: Hoare triple {169457#true} assume true; {169457#true} is VALID [2022-04-28 06:08:25,490 INFO L290 TraceCheckUtils]: 101: Hoare triple {169457#true} assume !(0 == ~cond); {169457#true} is VALID [2022-04-28 06:08:25,490 INFO L290 TraceCheckUtils]: 100: Hoare triple {169457#true} ~cond := #in~cond; {169457#true} is VALID [2022-04-28 06:08:25,490 INFO L272 TraceCheckUtils]: 99: Hoare triple {169814#(<= ~counter~0 13)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {169457#true} is VALID [2022-04-28 06:08:25,490 INFO L290 TraceCheckUtils]: 98: Hoare triple {169814#(<= ~counter~0 13)} assume !!(#t~post6 < 20);havoc #t~post6; {169814#(<= ~counter~0 13)} is VALID [2022-04-28 06:08:25,491 INFO L290 TraceCheckUtils]: 97: Hoare triple {169789#(<= ~counter~0 12)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {169814#(<= ~counter~0 13)} is VALID [2022-04-28 06:08:25,492 INFO L290 TraceCheckUtils]: 96: Hoare triple {169789#(<= ~counter~0 12)} assume !(~r~0 < 0); {169789#(<= ~counter~0 12)} is VALID [2022-04-28 06:08:25,492 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {169457#true} {169789#(<= ~counter~0 12)} #98#return; {169789#(<= ~counter~0 12)} is VALID [2022-04-28 06:08:25,492 INFO L290 TraceCheckUtils]: 94: Hoare triple {169457#true} assume true; {169457#true} is VALID [2022-04-28 06:08:25,493 INFO L290 TraceCheckUtils]: 93: Hoare triple {169457#true} assume !(0 == ~cond); {169457#true} is VALID [2022-04-28 06:08:25,493 INFO L290 TraceCheckUtils]: 92: Hoare triple {169457#true} ~cond := #in~cond; {169457#true} is VALID [2022-04-28 06:08:25,493 INFO L272 TraceCheckUtils]: 91: Hoare triple {169789#(<= ~counter~0 12)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {169457#true} is VALID [2022-04-28 06:08:25,493 INFO L290 TraceCheckUtils]: 90: Hoare triple {169789#(<= ~counter~0 12)} assume !!(#t~post8 < 20);havoc #t~post8; {169789#(<= ~counter~0 12)} is VALID [2022-04-28 06:08:25,494 INFO L290 TraceCheckUtils]: 89: Hoare triple {169764#(<= ~counter~0 11)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {169789#(<= ~counter~0 12)} is VALID [2022-04-28 06:08:25,495 INFO L290 TraceCheckUtils]: 88: Hoare triple {169764#(<= ~counter~0 11)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {169764#(<= ~counter~0 11)} is VALID [2022-04-28 06:08:25,495 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {169457#true} {169764#(<= ~counter~0 11)} #98#return; {169764#(<= ~counter~0 11)} is VALID [2022-04-28 06:08:25,495 INFO L290 TraceCheckUtils]: 86: Hoare triple {169457#true} assume true; {169457#true} is VALID [2022-04-28 06:08:25,496 INFO L290 TraceCheckUtils]: 85: Hoare triple {169457#true} assume !(0 == ~cond); {169457#true} is VALID [2022-04-28 06:08:25,496 INFO L290 TraceCheckUtils]: 84: Hoare triple {169457#true} ~cond := #in~cond; {169457#true} is VALID [2022-04-28 06:08:25,496 INFO L272 TraceCheckUtils]: 83: Hoare triple {169764#(<= ~counter~0 11)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {169457#true} is VALID [2022-04-28 06:08:25,496 INFO L290 TraceCheckUtils]: 82: Hoare triple {169764#(<= ~counter~0 11)} assume !!(#t~post8 < 20);havoc #t~post8; {169764#(<= ~counter~0 11)} is VALID [2022-04-28 06:08:25,497 INFO L290 TraceCheckUtils]: 81: Hoare triple {169739#(<= ~counter~0 10)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {169764#(<= ~counter~0 11)} is VALID [2022-04-28 06:08:25,498 INFO L290 TraceCheckUtils]: 80: Hoare triple {169739#(<= ~counter~0 10)} assume !(~r~0 > 0); {169739#(<= ~counter~0 10)} is VALID [2022-04-28 06:08:25,498 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {169457#true} {169739#(<= ~counter~0 10)} #96#return; {169739#(<= ~counter~0 10)} is VALID [2022-04-28 06:08:25,499 INFO L290 TraceCheckUtils]: 78: Hoare triple {169457#true} assume true; {169457#true} is VALID [2022-04-28 06:08:25,499 INFO L290 TraceCheckUtils]: 77: Hoare triple {169457#true} assume !(0 == ~cond); {169457#true} is VALID [2022-04-28 06:08:25,499 INFO L290 TraceCheckUtils]: 76: Hoare triple {169457#true} ~cond := #in~cond; {169457#true} is VALID [2022-04-28 06:08:25,499 INFO L272 TraceCheckUtils]: 75: Hoare triple {169739#(<= ~counter~0 10)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {169457#true} is VALID [2022-04-28 06:08:25,499 INFO L290 TraceCheckUtils]: 74: Hoare triple {169739#(<= ~counter~0 10)} assume !!(#t~post7 < 20);havoc #t~post7; {169739#(<= ~counter~0 10)} is VALID [2022-04-28 06:08:25,500 INFO L290 TraceCheckUtils]: 73: Hoare triple {169714#(<= ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {169739#(<= ~counter~0 10)} is VALID [2022-04-28 06:08:25,501 INFO L290 TraceCheckUtils]: 72: Hoare triple {169714#(<= ~counter~0 9)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {169714#(<= ~counter~0 9)} is VALID [2022-04-28 06:08:25,501 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {169457#true} {169714#(<= ~counter~0 9)} #96#return; {169714#(<= ~counter~0 9)} is VALID [2022-04-28 06:08:25,501 INFO L290 TraceCheckUtils]: 70: Hoare triple {169457#true} assume true; {169457#true} is VALID [2022-04-28 06:08:25,502 INFO L290 TraceCheckUtils]: 69: Hoare triple {169457#true} assume !(0 == ~cond); {169457#true} is VALID [2022-04-28 06:08:25,502 INFO L290 TraceCheckUtils]: 68: Hoare triple {169457#true} ~cond := #in~cond; {169457#true} is VALID [2022-04-28 06:08:25,502 INFO L272 TraceCheckUtils]: 67: Hoare triple {169714#(<= ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {169457#true} is VALID [2022-04-28 06:08:25,502 INFO L290 TraceCheckUtils]: 66: Hoare triple {169714#(<= ~counter~0 9)} assume !!(#t~post7 < 20);havoc #t~post7; {169714#(<= ~counter~0 9)} is VALID [2022-04-28 06:08:25,503 INFO L290 TraceCheckUtils]: 65: Hoare triple {169689#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {169714#(<= ~counter~0 9)} is VALID [2022-04-28 06:08:25,504 INFO L290 TraceCheckUtils]: 64: Hoare triple {169689#(<= ~counter~0 8)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {169689#(<= ~counter~0 8)} is VALID [2022-04-28 06:08:25,504 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {169457#true} {169689#(<= ~counter~0 8)} #96#return; {169689#(<= ~counter~0 8)} is VALID [2022-04-28 06:08:25,504 INFO L290 TraceCheckUtils]: 62: Hoare triple {169457#true} assume true; {169457#true} is VALID [2022-04-28 06:08:25,505 INFO L290 TraceCheckUtils]: 61: Hoare triple {169457#true} assume !(0 == ~cond); {169457#true} is VALID [2022-04-28 06:08:25,505 INFO L290 TraceCheckUtils]: 60: Hoare triple {169457#true} ~cond := #in~cond; {169457#true} is VALID [2022-04-28 06:08:25,505 INFO L272 TraceCheckUtils]: 59: Hoare triple {169689#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {169457#true} is VALID [2022-04-28 06:08:25,505 INFO L290 TraceCheckUtils]: 58: Hoare triple {169689#(<= ~counter~0 8)} assume !!(#t~post7 < 20);havoc #t~post7; {169689#(<= ~counter~0 8)} is VALID [2022-04-28 06:08:25,506 INFO L290 TraceCheckUtils]: 57: Hoare triple {169664#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {169689#(<= ~counter~0 8)} is VALID [2022-04-28 06:08:25,507 INFO L290 TraceCheckUtils]: 56: Hoare triple {169664#(<= ~counter~0 7)} assume !!(0 != ~r~0); {169664#(<= ~counter~0 7)} is VALID [2022-04-28 06:08:25,507 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {169457#true} {169664#(<= ~counter~0 7)} #94#return; {169664#(<= ~counter~0 7)} is VALID [2022-04-28 06:08:25,507 INFO L290 TraceCheckUtils]: 54: Hoare triple {169457#true} assume true; {169457#true} is VALID [2022-04-28 06:08:25,508 INFO L290 TraceCheckUtils]: 53: Hoare triple {169457#true} assume !(0 == ~cond); {169457#true} is VALID [2022-04-28 06:08:25,508 INFO L290 TraceCheckUtils]: 52: Hoare triple {169457#true} ~cond := #in~cond; {169457#true} is VALID [2022-04-28 06:08:25,508 INFO L272 TraceCheckUtils]: 51: Hoare triple {169664#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {169457#true} is VALID [2022-04-28 06:08:25,508 INFO L290 TraceCheckUtils]: 50: Hoare triple {169664#(<= ~counter~0 7)} assume !!(#t~post6 < 20);havoc #t~post6; {169664#(<= ~counter~0 7)} is VALID [2022-04-28 06:08:25,509 INFO L290 TraceCheckUtils]: 49: Hoare triple {169639#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {169664#(<= ~counter~0 7)} is VALID [2022-04-28 06:08:25,510 INFO L290 TraceCheckUtils]: 48: Hoare triple {169639#(<= ~counter~0 6)} assume !(~r~0 < 0); {169639#(<= ~counter~0 6)} is VALID [2022-04-28 06:08:25,510 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {169457#true} {169639#(<= ~counter~0 6)} #98#return; {169639#(<= ~counter~0 6)} is VALID [2022-04-28 06:08:25,510 INFO L290 TraceCheckUtils]: 46: Hoare triple {169457#true} assume true; {169457#true} is VALID [2022-04-28 06:08:25,510 INFO L290 TraceCheckUtils]: 45: Hoare triple {169457#true} assume !(0 == ~cond); {169457#true} is VALID [2022-04-28 06:08:25,511 INFO L290 TraceCheckUtils]: 44: Hoare triple {169457#true} ~cond := #in~cond; {169457#true} is VALID [2022-04-28 06:08:25,511 INFO L272 TraceCheckUtils]: 43: Hoare triple {169639#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {169457#true} is VALID [2022-04-28 06:08:25,511 INFO L290 TraceCheckUtils]: 42: Hoare triple {169639#(<= ~counter~0 6)} assume !!(#t~post8 < 20);havoc #t~post8; {169639#(<= ~counter~0 6)} is VALID [2022-04-28 06:08:25,512 INFO L290 TraceCheckUtils]: 41: Hoare triple {169614#(<= ~counter~0 5)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {169639#(<= ~counter~0 6)} is VALID [2022-04-28 06:08:25,513 INFO L290 TraceCheckUtils]: 40: Hoare triple {169614#(<= ~counter~0 5)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {169614#(<= ~counter~0 5)} is VALID [2022-04-28 06:08:25,513 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {169457#true} {169614#(<= ~counter~0 5)} #98#return; {169614#(<= ~counter~0 5)} is VALID [2022-04-28 06:08:25,513 INFO L290 TraceCheckUtils]: 38: Hoare triple {169457#true} assume true; {169457#true} is VALID [2022-04-28 06:08:25,513 INFO L290 TraceCheckUtils]: 37: Hoare triple {169457#true} assume !(0 == ~cond); {169457#true} is VALID [2022-04-28 06:08:25,514 INFO L290 TraceCheckUtils]: 36: Hoare triple {169457#true} ~cond := #in~cond; {169457#true} is VALID [2022-04-28 06:08:25,514 INFO L272 TraceCheckUtils]: 35: Hoare triple {169614#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {169457#true} is VALID [2022-04-28 06:08:25,514 INFO L290 TraceCheckUtils]: 34: Hoare triple {169614#(<= ~counter~0 5)} assume !!(#t~post8 < 20);havoc #t~post8; {169614#(<= ~counter~0 5)} is VALID [2022-04-28 06:08:25,515 INFO L290 TraceCheckUtils]: 33: Hoare triple {169589#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {169614#(<= ~counter~0 5)} is VALID [2022-04-28 06:08:25,516 INFO L290 TraceCheckUtils]: 32: Hoare triple {169589#(<= ~counter~0 4)} assume !(~r~0 > 0); {169589#(<= ~counter~0 4)} is VALID [2022-04-28 06:08:25,516 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {169457#true} {169589#(<= ~counter~0 4)} #96#return; {169589#(<= ~counter~0 4)} is VALID [2022-04-28 06:08:25,516 INFO L290 TraceCheckUtils]: 30: Hoare triple {169457#true} assume true; {169457#true} is VALID [2022-04-28 06:08:25,516 INFO L290 TraceCheckUtils]: 29: Hoare triple {169457#true} assume !(0 == ~cond); {169457#true} is VALID [2022-04-28 06:08:25,517 INFO L290 TraceCheckUtils]: 28: Hoare triple {169457#true} ~cond := #in~cond; {169457#true} is VALID [2022-04-28 06:08:25,517 INFO L272 TraceCheckUtils]: 27: Hoare triple {169589#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {169457#true} is VALID [2022-04-28 06:08:25,517 INFO L290 TraceCheckUtils]: 26: Hoare triple {169589#(<= ~counter~0 4)} assume !!(#t~post7 < 20);havoc #t~post7; {169589#(<= ~counter~0 4)} is VALID [2022-04-28 06:08:25,518 INFO L290 TraceCheckUtils]: 25: Hoare triple {169564#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {169589#(<= ~counter~0 4)} is VALID [2022-04-28 06:08:25,519 INFO L290 TraceCheckUtils]: 24: Hoare triple {169564#(<= ~counter~0 3)} assume !!(0 != ~r~0); {169564#(<= ~counter~0 3)} is VALID [2022-04-28 06:08:25,519 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {169457#true} {169564#(<= ~counter~0 3)} #94#return; {169564#(<= ~counter~0 3)} is VALID [2022-04-28 06:08:25,519 INFO L290 TraceCheckUtils]: 22: Hoare triple {169457#true} assume true; {169457#true} is VALID [2022-04-28 06:08:25,520 INFO L290 TraceCheckUtils]: 21: Hoare triple {169457#true} assume !(0 == ~cond); {169457#true} is VALID [2022-04-28 06:08:25,520 INFO L290 TraceCheckUtils]: 20: Hoare triple {169457#true} ~cond := #in~cond; {169457#true} is VALID [2022-04-28 06:08:25,520 INFO L272 TraceCheckUtils]: 19: Hoare triple {169564#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {169457#true} is VALID [2022-04-28 06:08:25,520 INFO L290 TraceCheckUtils]: 18: Hoare triple {169564#(<= ~counter~0 3)} assume !!(#t~post6 < 20);havoc #t~post6; {169564#(<= ~counter~0 3)} is VALID [2022-04-28 06:08:25,522 INFO L290 TraceCheckUtils]: 17: Hoare triple {169539#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {169564#(<= ~counter~0 3)} is VALID [2022-04-28 06:08:25,522 INFO L290 TraceCheckUtils]: 16: Hoare triple {169539#(<= ~counter~0 2)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {169539#(<= ~counter~0 2)} is VALID [2022-04-28 06:08:25,522 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {169457#true} {169539#(<= ~counter~0 2)} #92#return; {169539#(<= ~counter~0 2)} is VALID [2022-04-28 06:08:25,522 INFO L290 TraceCheckUtils]: 14: Hoare triple {169457#true} assume true; {169457#true} is VALID [2022-04-28 06:08:25,522 INFO L290 TraceCheckUtils]: 13: Hoare triple {169457#true} assume !(0 == ~cond); {169457#true} is VALID [2022-04-28 06:08:25,523 INFO L290 TraceCheckUtils]: 12: Hoare triple {169457#true} ~cond := #in~cond; {169457#true} is VALID [2022-04-28 06:08:25,523 INFO L272 TraceCheckUtils]: 11: Hoare triple {169539#(<= ~counter~0 2)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {169457#true} is VALID [2022-04-28 06:08:25,523 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {169457#true} {169539#(<= ~counter~0 2)} #90#return; {169539#(<= ~counter~0 2)} is VALID [2022-04-28 06:08:25,523 INFO L290 TraceCheckUtils]: 9: Hoare triple {169457#true} assume true; {169457#true} is VALID [2022-04-28 06:08:25,523 INFO L290 TraceCheckUtils]: 8: Hoare triple {169457#true} assume !(0 == ~cond); {169457#true} is VALID [2022-04-28 06:08:25,523 INFO L290 TraceCheckUtils]: 7: Hoare triple {169457#true} ~cond := #in~cond; {169457#true} is VALID [2022-04-28 06:08:25,523 INFO L272 TraceCheckUtils]: 6: Hoare triple {169539#(<= ~counter~0 2)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {169457#true} is VALID [2022-04-28 06:08:25,524 INFO L290 TraceCheckUtils]: 5: Hoare triple {169539#(<= ~counter~0 2)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {169539#(<= ~counter~0 2)} is VALID [2022-04-28 06:08:25,524 INFO L272 TraceCheckUtils]: 4: Hoare triple {169539#(<= ~counter~0 2)} call #t~ret9 := main(); {169539#(<= ~counter~0 2)} is VALID [2022-04-28 06:08:25,524 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {169539#(<= ~counter~0 2)} {169457#true} #102#return; {169539#(<= ~counter~0 2)} is VALID [2022-04-28 06:08:25,525 INFO L290 TraceCheckUtils]: 2: Hoare triple {169539#(<= ~counter~0 2)} assume true; {169539#(<= ~counter~0 2)} is VALID [2022-04-28 06:08:25,525 INFO L290 TraceCheckUtils]: 1: Hoare triple {169457#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {169539#(<= ~counter~0 2)} is VALID [2022-04-28 06:08:25,525 INFO L272 TraceCheckUtils]: 0: Hoare triple {169457#true} call ULTIMATE.init(); {169457#true} is VALID [2022-04-28 06:08:25,526 INFO L134 CoverageAnalysis]: Checked inductivity of 794 backedges. 40 proven. 206 refuted. 0 times theorem prover too weak. 548 trivial. 0 not checked. [2022-04-28 06:08:25,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:08:25,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744659679] [2022-04-28 06:08:25,526 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:08:25,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [501980006] [2022-04-28 06:08:25,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [501980006] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 06:08:25,526 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 06:08:25,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 24 [2022-04-28 06:08:25,526 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:08:25,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [351791962] [2022-04-28 06:08:25,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [351791962] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:08:25,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:08:25,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-28 06:08:25,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837989564] [2022-04-28 06:08:25,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:08:25,527 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 5.523809523809524) internal successors, (116), 20 states have internal predecessors, (116), 20 states have call successors, (22), 20 states have call predecessors, (22), 18 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) Word has length 161 [2022-04-28 06:08:25,527 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:08:25,528 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 5.523809523809524) internal successors, (116), 20 states have internal predecessors, (116), 20 states have call successors, (22), 20 states have call predecessors, (22), 18 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) [2022-04-28 06:08:25,772 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 158 edges. 158 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:08:25,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-28 06:08:25,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:08:25,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-28 06:08:25,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-28 06:08:25,773 INFO L87 Difference]: Start difference. First operand 875 states and 1169 transitions. Second operand has 21 states, 21 states have (on average 5.523809523809524) internal successors, (116), 20 states have internal predecessors, (116), 20 states have call successors, (22), 20 states have call predecessors, (22), 18 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) [2022-04-28 06:08:33,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:08:33,005 INFO L93 Difference]: Finished difference Result 1079 states and 1471 transitions. [2022-04-28 06:08:33,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-04-28 06:08:33,005 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 5.523809523809524) internal successors, (116), 20 states have internal predecessors, (116), 20 states have call successors, (22), 20 states have call predecessors, (22), 18 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) Word has length 161 [2022-04-28 06:08:33,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:08:33,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 5.523809523809524) internal successors, (116), 20 states have internal predecessors, (116), 20 states have call successors, (22), 20 states have call predecessors, (22), 18 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) [2022-04-28 06:08:33,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 376 transitions. [2022-04-28 06:08:33,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 5.523809523809524) internal successors, (116), 20 states have internal predecessors, (116), 20 states have call successors, (22), 20 states have call predecessors, (22), 18 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) [2022-04-28 06:08:33,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 376 transitions. [2022-04-28 06:08:33,012 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 376 transitions. [2022-04-28 06:08:33,594 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 376 edges. 376 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:08:33,656 INFO L225 Difference]: With dead ends: 1079 [2022-04-28 06:08:33,656 INFO L226 Difference]: Without dead ends: 901 [2022-04-28 06:08:33,657 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 298 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=551, Invalid=931, Unknown=0, NotChecked=0, Total=1482 [2022-04-28 06:08:33,663 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 242 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-28 06:08:33,663 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 404 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-28 06:08:33,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 901 states. [2022-04-28 06:08:38,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 901 to 890. [2022-04-28 06:08:38,351 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:08:38,352 INFO L82 GeneralOperation]: Start isEquivalent. First operand 901 states. Second operand has 890 states, 666 states have (on average 1.1786786786786787) internal successors, (785), 678 states have internal predecessors, (785), 202 states have call successors, (202), 23 states have call predecessors, (202), 21 states have return successors, (200), 188 states have call predecessors, (200), 200 states have call successors, (200) [2022-04-28 06:08:38,353 INFO L74 IsIncluded]: Start isIncluded. First operand 901 states. Second operand has 890 states, 666 states have (on average 1.1786786786786787) internal successors, (785), 678 states have internal predecessors, (785), 202 states have call successors, (202), 23 states have call predecessors, (202), 21 states have return successors, (200), 188 states have call predecessors, (200), 200 states have call successors, (200) [2022-04-28 06:08:38,353 INFO L87 Difference]: Start difference. First operand 901 states. Second operand has 890 states, 666 states have (on average 1.1786786786786787) internal successors, (785), 678 states have internal predecessors, (785), 202 states have call successors, (202), 23 states have call predecessors, (202), 21 states have return successors, (200), 188 states have call predecessors, (200), 200 states have call successors, (200) [2022-04-28 06:08:38,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:08:38,390 INFO L93 Difference]: Finished difference Result 901 states and 1198 transitions. [2022-04-28 06:08:38,390 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1198 transitions. [2022-04-28 06:08:38,391 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:08:38,391 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:08:38,392 INFO L74 IsIncluded]: Start isIncluded. First operand has 890 states, 666 states have (on average 1.1786786786786787) internal successors, (785), 678 states have internal predecessors, (785), 202 states have call successors, (202), 23 states have call predecessors, (202), 21 states have return successors, (200), 188 states have call predecessors, (200), 200 states have call successors, (200) Second operand 901 states. [2022-04-28 06:08:38,393 INFO L87 Difference]: Start difference. First operand has 890 states, 666 states have (on average 1.1786786786786787) internal successors, (785), 678 states have internal predecessors, (785), 202 states have call successors, (202), 23 states have call predecessors, (202), 21 states have return successors, (200), 188 states have call predecessors, (200), 200 states have call successors, (200) Second operand 901 states. [2022-04-28 06:08:38,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:08:38,430 INFO L93 Difference]: Finished difference Result 901 states and 1198 transitions. [2022-04-28 06:08:38,430 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1198 transitions. [2022-04-28 06:08:38,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:08:38,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:08:38,432 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:08:38,432 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:08:38,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 890 states, 666 states have (on average 1.1786786786786787) internal successors, (785), 678 states have internal predecessors, (785), 202 states have call successors, (202), 23 states have call predecessors, (202), 21 states have return successors, (200), 188 states have call predecessors, (200), 200 states have call successors, (200) [2022-04-28 06:08:38,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 1187 transitions. [2022-04-28 06:08:38,483 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 1187 transitions. Word has length 161 [2022-04-28 06:08:38,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:08:38,484 INFO L495 AbstractCegarLoop]: Abstraction has 890 states and 1187 transitions. [2022-04-28 06:08:38,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 5.523809523809524) internal successors, (116), 20 states have internal predecessors, (116), 20 states have call successors, (22), 20 states have call predecessors, (22), 18 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) [2022-04-28 06:08:38,484 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 890 states and 1187 transitions. [2022-04-28 06:08:54,741 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1187 edges. 1184 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-28 06:08:54,741 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1187 transitions. [2022-04-28 06:08:54,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-04-28 06:08:54,743 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:08:54,743 INFO L195 NwaCegarLoop]: trace histogram [18, 17, 17, 8, 7, 7, 7, 7, 6, 6, 6, 5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:08:54,762 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Forceful destruction successful, exit code 0 [2022-04-28 06:08:54,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55,57 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:08:54,944 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:08:54,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:08:54,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1942329766, now seen corresponding path program 25 times [2022-04-28 06:08:54,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:08:54,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1385486604] [2022-04-28 06:08:54,945 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 06:08:54,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1942329766, now seen corresponding path program 26 times [2022-04-28 06:08:54,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:08:54,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427859388] [2022-04-28 06:08:54,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:08:54,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:08:54,961 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:08:54,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2093889260] [2022-04-28 06:08:54,962 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 06:08:54,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:08:54,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:08:54,963 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:08:54,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Waiting until timeout for monitored process [2022-04-28 06:08:55,049 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 06:08:55,050 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:08:55,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-28 06:08:55,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:08:55,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:08:56,162 INFO L272 TraceCheckUtils]: 0: Hoare triple {176216#true} call ULTIMATE.init(); {176216#true} is VALID [2022-04-28 06:08:56,163 INFO L290 TraceCheckUtils]: 1: Hoare triple {176216#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {176224#(<= ~counter~0 0)} is VALID [2022-04-28 06:08:56,163 INFO L290 TraceCheckUtils]: 2: Hoare triple {176224#(<= ~counter~0 0)} assume true; {176224#(<= ~counter~0 0)} is VALID [2022-04-28 06:08:56,163 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {176224#(<= ~counter~0 0)} {176216#true} #102#return; {176224#(<= ~counter~0 0)} is VALID [2022-04-28 06:08:56,164 INFO L272 TraceCheckUtils]: 4: Hoare triple {176224#(<= ~counter~0 0)} call #t~ret9 := main(); {176224#(<= ~counter~0 0)} is VALID [2022-04-28 06:08:56,164 INFO L290 TraceCheckUtils]: 5: Hoare triple {176224#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {176224#(<= ~counter~0 0)} is VALID [2022-04-28 06:08:56,164 INFO L272 TraceCheckUtils]: 6: Hoare triple {176224#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {176224#(<= ~counter~0 0)} is VALID [2022-04-28 06:08:56,165 INFO L290 TraceCheckUtils]: 7: Hoare triple {176224#(<= ~counter~0 0)} ~cond := #in~cond; {176224#(<= ~counter~0 0)} is VALID [2022-04-28 06:08:56,165 INFO L290 TraceCheckUtils]: 8: Hoare triple {176224#(<= ~counter~0 0)} assume !(0 == ~cond); {176224#(<= ~counter~0 0)} is VALID [2022-04-28 06:08:56,165 INFO L290 TraceCheckUtils]: 9: Hoare triple {176224#(<= ~counter~0 0)} assume true; {176224#(<= ~counter~0 0)} is VALID [2022-04-28 06:08:56,166 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {176224#(<= ~counter~0 0)} {176224#(<= ~counter~0 0)} #90#return; {176224#(<= ~counter~0 0)} is VALID [2022-04-28 06:08:56,166 INFO L272 TraceCheckUtils]: 11: Hoare triple {176224#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {176224#(<= ~counter~0 0)} is VALID [2022-04-28 06:08:56,166 INFO L290 TraceCheckUtils]: 12: Hoare triple {176224#(<= ~counter~0 0)} ~cond := #in~cond; {176224#(<= ~counter~0 0)} is VALID [2022-04-28 06:08:56,166 INFO L290 TraceCheckUtils]: 13: Hoare triple {176224#(<= ~counter~0 0)} assume !(0 == ~cond); {176224#(<= ~counter~0 0)} is VALID [2022-04-28 06:08:56,167 INFO L290 TraceCheckUtils]: 14: Hoare triple {176224#(<= ~counter~0 0)} assume true; {176224#(<= ~counter~0 0)} is VALID [2022-04-28 06:08:56,167 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {176224#(<= ~counter~0 0)} {176224#(<= ~counter~0 0)} #92#return; {176224#(<= ~counter~0 0)} is VALID [2022-04-28 06:08:56,167 INFO L290 TraceCheckUtils]: 16: Hoare triple {176224#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {176224#(<= ~counter~0 0)} is VALID [2022-04-28 06:08:56,171 INFO L290 TraceCheckUtils]: 17: Hoare triple {176224#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {176273#(<= ~counter~0 1)} is VALID [2022-04-28 06:08:56,171 INFO L290 TraceCheckUtils]: 18: Hoare triple {176273#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {176273#(<= ~counter~0 1)} is VALID [2022-04-28 06:08:56,172 INFO L272 TraceCheckUtils]: 19: Hoare triple {176273#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176273#(<= ~counter~0 1)} is VALID [2022-04-28 06:08:56,172 INFO L290 TraceCheckUtils]: 20: Hoare triple {176273#(<= ~counter~0 1)} ~cond := #in~cond; {176273#(<= ~counter~0 1)} is VALID [2022-04-28 06:08:56,172 INFO L290 TraceCheckUtils]: 21: Hoare triple {176273#(<= ~counter~0 1)} assume !(0 == ~cond); {176273#(<= ~counter~0 1)} is VALID [2022-04-28 06:08:56,173 INFO L290 TraceCheckUtils]: 22: Hoare triple {176273#(<= ~counter~0 1)} assume true; {176273#(<= ~counter~0 1)} is VALID [2022-04-28 06:08:56,173 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {176273#(<= ~counter~0 1)} {176273#(<= ~counter~0 1)} #94#return; {176273#(<= ~counter~0 1)} is VALID [2022-04-28 06:08:56,173 INFO L290 TraceCheckUtils]: 24: Hoare triple {176273#(<= ~counter~0 1)} assume !!(0 != ~r~0); {176273#(<= ~counter~0 1)} is VALID [2022-04-28 06:08:56,175 INFO L290 TraceCheckUtils]: 25: Hoare triple {176273#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {176298#(<= ~counter~0 2)} is VALID [2022-04-28 06:08:56,175 INFO L290 TraceCheckUtils]: 26: Hoare triple {176298#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {176298#(<= ~counter~0 2)} is VALID [2022-04-28 06:08:56,176 INFO L272 TraceCheckUtils]: 27: Hoare triple {176298#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176298#(<= ~counter~0 2)} is VALID [2022-04-28 06:08:56,176 INFO L290 TraceCheckUtils]: 28: Hoare triple {176298#(<= ~counter~0 2)} ~cond := #in~cond; {176298#(<= ~counter~0 2)} is VALID [2022-04-28 06:08:56,176 INFO L290 TraceCheckUtils]: 29: Hoare triple {176298#(<= ~counter~0 2)} assume !(0 == ~cond); {176298#(<= ~counter~0 2)} is VALID [2022-04-28 06:08:56,176 INFO L290 TraceCheckUtils]: 30: Hoare triple {176298#(<= ~counter~0 2)} assume true; {176298#(<= ~counter~0 2)} is VALID [2022-04-28 06:08:56,177 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {176298#(<= ~counter~0 2)} {176298#(<= ~counter~0 2)} #96#return; {176298#(<= ~counter~0 2)} is VALID [2022-04-28 06:08:56,177 INFO L290 TraceCheckUtils]: 32: Hoare triple {176298#(<= ~counter~0 2)} assume !(~r~0 > 0); {176298#(<= ~counter~0 2)} is VALID [2022-04-28 06:08:56,179 INFO L290 TraceCheckUtils]: 33: Hoare triple {176298#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {176323#(<= ~counter~0 3)} is VALID [2022-04-28 06:08:56,179 INFO L290 TraceCheckUtils]: 34: Hoare triple {176323#(<= ~counter~0 3)} assume !!(#t~post8 < 20);havoc #t~post8; {176323#(<= ~counter~0 3)} is VALID [2022-04-28 06:08:56,179 INFO L272 TraceCheckUtils]: 35: Hoare triple {176323#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176323#(<= ~counter~0 3)} is VALID [2022-04-28 06:08:56,180 INFO L290 TraceCheckUtils]: 36: Hoare triple {176323#(<= ~counter~0 3)} ~cond := #in~cond; {176323#(<= ~counter~0 3)} is VALID [2022-04-28 06:08:56,180 INFO L290 TraceCheckUtils]: 37: Hoare triple {176323#(<= ~counter~0 3)} assume !(0 == ~cond); {176323#(<= ~counter~0 3)} is VALID [2022-04-28 06:08:56,180 INFO L290 TraceCheckUtils]: 38: Hoare triple {176323#(<= ~counter~0 3)} assume true; {176323#(<= ~counter~0 3)} is VALID [2022-04-28 06:08:56,181 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {176323#(<= ~counter~0 3)} {176323#(<= ~counter~0 3)} #98#return; {176323#(<= ~counter~0 3)} is VALID [2022-04-28 06:08:56,181 INFO L290 TraceCheckUtils]: 40: Hoare triple {176323#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {176323#(<= ~counter~0 3)} is VALID [2022-04-28 06:08:56,182 INFO L290 TraceCheckUtils]: 41: Hoare triple {176323#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {176348#(<= ~counter~0 4)} is VALID [2022-04-28 06:08:56,183 INFO L290 TraceCheckUtils]: 42: Hoare triple {176348#(<= ~counter~0 4)} assume !!(#t~post8 < 20);havoc #t~post8; {176348#(<= ~counter~0 4)} is VALID [2022-04-28 06:08:56,183 INFO L272 TraceCheckUtils]: 43: Hoare triple {176348#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176348#(<= ~counter~0 4)} is VALID [2022-04-28 06:08:56,183 INFO L290 TraceCheckUtils]: 44: Hoare triple {176348#(<= ~counter~0 4)} ~cond := #in~cond; {176348#(<= ~counter~0 4)} is VALID [2022-04-28 06:08:56,184 INFO L290 TraceCheckUtils]: 45: Hoare triple {176348#(<= ~counter~0 4)} assume !(0 == ~cond); {176348#(<= ~counter~0 4)} is VALID [2022-04-28 06:08:56,184 INFO L290 TraceCheckUtils]: 46: Hoare triple {176348#(<= ~counter~0 4)} assume true; {176348#(<= ~counter~0 4)} is VALID [2022-04-28 06:08:56,184 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {176348#(<= ~counter~0 4)} {176348#(<= ~counter~0 4)} #98#return; {176348#(<= ~counter~0 4)} is VALID [2022-04-28 06:08:56,185 INFO L290 TraceCheckUtils]: 48: Hoare triple {176348#(<= ~counter~0 4)} assume !(~r~0 < 0); {176348#(<= ~counter~0 4)} is VALID [2022-04-28 06:08:56,186 INFO L290 TraceCheckUtils]: 49: Hoare triple {176348#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {176373#(<= ~counter~0 5)} is VALID [2022-04-28 06:08:56,186 INFO L290 TraceCheckUtils]: 50: Hoare triple {176373#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {176373#(<= ~counter~0 5)} is VALID [2022-04-28 06:08:56,187 INFO L272 TraceCheckUtils]: 51: Hoare triple {176373#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176373#(<= ~counter~0 5)} is VALID [2022-04-28 06:08:56,187 INFO L290 TraceCheckUtils]: 52: Hoare triple {176373#(<= ~counter~0 5)} ~cond := #in~cond; {176373#(<= ~counter~0 5)} is VALID [2022-04-28 06:08:56,187 INFO L290 TraceCheckUtils]: 53: Hoare triple {176373#(<= ~counter~0 5)} assume !(0 == ~cond); {176373#(<= ~counter~0 5)} is VALID [2022-04-28 06:08:56,188 INFO L290 TraceCheckUtils]: 54: Hoare triple {176373#(<= ~counter~0 5)} assume true; {176373#(<= ~counter~0 5)} is VALID [2022-04-28 06:08:56,188 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {176373#(<= ~counter~0 5)} {176373#(<= ~counter~0 5)} #94#return; {176373#(<= ~counter~0 5)} is VALID [2022-04-28 06:08:56,188 INFO L290 TraceCheckUtils]: 56: Hoare triple {176373#(<= ~counter~0 5)} assume !!(0 != ~r~0); {176373#(<= ~counter~0 5)} is VALID [2022-04-28 06:08:56,190 INFO L290 TraceCheckUtils]: 57: Hoare triple {176373#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {176398#(<= ~counter~0 6)} is VALID [2022-04-28 06:08:56,190 INFO L290 TraceCheckUtils]: 58: Hoare triple {176398#(<= ~counter~0 6)} assume !!(#t~post7 < 20);havoc #t~post7; {176398#(<= ~counter~0 6)} is VALID [2022-04-28 06:08:56,190 INFO L272 TraceCheckUtils]: 59: Hoare triple {176398#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176398#(<= ~counter~0 6)} is VALID [2022-04-28 06:08:56,191 INFO L290 TraceCheckUtils]: 60: Hoare triple {176398#(<= ~counter~0 6)} ~cond := #in~cond; {176398#(<= ~counter~0 6)} is VALID [2022-04-28 06:08:56,191 INFO L290 TraceCheckUtils]: 61: Hoare triple {176398#(<= ~counter~0 6)} assume !(0 == ~cond); {176398#(<= ~counter~0 6)} is VALID [2022-04-28 06:08:56,191 INFO L290 TraceCheckUtils]: 62: Hoare triple {176398#(<= ~counter~0 6)} assume true; {176398#(<= ~counter~0 6)} is VALID [2022-04-28 06:08:56,192 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {176398#(<= ~counter~0 6)} {176398#(<= ~counter~0 6)} #96#return; {176398#(<= ~counter~0 6)} is VALID [2022-04-28 06:08:56,192 INFO L290 TraceCheckUtils]: 64: Hoare triple {176398#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {176398#(<= ~counter~0 6)} is VALID [2022-04-28 06:08:56,193 INFO L290 TraceCheckUtils]: 65: Hoare triple {176398#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {176423#(<= ~counter~0 7)} is VALID [2022-04-28 06:08:56,194 INFO L290 TraceCheckUtils]: 66: Hoare triple {176423#(<= ~counter~0 7)} assume !!(#t~post7 < 20);havoc #t~post7; {176423#(<= ~counter~0 7)} is VALID [2022-04-28 06:08:56,194 INFO L272 TraceCheckUtils]: 67: Hoare triple {176423#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176423#(<= ~counter~0 7)} is VALID [2022-04-28 06:08:56,194 INFO L290 TraceCheckUtils]: 68: Hoare triple {176423#(<= ~counter~0 7)} ~cond := #in~cond; {176423#(<= ~counter~0 7)} is VALID [2022-04-28 06:08:56,195 INFO L290 TraceCheckUtils]: 69: Hoare triple {176423#(<= ~counter~0 7)} assume !(0 == ~cond); {176423#(<= ~counter~0 7)} is VALID [2022-04-28 06:08:56,195 INFO L290 TraceCheckUtils]: 70: Hoare triple {176423#(<= ~counter~0 7)} assume true; {176423#(<= ~counter~0 7)} is VALID [2022-04-28 06:08:56,195 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {176423#(<= ~counter~0 7)} {176423#(<= ~counter~0 7)} #96#return; {176423#(<= ~counter~0 7)} is VALID [2022-04-28 06:08:56,196 INFO L290 TraceCheckUtils]: 72: Hoare triple {176423#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {176423#(<= ~counter~0 7)} is VALID [2022-04-28 06:08:56,197 INFO L290 TraceCheckUtils]: 73: Hoare triple {176423#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {176448#(<= ~counter~0 8)} is VALID [2022-04-28 06:08:56,197 INFO L290 TraceCheckUtils]: 74: Hoare triple {176448#(<= ~counter~0 8)} assume !!(#t~post7 < 20);havoc #t~post7; {176448#(<= ~counter~0 8)} is VALID [2022-04-28 06:08:56,198 INFO L272 TraceCheckUtils]: 75: Hoare triple {176448#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176448#(<= ~counter~0 8)} is VALID [2022-04-28 06:08:56,198 INFO L290 TraceCheckUtils]: 76: Hoare triple {176448#(<= ~counter~0 8)} ~cond := #in~cond; {176448#(<= ~counter~0 8)} is VALID [2022-04-28 06:08:56,198 INFO L290 TraceCheckUtils]: 77: Hoare triple {176448#(<= ~counter~0 8)} assume !(0 == ~cond); {176448#(<= ~counter~0 8)} is VALID [2022-04-28 06:08:56,198 INFO L290 TraceCheckUtils]: 78: Hoare triple {176448#(<= ~counter~0 8)} assume true; {176448#(<= ~counter~0 8)} is VALID [2022-04-28 06:08:56,199 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {176448#(<= ~counter~0 8)} {176448#(<= ~counter~0 8)} #96#return; {176448#(<= ~counter~0 8)} is VALID [2022-04-28 06:08:56,199 INFO L290 TraceCheckUtils]: 80: Hoare triple {176448#(<= ~counter~0 8)} assume !(~r~0 > 0); {176448#(<= ~counter~0 8)} is VALID [2022-04-28 06:08:56,201 INFO L290 TraceCheckUtils]: 81: Hoare triple {176448#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {176473#(<= ~counter~0 9)} is VALID [2022-04-28 06:08:56,201 INFO L290 TraceCheckUtils]: 82: Hoare triple {176473#(<= ~counter~0 9)} assume !!(#t~post8 < 20);havoc #t~post8; {176473#(<= ~counter~0 9)} is VALID [2022-04-28 06:08:56,201 INFO L272 TraceCheckUtils]: 83: Hoare triple {176473#(<= ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176473#(<= ~counter~0 9)} is VALID [2022-04-28 06:08:56,202 INFO L290 TraceCheckUtils]: 84: Hoare triple {176473#(<= ~counter~0 9)} ~cond := #in~cond; {176473#(<= ~counter~0 9)} is VALID [2022-04-28 06:08:56,202 INFO L290 TraceCheckUtils]: 85: Hoare triple {176473#(<= ~counter~0 9)} assume !(0 == ~cond); {176473#(<= ~counter~0 9)} is VALID [2022-04-28 06:08:56,202 INFO L290 TraceCheckUtils]: 86: Hoare triple {176473#(<= ~counter~0 9)} assume true; {176473#(<= ~counter~0 9)} is VALID [2022-04-28 06:08:56,202 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {176473#(<= ~counter~0 9)} {176473#(<= ~counter~0 9)} #98#return; {176473#(<= ~counter~0 9)} is VALID [2022-04-28 06:08:56,203 INFO L290 TraceCheckUtils]: 88: Hoare triple {176473#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {176473#(<= ~counter~0 9)} is VALID [2022-04-28 06:08:56,204 INFO L290 TraceCheckUtils]: 89: Hoare triple {176473#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {176498#(<= ~counter~0 10)} is VALID [2022-04-28 06:08:56,204 INFO L290 TraceCheckUtils]: 90: Hoare triple {176498#(<= ~counter~0 10)} assume !!(#t~post8 < 20);havoc #t~post8; {176498#(<= ~counter~0 10)} is VALID [2022-04-28 06:08:56,205 INFO L272 TraceCheckUtils]: 91: Hoare triple {176498#(<= ~counter~0 10)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176498#(<= ~counter~0 10)} is VALID [2022-04-28 06:08:56,205 INFO L290 TraceCheckUtils]: 92: Hoare triple {176498#(<= ~counter~0 10)} ~cond := #in~cond; {176498#(<= ~counter~0 10)} is VALID [2022-04-28 06:08:56,205 INFO L290 TraceCheckUtils]: 93: Hoare triple {176498#(<= ~counter~0 10)} assume !(0 == ~cond); {176498#(<= ~counter~0 10)} is VALID [2022-04-28 06:08:56,206 INFO L290 TraceCheckUtils]: 94: Hoare triple {176498#(<= ~counter~0 10)} assume true; {176498#(<= ~counter~0 10)} is VALID [2022-04-28 06:08:56,206 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {176498#(<= ~counter~0 10)} {176498#(<= ~counter~0 10)} #98#return; {176498#(<= ~counter~0 10)} is VALID [2022-04-28 06:08:56,206 INFO L290 TraceCheckUtils]: 96: Hoare triple {176498#(<= ~counter~0 10)} assume !(~r~0 < 0); {176498#(<= ~counter~0 10)} is VALID [2022-04-28 06:08:56,208 INFO L290 TraceCheckUtils]: 97: Hoare triple {176498#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {176523#(<= ~counter~0 11)} is VALID [2022-04-28 06:08:56,208 INFO L290 TraceCheckUtils]: 98: Hoare triple {176523#(<= ~counter~0 11)} assume !!(#t~post6 < 20);havoc #t~post6; {176523#(<= ~counter~0 11)} is VALID [2022-04-28 06:08:56,208 INFO L272 TraceCheckUtils]: 99: Hoare triple {176523#(<= ~counter~0 11)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176523#(<= ~counter~0 11)} is VALID [2022-04-28 06:08:56,209 INFO L290 TraceCheckUtils]: 100: Hoare triple {176523#(<= ~counter~0 11)} ~cond := #in~cond; {176523#(<= ~counter~0 11)} is VALID [2022-04-28 06:08:56,209 INFO L290 TraceCheckUtils]: 101: Hoare triple {176523#(<= ~counter~0 11)} assume !(0 == ~cond); {176523#(<= ~counter~0 11)} is VALID [2022-04-28 06:08:56,209 INFO L290 TraceCheckUtils]: 102: Hoare triple {176523#(<= ~counter~0 11)} assume true; {176523#(<= ~counter~0 11)} is VALID [2022-04-28 06:08:56,210 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {176523#(<= ~counter~0 11)} {176523#(<= ~counter~0 11)} #94#return; {176523#(<= ~counter~0 11)} is VALID [2022-04-28 06:08:56,210 INFO L290 TraceCheckUtils]: 104: Hoare triple {176523#(<= ~counter~0 11)} assume !!(0 != ~r~0); {176523#(<= ~counter~0 11)} is VALID [2022-04-28 06:08:56,211 INFO L290 TraceCheckUtils]: 105: Hoare triple {176523#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {176548#(<= ~counter~0 12)} is VALID [2022-04-28 06:08:56,212 INFO L290 TraceCheckUtils]: 106: Hoare triple {176548#(<= ~counter~0 12)} assume !!(#t~post7 < 20);havoc #t~post7; {176548#(<= ~counter~0 12)} is VALID [2022-04-28 06:08:56,212 INFO L272 TraceCheckUtils]: 107: Hoare triple {176548#(<= ~counter~0 12)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176548#(<= ~counter~0 12)} is VALID [2022-04-28 06:08:56,212 INFO L290 TraceCheckUtils]: 108: Hoare triple {176548#(<= ~counter~0 12)} ~cond := #in~cond; {176548#(<= ~counter~0 12)} is VALID [2022-04-28 06:08:56,213 INFO L290 TraceCheckUtils]: 109: Hoare triple {176548#(<= ~counter~0 12)} assume !(0 == ~cond); {176548#(<= ~counter~0 12)} is VALID [2022-04-28 06:08:56,213 INFO L290 TraceCheckUtils]: 110: Hoare triple {176548#(<= ~counter~0 12)} assume true; {176548#(<= ~counter~0 12)} is VALID [2022-04-28 06:08:56,213 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {176548#(<= ~counter~0 12)} {176548#(<= ~counter~0 12)} #96#return; {176548#(<= ~counter~0 12)} is VALID [2022-04-28 06:08:56,214 INFO L290 TraceCheckUtils]: 112: Hoare triple {176548#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {176548#(<= ~counter~0 12)} is VALID [2022-04-28 06:08:56,215 INFO L290 TraceCheckUtils]: 113: Hoare triple {176548#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {176573#(<= ~counter~0 13)} is VALID [2022-04-28 06:08:56,215 INFO L290 TraceCheckUtils]: 114: Hoare triple {176573#(<= ~counter~0 13)} assume !!(#t~post7 < 20);havoc #t~post7; {176573#(<= ~counter~0 13)} is VALID [2022-04-28 06:08:56,216 INFO L272 TraceCheckUtils]: 115: Hoare triple {176573#(<= ~counter~0 13)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176573#(<= ~counter~0 13)} is VALID [2022-04-28 06:08:56,216 INFO L290 TraceCheckUtils]: 116: Hoare triple {176573#(<= ~counter~0 13)} ~cond := #in~cond; {176573#(<= ~counter~0 13)} is VALID [2022-04-28 06:08:56,216 INFO L290 TraceCheckUtils]: 117: Hoare triple {176573#(<= ~counter~0 13)} assume !(0 == ~cond); {176573#(<= ~counter~0 13)} is VALID [2022-04-28 06:08:56,216 INFO L290 TraceCheckUtils]: 118: Hoare triple {176573#(<= ~counter~0 13)} assume true; {176573#(<= ~counter~0 13)} is VALID [2022-04-28 06:08:56,217 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {176573#(<= ~counter~0 13)} {176573#(<= ~counter~0 13)} #96#return; {176573#(<= ~counter~0 13)} is VALID [2022-04-28 06:08:56,217 INFO L290 TraceCheckUtils]: 120: Hoare triple {176573#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {176573#(<= ~counter~0 13)} is VALID [2022-04-28 06:08:56,218 INFO L290 TraceCheckUtils]: 121: Hoare triple {176573#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {176598#(<= ~counter~0 14)} is VALID [2022-04-28 06:08:56,219 INFO L290 TraceCheckUtils]: 122: Hoare triple {176598#(<= ~counter~0 14)} assume !!(#t~post7 < 20);havoc #t~post7; {176598#(<= ~counter~0 14)} is VALID [2022-04-28 06:08:56,219 INFO L272 TraceCheckUtils]: 123: Hoare triple {176598#(<= ~counter~0 14)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176598#(<= ~counter~0 14)} is VALID [2022-04-28 06:08:56,219 INFO L290 TraceCheckUtils]: 124: Hoare triple {176598#(<= ~counter~0 14)} ~cond := #in~cond; {176598#(<= ~counter~0 14)} is VALID [2022-04-28 06:08:56,220 INFO L290 TraceCheckUtils]: 125: Hoare triple {176598#(<= ~counter~0 14)} assume !(0 == ~cond); {176598#(<= ~counter~0 14)} is VALID [2022-04-28 06:08:56,220 INFO L290 TraceCheckUtils]: 126: Hoare triple {176598#(<= ~counter~0 14)} assume true; {176598#(<= ~counter~0 14)} is VALID [2022-04-28 06:08:56,220 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {176598#(<= ~counter~0 14)} {176598#(<= ~counter~0 14)} #96#return; {176598#(<= ~counter~0 14)} is VALID [2022-04-28 06:08:56,221 INFO L290 TraceCheckUtils]: 128: Hoare triple {176598#(<= ~counter~0 14)} assume !(~r~0 > 0); {176598#(<= ~counter~0 14)} is VALID [2022-04-28 06:08:56,222 INFO L290 TraceCheckUtils]: 129: Hoare triple {176598#(<= ~counter~0 14)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {176623#(<= ~counter~0 15)} is VALID [2022-04-28 06:08:56,222 INFO L290 TraceCheckUtils]: 130: Hoare triple {176623#(<= ~counter~0 15)} assume !!(#t~post8 < 20);havoc #t~post8; {176623#(<= ~counter~0 15)} is VALID [2022-04-28 06:08:56,223 INFO L272 TraceCheckUtils]: 131: Hoare triple {176623#(<= ~counter~0 15)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176623#(<= ~counter~0 15)} is VALID [2022-04-28 06:08:56,223 INFO L290 TraceCheckUtils]: 132: Hoare triple {176623#(<= ~counter~0 15)} ~cond := #in~cond; {176623#(<= ~counter~0 15)} is VALID [2022-04-28 06:08:56,223 INFO L290 TraceCheckUtils]: 133: Hoare triple {176623#(<= ~counter~0 15)} assume !(0 == ~cond); {176623#(<= ~counter~0 15)} is VALID [2022-04-28 06:08:56,224 INFO L290 TraceCheckUtils]: 134: Hoare triple {176623#(<= ~counter~0 15)} assume true; {176623#(<= ~counter~0 15)} is VALID [2022-04-28 06:08:56,224 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {176623#(<= ~counter~0 15)} {176623#(<= ~counter~0 15)} #98#return; {176623#(<= ~counter~0 15)} is VALID [2022-04-28 06:08:56,224 INFO L290 TraceCheckUtils]: 136: Hoare triple {176623#(<= ~counter~0 15)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {176623#(<= ~counter~0 15)} is VALID [2022-04-28 06:08:56,226 INFO L290 TraceCheckUtils]: 137: Hoare triple {176623#(<= ~counter~0 15)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {176648#(<= ~counter~0 16)} is VALID [2022-04-28 06:08:56,226 INFO L290 TraceCheckUtils]: 138: Hoare triple {176648#(<= ~counter~0 16)} assume !!(#t~post8 < 20);havoc #t~post8; {176648#(<= ~counter~0 16)} is VALID [2022-04-28 06:08:56,226 INFO L272 TraceCheckUtils]: 139: Hoare triple {176648#(<= ~counter~0 16)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176648#(<= ~counter~0 16)} is VALID [2022-04-28 06:08:56,227 INFO L290 TraceCheckUtils]: 140: Hoare triple {176648#(<= ~counter~0 16)} ~cond := #in~cond; {176648#(<= ~counter~0 16)} is VALID [2022-04-28 06:08:56,227 INFO L290 TraceCheckUtils]: 141: Hoare triple {176648#(<= ~counter~0 16)} assume !(0 == ~cond); {176648#(<= ~counter~0 16)} is VALID [2022-04-28 06:08:56,227 INFO L290 TraceCheckUtils]: 142: Hoare triple {176648#(<= ~counter~0 16)} assume true; {176648#(<= ~counter~0 16)} is VALID [2022-04-28 06:08:56,228 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {176648#(<= ~counter~0 16)} {176648#(<= ~counter~0 16)} #98#return; {176648#(<= ~counter~0 16)} is VALID [2022-04-28 06:08:56,228 INFO L290 TraceCheckUtils]: 144: Hoare triple {176648#(<= ~counter~0 16)} assume !(~r~0 < 0); {176648#(<= ~counter~0 16)} is VALID [2022-04-28 06:08:56,229 INFO L290 TraceCheckUtils]: 145: Hoare triple {176648#(<= ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {176673#(<= ~counter~0 17)} is VALID [2022-04-28 06:08:56,230 INFO L290 TraceCheckUtils]: 146: Hoare triple {176673#(<= ~counter~0 17)} assume !!(#t~post6 < 20);havoc #t~post6; {176673#(<= ~counter~0 17)} is VALID [2022-04-28 06:08:56,230 INFO L272 TraceCheckUtils]: 147: Hoare triple {176673#(<= ~counter~0 17)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176673#(<= ~counter~0 17)} is VALID [2022-04-28 06:08:56,230 INFO L290 TraceCheckUtils]: 148: Hoare triple {176673#(<= ~counter~0 17)} ~cond := #in~cond; {176673#(<= ~counter~0 17)} is VALID [2022-04-28 06:08:56,231 INFO L290 TraceCheckUtils]: 149: Hoare triple {176673#(<= ~counter~0 17)} assume !(0 == ~cond); {176673#(<= ~counter~0 17)} is VALID [2022-04-28 06:08:56,231 INFO L290 TraceCheckUtils]: 150: Hoare triple {176673#(<= ~counter~0 17)} assume true; {176673#(<= ~counter~0 17)} is VALID [2022-04-28 06:08:56,231 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {176673#(<= ~counter~0 17)} {176673#(<= ~counter~0 17)} #94#return; {176673#(<= ~counter~0 17)} is VALID [2022-04-28 06:08:56,232 INFO L290 TraceCheckUtils]: 152: Hoare triple {176673#(<= ~counter~0 17)} assume !!(0 != ~r~0); {176673#(<= ~counter~0 17)} is VALID [2022-04-28 06:08:56,232 INFO L290 TraceCheckUtils]: 153: Hoare triple {176673#(<= ~counter~0 17)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {176698#(<= |main_#t~post7| 17)} is VALID [2022-04-28 06:08:56,232 INFO L290 TraceCheckUtils]: 154: Hoare triple {176698#(<= |main_#t~post7| 17)} assume !(#t~post7 < 20);havoc #t~post7; {176217#false} is VALID [2022-04-28 06:08:56,232 INFO L290 TraceCheckUtils]: 155: Hoare triple {176217#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {176217#false} is VALID [2022-04-28 06:08:56,232 INFO L290 TraceCheckUtils]: 156: Hoare triple {176217#false} assume !(#t~post8 < 20);havoc #t~post8; {176217#false} is VALID [2022-04-28 06:08:56,232 INFO L290 TraceCheckUtils]: 157: Hoare triple {176217#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {176217#false} is VALID [2022-04-28 06:08:56,233 INFO L290 TraceCheckUtils]: 158: Hoare triple {176217#false} assume !(#t~post6 < 20);havoc #t~post6; {176217#false} is VALID [2022-04-28 06:08:56,233 INFO L272 TraceCheckUtils]: 159: Hoare triple {176217#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176217#false} is VALID [2022-04-28 06:08:56,233 INFO L290 TraceCheckUtils]: 160: Hoare triple {176217#false} ~cond := #in~cond; {176217#false} is VALID [2022-04-28 06:08:56,233 INFO L290 TraceCheckUtils]: 161: Hoare triple {176217#false} assume 0 == ~cond; {176217#false} is VALID [2022-04-28 06:08:56,233 INFO L290 TraceCheckUtils]: 162: Hoare triple {176217#false} assume !false; {176217#false} is VALID [2022-04-28 06:08:56,233 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 54 proven. 726 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 06:08:56,233 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 06:08:57,001 INFO L290 TraceCheckUtils]: 162: Hoare triple {176217#false} assume !false; {176217#false} is VALID [2022-04-28 06:08:57,001 INFO L290 TraceCheckUtils]: 161: Hoare triple {176217#false} assume 0 == ~cond; {176217#false} is VALID [2022-04-28 06:08:57,001 INFO L290 TraceCheckUtils]: 160: Hoare triple {176217#false} ~cond := #in~cond; {176217#false} is VALID [2022-04-28 06:08:57,001 INFO L272 TraceCheckUtils]: 159: Hoare triple {176217#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176217#false} is VALID [2022-04-28 06:08:57,001 INFO L290 TraceCheckUtils]: 158: Hoare triple {176217#false} assume !(#t~post6 < 20);havoc #t~post6; {176217#false} is VALID [2022-04-28 06:08:57,001 INFO L290 TraceCheckUtils]: 157: Hoare triple {176217#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {176217#false} is VALID [2022-04-28 06:08:57,001 INFO L290 TraceCheckUtils]: 156: Hoare triple {176217#false} assume !(#t~post8 < 20);havoc #t~post8; {176217#false} is VALID [2022-04-28 06:08:57,001 INFO L290 TraceCheckUtils]: 155: Hoare triple {176217#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {176217#false} is VALID [2022-04-28 06:08:57,002 INFO L290 TraceCheckUtils]: 154: Hoare triple {176750#(< |main_#t~post7| 20)} assume !(#t~post7 < 20);havoc #t~post7; {176217#false} is VALID [2022-04-28 06:08:57,002 INFO L290 TraceCheckUtils]: 153: Hoare triple {176754#(< ~counter~0 20)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {176750#(< |main_#t~post7| 20)} is VALID [2022-04-28 06:08:57,002 INFO L290 TraceCheckUtils]: 152: Hoare triple {176754#(< ~counter~0 20)} assume !!(0 != ~r~0); {176754#(< ~counter~0 20)} is VALID [2022-04-28 06:08:57,003 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {176216#true} {176754#(< ~counter~0 20)} #94#return; {176754#(< ~counter~0 20)} is VALID [2022-04-28 06:08:57,003 INFO L290 TraceCheckUtils]: 150: Hoare triple {176216#true} assume true; {176216#true} is VALID [2022-04-28 06:08:57,003 INFO L290 TraceCheckUtils]: 149: Hoare triple {176216#true} assume !(0 == ~cond); {176216#true} is VALID [2022-04-28 06:08:57,003 INFO L290 TraceCheckUtils]: 148: Hoare triple {176216#true} ~cond := #in~cond; {176216#true} is VALID [2022-04-28 06:08:57,003 INFO L272 TraceCheckUtils]: 147: Hoare triple {176754#(< ~counter~0 20)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176216#true} is VALID [2022-04-28 06:08:57,003 INFO L290 TraceCheckUtils]: 146: Hoare triple {176754#(< ~counter~0 20)} assume !!(#t~post6 < 20);havoc #t~post6; {176754#(< ~counter~0 20)} is VALID [2022-04-28 06:08:57,007 INFO L290 TraceCheckUtils]: 145: Hoare triple {176779#(< ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {176754#(< ~counter~0 20)} is VALID [2022-04-28 06:08:57,007 INFO L290 TraceCheckUtils]: 144: Hoare triple {176779#(< ~counter~0 19)} assume !(~r~0 < 0); {176779#(< ~counter~0 19)} is VALID [2022-04-28 06:08:57,008 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {176216#true} {176779#(< ~counter~0 19)} #98#return; {176779#(< ~counter~0 19)} is VALID [2022-04-28 06:08:57,008 INFO L290 TraceCheckUtils]: 142: Hoare triple {176216#true} assume true; {176216#true} is VALID [2022-04-28 06:08:57,008 INFO L290 TraceCheckUtils]: 141: Hoare triple {176216#true} assume !(0 == ~cond); {176216#true} is VALID [2022-04-28 06:08:57,008 INFO L290 TraceCheckUtils]: 140: Hoare triple {176216#true} ~cond := #in~cond; {176216#true} is VALID [2022-04-28 06:08:57,008 INFO L272 TraceCheckUtils]: 139: Hoare triple {176779#(< ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176216#true} is VALID [2022-04-28 06:08:57,008 INFO L290 TraceCheckUtils]: 138: Hoare triple {176779#(< ~counter~0 19)} assume !!(#t~post8 < 20);havoc #t~post8; {176779#(< ~counter~0 19)} is VALID [2022-04-28 06:08:57,009 INFO L290 TraceCheckUtils]: 137: Hoare triple {176673#(<= ~counter~0 17)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {176779#(< ~counter~0 19)} is VALID [2022-04-28 06:08:57,010 INFO L290 TraceCheckUtils]: 136: Hoare triple {176673#(<= ~counter~0 17)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {176673#(<= ~counter~0 17)} is VALID [2022-04-28 06:08:57,010 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {176216#true} {176673#(<= ~counter~0 17)} #98#return; {176673#(<= ~counter~0 17)} is VALID [2022-04-28 06:08:57,010 INFO L290 TraceCheckUtils]: 134: Hoare triple {176216#true} assume true; {176216#true} is VALID [2022-04-28 06:08:57,010 INFO L290 TraceCheckUtils]: 133: Hoare triple {176216#true} assume !(0 == ~cond); {176216#true} is VALID [2022-04-28 06:08:57,010 INFO L290 TraceCheckUtils]: 132: Hoare triple {176216#true} ~cond := #in~cond; {176216#true} is VALID [2022-04-28 06:08:57,010 INFO L272 TraceCheckUtils]: 131: Hoare triple {176673#(<= ~counter~0 17)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176216#true} is VALID [2022-04-28 06:08:57,011 INFO L290 TraceCheckUtils]: 130: Hoare triple {176673#(<= ~counter~0 17)} assume !!(#t~post8 < 20);havoc #t~post8; {176673#(<= ~counter~0 17)} is VALID [2022-04-28 06:08:57,012 INFO L290 TraceCheckUtils]: 129: Hoare triple {176648#(<= ~counter~0 16)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {176673#(<= ~counter~0 17)} is VALID [2022-04-28 06:08:57,012 INFO L290 TraceCheckUtils]: 128: Hoare triple {176648#(<= ~counter~0 16)} assume !(~r~0 > 0); {176648#(<= ~counter~0 16)} is VALID [2022-04-28 06:08:57,013 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {176216#true} {176648#(<= ~counter~0 16)} #96#return; {176648#(<= ~counter~0 16)} is VALID [2022-04-28 06:08:57,013 INFO L290 TraceCheckUtils]: 126: Hoare triple {176216#true} assume true; {176216#true} is VALID [2022-04-28 06:08:57,013 INFO L290 TraceCheckUtils]: 125: Hoare triple {176216#true} assume !(0 == ~cond); {176216#true} is VALID [2022-04-28 06:08:57,013 INFO L290 TraceCheckUtils]: 124: Hoare triple {176216#true} ~cond := #in~cond; {176216#true} is VALID [2022-04-28 06:08:57,013 INFO L272 TraceCheckUtils]: 123: Hoare triple {176648#(<= ~counter~0 16)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176216#true} is VALID [2022-04-28 06:08:57,013 INFO L290 TraceCheckUtils]: 122: Hoare triple {176648#(<= ~counter~0 16)} assume !!(#t~post7 < 20);havoc #t~post7; {176648#(<= ~counter~0 16)} is VALID [2022-04-28 06:08:57,014 INFO L290 TraceCheckUtils]: 121: Hoare triple {176623#(<= ~counter~0 15)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {176648#(<= ~counter~0 16)} is VALID [2022-04-28 06:08:57,015 INFO L290 TraceCheckUtils]: 120: Hoare triple {176623#(<= ~counter~0 15)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {176623#(<= ~counter~0 15)} is VALID [2022-04-28 06:08:57,015 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {176216#true} {176623#(<= ~counter~0 15)} #96#return; {176623#(<= ~counter~0 15)} is VALID [2022-04-28 06:08:57,015 INFO L290 TraceCheckUtils]: 118: Hoare triple {176216#true} assume true; {176216#true} is VALID [2022-04-28 06:08:57,015 INFO L290 TraceCheckUtils]: 117: Hoare triple {176216#true} assume !(0 == ~cond); {176216#true} is VALID [2022-04-28 06:08:57,015 INFO L290 TraceCheckUtils]: 116: Hoare triple {176216#true} ~cond := #in~cond; {176216#true} is VALID [2022-04-28 06:08:57,016 INFO L272 TraceCheckUtils]: 115: Hoare triple {176623#(<= ~counter~0 15)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176216#true} is VALID [2022-04-28 06:08:57,016 INFO L290 TraceCheckUtils]: 114: Hoare triple {176623#(<= ~counter~0 15)} assume !!(#t~post7 < 20);havoc #t~post7; {176623#(<= ~counter~0 15)} is VALID [2022-04-28 06:08:57,017 INFO L290 TraceCheckUtils]: 113: Hoare triple {176598#(<= ~counter~0 14)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {176623#(<= ~counter~0 15)} is VALID [2022-04-28 06:08:57,018 INFO L290 TraceCheckUtils]: 112: Hoare triple {176598#(<= ~counter~0 14)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {176598#(<= ~counter~0 14)} is VALID [2022-04-28 06:08:57,018 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {176216#true} {176598#(<= ~counter~0 14)} #96#return; {176598#(<= ~counter~0 14)} is VALID [2022-04-28 06:08:57,018 INFO L290 TraceCheckUtils]: 110: Hoare triple {176216#true} assume true; {176216#true} is VALID [2022-04-28 06:08:57,018 INFO L290 TraceCheckUtils]: 109: Hoare triple {176216#true} assume !(0 == ~cond); {176216#true} is VALID [2022-04-28 06:08:57,018 INFO L290 TraceCheckUtils]: 108: Hoare triple {176216#true} ~cond := #in~cond; {176216#true} is VALID [2022-04-28 06:08:57,018 INFO L272 TraceCheckUtils]: 107: Hoare triple {176598#(<= ~counter~0 14)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176216#true} is VALID [2022-04-28 06:08:57,018 INFO L290 TraceCheckUtils]: 106: Hoare triple {176598#(<= ~counter~0 14)} assume !!(#t~post7 < 20);havoc #t~post7; {176598#(<= ~counter~0 14)} is VALID [2022-04-28 06:08:57,020 INFO L290 TraceCheckUtils]: 105: Hoare triple {176573#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {176598#(<= ~counter~0 14)} is VALID [2022-04-28 06:08:57,020 INFO L290 TraceCheckUtils]: 104: Hoare triple {176573#(<= ~counter~0 13)} assume !!(0 != ~r~0); {176573#(<= ~counter~0 13)} is VALID [2022-04-28 06:08:57,021 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {176216#true} {176573#(<= ~counter~0 13)} #94#return; {176573#(<= ~counter~0 13)} is VALID [2022-04-28 06:08:57,021 INFO L290 TraceCheckUtils]: 102: Hoare triple {176216#true} assume true; {176216#true} is VALID [2022-04-28 06:08:57,021 INFO L290 TraceCheckUtils]: 101: Hoare triple {176216#true} assume !(0 == ~cond); {176216#true} is VALID [2022-04-28 06:08:57,021 INFO L290 TraceCheckUtils]: 100: Hoare triple {176216#true} ~cond := #in~cond; {176216#true} is VALID [2022-04-28 06:08:57,021 INFO L272 TraceCheckUtils]: 99: Hoare triple {176573#(<= ~counter~0 13)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176216#true} is VALID [2022-04-28 06:08:57,021 INFO L290 TraceCheckUtils]: 98: Hoare triple {176573#(<= ~counter~0 13)} assume !!(#t~post6 < 20);havoc #t~post6; {176573#(<= ~counter~0 13)} is VALID [2022-04-28 06:08:57,022 INFO L290 TraceCheckUtils]: 97: Hoare triple {176548#(<= ~counter~0 12)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {176573#(<= ~counter~0 13)} is VALID [2022-04-28 06:08:57,023 INFO L290 TraceCheckUtils]: 96: Hoare triple {176548#(<= ~counter~0 12)} assume !(~r~0 < 0); {176548#(<= ~counter~0 12)} is VALID [2022-04-28 06:08:57,023 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {176216#true} {176548#(<= ~counter~0 12)} #98#return; {176548#(<= ~counter~0 12)} is VALID [2022-04-28 06:08:57,023 INFO L290 TraceCheckUtils]: 94: Hoare triple {176216#true} assume true; {176216#true} is VALID [2022-04-28 06:08:57,023 INFO L290 TraceCheckUtils]: 93: Hoare triple {176216#true} assume !(0 == ~cond); {176216#true} is VALID [2022-04-28 06:08:57,023 INFO L290 TraceCheckUtils]: 92: Hoare triple {176216#true} ~cond := #in~cond; {176216#true} is VALID [2022-04-28 06:08:57,023 INFO L272 TraceCheckUtils]: 91: Hoare triple {176548#(<= ~counter~0 12)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176216#true} is VALID [2022-04-28 06:08:57,024 INFO L290 TraceCheckUtils]: 90: Hoare triple {176548#(<= ~counter~0 12)} assume !!(#t~post8 < 20);havoc #t~post8; {176548#(<= ~counter~0 12)} is VALID [2022-04-28 06:08:57,025 INFO L290 TraceCheckUtils]: 89: Hoare triple {176523#(<= ~counter~0 11)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {176548#(<= ~counter~0 12)} is VALID [2022-04-28 06:08:57,025 INFO L290 TraceCheckUtils]: 88: Hoare triple {176523#(<= ~counter~0 11)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {176523#(<= ~counter~0 11)} is VALID [2022-04-28 06:08:57,026 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {176216#true} {176523#(<= ~counter~0 11)} #98#return; {176523#(<= ~counter~0 11)} is VALID [2022-04-28 06:08:57,026 INFO L290 TraceCheckUtils]: 86: Hoare triple {176216#true} assume true; {176216#true} is VALID [2022-04-28 06:08:57,026 INFO L290 TraceCheckUtils]: 85: Hoare triple {176216#true} assume !(0 == ~cond); {176216#true} is VALID [2022-04-28 06:08:57,026 INFO L290 TraceCheckUtils]: 84: Hoare triple {176216#true} ~cond := #in~cond; {176216#true} is VALID [2022-04-28 06:08:57,026 INFO L272 TraceCheckUtils]: 83: Hoare triple {176523#(<= ~counter~0 11)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176216#true} is VALID [2022-04-28 06:08:57,026 INFO L290 TraceCheckUtils]: 82: Hoare triple {176523#(<= ~counter~0 11)} assume !!(#t~post8 < 20);havoc #t~post8; {176523#(<= ~counter~0 11)} is VALID [2022-04-28 06:08:57,028 INFO L290 TraceCheckUtils]: 81: Hoare triple {176498#(<= ~counter~0 10)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {176523#(<= ~counter~0 11)} is VALID [2022-04-28 06:08:57,028 INFO L290 TraceCheckUtils]: 80: Hoare triple {176498#(<= ~counter~0 10)} assume !(~r~0 > 0); {176498#(<= ~counter~0 10)} is VALID [2022-04-28 06:08:57,028 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {176216#true} {176498#(<= ~counter~0 10)} #96#return; {176498#(<= ~counter~0 10)} is VALID [2022-04-28 06:08:57,028 INFO L290 TraceCheckUtils]: 78: Hoare triple {176216#true} assume true; {176216#true} is VALID [2022-04-28 06:08:57,028 INFO L290 TraceCheckUtils]: 77: Hoare triple {176216#true} assume !(0 == ~cond); {176216#true} is VALID [2022-04-28 06:08:57,028 INFO L290 TraceCheckUtils]: 76: Hoare triple {176216#true} ~cond := #in~cond; {176216#true} is VALID [2022-04-28 06:08:57,029 INFO L272 TraceCheckUtils]: 75: Hoare triple {176498#(<= ~counter~0 10)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176216#true} is VALID [2022-04-28 06:08:57,029 INFO L290 TraceCheckUtils]: 74: Hoare triple {176498#(<= ~counter~0 10)} assume !!(#t~post7 < 20);havoc #t~post7; {176498#(<= ~counter~0 10)} is VALID [2022-04-28 06:08:57,030 INFO L290 TraceCheckUtils]: 73: Hoare triple {176473#(<= ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {176498#(<= ~counter~0 10)} is VALID [2022-04-28 06:08:57,030 INFO L290 TraceCheckUtils]: 72: Hoare triple {176473#(<= ~counter~0 9)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {176473#(<= ~counter~0 9)} is VALID [2022-04-28 06:08:57,031 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {176216#true} {176473#(<= ~counter~0 9)} #96#return; {176473#(<= ~counter~0 9)} is VALID [2022-04-28 06:08:57,031 INFO L290 TraceCheckUtils]: 70: Hoare triple {176216#true} assume true; {176216#true} is VALID [2022-04-28 06:08:57,031 INFO L290 TraceCheckUtils]: 69: Hoare triple {176216#true} assume !(0 == ~cond); {176216#true} is VALID [2022-04-28 06:08:57,031 INFO L290 TraceCheckUtils]: 68: Hoare triple {176216#true} ~cond := #in~cond; {176216#true} is VALID [2022-04-28 06:08:57,031 INFO L272 TraceCheckUtils]: 67: Hoare triple {176473#(<= ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176216#true} is VALID [2022-04-28 06:08:57,031 INFO L290 TraceCheckUtils]: 66: Hoare triple {176473#(<= ~counter~0 9)} assume !!(#t~post7 < 20);havoc #t~post7; {176473#(<= ~counter~0 9)} is VALID [2022-04-28 06:08:57,033 INFO L290 TraceCheckUtils]: 65: Hoare triple {176448#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {176473#(<= ~counter~0 9)} is VALID [2022-04-28 06:08:57,033 INFO L290 TraceCheckUtils]: 64: Hoare triple {176448#(<= ~counter~0 8)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {176448#(<= ~counter~0 8)} is VALID [2022-04-28 06:08:57,033 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {176216#true} {176448#(<= ~counter~0 8)} #96#return; {176448#(<= ~counter~0 8)} is VALID [2022-04-28 06:08:57,033 INFO L290 TraceCheckUtils]: 62: Hoare triple {176216#true} assume true; {176216#true} is VALID [2022-04-28 06:08:57,034 INFO L290 TraceCheckUtils]: 61: Hoare triple {176216#true} assume !(0 == ~cond); {176216#true} is VALID [2022-04-28 06:08:57,034 INFO L290 TraceCheckUtils]: 60: Hoare triple {176216#true} ~cond := #in~cond; {176216#true} is VALID [2022-04-28 06:08:57,034 INFO L272 TraceCheckUtils]: 59: Hoare triple {176448#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176216#true} is VALID [2022-04-28 06:08:57,034 INFO L290 TraceCheckUtils]: 58: Hoare triple {176448#(<= ~counter~0 8)} assume !!(#t~post7 < 20);havoc #t~post7; {176448#(<= ~counter~0 8)} is VALID [2022-04-28 06:08:57,035 INFO L290 TraceCheckUtils]: 57: Hoare triple {176423#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {176448#(<= ~counter~0 8)} is VALID [2022-04-28 06:08:57,036 INFO L290 TraceCheckUtils]: 56: Hoare triple {176423#(<= ~counter~0 7)} assume !!(0 != ~r~0); {176423#(<= ~counter~0 7)} is VALID [2022-04-28 06:08:57,036 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {176216#true} {176423#(<= ~counter~0 7)} #94#return; {176423#(<= ~counter~0 7)} is VALID [2022-04-28 06:08:57,036 INFO L290 TraceCheckUtils]: 54: Hoare triple {176216#true} assume true; {176216#true} is VALID [2022-04-28 06:08:57,036 INFO L290 TraceCheckUtils]: 53: Hoare triple {176216#true} assume !(0 == ~cond); {176216#true} is VALID [2022-04-28 06:08:57,036 INFO L290 TraceCheckUtils]: 52: Hoare triple {176216#true} ~cond := #in~cond; {176216#true} is VALID [2022-04-28 06:08:57,036 INFO L272 TraceCheckUtils]: 51: Hoare triple {176423#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176216#true} is VALID [2022-04-28 06:08:57,037 INFO L290 TraceCheckUtils]: 50: Hoare triple {176423#(<= ~counter~0 7)} assume !!(#t~post6 < 20);havoc #t~post6; {176423#(<= ~counter~0 7)} is VALID [2022-04-28 06:08:57,038 INFO L290 TraceCheckUtils]: 49: Hoare triple {176398#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {176423#(<= ~counter~0 7)} is VALID [2022-04-28 06:08:57,038 INFO L290 TraceCheckUtils]: 48: Hoare triple {176398#(<= ~counter~0 6)} assume !(~r~0 < 0); {176398#(<= ~counter~0 6)} is VALID [2022-04-28 06:08:57,039 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {176216#true} {176398#(<= ~counter~0 6)} #98#return; {176398#(<= ~counter~0 6)} is VALID [2022-04-28 06:08:57,039 INFO L290 TraceCheckUtils]: 46: Hoare triple {176216#true} assume true; {176216#true} is VALID [2022-04-28 06:08:57,039 INFO L290 TraceCheckUtils]: 45: Hoare triple {176216#true} assume !(0 == ~cond); {176216#true} is VALID [2022-04-28 06:08:57,039 INFO L290 TraceCheckUtils]: 44: Hoare triple {176216#true} ~cond := #in~cond; {176216#true} is VALID [2022-04-28 06:08:57,039 INFO L272 TraceCheckUtils]: 43: Hoare triple {176398#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176216#true} is VALID [2022-04-28 06:08:57,039 INFO L290 TraceCheckUtils]: 42: Hoare triple {176398#(<= ~counter~0 6)} assume !!(#t~post8 < 20);havoc #t~post8; {176398#(<= ~counter~0 6)} is VALID [2022-04-28 06:08:57,040 INFO L290 TraceCheckUtils]: 41: Hoare triple {176373#(<= ~counter~0 5)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {176398#(<= ~counter~0 6)} is VALID [2022-04-28 06:08:57,041 INFO L290 TraceCheckUtils]: 40: Hoare triple {176373#(<= ~counter~0 5)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {176373#(<= ~counter~0 5)} is VALID [2022-04-28 06:08:57,041 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {176216#true} {176373#(<= ~counter~0 5)} #98#return; {176373#(<= ~counter~0 5)} is VALID [2022-04-28 06:08:57,041 INFO L290 TraceCheckUtils]: 38: Hoare triple {176216#true} assume true; {176216#true} is VALID [2022-04-28 06:08:57,041 INFO L290 TraceCheckUtils]: 37: Hoare triple {176216#true} assume !(0 == ~cond); {176216#true} is VALID [2022-04-28 06:08:57,041 INFO L290 TraceCheckUtils]: 36: Hoare triple {176216#true} ~cond := #in~cond; {176216#true} is VALID [2022-04-28 06:08:57,041 INFO L272 TraceCheckUtils]: 35: Hoare triple {176373#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176216#true} is VALID [2022-04-28 06:08:57,042 INFO L290 TraceCheckUtils]: 34: Hoare triple {176373#(<= ~counter~0 5)} assume !!(#t~post8 < 20);havoc #t~post8; {176373#(<= ~counter~0 5)} is VALID [2022-04-28 06:08:57,043 INFO L290 TraceCheckUtils]: 33: Hoare triple {176348#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {176373#(<= ~counter~0 5)} is VALID [2022-04-28 06:08:57,043 INFO L290 TraceCheckUtils]: 32: Hoare triple {176348#(<= ~counter~0 4)} assume !(~r~0 > 0); {176348#(<= ~counter~0 4)} is VALID [2022-04-28 06:08:57,044 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {176216#true} {176348#(<= ~counter~0 4)} #96#return; {176348#(<= ~counter~0 4)} is VALID [2022-04-28 06:08:57,044 INFO L290 TraceCheckUtils]: 30: Hoare triple {176216#true} assume true; {176216#true} is VALID [2022-04-28 06:08:57,044 INFO L290 TraceCheckUtils]: 29: Hoare triple {176216#true} assume !(0 == ~cond); {176216#true} is VALID [2022-04-28 06:08:57,044 INFO L290 TraceCheckUtils]: 28: Hoare triple {176216#true} ~cond := #in~cond; {176216#true} is VALID [2022-04-28 06:08:57,044 INFO L272 TraceCheckUtils]: 27: Hoare triple {176348#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176216#true} is VALID [2022-04-28 06:08:57,044 INFO L290 TraceCheckUtils]: 26: Hoare triple {176348#(<= ~counter~0 4)} assume !!(#t~post7 < 20);havoc #t~post7; {176348#(<= ~counter~0 4)} is VALID [2022-04-28 06:08:57,046 INFO L290 TraceCheckUtils]: 25: Hoare triple {176323#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {176348#(<= ~counter~0 4)} is VALID [2022-04-28 06:08:57,046 INFO L290 TraceCheckUtils]: 24: Hoare triple {176323#(<= ~counter~0 3)} assume !!(0 != ~r~0); {176323#(<= ~counter~0 3)} is VALID [2022-04-28 06:08:57,046 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {176216#true} {176323#(<= ~counter~0 3)} #94#return; {176323#(<= ~counter~0 3)} is VALID [2022-04-28 06:08:57,047 INFO L290 TraceCheckUtils]: 22: Hoare triple {176216#true} assume true; {176216#true} is VALID [2022-04-28 06:08:57,047 INFO L290 TraceCheckUtils]: 21: Hoare triple {176216#true} assume !(0 == ~cond); {176216#true} is VALID [2022-04-28 06:08:57,047 INFO L290 TraceCheckUtils]: 20: Hoare triple {176216#true} ~cond := #in~cond; {176216#true} is VALID [2022-04-28 06:08:57,047 INFO L272 TraceCheckUtils]: 19: Hoare triple {176323#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176216#true} is VALID [2022-04-28 06:08:57,047 INFO L290 TraceCheckUtils]: 18: Hoare triple {176323#(<= ~counter~0 3)} assume !!(#t~post6 < 20);havoc #t~post6; {176323#(<= ~counter~0 3)} is VALID [2022-04-28 06:08:57,048 INFO L290 TraceCheckUtils]: 17: Hoare triple {176298#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {176323#(<= ~counter~0 3)} is VALID [2022-04-28 06:08:57,048 INFO L290 TraceCheckUtils]: 16: Hoare triple {176298#(<= ~counter~0 2)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {176298#(<= ~counter~0 2)} is VALID [2022-04-28 06:08:57,049 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {176216#true} {176298#(<= ~counter~0 2)} #92#return; {176298#(<= ~counter~0 2)} is VALID [2022-04-28 06:08:57,049 INFO L290 TraceCheckUtils]: 14: Hoare triple {176216#true} assume true; {176216#true} is VALID [2022-04-28 06:08:57,049 INFO L290 TraceCheckUtils]: 13: Hoare triple {176216#true} assume !(0 == ~cond); {176216#true} is VALID [2022-04-28 06:08:57,049 INFO L290 TraceCheckUtils]: 12: Hoare triple {176216#true} ~cond := #in~cond; {176216#true} is VALID [2022-04-28 06:08:57,049 INFO L272 TraceCheckUtils]: 11: Hoare triple {176298#(<= ~counter~0 2)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {176216#true} is VALID [2022-04-28 06:08:57,049 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {176216#true} {176298#(<= ~counter~0 2)} #90#return; {176298#(<= ~counter~0 2)} is VALID [2022-04-28 06:08:57,050 INFO L290 TraceCheckUtils]: 9: Hoare triple {176216#true} assume true; {176216#true} is VALID [2022-04-28 06:08:57,050 INFO L290 TraceCheckUtils]: 8: Hoare triple {176216#true} assume !(0 == ~cond); {176216#true} is VALID [2022-04-28 06:08:57,050 INFO L290 TraceCheckUtils]: 7: Hoare triple {176216#true} ~cond := #in~cond; {176216#true} is VALID [2022-04-28 06:08:57,050 INFO L272 TraceCheckUtils]: 6: Hoare triple {176298#(<= ~counter~0 2)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {176216#true} is VALID [2022-04-28 06:08:57,050 INFO L290 TraceCheckUtils]: 5: Hoare triple {176298#(<= ~counter~0 2)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {176298#(<= ~counter~0 2)} is VALID [2022-04-28 06:08:57,050 INFO L272 TraceCheckUtils]: 4: Hoare triple {176298#(<= ~counter~0 2)} call #t~ret9 := main(); {176298#(<= ~counter~0 2)} is VALID [2022-04-28 06:08:57,051 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {176298#(<= ~counter~0 2)} {176216#true} #102#return; {176298#(<= ~counter~0 2)} is VALID [2022-04-28 06:08:57,051 INFO L290 TraceCheckUtils]: 2: Hoare triple {176298#(<= ~counter~0 2)} assume true; {176298#(<= ~counter~0 2)} is VALID [2022-04-28 06:08:57,051 INFO L290 TraceCheckUtils]: 1: Hoare triple {176216#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {176298#(<= ~counter~0 2)} is VALID [2022-04-28 06:08:57,051 INFO L272 TraceCheckUtils]: 0: Hoare triple {176216#true} call ULTIMATE.init(); {176216#true} is VALID [2022-04-28 06:08:57,052 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 54 proven. 182 refuted. 0 times theorem prover too weak. 548 trivial. 0 not checked. [2022-04-28 06:08:57,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:08:57,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427859388] [2022-04-28 06:08:57,052 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:08:57,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2093889260] [2022-04-28 06:08:57,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2093889260] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 06:08:57,052 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 06:08:57,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 24 [2022-04-28 06:08:57,053 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:08:57,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1385486604] [2022-04-28 06:08:57,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1385486604] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:08:57,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:08:57,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-28 06:08:57,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063512424] [2022-04-28 06:08:57,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:08:57,054 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 5.619047619047619) internal successors, (118), 20 states have internal predecessors, (118), 20 states have call successors, (22), 20 states have call predecessors, (22), 18 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) Word has length 163 [2022-04-28 06:08:57,054 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:08:57,054 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 5.619047619047619) internal successors, (118), 20 states have internal predecessors, (118), 20 states have call successors, (22), 20 states have call predecessors, (22), 18 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) [2022-04-28 06:08:57,287 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 160 edges. 160 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:08:57,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-28 06:08:57,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:08:57,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-28 06:08:57,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-28 06:08:57,288 INFO L87 Difference]: Start difference. First operand 890 states and 1187 transitions. Second operand has 21 states, 21 states have (on average 5.619047619047619) internal successors, (118), 20 states have internal predecessors, (118), 20 states have call successors, (22), 20 states have call predecessors, (22), 18 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) [2022-04-28 06:09:04,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:09:04,367 INFO L93 Difference]: Finished difference Result 1077 states and 1465 transitions. [2022-04-28 06:09:04,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-04-28 06:09:04,367 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 5.619047619047619) internal successors, (118), 20 states have internal predecessors, (118), 20 states have call successors, (22), 20 states have call predecessors, (22), 18 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) Word has length 163 [2022-04-28 06:09:04,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:09:04,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 5.619047619047619) internal successors, (118), 20 states have internal predecessors, (118), 20 states have call successors, (22), 20 states have call predecessors, (22), 18 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) [2022-04-28 06:09:04,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 376 transitions. [2022-04-28 06:09:04,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 5.619047619047619) internal successors, (118), 20 states have internal predecessors, (118), 20 states have call successors, (22), 20 states have call predecessors, (22), 18 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) [2022-04-28 06:09:04,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 376 transitions. [2022-04-28 06:09:04,385 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 376 transitions. [2022-04-28 06:09:04,976 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 376 edges. 376 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:09:05,024 INFO L225 Difference]: With dead ends: 1077 [2022-04-28 06:09:05,024 INFO L226 Difference]: Without dead ends: 907 [2022-04-28 06:09:05,025 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 302 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=588, Invalid=972, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 06:09:05,029 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 284 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 278 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 278 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-28 06:09:05,029 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 380 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [278 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-28 06:09:05,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2022-04-28 06:09:09,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 907. [2022-04-28 06:09:09,094 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:09:09,095 INFO L82 GeneralOperation]: Start isEquivalent. First operand 907 states. Second operand has 907 states, 683 states have (on average 1.1742313323572475) internal successors, (802), 690 states have internal predecessors, (802), 202 states have call successors, (202), 23 states have call predecessors, (202), 21 states have return successors, (200), 193 states have call predecessors, (200), 200 states have call successors, (200) [2022-04-28 06:09:09,096 INFO L74 IsIncluded]: Start isIncluded. First operand 907 states. Second operand has 907 states, 683 states have (on average 1.1742313323572475) internal successors, (802), 690 states have internal predecessors, (802), 202 states have call successors, (202), 23 states have call predecessors, (202), 21 states have return successors, (200), 193 states have call predecessors, (200), 200 states have call successors, (200) [2022-04-28 06:09:09,096 INFO L87 Difference]: Start difference. First operand 907 states. Second operand has 907 states, 683 states have (on average 1.1742313323572475) internal successors, (802), 690 states have internal predecessors, (802), 202 states have call successors, (202), 23 states have call predecessors, (202), 21 states have return successors, (200), 193 states have call predecessors, (200), 200 states have call successors, (200) [2022-04-28 06:09:09,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:09:09,122 INFO L93 Difference]: Finished difference Result 907 states and 1204 transitions. [2022-04-28 06:09:09,122 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1204 transitions. [2022-04-28 06:09:09,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:09:09,123 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:09:09,123 INFO L74 IsIncluded]: Start isIncluded. First operand has 907 states, 683 states have (on average 1.1742313323572475) internal successors, (802), 690 states have internal predecessors, (802), 202 states have call successors, (202), 23 states have call predecessors, (202), 21 states have return successors, (200), 193 states have call predecessors, (200), 200 states have call successors, (200) Second operand 907 states. [2022-04-28 06:09:09,124 INFO L87 Difference]: Start difference. First operand has 907 states, 683 states have (on average 1.1742313323572475) internal successors, (802), 690 states have internal predecessors, (802), 202 states have call successors, (202), 23 states have call predecessors, (202), 21 states have return successors, (200), 193 states have call predecessors, (200), 200 states have call successors, (200) Second operand 907 states. [2022-04-28 06:09:09,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:09:09,149 INFO L93 Difference]: Finished difference Result 907 states and 1204 transitions. [2022-04-28 06:09:09,149 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1204 transitions. [2022-04-28 06:09:09,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:09:09,150 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:09:09,150 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:09:09,150 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:09:09,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 907 states, 683 states have (on average 1.1742313323572475) internal successors, (802), 690 states have internal predecessors, (802), 202 states have call successors, (202), 23 states have call predecessors, (202), 21 states have return successors, (200), 193 states have call predecessors, (200), 200 states have call successors, (200) [2022-04-28 06:09:09,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 1204 transitions. [2022-04-28 06:09:09,189 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 1204 transitions. Word has length 163 [2022-04-28 06:09:09,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:09:09,189 INFO L495 AbstractCegarLoop]: Abstraction has 907 states and 1204 transitions. [2022-04-28 06:09:09,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 5.619047619047619) internal successors, (118), 20 states have internal predecessors, (118), 20 states have call successors, (22), 20 states have call predecessors, (22), 18 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) [2022-04-28 06:09:09,189 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 907 states and 1204 transitions. [2022-04-28 06:09:23,654 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1204 edges. 1201 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-28 06:09:23,654 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1204 transitions. [2022-04-28 06:09:23,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2022-04-28 06:09:23,655 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:09:23,655 INFO L195 NwaCegarLoop]: trace histogram [19, 18, 18, 9, 9, 9, 9, 6, 6, 6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:09:23,671 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Ended with exit code 0 [2022-04-28 06:09:23,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 58 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable56 [2022-04-28 06:09:23,856 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:09:23,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:09:23,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1797417137, now seen corresponding path program 19 times [2022-04-28 06:09:23,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:09:23,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1853839990] [2022-04-28 06:09:23,857 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 06:09:23,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1797417137, now seen corresponding path program 20 times [2022-04-28 06:09:23,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:09:23,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397001529] [2022-04-28 06:09:23,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:09:23,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:09:23,871 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:09:23,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [707961779] [2022-04-28 06:09:23,871 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 06:09:23,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:09:23,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:09:23,872 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:09:23,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Waiting until timeout for monitored process [2022-04-28 06:09:23,961 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 06:09:23,961 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:09:23,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-28 06:09:23,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:09:23,998 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:09:24,927 INFO L272 TraceCheckUtils]: 0: Hoare triple {183031#true} call ULTIMATE.init(); {183031#true} is VALID [2022-04-28 06:09:24,928 INFO L290 TraceCheckUtils]: 1: Hoare triple {183031#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {183039#(<= ~counter~0 0)} is VALID [2022-04-28 06:09:24,928 INFO L290 TraceCheckUtils]: 2: Hoare triple {183039#(<= ~counter~0 0)} assume true; {183039#(<= ~counter~0 0)} is VALID [2022-04-28 06:09:24,928 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {183039#(<= ~counter~0 0)} {183031#true} #102#return; {183039#(<= ~counter~0 0)} is VALID [2022-04-28 06:09:24,929 INFO L272 TraceCheckUtils]: 4: Hoare triple {183039#(<= ~counter~0 0)} call #t~ret9 := main(); {183039#(<= ~counter~0 0)} is VALID [2022-04-28 06:09:24,929 INFO L290 TraceCheckUtils]: 5: Hoare triple {183039#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {183039#(<= ~counter~0 0)} is VALID [2022-04-28 06:09:24,929 INFO L272 TraceCheckUtils]: 6: Hoare triple {183039#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {183039#(<= ~counter~0 0)} is VALID [2022-04-28 06:09:24,930 INFO L290 TraceCheckUtils]: 7: Hoare triple {183039#(<= ~counter~0 0)} ~cond := #in~cond; {183039#(<= ~counter~0 0)} is VALID [2022-04-28 06:09:24,930 INFO L290 TraceCheckUtils]: 8: Hoare triple {183039#(<= ~counter~0 0)} assume !(0 == ~cond); {183039#(<= ~counter~0 0)} is VALID [2022-04-28 06:09:24,930 INFO L290 TraceCheckUtils]: 9: Hoare triple {183039#(<= ~counter~0 0)} assume true; {183039#(<= ~counter~0 0)} is VALID [2022-04-28 06:09:24,930 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {183039#(<= ~counter~0 0)} {183039#(<= ~counter~0 0)} #90#return; {183039#(<= ~counter~0 0)} is VALID [2022-04-28 06:09:24,931 INFO L272 TraceCheckUtils]: 11: Hoare triple {183039#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {183039#(<= ~counter~0 0)} is VALID [2022-04-28 06:09:24,931 INFO L290 TraceCheckUtils]: 12: Hoare triple {183039#(<= ~counter~0 0)} ~cond := #in~cond; {183039#(<= ~counter~0 0)} is VALID [2022-04-28 06:09:24,931 INFO L290 TraceCheckUtils]: 13: Hoare triple {183039#(<= ~counter~0 0)} assume !(0 == ~cond); {183039#(<= ~counter~0 0)} is VALID [2022-04-28 06:09:24,932 INFO L290 TraceCheckUtils]: 14: Hoare triple {183039#(<= ~counter~0 0)} assume true; {183039#(<= ~counter~0 0)} is VALID [2022-04-28 06:09:24,932 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {183039#(<= ~counter~0 0)} {183039#(<= ~counter~0 0)} #92#return; {183039#(<= ~counter~0 0)} is VALID [2022-04-28 06:09:24,932 INFO L290 TraceCheckUtils]: 16: Hoare triple {183039#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {183039#(<= ~counter~0 0)} is VALID [2022-04-28 06:09:24,936 INFO L290 TraceCheckUtils]: 17: Hoare triple {183039#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {183088#(<= ~counter~0 1)} is VALID [2022-04-28 06:09:24,936 INFO L290 TraceCheckUtils]: 18: Hoare triple {183088#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {183088#(<= ~counter~0 1)} is VALID [2022-04-28 06:09:24,937 INFO L272 TraceCheckUtils]: 19: Hoare triple {183088#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183088#(<= ~counter~0 1)} is VALID [2022-04-28 06:09:24,937 INFO L290 TraceCheckUtils]: 20: Hoare triple {183088#(<= ~counter~0 1)} ~cond := #in~cond; {183088#(<= ~counter~0 1)} is VALID [2022-04-28 06:09:24,937 INFO L290 TraceCheckUtils]: 21: Hoare triple {183088#(<= ~counter~0 1)} assume !(0 == ~cond); {183088#(<= ~counter~0 1)} is VALID [2022-04-28 06:09:24,937 INFO L290 TraceCheckUtils]: 22: Hoare triple {183088#(<= ~counter~0 1)} assume true; {183088#(<= ~counter~0 1)} is VALID [2022-04-28 06:09:24,938 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {183088#(<= ~counter~0 1)} {183088#(<= ~counter~0 1)} #94#return; {183088#(<= ~counter~0 1)} is VALID [2022-04-28 06:09:24,938 INFO L290 TraceCheckUtils]: 24: Hoare triple {183088#(<= ~counter~0 1)} assume !!(0 != ~r~0); {183088#(<= ~counter~0 1)} is VALID [2022-04-28 06:09:24,940 INFO L290 TraceCheckUtils]: 25: Hoare triple {183088#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {183113#(<= ~counter~0 2)} is VALID [2022-04-28 06:09:24,940 INFO L290 TraceCheckUtils]: 26: Hoare triple {183113#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {183113#(<= ~counter~0 2)} is VALID [2022-04-28 06:09:24,940 INFO L272 TraceCheckUtils]: 27: Hoare triple {183113#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183113#(<= ~counter~0 2)} is VALID [2022-04-28 06:09:24,941 INFO L290 TraceCheckUtils]: 28: Hoare triple {183113#(<= ~counter~0 2)} ~cond := #in~cond; {183113#(<= ~counter~0 2)} is VALID [2022-04-28 06:09:24,941 INFO L290 TraceCheckUtils]: 29: Hoare triple {183113#(<= ~counter~0 2)} assume !(0 == ~cond); {183113#(<= ~counter~0 2)} is VALID [2022-04-28 06:09:24,941 INFO L290 TraceCheckUtils]: 30: Hoare triple {183113#(<= ~counter~0 2)} assume true; {183113#(<= ~counter~0 2)} is VALID [2022-04-28 06:09:24,942 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {183113#(<= ~counter~0 2)} {183113#(<= ~counter~0 2)} #96#return; {183113#(<= ~counter~0 2)} is VALID [2022-04-28 06:09:24,942 INFO L290 TraceCheckUtils]: 32: Hoare triple {183113#(<= ~counter~0 2)} assume !(~r~0 > 0); {183113#(<= ~counter~0 2)} is VALID [2022-04-28 06:09:24,943 INFO L290 TraceCheckUtils]: 33: Hoare triple {183113#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {183138#(<= ~counter~0 3)} is VALID [2022-04-28 06:09:24,943 INFO L290 TraceCheckUtils]: 34: Hoare triple {183138#(<= ~counter~0 3)} assume !!(#t~post8 < 20);havoc #t~post8; {183138#(<= ~counter~0 3)} is VALID [2022-04-28 06:09:24,944 INFO L272 TraceCheckUtils]: 35: Hoare triple {183138#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183138#(<= ~counter~0 3)} is VALID [2022-04-28 06:09:24,944 INFO L290 TraceCheckUtils]: 36: Hoare triple {183138#(<= ~counter~0 3)} ~cond := #in~cond; {183138#(<= ~counter~0 3)} is VALID [2022-04-28 06:09:24,944 INFO L290 TraceCheckUtils]: 37: Hoare triple {183138#(<= ~counter~0 3)} assume !(0 == ~cond); {183138#(<= ~counter~0 3)} is VALID [2022-04-28 06:09:24,945 INFO L290 TraceCheckUtils]: 38: Hoare triple {183138#(<= ~counter~0 3)} assume true; {183138#(<= ~counter~0 3)} is VALID [2022-04-28 06:09:24,945 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {183138#(<= ~counter~0 3)} {183138#(<= ~counter~0 3)} #98#return; {183138#(<= ~counter~0 3)} is VALID [2022-04-28 06:09:24,945 INFO L290 TraceCheckUtils]: 40: Hoare triple {183138#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {183138#(<= ~counter~0 3)} is VALID [2022-04-28 06:09:24,947 INFO L290 TraceCheckUtils]: 41: Hoare triple {183138#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {183163#(<= ~counter~0 4)} is VALID [2022-04-28 06:09:24,947 INFO L290 TraceCheckUtils]: 42: Hoare triple {183163#(<= ~counter~0 4)} assume !!(#t~post8 < 20);havoc #t~post8; {183163#(<= ~counter~0 4)} is VALID [2022-04-28 06:09:24,948 INFO L272 TraceCheckUtils]: 43: Hoare triple {183163#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183163#(<= ~counter~0 4)} is VALID [2022-04-28 06:09:24,948 INFO L290 TraceCheckUtils]: 44: Hoare triple {183163#(<= ~counter~0 4)} ~cond := #in~cond; {183163#(<= ~counter~0 4)} is VALID [2022-04-28 06:09:24,948 INFO L290 TraceCheckUtils]: 45: Hoare triple {183163#(<= ~counter~0 4)} assume !(0 == ~cond); {183163#(<= ~counter~0 4)} is VALID [2022-04-28 06:09:24,949 INFO L290 TraceCheckUtils]: 46: Hoare triple {183163#(<= ~counter~0 4)} assume true; {183163#(<= ~counter~0 4)} is VALID [2022-04-28 06:09:24,949 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {183163#(<= ~counter~0 4)} {183163#(<= ~counter~0 4)} #98#return; {183163#(<= ~counter~0 4)} is VALID [2022-04-28 06:09:24,949 INFO L290 TraceCheckUtils]: 48: Hoare triple {183163#(<= ~counter~0 4)} assume !(~r~0 < 0); {183163#(<= ~counter~0 4)} is VALID [2022-04-28 06:09:24,951 INFO L290 TraceCheckUtils]: 49: Hoare triple {183163#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {183188#(<= ~counter~0 5)} is VALID [2022-04-28 06:09:24,951 INFO L290 TraceCheckUtils]: 50: Hoare triple {183188#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {183188#(<= ~counter~0 5)} is VALID [2022-04-28 06:09:24,951 INFO L272 TraceCheckUtils]: 51: Hoare triple {183188#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183188#(<= ~counter~0 5)} is VALID [2022-04-28 06:09:24,952 INFO L290 TraceCheckUtils]: 52: Hoare triple {183188#(<= ~counter~0 5)} ~cond := #in~cond; {183188#(<= ~counter~0 5)} is VALID [2022-04-28 06:09:24,952 INFO L290 TraceCheckUtils]: 53: Hoare triple {183188#(<= ~counter~0 5)} assume !(0 == ~cond); {183188#(<= ~counter~0 5)} is VALID [2022-04-28 06:09:24,952 INFO L290 TraceCheckUtils]: 54: Hoare triple {183188#(<= ~counter~0 5)} assume true; {183188#(<= ~counter~0 5)} is VALID [2022-04-28 06:09:24,953 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {183188#(<= ~counter~0 5)} {183188#(<= ~counter~0 5)} #94#return; {183188#(<= ~counter~0 5)} is VALID [2022-04-28 06:09:24,953 INFO L290 TraceCheckUtils]: 56: Hoare triple {183188#(<= ~counter~0 5)} assume !!(0 != ~r~0); {183188#(<= ~counter~0 5)} is VALID [2022-04-28 06:09:24,954 INFO L290 TraceCheckUtils]: 57: Hoare triple {183188#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {183213#(<= ~counter~0 6)} is VALID [2022-04-28 06:09:24,955 INFO L290 TraceCheckUtils]: 58: Hoare triple {183213#(<= ~counter~0 6)} assume !!(#t~post7 < 20);havoc #t~post7; {183213#(<= ~counter~0 6)} is VALID [2022-04-28 06:09:24,955 INFO L272 TraceCheckUtils]: 59: Hoare triple {183213#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183213#(<= ~counter~0 6)} is VALID [2022-04-28 06:09:24,955 INFO L290 TraceCheckUtils]: 60: Hoare triple {183213#(<= ~counter~0 6)} ~cond := #in~cond; {183213#(<= ~counter~0 6)} is VALID [2022-04-28 06:09:24,956 INFO L290 TraceCheckUtils]: 61: Hoare triple {183213#(<= ~counter~0 6)} assume !(0 == ~cond); {183213#(<= ~counter~0 6)} is VALID [2022-04-28 06:09:24,956 INFO L290 TraceCheckUtils]: 62: Hoare triple {183213#(<= ~counter~0 6)} assume true; {183213#(<= ~counter~0 6)} is VALID [2022-04-28 06:09:24,956 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {183213#(<= ~counter~0 6)} {183213#(<= ~counter~0 6)} #96#return; {183213#(<= ~counter~0 6)} is VALID [2022-04-28 06:09:24,957 INFO L290 TraceCheckUtils]: 64: Hoare triple {183213#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {183213#(<= ~counter~0 6)} is VALID [2022-04-28 06:09:24,958 INFO L290 TraceCheckUtils]: 65: Hoare triple {183213#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {183238#(<= ~counter~0 7)} is VALID [2022-04-28 06:09:24,958 INFO L290 TraceCheckUtils]: 66: Hoare triple {183238#(<= ~counter~0 7)} assume !!(#t~post7 < 20);havoc #t~post7; {183238#(<= ~counter~0 7)} is VALID [2022-04-28 06:09:24,959 INFO L272 TraceCheckUtils]: 67: Hoare triple {183238#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183238#(<= ~counter~0 7)} is VALID [2022-04-28 06:09:24,959 INFO L290 TraceCheckUtils]: 68: Hoare triple {183238#(<= ~counter~0 7)} ~cond := #in~cond; {183238#(<= ~counter~0 7)} is VALID [2022-04-28 06:09:24,959 INFO L290 TraceCheckUtils]: 69: Hoare triple {183238#(<= ~counter~0 7)} assume !(0 == ~cond); {183238#(<= ~counter~0 7)} is VALID [2022-04-28 06:09:24,959 INFO L290 TraceCheckUtils]: 70: Hoare triple {183238#(<= ~counter~0 7)} assume true; {183238#(<= ~counter~0 7)} is VALID [2022-04-28 06:09:24,960 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {183238#(<= ~counter~0 7)} {183238#(<= ~counter~0 7)} #96#return; {183238#(<= ~counter~0 7)} is VALID [2022-04-28 06:09:24,960 INFO L290 TraceCheckUtils]: 72: Hoare triple {183238#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {183238#(<= ~counter~0 7)} is VALID [2022-04-28 06:09:24,962 INFO L290 TraceCheckUtils]: 73: Hoare triple {183238#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {183263#(<= ~counter~0 8)} is VALID [2022-04-28 06:09:24,962 INFO L290 TraceCheckUtils]: 74: Hoare triple {183263#(<= ~counter~0 8)} assume !!(#t~post7 < 20);havoc #t~post7; {183263#(<= ~counter~0 8)} is VALID [2022-04-28 06:09:24,962 INFO L272 TraceCheckUtils]: 75: Hoare triple {183263#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183263#(<= ~counter~0 8)} is VALID [2022-04-28 06:09:24,963 INFO L290 TraceCheckUtils]: 76: Hoare triple {183263#(<= ~counter~0 8)} ~cond := #in~cond; {183263#(<= ~counter~0 8)} is VALID [2022-04-28 06:09:24,963 INFO L290 TraceCheckUtils]: 77: Hoare triple {183263#(<= ~counter~0 8)} assume !(0 == ~cond); {183263#(<= ~counter~0 8)} is VALID [2022-04-28 06:09:24,963 INFO L290 TraceCheckUtils]: 78: Hoare triple {183263#(<= ~counter~0 8)} assume true; {183263#(<= ~counter~0 8)} is VALID [2022-04-28 06:09:24,964 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {183263#(<= ~counter~0 8)} {183263#(<= ~counter~0 8)} #96#return; {183263#(<= ~counter~0 8)} is VALID [2022-04-28 06:09:24,964 INFO L290 TraceCheckUtils]: 80: Hoare triple {183263#(<= ~counter~0 8)} assume !(~r~0 > 0); {183263#(<= ~counter~0 8)} is VALID [2022-04-28 06:09:24,965 INFO L290 TraceCheckUtils]: 81: Hoare triple {183263#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {183288#(<= ~counter~0 9)} is VALID [2022-04-28 06:09:24,966 INFO L290 TraceCheckUtils]: 82: Hoare triple {183288#(<= ~counter~0 9)} assume !!(#t~post8 < 20);havoc #t~post8; {183288#(<= ~counter~0 9)} is VALID [2022-04-28 06:09:24,966 INFO L272 TraceCheckUtils]: 83: Hoare triple {183288#(<= ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183288#(<= ~counter~0 9)} is VALID [2022-04-28 06:09:24,966 INFO L290 TraceCheckUtils]: 84: Hoare triple {183288#(<= ~counter~0 9)} ~cond := #in~cond; {183288#(<= ~counter~0 9)} is VALID [2022-04-28 06:09:24,966 INFO L290 TraceCheckUtils]: 85: Hoare triple {183288#(<= ~counter~0 9)} assume !(0 == ~cond); {183288#(<= ~counter~0 9)} is VALID [2022-04-28 06:09:24,967 INFO L290 TraceCheckUtils]: 86: Hoare triple {183288#(<= ~counter~0 9)} assume true; {183288#(<= ~counter~0 9)} is VALID [2022-04-28 06:09:24,967 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {183288#(<= ~counter~0 9)} {183288#(<= ~counter~0 9)} #98#return; {183288#(<= ~counter~0 9)} is VALID [2022-04-28 06:09:24,967 INFO L290 TraceCheckUtils]: 88: Hoare triple {183288#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {183288#(<= ~counter~0 9)} is VALID [2022-04-28 06:09:24,969 INFO L290 TraceCheckUtils]: 89: Hoare triple {183288#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {183313#(<= ~counter~0 10)} is VALID [2022-04-28 06:09:24,969 INFO L290 TraceCheckUtils]: 90: Hoare triple {183313#(<= ~counter~0 10)} assume !!(#t~post8 < 20);havoc #t~post8; {183313#(<= ~counter~0 10)} is VALID [2022-04-28 06:09:24,970 INFO L272 TraceCheckUtils]: 91: Hoare triple {183313#(<= ~counter~0 10)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183313#(<= ~counter~0 10)} is VALID [2022-04-28 06:09:24,970 INFO L290 TraceCheckUtils]: 92: Hoare triple {183313#(<= ~counter~0 10)} ~cond := #in~cond; {183313#(<= ~counter~0 10)} is VALID [2022-04-28 06:09:24,970 INFO L290 TraceCheckUtils]: 93: Hoare triple {183313#(<= ~counter~0 10)} assume !(0 == ~cond); {183313#(<= ~counter~0 10)} is VALID [2022-04-28 06:09:24,970 INFO L290 TraceCheckUtils]: 94: Hoare triple {183313#(<= ~counter~0 10)} assume true; {183313#(<= ~counter~0 10)} is VALID [2022-04-28 06:09:24,971 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {183313#(<= ~counter~0 10)} {183313#(<= ~counter~0 10)} #98#return; {183313#(<= ~counter~0 10)} is VALID [2022-04-28 06:09:24,971 INFO L290 TraceCheckUtils]: 96: Hoare triple {183313#(<= ~counter~0 10)} assume !(~r~0 < 0); {183313#(<= ~counter~0 10)} is VALID [2022-04-28 06:09:24,972 INFO L290 TraceCheckUtils]: 97: Hoare triple {183313#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {183338#(<= ~counter~0 11)} is VALID [2022-04-28 06:09:24,973 INFO L290 TraceCheckUtils]: 98: Hoare triple {183338#(<= ~counter~0 11)} assume !!(#t~post6 < 20);havoc #t~post6; {183338#(<= ~counter~0 11)} is VALID [2022-04-28 06:09:24,973 INFO L272 TraceCheckUtils]: 99: Hoare triple {183338#(<= ~counter~0 11)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183338#(<= ~counter~0 11)} is VALID [2022-04-28 06:09:24,973 INFO L290 TraceCheckUtils]: 100: Hoare triple {183338#(<= ~counter~0 11)} ~cond := #in~cond; {183338#(<= ~counter~0 11)} is VALID [2022-04-28 06:09:24,974 INFO L290 TraceCheckUtils]: 101: Hoare triple {183338#(<= ~counter~0 11)} assume !(0 == ~cond); {183338#(<= ~counter~0 11)} is VALID [2022-04-28 06:09:24,974 INFO L290 TraceCheckUtils]: 102: Hoare triple {183338#(<= ~counter~0 11)} assume true; {183338#(<= ~counter~0 11)} is VALID [2022-04-28 06:09:24,974 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {183338#(<= ~counter~0 11)} {183338#(<= ~counter~0 11)} #94#return; {183338#(<= ~counter~0 11)} is VALID [2022-04-28 06:09:24,975 INFO L290 TraceCheckUtils]: 104: Hoare triple {183338#(<= ~counter~0 11)} assume !!(0 != ~r~0); {183338#(<= ~counter~0 11)} is VALID [2022-04-28 06:09:24,976 INFO L290 TraceCheckUtils]: 105: Hoare triple {183338#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {183363#(<= ~counter~0 12)} is VALID [2022-04-28 06:09:24,976 INFO L290 TraceCheckUtils]: 106: Hoare triple {183363#(<= ~counter~0 12)} assume !!(#t~post7 < 20);havoc #t~post7; {183363#(<= ~counter~0 12)} is VALID [2022-04-28 06:09:24,977 INFO L272 TraceCheckUtils]: 107: Hoare triple {183363#(<= ~counter~0 12)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183363#(<= ~counter~0 12)} is VALID [2022-04-28 06:09:24,977 INFO L290 TraceCheckUtils]: 108: Hoare triple {183363#(<= ~counter~0 12)} ~cond := #in~cond; {183363#(<= ~counter~0 12)} is VALID [2022-04-28 06:09:24,977 INFO L290 TraceCheckUtils]: 109: Hoare triple {183363#(<= ~counter~0 12)} assume !(0 == ~cond); {183363#(<= ~counter~0 12)} is VALID [2022-04-28 06:09:24,977 INFO L290 TraceCheckUtils]: 110: Hoare triple {183363#(<= ~counter~0 12)} assume true; {183363#(<= ~counter~0 12)} is VALID [2022-04-28 06:09:24,978 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {183363#(<= ~counter~0 12)} {183363#(<= ~counter~0 12)} #96#return; {183363#(<= ~counter~0 12)} is VALID [2022-04-28 06:09:24,978 INFO L290 TraceCheckUtils]: 112: Hoare triple {183363#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {183363#(<= ~counter~0 12)} is VALID [2022-04-28 06:09:24,980 INFO L290 TraceCheckUtils]: 113: Hoare triple {183363#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {183388#(<= ~counter~0 13)} is VALID [2022-04-28 06:09:24,980 INFO L290 TraceCheckUtils]: 114: Hoare triple {183388#(<= ~counter~0 13)} assume !!(#t~post7 < 20);havoc #t~post7; {183388#(<= ~counter~0 13)} is VALID [2022-04-28 06:09:24,980 INFO L272 TraceCheckUtils]: 115: Hoare triple {183388#(<= ~counter~0 13)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183388#(<= ~counter~0 13)} is VALID [2022-04-28 06:09:24,981 INFO L290 TraceCheckUtils]: 116: Hoare triple {183388#(<= ~counter~0 13)} ~cond := #in~cond; {183388#(<= ~counter~0 13)} is VALID [2022-04-28 06:09:24,981 INFO L290 TraceCheckUtils]: 117: Hoare triple {183388#(<= ~counter~0 13)} assume !(0 == ~cond); {183388#(<= ~counter~0 13)} is VALID [2022-04-28 06:09:24,981 INFO L290 TraceCheckUtils]: 118: Hoare triple {183388#(<= ~counter~0 13)} assume true; {183388#(<= ~counter~0 13)} is VALID [2022-04-28 06:09:24,982 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {183388#(<= ~counter~0 13)} {183388#(<= ~counter~0 13)} #96#return; {183388#(<= ~counter~0 13)} is VALID [2022-04-28 06:09:24,982 INFO L290 TraceCheckUtils]: 120: Hoare triple {183388#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {183388#(<= ~counter~0 13)} is VALID [2022-04-28 06:09:24,983 INFO L290 TraceCheckUtils]: 121: Hoare triple {183388#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {183413#(<= ~counter~0 14)} is VALID [2022-04-28 06:09:24,984 INFO L290 TraceCheckUtils]: 122: Hoare triple {183413#(<= ~counter~0 14)} assume !!(#t~post7 < 20);havoc #t~post7; {183413#(<= ~counter~0 14)} is VALID [2022-04-28 06:09:24,984 INFO L272 TraceCheckUtils]: 123: Hoare triple {183413#(<= ~counter~0 14)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183413#(<= ~counter~0 14)} is VALID [2022-04-28 06:09:24,984 INFO L290 TraceCheckUtils]: 124: Hoare triple {183413#(<= ~counter~0 14)} ~cond := #in~cond; {183413#(<= ~counter~0 14)} is VALID [2022-04-28 06:09:24,985 INFO L290 TraceCheckUtils]: 125: Hoare triple {183413#(<= ~counter~0 14)} assume !(0 == ~cond); {183413#(<= ~counter~0 14)} is VALID [2022-04-28 06:09:24,985 INFO L290 TraceCheckUtils]: 126: Hoare triple {183413#(<= ~counter~0 14)} assume true; {183413#(<= ~counter~0 14)} is VALID [2022-04-28 06:09:24,985 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {183413#(<= ~counter~0 14)} {183413#(<= ~counter~0 14)} #96#return; {183413#(<= ~counter~0 14)} is VALID [2022-04-28 06:09:24,985 INFO L290 TraceCheckUtils]: 128: Hoare triple {183413#(<= ~counter~0 14)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {183413#(<= ~counter~0 14)} is VALID [2022-04-28 06:09:24,987 INFO L290 TraceCheckUtils]: 129: Hoare triple {183413#(<= ~counter~0 14)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {183438#(<= ~counter~0 15)} is VALID [2022-04-28 06:09:24,987 INFO L290 TraceCheckUtils]: 130: Hoare triple {183438#(<= ~counter~0 15)} assume !!(#t~post7 < 20);havoc #t~post7; {183438#(<= ~counter~0 15)} is VALID [2022-04-28 06:09:24,988 INFO L272 TraceCheckUtils]: 131: Hoare triple {183438#(<= ~counter~0 15)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183438#(<= ~counter~0 15)} is VALID [2022-04-28 06:09:24,988 INFO L290 TraceCheckUtils]: 132: Hoare triple {183438#(<= ~counter~0 15)} ~cond := #in~cond; {183438#(<= ~counter~0 15)} is VALID [2022-04-28 06:09:24,988 INFO L290 TraceCheckUtils]: 133: Hoare triple {183438#(<= ~counter~0 15)} assume !(0 == ~cond); {183438#(<= ~counter~0 15)} is VALID [2022-04-28 06:09:24,988 INFO L290 TraceCheckUtils]: 134: Hoare triple {183438#(<= ~counter~0 15)} assume true; {183438#(<= ~counter~0 15)} is VALID [2022-04-28 06:09:24,989 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {183438#(<= ~counter~0 15)} {183438#(<= ~counter~0 15)} #96#return; {183438#(<= ~counter~0 15)} is VALID [2022-04-28 06:09:24,989 INFO L290 TraceCheckUtils]: 136: Hoare triple {183438#(<= ~counter~0 15)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {183438#(<= ~counter~0 15)} is VALID [2022-04-28 06:09:24,990 INFO L290 TraceCheckUtils]: 137: Hoare triple {183438#(<= ~counter~0 15)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {183463#(<= ~counter~0 16)} is VALID [2022-04-28 06:09:24,991 INFO L290 TraceCheckUtils]: 138: Hoare triple {183463#(<= ~counter~0 16)} assume !!(#t~post7 < 20);havoc #t~post7; {183463#(<= ~counter~0 16)} is VALID [2022-04-28 06:09:24,991 INFO L272 TraceCheckUtils]: 139: Hoare triple {183463#(<= ~counter~0 16)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183463#(<= ~counter~0 16)} is VALID [2022-04-28 06:09:24,991 INFO L290 TraceCheckUtils]: 140: Hoare triple {183463#(<= ~counter~0 16)} ~cond := #in~cond; {183463#(<= ~counter~0 16)} is VALID [2022-04-28 06:09:24,992 INFO L290 TraceCheckUtils]: 141: Hoare triple {183463#(<= ~counter~0 16)} assume !(0 == ~cond); {183463#(<= ~counter~0 16)} is VALID [2022-04-28 06:09:24,992 INFO L290 TraceCheckUtils]: 142: Hoare triple {183463#(<= ~counter~0 16)} assume true; {183463#(<= ~counter~0 16)} is VALID [2022-04-28 06:09:24,992 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {183463#(<= ~counter~0 16)} {183463#(<= ~counter~0 16)} #96#return; {183463#(<= ~counter~0 16)} is VALID [2022-04-28 06:09:24,993 INFO L290 TraceCheckUtils]: 144: Hoare triple {183463#(<= ~counter~0 16)} assume !(~r~0 > 0); {183463#(<= ~counter~0 16)} is VALID [2022-04-28 06:09:24,994 INFO L290 TraceCheckUtils]: 145: Hoare triple {183463#(<= ~counter~0 16)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {183488#(<= ~counter~0 17)} is VALID [2022-04-28 06:09:24,995 INFO L290 TraceCheckUtils]: 146: Hoare triple {183488#(<= ~counter~0 17)} assume !!(#t~post8 < 20);havoc #t~post8; {183488#(<= ~counter~0 17)} is VALID [2022-04-28 06:09:24,995 INFO L272 TraceCheckUtils]: 147: Hoare triple {183488#(<= ~counter~0 17)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183488#(<= ~counter~0 17)} is VALID [2022-04-28 06:09:24,995 INFO L290 TraceCheckUtils]: 148: Hoare triple {183488#(<= ~counter~0 17)} ~cond := #in~cond; {183488#(<= ~counter~0 17)} is VALID [2022-04-28 06:09:24,996 INFO L290 TraceCheckUtils]: 149: Hoare triple {183488#(<= ~counter~0 17)} assume !(0 == ~cond); {183488#(<= ~counter~0 17)} is VALID [2022-04-28 06:09:24,996 INFO L290 TraceCheckUtils]: 150: Hoare triple {183488#(<= ~counter~0 17)} assume true; {183488#(<= ~counter~0 17)} is VALID [2022-04-28 06:09:24,996 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {183488#(<= ~counter~0 17)} {183488#(<= ~counter~0 17)} #98#return; {183488#(<= ~counter~0 17)} is VALID [2022-04-28 06:09:24,997 INFO L290 TraceCheckUtils]: 152: Hoare triple {183488#(<= ~counter~0 17)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {183488#(<= ~counter~0 17)} is VALID [2022-04-28 06:09:24,998 INFO L290 TraceCheckUtils]: 153: Hoare triple {183488#(<= ~counter~0 17)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {183513#(<= ~counter~0 18)} is VALID [2022-04-28 06:09:24,998 INFO L290 TraceCheckUtils]: 154: Hoare triple {183513#(<= ~counter~0 18)} assume !!(#t~post8 < 20);havoc #t~post8; {183513#(<= ~counter~0 18)} is VALID [2022-04-28 06:09:24,999 INFO L272 TraceCheckUtils]: 155: Hoare triple {183513#(<= ~counter~0 18)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183513#(<= ~counter~0 18)} is VALID [2022-04-28 06:09:24,999 INFO L290 TraceCheckUtils]: 156: Hoare triple {183513#(<= ~counter~0 18)} ~cond := #in~cond; {183513#(<= ~counter~0 18)} is VALID [2022-04-28 06:09:24,999 INFO L290 TraceCheckUtils]: 157: Hoare triple {183513#(<= ~counter~0 18)} assume !(0 == ~cond); {183513#(<= ~counter~0 18)} is VALID [2022-04-28 06:09:24,999 INFO L290 TraceCheckUtils]: 158: Hoare triple {183513#(<= ~counter~0 18)} assume true; {183513#(<= ~counter~0 18)} is VALID [2022-04-28 06:09:25,000 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {183513#(<= ~counter~0 18)} {183513#(<= ~counter~0 18)} #98#return; {183513#(<= ~counter~0 18)} is VALID [2022-04-28 06:09:25,000 INFO L290 TraceCheckUtils]: 160: Hoare triple {183513#(<= ~counter~0 18)} assume !(~r~0 < 0); {183513#(<= ~counter~0 18)} is VALID [2022-04-28 06:09:25,001 INFO L290 TraceCheckUtils]: 161: Hoare triple {183513#(<= ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {183538#(<= |main_#t~post6| 18)} is VALID [2022-04-28 06:09:25,001 INFO L290 TraceCheckUtils]: 162: Hoare triple {183538#(<= |main_#t~post6| 18)} assume !(#t~post6 < 20);havoc #t~post6; {183032#false} is VALID [2022-04-28 06:09:25,001 INFO L272 TraceCheckUtils]: 163: Hoare triple {183032#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183032#false} is VALID [2022-04-28 06:09:25,001 INFO L290 TraceCheckUtils]: 164: Hoare triple {183032#false} ~cond := #in~cond; {183032#false} is VALID [2022-04-28 06:09:25,001 INFO L290 TraceCheckUtils]: 165: Hoare triple {183032#false} assume 0 == ~cond; {183032#false} is VALID [2022-04-28 06:09:25,001 INFO L290 TraceCheckUtils]: 166: Hoare triple {183032#false} assume !false; {183032#false} is VALID [2022-04-28 06:09:25,001 INFO L134 CoverageAnalysis]: Checked inductivity of 874 backedges. 36 proven. 834 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 06:09:25,002 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 06:09:25,766 INFO L290 TraceCheckUtils]: 166: Hoare triple {183032#false} assume !false; {183032#false} is VALID [2022-04-28 06:09:25,766 INFO L290 TraceCheckUtils]: 165: Hoare triple {183032#false} assume 0 == ~cond; {183032#false} is VALID [2022-04-28 06:09:25,766 INFO L290 TraceCheckUtils]: 164: Hoare triple {183032#false} ~cond := #in~cond; {183032#false} is VALID [2022-04-28 06:09:25,766 INFO L272 TraceCheckUtils]: 163: Hoare triple {183032#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183032#false} is VALID [2022-04-28 06:09:25,766 INFO L290 TraceCheckUtils]: 162: Hoare triple {183566#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {183032#false} is VALID [2022-04-28 06:09:25,767 INFO L290 TraceCheckUtils]: 161: Hoare triple {183570#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {183566#(< |main_#t~post6| 20)} is VALID [2022-04-28 06:09:25,767 INFO L290 TraceCheckUtils]: 160: Hoare triple {183570#(< ~counter~0 20)} assume !(~r~0 < 0); {183570#(< ~counter~0 20)} is VALID [2022-04-28 06:09:25,767 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {183031#true} {183570#(< ~counter~0 20)} #98#return; {183570#(< ~counter~0 20)} is VALID [2022-04-28 06:09:25,767 INFO L290 TraceCheckUtils]: 158: Hoare triple {183031#true} assume true; {183031#true} is VALID [2022-04-28 06:09:25,767 INFO L290 TraceCheckUtils]: 157: Hoare triple {183031#true} assume !(0 == ~cond); {183031#true} is VALID [2022-04-28 06:09:25,768 INFO L290 TraceCheckUtils]: 156: Hoare triple {183031#true} ~cond := #in~cond; {183031#true} is VALID [2022-04-28 06:09:25,768 INFO L272 TraceCheckUtils]: 155: Hoare triple {183570#(< ~counter~0 20)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183031#true} is VALID [2022-04-28 06:09:25,768 INFO L290 TraceCheckUtils]: 154: Hoare triple {183570#(< ~counter~0 20)} assume !!(#t~post8 < 20);havoc #t~post8; {183570#(< ~counter~0 20)} is VALID [2022-04-28 06:09:25,771 INFO L290 TraceCheckUtils]: 153: Hoare triple {183513#(<= ~counter~0 18)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {183570#(< ~counter~0 20)} is VALID [2022-04-28 06:09:25,772 INFO L290 TraceCheckUtils]: 152: Hoare triple {183513#(<= ~counter~0 18)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {183513#(<= ~counter~0 18)} is VALID [2022-04-28 06:09:25,772 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {183031#true} {183513#(<= ~counter~0 18)} #98#return; {183513#(<= ~counter~0 18)} is VALID [2022-04-28 06:09:25,772 INFO L290 TraceCheckUtils]: 150: Hoare triple {183031#true} assume true; {183031#true} is VALID [2022-04-28 06:09:25,772 INFO L290 TraceCheckUtils]: 149: Hoare triple {183031#true} assume !(0 == ~cond); {183031#true} is VALID [2022-04-28 06:09:25,772 INFO L290 TraceCheckUtils]: 148: Hoare triple {183031#true} ~cond := #in~cond; {183031#true} is VALID [2022-04-28 06:09:25,772 INFO L272 TraceCheckUtils]: 147: Hoare triple {183513#(<= ~counter~0 18)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183031#true} is VALID [2022-04-28 06:09:25,773 INFO L290 TraceCheckUtils]: 146: Hoare triple {183513#(<= ~counter~0 18)} assume !!(#t~post8 < 20);havoc #t~post8; {183513#(<= ~counter~0 18)} is VALID [2022-04-28 06:09:25,774 INFO L290 TraceCheckUtils]: 145: Hoare triple {183488#(<= ~counter~0 17)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {183513#(<= ~counter~0 18)} is VALID [2022-04-28 06:09:25,774 INFO L290 TraceCheckUtils]: 144: Hoare triple {183488#(<= ~counter~0 17)} assume !(~r~0 > 0); {183488#(<= ~counter~0 17)} is VALID [2022-04-28 06:09:25,775 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {183031#true} {183488#(<= ~counter~0 17)} #96#return; {183488#(<= ~counter~0 17)} is VALID [2022-04-28 06:09:25,775 INFO L290 TraceCheckUtils]: 142: Hoare triple {183031#true} assume true; {183031#true} is VALID [2022-04-28 06:09:25,775 INFO L290 TraceCheckUtils]: 141: Hoare triple {183031#true} assume !(0 == ~cond); {183031#true} is VALID [2022-04-28 06:09:25,775 INFO L290 TraceCheckUtils]: 140: Hoare triple {183031#true} ~cond := #in~cond; {183031#true} is VALID [2022-04-28 06:09:25,775 INFO L272 TraceCheckUtils]: 139: Hoare triple {183488#(<= ~counter~0 17)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183031#true} is VALID [2022-04-28 06:09:25,775 INFO L290 TraceCheckUtils]: 138: Hoare triple {183488#(<= ~counter~0 17)} assume !!(#t~post7 < 20);havoc #t~post7; {183488#(<= ~counter~0 17)} is VALID [2022-04-28 06:09:25,777 INFO L290 TraceCheckUtils]: 137: Hoare triple {183463#(<= ~counter~0 16)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {183488#(<= ~counter~0 17)} is VALID [2022-04-28 06:09:25,777 INFO L290 TraceCheckUtils]: 136: Hoare triple {183463#(<= ~counter~0 16)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {183463#(<= ~counter~0 16)} is VALID [2022-04-28 06:09:25,777 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {183031#true} {183463#(<= ~counter~0 16)} #96#return; {183463#(<= ~counter~0 16)} is VALID [2022-04-28 06:09:25,777 INFO L290 TraceCheckUtils]: 134: Hoare triple {183031#true} assume true; {183031#true} is VALID [2022-04-28 06:09:25,778 INFO L290 TraceCheckUtils]: 133: Hoare triple {183031#true} assume !(0 == ~cond); {183031#true} is VALID [2022-04-28 06:09:25,778 INFO L290 TraceCheckUtils]: 132: Hoare triple {183031#true} ~cond := #in~cond; {183031#true} is VALID [2022-04-28 06:09:25,778 INFO L272 TraceCheckUtils]: 131: Hoare triple {183463#(<= ~counter~0 16)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183031#true} is VALID [2022-04-28 06:09:25,778 INFO L290 TraceCheckUtils]: 130: Hoare triple {183463#(<= ~counter~0 16)} assume !!(#t~post7 < 20);havoc #t~post7; {183463#(<= ~counter~0 16)} is VALID [2022-04-28 06:09:25,779 INFO L290 TraceCheckUtils]: 129: Hoare triple {183438#(<= ~counter~0 15)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {183463#(<= ~counter~0 16)} is VALID [2022-04-28 06:09:25,780 INFO L290 TraceCheckUtils]: 128: Hoare triple {183438#(<= ~counter~0 15)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {183438#(<= ~counter~0 15)} is VALID [2022-04-28 06:09:25,780 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {183031#true} {183438#(<= ~counter~0 15)} #96#return; {183438#(<= ~counter~0 15)} is VALID [2022-04-28 06:09:25,780 INFO L290 TraceCheckUtils]: 126: Hoare triple {183031#true} assume true; {183031#true} is VALID [2022-04-28 06:09:25,780 INFO L290 TraceCheckUtils]: 125: Hoare triple {183031#true} assume !(0 == ~cond); {183031#true} is VALID [2022-04-28 06:09:25,780 INFO L290 TraceCheckUtils]: 124: Hoare triple {183031#true} ~cond := #in~cond; {183031#true} is VALID [2022-04-28 06:09:25,780 INFO L272 TraceCheckUtils]: 123: Hoare triple {183438#(<= ~counter~0 15)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183031#true} is VALID [2022-04-28 06:09:25,781 INFO L290 TraceCheckUtils]: 122: Hoare triple {183438#(<= ~counter~0 15)} assume !!(#t~post7 < 20);havoc #t~post7; {183438#(<= ~counter~0 15)} is VALID [2022-04-28 06:09:25,782 INFO L290 TraceCheckUtils]: 121: Hoare triple {183413#(<= ~counter~0 14)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {183438#(<= ~counter~0 15)} is VALID [2022-04-28 06:09:25,782 INFO L290 TraceCheckUtils]: 120: Hoare triple {183413#(<= ~counter~0 14)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {183413#(<= ~counter~0 14)} is VALID [2022-04-28 06:09:25,783 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {183031#true} {183413#(<= ~counter~0 14)} #96#return; {183413#(<= ~counter~0 14)} is VALID [2022-04-28 06:09:25,783 INFO L290 TraceCheckUtils]: 118: Hoare triple {183031#true} assume true; {183031#true} is VALID [2022-04-28 06:09:25,783 INFO L290 TraceCheckUtils]: 117: Hoare triple {183031#true} assume !(0 == ~cond); {183031#true} is VALID [2022-04-28 06:09:25,783 INFO L290 TraceCheckUtils]: 116: Hoare triple {183031#true} ~cond := #in~cond; {183031#true} is VALID [2022-04-28 06:09:25,783 INFO L272 TraceCheckUtils]: 115: Hoare triple {183413#(<= ~counter~0 14)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183031#true} is VALID [2022-04-28 06:09:25,783 INFO L290 TraceCheckUtils]: 114: Hoare triple {183413#(<= ~counter~0 14)} assume !!(#t~post7 < 20);havoc #t~post7; {183413#(<= ~counter~0 14)} is VALID [2022-04-28 06:09:25,785 INFO L290 TraceCheckUtils]: 113: Hoare triple {183388#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {183413#(<= ~counter~0 14)} is VALID [2022-04-28 06:09:25,785 INFO L290 TraceCheckUtils]: 112: Hoare triple {183388#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {183388#(<= ~counter~0 13)} is VALID [2022-04-28 06:09:25,785 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {183031#true} {183388#(<= ~counter~0 13)} #96#return; {183388#(<= ~counter~0 13)} is VALID [2022-04-28 06:09:25,785 INFO L290 TraceCheckUtils]: 110: Hoare triple {183031#true} assume true; {183031#true} is VALID [2022-04-28 06:09:25,786 INFO L290 TraceCheckUtils]: 109: Hoare triple {183031#true} assume !(0 == ~cond); {183031#true} is VALID [2022-04-28 06:09:25,786 INFO L290 TraceCheckUtils]: 108: Hoare triple {183031#true} ~cond := #in~cond; {183031#true} is VALID [2022-04-28 06:09:25,786 INFO L272 TraceCheckUtils]: 107: Hoare triple {183388#(<= ~counter~0 13)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183031#true} is VALID [2022-04-28 06:09:25,786 INFO L290 TraceCheckUtils]: 106: Hoare triple {183388#(<= ~counter~0 13)} assume !!(#t~post7 < 20);havoc #t~post7; {183388#(<= ~counter~0 13)} is VALID [2022-04-28 06:09:25,787 INFO L290 TraceCheckUtils]: 105: Hoare triple {183363#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {183388#(<= ~counter~0 13)} is VALID [2022-04-28 06:09:25,788 INFO L290 TraceCheckUtils]: 104: Hoare triple {183363#(<= ~counter~0 12)} assume !!(0 != ~r~0); {183363#(<= ~counter~0 12)} is VALID [2022-04-28 06:09:25,788 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {183031#true} {183363#(<= ~counter~0 12)} #94#return; {183363#(<= ~counter~0 12)} is VALID [2022-04-28 06:09:25,788 INFO L290 TraceCheckUtils]: 102: Hoare triple {183031#true} assume true; {183031#true} is VALID [2022-04-28 06:09:25,788 INFO L290 TraceCheckUtils]: 101: Hoare triple {183031#true} assume !(0 == ~cond); {183031#true} is VALID [2022-04-28 06:09:25,788 INFO L290 TraceCheckUtils]: 100: Hoare triple {183031#true} ~cond := #in~cond; {183031#true} is VALID [2022-04-28 06:09:25,788 INFO L272 TraceCheckUtils]: 99: Hoare triple {183363#(<= ~counter~0 12)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183031#true} is VALID [2022-04-28 06:09:25,789 INFO L290 TraceCheckUtils]: 98: Hoare triple {183363#(<= ~counter~0 12)} assume !!(#t~post6 < 20);havoc #t~post6; {183363#(<= ~counter~0 12)} is VALID [2022-04-28 06:09:25,790 INFO L290 TraceCheckUtils]: 97: Hoare triple {183338#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {183363#(<= ~counter~0 12)} is VALID [2022-04-28 06:09:25,790 INFO L290 TraceCheckUtils]: 96: Hoare triple {183338#(<= ~counter~0 11)} assume !(~r~0 < 0); {183338#(<= ~counter~0 11)} is VALID [2022-04-28 06:09:25,791 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {183031#true} {183338#(<= ~counter~0 11)} #98#return; {183338#(<= ~counter~0 11)} is VALID [2022-04-28 06:09:25,791 INFO L290 TraceCheckUtils]: 94: Hoare triple {183031#true} assume true; {183031#true} is VALID [2022-04-28 06:09:25,791 INFO L290 TraceCheckUtils]: 93: Hoare triple {183031#true} assume !(0 == ~cond); {183031#true} is VALID [2022-04-28 06:09:25,791 INFO L290 TraceCheckUtils]: 92: Hoare triple {183031#true} ~cond := #in~cond; {183031#true} is VALID [2022-04-28 06:09:25,791 INFO L272 TraceCheckUtils]: 91: Hoare triple {183338#(<= ~counter~0 11)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183031#true} is VALID [2022-04-28 06:09:25,791 INFO L290 TraceCheckUtils]: 90: Hoare triple {183338#(<= ~counter~0 11)} assume !!(#t~post8 < 20);havoc #t~post8; {183338#(<= ~counter~0 11)} is VALID [2022-04-28 06:09:25,793 INFO L290 TraceCheckUtils]: 89: Hoare triple {183313#(<= ~counter~0 10)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {183338#(<= ~counter~0 11)} is VALID [2022-04-28 06:09:25,793 INFO L290 TraceCheckUtils]: 88: Hoare triple {183313#(<= ~counter~0 10)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {183313#(<= ~counter~0 10)} is VALID [2022-04-28 06:09:25,793 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {183031#true} {183313#(<= ~counter~0 10)} #98#return; {183313#(<= ~counter~0 10)} is VALID [2022-04-28 06:09:25,794 INFO L290 TraceCheckUtils]: 86: Hoare triple {183031#true} assume true; {183031#true} is VALID [2022-04-28 06:09:25,794 INFO L290 TraceCheckUtils]: 85: Hoare triple {183031#true} assume !(0 == ~cond); {183031#true} is VALID [2022-04-28 06:09:25,794 INFO L290 TraceCheckUtils]: 84: Hoare triple {183031#true} ~cond := #in~cond; {183031#true} is VALID [2022-04-28 06:09:25,794 INFO L272 TraceCheckUtils]: 83: Hoare triple {183313#(<= ~counter~0 10)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183031#true} is VALID [2022-04-28 06:09:25,794 INFO L290 TraceCheckUtils]: 82: Hoare triple {183313#(<= ~counter~0 10)} assume !!(#t~post8 < 20);havoc #t~post8; {183313#(<= ~counter~0 10)} is VALID [2022-04-28 06:09:25,796 INFO L290 TraceCheckUtils]: 81: Hoare triple {183288#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {183313#(<= ~counter~0 10)} is VALID [2022-04-28 06:09:25,796 INFO L290 TraceCheckUtils]: 80: Hoare triple {183288#(<= ~counter~0 9)} assume !(~r~0 > 0); {183288#(<= ~counter~0 9)} is VALID [2022-04-28 06:09:25,796 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {183031#true} {183288#(<= ~counter~0 9)} #96#return; {183288#(<= ~counter~0 9)} is VALID [2022-04-28 06:09:25,797 INFO L290 TraceCheckUtils]: 78: Hoare triple {183031#true} assume true; {183031#true} is VALID [2022-04-28 06:09:25,797 INFO L290 TraceCheckUtils]: 77: Hoare triple {183031#true} assume !(0 == ~cond); {183031#true} is VALID [2022-04-28 06:09:25,797 INFO L290 TraceCheckUtils]: 76: Hoare triple {183031#true} ~cond := #in~cond; {183031#true} is VALID [2022-04-28 06:09:25,797 INFO L272 TraceCheckUtils]: 75: Hoare triple {183288#(<= ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183031#true} is VALID [2022-04-28 06:09:25,797 INFO L290 TraceCheckUtils]: 74: Hoare triple {183288#(<= ~counter~0 9)} assume !!(#t~post7 < 20);havoc #t~post7; {183288#(<= ~counter~0 9)} is VALID [2022-04-28 06:09:25,799 INFO L290 TraceCheckUtils]: 73: Hoare triple {183263#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {183288#(<= ~counter~0 9)} is VALID [2022-04-28 06:09:25,799 INFO L290 TraceCheckUtils]: 72: Hoare triple {183263#(<= ~counter~0 8)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {183263#(<= ~counter~0 8)} is VALID [2022-04-28 06:09:25,800 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {183031#true} {183263#(<= ~counter~0 8)} #96#return; {183263#(<= ~counter~0 8)} is VALID [2022-04-28 06:09:25,800 INFO L290 TraceCheckUtils]: 70: Hoare triple {183031#true} assume true; {183031#true} is VALID [2022-04-28 06:09:25,800 INFO L290 TraceCheckUtils]: 69: Hoare triple {183031#true} assume !(0 == ~cond); {183031#true} is VALID [2022-04-28 06:09:25,800 INFO L290 TraceCheckUtils]: 68: Hoare triple {183031#true} ~cond := #in~cond; {183031#true} is VALID [2022-04-28 06:09:25,800 INFO L272 TraceCheckUtils]: 67: Hoare triple {183263#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183031#true} is VALID [2022-04-28 06:09:25,800 INFO L290 TraceCheckUtils]: 66: Hoare triple {183263#(<= ~counter~0 8)} assume !!(#t~post7 < 20);havoc #t~post7; {183263#(<= ~counter~0 8)} is VALID [2022-04-28 06:09:25,802 INFO L290 TraceCheckUtils]: 65: Hoare triple {183238#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {183263#(<= ~counter~0 8)} is VALID [2022-04-28 06:09:25,802 INFO L290 TraceCheckUtils]: 64: Hoare triple {183238#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {183238#(<= ~counter~0 7)} is VALID [2022-04-28 06:09:25,803 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {183031#true} {183238#(<= ~counter~0 7)} #96#return; {183238#(<= ~counter~0 7)} is VALID [2022-04-28 06:09:25,803 INFO L290 TraceCheckUtils]: 62: Hoare triple {183031#true} assume true; {183031#true} is VALID [2022-04-28 06:09:25,803 INFO L290 TraceCheckUtils]: 61: Hoare triple {183031#true} assume !(0 == ~cond); {183031#true} is VALID [2022-04-28 06:09:25,803 INFO L290 TraceCheckUtils]: 60: Hoare triple {183031#true} ~cond := #in~cond; {183031#true} is VALID [2022-04-28 06:09:25,803 INFO L272 TraceCheckUtils]: 59: Hoare triple {183238#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183031#true} is VALID [2022-04-28 06:09:25,803 INFO L290 TraceCheckUtils]: 58: Hoare triple {183238#(<= ~counter~0 7)} assume !!(#t~post7 < 20);havoc #t~post7; {183238#(<= ~counter~0 7)} is VALID [2022-04-28 06:09:25,805 INFO L290 TraceCheckUtils]: 57: Hoare triple {183213#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {183238#(<= ~counter~0 7)} is VALID [2022-04-28 06:09:25,805 INFO L290 TraceCheckUtils]: 56: Hoare triple {183213#(<= ~counter~0 6)} assume !!(0 != ~r~0); {183213#(<= ~counter~0 6)} is VALID [2022-04-28 06:09:25,806 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {183031#true} {183213#(<= ~counter~0 6)} #94#return; {183213#(<= ~counter~0 6)} is VALID [2022-04-28 06:09:25,806 INFO L290 TraceCheckUtils]: 54: Hoare triple {183031#true} assume true; {183031#true} is VALID [2022-04-28 06:09:25,806 INFO L290 TraceCheckUtils]: 53: Hoare triple {183031#true} assume !(0 == ~cond); {183031#true} is VALID [2022-04-28 06:09:25,806 INFO L290 TraceCheckUtils]: 52: Hoare triple {183031#true} ~cond := #in~cond; {183031#true} is VALID [2022-04-28 06:09:25,806 INFO L272 TraceCheckUtils]: 51: Hoare triple {183213#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183031#true} is VALID [2022-04-28 06:09:25,806 INFO L290 TraceCheckUtils]: 50: Hoare triple {183213#(<= ~counter~0 6)} assume !!(#t~post6 < 20);havoc #t~post6; {183213#(<= ~counter~0 6)} is VALID [2022-04-28 06:09:25,808 INFO L290 TraceCheckUtils]: 49: Hoare triple {183188#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {183213#(<= ~counter~0 6)} is VALID [2022-04-28 06:09:25,808 INFO L290 TraceCheckUtils]: 48: Hoare triple {183188#(<= ~counter~0 5)} assume !(~r~0 < 0); {183188#(<= ~counter~0 5)} is VALID [2022-04-28 06:09:25,809 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {183031#true} {183188#(<= ~counter~0 5)} #98#return; {183188#(<= ~counter~0 5)} is VALID [2022-04-28 06:09:25,809 INFO L290 TraceCheckUtils]: 46: Hoare triple {183031#true} assume true; {183031#true} is VALID [2022-04-28 06:09:25,809 INFO L290 TraceCheckUtils]: 45: Hoare triple {183031#true} assume !(0 == ~cond); {183031#true} is VALID [2022-04-28 06:09:25,809 INFO L290 TraceCheckUtils]: 44: Hoare triple {183031#true} ~cond := #in~cond; {183031#true} is VALID [2022-04-28 06:09:25,809 INFO L272 TraceCheckUtils]: 43: Hoare triple {183188#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183031#true} is VALID [2022-04-28 06:09:25,809 INFO L290 TraceCheckUtils]: 42: Hoare triple {183188#(<= ~counter~0 5)} assume !!(#t~post8 < 20);havoc #t~post8; {183188#(<= ~counter~0 5)} is VALID [2022-04-28 06:09:25,811 INFO L290 TraceCheckUtils]: 41: Hoare triple {183163#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {183188#(<= ~counter~0 5)} is VALID [2022-04-28 06:09:25,811 INFO L290 TraceCheckUtils]: 40: Hoare triple {183163#(<= ~counter~0 4)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {183163#(<= ~counter~0 4)} is VALID [2022-04-28 06:09:25,812 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {183031#true} {183163#(<= ~counter~0 4)} #98#return; {183163#(<= ~counter~0 4)} is VALID [2022-04-28 06:09:25,812 INFO L290 TraceCheckUtils]: 38: Hoare triple {183031#true} assume true; {183031#true} is VALID [2022-04-28 06:09:25,812 INFO L290 TraceCheckUtils]: 37: Hoare triple {183031#true} assume !(0 == ~cond); {183031#true} is VALID [2022-04-28 06:09:25,812 INFO L290 TraceCheckUtils]: 36: Hoare triple {183031#true} ~cond := #in~cond; {183031#true} is VALID [2022-04-28 06:09:25,812 INFO L272 TraceCheckUtils]: 35: Hoare triple {183163#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183031#true} is VALID [2022-04-28 06:09:25,812 INFO L290 TraceCheckUtils]: 34: Hoare triple {183163#(<= ~counter~0 4)} assume !!(#t~post8 < 20);havoc #t~post8; {183163#(<= ~counter~0 4)} is VALID [2022-04-28 06:09:25,814 INFO L290 TraceCheckUtils]: 33: Hoare triple {183138#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {183163#(<= ~counter~0 4)} is VALID [2022-04-28 06:09:25,814 INFO L290 TraceCheckUtils]: 32: Hoare triple {183138#(<= ~counter~0 3)} assume !(~r~0 > 0); {183138#(<= ~counter~0 3)} is VALID [2022-04-28 06:09:25,815 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {183031#true} {183138#(<= ~counter~0 3)} #96#return; {183138#(<= ~counter~0 3)} is VALID [2022-04-28 06:09:25,815 INFO L290 TraceCheckUtils]: 30: Hoare triple {183031#true} assume true; {183031#true} is VALID [2022-04-28 06:09:25,815 INFO L290 TraceCheckUtils]: 29: Hoare triple {183031#true} assume !(0 == ~cond); {183031#true} is VALID [2022-04-28 06:09:25,815 INFO L290 TraceCheckUtils]: 28: Hoare triple {183031#true} ~cond := #in~cond; {183031#true} is VALID [2022-04-28 06:09:25,815 INFO L272 TraceCheckUtils]: 27: Hoare triple {183138#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183031#true} is VALID [2022-04-28 06:09:25,815 INFO L290 TraceCheckUtils]: 26: Hoare triple {183138#(<= ~counter~0 3)} assume !!(#t~post7 < 20);havoc #t~post7; {183138#(<= ~counter~0 3)} is VALID [2022-04-28 06:09:25,817 INFO L290 TraceCheckUtils]: 25: Hoare triple {183113#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {183138#(<= ~counter~0 3)} is VALID [2022-04-28 06:09:25,817 INFO L290 TraceCheckUtils]: 24: Hoare triple {183113#(<= ~counter~0 2)} assume !!(0 != ~r~0); {183113#(<= ~counter~0 2)} is VALID [2022-04-28 06:09:25,818 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {183031#true} {183113#(<= ~counter~0 2)} #94#return; {183113#(<= ~counter~0 2)} is VALID [2022-04-28 06:09:25,818 INFO L290 TraceCheckUtils]: 22: Hoare triple {183031#true} assume true; {183031#true} is VALID [2022-04-28 06:09:25,818 INFO L290 TraceCheckUtils]: 21: Hoare triple {183031#true} assume !(0 == ~cond); {183031#true} is VALID [2022-04-28 06:09:25,818 INFO L290 TraceCheckUtils]: 20: Hoare triple {183031#true} ~cond := #in~cond; {183031#true} is VALID [2022-04-28 06:09:25,818 INFO L272 TraceCheckUtils]: 19: Hoare triple {183113#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183031#true} is VALID [2022-04-28 06:09:25,818 INFO L290 TraceCheckUtils]: 18: Hoare triple {183113#(<= ~counter~0 2)} assume !!(#t~post6 < 20);havoc #t~post6; {183113#(<= ~counter~0 2)} is VALID [2022-04-28 06:09:25,820 INFO L290 TraceCheckUtils]: 17: Hoare triple {183088#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {183113#(<= ~counter~0 2)} is VALID [2022-04-28 06:09:25,820 INFO L290 TraceCheckUtils]: 16: Hoare triple {183088#(<= ~counter~0 1)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {183088#(<= ~counter~0 1)} is VALID [2022-04-28 06:09:25,820 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {183031#true} {183088#(<= ~counter~0 1)} #92#return; {183088#(<= ~counter~0 1)} is VALID [2022-04-28 06:09:25,820 INFO L290 TraceCheckUtils]: 14: Hoare triple {183031#true} assume true; {183031#true} is VALID [2022-04-28 06:09:25,820 INFO L290 TraceCheckUtils]: 13: Hoare triple {183031#true} assume !(0 == ~cond); {183031#true} is VALID [2022-04-28 06:09:25,820 INFO L290 TraceCheckUtils]: 12: Hoare triple {183031#true} ~cond := #in~cond; {183031#true} is VALID [2022-04-28 06:09:25,821 INFO L272 TraceCheckUtils]: 11: Hoare triple {183088#(<= ~counter~0 1)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {183031#true} is VALID [2022-04-28 06:09:25,821 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {183031#true} {183088#(<= ~counter~0 1)} #90#return; {183088#(<= ~counter~0 1)} is VALID [2022-04-28 06:09:25,821 INFO L290 TraceCheckUtils]: 9: Hoare triple {183031#true} assume true; {183031#true} is VALID [2022-04-28 06:09:25,821 INFO L290 TraceCheckUtils]: 8: Hoare triple {183031#true} assume !(0 == ~cond); {183031#true} is VALID [2022-04-28 06:09:25,821 INFO L290 TraceCheckUtils]: 7: Hoare triple {183031#true} ~cond := #in~cond; {183031#true} is VALID [2022-04-28 06:09:25,821 INFO L272 TraceCheckUtils]: 6: Hoare triple {183088#(<= ~counter~0 1)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {183031#true} is VALID [2022-04-28 06:09:25,821 INFO L290 TraceCheckUtils]: 5: Hoare triple {183088#(<= ~counter~0 1)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {183088#(<= ~counter~0 1)} is VALID [2022-04-28 06:09:25,822 INFO L272 TraceCheckUtils]: 4: Hoare triple {183088#(<= ~counter~0 1)} call #t~ret9 := main(); {183088#(<= ~counter~0 1)} is VALID [2022-04-28 06:09:25,822 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {183088#(<= ~counter~0 1)} {183031#true} #102#return; {183088#(<= ~counter~0 1)} is VALID [2022-04-28 06:09:25,822 INFO L290 TraceCheckUtils]: 2: Hoare triple {183088#(<= ~counter~0 1)} assume true; {183088#(<= ~counter~0 1)} is VALID [2022-04-28 06:09:25,823 INFO L290 TraceCheckUtils]: 1: Hoare triple {183031#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {183088#(<= ~counter~0 1)} is VALID [2022-04-28 06:09:25,823 INFO L272 TraceCheckUtils]: 0: Hoare triple {183031#true} call ULTIMATE.init(); {183031#true} is VALID [2022-04-28 06:09:25,823 INFO L134 CoverageAnalysis]: Checked inductivity of 874 backedges. 36 proven. 222 refuted. 0 times theorem prover too weak. 616 trivial. 0 not checked. [2022-04-28 06:09:25,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:09:25,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397001529] [2022-04-28 06:09:25,823 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:09:25,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [707961779] [2022-04-28 06:09:25,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [707961779] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 06:09:25,823 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 06:09:25,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 24 [2022-04-28 06:09:25,823 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:09:25,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1853839990] [2022-04-28 06:09:25,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1853839990] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:09:25,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:09:25,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-28 06:09:25,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583850623] [2022-04-28 06:09:25,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:09:25,824 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 5.454545454545454) internal successors, (120), 21 states have internal predecessors, (120), 21 states have call successors, (23), 21 states have call predecessors, (23), 19 states have return successors, (21), 19 states have call predecessors, (21), 20 states have call successors, (21) Word has length 167 [2022-04-28 06:09:25,824 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:09:25,824 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 5.454545454545454) internal successors, (120), 21 states have internal predecessors, (120), 21 states have call successors, (23), 21 states have call predecessors, (23), 19 states have return successors, (21), 19 states have call predecessors, (21), 20 states have call successors, (21) [2022-04-28 06:09:26,084 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 164 edges. 164 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:09:26,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-28 06:09:26,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:09:26,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-28 06:09:26,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-28 06:09:26,084 INFO L87 Difference]: Start difference. First operand 907 states and 1204 transitions. Second operand has 22 states, 22 states have (on average 5.454545454545454) internal successors, (120), 21 states have internal predecessors, (120), 21 states have call successors, (23), 21 states have call predecessors, (23), 19 states have return successors, (21), 19 states have call predecessors, (21), 20 states have call successors, (21) [2022-04-28 06:09:33,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:09:33,070 INFO L93 Difference]: Finished difference Result 958 states and 1274 transitions. [2022-04-28 06:09:33,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-04-28 06:09:33,070 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 5.454545454545454) internal successors, (120), 21 states have internal predecessors, (120), 21 states have call successors, (23), 21 states have call predecessors, (23), 19 states have return successors, (21), 19 states have call predecessors, (21), 20 states have call successors, (21) Word has length 167 [2022-04-28 06:09:33,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:09:33,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 5.454545454545454) internal successors, (120), 21 states have internal predecessors, (120), 21 states have call successors, (23), 21 states have call predecessors, (23), 19 states have return successors, (21), 19 states have call predecessors, (21), 20 states have call successors, (21) [2022-04-28 06:09:33,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 374 transitions. [2022-04-28 06:09:33,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 5.454545454545454) internal successors, (120), 21 states have internal predecessors, (120), 21 states have call successors, (23), 21 states have call predecessors, (23), 19 states have return successors, (21), 19 states have call predecessors, (21), 20 states have call successors, (21) [2022-04-28 06:09:33,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 374 transitions. [2022-04-28 06:09:33,075 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 374 transitions. [2022-04-28 06:09:33,584 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 374 edges. 374 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:09:33,623 INFO L225 Difference]: With dead ends: 958 [2022-04-28 06:09:33,623 INFO L226 Difference]: Without dead ends: 953 [2022-04-28 06:09:33,623 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 310 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=539, Invalid=943, Unknown=0, NotChecked=0, Total=1482 [2022-04-28 06:09:33,624 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 344 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 339 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 339 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-28 06:09:33,624 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 388 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [339 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-28 06:09:33,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2022-04-28 06:09:37,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 931. [2022-04-28 06:09:37,285 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:09:37,286 INFO L82 GeneralOperation]: Start isEquivalent. First operand 953 states. Second operand has 931 states, 693 states have (on average 1.1746031746031746) internal successors, (814), 710 states have internal predecessors, (814), 215 states have call successors, (215), 24 states have call predecessors, (215), 22 states have return successors, (213), 196 states have call predecessors, (213), 213 states have call successors, (213) [2022-04-28 06:09:37,287 INFO L74 IsIncluded]: Start isIncluded. First operand 953 states. Second operand has 931 states, 693 states have (on average 1.1746031746031746) internal successors, (814), 710 states have internal predecessors, (814), 215 states have call successors, (215), 24 states have call predecessors, (215), 22 states have return successors, (213), 196 states have call predecessors, (213), 213 states have call successors, (213) [2022-04-28 06:09:37,287 INFO L87 Difference]: Start difference. First operand 953 states. Second operand has 931 states, 693 states have (on average 1.1746031746031746) internal successors, (814), 710 states have internal predecessors, (814), 215 states have call successors, (215), 24 states have call predecessors, (215), 22 states have return successors, (213), 196 states have call predecessors, (213), 213 states have call successors, (213) [2022-04-28 06:09:37,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:09:37,314 INFO L93 Difference]: Finished difference Result 953 states and 1268 transitions. [2022-04-28 06:09:37,314 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1268 transitions. [2022-04-28 06:09:37,315 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:09:37,315 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:09:37,315 INFO L74 IsIncluded]: Start isIncluded. First operand has 931 states, 693 states have (on average 1.1746031746031746) internal successors, (814), 710 states have internal predecessors, (814), 215 states have call successors, (215), 24 states have call predecessors, (215), 22 states have return successors, (213), 196 states have call predecessors, (213), 213 states have call successors, (213) Second operand 953 states. [2022-04-28 06:09:37,316 INFO L87 Difference]: Start difference. First operand has 931 states, 693 states have (on average 1.1746031746031746) internal successors, (814), 710 states have internal predecessors, (814), 215 states have call successors, (215), 24 states have call predecessors, (215), 22 states have return successors, (213), 196 states have call predecessors, (213), 213 states have call successors, (213) Second operand 953 states. [2022-04-28 06:09:37,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:09:37,343 INFO L93 Difference]: Finished difference Result 953 states and 1268 transitions. [2022-04-28 06:09:37,343 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1268 transitions. [2022-04-28 06:09:37,344 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:09:37,344 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:09:37,344 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:09:37,344 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:09:37,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 931 states, 693 states have (on average 1.1746031746031746) internal successors, (814), 710 states have internal predecessors, (814), 215 states have call successors, (215), 24 states have call predecessors, (215), 22 states have return successors, (213), 196 states have call predecessors, (213), 213 states have call successors, (213) [2022-04-28 06:09:37,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1242 transitions. [2022-04-28 06:09:37,387 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1242 transitions. Word has length 167 [2022-04-28 06:09:37,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:09:37,387 INFO L495 AbstractCegarLoop]: Abstraction has 931 states and 1242 transitions. [2022-04-28 06:09:37,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 5.454545454545454) internal successors, (120), 21 states have internal predecessors, (120), 21 states have call successors, (23), 21 states have call predecessors, (23), 19 states have return successors, (21), 19 states have call predecessors, (21), 20 states have call successors, (21) [2022-04-28 06:09:37,387 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 931 states and 1242 transitions. [2022-04-28 06:09:52,056 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1242 edges. 1240 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 06:09:52,056 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1242 transitions. [2022-04-28 06:09:52,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-04-28 06:09:52,058 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:09:52,058 INFO L195 NwaCegarLoop]: trace histogram [19, 18, 18, 10, 10, 10, 10, 7, 6, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:09:52,078 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Forceful destruction successful, exit code 0 [2022-04-28 06:09:52,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 59 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable57 [2022-04-28 06:09:52,258 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:09:52,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:09:52,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1993951238, now seen corresponding path program 31 times [2022-04-28 06:09:52,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:09:52,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [167487689] [2022-04-28 06:09:52,259 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 06:09:52,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1993951238, now seen corresponding path program 32 times [2022-04-28 06:09:52,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:09:52,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820046045] [2022-04-28 06:09:52,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:09:52,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:09:52,273 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:09:52,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [519110615] [2022-04-28 06:09:52,274 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 06:09:52,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:09:52,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:09:52,277 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:09:52,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Waiting until timeout for monitored process [2022-04-28 06:09:52,349 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 06:09:52,349 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:09:52,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-28 06:09:52,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:09:52,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:09:53,333 INFO L272 TraceCheckUtils]: 0: Hoare triple {189770#true} call ULTIMATE.init(); {189770#true} is VALID [2022-04-28 06:09:53,333 INFO L290 TraceCheckUtils]: 1: Hoare triple {189770#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {189778#(<= ~counter~0 0)} is VALID [2022-04-28 06:09:53,333 INFO L290 TraceCheckUtils]: 2: Hoare triple {189778#(<= ~counter~0 0)} assume true; {189778#(<= ~counter~0 0)} is VALID [2022-04-28 06:09:53,334 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {189778#(<= ~counter~0 0)} {189770#true} #102#return; {189778#(<= ~counter~0 0)} is VALID [2022-04-28 06:09:53,334 INFO L272 TraceCheckUtils]: 4: Hoare triple {189778#(<= ~counter~0 0)} call #t~ret9 := main(); {189778#(<= ~counter~0 0)} is VALID [2022-04-28 06:09:53,334 INFO L290 TraceCheckUtils]: 5: Hoare triple {189778#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {189778#(<= ~counter~0 0)} is VALID [2022-04-28 06:09:53,335 INFO L272 TraceCheckUtils]: 6: Hoare triple {189778#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {189778#(<= ~counter~0 0)} is VALID [2022-04-28 06:09:53,335 INFO L290 TraceCheckUtils]: 7: Hoare triple {189778#(<= ~counter~0 0)} ~cond := #in~cond; {189778#(<= ~counter~0 0)} is VALID [2022-04-28 06:09:53,335 INFO L290 TraceCheckUtils]: 8: Hoare triple {189778#(<= ~counter~0 0)} assume !(0 == ~cond); {189778#(<= ~counter~0 0)} is VALID [2022-04-28 06:09:53,335 INFO L290 TraceCheckUtils]: 9: Hoare triple {189778#(<= ~counter~0 0)} assume true; {189778#(<= ~counter~0 0)} is VALID [2022-04-28 06:09:53,336 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {189778#(<= ~counter~0 0)} {189778#(<= ~counter~0 0)} #90#return; {189778#(<= ~counter~0 0)} is VALID [2022-04-28 06:09:53,336 INFO L272 TraceCheckUtils]: 11: Hoare triple {189778#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {189778#(<= ~counter~0 0)} is VALID [2022-04-28 06:09:53,336 INFO L290 TraceCheckUtils]: 12: Hoare triple {189778#(<= ~counter~0 0)} ~cond := #in~cond; {189778#(<= ~counter~0 0)} is VALID [2022-04-28 06:09:53,337 INFO L290 TraceCheckUtils]: 13: Hoare triple {189778#(<= ~counter~0 0)} assume !(0 == ~cond); {189778#(<= ~counter~0 0)} is VALID [2022-04-28 06:09:53,337 INFO L290 TraceCheckUtils]: 14: Hoare triple {189778#(<= ~counter~0 0)} assume true; {189778#(<= ~counter~0 0)} is VALID [2022-04-28 06:09:53,337 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {189778#(<= ~counter~0 0)} {189778#(<= ~counter~0 0)} #92#return; {189778#(<= ~counter~0 0)} is VALID [2022-04-28 06:09:53,338 INFO L290 TraceCheckUtils]: 16: Hoare triple {189778#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {189778#(<= ~counter~0 0)} is VALID [2022-04-28 06:09:53,341 INFO L290 TraceCheckUtils]: 17: Hoare triple {189778#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {189827#(<= ~counter~0 1)} is VALID [2022-04-28 06:09:53,342 INFO L290 TraceCheckUtils]: 18: Hoare triple {189827#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {189827#(<= ~counter~0 1)} is VALID [2022-04-28 06:09:53,342 INFO L272 TraceCheckUtils]: 19: Hoare triple {189827#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {189827#(<= ~counter~0 1)} is VALID [2022-04-28 06:09:53,342 INFO L290 TraceCheckUtils]: 20: Hoare triple {189827#(<= ~counter~0 1)} ~cond := #in~cond; {189827#(<= ~counter~0 1)} is VALID [2022-04-28 06:09:53,343 INFO L290 TraceCheckUtils]: 21: Hoare triple {189827#(<= ~counter~0 1)} assume !(0 == ~cond); {189827#(<= ~counter~0 1)} is VALID [2022-04-28 06:09:53,343 INFO L290 TraceCheckUtils]: 22: Hoare triple {189827#(<= ~counter~0 1)} assume true; {189827#(<= ~counter~0 1)} is VALID [2022-04-28 06:09:53,343 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {189827#(<= ~counter~0 1)} {189827#(<= ~counter~0 1)} #94#return; {189827#(<= ~counter~0 1)} is VALID [2022-04-28 06:09:53,344 INFO L290 TraceCheckUtils]: 24: Hoare triple {189827#(<= ~counter~0 1)} assume !!(0 != ~r~0); {189827#(<= ~counter~0 1)} is VALID [2022-04-28 06:09:53,345 INFO L290 TraceCheckUtils]: 25: Hoare triple {189827#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {189852#(<= ~counter~0 2)} is VALID [2022-04-28 06:09:53,346 INFO L290 TraceCheckUtils]: 26: Hoare triple {189852#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {189852#(<= ~counter~0 2)} is VALID [2022-04-28 06:09:53,346 INFO L272 TraceCheckUtils]: 27: Hoare triple {189852#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {189852#(<= ~counter~0 2)} is VALID [2022-04-28 06:09:53,346 INFO L290 TraceCheckUtils]: 28: Hoare triple {189852#(<= ~counter~0 2)} ~cond := #in~cond; {189852#(<= ~counter~0 2)} is VALID [2022-04-28 06:09:53,347 INFO L290 TraceCheckUtils]: 29: Hoare triple {189852#(<= ~counter~0 2)} assume !(0 == ~cond); {189852#(<= ~counter~0 2)} is VALID [2022-04-28 06:09:53,347 INFO L290 TraceCheckUtils]: 30: Hoare triple {189852#(<= ~counter~0 2)} assume true; {189852#(<= ~counter~0 2)} is VALID [2022-04-28 06:09:53,347 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {189852#(<= ~counter~0 2)} {189852#(<= ~counter~0 2)} #96#return; {189852#(<= ~counter~0 2)} is VALID [2022-04-28 06:09:53,348 INFO L290 TraceCheckUtils]: 32: Hoare triple {189852#(<= ~counter~0 2)} assume !(~r~0 > 0); {189852#(<= ~counter~0 2)} is VALID [2022-04-28 06:09:53,349 INFO L290 TraceCheckUtils]: 33: Hoare triple {189852#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {189877#(<= ~counter~0 3)} is VALID [2022-04-28 06:09:53,349 INFO L290 TraceCheckUtils]: 34: Hoare triple {189877#(<= ~counter~0 3)} assume !!(#t~post8 < 20);havoc #t~post8; {189877#(<= ~counter~0 3)} is VALID [2022-04-28 06:09:53,350 INFO L272 TraceCheckUtils]: 35: Hoare triple {189877#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {189877#(<= ~counter~0 3)} is VALID [2022-04-28 06:09:53,350 INFO L290 TraceCheckUtils]: 36: Hoare triple {189877#(<= ~counter~0 3)} ~cond := #in~cond; {189877#(<= ~counter~0 3)} is VALID [2022-04-28 06:09:53,350 INFO L290 TraceCheckUtils]: 37: Hoare triple {189877#(<= ~counter~0 3)} assume !(0 == ~cond); {189877#(<= ~counter~0 3)} is VALID [2022-04-28 06:09:53,351 INFO L290 TraceCheckUtils]: 38: Hoare triple {189877#(<= ~counter~0 3)} assume true; {189877#(<= ~counter~0 3)} is VALID [2022-04-28 06:09:53,351 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {189877#(<= ~counter~0 3)} {189877#(<= ~counter~0 3)} #98#return; {189877#(<= ~counter~0 3)} is VALID [2022-04-28 06:09:53,351 INFO L290 TraceCheckUtils]: 40: Hoare triple {189877#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {189877#(<= ~counter~0 3)} is VALID [2022-04-28 06:09:53,353 INFO L290 TraceCheckUtils]: 41: Hoare triple {189877#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {189902#(<= ~counter~0 4)} is VALID [2022-04-28 06:09:53,353 INFO L290 TraceCheckUtils]: 42: Hoare triple {189902#(<= ~counter~0 4)} assume !!(#t~post8 < 20);havoc #t~post8; {189902#(<= ~counter~0 4)} is VALID [2022-04-28 06:09:53,354 INFO L272 TraceCheckUtils]: 43: Hoare triple {189902#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {189902#(<= ~counter~0 4)} is VALID [2022-04-28 06:09:53,354 INFO L290 TraceCheckUtils]: 44: Hoare triple {189902#(<= ~counter~0 4)} ~cond := #in~cond; {189902#(<= ~counter~0 4)} is VALID [2022-04-28 06:09:53,354 INFO L290 TraceCheckUtils]: 45: Hoare triple {189902#(<= ~counter~0 4)} assume !(0 == ~cond); {189902#(<= ~counter~0 4)} is VALID [2022-04-28 06:09:53,354 INFO L290 TraceCheckUtils]: 46: Hoare triple {189902#(<= ~counter~0 4)} assume true; {189902#(<= ~counter~0 4)} is VALID [2022-04-28 06:09:53,355 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {189902#(<= ~counter~0 4)} {189902#(<= ~counter~0 4)} #98#return; {189902#(<= ~counter~0 4)} is VALID [2022-04-28 06:09:53,355 INFO L290 TraceCheckUtils]: 48: Hoare triple {189902#(<= ~counter~0 4)} assume !(~r~0 < 0); {189902#(<= ~counter~0 4)} is VALID [2022-04-28 06:09:53,357 INFO L290 TraceCheckUtils]: 49: Hoare triple {189902#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {189927#(<= ~counter~0 5)} is VALID [2022-04-28 06:09:53,357 INFO L290 TraceCheckUtils]: 50: Hoare triple {189927#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {189927#(<= ~counter~0 5)} is VALID [2022-04-28 06:09:53,357 INFO L272 TraceCheckUtils]: 51: Hoare triple {189927#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {189927#(<= ~counter~0 5)} is VALID [2022-04-28 06:09:53,358 INFO L290 TraceCheckUtils]: 52: Hoare triple {189927#(<= ~counter~0 5)} ~cond := #in~cond; {189927#(<= ~counter~0 5)} is VALID [2022-04-28 06:09:53,358 INFO L290 TraceCheckUtils]: 53: Hoare triple {189927#(<= ~counter~0 5)} assume !(0 == ~cond); {189927#(<= ~counter~0 5)} is VALID [2022-04-28 06:09:53,358 INFO L290 TraceCheckUtils]: 54: Hoare triple {189927#(<= ~counter~0 5)} assume true; {189927#(<= ~counter~0 5)} is VALID [2022-04-28 06:09:53,359 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {189927#(<= ~counter~0 5)} {189927#(<= ~counter~0 5)} #94#return; {189927#(<= ~counter~0 5)} is VALID [2022-04-28 06:09:53,359 INFO L290 TraceCheckUtils]: 56: Hoare triple {189927#(<= ~counter~0 5)} assume !!(0 != ~r~0); {189927#(<= ~counter~0 5)} is VALID [2022-04-28 06:09:53,360 INFO L290 TraceCheckUtils]: 57: Hoare triple {189927#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {189952#(<= ~counter~0 6)} is VALID [2022-04-28 06:09:53,361 INFO L290 TraceCheckUtils]: 58: Hoare triple {189952#(<= ~counter~0 6)} assume !!(#t~post7 < 20);havoc #t~post7; {189952#(<= ~counter~0 6)} is VALID [2022-04-28 06:09:53,361 INFO L272 TraceCheckUtils]: 59: Hoare triple {189952#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {189952#(<= ~counter~0 6)} is VALID [2022-04-28 06:09:53,361 INFO L290 TraceCheckUtils]: 60: Hoare triple {189952#(<= ~counter~0 6)} ~cond := #in~cond; {189952#(<= ~counter~0 6)} is VALID [2022-04-28 06:09:53,362 INFO L290 TraceCheckUtils]: 61: Hoare triple {189952#(<= ~counter~0 6)} assume !(0 == ~cond); {189952#(<= ~counter~0 6)} is VALID [2022-04-28 06:09:53,362 INFO L290 TraceCheckUtils]: 62: Hoare triple {189952#(<= ~counter~0 6)} assume true; {189952#(<= ~counter~0 6)} is VALID [2022-04-28 06:09:53,362 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {189952#(<= ~counter~0 6)} {189952#(<= ~counter~0 6)} #96#return; {189952#(<= ~counter~0 6)} is VALID [2022-04-28 06:09:53,363 INFO L290 TraceCheckUtils]: 64: Hoare triple {189952#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {189952#(<= ~counter~0 6)} is VALID [2022-04-28 06:09:53,364 INFO L290 TraceCheckUtils]: 65: Hoare triple {189952#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {189977#(<= ~counter~0 7)} is VALID [2022-04-28 06:09:53,364 INFO L290 TraceCheckUtils]: 66: Hoare triple {189977#(<= ~counter~0 7)} assume !!(#t~post7 < 20);havoc #t~post7; {189977#(<= ~counter~0 7)} is VALID [2022-04-28 06:09:53,365 INFO L272 TraceCheckUtils]: 67: Hoare triple {189977#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {189977#(<= ~counter~0 7)} is VALID [2022-04-28 06:09:53,365 INFO L290 TraceCheckUtils]: 68: Hoare triple {189977#(<= ~counter~0 7)} ~cond := #in~cond; {189977#(<= ~counter~0 7)} is VALID [2022-04-28 06:09:53,365 INFO L290 TraceCheckUtils]: 69: Hoare triple {189977#(<= ~counter~0 7)} assume !(0 == ~cond); {189977#(<= ~counter~0 7)} is VALID [2022-04-28 06:09:53,365 INFO L290 TraceCheckUtils]: 70: Hoare triple {189977#(<= ~counter~0 7)} assume true; {189977#(<= ~counter~0 7)} is VALID [2022-04-28 06:09:53,366 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {189977#(<= ~counter~0 7)} {189977#(<= ~counter~0 7)} #96#return; {189977#(<= ~counter~0 7)} is VALID [2022-04-28 06:09:53,366 INFO L290 TraceCheckUtils]: 72: Hoare triple {189977#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {189977#(<= ~counter~0 7)} is VALID [2022-04-28 06:09:53,368 INFO L290 TraceCheckUtils]: 73: Hoare triple {189977#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {190002#(<= ~counter~0 8)} is VALID [2022-04-28 06:09:53,368 INFO L290 TraceCheckUtils]: 74: Hoare triple {190002#(<= ~counter~0 8)} assume !!(#t~post7 < 20);havoc #t~post7; {190002#(<= ~counter~0 8)} is VALID [2022-04-28 06:09:53,368 INFO L272 TraceCheckUtils]: 75: Hoare triple {190002#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {190002#(<= ~counter~0 8)} is VALID [2022-04-28 06:09:53,369 INFO L290 TraceCheckUtils]: 76: Hoare triple {190002#(<= ~counter~0 8)} ~cond := #in~cond; {190002#(<= ~counter~0 8)} is VALID [2022-04-28 06:09:53,369 INFO L290 TraceCheckUtils]: 77: Hoare triple {190002#(<= ~counter~0 8)} assume !(0 == ~cond); {190002#(<= ~counter~0 8)} is VALID [2022-04-28 06:09:53,369 INFO L290 TraceCheckUtils]: 78: Hoare triple {190002#(<= ~counter~0 8)} assume true; {190002#(<= ~counter~0 8)} is VALID [2022-04-28 06:09:53,370 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {190002#(<= ~counter~0 8)} {190002#(<= ~counter~0 8)} #96#return; {190002#(<= ~counter~0 8)} is VALID [2022-04-28 06:09:53,370 INFO L290 TraceCheckUtils]: 80: Hoare triple {190002#(<= ~counter~0 8)} assume !(~r~0 > 0); {190002#(<= ~counter~0 8)} is VALID [2022-04-28 06:09:53,371 INFO L290 TraceCheckUtils]: 81: Hoare triple {190002#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {190027#(<= ~counter~0 9)} is VALID [2022-04-28 06:09:53,372 INFO L290 TraceCheckUtils]: 82: Hoare triple {190027#(<= ~counter~0 9)} assume !!(#t~post8 < 20);havoc #t~post8; {190027#(<= ~counter~0 9)} is VALID [2022-04-28 06:09:53,372 INFO L272 TraceCheckUtils]: 83: Hoare triple {190027#(<= ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {190027#(<= ~counter~0 9)} is VALID [2022-04-28 06:09:53,372 INFO L290 TraceCheckUtils]: 84: Hoare triple {190027#(<= ~counter~0 9)} ~cond := #in~cond; {190027#(<= ~counter~0 9)} is VALID [2022-04-28 06:09:53,373 INFO L290 TraceCheckUtils]: 85: Hoare triple {190027#(<= ~counter~0 9)} assume !(0 == ~cond); {190027#(<= ~counter~0 9)} is VALID [2022-04-28 06:09:53,373 INFO L290 TraceCheckUtils]: 86: Hoare triple {190027#(<= ~counter~0 9)} assume true; {190027#(<= ~counter~0 9)} is VALID [2022-04-28 06:09:53,373 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {190027#(<= ~counter~0 9)} {190027#(<= ~counter~0 9)} #98#return; {190027#(<= ~counter~0 9)} is VALID [2022-04-28 06:09:53,374 INFO L290 TraceCheckUtils]: 88: Hoare triple {190027#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {190027#(<= ~counter~0 9)} is VALID [2022-04-28 06:09:53,375 INFO L290 TraceCheckUtils]: 89: Hoare triple {190027#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {190052#(<= ~counter~0 10)} is VALID [2022-04-28 06:09:53,375 INFO L290 TraceCheckUtils]: 90: Hoare triple {190052#(<= ~counter~0 10)} assume !!(#t~post8 < 20);havoc #t~post8; {190052#(<= ~counter~0 10)} is VALID [2022-04-28 06:09:53,376 INFO L272 TraceCheckUtils]: 91: Hoare triple {190052#(<= ~counter~0 10)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {190052#(<= ~counter~0 10)} is VALID [2022-04-28 06:09:53,376 INFO L290 TraceCheckUtils]: 92: Hoare triple {190052#(<= ~counter~0 10)} ~cond := #in~cond; {190052#(<= ~counter~0 10)} is VALID [2022-04-28 06:09:53,376 INFO L290 TraceCheckUtils]: 93: Hoare triple {190052#(<= ~counter~0 10)} assume !(0 == ~cond); {190052#(<= ~counter~0 10)} is VALID [2022-04-28 06:09:53,377 INFO L290 TraceCheckUtils]: 94: Hoare triple {190052#(<= ~counter~0 10)} assume true; {190052#(<= ~counter~0 10)} is VALID [2022-04-28 06:09:53,377 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {190052#(<= ~counter~0 10)} {190052#(<= ~counter~0 10)} #98#return; {190052#(<= ~counter~0 10)} is VALID [2022-04-28 06:09:53,377 INFO L290 TraceCheckUtils]: 96: Hoare triple {190052#(<= ~counter~0 10)} assume !(~r~0 < 0); {190052#(<= ~counter~0 10)} is VALID [2022-04-28 06:09:53,379 INFO L290 TraceCheckUtils]: 97: Hoare triple {190052#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {190077#(<= ~counter~0 11)} is VALID [2022-04-28 06:09:53,379 INFO L290 TraceCheckUtils]: 98: Hoare triple {190077#(<= ~counter~0 11)} assume !!(#t~post6 < 20);havoc #t~post6; {190077#(<= ~counter~0 11)} is VALID [2022-04-28 06:09:53,380 INFO L272 TraceCheckUtils]: 99: Hoare triple {190077#(<= ~counter~0 11)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {190077#(<= ~counter~0 11)} is VALID [2022-04-28 06:09:53,380 INFO L290 TraceCheckUtils]: 100: Hoare triple {190077#(<= ~counter~0 11)} ~cond := #in~cond; {190077#(<= ~counter~0 11)} is VALID [2022-04-28 06:09:53,380 INFO L290 TraceCheckUtils]: 101: Hoare triple {190077#(<= ~counter~0 11)} assume !(0 == ~cond); {190077#(<= ~counter~0 11)} is VALID [2022-04-28 06:09:53,380 INFO L290 TraceCheckUtils]: 102: Hoare triple {190077#(<= ~counter~0 11)} assume true; {190077#(<= ~counter~0 11)} is VALID [2022-04-28 06:09:53,381 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {190077#(<= ~counter~0 11)} {190077#(<= ~counter~0 11)} #94#return; {190077#(<= ~counter~0 11)} is VALID [2022-04-28 06:09:53,381 INFO L290 TraceCheckUtils]: 104: Hoare triple {190077#(<= ~counter~0 11)} assume !!(0 != ~r~0); {190077#(<= ~counter~0 11)} is VALID [2022-04-28 06:09:53,383 INFO L290 TraceCheckUtils]: 105: Hoare triple {190077#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {190102#(<= ~counter~0 12)} is VALID [2022-04-28 06:09:53,383 INFO L290 TraceCheckUtils]: 106: Hoare triple {190102#(<= ~counter~0 12)} assume !!(#t~post7 < 20);havoc #t~post7; {190102#(<= ~counter~0 12)} is VALID [2022-04-28 06:09:53,383 INFO L272 TraceCheckUtils]: 107: Hoare triple {190102#(<= ~counter~0 12)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {190102#(<= ~counter~0 12)} is VALID [2022-04-28 06:09:53,384 INFO L290 TraceCheckUtils]: 108: Hoare triple {190102#(<= ~counter~0 12)} ~cond := #in~cond; {190102#(<= ~counter~0 12)} is VALID [2022-04-28 06:09:53,384 INFO L290 TraceCheckUtils]: 109: Hoare triple {190102#(<= ~counter~0 12)} assume !(0 == ~cond); {190102#(<= ~counter~0 12)} is VALID [2022-04-28 06:09:53,384 INFO L290 TraceCheckUtils]: 110: Hoare triple {190102#(<= ~counter~0 12)} assume true; {190102#(<= ~counter~0 12)} is VALID [2022-04-28 06:09:53,385 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {190102#(<= ~counter~0 12)} {190102#(<= ~counter~0 12)} #96#return; {190102#(<= ~counter~0 12)} is VALID [2022-04-28 06:09:53,385 INFO L290 TraceCheckUtils]: 112: Hoare triple {190102#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {190102#(<= ~counter~0 12)} is VALID [2022-04-28 06:09:53,386 INFO L290 TraceCheckUtils]: 113: Hoare triple {190102#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {190127#(<= ~counter~0 13)} is VALID [2022-04-28 06:09:53,387 INFO L290 TraceCheckUtils]: 114: Hoare triple {190127#(<= ~counter~0 13)} assume !!(#t~post7 < 20);havoc #t~post7; {190127#(<= ~counter~0 13)} is VALID [2022-04-28 06:09:53,387 INFO L272 TraceCheckUtils]: 115: Hoare triple {190127#(<= ~counter~0 13)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {190127#(<= ~counter~0 13)} is VALID [2022-04-28 06:09:53,388 INFO L290 TraceCheckUtils]: 116: Hoare triple {190127#(<= ~counter~0 13)} ~cond := #in~cond; {190127#(<= ~counter~0 13)} is VALID [2022-04-28 06:09:53,388 INFO L290 TraceCheckUtils]: 117: Hoare triple {190127#(<= ~counter~0 13)} assume !(0 == ~cond); {190127#(<= ~counter~0 13)} is VALID [2022-04-28 06:09:53,388 INFO L290 TraceCheckUtils]: 118: Hoare triple {190127#(<= ~counter~0 13)} assume true; {190127#(<= ~counter~0 13)} is VALID [2022-04-28 06:09:53,388 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {190127#(<= ~counter~0 13)} {190127#(<= ~counter~0 13)} #96#return; {190127#(<= ~counter~0 13)} is VALID [2022-04-28 06:09:53,389 INFO L290 TraceCheckUtils]: 120: Hoare triple {190127#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {190127#(<= ~counter~0 13)} is VALID [2022-04-28 06:09:53,390 INFO L290 TraceCheckUtils]: 121: Hoare triple {190127#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {190152#(<= ~counter~0 14)} is VALID [2022-04-28 06:09:53,391 INFO L290 TraceCheckUtils]: 122: Hoare triple {190152#(<= ~counter~0 14)} assume !!(#t~post7 < 20);havoc #t~post7; {190152#(<= ~counter~0 14)} is VALID [2022-04-28 06:09:53,391 INFO L272 TraceCheckUtils]: 123: Hoare triple {190152#(<= ~counter~0 14)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {190152#(<= ~counter~0 14)} is VALID [2022-04-28 06:09:53,391 INFO L290 TraceCheckUtils]: 124: Hoare triple {190152#(<= ~counter~0 14)} ~cond := #in~cond; {190152#(<= ~counter~0 14)} is VALID [2022-04-28 06:09:53,392 INFO L290 TraceCheckUtils]: 125: Hoare triple {190152#(<= ~counter~0 14)} assume !(0 == ~cond); {190152#(<= ~counter~0 14)} is VALID [2022-04-28 06:09:53,392 INFO L290 TraceCheckUtils]: 126: Hoare triple {190152#(<= ~counter~0 14)} assume true; {190152#(<= ~counter~0 14)} is VALID [2022-04-28 06:09:53,392 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {190152#(<= ~counter~0 14)} {190152#(<= ~counter~0 14)} #96#return; {190152#(<= ~counter~0 14)} is VALID [2022-04-28 06:09:53,392 INFO L290 TraceCheckUtils]: 128: Hoare triple {190152#(<= ~counter~0 14)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {190152#(<= ~counter~0 14)} is VALID [2022-04-28 06:09:53,394 INFO L290 TraceCheckUtils]: 129: Hoare triple {190152#(<= ~counter~0 14)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {190177#(<= ~counter~0 15)} is VALID [2022-04-28 06:09:53,394 INFO L290 TraceCheckUtils]: 130: Hoare triple {190177#(<= ~counter~0 15)} assume !!(#t~post7 < 20);havoc #t~post7; {190177#(<= ~counter~0 15)} is VALID [2022-04-28 06:09:53,395 INFO L272 TraceCheckUtils]: 131: Hoare triple {190177#(<= ~counter~0 15)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {190177#(<= ~counter~0 15)} is VALID [2022-04-28 06:09:53,395 INFO L290 TraceCheckUtils]: 132: Hoare triple {190177#(<= ~counter~0 15)} ~cond := #in~cond; {190177#(<= ~counter~0 15)} is VALID [2022-04-28 06:09:53,395 INFO L290 TraceCheckUtils]: 133: Hoare triple {190177#(<= ~counter~0 15)} assume !(0 == ~cond); {190177#(<= ~counter~0 15)} is VALID [2022-04-28 06:09:53,396 INFO L290 TraceCheckUtils]: 134: Hoare triple {190177#(<= ~counter~0 15)} assume true; {190177#(<= ~counter~0 15)} is VALID [2022-04-28 06:09:53,396 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {190177#(<= ~counter~0 15)} {190177#(<= ~counter~0 15)} #96#return; {190177#(<= ~counter~0 15)} is VALID [2022-04-28 06:09:53,396 INFO L290 TraceCheckUtils]: 136: Hoare triple {190177#(<= ~counter~0 15)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {190177#(<= ~counter~0 15)} is VALID [2022-04-28 06:09:53,398 INFO L290 TraceCheckUtils]: 137: Hoare triple {190177#(<= ~counter~0 15)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {190202#(<= ~counter~0 16)} is VALID [2022-04-28 06:09:53,398 INFO L290 TraceCheckUtils]: 138: Hoare triple {190202#(<= ~counter~0 16)} assume !!(#t~post7 < 20);havoc #t~post7; {190202#(<= ~counter~0 16)} is VALID [2022-04-28 06:09:53,399 INFO L272 TraceCheckUtils]: 139: Hoare triple {190202#(<= ~counter~0 16)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {190202#(<= ~counter~0 16)} is VALID [2022-04-28 06:09:53,399 INFO L290 TraceCheckUtils]: 140: Hoare triple {190202#(<= ~counter~0 16)} ~cond := #in~cond; {190202#(<= ~counter~0 16)} is VALID [2022-04-28 06:09:53,399 INFO L290 TraceCheckUtils]: 141: Hoare triple {190202#(<= ~counter~0 16)} assume !(0 == ~cond); {190202#(<= ~counter~0 16)} is VALID [2022-04-28 06:09:53,399 INFO L290 TraceCheckUtils]: 142: Hoare triple {190202#(<= ~counter~0 16)} assume true; {190202#(<= ~counter~0 16)} is VALID [2022-04-28 06:09:53,400 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {190202#(<= ~counter~0 16)} {190202#(<= ~counter~0 16)} #96#return; {190202#(<= ~counter~0 16)} is VALID [2022-04-28 06:09:53,400 INFO L290 TraceCheckUtils]: 144: Hoare triple {190202#(<= ~counter~0 16)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {190202#(<= ~counter~0 16)} is VALID [2022-04-28 06:09:53,402 INFO L290 TraceCheckUtils]: 145: Hoare triple {190202#(<= ~counter~0 16)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {190227#(<= ~counter~0 17)} is VALID [2022-04-28 06:09:53,402 INFO L290 TraceCheckUtils]: 146: Hoare triple {190227#(<= ~counter~0 17)} assume !!(#t~post7 < 20);havoc #t~post7; {190227#(<= ~counter~0 17)} is VALID [2022-04-28 06:09:53,402 INFO L272 TraceCheckUtils]: 147: Hoare triple {190227#(<= ~counter~0 17)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {190227#(<= ~counter~0 17)} is VALID [2022-04-28 06:09:53,403 INFO L290 TraceCheckUtils]: 148: Hoare triple {190227#(<= ~counter~0 17)} ~cond := #in~cond; {190227#(<= ~counter~0 17)} is VALID [2022-04-28 06:09:53,403 INFO L290 TraceCheckUtils]: 149: Hoare triple {190227#(<= ~counter~0 17)} assume !(0 == ~cond); {190227#(<= ~counter~0 17)} is VALID [2022-04-28 06:09:53,403 INFO L290 TraceCheckUtils]: 150: Hoare triple {190227#(<= ~counter~0 17)} assume true; {190227#(<= ~counter~0 17)} is VALID [2022-04-28 06:09:53,404 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {190227#(<= ~counter~0 17)} {190227#(<= ~counter~0 17)} #96#return; {190227#(<= ~counter~0 17)} is VALID [2022-04-28 06:09:53,404 INFO L290 TraceCheckUtils]: 152: Hoare triple {190227#(<= ~counter~0 17)} assume !(~r~0 > 0); {190227#(<= ~counter~0 17)} is VALID [2022-04-28 06:09:53,406 INFO L290 TraceCheckUtils]: 153: Hoare triple {190227#(<= ~counter~0 17)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {190252#(<= ~counter~0 18)} is VALID [2022-04-28 06:09:53,406 INFO L290 TraceCheckUtils]: 154: Hoare triple {190252#(<= ~counter~0 18)} assume !!(#t~post8 < 20);havoc #t~post8; {190252#(<= ~counter~0 18)} is VALID [2022-04-28 06:09:53,406 INFO L272 TraceCheckUtils]: 155: Hoare triple {190252#(<= ~counter~0 18)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {190252#(<= ~counter~0 18)} is VALID [2022-04-28 06:09:53,407 INFO L290 TraceCheckUtils]: 156: Hoare triple {190252#(<= ~counter~0 18)} ~cond := #in~cond; {190252#(<= ~counter~0 18)} is VALID [2022-04-28 06:09:53,407 INFO L290 TraceCheckUtils]: 157: Hoare triple {190252#(<= ~counter~0 18)} assume !(0 == ~cond); {190252#(<= ~counter~0 18)} is VALID [2022-04-28 06:09:53,407 INFO L290 TraceCheckUtils]: 158: Hoare triple {190252#(<= ~counter~0 18)} assume true; {190252#(<= ~counter~0 18)} is VALID [2022-04-28 06:09:53,408 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {190252#(<= ~counter~0 18)} {190252#(<= ~counter~0 18)} #98#return; {190252#(<= ~counter~0 18)} is VALID [2022-04-28 06:09:53,408 INFO L290 TraceCheckUtils]: 160: Hoare triple {190252#(<= ~counter~0 18)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {190252#(<= ~counter~0 18)} is VALID [2022-04-28 06:09:53,408 INFO L290 TraceCheckUtils]: 161: Hoare triple {190252#(<= ~counter~0 18)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {190277#(<= |main_#t~post8| 18)} is VALID [2022-04-28 06:09:53,409 INFO L290 TraceCheckUtils]: 162: Hoare triple {190277#(<= |main_#t~post8| 18)} assume !(#t~post8 < 20);havoc #t~post8; {189771#false} is VALID [2022-04-28 06:09:53,409 INFO L290 TraceCheckUtils]: 163: Hoare triple {189771#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {189771#false} is VALID [2022-04-28 06:09:53,409 INFO L290 TraceCheckUtils]: 164: Hoare triple {189771#false} assume !(#t~post6 < 20);havoc #t~post6; {189771#false} is VALID [2022-04-28 06:09:53,409 INFO L272 TraceCheckUtils]: 165: Hoare triple {189771#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {189771#false} is VALID [2022-04-28 06:09:53,409 INFO L290 TraceCheckUtils]: 166: Hoare triple {189771#false} ~cond := #in~cond; {189771#false} is VALID [2022-04-28 06:09:53,409 INFO L290 TraceCheckUtils]: 167: Hoare triple {189771#false} assume 0 == ~cond; {189771#false} is VALID [2022-04-28 06:09:53,409 INFO L290 TraceCheckUtils]: 168: Hoare triple {189771#false} assume !false; {189771#false} is VALID [2022-04-28 06:09:53,409 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 42 proven. 854 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 06:09:53,409 INFO L328 TraceCheckSpWp]: Computing backward predicates...